Matrix Algebra

Theory, Advanced Operations, and Real-World Applications

Submitted by:

Name: Subham Sarkar

Roll Number: 47
Department: Bachelor of Computer Application (BCA)
College: Guru Nanak Institute Of Technology
Kolkata, West Bengal

January 27, 2026

Contents

1 Introduction 1

2 Types of Matrices 1

2.1 Row and Column Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . 1

2.2 Square Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2

2.3 Diagonal Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2

2.4 Scalar Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2

2.5 Identity Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2

2.6 Null (Zero) Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

2.7 Triangular Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

2.8 Singular and Non-Singular Matrices . . . . . . . . . . . . . . . . . . . . . 3

3 Basic Operations on Matrices 3

3.1 Addition of Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

3.2 Scalar Multiplication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

3.3 Trace of a Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

4 Matrix Multiplication 4

4.1 Step-by-Step Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

4.2 Properties of Multiplication . . . . . . . . . . . . . . . . . . . . . . . . . 5

5 Transpose and Symmetry 5

5.1 Transpose of a Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5

5.2 Symmetric and Skew-Symmetric . . . . . . . . . . . . . . . . . . . . . . . 6

5.3 Orthogonal Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6

6 Determinants 6

6.1 Calculation (2 × 2) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6

6.2 Calculation (3 × 3) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
Arun Majumder (Roll: 09) Matrix Algebra Project

6.3 Properties of Determinants . . . . . . . . . . . . . . . . . . . . . . . . . . 7

7 Inverse of a Matrix 7

7.1 Existence Condition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7

7.2 Formula . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7

7.3 Calculated Example . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7

7.4 Properties of Inverse . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8

8 Rank of a Matrix 8

8.1 Finding Rank via Row Operations . . . . . . . . . . . . . . . . . . . . . . 8

9 System of Linear Equations 9

9.1 Matrix Inversion Method . . . . . . . . . . . . . . . . . . . . . . . . . . . 9

9.2 Cramer’s Rule . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9

10 Eigenvalues and Eigenvectors 10

10.1 Characteristic Equation . . . . . . . . . . . . . . . . . . . . . . . . . . . 10

11 Cayley-Hamilton Theorem 10

11.1 Application: Finding Inverse . . . . . . . . . . . . . . . . . . . . . . . . . 11

12 Advanced Real-World Applications 11

12.1 Computer Vision and Image Processing . . . . . . . . . . . . . . . . . . . 11

12.2 Data Science and Machine Learning . . . . . . . . . . . . . . . . . . . . . 11

12.3 Economics and Game Theory . . . . . . . . . . . . . . . . . . . . . . . . 12

12.4 Cryptography and Cybersecurity . . . . . . . . . . . . . . . . . . . . . . 12

12.5 Computer Graphics and Animation . . . . . . . . . . . . . . . . . . . . . 12

13 References 13

Page 3
Arun Majumder (Roll: 09) Matrix Algebra Project

1 Introduction

In the vast landscape of mathematics, Matrices serve as one of the most powerful and
versatile tools available to scientists and engineers. Defined formally, a matrix is a rect-
angular array of numbers, symbols, or expressions, arranged systematically in horizontal
rows and vertical columns.

While the origins of matrix theory can be traced back to ancient civilizations—such as
the Han Dynasty in China, where coefficients were arranged in arrays to solve linear
equations—the formal algebraic properties were established much later. In the 19th
century, mathematicians like Arthur Cayley, James Joseph Sylvester, and William Rowan
Hamilton formalized the theory, transforming it from a mere calculation method into a
robust algebraic structure.

In the modern digital era, matrix algebra has become indispensable. It is the language
of Computer Science. Whether it is the ranking of web pages by a search engine, the
compression of audio and video signals, the rendering of realistic 3D graphics in video
games, or the training of deep learning models in Artificial Intelligence, matrices are the
fundamental building blocks.

This project aims to provide a comprehensive exploration of matrix algebra. We will

cover the fundamental definitions, explore various types of matrices, delve into arithmetic
operations, and examine advanced concepts like Rank, Eigenvalues, and the Cayley-
Hamilton theorem. Finally, we will discuss the practical implementation of these concepts
in real-world scenarios.

2 Types of Matrices

Matrices are categorized based on their dimensions (order) and the specific nature of their
elements. Below are the primary types used in linear algebra.

2.1 Row and Column Matrices

• Row Matrix: A matrix possessing exactly one row.

h i
R = 3 −1 7 5
1×4

Page 1
Arun Majumder (Roll: 09) Matrix Algebra Project

• Column Matrix: A matrix possessing exactly one column.

 
5
C = 0
 

2 3×1

2.2 Square Matrix

A matrix in which the number of rows (m) equals the number of columns (n).
" #
1 2
S=
3 4 2×2

2.3 Diagonal Matrix

A square matrix where all entries outside the main diagonal are zero. The diagonal
elements can be any value.  
2 0 0
D = 0 6 0
 

0 0 9

2.4 Scalar Matrix

A specific type of diagonal matrix where all diagonal elements are the same non-zero
scalar.  
4 0 0
K = 0 4 0
 

0 0 4

2.5 Identity Matrix

A diagonal matrix where every diagonal element is 1. It is the multiplicative identity in

matrix algebra, denoted by I.  
1 0 0
I3 = 0 1 0
 

0 0 1

Page 2
Arun Majumder (Roll: 09) Matrix Algebra Project

2.6 Null (Zero) Matrix

A matrix of any dimension where every single element is zero.

" #
0 0
O=
0 0

2.7 Triangular Matrices

• Upper Triangular: All entries below the main diagonal are zero.

• Lower Triangular: All entries above the main diagonal are zero.

2.8 Singular and Non-Singular Matrices

• Singular Matrix: A square matrix whose determinant is zero (|A| = 0). It does
not have an inverse.

• Non-Singular Matrix: A square matrix whose determinant is non-zero (|A| ̸= 0).

It possesses a unique inverse.

3 Basic Operations on Matrices

3.1 Addition of Matrices

Matrix addition requires two matrices to have identical dimensions. We sum the elements
in corresponding positions.
" # " #
1 3 4 1
Example: Let A = and B =
2 5 3 2

" #
1+4 3+1
A+B =
2+3 5+2
" #
5 4
=
5 7

Properties of Addition:

1. Commutative: A + B = B + A

Page 3
Arun Majumder (Roll: 09) Matrix Algebra Project

2. Associative: A + (B + C) = (A + B) + C

3. Additive Identity: A + O = A

4. Additive Inverse: A + (−A) = O

3.2 Scalar Multiplication

Multiplying a matrix by a constant k scales every element in the matrix by k.

" #
3 −1
Example: If k = 2 and A = , then:
0 4
" # " #
2(3) 2(−1) 6 −2
2A = =
2(0) 2(4) 0 8

3.3 Trace of a Matrix

The trace"of a square

# matrix is the sum of the elements on the main diagonal. Example:
2 0
For D = , tr(D) = 2 + 9 = 11.
0 9

4 Matrix Multiplication

Matrix multiplication is a more complex operation than addition. It follows a ”Row-by-

Column” rule. It is defined only if the number of columns in the first matrix matches the
number of rows in the second matrix.

4.1 Step-by-Step Example

" # " #
2 0 1 2
Let A = and B = .
1 3 3 4
To calculate C = AB:

1. Row 1 × Column 1:

c11 = (2 × 1) + (0 × 3) = 2 + 0 = 2

2. Row 1 × Column 2:

c12 = (2 × 2) + (0 × 4) = 4 + 0 = 4

Page 4
Arun Majumder (Roll: 09) Matrix Algebra Project

3. Row 2 × Column 1:

c21 = (1 × 1) + (3 × 3) = 1 + 9 = 10

4. Row 2 × Column 2:

c22 = (1 × 2) + (3 × 4) = 2 + 12 = 14

Final Result: " #

2 4
AB =
10 14

4.2 Properties of Multiplication

• Non-Commutative: In most cases, AB ̸= BA.

• Associative Property: (AB)C = A(BC).

• Distributive Property: A(B + C) = AB + AC.

• Multiplicative Identity: AI = IA = A.

5 Transpose and Symmetry

5.1 Transpose of a Matrix

The transpose operation flips a matrix over its main diagonal, switching the row and
column indices of the matrix.
 
" # 2 6
2 4 1 T
Example: If A = , then A = 4 8.
 
6 8 5
1 5
Properties of Transpose:

1. (AT )T = A

2. (A + B)T = AT + B T

3. (kA)T = kAT

4. (AB)T = B T AT (Reversal Law)

Page 5
Arun Majumder (Roll: 09) Matrix Algebra Project

5.2 Symmetric and Skew-Symmetric

• Symmetric: A matrix is symmetric if A = AT .

• Skew-Symmetric: A matrix is skew-symmetric if AT = −A. (Note: Diagonal

elements must be zero).

5.3 Orthogonal Matrix

A square matrix A is orthogonal if AAT = I. This implies that the inverse of the matrix
is equal to its transpose (A−1 = AT ).

6 Determinants

The determinant is a unique scalar value computed from the elements of a square matrix.
It serves as a diagnostic tool for the matrix’s properties, particularly invertibility.

6.1 Calculation (2 × 2)
" #
p q
For A = :
r s
|A| = det(A) = ps − qr

6.2 Calculation (3 × 3)
 
2 1 1
For A = 1 2 1.
 

1 1 2
Expanding along the first row:

2 1 1 1 1 2
|A| = 2 −1 +1
1 2 1 2 1 1

= 2(4 − 1) − 1(2 − 1) + 1(1 − 2)

= 2(3) − 1(1) + 1(−1)

=6−1−1

=4

Page 6
Arun Majumder (Roll: 09) Matrix Algebra Project

6.3 Properties of Determinants

• |AB| = |A||B|

• |AT | = |A|

• If any two rows (or columns) are identical, |A| = 0.

• If a row consists entirely of zeros, |A| = 0.

7 Inverse of a Matrix

The inverse of a matrix A is a unique matrix A−1 such that multiplying them yields the
Identity Matrix (AA−1 = I).

7.1 Existence Condition

A matrix is invertible (non-singular) if and only if its determinant is non-zero (|A| ̸= 0).

7.2 Formula
1
A−1 = Adj(A)
|A|
Where Adj(A) is the Adjugate Matrix (the transpose of the cofactor matrix).

7.3 Calculated Example

" #
2 5
Find the inverse of A = .
1 3
Step 1: Determinant

|A| = (2)(3) − (5)(1) = 6 − 5 = 1

Since 1 ̸= 0, the inverse exists.

Step 2: Adjoint Matrix For a 2 × 2 matrix, we swap the diagonal elements and change
the signs of the off-diagonal elements.
" #
3 −5
Adj(A) =
−1 2

Page 7
Arun Majumder (Roll: 09) Matrix Algebra Project

Step 3: Apply Formula

" # " #
1 3 −5 3 −5
A−1 = =
1 −1 2 −1 2

7.4 Properties of Inverse

1. (A−1 )−1 = A

2. (AB)−1 = B −1 A−1 (Reversal Law)

3. (AT )−1 = (A−1 )T

8 Rank of a Matrix

The rank of a matrix defines the number of linearly independent rows or columns it
contains. It indicates the amount of non-redundant information in a system.

8.1 Finding Rank via Row Operations

We convert the matrix to Row Echelon Form (REF). The rank is simply the count of
non-zero rows.
 
1 1 1
Example: Find the rank of A = 2 2 2.
 

3 4 5
Operation 1: R2 → R2 − 2R1  
1 1 1
0 0 0
 

3 4 5

Operation 2: R3 → R3 − 3R1  
1 1 1
0 0 0
 

0 1 2

Operation 3: Swap R2 and R3 to organize.

 
1 1 1
0 1 2
 

0 0 0

Page 8
Arun Majumder (Roll: 09) Matrix Algebra Project

Conclusion: There are exactly 2 non-zero rows remaining. Therefore, ρ(A) = 2.

9 System of Linear Equations

Matrices streamline the process of solving simultaneous linear equations. A system can
be consistent (has a solution) or inconsistent (no solution).

9.1 Matrix Inversion Method


3x + y = 5
Consider the system:
2x − y = 0

Written as AX = B: " #" # " #

3 1 x 5
=
2 −1 y 0

Solution: X = A−1 B.

1. Find |A| = (3)(−1) − (1)(2) = −3 − 2 = −5. 2. Find Inverse:

" # " #
1 −1 −1 0.2 0.2
A−1 = =
−5 −2 3 0.4 −0.6

3. Multiply by B: " #" # " #

0.2 0.2 5 1
X= =
0.4 −0.6 0 2

Therefore, x = 1 and y = 2.

9.2 Cramer’s Rule

An alternative method using determinants.

|Ax | |Ay |
x= , y=
|A| |A|

• |A| = −5

5 1
• |Ax | = = −5 =⇒ x = −5
−5
=1
0 −1

Page 9
Arun Majumder (Roll: 09) Matrix Algebra Project

3 5
• |Ay | = = −10 =⇒ y = −10
−5
=2
2 0

10 Eigenvalues and Eigenvectors

Eigenvectors are vectors that do not change direction during a linear transformation; they
only stretch or shrink. The scaling factor is the eigenvalue (λ).

10.1 Characteristic Equation

To find eigenvalues, we solve:

|A − λI| = 0
"
#
3 1
Example: Let A = .
1 3
1. Construct matrix A − λI: " #
3−λ 1
1 3−λ
2. Find Determinant:
(3 − λ)(3 − λ) − (1)(1) = 0

(3 − λ)2 − 1 = 0

λ2 − 6λ + 9 − 1 = 0

λ2 − 6λ + 8 = 0

3. Solve Quadratic Equation:

(λ − 4)(λ − 2) = 0

Eigenvalues: λ1 = 4 and λ2 = 2.

11 Cayley-Hamilton Theorem

Statement: Every square matrix is a root of its own characteristic polynomial.

For the previous matrix A, the characteristic equation was λ2 − 6λ + 8 = 0. The theorem
states that if we replace λ with the matrix A, the equation holds true:

A2 − 6A + 8I = 0

Page 10
Arun Majumder (Roll: 09) Matrix Algebra Project

11.1 Application: Finding Inverse

This theorem allows us to find the inverse without calculating the adjoint.

8I = 6A − A2
8I = A(6I − A)
8A−1 = 6I − A
1
A−1 = (6I − A)
8

12 Advanced Real-World Applications

12.1 Computer Vision and Image Processing

In computer science, a digital image is essentially a matrix of pixel values.

• Edge Detection: Matrices called ”kernels” (like Sobel or Prewitt operators) slide
over an image matrix to mathematically detect boundaries of objects.

• Blurring/Sharpening: Convolution matrices modify pixel values based on their

neighbors to reduce noise or enhance fine details.

• Compression: JPEG compression uses Discrete Cosine Transform (DCT) matrices

to transform pixel blocks, allowing the removal of invisible high-frequency data.

12.2 Data Science and Machine Learning

Matrix algebra is the engine room of modern Artificial Intelligence.

• Neural Networks: A layer in a neural network is mathematically a matrix mul-

tiplication Y = W X + B, where W is the weight matrix and X is the input vector.

• Recommender Systems: Platforms like Netflix and Amazon use ”Matrix Fac-
torization” (e.g., SVD) to predict user ratings for movies or products they haven’t
seen yet.

• Dimensionality Reduction: Principal Component Analysis (PCA) uses covari-

ance matrices and eigenvalues to simplify massive datasets while preserving pat-
terns.

Page 11
Arun Majumder (Roll: 09) Matrix Algebra Project

12.3 Economics and Game Theory

• Input-Output Models: Governments use massive Leontief matrices to predict

how a change in one sector (e.g., Oil) impacts other sectors (e.g., Transport, Man-
ufacturing).

• Game Theory: Payoff matrices are used to model strategic interactions and de-
termine equilibrium points (Nash Equilibrium) in competitive markets.

• Transition Matrices: Marketers use these to model consumer switching behavior

between different brands over time.

12.4 Cryptography and Cybersecurity

• Encryption (Hill Cipher): A message is converted into numeric vectors and

multiplied by a key matrix. The message remains unreadable without the inverse
key matrix.

• Hashing Algorithms: Advanced matrix mixing functions are used in SHA-256

(the basis of Bitcoin) to ensure data integrity.

• Lattice-Based Cryptography: New security standards resistant to quantum

computers rely heavily on grid-like matrix structures.

12.5 Computer Graphics and Animation

Every visual on a computer screen is the result of matrix transformations.

• Translation: Using 4 × 4 homogeneous matrices to move character models in a 3D

world.

• Rotation: Orthogonal matrices are used to rotate the camera view or character
orientation.

• Scaling: Diagonal matrices are used to resize objects (making a character grow or
shrink).

• Perspective Projection: Converting the 3D world matrix coordinates into the

2D matrix of pixels on your monitor.

Page 12
Arun Majumder (Roll: 09) Matrix Algebra Project

13 References

Textbooks: Online Resources & Software:

• Linear Algebra and Its Applications by • 3Blue1Brown (Essence of Linear Alge-

David C. Lay bra)
• Higher Engineering Mathematics by • MIT OpenCourseWare (18.06)
B.S. Grewal • NumPy Documentation (Python)
• Introduction to Linear Algebra by • MATLAB & Wolfram Alpha
Gilbert Strang
• Matrix Analysis by Carl D. Meyer

— End of Project —

Page 13