Chapter 4 — Determinants

What is a determinant? The determinant is a scalar value associated with every square matrix that encodes geometric and algebraic information about the linear map the matrix represents. For a matrix A (order n), det(A) is a single number that tells, for example, how volumes scale under the linear transformation, and whether the transformation is invertible (det(A) ≠ 0).

Basic definitions (small orders)

• Order 1: If A = [a], then det(A) = a.
• Order 2: For A = [[a, b], [c, d]],

  det(A) = ad - bc

• Order 3: For A = \begin{pmatrix}a_{11} & a_{12} & a_{13} \\ a_{21} & a_{22} & a_{23} \\ a_{31} & a_{32} & a_{33}\end{pmatrix}, one convenient mnemonic (Sarrus' rule) gives

  det(A) = a_{11}a_{22}a_{33} + a_{12}a_{23}a_{31} + a_{13}a_{21}a_{32}
            - a_{13}a_{22}a_{31} - a_{11}a_{23}a_{32} - a_{12}a_{21}a_{33}

General (n × n) definition by cofactor expansion

Let A = (a_{ij}) be an n×n matrix. The minor M_{ij} is the determinant of the (n−1)×(n−1) matrix obtained by deleting row i and column j. The cofactor C_{ij} = (−1)^{i+j} M_{ij}. Fix any row i (or column j); then

det(A) = a_{i1}C_{i1} + a_{i2}C_{i2} + … + a_{in}C_{in}.
(Equivalent expansion works along any column.)

Key conceptual facts (why determinant matters)

• Determinant gives signed area (2×2 case) or signed volume (3×3 case): the absolute value is the scale factor of area/volume under the linear map; the sign indicates orientation (positive = orientation preserved, negative = orientation reversed).
• Matrix is invertible iff det ≠ 0.
• There is a unique function on square matrices that is multilinear in rows, alternating (zero if two rows equal), and equal to 1 on the identity; that function is the determinant.

Common properties used in calculations

• det(AB) = det(A)·det(B)
• det(A^T) = det(A)
• If two rows (or columns) are equal, det = 0.
• Interchanging two rows multiplies det by −1.
• Adding a multiple of one row to another leaves det unchanged.
• If A is triangular (upper or lower), det(A) = product of diagonal entries.

Summary: Determinant is a scalar function of a square matrix defined concretely by simple formulas in low dimensions and generally by cofactor expansion (or permutation formulas). It measures scaling of oriented volume and determines invertibility.

Overview: A determinant is a scalar value associated with a square matrix that encodes geometric information (area, volume, orientation) and algebraic properties (invertibility, linear dependence). For Class 12 we focus on 2×2 and 3×3 determinants, methods to compute them, and their geometric meaning.

Determinant of order 2: For matrix A = [[a, b], [c, d]], the determinant (written det(A) or |A|) is

|A| = ad − bc.

Geometric meaning: If the two column vectors of A are v = (a, c) and w = (b, d), then |ad − bc| is the area of the parallelogram spanned by v and w. The sign indicates orientation.

Determinant of order 3: For A = [[a, b, c], [d, e, f], [g, h, i]], there are two standard ways to compute det(A):

• Sarrus' rule (mnemonical): repeat the first two columns after the matrix and sum the products of the three downward diagonals, then subtract the sum of the three upward diagonals. This yields

  det(A) = aei + bfg + cdh − ceg − bdi − afh.

• Cofactor (expansion) method: expand along a row (say the first):

  det(A) = aC11 + bC12 + cC13,

  where C1j = (−1)^{1+j} times the 2×2 minor obtained by deleting row 1 and column j. Concretely,

  det(A) = a(ei − fh) − b(di − fg) + c(dh − eg).

Important properties (useful shortcuts):

• det(I) = 1 for the identity matrix.
• If two rows (or columns) are equal or proportional, det = 0 (linear dependence).
• Swapping two rows (or two columns) multiplies det by −1.
• Multiplying a row by scalar k multiplies det by k (so multiplying entire matrix by k multiplies det by k^n for n×n matrix).
• det(AB) = det(A)·det(B) and det(A^T) = det(A).
• A square matrix is invertible iff its determinant ≠ 0; inverse (for 2×2) uses det in denominator.

Geometric applications: area of triangle from coordinates: for points (x1,y1),(x2,y2),(x3,y3),

Area = (1/2)·|det([[x1,y1,1],[x2,y2,1],[x3,y3,1]])|.

Summary: For 2×2 use ad − bc. For 3×3 use Sarrus or cofactor expansion. Determinants give quick tests for invertibility and measure oriented area/volume in geometry.

What is a determinant (permutation definition)?

For an n x n matrix A = [a_{ij}], the determinant is defined as a signed sum over all permutations of column indices. Let S_n be the set of all permutations sigma of {1,2,...,n}. Then

det(A) = sum_{sigma in S_n} sgn(sigma)  prod_{i=1}^n a_{i, sigma(i)}

Each term picks exactly one element from every row and every column: from row i we take the entry in column sigma(i). The factor sgn(sigma) is +1 if the permutation is even and -1 if it is odd.

Sign of a permutation (two equivalent definitions)

• Inversion count: N(sigma) = number of pairs (i,j) with i < j and sigma(i) > sigma(j). Then sgn(sigma) = (-1)^{N(sigma)}.
• Transposition parity: sgn(sigma) = (-1)^{t} where t is the minimum number of transpositions (swaps) needed to obtain sigma from the identity permutation.

Key consequences and intuitive points

• There are n! terms in the permutation sum; for large n this is not practical for direct computation but gives the fundamental definition.
• If two rows (or two columns) are equal, det(A)=0: swapping those two rows changes the sign but leaves the matrix unchanged, so det = -det implies det = 0.
• Row swap changes sign: swapping two rows (or two columns) multiplies determinant by -1.
• Determinant is multilinear in rows (or columns): linear in each row separately while other rows are fixed.
• det(AB) = det(A) det(B) and det(A^T) = det(A).

Small examples to see the formula

2x2 matrix A = [ [a11, a12], [a21, a22] ]: S_2 has two permutations: identity (1,2) with sign +1, and transposition (2,1) with sign -1, so

det(A) = + a11*a22  - a12*a21

3x3 matrix A = [a_{ij}]: S_3 has 6 permutations. Writing them with their signs:

(1,2,3) : + a11 a22 a33
(1,3,2) : - a11 a23 a32
(2,1,3) : - a12 a21 a33
(2,3,1) : + a12 a23 a31
(3,1,2) : + a13 a21 a32
(3,2,1) : - a13 a22 a31

So det(A) = a11 a22 a33 - a11 a23 a32 - a12 a21 a33 + a12 a23 a31 + a13 a21 a32 - a13 a22 a31

This is the Leibniz formula and is the basis for theoretical proofs of determinant properties.

Practical note: For computations one usually uses row reduction, Laplace expansion, or algorithms like LU decomposition rather than summing n! terms.

Real-life meaning (intuition)

• For 2x2 and 3x3 matrices representing linear maps, the absolute value of the determinant gives area (2D) or volume (3D) scaling factor; the sign indicates orientation (preserves or reverses).
• In solving linear systems, a nonzero determinant for the coefficient matrix means a unique solution (invertible matrix).
• In computer graphics and engineering, determinants measure how mappings stretch/compress objects; in physics they appear in change-of-variable formulas (Jacobian determinant).

Definition (Minor): For a square matrix A = (a_ij) of order n, the minor M_ij is the determinant of the (n-1)×(n-1) submatrix obtained by deleting the i-th row and j-th column of A.

Definition (Cofactor): The cofactor A_ij corresponding to a_ij is given by

A_ij = (−1)^i+j M_ij.

Thus each cofactor is the minor multiplied by a sign factor that follows a checkerboard pattern of + and − starting with + at position (1,1):

[ (+) (−) (+) ... ]
[ (−) (+) (−) ... ]
[ (+) (−) (+) ... ]

Laplace (Expansion) Theorem: Determinant of A can be expanded along any row i or any column j:

det(A) = Σ_j=1ⁿ a_ij A_ij (expansion along i-th row)

det(A) = Σ_i=1ⁿ a_ij A_ij (expansion along j-th column)

Relation to Adjoint and Inverse:

Cofactor matrix C = (A_ij) and adj(A) = C^T (transpose of cofactor matrix). If det(A) ≠ 0 then

A⁻¹ = (1 / det(A)) · adj(A).

Why minors and cofactors matter:

• They provide a systematic method (Laplace expansion) to compute determinants of any size.
• Cofactors are used to build adj(A) and hence to compute A⁻¹ when det(A) ≠ 0.
• Principal minors (minors obtained by deleting corresponding rows and columns) are important in tests for positive-definiteness in linear algebra and statistics (covariance matrices).

Practical notes:

• For computation, expand along a row or column with many zeros to simplify work.
• For 2×2 matrices, minors and cofactors give the familiar formula det([[a,b],[c,d]]) = ad − bc, and inverse = (1/(ad−bc))[[d,−b],[−c,a]].

Real-life uses (brief):

• Computer graphics and robotics: Inverse of transformation matrices (via cofactors/adjoint) is used to undo rotations/scaling and convert between coordinate frames.
• Area/volume calculations: For 2×2 (area) and 3×3 (volume) linear maps, determinants give signed area/volume; minors appear in computing Jacobians and sub-transformations.
• Engineering and circuits: Determinants and cofactors appear in solving linear systems (Cramer’s rule) used in circuit analysis and structural calculations.
• Statistics: Principal minors of covariance matrices are used in tests for positive-definiteness (important for multivariate distributions).

Definition: Expansion by minors and cofactors (Laplace expansion) is a method to compute the determinant of an n × n matrix by expressing it as a sum of elements of any one row (or column) multiplied by their corresponding cofactors. The expansion reduces the determinant of an n × n matrix to determinants of (n-1) × (n-1) matrices (minors), and is applied recursively until 1 × 1 determinants are reached.

Minor and Cofactor:

• Minor M_ij: determinant of the (n-1) × (n-1) matrix obtained by deleting the i-th row and j-th column from A.
• Cofactor C_ij: defined as C_ij = (-1)^i+j M_ij. The sign factor alternates in a checkerboard pattern starting with + at (1,1).

Laplace Expansion (row or column): For any fixed row i,

det(A) = a_i1C_i1 + a_i2C_i2 + … + a_inC_in.

Equivalently, for any fixed column j,

det(A) = a_1jC_1j + a_2jC_2j + … + a_njC_nj.

How to use (step-by-step):

1. Choose a row or column with many zeros (to simplify).
2. For each nonzero entry a_ij in that row/column compute the minor M_ij by deleting row i and column j and taking the determinant of the smaller matrix.
3. Compute the cofactor C_ij = (-1)^i+jM_ij.
4. Multiply a_ij by its cofactor and sum the contributions.
5. If the minors are still larger than 2 × 2, repeat recursively (Laplace expansion) until reaching 1 × 1 determinants.

Remarks and related results:

• Expansion along any row or any column yields the same value (determinant is well-defined).
• For triangular (upper or lower) matrices determinant equals the product of diagonal entries — this is often faster than expansion.
• Cofactor matrix: matrix of cofactors C = [C_ij]. The adjoint (classical adjoint) adj(A) is the transpose of the cofactor matrix: adj(A) = C^T.
• If det(A) ≠ 0 then A^-1 = (1 / det(A)) · adj(A). This formula uses cofactors directly to compute the inverse.
• Laplace expansion is recursive and is conceptually important; for large numerical matrices, LU decomposition is computationally more efficient.

Overview: The determinant is a scalar value associated with a square matrix that encodes important algebraic and geometric information: scale factor of volume/area under the linear map, whether the map preserves orientation, and whether the matrix is invertible. For a matrix A, the determinant is denoted det(A) or |A|.

Basic properties (row/column operations)

• Swap rows (or columns): Interchanging two rows (or two columns) multiplies the determinant by −1. If B is obtained from A by swapping row i and j, then det(B) = −det(A).
• Scale a row (or column): Multiplying one row (or one column) by a scalar k multiplies the determinant by k. If B is obtained from A by multiplying row i by k, then det(B) = k·det(A).
• Add a multiple of one row to another: Adding a scalar multiple of one row to another row leaves the determinant unchanged. If B is obtained from A by replacing row i by (row i + c·row j), then det(B) = det(A).
• Zero or repeated rows/columns: If a matrix has a row (or column) of all zeros, or two equal (or proportional) rows (or columns), then its determinant is 0. This reflects linear dependence and non-invertibility.

Multilinearity and alternation: The determinant is multilinear in rows (and columns): it is linear in each row while other rows are fixed. It is alternating: if two rows are equal, the determinant is zero. These two facts underlie the row-operation rules above.

Other important properties

• Determinant of transpose: det(A^T) = det(A).
• Multiplicative property: For square matrices A and B of the same size, det(AB) = det(A)·det(B). In particular, det(A^{-1}) = 1/det(A) when A is invertible.
• Triangular matrices: If A is upper- or lower-triangular (including diagonal), det(A) equals the product of its diagonal entries: det(A) = a_11·a_22·...·a_nn.
• Identity and singularity: det(I) = 1. A matrix A is invertible iff det(A) ≠ 0; det(A) = 0 indicates a singular matrix (linearly dependent rows/columns).
• Expansion by cofactors: The determinant can be computed by expansion along any row or column: det(A) = Σ_j a_{ij} C_{ij} where C_{ij} = (−1)^{i+j} M_{ij} and M_{ij} is the minor (determinant of the submatrix formed by deleting row i and column j).
• Adjoint and inverse: adj(A) is the transpose of the cofactor matrix. If det(A) ≠ 0, then A^{-1} = (1/det(A))·adj(A).
• Eigenvalues: For an n×n matrix, det(A) equals the product of its eigenvalues (counted with algebraic multiplicity).

Geometric interpretation: For a 2×2 matrix whose columns are vectors v and w, |det(A)| is the area of the parallelogram spanned by v and w; the sign gives orientation (positive = orientation preserved). For a 3×3 matrix, |det(A)| is the volume scale factor of the parallelepiped formed by the three column vectors. More generally, for an n×n matrix, det(A) is the factor by which n-dimensional volumes are scaled under the linear map x ↦ Ax.

Why these properties matter: The row-operation rules let you compute determinants efficiently (Gaussian elimination while tracking scalar and sign changes). The multiplicative and geometric properties connect determinants to invertibility, change of variables (Jacobian), eigenvalue problems, and applications in physics, engineering and graphics.

Computation tips: Use row/column operations to create zeros and reduce to triangular form (tracking scalings and swaps), then multiply diagonal entries. Expansion by cofactors is useful for small matrices or when a row/column has many zeros.

Overview: The determinant is a multilinear, alternating function of rows (or columns) of a square matrix. Elementary row (or column) operations change the determinant in simple, predictable ways. Understanding these effects both helps to compute determinants efficiently (by row reduction) and explains geometric meaning (area/volume scaling).

Three elementary operations and their effects (apply equally to columns):

• Type I — Swap two rows: If B is obtained from A by swapping rows i and j, then det(B) = −det(A). (A single swap changes sign.)
• Type II — Multiply a row by scalar k: If B is obtained by multiplying row i of A by k, then det(B) = k·det(A). (Scaling one row scales determinant by k.)
• Type III — Add a multiple of one row to another: If B is obtained by replacing row i with row i + c·row j (i ≠ j), then det(B) = det(A). (Determinant is unchanged.)

Why these hold (sketch):

• Multilinearity: determinant is linear in each row when other rows fixed. Multiplying a row by k multiplies the determinant by k.
• Alternating property: determinant changes sign if two rows are exchanged; in particular, if two rows are equal the determinant is zero.
• Adding a multiple of one row to another leaves determinant unchanged because linearity gives cancellation (this is the row-version of column-addition invariance).

Elementary matrices viewpoint: Each elementary row operation corresponds to left-multiplication by an elementary matrix E. Then B = E·A and det(B) = det(E)·det(A). The determinants of elementary matrices are exactly: det(E_swap) = −1, det(E_scale_by_k) = k, det(E_row_add) = 1.

Using row operations to compute determinants: Reduce A to an upper triangular (or row echelon) matrix U using Type III operations and Type I swaps. Track the number of swaps s and the scalings performed. If you only use row-additions and swaps, det(A) = (−1)^s · det(U) and det(U) = product of diagonal entries. If you scale rows by factors k_1,...,k_m during reduction, account for them: det(A) = (−1)^s · det(U) / (k_1·k_2·...·k_m).

Consequences:

• If two rows (or columns) become equal, determinant = 0 (matrix is singular).
• Multiplying every row by k multiplies determinant by k^n for an n×n matrix — geometric interpretation: volume scales by k^n.

What it is
Reduction to upper triangular form is a method to compute the determinant of a square matrix by using elementary row operations to convert the matrix into an upper triangular matrix (all entries below the main diagonal are zero). For an upper triangular matrix the determinant equals the product of its diagonal entries, so once the matrix is reduced, the determinant is easy to evaluate.

Why it works — effects of elementary row operations

• Type I (swap two rows): multiplies the determinant by −1.
• Type II (add a multiple of one row to another): does not change the determinant.
• Type III (multiply a row by a nonzero scalar k): multiplies the determinant by k.

To keep bookkeeping simple, use only Type II operations (row additions) and row swaps when possible; avoid scaling rows unless you track the scalar change.

Algorithm (step-by-step)

1. Start with an n×n matrix A.
2. Use row additions (R_j → R_j − (a_{j,i}/a_{i,i}) R_i) to make all entries below a_{i,i} zero (for i = 1 to n−1). If a pivot a_{i,i} = 0, swap with a lower row that has a nonzero entry in that column (count one sign change).
3. Continue for each column to get an upper triangular matrix U.
4. Compute det(A) = (−1)^{s} · (1/Πk) · Π (diagonal entries of intermediate matrix), where s is number of row swaps and Πk is product of scalars used to scale rows if you used Type III operations. If you did only Type II and swaps, det(A) = (−1)^{s} · product of diagonal entries of U.

Worked numeric example (3×3)

Compute det of A = [1 2 3 4 5 6 7 8 10]

1. R2 → R2 − 4·R1 ⇒ R2 = [0, −3, −6]
2. R3 → R3 − 7·R1 ⇒ R3 = [0, −6, −11]
3. Now eliminate below second pivot: R3 → R3 − 2·R2 ⇒ R3 = [0, 0, 1]

Upper triangular matrix U has diagonal entries 1, −3, 1, no row swaps were used, so det(A) = 1·(−3)·1 = −3.

Remarks

• If at any stage a pivot is zero, swap with a lower row having a nonzero entry (flip sign of determinant).
• If you scale a row (Type III) to create a 1 pivot, divide the final product by that scale factor (or track multiplicative factor).
• This reduction is essentially Gaussian elimination applied to determinant calculation; it is efficient for larger matrices and is the basis of algorithmic determinant computation.

What it is: For a square matrix A, the inverse A^{-1} (if it exists) is the matrix such that A A^{-1} = A^{-1} A = I. Using determinant and adjoint is a general algebraic method: A is invertible iff det(A) ≠ 0, and then

A^{-1} = (1 / det(A)) · adj(A)

Definitions and steps:

1. Determinant: Compute det(A). If det(A)=0, A has no inverse (singular).
2. Minor and cofactor: For each entry a_{ij} of A, its minor M_{ij} is the determinant of the submatrix obtained by deleting row i and column j. The cofactor C_{ij} = (-1)^{i+j} M_{ij}.
3. Cofactor matrix: Form the matrix of cofactors C = [C_{ij}].
4. Adjoint (adjugate): adj(A) = C^{T} (transpose of the cofactor matrix).
5. Inverse: Multiply adj(A) by 1/det(A) to get A^{-1}.

Why it works (intuition): The cofactor expansion gives relations between entries of adj(A) and det(A) so that A · adj(A) = adj(A) · A = det(A) · I. Dividing by det(A) yields the inverse. Geometrically, det(A) is a scale (area/volume) factor; adj(A) encodes directional cofactors that undo A when scaled by 1/det(A).

Notes: The formula is practical for small matrices (2×2, 3×3). For larger matrices, numerical methods (Gaussian elimination, LU decomposition) are preferred.

Definition: For a square matrix A (order n): A is singular if det(A) = 0; A is non-singular (or invertible) if det(A) ≠ 0.

Algebraic consequences:

• Non-singular: rank(A) = n, nullspace contains only the zero vector, A has an inverse A^-1 = (1/det(A)) adj(A), and the linear system A x = b has a unique solution for every b.
• Singular: rank(A) < n, nullspace is non-trivial (there exists x ≠ 0 with A x = 0), A is not invertible, and A x = b either has no solution or infinitely many solutions depending on b.

Geometric interpretation: A represents a linear transformation of Rⁿ. det(A) gives the signed scaling factor of n-dimensional volume (area in R², volume in R³). If det(A) = 0, the transformation collapses the space into a lower-dimensional subspace (area or volume becomes 0) — vectors become coplanar/collinear, so information is lost and the map is not reversible. If det(A) ≠ 0, the transformation is one-to-one and onto, so volumes scale but do not collapse.

Quick tests for singularity:

• If any row or column is zero — singular.
• If two rows or two columns are identical or proportional — singular.
• If any row (or column) is a linear combination of other rows (or columns) — singular.
• Compute det(A); det = 0 ⇔ singular.

Important consequences and uses:

• Cramer's Rule applies only when A is non-singular (det(A) ≠ 0) and gives the unique solution x_i = det(A_i)/det(A).
• In applications (engineering, physics, economics, graphics, cryptography), singular matrices indicate dependent constraints or loss of invertibility (no unique solution or inability to reverse a transform).

Common determinant properties used when checking singularity:

• Swapping two rows (or columns) multiplies det by −1.
• Multiplying a row by scalar k multiplies det by k.
• Adding a multiple of one row to another row does not change det.
• det(AB) = det(A) det(B); in particular, if det(A) = 0 then det(AB) = 0 and A is singular.

Summary: Whether a square matrix is singular or non-singular is decided solely by its determinant. Non-singular matrices are invertible and yield unique solutions to linear systems; singular matrices are non-invertible and indicate linear dependence among rows/columns and loss of dimensionality under the linear map.

What is Cramer's Rule?

Cramer's Rule is a method to solve a system of linear equations with as many equations as unknowns (a square system) using determinants. If A is the coefficient matrix of an n×n system and det(A) ≠ 0, each unknown x_i is given by the ratio of two determinants: the determinant of A with its i-th column replaced by the constants column, divided by det(A).

Conditions

• The coefficient matrix A must be square (n×n).
• det(A) must be nonzero (matrix is invertible). If det(A)=0, Cramer's Rule does not apply (system may have no solution or infinitely many).

Idea / Derivation (brief)

Consider AX = B where A is n×n, X is the column vector of unknowns and B is the constants column. Use multilinearity of determinant and properties of determinants under column operations to isolate each unknown. Replacing the i-th column of A by B gives a matrix A_i whose determinant is det(A)·x_i, hence x_i = det(A_i)/det(A).

Procedure (step-by-step)

1. Form the coefficient matrix A and the constants column B.
2. Compute D = det(A). If D = 0, stop—Cramer's Rule cannot be used.
3. For each unknown x_i (i = 1..n), form matrix A_i by replacing the i-th column of A with B.
4. Compute D_i = det(A_i).
5. Then x_i = D_i / D.

Worked 2×2 example

System: 2x + 3y = 7, 4x − y = 1.

Coefficient matrix A = [[2,3],[4,-1]], B = [7,1]
det(A) = 2·(−1) − 3·4 = −2 − 12 = −14 (nonzero)

A_x = [[7,3],[1,−1]] → det(A_x) = 7·(−1) − 3·1 = −7 − 3 = −10 → x = D_x / D = (−10)/(−14) = 5/7

A_y = [[2,7],[4,1]] → det(A_y) = 2·1 − 7·4 = 2 − 28 = −26 → y = D_y / D = (−26)/(−14) = 13/7

Solution: x = 5/7, y = 13/7.

Remarks

• Cramer's Rule gives exact analytic expressions for variables in terms of determinants; for large n it is computationally expensive compared with elimination or matrix methods.
• Cramer's Rule is closely related to the matrix inverse: x = A^{-1}B and A^{-1} can be expressed using adjugate(A)/det(A).

What is a determinant? A determinant is a scalar value computed from a square matrix. It encodes information about linear transformations represented by the matrix: scale factor, orientation change and whether the transformation is invertible.

Key applications (Class 12 level)

• Solving systems of linear equations (Cramer's Rule): For a system of n linear equations in n unknowns with coefficient matrix A and determinant det(A) ≠ 0, each variable can be found as the ratio of two determinants. This gives a direct formula for solutions when det(A) ≠ 0.
• Area of a triangle from coordinates: If vertices of a triangle are (x1,y1), (x2,y2), (x3,y3), the area = (1/2) |determinant| of a 3×3 matrix built from coordinates (with a column of ones). This is widely used in coordinate geometry and surveying.
• Collinearity of three points: Three points are collinear iff a certain determinant (same 3×3 matrix with a column of ones) equals zero. This gives a neat algebraic test for collinearity.
• Volume of a parallelepiped (3D): The absolute value of the determinant of a 3×3 matrix whose columns (or rows) are three vectors gives the volume of the parallelepiped spanned by those vectors.
• Invertibility / linear dependence: A square matrix is invertible iff its determinant ≠ 0. If det = 0, rows (or columns) are linearly dependent. This criterion is used in many applied problems (engineering, economics) to check uniqueness of solutions.
• Using adjoint to find inverse: The inverse of a nonsingular matrix A can be written as A^{-1} = (1/det(A)) · adj(A), where adj(A) is composed of cofactors (determinants of minors). This is an application of determinants in matrix inversion.

Worked example (2×2 system via Cramer)

Solve: 2x + 3y = 8
       5x -  y = 7
Coefficient matrix A = [[2,3],[5,-1]]
det(A) = 2·(-1) - 3·5 = -2 - 15 = -17 ≠ 0
x = det(A_x)/det(A), where A_x = [[8,3],[7,-1]]
det(A_x) = 8·(-1) - 3·7 = -8 - 21 = -29  → x = (-29)/(-17) = 29/17
y = det(A_y)/det(A), where A_y = [[2,8],[5,7]]
det(A_y) = 2·7 - 8·5 = 14 - 40 = -26  → y = (-26)/(-17) = 26/17

Interpretation and tips

• If det(A) = 0, Cramer’s rule cannot be applied: either there is no unique solution (infinitely many or none).
• For geometry problems, the sign of a determinant can indicate orientation (clockwise vs counterclockwise ordering of points); absolute value gives magnitudes (areas/volumes).
• For computational work, determinants larger than 3×3 are often computed using row/column operations or expansion by minors; for larger systems numerical methods are preferred.