Alphabeta Math
LemmaStatement: 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.

Restricted history-path gap

Statement

Let N≥1 be the number of propagation steps. On the legal-clock block with the zero data input, remove the input penalty and conjugate by the prefix unitaries as in History state and padded output. The resulting clock matrix is H0(s)=(1−s)diag⁡(0,1,…,N)+s2LN, where LN is the path Laplacian. Its ground eigenvalue is simple and its spectral gap is at least 1/(48N2) for every s∈[0,1]. In particular, the restricted clock gap is Ω(N−2) uniformly along the path.

Facts & Assumptions

Given: The five-local path and its legal-clock restriction from Five-local history-state adiabatic path.

[F1]

For every s>0, the normalized ground vector v of H0(s) is strictly positive and nonincreasing in its clock index (Nonnegative monotone ground vector of the history path).

[F2]

For a finite irreducible reversible row-stochastic chain with stationary distribution π, conductance ϕ gives the algebraic spectral-gap estimate 1−λ2≥ϕ2/2 (Finite reversible Cheeger inequality).

[F3]

Proof

1.1givenF3algebra

On legal clock ci, Hclock0 has eigenvalue i; the propagation terms have diagonal entries 1/2 at the endpoints, 1 internally, and adjacent entries −1/2. Therefore the clock matrix is the displayed H0(s)=aD+tLN, where a=1−s, t=s/2, and D=diag⁡(0,1,…,N).

2.1F3step 1.1algebra

If 0≤s≤1/6, the Rayleigh quotient at e0 gives the ground eigenvalue E0≤t. On the codimension-one subspace e0⊥, D≥I and LN≥0, so every Rayleigh quotient there is at least a. If the second eigenvalue E1 were below a, the span of eigenvectors for the two lowest eigenvalues would have dimension at least two and would contain a nonzero vector orthogonal to e0; its quotient, as an eigenbasis expansion supported on eigenvalues at most E1, would be at most E1<a, a contradiction. Hence E1≥a, and E1−E0≥a−t=1−3s/2≥3/4.

2.2F1F3step 1.1algebra

Now suppose s≥1/6, so t≥1/12, and let v be the normalized positive ground vector from [F1], with eigenvalue E0. Set πi=vi2, so ∑iπi=1 and π0≥π1≥⋯≥πN>0. For a vector f=(fi) with ∑iπifi=0, set xi=vifi; then x⊥v and ∥x∥2=∑iπi∣fi∣2. The eigenvalue equation H0v=E0v, expanded edge by edge, gives the ground-state identity ⟨x,(H0−E0I)x⟩=t∑i=0N−1vivi+1∣fi−fi+1∣2. Indeed, the diagonal coefficient at vertex i after subtracting E0 is t times the sum of neighboring ratios vj/vi; multiplying by vi2∣fi∣2 assigns tvivj∣fi∣2 to each incident edge, and the off-diagonal term supplies −2tvivjRe⁡(f‾ifj).

3.1F1step 2.2constructalgebra

Since vi≥vi+1, each edge weight satisfies vivi+1≥πi+1. Define a continuous-time reversible path chain with stationary masses πi and symmetric edge conductances ci=πi+1: its rate from i to i+1 is ci/πi=πi+1/πi≤1, and its reverse rate is ci/πi+1=1. Each total exit rate is at most 2. Let Q be its generator and P=I+Q/2. Then P is row-stochastic, reversible with stationary law π, and irreducible, and its Dirichlet form is ⟨f,(I−P)f⟩π=12∑ici∣fi−fi+1∣2.

4.1F1step 3.1choosealgebra

For any set S with 0<π(S)≤1/2, if 0∈S, choose the largest k for which {0,…,k}⊆S. Then k<N, edge (k,k+1) crosses the cut, and the tail mass is at least 1/2. Monotonicity gives ∑j=k+1Nπj≤Nπk+1, so πk+1≥1/(2N). The chain flow across the edge is ck/2=πk+1/2, hence QP(S,Sc)/π(S)≥1/(2N). If 0∉S, put k=min⁡S−1; then S⊆{k+1,…,N} and π(S)≤Nπk+1, while the crossing flow is again πk+1/2, giving the same ratio bound. Thus ϕ(P)≥1/(2N).

5.1F2F3step 2.1step 2.2step 3.1step 4.1algebra∎

By [F2], 1−λ2(P)≥1/(8N2). The generator gap is twice this number because P=I+Q/2, so its Dirichlet-form Poincaré constant is at least 1/(4N2). For any x⊥v, set fi=xi/vi; then ∑iπifi=0. The ground-state identity in step 2.2 and vivi+1≥ci give ⟨x,(H0−E0I)x⟩≥t/(4N2)∥x∥2. By [F3], expand x in an orthonormal eigenbasis of H0 with v as its simple ground vector; choose x to be a unit eigenvector for E1, orthogonal to v. Its quotient is exactly E1−E0, so the established lower bound applies to this x. Thus E1−E0≥t/(4N2)≥1/(48N2) for s≥1/6. Together with step 2.1, this proves the uniform bound.

Depends on

Used by

Dependency tree · two levels

28 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