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.
Ising–Majorana exchange interface
Definition
Let and let . A Majorana system of length is a family of operators satisfying Its parity operator is . For each adjacent pair, put
A Majorana–Ising exchange interface on a fixed parity sector consists of such a system, a choice and the sector , together with the following explicit model-identification hypotheses for every : the Ising pair-charge projections are identified with , and the exchange is with the same relative phase . The last identity is required for all adjacent pairs as part of the interface; the three-anyon supplier below establishes it only in its stated sector and does not prove this all- identification.
Facts & Assumptions
Given: A Majorana system, a fixed parity sector, and the interface hypotheses in the Definition.
In the three-, total- Ising sector, the supplier gives and , hence . Ising fusion data and chiral convention
Proof
Let . The Majorana relations give and . Therefore and are self-adjoint idempotents, , and . They are the orthogonal complementary pair-channel projections stipulated by the interface.
Since , expansion of the exponential gives . Its restrictions to and are respectively and . Using the phase ratio in [F1] as imposed for every generator by the interface, the channel exchange equals Thus it differs from by one common scalar.
Depends on
Used by
Dependency tree · two levels
7 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
- Chetan Nayak, Steven H. Simon, Ady Stern, Michael Freedman, and Sankar Das Sarma, Non-Abelian Anyons and Topological Quantum Computation (standard reference, not scraped)