Definitions [2]
Two matrices are equivalent if one can be obtained from the other by a finite number of elementary operations
-
Denoted by: A ∼ B
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
Formulae [3]
Minor
Delete ith row and jth column: Mij
Cofactor of aij
Aij = (−1)i+j × (minor of aij)
Sign pattern:
\[\begin{bmatrix}
+ & - & + \\
- & + & - \\
+ & - & +
\end{bmatrix}\]
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)
\[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.
Key Points
Matrix Form: AX = B
Condition:
-
A must be square
-
∣A∣ ≠ 0 (Non-singular)
Formula:
\[X=A^{-1}B\]
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.
-
An is defined only when A is a square matrix.
-
AmAn = Am+n
-
In =
| 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 |
-
Write AX = B
-
Apply row operations on A
(Same operations on B) -
Reduce A to triangular/identity form
-
Solve equations
