Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Absolute gap equals one minus the largest nonconstant eigenvalue modulus

Statement

Let (X,P,π) be a finite reversible chain and let H0={f:∑xπxfx=0}. If H0={0}, then δabs(P)=1. Otherwise,

δabs(P)=1−max⁡{∣λ∣:λ∈σ(P∣H0)},

and 0≤δabs(P)≤1. If there is a fixed function f∉span⁡{1}, then its nonzero mean-zero component is fixed by P, so the gap is 0.

Facts & Assumptions

Given: A finite reversible chain (X,P,π) with its weighted inner product and mean-zero subspace H0.

[F1]

Absolute spectral gap of a finite reversible chain: δabs(P)=1−∥P∣H0∥2,π, with norm 0 when H0=0.

[F2]

A finite reversible transition operator is self-adjoint on weighted L2: H0 is invariant and P∣H0 is a finite-dimensional self-adjoint endomorphism.

[F3]

Finite stationary Markov operators contract in weighted L2: ∥Pf∥2,π≤∥f∥2,π for every f.

[F5]

Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism: an eigenvalue is a scalar with a nonzero eigenvector, and the spectrum is the set of eigenvalues.

[F6]

Finite reversible Markov chain with positive stationary law: P1=1, ∑xπx=1, and πP=π.

[F7]

Real and complex inner product spaces, with the inner product linear in the first argument: scalar multiplication is linear in the first argument and conjugate-linear in the second.

Proof

1.1F1F2F4F5F7

If H0={0}, the restriction has zero domain, so its operator norm is 0 by [F1] and the gap is 1. Otherwise, [F2] and [F4] give an orthonormal eigenbasis e1,…,em of H0. Each eigenvalue is real: if Pej=λjej, self-adjointness and [F7] give λj∥ej∥2=⟨Pej,ej⟩π=⟨ej,Pej⟩π=λj‾∥ej∥2. [F5] identifies these eigenvalues as the spectrum of the restriction.

1.2F2F4F5algebra

Write f=∑jcjej. Orthonormality gives ∥f∥2,π2=∑j∣cj∣2 and ∥Pf∥2,π2=∑j∣λj∣2∣cj∣2≤(max⁡j∣λj∣)2∥f∥2,π2, with equality at an eigenvector whose eigenvalue has largest modulus. Therefore ∥P∣H0∥2,π=max⁡j∣λj∣.

2.1F1F3step 1.2algebra

By [F3] the restriction norm is at most 1, and it is nonnegative by definition; substituting step 1.2 into [F1] proves both the eigenvalue formula and 0≤δabs(P)≤1.

3.1F1F2F5F6step 1.2algebra∎

If Pf=f and f∉span⁡{1}, put c=∑xπxfx and h=f−c1. The normalization ∑xπx=1 gives h∈H0, while h≠0 because f is not constant. Since P1=1, Ph=Pf−cP1=h. Thus 1 is an eigenvalue of P∣H0 and step 1.2 gives ∥P∣H0∥=1, so [F1] gives δabs(P)=0.

Depends on

Used by

Dependency tree · two levels

24 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