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 and . For the lazy Johnson transition matrix on the -subsets of from Element-distinctness Johnson walk and value access, all eigenvalues, counted with multiplicity, are
with multiplicity , where . 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
Facts & Assumptions
Given: The finite state space and the lazy transition probabilities of Element-distinctness Johnson walk and value access.
Element-distinctness Johnson walk and value access: stays at a subset with probability and replaces one of its elements by one of the elements outside with probability for each replacement.
Rank-nullity: : for a linear map with finite-dimensional domain, .
For a subspace of a finite-dimensional inner product space, : for a subspace of a finite-dimensional inner-product space , .
The adjoint is characterised by : for every .
Adjoints satisfy , , , and : for compatible finite-dimensional maps, ; also and .
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 on the mean-zero subspace.
Proof
For , let 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 , define the up map by and the down map by . Expanding the finite sums with this convention gives by [F4], . Put equal to zero. For and , the diagonal terms in occur times, the diagonal terms in occur times, and both have the same off-diagonal replacement terms. Hence , where the second term is zero for .
Taking the inner product of the identity in step 1.1 with gives . Since for , is injective, so [F2] gives . By [F4] and [F5], . Apply [F3] to ; the projection onto along is linear, with image and kernel , so [F2] gives . Applying [F2] to then yields , so is onto. Put and for ; [F2] gives .
If , repeated use of step 1.1 gives, for with , For this is the commutator identity and . Empty products of raising maps mean the identity. If it holds at and , apply the commutator at level ; the coefficient becomes , proving the formula for .
On , the Johnson adjacency operator is : the diagonal choices in return the same subset, and every other term replaces exactly one element. Since by step 1.1, [F6] gives . For , applying step 3.1 with shows that is an eigenspace of with eigenvalue . For , the empty raising product is the identity on , and gives directly, the same formula. The raising maps are injective by step 2.1, so this eigenspace has dimension . These eigenvalues are distinct because consecutive values differ by for . For in eigenspaces with distinct eigenvalues , self-adjointness gives ; hence the eigenspaces are mutually orthogonal. Their dimensions sum telescopically to , so their direct sum is all of .
The nonlazy transition is by [F1], and the lazy transition is its average with the identity. Therefore its eigenvalue on the th eigenspace is 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 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 , since increases for . If is the orthogonal decomposition into these eigenspaces, then , with equality on a nonzero vector in the eigenspace. Hence the norm of on the mean-zero subspace is . The smallest eigenvalue is , since . Therefore the absolute gap is , as stated.
Depends on
- Element-distinctness Johnson walk and value access
- Real and complex inner product spaces, with the inner product linear in the first argument
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- The orthogonal complement $W^\perp=\{v:\langle v,w\rangle=0\text{ for all }w\in W\}$
- Adjoints satisfy $(S+T)^*=S^*+T^*$, $(\lambda T)^*=\overline\lambda T^*$, $(ST)^*=T^*S^*$, and $T^{**}=T$
- Finite reversible Markov chain with positive stationary law
- Absolute spectral gap of a finite reversible chain
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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 20, §20.2 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, Chapter 8, §8.3.2 (standard reference, not scraped)
- Andris Ambainis, Quantum walk algorithm for element distinctness, §§3–4 (standard reference, not scraped)