Determinant Created 2026-09-24 Updated 2026-10-14
The determinant assigns a scalar to a square matrix. For a linear map on the real plane, it measures signed area scaling: its absolute value tells how much area grows, and its sign records whether the orientation of a vector space is preserved or reversed. In three dimensions, the same idea measures signed volume. Over a field, a square matrix is an invertible matrix exactly when its determinant is nonzero. These are two views of one phenomenon: losing an independent direction collapses full-dimensional volume and makes the original input impossible to recover uniquely.[ref]
https://www.math.ucla.edu/~rse/algebra_book.pdf#page=716. Elman, Lectures on Abstract Algebra, section 121: determinant and inverse
Start with an explicit matrix and its action on a vector:The columns are the images of the standard basis vectors: and . Consequently the unit square with corners becomes the parallelogram with corners . Its area is five. Every small patch of this square undergoes the same linear map, so the factor describes the whole deformation, rather than just one specially chosen boundary. The matrix mixes horizontal and vertical components, but its determinant compresses that combined effect into one area factor.[ref]
https://ocw.mit.edu/ans7870/18/18.013a/textbook/HTML/chapter04/section01.html. MIT calculus notes, section 4.1: determinants and area
Now exchange the columns:The parallelogram occupies exactly the same region, but its generating vectors arrive in the opposite order. Moving from the first column to the second now turns clockwise rather than counterclockwise. Ordinary area remains five; the oriented volume in two dimensions changes sign. A negative determinant therefore signals reversed orientation of a vector space, not a negative amount of material. Keeping the sign makes successive reversals calculable: two reversals restore the original orientation of a vector space.
Compare a singular matrix:Its columns are linearly dependent: the second is twice the first. The unit square collapses onto the segment from to , which has zero area despite nonzero length. Since , the kernel of a linear map contains a nonzero vector; inputs differing by that vector have identical outputs. The collapsed picture explains why an inverse matrix cannot exist.
For , recovery is possible, and the complete matrix multiplication check isHere is the identity matrix. The inverse matrix restores the original square, shrinking its area by . Generally, the adjugate identity gives whenever the determinant is nonzero over a field; this is why the denominator matters.[ref]
https://ocw.mit.edu/ans7870/18/18.013a/textbook/HTML/chapter04/section04.html. MIT calculus notes, section 4.4: determinant and inverse
The multiplicativity of the determinant describes two successive deformations. Matrix multiplication means that applies first, then . TakeThe first linear map doubles area; the second multiplies the resulting area by five. Thus the unit square passes through areas , with the last parallelogram bounded by . Direct calculation agrees:This explains physically why area factors multiply instead of adding. The general identity holds for square matrices of the same size, including singular matrices. If either stage loses a direction, later processing cannot recover the discarded information.[ref]
https://ocw.mit.edu/ans7870/18/18.013a/textbook/HTML/chapter32/section04.html. MIT calculus notes, section 32.4: determinant products
Successive linear maps multiply area factors: one becomes two, then ten
. Details. The same interpretation works in three dimensions without drawing a new picture. The diagonal matrixsends the unit cube to a rectangular box with side lengths two, three, and one. Its ordinary volume is six. The minus sign comes from reversing the third direction, so the oriented volume is minus six. Replacing the last diagonal entry by zero flattens the cube into a planar region: its area may be positive, but its three-dimensional volume is zero. This distinction matters whenever a linear map changes shape: the determinant measures size in the full input dimension, rather than the size of whichever lower-dimensional object remains.
The determinant measures neither trace nor perimeter. For , the trace happens also to be five, but the identity matrix in two dimensions has trace two and determinant one. The first parallelogram above has perimeter , compared with four for the unit square; boundary length follows a different rule. Nor does determinant one require every length to stay fixed: the diagonal matrix preserves area while stretching one direction and compressing the other.
These properties make the determinant useful when coordinates obscure what a deformation does. A nonzero determinant certifies that linearly independent input directions remain distinguishable; its magnitude counts the area or volume represented by a transformed cell. That second role reappears in the change of variables formula, where the Jacobian determinant corrects the sizes of small cells. Signed volume also separates a deformation that reverses the orientation of a vector space from one that merely stretches it, even when both give identical ordinary volume factors.[ref]
https://ocw.mit.edu/ans7870/18/18.013a/textbook/HTML/chapter24/section02.html. MIT calculus notes, section 24.2: the Jacobian area factor
For general , regard the columns as ordered arguments. The determinant is the unique alternating multilinear map to the scalar field normalized by . The multilinearity of the determinant means linearity in each column separately, with all others held fixed:Alternation means equal columns give zero; exchanging columns negates the result. Normalization sets the oriented volume of the standard basis to one. These properties also hold in rows. For real three-dimensional columns, their determinant is the scalar triple product, and its absolute value is the enclosed volume. Over other fields, the algebraic definition still works even without a geometric notion of positive volume.[ref]
https://web.mit.edu/18.06/www/Spring16/lecture22.pdf. Barwick, MIT 18.06 Lecture 22: the determinant axioms
Separate linearity does not mean the determinant is a linear map on the whole matrix. Scaling every column of an -by- matrix by gives . For our two-dimensional example, : doubling both directions quadruples area. The power records how many independent directions are being scaled together.
The properties suggest practical computations. Adding a multiple of one column to another preserves the determinant: the extra term has repeated columns and vanishes. This is the algebra behind an area-preserving shear mapping. Alternatively, expansion along a row uses cofactors, each a matrix minor multiplied by a sign:where deletes row and column . The Leibniz formula for determinants supplies the general entry formula. Both calculations encode the same geometric invariant; the defining properties explain their structure without requiring memorization of a separate recipe for every size.[ref]
https://ocw.mit.edu/ans7870/18/18.013a/textbook/HTML/chapter04/section03.html. MIT calculus notes, section 4.3: cofactor expansion
Past exam of the history of mathematics course of the University of Oxford 2023 3 Solution 2026-10-25
Alexandre-Théophile Vandermonde presents a programme in elimination theory: remove unknowns from simultaneous polynomial equations in a way that works uniformly as the number of equations and their polynomial degrees vary. The immediate achievement is narrower than that programme: a general construction for linear equations. The academy year 1772 used in the exam is not the printing date of the memoir, which appeared in 1776. Its compact indices distinguished the equation containing a coefficient from the unknown it multiplied; they were not powers. That notational separation is crucial to interpreting the work.[ref]
Mémoire sur l'élimination by Alexandre-Théophile Vandermonde. Opening, printed pp. 516–517; academy year 1772, printed 1776
[ref]A case of mathematical eponymy: the Vandermonde determinant by Bernard Ycart. §2.1, discussion and reproduction of Vandermonde's coefficient notation; bibliography
In modern language take a system of linear equations with unknowns. Its determinant is an alternating expression in the coefficients:Each product selects one coefficient from each equation and each unknown's column. The sign of a permutation determines whether it is added or subtracted. This makes the number a genuine parameter of a general rule, rather than merely supplying separately memorised formulas for two or three unknowns. The notation here is modern, not a transcription of Alexandre-Théophile Vandermonde's symbols.
For two unknowns, multiply by and by , then subtract. Similarly eliminate . This givesThe same principle in arbitrary size is Cramer's rule. If is obtained by replacing column of by , thenAn original verification uses the multilinearity of the determinant: replace by the column combination . Every resulting determinant vanishes through repeated columns except the term, which is . This explains how an elimination expression isolates one unknown.
The condition is substantive. If , multiplying by an expression which vanishes cannot justify division. For instance, and are inconsistent, whereas replacing by gives infinitely many solutions. Thus an elimination formula must distinguish exceptional coefficients and preserve the connection to the original system of linear equations. Nor does the displayed rule solve the much broader problem of arbitrary nonlinear equations.
The passage's importance is the move from particular elimination calculations towards a theory of alternating expressions. It would be misleading to turn this into the claim that the familiar Vandermonde determinant, formed from powers of variables, is what this extract displays. A positional upper index and an exponent have different meanings; the history of that eponym requires separate evidence. Likewise, modern matrix algebra is a useful explanatory language here, not the institutional or conceptual setting of an eighteenth-century memoir.[ref]
A case of mathematical eponymy: the Vandermonde determinant by Bernard Ycart. §§2.1–2.4, separating coefficient indices, difference-products and the later eponym
Past exam of the mathematics course of the University of Cambridge 2008 ib Paper 3 13F Solution Created 2026-09-24 Updated 2026-10-14
Let , and . For sufficiently small , decompose the increment into an -segment at height and a -segment at . The one-variable mean value theorem applies on each segment because existence of its partial derivative gives continuity along the segment. Thus, when both increments are nonzero,for some . The same formula with the absent segment omitted covers zero increments. Continuity of both partial derivatives at makes the remainder after subtracting at most for small increments, and hence at most . Therefore the Fréchet derivative is . Continuity throughout the disc is not required; continuity at the point suffices.
For the determinant, expand by multilinearity of the determinant in the columns of . Taking no perturbed column gives one; taking exactly one gives ; all other terms have degree at least two in the entries of . Since matrix-entry functionals are bounded in any finite-dimensional norm, their sum is . HenceFor invertible , multiplicativity of the determinant gives . The bounded linear map transfers the preceding remainder estimate, giving the derivative of the determinantTo justify an open invertible neighborhood, let . Completeness and submultiplicativity make the Neumann series converge in matrix norm. Multiplying finite partial sums by gives , which tends to . Continuity of multiplication proves . Thus is invertible, and the series gives near zero.
Apply the first-derivative formula at to a test matrix :The last estimate is uniform for , so it proves differentiability of the derivative in the operator norm, rather than merely a directional second derivative. The second derivative of the determinant is the symmetric bilinear mapIts symmetry follows from .
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 1 2A ii Solution Created 2026-09-24 Updated 2026-09-29
The scalar multiplication multiplies every one of the rows by . Applying multilinearity of the determinant once to each row gives
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 1 2A i Solution Created 2026-09-24 Updated 2026-09-29
The Leibniz formula for determinants isEquivalently, the determinant is the unique alternating function of the rows that is multilinear and takes value one on the identity matrix. Multiplying one row by therefore gives
Past exam of the mathematics course of the University of Cambridge 2019 ia Paper 1 2A iv Solution Created 2026-09-24 Updated 2026-09-29
Let the columns be , and replace by , where . By multilinearity of the determinant,The second determinant vanishes because it has two equal columns. Hence
Past exam of the mathematics course of the University of Cambridge 2021 ib Paper 3 9E b Solution Created 2026-09-24 Updated 2026-09-25
Expand by multilinearity of the determinant in its columns. The coefficient of is a sum of determinants obtained by choosing columns from and the remaining columns from . Since the columns of span a space of dimension , every choice of more than columns from is linearly dependent. All coefficients of for therefore vanish, so
Trace and local volume change Created 2026-10-14 Updated 2026-10-20
For any fixed real -by- matrix , as the real parameter tends to zero,The big O notation means the remainder is bounded in absolute value by for some constant near zero. The determinant stays positive for sufficiently small , so its oriented volume factor is also its ordinary volume factor. Thus the trace is the first-order fractional volume change, measured from the identity matrix.
A proof follows directly from multilinearity of the determinant. Each column of is . The constant term chooses all the standard basis columns and equals one. A term containing exactly one factor replaces just column by ; expanding that vector in the standard basis leaves only its component, , because every other choice repeats a column. Summing gives . Terms with two or more replacements have order or higher. This also proves the derivative of the determinant at the identity matrix.
This coefficient has a direct visual meaning. At the point , the linear map has component along direction . In a small step , these are the first-order changes of the square's or box's sides in their own directions. Summing them gives its fractional area or volume change; the off-diagonal entries initially change shape rather than contributing to this first-order total.
For the constant-coefficient linear system of differential equations , the exact linear flow is , using the matrix exponential. Its volume factor isThis is the matrix exponential determinant identity. One can derive it without diagonalization: set , whose matrix inverse is , and use in Jacobi's formula to get . The scalar differential equation with initial value one gives the displayed exponential function. Thus positive trace causes volume expansion, negative trace causes contraction, and zero trace preserves volume, even when individual directions behave differently.
In two dimensions, compare four generators at :The first and third diagonal matrices expand or contract both directions. The second expands horizontally and contracts vertically by reciprocal factors, making a rectangle of unchanged area. For the last nilpotent matrix, , so its matrix exponential is exactly ; it sends to , a shear mapping. Zero trace allows substantial shape change and does not mean the flow map is stationary.
Four examples of a linear system of differential equations: trace controls area change while a saddle and a shear mapping preserve area
. Details. The first-order statement and the exact flow map should be distinguished. For , , whereas for all real . Zero trace eliminates the first-order change in the approximate step, and it preserves volume exactly in the matrix exponential flow. The examples use an abstract parameter and coordinate vectors; no physical units are assumed.


