Linear and multilinear algebra; matrix theory Proof
Proof that the constant coefficient of the characteristic polynomial is a signed determinant
Builds on Characteristic polynomialLeibniz formula for determinantsEvaluation homomorphismDeterminant of a scalar multiplePolynomial ring
Proof
We evaluate the characteristic polynomial at .
- Let be an matrix over . Let be its characteristic polynomial in the polynomial ring .
- Write with . Then , the constant coefficient.
- Let be the evaluation homomorphism at . It maps each entry of to the same entry of .
- By the Leibniz formula, is a sum of products of entries of , with signs .
- A ring homomorphism preserves sums, products and signs. So by step 4 and the Leibniz formula for , .
- By the rule for the determinant of a scalar multiple with , .
- By steps 2, 5 and 6, the constant coefficient of is .
Idea
The constant coefficient of a polynomial is its value at . Putting in gives , and the factor comes out of each of the rows.
Reading path
To understand this page from the ground up, read these 111 pages in order. The foundations come first. The path takes the proofs Proof of the decomposition of a permutation into transpositions, Proof that the symmetric group is generated by transpositions, Proof of the commutativity of addition by induction, Proof that equivalence classes form a partition, Proof that permuting rows multiplies the determinant by the sign, Proof that disjoint cycles commute, Proof that scaling a row scales the determinant, Proof that a matrix with two equal rows has determinant zero, Proof of strong induction from ordinary induction, Proof of the laws of exponents in a group, Proof that an intersection of subgroups is a subgroup, Proof that the determinant of the identity matrix is one, Proof of the determinant of a scalar multiple, Proof of the decomposition of a permutation into disjoint cycles, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of the Leibniz formula from the defining properties of the determinant, Proof of the uniqueness of inverses, Proof that the determinant is multilinear in the rows, Proof of the subgroup criterion.
- Binary operation definition
- Cycle notation concept
- Definition by recursion concept
- Divisibility definition
- Element definition
- Group concept
- Identity matrix object
- Mathematical induction concept
- Matrix definition
- Multilinear map concept
- Natural numbers object
- Peano axioms concept
- Permutation concept
- Proposition concept
- Scalar multiplication of matrices concept
- Transposition concept
- Vector space definition
- Identity element definition
- Set definition
- Ring definition
- Subgroup definition
- Symmetric group definition
- Scalar multiplication of matrices definition
- Square matrix definition
- Successor function definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- Linear map definition
- Inverse element definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Polynomial ring definition
- Ring homomorphism definition
- Transposition definition
- Proof that an intersection of subgroups is a subgroup proof
- Intersection definition
- Union definition
- Set-builder notation concept
- Addition of natural numbers definition
- Biconditional definition
- The successor function is injective statement
- Zero is not a successor statement
- Existential quantifier definition
- Universal quantifier definition
- Multilinear map definition
- Proof of the uniqueness of inverses proof
- Cartesian product definition
- Polynomial evaluation definition
- Disjoint sets definition
- Subset definition
- Axiom of extensionality statement
- Proof of the commutativity of addition by induction proof
- Union of a family of sets definition
- Order on the natural numbers definition
- Uniqueness quantifier definition
- Alternating multilinear map definition
- Uniqueness of inverses statement
- Binary relation definition
- Evaluation homomorphism definition
- Partition of a set definition
- Determinant definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Reflexive relation definition
- Symmetric relation definition
- Transitive relation definition
- Proof of the laws of exponents in a group proof
- Proof of the subgroup criterion proof
- Proof that a matrix with two equal rows has determinant zero proof
- Characteristic polynomial definition
- Function definition
- Proof that the determinant of the identity matrix is one proof
- Proof that the determinant is multilinear in the rows proof
- Strong induction statement
- Equivalence relation definition
- Subgroup criterion statement
- Laws of exponents in a group statement
- Determinant of a matrix with two equal rows statement
- Determinant of the identity matrix statement
- Determinant is multilinear in the rows statement
- Injective function definition
- Proof of the well-ordering principle from strong induction proof
- Proof that disjoint cycles commute proof
- Intersection of subgroups is a subgroup statement
- Equivalence class definition
- Proof that scaling a row scales the determinant proof
- Well-ordering principle statement
- Disjoint cycles commute statement
- Subgroup generated by a subset definition
- Proof that equivalence classes form a partition proof
- Scaling a row scales the determinant statement
- Proof of the division algorithm proof
- Equivalence classes form a partition statement
- Division algorithm statement
- Proof of the determinant of a scalar multiple proof
- Proof of the decomposition of a permutation into disjoint cycles proof
- Determinant of a scalar multiple statement
- Decomposition of a permutation into disjoint cycles statement
- Proof of the decomposition of a permutation into transpositions proof
- Decomposition of a permutation into transpositions statement
- Sign of a permutation definition
- Proof that the symmetric group is generated by transpositions proof
- The symmetric group is generated by transpositions statement
- Proof that permuting rows multiplies the determinant by the sign proof
- Permuting rows multiplies the determinant by the sign statement
- Proof of the Leibniz formula from the defining properties of the determinant proof
- Leibniz formula for determinants statement
- Proof that the constant coefficient of the characteristic polynomial is a signed determinant proof
Where this leads
5 pages build on this one.
Further reading
About this page
| Tag | 7SYH0YD0VW |
|---|---|
| URI | m2://7SYH0YD0VW |
| Kind | proof |
| Writing | W0 stub |
| MSC | 15A15, 15A18 |
| Proves | Determinant is a coefficient of the characteristic polynomial |
| Uses | Characteristic polynomial, Leibniz formula for determinants, Evaluation homomorphism, Determinant of a scalar multiple, Polynomial ring |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.