2.6 Matrices and Determinants
Detailed Theory: Matrices and Determinants
1. Introduction to Matrices
1.1 What is a Matrix?
A matrix is a rectangular array of numbers, symbols, or expressions arranged in rows and columns.
Example:
This is a 2×3 matrix (2 rows, 3 columns).
1.2 Notation
Matrices are usually denoted by capital letters: A,B,C,…
The element in the i-th row and j-th column is denoted by aij
A matrix with m rows and n columns is called an m×n matrix
General form:
1.3 Types of Matrices
a) Row Matrix
A matrix with only one row.
Example:
(1×3)
b) Column Matrix
A matrix with only one column.
Example:
(3×1)
c) Zero Matrix (Null Matrix)
A matrix with all elements zero. Denoted by O.
Example:
(2×2 zero matrix)
d) Square Matrix
A matrix with same number of rows and columns (m=n).
Example:
(2×2)
e) Diagonal Matrix
A square matrix where all non-diagonal elements are zero.
Example:
f) Scalar Matrix
A diagonal matrix where all diagonal elements are equal.
Example:
g) Identity Matrix
A scalar matrix with diagonal elements = 1. Denoted by I or In.
Examples:
h) Upper Triangular Matrix
A square matrix where all elements below the main diagonal are zero.
Example:
i) Lower Triangular Matrix
A square matrix where all elements above the main diagonal are zero.
Example:
j) Symmetric Matrix
A square matrix that equals its transpose: AT=A
Example:
k) Skew-Symmetric Matrix
A square matrix that equals the negative of its transpose: AT=−A Diagonal elements must be zero.
Example:
2. Matrix Operations
2.1 Equality of Matrices
Two matrices A and B are equal if:
They have same dimensions
Corresponding elements are equal
2.2 Addition of Matrices
Matrices of same dimensions can be added element-wise.
If A=[aij] and B=[bij] are both m×n, then:
Properties:
Commutative: A+B=B+A
Associative: (A+B)+C=A+(B+C)
Additive Identity: A+O=A
Additive Inverse: A+(−A)=O
2.3 Subtraction of Matrices
2.4 Scalar Multiplication
If k is a scalar and A=[aij], then:
Properties:
k(A+B)=kA+kB
(k+l)A=kA+lA
k(lA)=(kl)A
1⋅A=A
2.5 Matrix Multiplication
a) Condition for Multiplication
Matrix A (m×n) can multiply matrix B (p×q) only if:
The product AB will have dimensions m×q.
b) Multiplication Process
If A=[aij] is m×n and B=[bjk] is n×p, then:
Element cik is dot product of i-th row of A and k-th column of B.
Example:
c) Properties of Matrix Multiplication
Not commutative: AB=BA in general
Associative: A(BC)=(AB)C
Distributive: A(B+C)=AB+AC
Multiplicative Identity: AI=IA=A
Multiplication with zero matrix: AO=OA=O
2.6 Transpose of a Matrix
The transpose of matrix A, denoted AT or A′, is obtained by interchanging rows and columns.
If A=[aij] is m×n, then AT=[aji] is n×m.
Properties:
(AT)T=A
(A+B)T=AT+BT
(kA)T=kAT
(AB)T=BTAT
2.7 Trace of a Matrix
For a square matrix A, the trace is sum of diagonal elements:
Properties:
tr(A+B)=tr(A)+tr(B)
tr(kA)=k⋅tr(A)
tr(AB)=tr(BA)
3. Determinants
3.1 Definition
Determinant is a scalar value computed from a square matrix.
Notation: det(A) or ∣A∣
3.2 Determinant of 2×2 Matrix
For A=[acbd]:
3.3 Determinant of 3×3 Matrix
For A=a11a21a31a12a22a32a13a23a33:
This can be remembered as Sarrus' Rule:
Write first two columns again to the right:
Sum of products of diagonals from left to right minus sum of products of diagonals from right to left.
3.4 Minors and Cofactors
a) Minor
The minor Mij of element aij is the determinant of the submatrix obtained by deleting the i-th row and j-th column.
b) Cofactor
The cofactor Cij of element aij is:
Example: For A=147258369:
Minor M11 = determinant of [5869]=5×9−6×8=45−48=−3
Cofactor C11=(−1)1+1M11=(−1)2×(−3)=−3
3.5 Expansion by Cofactors
Determinant can be computed by expanding along any row or column:
Along i-th row:
Along j-th column:
3.6 Properties of Determinants
a) Basic Properties
det(I)=1
det(O)=0
det(AT)=det(A)
If two rows (or columns) are identical, det(A)=0
If a row (or column) has all zeros, det(A)=0
b) Row/Column Operations
Let A be an n×n matrix.
Row interchange: Swapping two rows changes sign of determinant
Scalar multiplication: Multiplying a row by k multiplies determinant by k
Row addition: Adding a multiple of one row to another doesn't change determinant
c) Multiplication Property
d) Inverse Property
If A is invertible,
3.7 Special Determinants
a) Diagonal Matrix
Determinant = product of diagonal elements.
b) Triangular Matrix
Determinant = product of diagonal elements.
c) Vandermonde Determinant
4. Inverse of a Matrix
4.1 Definition
A square matrix A is invertible if there exists matrix B such that:
B is called the inverse of A, denoted A−1.
Note: Only square matrices can be invertible, but not all square matrices are invertible.
4.2 Condition for Invertibility
A square matrix A is invertible if and only if:
If det(A)=0, A is called singular or non-invertible.
4.3 Finding Inverse
a) Formula for 2×2 Matrix
For A=[acbd]:
If det(A)=ad−bc=0, then:
Example: A=[2134]
b) Using Adjoint (for n×n)
The adjoint of A, denoted adj(A), is the transpose of the cofactor matrix.
Steps:
Find cofactor matrix C where Cij=(−1)i+jMij
Transpose to get adjoint: adj(A)=CT
Divide by det(A)
c) Using Elementary Row Operations (Gauss-Jordan)
Augment A with I: [A∣I]
Apply row operations to transform A to I
The right side becomes A−1: [I∣A−1]
4.4 Properties of Inverse
(A−1)−1=A
(AB)−1=B−1A−1
(AT)−1=(A−1)T
det(A−1)=det(A)1
(kA)−1=k1A−1 for k=0
5. Systems of Linear Equations
5.1 Matrix Representation
A system of m linear equations in n variables:
⋮
Can be written as: AX=B
where
5.2 Solution Methods
a) Using Inverse (for n×n systems)
If A is square and invertible, solution is:
b) Using Cramer's Rule
For system AX=B where A is n×n and det(A)=0:
where Ai is matrix obtained by replacing i-th column of A with B.
Example: Solve:
In matrix form:
5.3 Consistency of Systems
For AX=B:
Consistent: Has at least one solution
Inconsistent: Has no solution
Rank Method: Let [A∣B] be augmented matrix.
System is:
Consistent if rank(A)=rank([A∣B])
Inconsistent if rank(A)=rank([A∣B])
If consistent:
Unique solution if rank(A)=n (number of variables)
Infinite solutions if rank(A)<n
5.4 Homogeneous Systems
System AX=O (all bi=0)
Properties:
Always consistent (trivial solution X=O exists)
Has non-trivial solutions if and only if det(A)=0
If non-trivial solutions exist, they are infinite in number
6. Eigenvalues and Eigenvectors
6.1 Definition
For square matrix A, a non-zero vector X is an eigenvector if:
λ is called the eigenvalue corresponding to eigenvector X.
6.2 Finding Eigenvalues
The equation AX=λX can be written as:
For non-zero solution X, we need:
This is called the characteristic equation.
6.3 Steps to Find Eigenvalues and Eigenvectors
Form A−λI
Set det(A−λI)=0, solve for λ (eigenvalues)
For each λ, solve (A−λI)X=O to find eigenvectors
Example: Find eigenvalues and eigenvectors of A=[2112]
Step 1:
Step 2:
Eigenvalues: λ1=1, λ2=3
Step 3: For λ1=1:
Solve
Equation: x+y=0⇒y=−x
Eigenvector: [1−1] or any multiple
For λ2=3:
Solve
Equation: −x+y=0⇒y=x
Eigenvector: [11] or any multiple
6.4 Properties
Sum of eigenvalues = trace of A
Product of eigenvalues = determinant of A
Eigenvalues of diagonal/triangular matrix = diagonal elements
If λ is eigenvalue of A, then for polynomial p(A), p(λ) is eigenvalue
7. Rank of a Matrix
7.1 Definition
The rank of a matrix is the maximum number of linearly independent rows (or columns).
Notation: rank(A)
7.2 Finding Rank
a) Using Row Echelon Form
Transform matrix to row echelon form using elementary row operations.
Rank = number of non-zero rows.
b) Using Determinants
Rank is the size of largest non-zero minor.
7.3 Properties
rank(A)=rank(AT)
rank(A)≤min(m,n) for m×n matrix
If rank(A)=n for n×n matrix, then A is invertible
rank(AB)≤min(rank(A),rank(B))
8. Special Matrices and Properties
8.1 Orthogonal Matrix
A square matrix A is orthogonal if:
Equivalently: AT=A−1
Properties:
Columns (and rows) are orthonormal vectors
det(A)=±1
Preserves length: ∥AX∥=∥X∥
8.2 Idempotent Matrix
A square matrix A is idempotent if:
Example:
8.3 Nilpotent Matrix
A square matrix A is nilpotent if:
Example:
(A2=O)
8.4 Involutory Matrix
A square matrix A is involutory if:
Equivalently: A−1=A
Example:
9. Matrix Equations
9.1 Solving AX=B
If A is invertible: X=A−1B
9.2 Solving XA=B
If A is invertible: X=BA−1
9.3 Sylvester Equation
AX+XB=C
Solution involves Kronecker product.
9.4 Lyapunov Equation
ATX+XA=−Q
Important in control theory.
10. Applications
10.1 Computer Graphics
Matrices used for transformations:
Translation
Rotation
Scaling
Shearing
10.2 Cryptography
Matrices used in encryption algorithms.
10.3 Economics
Input-output analysis using Leontief models.
10.4 Physics
Quantum mechanics, rotation matrices, stress tensors.
10.5 Statistics
Covariance matrices, multivariate analysis.
11. Solved Examples
Example 1: Matrix Multiplication
If A=[1324] and B=[5768], find AB and BA.
Solution:
Note: AB=BA
Example 2: Determinant Calculation
Find
Solution:
Using Sarrus' rule:
Sum of left-to-right diagonals:
Sum of right-to-left diagonals:
Determinant = 225−225=0
Example 3: Inverse Calculation
Find inverse of A=[2153]
Solution:
Example 4: System of Equations
Solve using matrices:
Solution:
Matrix form:
So x=4, y=1
12. Important Formulas Summary
12.1 Determinants
2×2:
3×3: Use Sarrus' rule or cofactor expansion
12.2 Inverse
2×2:
General: A−1=det(A)1adj(A)
12.3 Eigenvalues
Solve: det(A−λI)=0
12.4 Trace
13. Exam Tips and Common Mistakes
13.1 Common Mistakes
Matrix multiplication: Not checking dimensions compatibility
Inverse: Forgetting to check det(A)=0 first
Determinant: Incorrect sign in cofactor expansion
Eigenvectors: Forgetting eigenvectors are defined up to scalar multiple
Transpose: (AB)T=BTAT not ATBT
13.2 Problem-Solving Strategy
Identify matrix type and dimensions
Choose appropriate method (inverse, determinant, row operations)
Show all steps clearly
Check answer when possible (e.g., verify AA−1=I)
13.3 Quick Checks
Square matrix needed for inverse, determinant, eigenvalues
det(A)=0 for invertibility
Dimensions must match for matrix operations
Eigenvectors are never zero vectors
This comprehensive theory covers all aspects of matrices and determinants with detailed explanations and examples, providing complete preparation for the entrance examination.