Mathematics · Glossary

What is Determinants?

Also known as: determinant

Definition 2.16 University Mathematics — Year 2 · Chapter 2 — Linear Algebra

The determinant of a family in a basis is detB(x1,,xn)\det_{\mathcal{B}}(x_1, \dots, x_n); the determinant of a matrix AA is the determinant of its columns in the canonical basis — the permutation formula above; the determinant of an endomorphism uu is the scalar detu\det u such that

detB(u(x1),,u(xn))=detudetB(x1,,xn)for all xi\det{}_{\mathcal{B}}\bigl(u(x_1), \dots, u(x_n)\bigr) = \det u \cdot \det{}_{\mathcal{B}}(x_1, \dots, x_n) \quad \text{for all } x_i

(the left side is alternating nn-linear, hence a multiple of detB\det_\mathcal{B} by Theorem 2.14; the factor does not depend on B\mathcal{B}).

Examples

Example 2.19 (A determinant by the rules)

Let JMn(K)J \in \mathcal{M}_n(K) be the all-ones matrix and aKa \in K; we compute det(aIn+J)\det(aI_n + J) with the tools just proved. Every column of aIn+JaI_n + J sums the same way: add all rows to the first (the determinant is unchanged — adding a multiple of one row to another adds a repeated-direction term, killed by alternation). The first row becomes (a+n,a+n,,a+n)(a + n, a + n, \dots, a + n); factor out a+na + n by linearity in that row, then subtract the first column from every other column: what remains is triangular with diagonal (1,a,,a)(1, a, \dots, a). Hence

det(aIn+J)=(a+n)an1.\det(aI_n + J) = (a + n)\,a^{\,n-1}.

The closing insight: the roots a=0a = 0 (multiplicity n1n - 1) and a=na = -n say that JJ has eigenvalue 00 with multiplicity n1n - 1 and eigenvalue nn once — the spectrum of the rank-one matrix JJ, one chapter early (Chapter 3 will make this systematic).

Example 2.20 (A determinant by the permutation formula)

For a matrix with many zeros the formula is practical by itself: in

A=(0a0000b0000cd000),A = \begin{pmatrix} 0 & a & 0 & 0\\ 0 & 0 & b & 0\\ 0 & 0 & 0 & c\\ d & 0 & 0 & 0 \end{pmatrix},

the only permutation picking nonzero entries is the 44-cycle σ=(1234)\sigma = (1\,2\,3\,4) mapping column 11 \to row 44, etc.; ε(σ)=(1)3=1\varepsilon(\sigma) = (-1)^3 = -1, so detA=abcd\det A = -abcd. (Check via three column swaps to reach a diagonal matrix.)

Example 2.21 (A Vandermonde by the product formula)

For the nodes 0,1,20, 1, 2 (used by quadrature rules like Exercise 2.4’s), the Vandermonde determinant of Exercise 2.11 evaluates in one glance:

det(111012014)=(10)(20)(21)=2,\det\begin{pmatrix} 1 & 1 & 1\\ 0 & 1 & 2\\ 0 & 1 & 4 \end{pmatrix} = (1 - 0)(2 - 0)(2 - 1) = 2 ,

and by direct expansion along the first column: 1(42)=21\cdot(4 - 2) = 2: agreement. Nonvanishing for distinct nodes is the whole theory of interpolation in one determinant: the evaluation forms PP(ai)P \mapsto P(a_i) are a basis of the dual exactly when this determinant is nonzero, i.e. always for distinct aia_iExample 2.2 quantified.

Read in context →