Alphabeta Math
Pipeline-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.

Discrete Quantum Walks and Szegedy Theory — Examples

1 · Prerequisites

2 · Summary

These finite examples check the boundaries of the definitions and spectral results: a stationary law with a zero coordinate does not support a full-state inverse-similarity formula; a stationary directed cycle need not have the reversible discriminant similarity; period two forces absolute gap zero; and the two-state reversible walk displays the distinct endpoint eigenvalue multisets of U and W=U2.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A zero stationary weight makes the full-state similarity undefined

Statement refuted

For every finite chain and every stationary probability vector π, including one with zero coordinates, the full-state matrix diag⁡(π)Pdiag⁡(1/π) is defined and equals the discriminant.

Facts & Assumptions

Given: A finite row-stochastic kernel P and a stationary probability vector π, as defined by Finite row-stochastic kernel and Invariant and stationary distribution for a Markov kernel.

[F1]

Finite row-stochastic kernel: each row of P has nonnegative entries summing to one.

[F2]

Invariant and stationary distribution for a Markov kernel: on a finite state space, stationarity is π(y)=∑xπ(x)Pxy.

[F3]

Szegedy row-preparation map and discriminant: the discriminant is the endomorphism D:=T∗ST.

Counterexample

Take X={0,1},

P=(1010),π=(1,0).

1.1F1F2givenalgebra

Each row of P is a probability vector, and πP=(1,0)=π, so π is stationary.

1.2givenalgebra

The second coordinate has π1=0, so the diagonal matrix diag⁡(1/π0,1/π1) is undefined over R; hence the proposed full-state similarity matrix is not defined.

2.1F3givenstep 1.1step 1.2∎

The proposed assertion identifies the full-state expression with the discriminant D of [F3] and requires the displayed matrix to be defined for every stationary probability vector. Step 1.2 shows it is undefined for this valid stationary vector, so the universal assertion is false. A restriction to the positive support is a different statement.

CounterexampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A stationary directed cycle is not similar to its discriminant

Statement refuted

For every finite row-stochastic kernel with a strictly positive stationary distribution, the discriminant equals the stationary similarity transform diag⁡(π)Pdiag⁡(1/π), even when detailed balance fails.

Facts & Assumptions

Given: A finite row-stochastic kernel, a stationary probability vector, and the discriminant defined by Szegedy row-preparation map and discriminant.

[F1]

Finite row-stochastic kernel: each row of P is nonnegative and sums to one.

[F2]

Invariant and stationary distribution for a Markov kernel: π is stationary exactly when πP=π.

[F3]

Reversible measure and detailed balance: reversibility requires πxPxy=πyPyx for every pair.

[F4]

Counterexample

Take X={0,1,2} with indices modulo 3 and Pxy=1 exactly when y=x+1(mod3), with all other entries zero. Let π=(1/3,1/3,1/3).

1.1F1F2given

Every row of P has one entry equal to 1, and each column also has one such entry, so P is row-stochastic and πP=π.

2.1F3step 1.1algebra

Detailed balance fails at (x,y)=(0,1) because π0P01=1/3 but π1P10=0. Thus the chain is stationary but not reversible.

3.1F1F2F4step 1.1algebra∎

No pair of distinct states has transitions in both directions, and all diagonal entries are zero, so PxyPyx=0 for every x,y and [F4] gives D=0. Since the stationary vector is uniform, its diagonal similarity transform is diag⁡(π)Pdiag⁡(1/π)=P≠0. The claimed identity fails.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

The two-vertex deterministic swap has absolute gap zero

Example

Let X={0,1} and let

P=(0110),π=(1/2,1/2).

The chain alternates deterministically between the two states. The absolute spectral gap is defined by Absolute spectral gap of a finite reversible chain on the mean-zero subspace.

Facts & Assumptions

Given: The finite reversible chain above, the period convention Period of a state, and the absolute-gap convention Absolute spectral gap of a finite reversible chain.

[F1]

Finite reversible Markov chain with positive stationary law: a reversible chain has a positive stationary law satisfying row-stationarity and detailed balance.

[F2]

Period of a state: the period is the gcd of the positive return times with positive transition probability.

[F3]

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

Verification

1.1F1givenalgebra

Both rows of P sum to one, πP=π, and π0P01=π1P10=1/2; the diagonal detailed-balance equations are automatic. Hence (X,P,π) is a finite reversible chain.

1.2F2givenalgebra

Starting from either state, a return occurs exactly at positive even times, so the return-time set is {2,4,6,…} and its gcd is 2. The chain is period two.

2.1F3F4step 1.1algebra∎

The constant vector 1=(1,1) has eigenvalue 1, while h=(1,−1) spans H0 and satisfies Ph=−h. Thus the restriction to H0 has norm 1, so [F3] gives δabs(P)=0. The eigenvalues of P are exactly 1 and −1.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

Two-state reversible walk and its endpoint phases

Example

For a∈[0,1], take

Pa=(1−aaa1−a),π=(1/2,1/2).

Compute the discriminant and the complete eigenvalue multisets of the one-reflection walk U and its square W=U2, including both endpoint parameters.

Facts & Assumptions

Given: The finite row-stochastic kernel (X,Pa) with the supplied law π and the definitions of T,S,D,U,W from Szegedy row-preparation map and discriminant and Szegedy reflection walk and its two-reflection square.

[F1]

Finite reversible Markov chain with positive stationary law: a finite reversible chain has a positive stationary probability law and satisfies detailed balance.

[F2]

The Szegedy discriminant is self-adjoint and contractive: T∗T=I and Dxy=(Pa)xy(Pa)yx.

[F3]

Szegedy row-preparation map and discriminant: the label/product bases are orthonormal; T∣x⟩=∣x⟩∑y(Pa)xy∣y⟩, S∣x,y⟩=∣y,x⟩, and D=T∗ST.

[F4]

Szegedy reflection walk and its two-reflection square: U=S(2TT∗−I) and W=U2.

[F5]

Szegedy walk invariant subspaces from discriminant eigenvectors: for Dv=μv, the span of Tv,STv is an invariant line when μ=±1 and an invariant plane when −1<μ<1.

[F6]

Szegedy reflections and walk operators are unitary: S is unitary and, with A=ran⁡T, U=−S on A⊥.

[F7]

Szegedy spectral mapping for one and two reflections: an interior discriminant eigenvalue μ contributes e±iarccos⁡μ to U and e±2iarccos⁡μ to W; a +1 or −1 endpoint eigendirection contributes that same sign to U and +1 to W.

[F8]

Write σmult(T) for the multiset of eigenvalues counted with algebraic multiplicity. The ordinary spectrum σ(T) is a set. Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism: the spectrum of an endomorphism is the set of scalars with a nonzero eigenvector; the zero-space endomorphism has empty spectrum.

[F9]

Kernel and image of a linear map: the image of a linear map T is {T(v):v∈V}.

[F11]

The orthogonal complement W⊥={v:⟨v,w⟩=0 for all w∈W}: H⊥ consists of vectors whose inner product with every vector of H is zero.

[F12]

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

Verification

1.1F1givenalgebra

Both rows of Pa sum to one, πPa=π, and Pa is symmetric, so πx(Pa)xy=πy(Pa)yx for all x,y. Thus π is a positive stationary reversible law.

1.2F2algebra

Since Pa is symmetric and has nonnegative entries, [F2] gives D=Pa. The vectors u+=(1,1) and u−=(1,−1) form a basis with Du+=u+ and Du−=(1−2a)u−.

1.3F3F4F6F8algebra

At a=0, T∣0⟩=∣00⟩ and T∣1⟩=∣11⟩, so A=B=span⁡{∣00⟩,∣11⟩}. On A, RA=2TT∗−I is +I and S=I, so U=+I. On K=span⁡{∣01⟩,∣10⟩}, [F6] gives U=−S, whose eigenvectors ∣01⟩+∣10⟩ and ∣01⟩−∣10⟩ have eigenvalues −1 and +1. Hence σmult(U)={1,1,1,−1} and W=I has four eigenvalues +1.

1.4F3F4F6F8algebra

At a=1, T∣0⟩=∣01⟩ and T∣1⟩=∣10⟩, so A=B=span⁡{∣01⟩,∣10⟩}. On A, RA=+I and U=S, with eigenvalues +1,−1. On K=span⁡{∣00⟩,∣11⟩}, S=I, so [F6] gives U=−I. Thus σmult(U)={1,−1,−1,−1} and W=I has four eigenvalues +1.

2.1F5F7F8step 1.2algebra

Suppose 0<a<1 and set λ=1−2a∈(−1,1) and θ=arccos⁡λ∈(0,π). By [F7], the u+ endpoint line contributes +1 to U and W, and the u− invariant plane contributes eiθ,e−iθ to U and e2iθ,e−2iθ to W.

3.1F2F3F4F5F6F9F10F11F12step 1.2step 2.1algebra∎

Under the hypothesis of step 2.1, put r=1−a and s=a. Let A=im⁡T and B=im⁡(ST); these are subspaces by [F9]–[F10]. By [F3], their spanning vectors are T∣0⟩=r∣00⟩+s∣01⟩, T∣1⟩=s∣10⟩+r∣11⟩, ST∣0⟩=r∣00⟩+s∣10⟩, and ST∣1⟩=s∣01⟩+r∣11⟩. The vector k=(s∣00⟩−r∣01⟩−r∣10⟩+s∣11⟩)/2 has norm one because r2+s2=1 and is orthogonal to each spanning vector by cancellation of the two rs terms. Hence [F11] gives 0≠k∈K:=(A+B)⊥; since the product register has dimension four, [F12] implies dim⁡(A+B)≤3. By [F5], STu+=Tu+ gives a common nonzero vector in A∩B, while Tu− and STu− are linearly independent because −1<λ<1. These two vectors are orthogonal to the common vector: ⟨Tu+,Tu−⟩=⟨STu+,STu−⟩=0 by isometry of T and unitarity of S, and ⟨Tu+,STu−⟩=⟨u+,Du−⟩=0 by the distinct eigenvalues in step 1.2; the reverse cross-pairing vanishes by conjugate symmetry. Thus dim⁡(A+B)≥3, so it is exactly 3 and K is one-dimensional, hence K=span⁡{k}. The coefficients of ∣01⟩ and ∣10⟩ in k are equal, so [F3] gives Sk=k. By [F6], U=−S=−I on K. Combining this complement eigenvalue with the line and plane eigenvalues from step 2.1 yields σmult(U)={1,−1,eiθ,e−iθ} and σmult(W)={1,1,e2iθ,e−2iθ}.

Sources