Linear and multilinear algebra; matrix theory Proof
Proof that the trace is a coefficient of the characteristic polynomial by the Leibniz formula
Builds on Characteristic polynomialLeibniz formula for determinantsTrace of a matrixPermutationDegree of a polynomialPolynomial ring
Proof
We expand by the Leibniz formula and find the terms of degree .
- Let be an matrix over , and let , a matrix over the polynomial ring .
- The entries of are and for . Each diagonal entry has degree at most , and each other entry is a constant.
- By the definition of the characteristic polynomial and the Leibniz formula, .
- Let be a permutation other than the identity. Then for some .
- Then , because would contradict the injectivity of . So moves at least two points and .
- So at most factors of the product for are diagonal entries. The other factors are constants.
- A product of polynomials has degree at most the sum of their degrees. By steps 2 and 6, the term for has degree at most .
- So the coefficient of in equals the coefficient of in the identity term .
- Claim: for with , , where has degree at most or is .
- For , the claim holds with .
- Suppose the claim holds for , and let and . Multiply both sides by .
- This gives , with .
- Each of the three terms of has degree at most , or is . So the claim holds for , and by induction for all .
- By steps 8 and 9 with , the coefficient of in is .
- By the definition of the trace, this is . With step 7, the identity term also gives the leading term , so .
Idea
A permutation other than the identity moves at least two indices. So its Leibniz term uses at most diagonal entries , and it cannot reach degree . Only the product of the diagonal entries contributes to , and there the coefficient is .
Reading path
To understand this page from the ground up, read these 104 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 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 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
- Transposition concept
- Vector space definition
- Identity element definition
- Set definition
- Ring definition
- Subgroup definition
- Symmetric group 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
- Transposition definition
- Intersection definition
- Proof that an intersection of subgroups is a subgroup proof
- Union definition
- Trace of a matrix 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
- Disjoint sets definition
- Degree of a polynomial definition
- Subset definition
- Proof of the commutativity of addition by induction proof
- Axiom of extensionality statement
- 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
- 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
- Proof that the determinant of the identity matrix is one proof
- Function definition
- Proof that the determinant is multilinear in the rows proof
- Strong induction statement
- Equivalence relation definition
- Subgroup criterion statement
- Determinant of a matrix with two equal rows statement
- Laws of exponents in a group statement
- Determinant of the identity matrix statement
- Determinant is multilinear in the rows statement
- Proof of the well-ordering principle from strong induction proof
- Injective function definition
- Proof that disjoint cycles commute proof
- Intersection of subgroups is a subgroup statement
- Equivalence class definition
- Well-ordering principle statement
- Disjoint cycles commute statement
- Subgroup generated by a subset definition
- Proof that equivalence classes form a partition proof
- Proof of the division algorithm proof
- Equivalence classes form a partition statement
- Division algorithm statement
- Proof of the decomposition of a permutation into disjoint cycles proof
- 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 trace is a coefficient of the characteristic polynomial by the Leibniz formula proof
Where this leads
56 pages build on this one.
- Singular value decomposition
- Spectral theorem for normal matrices
- Spectral theorem
- Existence of an eigenvalue over an algebraically closed field
- Spectral theorem for Hermitian matrices
- Trace is a coefficient of the characteristic polynomial
- Polar decomposition
- Trace is the sum of the eigenvalues
- Principal axis theorem
- Spectral theorem for unbounded self-adjoint operators
- Proof of the principal axis theorem from the spectral theorem
- Proof of the singular value decomposition from the spectral theorem
- Quantum Zeno effect
- Hilbert–Schmidt expansion theorem
- Bilinear series of a symmetric kernel
- Proof that the trace is the sum of the eigenvalues by comparing coefficients
- Uhlmann's theorem
- Spectral theorem for compact self-adjoint operators
- Courant–Fischer characterization of characteristic values
- Proof of the spectral theorem for self-adjoint operators by induction on the dimension
- Principle of material frame-indifference
- Mixed state
- Purification of a quantum state
- Gleason's theorem
- Stone's theorem on one-parameter unitary groups
- Lidskii's trace formula for integral operators
- Hamiltonian operator
- Second quantization
- Spectrum of the Laplace–Beltrami operator
- Principal stresses
- Wick rotation
- Eckart–Young theorem
- Proof of the existence of an eigenvalue over an algebraically closed field
- Strang splitting
- Lie–Trotter product formula
- Proof of the polar decomposition from the singular value decomposition
- Born rule
- Borel functional calculus
- Schmidt decomposition
- Operator monotone function
- Proof of the spectral theorem for normal matrices by deflation
- Mercer's theorem
- Proof of the spectral theorem for Hermitian matrices
- Quantum computing
- Wave function collapse
- Principal component analysis
- Inertia tensor and principal axes
- Bidiagonalization
- Schur product theorem
- Singular values of a compact operator
- Observable
- Schmidt's singular value decomposition of a kernel
- Polar decomposition of the deformation gradient
- Spectral theorem for bounded normal operators
- Hidden-variable theory
- Channel capacity of a quantum channel
Further reading
About this page
| Tag | D0K478FKER |
|---|---|
| URI | m2://D0K478FKER |
| Kind | proof |
| Writing | W0 stub |
| MSC | 15A15, 15A18 |
| Proves | Trace is a coefficient of the characteristic polynomial |
| Uses | Characteristic polynomial, Leibniz formula for determinants, Trace of a matrix, Permutation, Degree of a polynomial, 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.