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
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Controlled Gates, Phase, and Entanglement
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Discrete Quantum Walks and Szegedy Theory
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite-Dimensional Complex Inner-Product Spaces and Matrix Interfaces
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fundamental Trigonometric Identities
- Further Trigonometric Identities and Inverse Functions
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Markov Kernels and Markov Chains
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Pure and Mixed States, Ensembles, and Schmidt Decomposition
- Qubits, Bloch Sphere, Pauli Algebra, and One-Qubit Gates
- Recurrence Transience and Hitting Times for Markov Chains
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Stationary Markov Chains and Ergodic Limits
- Strongly Continuous Semigroups and Hille Yosida
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Lebesgue Integral and the Convergence Theorems
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 and .
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
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 is defined and equals the discriminant.
Facts & Assumptions
Given: A finite row-stochastic kernel and a stationary probability vector , as defined by Finite row-stochastic kernel and Invariant and stationary distribution for a Markov kernel.
Finite row-stochastic kernel: each row of has nonnegative entries summing to one.
Invariant and stationary distribution for a Markov kernel: on a finite state space, stationarity is .
Szegedy row-preparation map and discriminant: the discriminant is the endomorphism .
Counterexample
Take ,
Each row of is a probability vector, and , so is stationary.
The second coordinate has , so the diagonal matrix is undefined over ; hence the proposed full-state similarity matrix is not defined.
The proposed assertion identifies the full-state expression with the discriminant 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.
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 , 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.
Finite row-stochastic kernel: each row of is nonnegative and sums to one.
Invariant and stationary distribution for a Markov kernel: is stationary exactly when .
Reversible measure and detailed balance: reversibility requires for every pair.
Counterexample
Take with indices modulo and exactly when , with all other entries zero. Let .
Every row of has one entry equal to , and each column also has one such entry, so is row-stochastic and .
Detailed balance fails at because but . Thus the chain is stationary but not reversible.
No pair of distinct states has transitions in both directions, and all diagonal entries are zero, so for every and [F4] gives . Since the stationary vector is uniform, its diagonal similarity transform is . The claimed identity fails.
The two-vertex deterministic swap has absolute gap zero
Example
Let and let
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.
Finite reversible Markov chain with positive stationary law: a reversible chain has a positive stationary law satisfying row-stationarity and detailed balance.
Period of a state: the period is the gcd of the positive return times with positive transition probability.
Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism: eigenvalues have nonzero eigenvectors and form the spectrum.
Verification
Both rows of sum to one, , and ; the diagonal detailed-balance equations are automatic. Hence is a finite reversible chain.
Starting from either state, a return occurs exactly at positive even times, so the return-time set is and its gcd is . The chain is period two.
The constant vector has eigenvalue , while spans and satisfies . Thus the restriction to has norm , so [F3] gives . The eigenvalues of are exactly and .
Two-state reversible walk and its endpoint phases
Example
For , take
Compute the discriminant and the complete eigenvalue multisets of the one-reflection walk and its square , including both endpoint parameters.
Facts & Assumptions
Given: The finite row-stochastic kernel with the supplied law and the definitions of from Szegedy row-preparation map and discriminant and Szegedy reflection walk and its two-reflection square.
Finite reversible Markov chain with positive stationary law: a finite reversible chain has a positive stationary probability law and satisfies detailed balance.
Szegedy row-preparation map and discriminant: the label/product bases are orthonormal; , , and .
Szegedy walk invariant subspaces from discriminant eigenvectors: for , the span of is an invariant line when and an invariant plane when .
Szegedy reflections and walk operators are unitary: is unitary and, with , on .
Szegedy spectral mapping for one and two reflections: an interior discriminant eigenvalue contributes to and to ; a or endpoint eigendirection contributes that same sign to and to .
Write for the multiset of eigenvalues counted with algebraic multiplicity. The ordinary spectrum is a set. Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism: the spectrum of an endomorphism is the set of scalars with a nonzero eigenvector; the zero-space endomorphism has empty spectrum.
Kernel and image of a linear map: the image of a linear map is .
The kernel and image are linear subspaces, and a linear map is injective if and only if its kernel is trivial: the image of a linear map is a linear subspace.
The orthogonal complement : consists of vectors whose inner product with every vector of is zero.
For a subspace of a finite-dimensional inner product space, : in a finite-dimensional inner-product space, .
Verification
Both rows of sum to one, , and is symmetric, so for all . Thus is a positive stationary reversible law.
Since is symmetric and has nonnegative entries, [F2] gives . The vectors and form a basis with and .
At , and , so . On , is and , so . On , [F6] gives , whose eigenvectors and have eigenvalues and . Hence and has four eigenvalues .
At , and , so . On , and , with eigenvalues . On , , so [F6] gives . Thus and has four eigenvalues .
Suppose and set and . By [F7], the endpoint line contributes to and , and the invariant plane contributes to and to .
Under the hypothesis of step 2.1, put and . Let and ; these are subspaces by [F9]–[F10]. By [F3], their spanning vectors are , , , and . The vector has norm one because and is orthogonal to each spanning vector by cancellation of the two terms. Hence [F11] gives ; since the product register has dimension four, [F12] implies . By [F5], gives a common nonzero vector in , while and are linearly independent because . These two vectors are orthogonal to the common vector: by isometry of and unitarity of , and by the distinct eigenvalues in step 1.2; the reverse cross-pairing vanishes by conjugate symmetry. Thus , so it is exactly and is one-dimensional, hence . The coefficients of and in are equal, so [F3] gives . By [F6], on . Combining this complement eigenvalue with the line and plane eigenvalues from step 2.1 yields and .
Sources
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 18
- Ronald de Wolf, Quantum Computing: Lecture Notes, Chapter 8
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, §§18.2–18.3
- Ronald de Wolf, Quantum Computing: Lecture Notes, §8.2
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, §18.4
- Ronald de Wolf, Quantum Computing: Lecture Notes, §§8.1–8.2
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, §18.3