Definitions [2]
A determinant is a single real number associated with a square matrix only.
- Denoted by det A or ∣A∣ or Δ
Minors:
Minor of element aij is the determinant obtained after deleting the i-th row and j-th column.
Cofactors:
If Mij is the minor of the element aij in the determinant Δ, then the number (−1)i+j Mij is called the cofactor of the element aij; it is usually denoted by Aij.
Thus Aij = (−1)i+j Mij
Formulae [1]
Determinant of Order 1:
If A = [a] then detA = ∣a∣ = a
Determinant of Order 2:
\[\begin{vmatrix}
a & b \\
c & d
\end{vmatrix}\] = ad − bc
Determinant of Order 3:
\[\begin{vmatrix}
a_1 & b_1 & c_1 \\
a_2 & b_2 & c_2 \\
a_3 & b_3 & c_3
\end{vmatrix}\]
\[a_1(b_2c_3-b_3c_2)-b_1(a_2c_3-a_3c_2)+c_1(a_2b_3-a_3b_2)\]
Key Points
Applicable ONLY for 3×3 determinants
Steps:
-
Rewrite the first two columns to the right
-
Add products of downward diagonals
-
Subtract products of upward diagonals
| No. | Property | Statement | Result / Formula |
|---|---|---|---|
| 1 | Zero Row / Column | Any row or column is zero | ( △ = 0 ) |
| 2 | Zero Diagonal Side | One side of the principal diagonal is zero | Product of diagonal elements |
| 3 | Transpose Property | Rows ↔ columns |
∣A∣ = ∣AT∣ |
| 4 | Interchange Rows / Columns | Swap two rows/columns | ( △1 = -△ ) |
| 5 | Identical Rows / Columns | Two rows/columns are identical | ( △ = 0 ) |
| 6 | Scalar Multiple (One Row/Column) | Multiply a row/column by (k) | ( △1 = k△ ) |
| 7 | Linearity | Row/column is a sum | Determinant splits |
| 8 | Row/Column Addition | Add multiple rows/columns | No change |
| 9 | Cofactor Orthogonality | Product with cofactors of other row | 0 |
Corollaries:
-
Passing a row (or column) over nnn rows (or columns):
Δ1 = (−1)nΔ -
If each element of a determinant of order nnn is multiplied by k:
Δ1 = knΔ -
If two rows or columns are proportional:
Δ = 0 -
If A is skew-symmetric of odd order:
∣A∣ = 0 -
Polynomial result: If Δ = 0 when x = a, then
(x − a) is a factor
System of linear equations: AX = B
Consistent / Inconsistent:
-
Consistent → one or more solutions
-
Inconsistent → no solution
Matrix method (Martin’s Rule):
If ∣A∣ ≠ 0, X = A−1B ⇒ unique solution
When ∣A∣ = 0:
-
→ infinitely many solutions
-
(adjA)B ≠ 0 → no solution
Homogeneous system:
AX = 0
-
Always consistent
-
∣A∣ ≠ 0 → trivial solution
-
∣A∣ = 0→ infinitely many solutions
1. Area of a Triangle:
\[\mathrm{Area}=\frac{1}{2}
\begin{vmatrix}
x_1 & y_1 & 1 \\
x_2 & y_2 & 1 \\
x_3 & y_3 & 1
\end{vmatrix}\]
2. Collinearity of Three Points:
\[\begin{vmatrix}
x_1 & y_1 & 1 \\
x_2 & y_2 & 1 \\
x_3 & y_3 & 1
\end{vmatrix}=0\]
1. Adjoint of a Square Matrix
The adjoint of a square matrix A is the transpose of the matrix of cofactors of A.
2. Fundamental Identity
A(adjA) = ∣A∣I = (adjA)A
3. Inverse of a Matrix
If ∣A∣ ≠ 0, then:
\[A^{-1} =\frac{1}{|A|}\operatorname{adj}A\]
4. Singular and Non-Singular Matrix
- Singular matrix: ∣A∣ = 0
-
Non-singular matrix: ∣A∣ ≠ 0
5. Invertibility Condition
A is invertible ⟺ ∣A∣ ≠ 0
