The determinant of a family in a basis is ; the determinant of a matrix is the determinant of its columns in the canonical basis — the permutation formula above; the determinant of an endomorphism is the scalar such that
(the left side is alternating -linear, hence a multiple of by Theorem 2.14; the factor does not depend on ).
Examples
Example 2.19 (A determinant by the rules)
Let be the all-ones matrix and ; we compute with the tools just proved. Every column of 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 ; factor out by linearity in that row, then subtract the first column from every other column: what remains is triangular with diagonal . Hence
The closing insight: the roots (multiplicity ) and say that has eigenvalue with multiplicity and eigenvalue once — the spectrum of the rank-one matrix , 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
the only permutation picking nonzero entries is the -cycle mapping column row , etc.; , so . (Check via three column swaps to reach a diagonal matrix.)
Example 2.21 (A Vandermonde by the product formula)
For the nodes (used by quadrature rules like Exercise 2.4’s), the Vandermonde determinant of Exercise 2.11 evaluates in one glance:
and by direct expansion along the first column: : agreement. Nonvanishing for distinct nodes is the whole theory of interpolation in one determinant: the evaluation forms are a basis of the dual exactly when this determinant is nonzero, i.e. always for distinct — Example 2.2 quantified.