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.
The generated normalized Fibonacci lifts are dense in SU(2)
Statement
Assume and the fixed Fibonacci convention , with . Put and let . Then is dense in in operator norm.
Facts & Assumptions
Given: The fixed data and three-anyon braid matrices, the projective image of the Fibonacci braid generators, and .
The supplier verifies the stated matrices , unitarity, braid relation, and . Three-Fibonacci-anyon qubit matrices
The fixed data use in the specified chirality and gauge. Fibonacci fusion data and chiral convention
The projective Fibonacci B3 image is dense in under ACω. Fibonacci single-qubit projective density
The full inverse image of a dense subgroup under is dense under ACω. Dense projective SU(2) image has dense determinant-one lifts
is connected. Special unitary groups are connected
Assume exactly countable choice . The Axiom of Countable Choice ()
Proof
The matrices are unitary by [F1], and has modulus one. Their determinants satisfy by [F1]–[F2], so each lifted generator lies in . Let be the quotient map with kernel . Multiplication by the scalar does not change a projective class, so . By [A1] and [F3], is dense, so [F4] gives density of . Every fiber of has exactly two elements, which yields .
Let in . It is a subgroup: for and any neighborhood of , continuity of gives neighborhoods of with ; since lie in the closure, choose and , so . Hence . By step 1.1, is dense; taking closures of this finite union gives . If , then and the cover forces . If , then : an intersection would give for , hence . Both sets are closed, so each is also open as the complement of the other; this separates the connected group into two nonempty clopen sets, contradicting [F5]. Therefore and . Only [A1] is used as a choice axiom.
Depends on
Used by
- Fixed SU(2) Fibonacci braid gate alphabet Definition
Dependency tree · two levels
30 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
- John Preskill, Lecture Notes for Physics 219: Quantum Computation, Chapter 9: Topological Quantum Computation (standard reference, not scraped)
- Chetan Nayak, Steven H. Simon, Ady Stern, Michael Freedman, and Sankar Das Sarma, Non-Abelian Anyons and Topological Quantum Computation (standard reference, not scraped)
- Michael H. Freedman, Michael J. Larsen, and Zhenghan Wang, A Modular Functor Which Is Universal for Quantum Computation (standard reference, not scraped)