Definitions [10]
To find the determinant, multiply each element of your chosen row (or column) by its corresponding sign multiplier \[(-1)^{i+j}\] and the \[2 \times 2\] determinant that remains after deleting that element's row and column.
Let A = [aij] be a square matrix of order n. Then, the minor Mij of aij in A is the determinant obtained by deleting the ith row and the jth column in which element aij lies. It is denoted by Mij of A.
Let A = [aij] be a square matrix of order n. Then, the cofactor Cij (or Aij) of aij in A is (−1)i+j times Mij, where Mij is the minor of aij in A.
∴ Cij = (−1)i+j Mij
A determinant is a number associated with a square matrix.
\[\begin{vmatrix}
a & b \\
c & d
\end{vmatrix}=ad-bc\]
The value of the determinant is ad - bc.
The degree of a 2 × 2 determinant is 2.
Cramer’s Rule is a method to solve simultaneous linear equations using determinants.
-
It can be applied only when the determinant D ≠ 0
- Standard Form of Equations
a2x + b2y = c2
A matrix is a rectangular arrangement of numbers arranged in rows and columns, enclosed in brackets [ ] or parentheses ( ).
Elements (Entries) of a Matrix
- Each number in a matrix is called an element (or entry).
Rows and Columns
- Horizontal lines → rows
- Vertical lines → columns
Order of a Matrix
- Order = number of rows × number of columns
- Written as m × n and read as “m by n”
Let \[A = [a_{ij}]_{m \times n}\] be a matrix and k be a real number (scalar).
Then the scalar multiple of A by k is the matrix kA defined as:
That is, each entry of A is multiplied by the scalar k.
The negative of a matrix A, denoted by -A, is defined as the scalar multiple \[-1 \cdot A\].
-
So, if \[A = [a_{ij}]\], then \[-A = [-a_{ij}]\]
-
Adding a matrix to its negative gives the zero matrix: A + (-A) = O
where O is the zero matrix of the same order as A.
Let \[A = [a_{ij}]\] be an \[m \times n\] matrix and \[B = [b_{jk}]\] be an \[n \times p\] matrix.
Then the product C = AB is an \[m \times p\] matrix \[C = [c_{ik}]\], where each entry \[c_{ik}\] is given by:
The transpose of a matrix is obtained by interchanging its rows and columns.
-
If a matrix is A, its transpose is denoted by AT
-
If A is of order m × n, then
AT is of order n × m - First row of A becomes first column of AT, and so on.
Formulae [2]
\[D=
\begin{vmatrix}
a_1 & b_1 \\
a_2 & b_2
\end{vmatrix}=a_1b_2-a_2b_1\]
\[D_x=
\begin{vmatrix}
c_1 & b_1 \\
c_2 & b_2
\end{vmatrix}=c_1b_2-c_2b_1\]
\[D_y=
\begin{vmatrix}
a_1 & c_1 \\
a_2 & c_2
\end{vmatrix}=a_1c_2-a_2c_1\]
\[x=\frac{D_x}{D}\quad\mathrm{and}\quad y=\frac{D_y}{D}\]
-
If D ≠ 0 → unique solution
-
If D = 0 → Cramer’s rule is not applicable
Key Points
| Concept | Formula/Rule |
|---|---|
| Expansion along R₁ | a₁₁C₁₁ + a₁₂C₁₂ + a₁₃C₁₃ |
| Expansion along C₁ | a₁₁C₁₁ + a₂₁C₂₁ + a₃₁C₃₁ |
| Cofactor Sign | (-1)(i+j) → checkerboard: + - + / - + - / + - + |
| Zero Strategy | Expand along row/column with most zeros |
| Result Independence | Any row/column expansion gives same |
-
Minor \[M_{ij}\]: determinant of the matrix obtained by deleting row i and column j.
-
Cofactor \[C_{ij}\]: \[C_{ij} = (-1)^{i+j}M_{ij}\].
-
Determinant expansion along row i: \[|A| = \sum_{j=1}^{n} a_{ij}C_{ij}\].
-
Determinant expansion along column j: \[|A| = \sum_{i=1}^{n} a_{ij}C_{ij}\].
-
Determinant value is the same for any choice of row or column for expansion.
-
Mixed row/column property: \[\sum_{j=1}^{n} a_{ij}C_{kj} = 0\] for \[i \neq k\].
-
Matrix: A rectangular array of elements.
-
Element: An entry inside a matrix.
-
Order: Size of a matrix written as rows × columns.
-
Row: Horizontal set of elements.
-
Column: Vertical set of elements.
-
aij: Element in the i-th row and j-th column.
| Matrix Type | Order | Key Property |
|---|---|---|
| Row Matrix | 1 × n | Only one row |
| Column Matrix | m × 1 | Only one column |
| Square Matrix | n × n | Rows = Column |
| Rectangular Matrix | m × n (m ≠ n) | Rows ≠ Columns |
| Diagonal Matrix | n × n | Square; non-diagonal elements = 0 |
| Scalar Matrix | n × n | Diagonal; all diagonal elements equal |
| Identity Matrix | n × n | Scalar matrix with diagonal = 1 |
| Zero Matrix | Any order | All elements = 0 |
| Upper Triangular Matrix | n × n | (aij = 0) for i > j |
| Lower Triangular Matrix | n × n | (aij = 0) for i < j |
| Strictly Triangular Matrix | n × n | No diagonal elements |
| Sub-Matrix | Smaller order | Must come from a matrix |
-
Scalar multiplication: \[kA = [ka_{ij}]\].
-
Negative of a matrix: -A = (-1)A.
-
Order of matrix does not change after scalar multiplication.
-
k(A + B) = kA + kB.
-
(k + l)A = kA + lA.
-
k(lA) = (kl)A.
-
\[0 \cdot A = O\], \[1 \cdot A = A\].
-
Matrix multiplication is row-by-column, not term-wise.
-
Product AB exists only if columns of A = rows of B.
-
If A is \[m \times n\] and B is \[n \times p\], then AB is \[m \times p\].
-
In general, \[AB \neq BA\], and sometimes one product may not even be defined.
-
Matrix multiplication is associative and distributive over addition.
-
Identity matrix acts as a multiplicative identity: AI = IA = A.
-
Zero matrix absorbs multiplication: AO = OA = O.
-
Transpose = interchange rows and columns.
-
If A is \[m \times n\], then A' is \[n \times m\].
-
Standard notation: A' or \[A^T\].
-
Key properties: (A')' = A, (kA)' = kA', (A + B)' = A' + B', (AB)' = B'A'.
Concepts [12]
- Expansion of Determinant
- Minors and Co-factors
- Properties of Determinants
- Application of Determinants
- Determinant Method (Cramer’s Rule)
- Consistency of Three Equations in Two Variables
- Area of Triangle and Collinearity of Three Points
- Concept of Matrices
- Types of Matrices
- Operations on Matrices>Scalar Multiplication
- Operations on Matrices> Matrix Multiplication
- Transpose of a Matrix
