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.
Finite reversible Cheeger inequality
Statement
Let be a finite set with . Let be an irreducible row-stochastic matrix and let be a strictly positive stationary probability satisfying detailed balance For , put , and define the conductance If are the eigenvalues of in the weighted inner product , then the algebraic gap satisfies No absolute-gap or aperiodicity assertion is made.
Facts & Assumptions
Given: A finite state set, a row-stochastic irreducible matrix , and a strictly positive stationary probability satisfying the displayed detailed-balance equations.
A transition matrix is row-stochastic: and (Transition matrices and n-step probabilities).
Stationarity means (Invariant and stationary distribution for a Markov kernel).
Detailed balance makes symmetric in (Reversible measure and detailed balance).
A self-adjoint endomorphism of a finite-dimensional complex inner-product space has an orthonormal eigenbasis (Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space, Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely).
Cauchy–Schwarz holds in the weighted finite-dimensional inner-product space (Cauchy–Schwarz: , with equality exactly for dependent pairs).
Proof
Set . By [F3], ; by [F1] its row sums are , and by [F2] its column sums are also . For a real-valued function define Expanding the square and using these row and column sums gives .
Suppose and its support has -mass at most . For , let . The finite layer-cake identities give and . Every nonempty is admissible in the definition of , so the latter integral is at least . Apply [F5] to the finite weighted sum with weights and the factors and . It bounds the integral above by ; using and the row and column sums makes the second factor at most . If , division yields ; for it is immediate.
Let be a real function with . A weighted median exists by sorting the finitely many values of until their cumulative -mass reaches ; hence each of and has support mass at most . For every pair , . Therefore step 1.1 gives .
Apply steps 2.1 and 2.2 to and . Their squared norms sum to because has mean zero. Thus .
Detailed balance makes self-adjoint for , since exchanging in the finite sum proves . Constants are -eigenvectors. For any complex-valued , weighted Cauchy–Schwarz and the row sums give . Summing against and using stationarity gives . Thus every eigenvalue is at most and is the top eigenvalue. If a real function satisfies , choose a state where it attains its maximum. Its value is a convex average of neighboring values, so every state reached with positive transition probability has the same maximum; irreducibility propagates this to every state. Thus the real -eigenspace consists only of constants. For a complex -eigenvector, its real and imaginary parts are real -eigenvectors, so the same conclusion holds. By [F4], choose an orthonormal eigenbasis with first vector the normalized constant vector and eigenvalues . Expanding any mean-zero vector in the remaining basis vectors shows directly that its Rayleigh quotient for is a weighted average of , whose minimum is . Step 3.1 bounds every real mean-zero quotient below by ; applying that inequality to the real and imaginary parts gives the same bound for complex vectors. This proves the claim. A possible negative eigenvalue near does not affect the algebraic gap.
Depends on
- Transition matrices and n-step probabilities
- Invariant and stationary distribution for a Markov kernel
- Reversible measure and detailed balance
- Self-adjoint and normal endomorphisms of a finite-dimensional real or complex inner product space
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
Used by
Dependency tree · two levels
23 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
- Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev, Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)