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.
Szegedy row-preparation map and discriminant
Definition
For a finite row-stochastic kernel , let and carry the standard orthonormal label and ordered-product bases. If , these coordinate spaces are implemented as two ordered registers; if , they are zero spaces and every map below is the unique zero-dimensional map. Define the row-preparation linear map and the swap on basis vectors by
Every scalar square root is the unique nonnegative real root. Define the discriminant by , using the adjoint characterized by for the root inner product, which is linear in its first argument. The row-preparation map is an isometry; its complete verification is The Szegedy discriminant is self-adjoint and contractive ↗. This is the general row-stochastic construction and assumes no reversibility.
Depends on
- Finite registers and their ordered computational bases
- Ordered tensor registers, their inner product, and wire permutations
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Every linear map between finite-dimensional inner product spaces has a unique adjoint
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces
- Finite row-stochastic kernel
- Dirac Notation Conversion
Used by
- MNRS finite reversible-walk finding Algorithm
- A zero stationary weight makes the full-state similarity undefined Counterexample
- Szegedy reflection walk and its two-reflection square Definition
- Two-state reversible walk and its endpoint phases Example
- Discriminant of the marked-state absorbing walk Lemma
- Szegedy reflections and walk operators are unitary Lemma
- Szegedy walk invariant subspaces from discriminant eigenvectors Lemma
- Szegedy spectral mapping for one and two reflections Theorem
- The Szegedy discriminant is self-adjoint and contractive Theorem
Dependency tree · two levels
35 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, §§18.2–18.3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, §8.2 (standard reference, not scraped)