How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The real trace pairing on finite Hermitian matrices is an inner product
Statement
Let be the real vector space of Hermitian complex matrices from the preceding definition. The pairing is real-valued, symmetric, real-bilinear, and positive definite on . Its associated norm is . For every and finite family , the Gram matrix is real symmetric positive semidefinite, equals for the synthesis map , and satisfies .
Statement references
Facts & Assumptions
Given: , the Hermitian matrices , the trace pairing, the family , and the synthesis map defined in the preceding definition.
Finite Hermitian frames and their Gram pseudoinverse: is a real vector space, , and .
Finite matrix trace cyclicity and nondegeneracy: for finite square matrices.
Finite matrix spectral and state calculus: every finite Hermitian matrix has an orthonormal eigenbasis with real eigenvalues.
Cauchy–Schwarz: , with equality exactly for linearly dependent vectors: in a real or complex inner-product space, .
Proof
For Hermitian , by [F2]. The trace is additive and real-homogeneous, so the pairing is real-valued, symmetric, and real-bilinear.
Diagonalize by [F3] with real eigenvalues . Then , with equality exactly when all , hence exactly when . This proves positive definiteness and the displayed square-root formula.
For , bilinearity gives . For , the vector with coordinates satisfies for every , so it is . By [F2], ; hence the matrix of is precisely . The equality implies : gives , while gives and hence by step 2.1. By [F4], ; expanding and applying this bound gives . Thus the formula is a norm.