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.
For normal endomorphisms, the spectral functional calculus respects sums, products, adjoints, and composition of scalar functions
Statement
Let be a finite-dimensional complex inner product space, let be normal, and let .
- .
- .
- If , then .
- If , then .
Facts & Assumptions
Given: A finite-dimensional complex inner product space , a normal endomorphism , its spectral resolution and functions .
A normal endomorphism has a spectral resolution by pairwise orthogonal projections with for and (A normal endomorphism is a sum of its eigenvalues times pairwise orthogonal projections, and each spectral projection is a polynomial in the endomorphism).
Proof
By definition and , so ; using for and from [L1], one also gets .
Because each is self-adjoint by [L1], one has .
Put for the distinct values taken by on and define ; then the are pairwise orthogonal projections, , and applying the same definition of functional calculus once more gives .
Depends on
- The spectral functional calculus f(T) for a normal endomorphism
- A normal endomorphism is a sum of its eigenvalues times pairwise orthogonal projections, and each spectral projection is a polynomial in the endomorphism
- Adjoints satisfy $(S+T)^*=S^*+T^*$, $(\lambda T)^*=\overline\lambda T^*$, $(ST)^*=T^*S^*$, and $T^{**}=T$
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Sheldon Axler, Linear Algebra Done Right, fourth edition (standard reference, not scraped)