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.
Projection lemma for a large penalty
Statement
Let be a nonzero finite-dimensional complex inner-product space and let be a nonzero subspace. Let be Hermitian endomorphisms, with and for every , where . Write . Then
Here is the compression on , where is orthogonal projection. Assume so that is defined. If , the lower spectral hypothesis is vacuous and the conclusion reduces to equality.
Facts & Assumptions
Given: A finite-dimensional complex-inner-product space , a nonzero subspace , Hermitian maps , and the penalty and norm hypotheses in the Statement.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a finite-dimensional normal endomorphism has an orthonormal basis of eigenvectors.
Proof
Set . By [F1], the Hermitian compression has a unit eigenvector with eigenvalue . Since , its Rayleigh quotient for is , so .
If , then and , so the conclusion is equality. Otherwise both and are nonzero. For a unit vector , write with , unit and , ; absorb the phases into . If either component of is zero, choose any unit vector in its nonzero subspace for the unused direction. Self-adjointness of and make its cross terms zero, so . Also , , and .
Expanding the quadratic form and using gives Indeed the -diagonal term is , the term is at least , and bounds the cross term below by .
The scalar quadratic has minimum by completing the square. Thus every unit Rayleigh quotient is at least ; [F1] identifies the least eigenvalue with the minimum Rayleigh quotient. This proves the lower bound.
Depends on
Used by
Dependency tree · two levels
6 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
- Julia Kempe, Alexei Kitaev, and Oded Regev, The Complexity of the Local Hamiltonian Problem (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)