Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

The generated normalized Fibonacci lifts are dense in SU(2)

Statement

Assume ACω and the fixed Fibonacci convention B1=diag⁡(1,r), B2=FB1F with r=e−3πi/5. Put z=e3πi/10 and let Λ=⟨zB1,zB2⟩≤SU(2). Then Λ is dense in SU(2) in operator norm.

Facts & Assumptions

Given: The fixed F/R data and three-anyon braid matrices, the projective image Γ of the Fibonacci braid generators, and ACω.

[F1]

The supplier verifies the stated matrices B1,B2, unitarity, braid relation, and det⁡Bj=r. Three-Fibonacci-anyon qubit matrices

[F2]

The fixed data use r=Rτ/R1=e−3πi/5 in the specified chirality and gauge. Fibonacci fusion data and chiral convention

[F3]

The projective Fibonacci B3 image is dense in PU(2) under ACω. Fibonacci single-qubit projective density

[F4]

The full inverse image of a dense subgroup under SU(2)→PU(2) is dense under ACω. Dense projective SU(2) image has dense determinant-one lifts

[F5]

SU(2) is connected. Special unitary groups are connected

[A1]

Assume exactly countable choice ACω. The Axiom of Countable Choice (ACω)

Proof

1.1A1F1F2F3F4givenalgebra

The matrices Bj are unitary by [F1], and z has modulus one. Their determinants satisfy det⁡(zBj)=z2det⁡(Bj)=e3πi/5e−3πi/5=1 by [F1]–[F2], so each lifted generator lies in SU(2). Let q:SU(2)→PU(2) be the quotient map with kernel {I,−I}. Multiplication by the scalar z does not change a projective class, so q(Λ)=Γ. By [A1] and [F3], Γ is dense, so [F4] gives density of q−1(Γ). Every fiber of q has exactly two elements, which yields q−1(Γ)=Λ∪(−Λ).

2.1A1F5step 1.1algebra∎

Let K=Λ‾ in SU(2). It is a subgroup: for x,y∈K and any neighborhood O of xy−1, continuity of (u,v)↦uv−1 gives neighborhoods U,V of x,y with UV−1⊆O; since x,y lie in the closure, choose u∈U∩Λ and v∈V∩Λ, so uv−1∈O∩Λ. Hence xy−1∈K. By step 1.1, q−1(Γ)=Λ∪(−Λ) is dense; taking closures of this finite union gives K∪(−K)=SU(2). If −I∈K, then −K=K and the cover forces K=SU(2). If −I∉K, then K∩(−K)=∅: an intersection would give x=−y for x,y∈K, hence −I=y−1x∈K. Both sets are closed, so each is also open as the complement of the other; this separates the connected group SU(2) into two nonempty clopen sets, contradicting [F5]. Therefore −I∈K and K=SU(2). Only [A1] is used as a choice axiom.

Depends on

Used by

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