Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Spectrum of the lazy Johnson walk

Statement

Let N≥4 and 2≤r≤⌊N/2⌋. For the lazy Johnson transition matrix P on the r-subsets of [N] from Element-distinctness Johnson walk and value access, all eigenvalues, counted with multiplicity, are

λj=1−j(N+1−j)2r(N−r),0≤j≤r,

with multiplicity (Nj)−(Nj−1), where (N−1)=0. They are nonnegative, and for the uniform stationary law the absolute spectral gap, in the sense of Absolute spectral gap of a finite reversible chain, is

δ(P)=1−λ1=N2r(N−r).

Facts & Assumptions

Given: The finite state space Ωr={S⊆[N]:∣S∣=r} and the lazy transition probabilities of Element-distinctness Johnson walk and value access.

[F1]

Element-distinctness Johnson walk and value access: P stays at a subset with probability 1/2 and replaces one of its r elements by one of the N−r elements outside with probability 1/(2r(N−r)) for each replacement.

[F2]

Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T: for a linear map T with finite-dimensional domain, dim⁡V=dim⁡ker⁡T+dim⁡im⁡T.

[F3]

For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥: for a subspace W of a finite-dimensional inner-product space V, V=W⊕W⊥.

[F5]

The orthogonal complement W⊥={v:⟨v,w⟩=0 for all w∈W}: W⊥={v:⟨w,v⟩=0 for all w∈W}.

[F6]

Adjoints satisfy (S+T)∗=S∗+T∗, (λT)∗=λ‾T∗, (ST)∗=T∗S∗, and T∗∗=T: for compatible finite-dimensional maps, (ST)∗=T∗S∗; also (λT)∗=λ‾T∗ and I∗=I.

[F7]

Finite reversible Markov chain with positive stationary law and Absolute spectral gap of a finite reversible chain: a positive stationary law and detailed balance make the chain reversible, and its absolute gap is 1−∥P∣H0∥ on the mean-zero subspace.

Proof

1.1F1F4constructalgebra

For 0≤k≤r, let Vk=C([N]k) with the standard coordinate inner product, linear in the first argument as in Real and complex inner product spaces, with the inner product linear in the first argument. For 0≤k<r, define the up map Rk:Vk→Vk+1 by (Rkf)(B)=∑a∈Bf(B∖{a}) and the down map Lk+1:Vk+1→Vk by (Lk+1g)(A)=∑b∉Ag(A∪{b}). Expanding the finite sums with this convention gives ⟨Rkf,g⟩=∑Af(A) ∑b∉Ag(A∪{b})‾=⟨f,Lk+1g⟩; by [F4], Lk+1=Rk∗. Put L0:V0→{0} equal to zero. For 0≤k<r and f∈Vk, the diagonal terms in Lk+1Rkf occur N−k times, the diagonal terms in Rk−1Lkf occur k times, and both have the same off-diagonal replacement terms. Hence Lk+1Rk−Rk−1Lk=(N−2k)IVk, where the second term is zero for k=0.

2.1F2F3F4F5step 1.1algebra

Taking the inner product of the identity in step 1.1 with f gives ∥Rkf∥2=∥Lkf∥2+(N−2k)∥f∥2. Since k<N/2 for 0≤k<r, Rk is injective, so [F2] gives dim⁡ran⁡Rk=dim⁡Vk. By [F4] and [F5], ker⁡Lk+1=ker⁡Rk∗=(ran⁡Rk)⊥. Apply [F3] to W=ran⁡Rk; the projection onto W along W⊥ is linear, with image W and kernel ker⁡Lk+1, so [F2] gives dim⁡Vk+1=dim⁡ran⁡Rk+dim⁡ker⁡Lk+1. Applying [F2] to Lk+1 then yields dim⁡ran⁡Lk+1=dim⁡Vk, so Lk+1:Vk+1→Vk is onto. Put H0=V0 and Hj=ker⁡Lj for 1≤j≤r; [F2] gives dim⁡Hj=(Nj)−(Nj−1).

3.1step 1.1step 2.1inductionalgebra

If h∈Hj, repeated use of step 1.1 gives, for t≥1 with j+t≤r, Lj+tRj+t−1⋯Rjh=t(N−2j−t+1)Rj+t−2⋯Rjh. For t=1 this is the commutator identity and Ljh=0. Empty products of raising maps mean the identity. If it holds at t and j+t<r, apply the commutator at level j+t; the coefficient becomes t(N−2j−t+1)+(N−2j−2t)=(t+1)(N−2j−t), proving the formula for t+1.

4.1F1F6step 1.1step 2.1step 3.1algebra

On Vr, the Johnson adjacency operator is A=Rr−1Lr−rI: the r diagonal choices in Rr−1Lr return the same subset, and every other term replaces exactly one element. Since Lr=Rr−1∗ by step 1.1, [F6] gives A∗=A. For j<r, applying step 3.1 with t=r−j shows that Rr−1⋯RjHj is an eigenspace of A with eigenvalue (r−j)(N−r−j+1)−r. For j=r, the empty raising product is the identity on Hr, and LrHr=0 gives A∣Hr=−rI directly, the same formula. The raising maps are injective by step 2.1, so this eigenspace has dimension dim⁡Hj. These eigenvalues are distinct because consecutive values differ by N−2j>0 for j<r≤N/2. For v,w in eigenspaces with distinct eigenvalues α,β, self-adjointness gives (α−β)⟨v,w⟩=⟨Av,w⟩−⟨v,Aw⟩=0; hence the eigenspaces are mutually orthogonal. Their dimensions sum telescopically to (Nr)=dim⁡Vr, so their direct sum is all of Vr.

5.1F1F7step 4.1algebra∎

The nonlazy transition is A/[r(N−r)] by [F1], and the lazy transition is its average with the identity. Therefore its eigenvalue on the jth eigenspace is 12(1+(r−j)(N−r−j+1)−rr(N−r))=1−j(N+1−j)2r(N−r). The transitions are symmetric and row-stochastic, so the uniform positive law is stationary and satisfies detailed balance; [F7] makes this a finite reversible chain and defines its absolute gap on the mean-zero subspace. The j=0 eigenspace has multiplicity one and is spanned by the constant vector. The other eigenspaces are orthogonal to it by self-adjointness, and their eigenvalues are nonnegative and decreasing in j, since j(N+1−j) increases for 0≤j≤r≤N/2. If v=∑j=1rvj is the orthogonal decomposition into these eigenspaces, then ∥Pv∥2=∑j=1rλj2∥vj∥2≤λ12∥v∥2, with equality on a nonzero vector in the j=1 eigenspace. Hence the norm of P on the mean-zero subspace is λ1. The smallest eigenvalue is λr=(N−r−1)/(2(N−r))≥0, since N−r≥2. Therefore the absolute gap is 1−λ1=N/[2r(N−r)], as stated.

Depends on

Used by

Dependency tree · two levels

32 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