EduProd
EduProd
JEE PCM PLATFORM
📊 Dashboard
LEARN MODULE · SCHEMATIC MODE

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.

// CHAPTER_OVERVIEW Determinants associate every square matrix with a unique scalar value that measures volume scaling, singularity, and algebraic invertibility. Master the formal recursive expansion of 2x2 and 3x3 determinants via Laplace's theorem and Sarrus' Rule; harness the 7 core determinant properties (reflection, row swaps, identical/proportional rows, scalar factor det(kA) = k^n det(A), invariance under R_i -> R_i + k R_j, and the product rule det(AB) = det(A) det(B)); explore minors, cofactors, and the profound False Expansion (Orthogonality) theorem sum a_ik A_jk = 0; conquer the Adjoint matrix adj(A) = [A_ij]^T, the fundamental theorem A * adj(A) = det(A) * I, the inverse formula A^(-1) = (1/det(A)) adj(A), and the five golden adjoint power identities det(adj A) = (det A)^(n-1); calculate geometric areas of triangles and establish 3-point collinearity; and conclude with the matrix method AX = B, consistency decision trees ((adj A)B), and Cramer's Rule for linear systems.
⚡ INTEGRATED VIRTUAL LABORATORIES (2)
Open Subject Labs Catalog ↗
Determinant 3X3 Inverse
Stage ↗
Determinant Area
Stage ↗
01

Determinant Evaluation: 2x2 & 3x3 Laplace Expansion & Sarrus' Rule

3 concepts · 4.1
3 nodes

What 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.

01

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).

Key Idea
Multiply main diagonal elements (top-left * bottom-right) and subtract the product of off-diagonal elements (top-right * bottom-left).
Why It Works
Geometrically, ad - bc calculates the cross product magnitude of 2D vectors, giving oriented physical area.
Boundary Trap
Adding the products instead of subtracting: remember it is ad MINUS bc.
Application Note
|[3, -2], [4, 5]| = 3(5) - (-2)(4) = 15 - (-8) = 15 + 8 = 23.
Derivation Trace · Evaluation of 2x2 Determinants: |[a, b], [c, d]| = ad - bc
Think of a determinant as the 'area scaling factor' of the coordinate space: a 2x2 determinant calculates the oriented area of the parallelogram formed by its two column vectors (ad - bc). A 3x3 determinant calculates the oriented volume of the 3D parallelepiped formed by its three row vectors. If the determinant equals zero, the 3D box has been squashed completely flat into a 2D sheet!
Notation Distinction: |A| represents the determinant of matrix A, NOT the absolute value. The determinant can be positive, zero, or negative. Straight vertical bars denote determinants, whereas curved or square brackets [ ] denote matrices.
The Sarrus 4x4 Trap: Students who love Sarrus' rule for 3x3 often try to copy 3 columns to solve a 4x4 determinant. Never do this! A 4x4 determinant has 4! = 24 terms, while a naive diagonal copy would produce only 8 terms. For n >= 4, you MUST use Laplace expansion or row reduction.
See it in action: Enter arbitrary 3x3 values, watch downward and upward diagonals trace in contrasting colors, and compare Sarrus' sum against Laplace expansion in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

What is the determinant of [[cos theta, -sin theta], [sin theta, cos theta]]?

Answer: cos^2(theta) - (-sin^2(theta)) = cos^2(theta) + sin^2(theta) = 1.

02

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.

Key Idea
Expansion along ANY row or column yields the EXACT same numerical determinant value.
Why It Works
Laplace expansion is an alternating multilinear form that uniquely projects an n-dimensional volume onto (n-1)-dimensional facets.
Boundary Trap
Messing up checkerboard signs (+, -, + for row 1; -, +, - for row 2; +, -, + for row 3).
Application Note
Expand |[1, 2, 4], [-1, 3, 0], [4, 1, 0]| along Column 3: 4 * |[-1, 3], [4, 1]| - 0 + 0 = 4 * (-1 - 12) = 4 * (-13) = -52.
Derivation Trace · Laplace Expansion of 3x3 Determinants Along Any Row or Column
Think of a determinant as the 'area scaling factor' of the coordinate space: a 2x2 determinant calculates the oriented area of the parallelogram formed by its two column vectors (ad - bc). A 3x3 determinant calculates the oriented volume of the 3D parallelepiped formed by its three row vectors. If the determinant equals zero, the 3D box has been squashed completely flat into a 2D sheet!
Notation Distinction: |A| represents the determinant of matrix A, NOT the absolute value. The determinant can be positive, zero, or negative. Straight vertical bars denote determinants, whereas curved or square brackets [ ] denote matrices.
The Sarrus 4x4 Trap: Students who love Sarrus' rule for 3x3 often try to copy 3 columns to solve a 4x4 determinant. Never do this! A 4x4 determinant has 4! = 24 terms, while a naive diagonal copy would produce only 8 terms. For n >= 4, you MUST use Laplace expansion or row reduction.
See it in action: Enter arbitrary 3x3 values, watch downward and upward diagonals trace in contrasting colors, and compare Sarrus' sum against Laplace expansion in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

Along which row or column should you expand |[0, 5, 0], [2, -1, 3], [4, 0, 7]|?

Answer: Row 1 (since it contains two zeros, leaving only one 2x2 sub-determinant to compute).

03

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.

Key Idea
Sarrus' rule works ONLY for 3x3 determinants; it CANNOT be used for 4x4 or higher determinants!
Why It Works
The 6 diagonal ribbons correspond directly to the 3! = 6 permutations in the Leibniz formula for 3x3 determinants.
Boundary Trap
Attempting to apply Sarrus' rule to a 4x4 determinant (where 4! = 24 terms, not 8).
Application Note
For |[a, b, c], [d, e, f], [g, h, i]|: Det = (aei + bfg + cdh) - (ceg + afh + bdi).
Derivation Trace · Sarrus' Rule (Diagonal Ribbon Rule) for 3x3 Determinants
Think of a determinant as the 'area scaling factor' of the coordinate space: a 2x2 determinant calculates the oriented area of the parallelogram formed by its two column vectors (ad - bc). A 3x3 determinant calculates the oriented volume of the 3D parallelepiped formed by its three row vectors. If the determinant equals zero, the 3D box has been squashed completely flat into a 2D sheet!
Notation Distinction: |A| represents the determinant of matrix A, NOT the absolute value. The determinant can be positive, zero, or negative. Straight vertical bars denote determinants, whereas curved or square brackets [ ] denote matrices.
The Sarrus 4x4 Trap: Students who love Sarrus' rule for 3x3 often try to copy 3 columns to solve a 4x4 determinant. Never do this! A 4x4 determinant has 4! = 24 terms, while a naive diagonal copy would produce only 8 terms. For n >= 4, you MUST use Laplace expansion or row reduction.
See it in action: Enter arbitrary 3x3 values, watch downward and upward diagonals trace in contrasting colors, and compare Sarrus' sum against Laplace expansion in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

Can Sarrus' Rule be used to evaluate a 4x4 determinant?

Answer: No. Sarrus' Rule is valid strictly and exclusively for 3x3 determinants.

02

The Seven Fundamental Properties of Determinants

3 concepts · 4.2
3 nodes

What 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).

01

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).

Key Idea
Every property that holds for rows holds identically for columns because det(A^T) = det(A).
Why It Works
Interchanging two rows swaps two basis vectors, reversing the spatial orientation (handedness) of the coordinate frame.
Boundary Trap
Forgetting to introduce a minus sign outside the determinant after swapping two rows: R_1 <-> R_2 requires a '-' prefix!
Application Note
If |A| = 15, then swapping R_1 <-> R_2 yields a new determinant equal to -15.
Derivation Trace · Transpose Invariance and Row Interchange Sign Reversal
Property 6 (Invariance) is like shifting cards in a deck: shearing a parallelogram horizontally alters its shape, but its base and perpendicular height remain identical, so its ENCLOSED AREA DOES NOT CHANGE! Adding multiples of one row to another shears the geometric parallelepiped without changing its volume.
Permitted Multi-Row Operations: You can perform multiple row operations simultaneously (e.g. R_2 -> R_2 - R_1 and R_3 -> R_3 - R_1 in the same step) PROVIDED the row being added (here R_1) is NOT ITSELF being modified in that same step.
The Proportional Scaling Trap in Invariance: If you write R_1 -> 3 R_1 + 2 R_2, you have performed TWO operations: first multiplying R_1 by 3 (which triples the determinant!), and then adding 2 R_2 (which leaves it unchanged). Therefore, Delta' = 3 Delta! To preserve the determinant, the target row itself must have a coefficient of EXACTLY 1: R_i -> R_i + k R_j.
See it in action: Apply row swap, scalar scaling, and R_i -> R_i + k R_j operations interactively and observe real-time invariance confirmations in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

If you perform two successive row swaps on matrix A, what is the determinant of the resulting matrix?

Answer: (-1)^2 * det(A) = +det(A) (the sign remains unchanged after two swaps).

02

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.

Key Idea
Instant zero: if R_i = R_j or R_i = k R_j, det(A) = 0 with no expansion needed.
Why It Works
If two rows are identical, swapping them gives det(A) = -det(A), forcing 2 det(A) = 0 => det(A) = 0.
Boundary Trap
Expanding a determinant with identical rows manually when it can be declared 0 in 5 seconds by citing Property 3.
Application Note
|[2, 3, 4], [2, 3, 4], [5, 6, 7]| = 0 immediately because R_1 is identical to R_2.
Derivation Trace · Zero Determinant Criteria: Identical Rows/Columns and Zero Rows
Property 6 (Invariance) is like shifting cards in a deck: shearing a parallelogram horizontally alters its shape, but its base and perpendicular height remain identical, so its ENCLOSED AREA DOES NOT CHANGE! Adding multiples of one row to another shears the geometric parallelepiped without changing its volume.
Permitted Multi-Row Operations: You can perform multiple row operations simultaneously (e.g. R_2 -> R_2 - R_1 and R_3 -> R_3 - R_1 in the same step) PROVIDED the row being added (here R_1) is NOT ITSELF being modified in that same step.
The Proportional Scaling Trap in Invariance: If you write R_1 -> 3 R_1 + 2 R_2, you have performed TWO operations: first multiplying R_1 by 3 (which triples the determinant!), and then adding 2 R_2 (which leaves it unchanged). Therefore, Delta' = 3 Delta! To preserve the determinant, the target row itself must have a coefficient of EXACTLY 1: R_i -> R_i + k R_j.
See it in action: Apply row swap, scalar scaling, and R_i -> R_i + k R_j operations interactively and observe real-time invariance confirmations in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

What is the value of |[1, 4, 7], [2, 8, 14], [3, 5, 9]|?

Answer: 0, because Row 2 is proportional to Row 1 (R_2 = 2 R_1).

03

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.

Key Idea
det(kA) = k^n * det(A) where n is the matrix order. The row operation R_i -> R_i + k R_j does NOT change the determinant value at all!
Why It Works
Adding a parallel shear displacement does not change the base or altitude of a parallelotope, leaving volume invariant.
Boundary Trap
Writing |kA| = k |A|: for an n x n matrix, the scalar k factors out of EVERY row, giving k^n!
Application Note
If A is a 3 x 3 matrix with |A| = 5, then |2A| = 2^3 * |A| = 8 * 5 = 40.
Derivation Trace · Scalar Scaling Law (det(kA) = k^n det(A)) and Invariance under R_i -> R_i + k R_j
Property 6 (Invariance) is like shifting cards in a deck: shearing a parallelogram horizontally alters its shape, but its base and perpendicular height remain identical, so its ENCLOSED AREA DOES NOT CHANGE! Adding multiples of one row to another shears the geometric parallelepiped without changing its volume.
Permitted Multi-Row Operations: You can perform multiple row operations simultaneously (e.g. R_2 -> R_2 - R_1 and R_3 -> R_3 - R_1 in the same step) PROVIDED the row being added (here R_1) is NOT ITSELF being modified in that same step.
The Proportional Scaling Trap in Invariance: If you write R_1 -> 3 R_1 + 2 R_2, you have performed TWO operations: first multiplying R_1 by 3 (which triples the determinant!), and then adding 2 R_2 (which leaves it unchanged). Therefore, Delta' = 3 Delta! To preserve the determinant, the target row itself must have a coefficient of EXACTLY 1: R_i -> R_i + k R_j.
See it in action: Apply row swap, scalar scaling, and R_i -> R_i + k R_j operations interactively and observe real-time invariance confirmations in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

If A is a 3x3 matrix with |A| = -2, what is |-3A|?

Answer: (-3)^3 * |A| = -27 * (-2) = 54.

03

Minors, Cofactors & The False Expansion (Orthogonality) Theorem

3 concepts · 4.3
3 nodes

What 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).

01

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.

Key Idea
Delete row i and column j, and compute the determinant of the remaining entries.
Why It Works
Minors isolate the contribution of all complementary coordinates orthogonal to the chosen entry.
Boundary Trap
Including elements from the crossed-out row or column when computing M_ij.
Application Note
In |[1, 2, 3], [4, 5, 6], [7, 8, 9]|: M_11 = |[5, 6], [8, 9]| = 45 - 48 = -3. M_12 = |[4, 6], [7, 9]| = 36 - 42 = -6.
Derivation Trace · Minor Extraction: M_ij as the Sub-Determinant of Order (n - 1)
Think of cofactors as custom-tailored locks designed to fit their own row's keys (elements). When key a_i inserts into its own lock A_i, the door unlocks, revealing the determinant value |A|. But if key a_i tries to insert into a foreign lock A_j from a different row, the teeth mismatch completely, jamming the lock to an absolute ZERO.
Kronecker Delta Formulation: NCERT Theorem: If elements of a row (or column) are multiplied with cofactors of any other row (or column), then their sum is zero. Example for order 3: a_11 A_21 + a_12 A_22 + a_13 A_23 = 0, and a_11 A_31 + a_12 A_32 + a_13 A_33 = 0.
Minor vs Cofactor Sign Slip: In 3x3, the minor M_12 is a positive or negative number, but the cofactor A_12 MUST have its sign flipped: A_12 = -M_12. Missing this minus sign is the single most common cause of incorrect adjoint matrices in examinations.
See it in action: Click any cell to watch row i and column j vanish, revealing the highlighted submatrix minor and its attached sign in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

What is the minor M_21 of the matrix [[1, 2], [3, 4]]?

Answer: Delete row 2 and column 1: M_21 = 2.

02

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).

Key Idea
Cofactor = Minor with its positional sign: A_ij = +M_ij if i+j is even; A_ij = -M_ij if i+j is odd.
Why It Works
The (-1)^(i + j) parity factor accounts for the number of row and column transpositions needed to shift element a_ij to the top-left position (1, 1).
Boundary Trap
Forgetting the minus sign for odd positions like (1, 2), (2, 1), (2, 3), (3, 2).
Application Note
If M_12 = -6: i+j = 1+2 = 3 (odd), so A_12 = (-1)^3 * (-6) = -(-6) = +6.
Derivation Trace · Cofactor Definition: A_ij = (-1)^(i + j) * M_ij and Checkerboard Signs
Think of cofactors as custom-tailored locks designed to fit their own row's keys (elements). When key a_i inserts into its own lock A_i, the door unlocks, revealing the determinant value |A|. But if key a_i tries to insert into a foreign lock A_j from a different row, the teeth mismatch completely, jamming the lock to an absolute ZERO.
Kronecker Delta Formulation: NCERT Theorem: If elements of a row (or column) are multiplied with cofactors of any other row (or column), then their sum is zero. Example for order 3: a_11 A_21 + a_12 A_22 + a_13 A_23 = 0, and a_11 A_31 + a_12 A_32 + a_13 A_33 = 0.
Minor vs Cofactor Sign Slip: In 3x3, the minor M_12 is a positive or negative number, but the cofactor A_12 MUST have its sign flipped: A_12 = -M_12. Missing this minus sign is the single most common cause of incorrect adjoint matrices in examinations.
See it in action: Click any cell to watch row i and column j vanish, revealing the highlighted submatrix minor and its attached sign in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

What is the sign factor (-1)^(i + j) for the element at position (2, 3)?

Answer: (-1)^(2 + 3) = (-1)^5 = -1 (a minus sign).

03

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)).

Key Idea
Elements of row i * Cofactors of row i = det(A). Elements of row i * Cofactors of row j (i != j) = 0.
Why It Works
Multiplying row i by cofactors of row j constructs the determinant of a fictitious matrix whose j-th row has been replaced by row i. This matrix has two identical rows (row i and row j), so its determinant is zero!
Boundary Trap
Expecting a non-zero value when multiplying elements of row 1 by cofactors of row 3: the result is ALWAYS zero!
Application Note
For a 3x3 matrix: a_11 A_21 + a_12 A_22 + a_13 A_23 = 0 identically.
Derivation Trace · The False Expansion (Orthogonality) Theorem: sum a_ik * A_jk = 0 for i != j
Think of cofactors as custom-tailored locks designed to fit their own row's keys (elements). When key a_i inserts into its own lock A_i, the door unlocks, revealing the determinant value |A|. But if key a_i tries to insert into a foreign lock A_j from a different row, the teeth mismatch completely, jamming the lock to an absolute ZERO.
Kronecker Delta Formulation: NCERT Theorem: If elements of a row (or column) are multiplied with cofactors of any other row (or column), then their sum is zero. Example for order 3: a_11 A_21 + a_12 A_22 + a_13 A_23 = 0, and a_11 A_31 + a_12 A_32 + a_13 A_33 = 0.
Minor vs Cofactor Sign Slip: In 3x3, the minor M_12 is a positive or negative number, but the cofactor A_12 MUST have its sign flipped: A_12 = -M_12. Missing this minus sign is the single most common cause of incorrect adjoint matrices in examinations.
See it in action: Click any cell to watch row i and column j vanish, revealing the highlighted submatrix minor and its attached sign in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

What is the value of a_11 A_31 + a_12 A_32 + a_13 A_33?

Answer: 0 (by the False Expansion Theorem, since elements of row 1 are paired with cofactors of row 3).

04

Adjoint of a Matrix, Inverses & The 5 Golden Power Identities

3 concepts · 4.4
3 nodes

How 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].

01

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]].

Key Idea
Do not forget the transpose! Compute the cofactors, place them in a matrix, and TRANSPOSE.
Why It Works
Transposing aligns cofactors along orthogonal columns, directly satisfying the matrix inversion identity.
Boundary Trap
Forgetting to transpose the cofactor matrix: leaving [A_ij] instead of [A_ij]^T is the #1 student mistake in board exams!
Application Note
For A = [[2, 3], [1, 4]]: Swap diagonal: 4 and 2. Negate off-diagonal: -3 and -1. adj(A) = [[4, -3], [-1, 2]].
Derivation Trace · Adjoint of a Matrix: adj(A) = [A_ij]^T (Transpose of Cofactor Matrix)
Adjoint is the cofactor matrix with its rows and columns transposed. Think of the inverse formula A^(-1) = (1/|A|) adj(A) as reciprocal division: just as a^(-1) = 1/a for real numbers, a matrix is inverted by dividing its adjoint matrix by its scalar volume |A|. If |A| = 0, you would be dividing by zero, which is why singular matrices cannot be inverted!
Proof of det(adj A) = |A|^(n - 1): Take determinants of both sides of A * adj(A) = |A| * I_n. By product rule: det(A) * det(adj A) = det(|A| * I_n). Since |A| is a scalar, det(|A| * I_n) = (|A|)^n * det(I_n) = |A|^n * 1. Dividing both sides by det(A) (assuming det A != 0) gives det(adj A) = |A|^(n - 1).
The Order n Exponent Trap: For order n = 3, det(adj A) = |A|^(3 - 1) = |A|^2. If |A| = 5, det(adj A) = 25! Students frequently write |adj A| = |A|^3 by confusing det(adj A) with det(kA). Remember: the exponent is n - 1, NOT n!
See it in action: Enter any 3x3 matrix, click 'Invert', and watch the cofactor matrix transpose into adj(A) and scale by 1/|A| in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

What is the adjoint of [[1, 2], [3, 4]]?

Answer: [[4, -2], [-3, 1]].

02

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|.

Key Idea
A is invertible if and only if |A| != 0. If |A| = 0, A is singular and has no inverse.
Why It Works
The diagonal entries of A * adj(A) are row expansions sum a_ik A_ik = |A|; all off-diagonal entries are false expansions = 0. Dividing by scalar |A| yields I.
Boundary Trap
Attempting to invert a singular matrix (|A| = 0): division by zero is undefined, so no inverse exists.
Application Note
If |A| = 5 and adj(A) = [[4, -3], [-1, 2]], then A^(-1) = (1/5) * [[4, -3], [-1, 2]].
Derivation Trace · The Fundamental Inversion Theorem: A * adj(A) = |A| * I and A^(-1) = adj(A) / |A|
Adjoint is the cofactor matrix with its rows and columns transposed. Think of the inverse formula A^(-1) = (1/|A|) adj(A) as reciprocal division: just as a^(-1) = 1/a for real numbers, a matrix is inverted by dividing its adjoint matrix by its scalar volume |A|. If |A| = 0, you would be dividing by zero, which is why singular matrices cannot be inverted!
Proof of det(adj A) = |A|^(n - 1): Take determinants of both sides of A * adj(A) = |A| * I_n. By product rule: det(A) * det(adj A) = det(|A| * I_n). Since |A| is a scalar, det(|A| * I_n) = (|A|)^n * det(I_n) = |A|^n * 1. Dividing both sides by det(A) (assuming det A != 0) gives det(adj A) = |A|^(n - 1).
The Order n Exponent Trap: For order n = 3, det(adj A) = |A|^(3 - 1) = |A|^2. If |A| = 5, det(adj A) = 25! Students frequently write |adj A| = |A|^3 by confusing det(adj A) with det(kA). Remember: the exponent is n - 1, NOT n!
See it in action: Enter any 3x3 matrix, click 'Invert', and watch the cofactor matrix transpose into adj(A) and scale by 1/|A| in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

If A is a 3x3 matrix and A * adj(A) = 10 * I_3, what is |A|?

Answer: |A| = 10.

03

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.

Key Idea
For order n = 3: |adj(A)| = |A|^2; |adj(adj(A))| = |A|^4; adj(adj(A)) = |A| * A.
Why It Works
Taking determinants of both sides of A * adj(A) = |A| I gives |A| * |adj(A)| = |A|^n * |I| = |A|^n. Dividing by |A| yields |adj(A)| = |A|^(n - 1).
Boundary Trap
Using |adj(A)| = |A|^n instead of |A|^(n - 1): remember the exponent is n MINUS 1!
Application Note
If A is a 3 x 3 matrix with |A| = 4: |adj(A)| = 4^(3 - 1) = 4^2 = 16. |adj(adj(A))| = 4^((3-1)^2) = 4^4 = 256.
Derivation Trace · The Five Golden Power Identities for Adjoint Determinants
Adjoint is the cofactor matrix with its rows and columns transposed. Think of the inverse formula A^(-1) = (1/|A|) adj(A) as reciprocal division: just as a^(-1) = 1/a for real numbers, a matrix is inverted by dividing its adjoint matrix by its scalar volume |A|. If |A| = 0, you would be dividing by zero, which is why singular matrices cannot be inverted!
Proof of det(adj A) = |A|^(n - 1): Take determinants of both sides of A * adj(A) = |A| * I_n. By product rule: det(A) * det(adj A) = det(|A| * I_n). Since |A| is a scalar, det(|A| * I_n) = (|A|)^n * det(I_n) = |A|^n * 1. Dividing both sides by det(A) (assuming det A != 0) gives det(adj A) = |A|^(n - 1).
The Order n Exponent Trap: For order n = 3, det(adj A) = |A|^(3 - 1) = |A|^2. If |A| = 5, det(adj A) = 25! Students frequently write |adj A| = |A|^3 by confusing det(adj A) with det(kA). Remember: the exponent is n - 1, NOT n!
See it in action: Enter any 3x3 matrix, click 'Invert', and watch the cofactor matrix transpose into adj(A) and scale by 1/|A| in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

If A is a 3x3 matrix with |A| = 3, what is |adj(A)|?

Answer: |adj(A)| = 3^(3 - 1) = 3^2 = 9.

05

Applications: Area of Triangles & Collinearity of Points

3 concepts · 4.5
3 nodes

How 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.

01

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.

Key Idea
The third column is ALWAYS all ones: [1, 1, 1]^T. Multiply determinant by 1/2.
Why It Works
The determinant computes the cross product of 2D displacement vectors (x2-x1, y2-y1) and (x3-x1, y3-y1); halving gives triangle area.
Boundary Trap
Omitting the factor of 1/2 or reporting a negative area when the determinant evaluates to a negative number.
Application Note
Vertices (1, 0), (6, 0), (4, 3): Det = |[1, 0, 1], [6, 0, 1], [4, 3, 1]| = -3 * (1 - 6) = 15. Area = (1/2) * 15 = 7.5 sq units.
Derivation Trace · Area of Triangle via Determinant Form
Picture three points on a sheet of rubber: as long as they form a triangle, the determinant measures the area of the patch between them. If you pull the third point straight onto the line joining the other two, the patch flattens into a line segment of zero thickness, and the determinant drops to exactly zero.
The Dual Sign (+-) Rule for Unknown Parameters: If an exam question states: 'Find values of k if area of triangle with vertices (k, 0), (4, 0), (0, 2) is 4 sq units', you MUST write: 1/2 * det = +-4! Solving 1/2 * det = +4 gives one value of k, and 1/2 * det = -4 gives a second value of k. Forgetting +- is an automatic loss of half marks.
1/2 Factor Omission: The determinant |x_1, y_1, 1; x_2, y_2, 1; x_3, y_3, 1| evaluates the area of the PARALLELOGRAM formed by the vectors. A triangle is exactly HALF of a parallelogram, so never forget the leading 1/2 factor!
See it in action: Drag triangle vertices on the 2D Cartesian plane, watch the determinant calculate real-time area, and pull points into a straight line to observe Delta = 0 in the Collinearity Area Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

What is the area of a triangle with vertices (0, 0), (3, 0), and (0, 4)?

Answer: Area = (1/2) * |3 * 4| = 6 sq units.

02

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.

Key Idea
Zero area means the three vertices collapse onto a single 1D straight line.
Why It Works
If three points lie on a straight line, displacement vectors AB and AC are linearly dependent, forcing the determinant to vanish.
Boundary Trap
When finding an unknown k given area = 4, using only +4: you MUST set determinant = +/- 4 (two possible values of k!).
Application Note
Show (a, b+c), (b, c+a), (c, a+b) are collinear: C_2 -> C_2 + C_1 makes col 2 equal to (a+b+c)*[1, 1, 1]^T. Col 2 is proportional to Col 3, so Det = 0.
Derivation Trace · Collinearity Condition: Det = 0 for Three Points
Picture three points on a sheet of rubber: as long as they form a triangle, the determinant measures the area of the patch between them. If you pull the third point straight onto the line joining the other two, the patch flattens into a line segment of zero thickness, and the determinant drops to exactly zero.
The Dual Sign (+-) Rule for Unknown Parameters: If an exam question states: 'Find values of k if area of triangle with vertices (k, 0), (4, 0), (0, 2) is 4 sq units', you MUST write: 1/2 * det = +-4! Solving 1/2 * det = +4 gives one value of k, and 1/2 * det = -4 gives a second value of k. Forgetting +- is an automatic loss of half marks.
1/2 Factor Omission: The determinant |x_1, y_1, 1; x_2, y_2, 1; x_3, y_3, 1| evaluates the area of the PARALLELOGRAM formed by the vectors. A triangle is exactly HALF of a parallelogram, so never forget the leading 1/2 factor!
See it in action: Drag triangle vertices on the 2D Cartesian plane, watch the determinant calculate real-time area, and pull points into a straight line to observe Delta = 0 in the Collinearity Area Explorer.
🔬 VIRTUAL LAB Determinant Area
Full Stage ↗
? Quick Concept Check

If area of triangle with vertices (k, 0), (4, 0), (0, 2) is 4 sq units, how many values can k take?

Answer: Two values (by setting the determinant equal to +8 and -8).

03

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.

Key Idea
An arbitrary point (x, y) lies on the line if and only if (x, y), (x1, y1), and (x2, y2) are collinear.
Why It Works
Requiring the area of the triangle formed by variable point (x, y) and the two given points to be zero forces (x, y) onto the line.
Boundary Trap
Expanding along the bottom row instead of row 1 (which directly yields ax + by + c = 0).
Application Note
Line through (1, 2) and (3, 6): |[x, y, 1], [1, 2, 1], [3, 6, 1]| = 0 => x(2 - 6) - y(1 - 3) + 1(6 - 6) = 0 => -4x + 2y = 0 => y = 2x.
Derivation Trace · Equation of Line Passing Through Two Points via Determinant Form
Picture three points on a sheet of rubber: as long as they form a triangle, the determinant measures the area of the patch between them. If you pull the third point straight onto the line joining the other two, the patch flattens into a line segment of zero thickness, and the determinant drops to exactly zero.
The Dual Sign (+-) Rule for Unknown Parameters: If an exam question states: 'Find values of k if area of triangle with vertices (k, 0), (4, 0), (0, 2) is 4 sq units', you MUST write: 1/2 * det = +-4! Solving 1/2 * det = +4 gives one value of k, and 1/2 * det = -4 gives a second value of k. Forgetting +- is an automatic loss of half marks.
1/2 Factor Omission: The determinant |x_1, y_1, 1; x_2, y_2, 1; x_3, y_3, 1| evaluates the area of the PARALLELOGRAM formed by the vectors. A triangle is exactly HALF of a parallelogram, so never forget the leading 1/2 factor!
See it in action: Drag triangle vertices on the 2D Cartesian plane, watch the determinant calculate real-time area, and pull points into a straight line to observe Delta = 0 in the Collinearity Area Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

Find equation of line joining (0, 0) and (2, 3) using determinants.

Answer: |[x, y, 1], [0, 0, 1], [2, 3, 1]| = 0 => 1(3x - 2y) = 0 => 3x - 2y = 0.

06

System of Linear Equations: Matrix Method, Consistency & Cramer's Rule

3 concepts · 4.6
3 nodes

How 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.

01

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.

Key Idea
Every linear system is equivalent to a single linear vector equation AX = B.
Why It Works
Matrix multiplication AX performs the row-by-column linear combinations representing each equation.
Boundary Trap
Misplacing signs or omitting zero coefficients for missing variables (e.g., if equation is x + z = 2, the y coefficient is 0!).
Application Note
System: 2x + 5y = 1, 3x + 2y = 7. In matrix form: [[2, 5], [3, 2]] * [[x], [y]] = [[1], [7]].
Derivation Trace · Matrix Formulation AX = B of Linear Systems
Think of three linear equations as three sheets of glass in a room: If det(A) != 0, the three sheets meet at a single sharp corner point (unique solution). If det(A) = 0, the sheets are either parallel like ceiling and floor (no solution, (adj A)B != O) or they fold together along a single crease line like an open book (infinitely many solutions, (adj A)B = O).
Checking Consistency in Board Exams: Step 1: Write down A, X, B. Step 2: Evaluate |A|. If |A| != 0, immediately declare consistent with unique solution and compute X = A^(-1) B. Step 3: If |A| = 0, calculate (adj A) * B. If non-zero, declare inconsistent. If zero, declare consistent with infinite solutions.
Homogeneous System Zero Condition: In competitive exams (JEE Main & Advanced), questions constantly ask: 'Find lambda if the system of equations has a non-trivial solution'. For a homogeneous system (constants all 0), a non-trivial solution exists IF AND ONLY IF det(A) = 0! Simply set the 3x3 determinant to zero and solve for lambda.
See it in action: Adjust equation coefficients, watch the 3D plane intersection geometry shift between a unique point, a line, and parallel sheets, and verify Cramer's ratios in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

What is the coefficient matrix A for the system x + y = 2 and y + z = 3 and x + z = 4?

Answer: [[1, 1, 0], [0, 1, 1], [1, 0, 1]].

02

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.

Key Idea
First step is ALWAYS to calculate |A|. If |A| != 0, compute A^(-1) and multiply by B.
Why It Works
If |A| != 0, A is invertible; multiplying both sides of AX = B by A^(-1) uniquely solves X = A^(-1) B.
Boundary Trap
Multiplying B * A^(-1) instead of A^(-1) * B: matrix multiplication is non-commutative and order-dependent!
Application Note
For [[2, 5], [3, 2]] with |A| = 4 - 15 = -11 != 0: A^(-1) = -(1/11)[[2, -5], [-3, 2]]. X = -(1/11)[[2, -5], [-3, 2]] * [[1], [7]] = -(1/11)[[-33], [11]] = [[3], [-1]]. Thus x = 3, y = -1.
Derivation Trace · Consistency Criteria and Unique Solution: X = A^(-1) B
Think of three linear equations as three sheets of glass in a room: If det(A) != 0, the three sheets meet at a single sharp corner point (unique solution). If det(A) = 0, the sheets are either parallel like ceiling and floor (no solution, (adj A)B != O) or they fold together along a single crease line like an open book (infinitely many solutions, (adj A)B = O).
Checking Consistency in Board Exams: Step 1: Write down A, X, B. Step 2: Evaluate |A|. If |A| != 0, immediately declare consistent with unique solution and compute X = A^(-1) B. Step 3: If |A| = 0, calculate (adj A) * B. If non-zero, declare inconsistent. If zero, declare consistent with infinite solutions.
Homogeneous System Zero Condition: In competitive exams (JEE Main & Advanced), questions constantly ask: 'Find lambda if the system of equations has a non-trivial solution'. For a homogeneous system (constants all 0), a non-trivial solution exists IF AND ONLY IF det(A) = 0! Simply set the 3x3 determinant to zero and solve for lambda.
See it in action: Adjust equation coefficients, watch the 3D plane intersection geometry shift between a unique point, a line, and parallel sheets, and verify Cramer's ratios in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

If |A| = 0 and (adj A) * B != O, how many solutions does the system have?

Answer: Zero solutions (the system is inconsistent).

03

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.

Key Idea
Cramer's rule provides a direct formula for each individual variable without having to compute the full inverse matrix.
Why It Works
Replacing column i with B and expanding along that column algebraically evaluates the i-th component of A^(-1) B.
Boundary Trap
Applying Cramer's rule when D = 0: Cramer's rule is valid only when D != 0.
Application Note
If D = 10, D_x = 20, D_y = -30, D_z = 50: x = 20/10 = 2, y = -30/10 = -3, z = 50/10 = 5.
Derivation Trace · Cramer's Rule for Solving Linear Systems via Determinants
Think of three linear equations as three sheets of glass in a room: If det(A) != 0, the three sheets meet at a single sharp corner point (unique solution). If det(A) = 0, the sheets are either parallel like ceiling and floor (no solution, (adj A)B != O) or they fold together along a single crease line like an open book (infinitely many solutions, (adj A)B = O).
Checking Consistency in Board Exams: Step 1: Write down A, X, B. Step 2: Evaluate |A|. If |A| != 0, immediately declare consistent with unique solution and compute X = A^(-1) B. Step 3: If |A| = 0, calculate (adj A) * B. If non-zero, declare inconsistent. If zero, declare consistent with infinite solutions.
Homogeneous System Zero Condition: In competitive exams (JEE Main & Advanced), questions constantly ask: 'Find lambda if the system of equations has a non-trivial solution'. For a homogeneous system (constants all 0), a non-trivial solution exists IF AND ONLY IF det(A) = 0! Simply set the 3x3 determinant to zero and solve for lambda.
See it in action: Adjust equation coefficients, watch the 3D plane intersection geometry shift between a unique point, a line, and parallel sheets, and verify Cramer's ratios in the Determinant 3x3 Explorer.
🔬 VIRTUAL LAB Determinant 3X3 Inverse
Full Stage ↗
? Quick Concept Check

Under what condition is Cramer's Rule applicable?

Answer: When the coefficient determinant D is non-zero (D != 0).