GraphMath

Determinant

Signed scaling of area and volume through row operations

What does determinant measure, and why do row operations reveal it?

Determinant is the signed scaling factor of n-dimensional volume under a square linear transformation. This chapter defines determinant through elementary row operations, derives its main properties, shows how to compute it by row reduction and then connects the algebra to geometric illustrations in 2D and 3D.

Open chapter PDF Key ideas Chapter index Back to Linear Algebra

Key ideas

Determinant is defined algebraically, but its meaning is geometric: it tracks signed area in 2D, signed volume in 3D and signed n-dimensional volume in general.

  • Row swap changes sign, row scaling multiplies determinant by the same scalar and row replacement leaves determinant unchanged
  • A non-full-rank square matrix has determinant 0 because its transformation collapses volume into a lower-dimensional shape
  • |AB| = |A||B| expresses successive volume scaling under composition of transformations
  • The determinant of a triangular matrix is the product of its diagonal entries, which makes row reduction the practical computation method
  • Determinant is unchanged by transpose and an orthonormal square matrix has determinant ±1
  • Permutation and cofactor formulas are historically important, but row reduction is the preferred computational method

The chapter ends by reinterpreting determinant computation as building the target shape from the unit square or cube while tracking signed area or volume at each step.

Why is determinant naturally connected to row reduction?

Because row operations change determinant in simple, controlled ways. Once a matrix is reduced to a triangular form, determinant can be read from the diagonal while correcting for swaps and scalings used along the way.

Related chapters

  • Determinant sign extends this chapter by visualizing orientation, projected cyclic order and cofactor signs in 3D and 4D
  • Row reduction provides the elementary row operations and echelon viewpoint used here to define and compute determinant
  • Inverse uses the square full-rank case where nonzero determinant signals invertibility
  • Linear transformations gives the geometric language of area, volume, orientation and composition behind determinant
  • Matrix multiplication supports the product rule |AB| = |A||B| and the composition viewpoint used in its interpretation
  • Cramer's rule uses determinants to recover coordinates of the solution to a square full-rank system

Chapter contents

The PDF is a single document. The page links below are best-effort: most browsers support them, but some viewers may ignore the page hint.

Topic Pages
Definition 1–2
Determinant of elementary matrices 3
Determinant of non-full-rank M 3-4
| A B | = | A |×| B | 5–6
Determinant of a triangular matrix and determinant computation 6–8
Determinant of M transposed 8–10
Determinant of orthonormal matrix 10–11
Illustration of permutation method 11–13
Illustration of cofactor expansion method 13–16
| A | = | E₁⁻¹ | × ... × | Eₖ⁻¹ | × | I | (2D) 16–17
| A | = | E₁⁻¹ | × ... × | Eₖ⁻¹ | × | I | (3D) 18–19
Summary 20–21
Open PDF

Why do determinant formulas from permutations and cofactors still matter?

They are no longer the preferred computational methods, but they show that determinant is not merely a row-reduction trick. They connect the practical algorithm back to classical formulas and help close the logical gap between definition, properties and historical computation methods.

Was this chapter helpful?

Quick feedback helps us improve the site.

Yes No