Definitions [6]
If A = [aij], then the negative of A, denoted by −A, is the matrix obtained by replacing each element aij by −aij
−A = [−aij]
- Order of −A = order of A
If A = [aij] is an m × n matrix, then the transpose of A, denoted by A′ or AT, is obtained by interchanging rows and columns.
\[A^T=[a_{ji}]\]
Symmetric Matrix:
A square matrix A = [aij] is called symmetric if:
A′ = A or aij = aij
A square matrix A=[aij] is called skew-symmetric if:
Two matrices are equivalent if one can be obtained from the other by a finite number of elementary operations
-
Denoted by: A ∼ B
A square matrix A is invertible if there exists a matrix B such that
AB = BA = I
-
B is called the inverse of A
-
Inverse is denoted by A−1
A rectangular arrangement of mn elements in the form of an ordered set of m rows, each row consisting of an ordered set of n elements, is called an m × n matrix (m × n is read as m by n).
- Each entry is called an element.
- Order of a matrix = number of rows × number of columns
General form:
where
-
i → row number
-
j → column number
-
aij → element in iᵗʰ row and jᵗʰ column
Formulae [4]
Adjoint of A = transpose of the cofactor matrix \[\mathrm{adj}A=\left[A_{ij}\right]^T\]
-
\[\mathrm{adj}(kA)=k^{n-1}\mathrm{adj}(A)\]
-
A(adj A) = (adj A)A = ∣A∣I
-
∣adjA∣ = ∣A∣n−1(for an n×n non-singular matrix)
Determinant of Order 2:
\[\det
\begin{bmatrix}
a & b \\
c & d
\end{bmatrix}=ad-bc\]
Determinant of Order 3:
-
Computed by expansion along a row or column
\[A=
\begin{bmatrix}
a & b \\
c & d
\end{bmatrix}\]
\[A^{-1}=\frac{1}{ad-bc}
\begin{bmatrix}
d & -b \\
-c & a
\end{bmatrix}\] if ad − bc ≠ 0
\[A^{-1}=\frac{1}{|A|}(\operatorname{adj}A)\], if ∣A∣ ≠ 0
Properties:
-
\[(AB)^{-1}=B^{-1}A^{-1}\]
-
\[(A^{-1})^{-1}=A\]
-
\[(A^{\prime})^{-1}=(A^{-1})^{\prime}\]
- If inverse exists, it is unique.
Minor
Delete ith row and jth column: Mij
Cofactor of aij
Aij = (−1)i+j × (minor of aij)
Sign pattern:
\[\begin{bmatrix}
+ & - & + \\
- & + & - \\
+ & - & +
\end{bmatrix}\]
Key Points
-
Write AX = B
-
Apply row operations on A
(Same operations on B) -
Reduce A to triangular/identity form
-
Solve equations
| Property | Result |
|---|---|
| Double transpose | (A')' = A |
| Scalar | (kA)' = kA' |
| Negative | (−A)' = −A' |
| Addition | (A + B)' = A' + B' |
| Subtraction | (A − B)' = A' − B' |
| Product | (AB)' = B'A' |
Comparable Matrices
-
Two matrices are said to be comparable if they have the same order
(same number of rows and columns).
Equal Matrices
Two matrices A= [aij] and B=[bij] are equal if:
-
They are comparable (same order), and
-
Their corresponding elements are equal.
| Type of Matrix | Definition / Condition | Order | Key Points / Notes |
|---|---|---|---|
| Rectangular Matrix | Number of rows ≠ , number of columns | m × n (m ≠ n) | Not a square matrix |
| Row Matrix | Matrix having only one row | 1 × n | Also called a row vector |
| Column Matrix | Matrix having only one column | m × 1 | Also called a column vector |
| Zero (Null) Matrix | All elements are zero | Any order | Denoted by O |
| Square Matrix | Rows = columns | n × n | Diagonal elements exist |
| Diagonal Matrix | Square matrix with all non-diagonal elements zero | n × n | Diagonal elements may be zero |
| Scalar Matrix | Diagonal matrix with all diagonal elements equal | n × n | Diagonal elements = k |
| Identity (Unit) Matrix | Scalar matrix with diagonal elements = 1 | n × n | Denoted by Iₙ |
| Upper Triangular Matrix | Elements below the principal diagonal are zero | n × n | (aij = 0) for i > j |
| Lower Triangular Matrix | Elements above principal diagonal are zero | n × n | (aij = 0) for i < j |
| Strictly Triangular Matrix | Triangular matrix with diagonal elements also zero | n × n | No diagonal elements |
| Sub-Matrix | Obtained by deleting rows/columns of a matrix | Smaller order | Must come from a matrix |
| Point | Details |
|---|---|
| Condition | Matrices must be of the same order |
| Definition | A + B = [aij + bij] |
| Order of Result | Same as the order of A and B |
| Commutative Law | A + B = B + A |
| Associative Law | ((A + B) + C = A + (B + C)) |
| Additive Identity | A + O = A |
| Additive Inverse | A + (−A) = O |
| Not Defined When | Orders of matrices are different |
| Point | Details |
|---|---|
| Condition | Always defined |
| Definition | kA = [kaij] |
| Order of Result | Same as the order of A |
| Distributive Law | k(A + B) = kA + kB |
| Scalar Addition | (k + l)A = kA + lA |
| Scalar Multiplication | k(lA) = (kl)A |
| Identity Scalar | (1A = A) |
| Negative Scalar | (-1)A = −A |
| Point | Details |
|---|---|
| Condition | Columns of first = rows of second |
| Definition | If (Am×n, Bn×p), then (ABm×p) |
| Method | Row × Column |
| Order of Result | (m × p) |
| Commutative | Not commutative |
| Associative | (AB)C = A(BC) |
| Distributive | A(B + C) = AB + AC |
| Identity Matrix | AI = IA = A |
| Zero Matrix | AO = O,; OA = O |
| Cancellation Law | Not valid |
| Type | Transformation | Symbol |
|---|---|---|
| Interchange | Swap two rows/columns | Ri ↔ Rj |
| Multiplication | Multiply row/column by non-zero scalar k | Ri → kRi |
| Row addition | Add k times one row to another | Ri → Ri + kRj |
-
An is defined only when A is a square matrix.
-
AmAn = Am+n
-
In =
Theorem 1:
For any square matrix A:
-
A + A′ is symmetric
-
A − A′ is skew-symmetric
Theorem 2:
Every square matrix can be uniquely expressed as the sum of a symmetric and a skew-symmetric matrix.
\[A=\frac{1}{2}(A+A^{\prime})+\frac{1}{2}(A-A^{\prime})\]
Matrix Form: AX = B
Condition:
-
A must be square
-
∣A∣ ≠ 0 (Non-singular)
Formula:
\[X=A^{-1}B\]
