Trace it. Derive it. Know it.
Every cluster below maps one schematic path — from first principles to the final equation. Expand a node to follow the full derivation trace.
Determinant Evaluation: 2x2 & 3x3 Laplace Expansion & Sarrus' Rule
3 concepts · 4.1What is the formal definition of a determinant, how are 2x2 and 3x3 determinants evaluated via Laplace expansion, and what is Sarrus' Rule?
To every square matrix A = [a_ij] of order n, we associate a unique scalar number called the Determinant of matrix A, denoted by det(A) or |A| (enclosed between straight vertical bars, NOT square brackets). While a matrix is a rectangular array possessing no numerical value, a determinant is a single computable scalar value. For order 1, |[a]| = a. For order 2, |[a, b; c, d]| = ad - bc (the product of main diagonal elements minus the product of off-diagonal elements). For order 3, the determinant is evaluated via Laplace Expansion along any of its 3 rows or 3 columns by multiplying each entry by its signed minor (the checkerboard sign matrix (-1)^(i+j)): expanding along Row 1 yields |A| = a_11 |M_11| - a_12 |M_12| + a_13 |M_13|. For 3x3 determinants, Sarrus' Rule provides a fast visual alternative: write down the 3 columns followed by copies of the first two columns, sum the products of the 3 downward diagonal paths (+), and subtract the products of the 3 upward diagonal paths (-). Sarrus' Rule is valid EXCLUSIVELY for 3x3 determinants and mathematically fails for order 4 or higher. In practice, computation is optimized by expanding along the row or column possessing the greatest number of zeros.
Evaluation of 2x2 Determinants: |[a, b], [c, d]| = ad - bc
The determinant of a 2x2 matrix A = [[a, b], [c, d]], denoted det(A) or |A|, is the scalar value ad - bc. It represents the oriented signed area of the parallelogram spanned by row vectors (a, b) and (c, d).
Laplace Expansion of 3x3 Determinants Along Any Row or Column
A 3x3 determinant can be evaluated by expanding along ANY row or column: det(A) = sum_{j=1}^3 a_ij * A_ij (row expansion) or sum_{i=1}^3 a_ij * A_ij (column expansion), where A_ij is the cofactor. Strategy: choose the row or column with the most zeros to minimize arithmetic.
Sarrus' Rule (Diagonal Ribbon Rule) for 3x3 Determinants
Sarrus' Rule evaluates a 3x3 determinant by appending the first two columns to the right of the matrix. Sum the products of the 3 top-left-to-bottom-right downward diagonals, and subtract the sum of the products of the 3 bottom-left-to-top-right upward diagonals.
The Seven Fundamental Properties of Determinants
3 concepts · 4.2What are the 7 core invariance and transformation properties of determinants, and how do they reduce complex symbolic arrays to zero or simple factored forms?
Determinants obey seven foundational properties that dramatically streamline algebraic evaluation without brute-force expansion: (1) Reflection Property: The value of a determinant remains unaltered if its rows and columns are interchanged: det(A^T) = det(A). Consequently, any property valid for rows holds identically for columns. (2) Switching Property: If any two rows (or columns) of a determinant are interchanged, the sign of the determinant flips: Delta' = -Delta. (3) Identical Rows Property: If any two rows (or columns) are identical (or proportional: R_i = k R_j), the determinant is identically ZERO. (4) Scalar Multiplication Property: If all elements of any single row (or column) are multiplied by a scalar k, the determinant is multiplied by k. Consequently, for an n x n matrix, det(k A) = k^n det(A). (5) Additive Property: If elements of any row are expressed as sums (e.g. a_i + x_i), the determinant splits into the sum of two separate determinants. (6) Invariance Property: The value of a determinant is COMPLETELY UNCHANGED if a scalar multiple of another row (or column) is added to it: R_i -> R_i + k R_j (j != i) leaves Delta' = Delta. This is the ultimate tool to generate zeros before expanding. (7) Product Rule: For any two square matrices A and B of identical order, det(AB) = det(A) * det(B). Consequently, det(A^k) = (det A)^k, and det(A^(-1)) = 1 / det(A).
Transpose Invariance and Row Interchange Sign Reversal
Property 1 (Transpose Invariance): The value of a determinant remains unchanged if its rows and columns are interchanged: det(A^T) = det(A). Property 2 (Row Swap Sign Reversal): If any two rows (or columns) of a determinant are interchanged, the sign of the determinant changes: det(A') = -det(A).
Zero Determinant Criteria: Identical Rows/Columns and Zero Rows
Property 3: If any two rows (or columns) of a determinant are identical (or proportional), the value of the determinant is ZERO. Property 4: If all elements of any single row (or column) are zero, the determinant is ZERO.
Scalar Scaling Law (det(kA) = k^n det(A)) and Invariance under R_i -> R_i + k R_j
Property 5 (Scalar Factoring): Multiplying a SINGLE row (or col) by k multiplies the determinant by k. Consequently, for an n x n matrix, det(kA) = k^n det(A). Property 6 (Row Operation Invariance): The value of a determinant is completely unchanged by operations of the form R_i -> R_i + k R_j.
Minors, Cofactors & The False Expansion (Orthogonality) Theorem
3 concepts · 4.3What is the distinction between a minor and a cofactor, how does Laplace's theorem formalize expansion along any row, and why does multiplying a row by cofactors of another row always yield zero?
For any square matrix A = [a_ij] of order n, the Minor M_ij of an element a_ij is defined as the determinant of the submatrix of order (n - 1) obtained by deleting the i-th row and j-th column of A. The Cofactor A_ij (or C_ij) of element a_ij is defined by attaching the position sign: A_ij = (-1)^(i + j) * M_ij. If (i + j) is even, A_ij = M_ij; if (i + j) is odd, A_ij = -M_ij. Laplace's Expansion Theorem formalizes that the determinant |A| equals the sum of the products of the elements of ANY single row (or column) with their OWN corresponding cofactors: along row i, |A| = a_i1 A_i1 + a_i2 A_i2 + ... + a_in A_in; along column j, |A| = a_1j A_1j + a_2j A_2j + ... + a_nj A_nj. In contrast, the False Expansion (Orthogonality) Theorem establishes that if elements of any row (or column) are multiplied by the cofactors of a DIFFERENT row (or column), their sum is IDENTICALLY ZERO: sum_{k=1}^n a_ik * A_jk = 0 for all i != j. This occurs because multiplying row i by cofactors of row j is algebraically equivalent to expanding a fictitious determinant whose j-th row has been replaced by row i, creating a determinant with two identical rows, which vanishes by Property 3. In tensor notation, sum_{k=1}^n a_ik * A_jk = |A| * delta_ij, where delta_ij is the Kronecker delta (1 if i = j, 0 if i != j).
Minor Extraction: M_ij as the Sub-Determinant of Order (n - 1)
The Minor M_ij of an element a_ij in an n x n determinant is the determinant of the (n - 1) x (n - 1) sub-matrix obtained by deleting the i-th row and j-th column of A.
Cofactor Definition: A_ij = (-1)^(i + j) * M_ij and Checkerboard Signs
The Cofactor A_ij of element a_ij is defined as A_ij = (-1)^(i + j) * M_ij. The sign (-1)^(i + j) creates an alternating checkerboard pattern across the matrix: + for even (i + j), - for odd (i + j).
The False Expansion (Orthogonality) Theorem: sum a_ik * A_jk = 0 for i != j
The False Expansion Theorem states: If elements of a row are multiplied by cofactors of ANY OTHER row, their sum is strictly ZERO: sum_{k=1}^n a_ik * A_jk = 0 for i != j. (When i = j, the sum equals det(A)).
Adjoint of a Matrix, Inverses & The 5 Golden Power Identities
3 concepts · 4.4How is the adjoint matrix constructed, how does the master theorem yield the inverse formula A^(-1) = (1/det A) adj(A), and what are the 5 power formulas for adj(A)?
The Adjoint of a square matrix A = [a_ij] of order n, denoted by adj(A), is defined as the Transpose of the Cofactor Matrix of A: adj(A) = [A_ij]^T = [A_ji]. The Fundamental Theorem of Adjoints establishes: A * adj(A) = adj(A) * A = det(A) * I_n. A square matrix is Non-Singular if det(A) != 0, and Singular if det(A) = 0. When det(A) != 0, dividing the fundamental identity by det(A) yields the Master Matrix Inversion Formula: A^(-1) = (1 / det(A)) * adj(A). In competitive examinations, five golden power identities govern adjoints of an n x n non-singular matrix: (1) Determinant of Adjoint: det(adj A) = (det A)^(n - 1); (2) Double Adjoint Determinant: det(adj(adj A)) = (det A)^((n - 1)^2); (3) Double Adjoint Matrix: adj(adj A) = (det A)^(n - 2) * A; (4) Product Reversal: adj(AB) = adj(B) * adj(A); and (5) Scalar and Transpose Relations: adj(k A) = k^(n - 1) * adj(A) and adj(A^T) = (adj A)^T. For a 2x2 matrix A = [a, b; c, d], the adjoint can be written in 1 second using the classic shortcut: swap main diagonal entries (a <-> d) and flip the signs of off-diagonal entries (-b, -c): adj(A) = [d, -b; -c, a].
Adjoint of a Matrix: adj(A) = [A_ij]^T (Transpose of Cofactor Matrix)
The Adjoint of a square matrix A, denoted adj(A), is the TRANSPOSE of the matrix of its cofactors: adj(A) = [A_ij]^T. For a 2x2 matrix [[a, b], [c, d]], adj(A) is obtained instantly by swapping main diagonal entries and negating off-diagonal entries: [[d, -b], [-c, a]].
The Fundamental Inversion Theorem: A * adj(A) = |A| * I and A^(-1) = adj(A) / |A|
Theorem: For any square matrix A of order n: A * adj(A) = adj(A) * A = |A| * I_n. If |A| != 0 (A is non-singular), then A is invertible and its unique inverse is given by A^(-1) = adj(A) / |A|.
The Five Golden Power Identities for Adjoint Determinants
For an n x n matrix A: (1) |adj(A)| = |A|^(n - 1); (2) adj(adj(A)) = |A|^(n - 2) * A; (3) |adj(adj(A))| = |A|^((n - 1)^2); (4) adj(AB) = adj(B) * adj(A); (5) (A^(-1))^(-1) = A and (A^T)^(-1) = (A^(-1))^T.
Applications: Area of Triangles & Collinearity of Points
3 concepts · 4.5How does a 3x3 determinant compute the area of a coordinate triangle, why does Delta = 0 establish collinearity, and how is the two-point line equation derived?
Determinants provide a unified algebraic formulation for planar coordinate geometry. Given three non-collinear points A(x_1, y_1), B(x_2, y_2), and C(x_3, y_3) in the Cartesian plane, the Area of Triangle ABC, denoted by Delta, is given by: Delta = 1/2 * |det([x_1, y_1, 1; x_2, y_2, 1; x_3, y_3, 1])|. Column 3 is filled with 1s to homogenize 2D coordinates into a 3D volume calculation. Expanding along Column 3 yields the classical coordinate formula Delta = 1/2 * [x_1(y_2 - y_3) + x_2(y_3 - y_1) + x_3(y_1 - y_2)]. Because area is a physical quantity and must be non-negative, the absolute value of the determinant is always taken. When solving for unknown coordinates given a specified area (e.g. Area = k sq units), both positive and negative signs (+-k) must be evaluated to capture all symmetric vertex positions. Three points A, B, and C are Collinear (lie on the exact same straight line) if and only if the area of the triangle formed by them collapses to zero: Delta = 0, which holds iff det([x_1, y_1, 1; x_2, y_2, 1; x_3, y_3, 1]) = 0. Furthermore, the Equation of a Straight Line passing through two distinct points (x_1, y_1) and (x_2, y_2) is obtained by placing an arbitrary point (x, y) on the line and setting the collinearity determinant to zero: det([x, y, 1; x_1, y_1, 1; x_2, y_2, 1]) = 0.
Area of Triangle via Determinant Form
The area of a triangle with vertices (x1, y1), (x2, y2), (x3, y3) is given by Delta = (1/2) * | |[x1, y1, 1], [x2, y2, 1], [x3, y3, 1]| |. Because area is always positive, take the absolute value of the determinant result.
Collinearity Condition: Det = 0 for Three Points
Three points A(x1, y1), B(x2, y2), C(x3, y3) are Collinear if and only if the area of the triangle formed by them is zero: |[x1, y1, 1], [x2, y2, 1], [x3, y3, 1]| = 0.
Equation of Line Passing Through Two Points via Determinant Form
The equation of the straight line passing through two distinct points (x1, y1) and (x2, y2) is given by the determinant equation |[x, y, 1], [x1, y1, 1], [x2, y2, 1]| = 0.
System of Linear Equations: Matrix Method, Consistency & Cramer's Rule
3 concepts · 4.6How is a system of linear equations expressed as AX = B, what decision tree determines consistency, and how does Cramer's Rule solve systems via determinant ratios?
A system of n linear equations in n variables a_i1 x_1 + a_i2 x_2 + ... + a_in x_n = b_i (for i = 1, ..., n) can be written compactly as the Matrix Equation: A X = B, where A is the n x n coefficient matrix [a_ij], X is the n x 1 variable column [x_i], and B is the n x 1 constant column [b_i]. The Consistency Decision Tree classifies the system into distinct operational regimes: (1) Case 1: det(A) != 0 (Non-Singular Matrix). The system is Consistent and possesses a UNIQUE SOLUTION given by X = A^(-1) B = (1/det A) * adj(A) * B. Geometrically, the planes intersect at a single point. (2) Case 2: det(A) = 0 (Singular Matrix). To test consistency, compute the product matrix (adj A) * B: Subcase 2a: If (adj A) * B != O (non-zero matrix), the system is INCONSISTENT and possesses NO SOLUTION (planes form a triangular prism or parallel sheets with no common intersection). Subcase 2b: If (adj A) * B = O (zero matrix), the system is CONSISTENT with INFINITELY MANY SOLUTIONS (planes intersect along a line or coincide; rarely, it may be inconsistent). Cramer's Rule provides a direct determinant ratio solution: x = D_x / D, y = D_y / D, z = D_z / D, where D = det(A) != 0, and D_x, D_y, D_z are formed by replacing the x, y, z columns of D with constant column B. For Homogeneous Systems (AX = O): det(A) != 0 implies ONLY the Trivial Solution x = y = z = 0; det(A) = 0 implies Non-Trivial (Infinitely Many) Solutions.
Matrix Formulation AX = B of Linear Systems
A system of n linear equations in n variables can be written in matrix form AX = B, where A is the n x n coefficient matrix [a_ij], X is the n x 1 column vector of variables [x_1, ..., x_n]^T, and B is the n x 1 column vector of constants [b_1, ..., b_n]^T.
Consistency Criteria and Unique Solution: X = A^(-1) B
Case 1: If |A| != 0, the system is CONSISTENT and has a UNIQUE solution given by X = A^(-1) B = (1/|A|) adj(A) B. Case 2: If |A| = 0 and (adj A) B != O, the system is INCONSISTENT (No Solution). Case 3: If |A| = 0 and (adj A) B = O, the system may be consistent with INFINITELY MANY solutions or inconsistent.
Cramer's Rule for Solving Linear Systems via Determinants
For a system of 3 linear equations with determinant of coefficients D = |A| != 0, the unique solution is given by Cramer's Rule: x = D_x / D, y = D_y / D, z = D_z / D, where D_x, D_y, D_z are obtained by replacing column 1, 2, 3 of D with the constant column B.