Alphabeta Math
Pipeline-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.

Topological Braid Gates, Encodings, and Universality

1 · Prerequisites

2 · Summary

This page develops unitary braid actions on fixed-total-charge fusion spaces, then separates projective phase, logical block error, and leakage. It verifies the three-anyon Ising matrices directly and proves the multi-anyon Majorana Clifford restriction under an explicit channel-identification interface. For the fixed Fibonacci F/R convention, it verifies the three-anyon matrices and exact joint SU(5) × SU(8) density of the two six-strand path-matrix blocks using finite algebraic certificates. Triple-anyon encodings extend these conditional gates to arbitrary finite registers with explicit operator-norm, logical-error, and leakage bounds. The physical interface is conditional on a realized fusion space and its specified exchange action. No exact leakage-free entangler or useful joint braid-length bound is asserted; common braid phases must be tracked under coherent control. The QC25 Fibonacci data carrier supplies the coherent fixed-chirality model through an explicit exact verification of all simple-input pentagon and hexagon sectors; pair-charge and triple codes are compared inside that category without identifying their projectors. The Ising data carrier supplies only the three-anyon sector; the all-m Majorana channel identification is an explicit interface hypothesis, not a consequence claimed from that carrier.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Physical braid implementation interface

Definition

Let V be a nonzero finite-dimensional complex inner-product space and let ρ:Bn→U(V) be a fixed mathematical braid representation. A physical implementation record for a braid b∈Bn consists of all of the following data and hypotheses:

  1. a finite-dimensional physical Hilbert space Hphys;
  2. a C2 path H(s):Hphys→Hphys of Hermitian endomorphisms, 0≤s≤1, and a norm-continuous constant-rank orthogonal spectral projection P(s) of rank m=dim⁡V that is a coherently followed band in the sense of Finite adiabatic path model, including its local-contour continuation, and is separated from its complement by a uniform positive full gap. The initial low-energy sector is ran⁡P(0);
  3. a unitary identification ι0:V→ran⁡P(0), an explicit preparation isometry A0:Cm→Hphys with image exactly ran⁡P(0), its declared preparation cost, and a stated slow-time schedule T>0;
  4. a unitary final-band identification ι1:V→ran⁡P(1) and a separate identification of the band's transported action along the chosen exchange path, using ι0 and ι1, with ρ(b) up to a stated scalar phase.

The first three clauses form an instance of the finite adiabatic path model Finite adiabatic path model on Hphys. Under those hypotheses, Finite JRS adiabatic projector bound bounds the deviation from ideal adiabatic band following. That estimate does not establish that a material realizes the fusion category, that the exchange path has the prescribed holonomy, or that the initial state can be prepared at no cost. Locality, temperature, quasiparticle separation, stray excitations, and tunnelling require their own physical error model.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Special unitary groups are connected

Statement

For every integer n≥1, the matrix group SU(n)={A∈Mn(C):A∗A=I, det⁡A=1} is path connected.

Facts & Assumptions

Proof

1.1givenF1F2choosealgebra

The matrix A is unitary and therefore normal. By [F1], choose a unitary matrix Q and real phases α1,…,αn such that A=Qdiag⁡(eiα1,…,eiαn)Q∗. Since det⁡A=1, [F2] gives ∑jαj=2πk for some integer k. Replace α1 by α1−2πk; the eigenvalue is unchanged and the sum of phases is now zero. This uses only finitely many eigenvalues.

2.1givenF2F3step 1.1algebra∎

Define A(t)=Qdiag⁡(eitα1,…,eitαn)Q∗ for 0≤t≤1. Each A(t) is unitary by [F2], and det⁡A(t)=eit∑jαj=1, so A(t)∈SU(n). The path is continuous by [F3], A(0)=I, and A(1)=A. Thus every element is joined to the identity, proving path connectedness.

DefinitionDefinition: AI-adaptedProof: AI-adaptedOpen item page →

Fixed-charge encoding and code projector

Definition

Fix a unitary fusion category D and the representative set Irr⁡(D) of Multiplicity-aware fusion-tree basis. For an ordered list x1,…,xn∈Irr⁡(D), n≥1, a total charge c∈Irr⁡(D), and a parenthesized input tensor T, let V=Hom⁡(T,c)≠0, equipped with that definition's orthonormal fusion-tree inner product. The identical-input case x1=⋯=xn=x retains the notation V=V(xn→c). Let C=Ck with its ordered orthonormal computational basis, where k≥1. A fixed-charge encoding is an isometry J:C→V, so J∗J=IC. Its code subspace is JC, and its code projector is P:=JJ∗:V→V. An encoding records a chosen subspace of a fusion space; it does not identify that subspace with an object of the fusion category.

Facts & Assumptions

Given: The finite-dimensional fusion space V, the computational space C, and an isometry J:C→V.

[F2]

The adjoint satisfies (AB)∗=B∗A∗ and (J∗)∗=J. The adjoint T∗:W→V is characterised by ⟨Tv,w⟩W=⟨v,T∗w⟩V

Proof

1.1givenF1F2algebra

By [F2], P∗=(JJ∗)∗=(J∗)∗J∗=JJ∗=P. Also P2=JJ∗JJ∗=J(J∗J)J∗=JICJ∗=P by [F1]. Hence P is an orthogonal projection.

2.1givenF1step 1.1algebra∎

For every u∈C, P(Ju)=JJ∗Ju=Ju by [F1], so JC⊆ran⁡P. Conversely Pv=J(J∗v) lies in JC for every v∈V, so ran⁡P⊆JC. Therefore ran⁡P=JC.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedOpen item page →

Logical block error and leakage amplitude

Definition

Let J:C→V be a fixed-charge encoding, P=JJ∗ its code projector, U∈U(C) a logical target, and W∈U(V) an ambient unitary. Its zero-on-the-complement target extension is U~:=JUJ∗:V→V. Define the logical block error and leakage amplitude by ϵlog(W,U):=∥PWP−U~∥op,ϵleak(W):=∥(I−P)WP∥op. Both are finite operator norms. The first measures the compressed block against the target; the second measures transfer from the code into its orthogonal complement. They diagnose different errors.

Facts & Assumptions

Given: A finite-dimensional encoding J:C→V, its projector P, a logical unitary U, and an ambient unitary W.

[F1]

P is the orthogonal projection onto JC. Fixed-charge encoding and code projector

[F2]

The operator norm is finite for every linear map between finite-dimensional inner-product spaces. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||

Proof

1.1givenF1F2

The maps PWP−U~ and (I−P)WP are endomorphisms of V. Because V is finite dimensional, [F2] assigns a finite operator norm to each map; the two quantities are therefore well defined.

2.1givenF1F2algebra∎

For a zero-leakage but logically incorrect boundary case, take V=C=C2, J=P=I, W=I, and U=diag⁡(1,−1). Then ϵleak=0 and ϵlog=∥I−U∥op=2. This proves the two quantities are not interchangeable.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Braid action on a fixed-charge fusion space

Definition

Fix a unitary braided fusion category C and the simple-object representative set Irr⁡(C) used in Multiplicity-aware fusion-tree basis. Let x,c∈Irr⁡(C), let n≥2, and suppose V(xn→c)≠0. Use the left-associated fusion-tree basis. For the Artin generator σi that exchanges the ith and (i+1)st strands, let Ti be the specified sequence of F-moves that changes from the fixed tree basis to a basis where those two charges fuse first, and let Ri apply the corresponding R-symbol on each pair-charge channel. Define ρc(σi):=Ti−1RiTi. This defines the generator assignment. The next theorem proves that the assignment descends from words to a well-defined group homomorphism. Word products use matrix multiplication acting right-to-left on column vectors. The abstract group in this definition is the Artin group The braid group by Artin presentation; the positive crossing is the generator convention used for the displayed R-symbols. If a motion is described chronologically, its matrix product is written in reverse temporal order.

Positive crossing convention

The diagram depicts the positive adjacent generator on two identical charges. Time runs from top to bottom; the continuous left-input strand passes over the broken right-input strand. The crossing represents cx,x, while its pullback on a fusion space uses the inverse in the formula above. This fixes the R-matrix orientation; the proof of the Artin relations is categorical.

xxxx¾i

Remarks

The geometric configuration convention in Geometric braid classes and the unordered configuration fundamental group uses first-loop-then-second multiplication, while raw slicing reverses stacking. This definition fixes the algebraic Artin action directly and makes no extra assertion that the library's geometric group is identified with the Artin presentation under a stronger axiom branch.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Exact logical-block correctness forces zero leakage

Statement

Let J:C→V be an isometric encoding with P=JJ∗, let U be unitary on C, and let W be unitary on V. If the logical block error ∥PWP−JUJ∗∥op is zero, then the leakage amplitude ∥(I−P)WP∥op is zero.

Facts & Assumptions

Given: Finite-dimensional inner-product spaces C,V, an isometry J:C→V, a unitary U on C, a unitary W on V, and zero logical block error.

[F1]

The logical block error is ∥PWP−JUJ∗∥op and the leakage amplitude is ∥(I−P)WP∥op; P=JJ∗ is the orthogonal projection onto JC. Logical block error and leakage amplitude

[F2]

Isometries preserve inner-product norm, and orthogonal projection splits a vector into orthogonal code and complement components. Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces The norm ∥v∥=⟨v,v⟩ induced by a real or complex inner product

Proof

1.1givenF1F2algebra

Zero block error means PWP=JUJ∗ as operators on V. For every x∈C, J∗J=IC gives PWJx=PWPJx=JUJ∗Jx=JUx. By [F2], ∥WJx∥=∥x∥ and ∥PWJx∥=∥JUx∥=∥Ux∥=∥x∥.

2.1F1F2step 1.1algebra∎

The decomposition WJx=PWJx+(I−P)WJx is orthogonal by [F1]. Its Pythagorean identity and step 1.1 give ∥(I−P)WJx∥2=∥WJx∥2−∥PWJx∥2=0 for every x. Hence (I−P)WJ=0, and since P=JJ∗, (I−P)WP=0; its operator norm is zero.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Block-target approximation bounds logical error and leakage

Statement

Let V=PV⊕(I−P)V be an orthogonal decomposition of a finite-dimensional Hilbert space, let U and W be unitary operators on the two summands, and let T:=U⊕W. If an ambient unitary G satisfies ∥G−T∥op≤δ, then the logical block error of G relative to U and its leakage amplitude both are at most δ.

Facts & Assumptions

Given: The orthogonal projection P, the block-unitary target T, the ambient unitary G, and δ≥0.

[F1]

Logical block error and leakage are ∥PGP−UP∥op and ∥(I−P)GP∥op after identifying U with its zero-on-the-complement extension. Logical block error and leakage amplitude

[F2]

The operator norm is zero when its domain is zero; otherwise it is the maximum of ∥Ax∥ over unit vectors x. In particular, ∥Ay∥≤∥A∥op∥y∥ for every y, by scaling nonzero y to a unit vector and treating y=0 separately. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||

Proof

1.1givenF1F2algebra

If V=0, both error maps have norm zero by [F2], so both bounds hold. Otherwise, since T preserves both summands, PTP=UP on V and (I−P)TP=0. Thus PGP−UP=P(G−T)P. For any y∈V, the orthogonal decomposition y=Py+(I−P)y gives ∥Py∥≤∥y∥ and ∥(I−P)y∥≤∥y∥ by the Pythagorean identity. Hence for every unit vector x, ∥P(G−T)Px∥≤∥(G−T)Px∥≤∥G−T∥op∥Px∥≤δ. Taking the maximum in [F2] proves the logical block error bound.

2.1givenF1F2step 1.1algebra∎

In the remaining case V≠0, (I−P)GP=(I−P)(G−T)P because (I−P)TP=0. By the contractions in step 1.1, for every unit x, ∥(I−P)(G−T)Px∥≤∥(G−T)Px∥≤∥G−T∥op∥Px∥≤δ. Taking the maximum gives the leakage bound.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Ising–Majorana exchange interface

Definition

Let m≥2 and let H=(C2)⊗m. A Majorana system of length 2m is a family of operators γ1,…,γ2m∈End⁡(H) satisfying γj∗=γj,γj2=I,γjγk=−γkγj(j≠k). Its parity operator is Π=imγ1⋯γ2m. For each adjacent pair, put Q1(j)=I−iγjγj+12,Qψ(j)=I+iγjγj+12,Uj=exp⁡ ⁣(−π4γjγj+1).

A Majorana–Ising exchange interface on a fixed parity sector consists of such a system, a choice η∈{1,−1} and the sector Hη=ker⁡(Π−ηI), together with the following explicit model-identification hypotheses for every 1≤j<2m: the Ising pair-charge projections are identified with Q1(j),Qψ(j), and the exchange is R1Q1(j)+RψQψ(j) with the same relative phase Rψ/R1=i. 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-m identification.

Facts & Assumptions

Given: A Majorana system, a fixed parity sector, and the interface hypotheses in the Definition.

[F1]

In the three-σ, total-σ Ising sector, the supplier gives R1=e−iπ/8 and Rψ=e3iπ/8, hence Rψ/R1=i. Ising fusion data and chiral convention

Proof

1.1givenalgebra

Let Aj=iγjγj+1. The Majorana relations give Aj∗=Aj and Aj2=I. Therefore Q1(j)=(I−Aj)/2 and Qψ(j)=(I+Aj)/2 are self-adjoint idempotents, Q1(j)Qψ(j)=0, and Q1(j)+Qψ(j)=I. They are the orthogonal complementary pair-channel projections stipulated by the interface.

2.1givenF1algebra∎

Since (γjγj+1)2=−I, expansion of the exponential gives Uj=2−1/2(I−γjγj+1). Its restrictions to ran⁡Q1(j) and ran⁡Qψ(j) are respectively e−iπ/4I and eiπ/4I. Using the phase ratio in [F1] as imposed for every generator by the interface, the channel exchange equals R1Q1(j)+RψQψ(j)=R1eiπ/4Uj. Thus it differs from Uj by one common scalar.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedOpen item page →

Projective braid gate and operator metric

Definition

Let V≠0 be a finite-dimensional complex inner-product space and let U(V) be its unitary group. Two unitaries are projectively equivalent when A=zB for some z∈C with ∣z∣=1; write [A]∈PU(V) for the equivalence class. Define dP([A],[B]):=min⁡∣z∣=1∥A−zB∥op. This is the distance after quotienting by one common scalar phase. The phase is minimized over the unit circle; it is not chosen independently in different charge blocks.

For the fixed-charge braid representation ρc in Braid action on a fixed-charge fusion space, the projective braid gate of a braid b∈Bn is [ρc(b)]∈PU(V(xn→c)).

Facts & Assumptions

Given: The finite-dimensional unitary group U(V) and the operator norm.

[F1]

The operator norm is the maximum of ∥Tx∥ over unit vectors. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||

[F3]

The multiplicative unit circle is compact and metrizable. The multiplicative unit circle is a compact metrizable topological abelian group

[F4]

A continuous real-valued function on a nonempty compact metric space attains its minimum. A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value

[F5]

Under the hypotheses of the braid-action definition, its generator assignment extends to a well-defined unitary homomorphism ρc:Bn→U(V(xn→c)). Unitary Artin braid representation on fixed-charge fusion spaces

Proof

1.1F1F2algebra

The operator norm satisfies the triangle inequality: for every unit vector x, ∥(S+T)x∥≤∥Sx∥+∥Tx∥≤∥S∥op+∥T∥op, so taking the maximum gives ∥S+T∥op≤∥S∥op+∥T∥op. Scalar homogeneity follows from [F2] and the same maximum definition. Thus ∣∥S∥op−∥T∥op∣≤∥S−T∥op by applying the triangle inequality twice.

1.2givenF1algebra

The formula is independent of representatives. If A′=uA and B′=vB with ∣u∣=∣v∣=1, then inf⁡∣z∣=1∥A′−zB′∥=inf⁡∣z∣=1∥A−(u−1zv)B∥; as z runs over the unit circle, so does u−1zv.

2.1F1F2F3F4step 1.1algebra

The map z↦∥A−zB∥op is continuous: step 1.1 bounds ∣∥A−zB∥−∥A−wB∥∣≤∥(z−w)B∥=∣z−w∣∥B∥. By [F3] and [F4] it attains its minimum on the unit circle, so the infimum in the definition is a minimum. Nonnegativity and symmetry follow from the norm axioms and the substitution z↦zˉ.

3.1F1F2F3F4step 1.1step 1.2step 2.1algebra

For classes [A],[B],[C], choose minimizing phases z,w for the pairs (A,B) and (B,C) by [F3]–[F4]. The triangle inequality gives ∥A−zwC∥≤∥A−zB∥+∥zB−zwC∥=dP([A],[B])+dP([B],[C]), so taking the minimum over phases for (A,C) proves the triangle inequality. If dP([A],[B])=0, a minimizing phase satisfies A=zB, so [A]=[B]. Conversely equal classes have distance zero. Therefore dP is a metric on PU(V).

4.1F5step 3.1∎

By [F5], two words representing the same braid b give the same unitary ρc(b). Its projective class is therefore well defined, and step 3.1 supplies the metric on these classes.

DefinitionDefinition: Literature-sourcedProof: AI-adaptedOpen item page →

Six-anyon triple-encoded subspace and leakage complement

Definition

Assume the Fibonacci fusion rules 1⊗x=x⊗1=x and τ⊗τ=1⊕τ, with each listed summand of multiplicity one. For six ordered τ charges, let Wa be the fixed-input, fixed-total fusion space of total charge a∈{1,τ} in the tree that first fuses leaves 1,2,3 and 4,5,6 separately, then fuses those triple outputs. Let Va be the same fixed-charge space in the left-associated tree.

To identify these spaces, write A=((τ1⊗τ2)⊗τ3). Use the object associator composite g=(αA⊗τ4,τ5,τ6−1)∘αA,τ4,τ5⊗τ6−1∘(id⁡A⊗ατ4,τ5,τ6) from the triple-grouped input tree to the left-associated tree. On a fusion morphism f into a, define Ga(f)=f∘g−1:Va; this is a unitary change of fusion-tree coordinates.

For one triple of total charge τ, its two orthonormal path vectors are indexed by the charge x∈{1,τ} after the first two anyons: both x⊗τ→τ channels have multiplicity one. Write these vectors as ∣x⟩. For x,y∈{1,τ} and a∈{1,τ}, let ∣x,y;a⟩ be the grouped-tree vector with first triple path x, first triple total τ, second triple path y, second triple total τ, and final vertex channel τ⊗τ→a. The last channel has multiplicity one. Define Ca:=Ga(span⁡{∣x,y;a⟩:x,y∈{1,τ}})⊆Va. In the ordered basis (Ga∣1,1;a⟩,Ga∣1,τ;a⟩,Ga∣τ,1;a⟩,Ga∣τ,τ;a⟩), the inclusion Ja:C4→Va is an isometry; its code projector is Pa=JaJa∗. The same ordered local triple paths are used for a=1 and a=τ; only the final pair-charge coordinate differs. The orthogonal complements are called leakage spaces.

Facts & Assumptions

Given: The stated Fibonacci fusion rules, the multiplicity-aware fusion-tree basis, the unitary associator, and the fixed-charge encoding convention.

[A1]

Assume the Fibonacci fusion rules stated in the Definition. The actual Fibonacci data carrier states 1⊗x=x⊗1=x and τ⊗τ=1⊕τ with multiplicity one in each channel. Fibonacci fusion data and chiral convention

[F1]

The fusion-tree definition constructs each path vector by composing its vertex multiplicity-basis maps. Multiplicity-aware fusion-tree basis

[F2]

The fusion-tree lemma proves that these path vectors form a complete orthonormal basis and counts them by the products of the vertex multiplicities. Fusion-tree basis and dimension recursion

[F3]

An isometric inclusion J has code projector JJ∗ onto its image. Fixed-charge encoding and code projector

[F4]

Each associator is unitary, so the stated finite associator composite induces a unitary map between the two fusion-tree Hom spaces. Unitary fusion category F-symbol unitarity

Proof

1.1A1F2F4algebra

The fusion rule gives dim⁡V(τ2→1)=dim⁡V(τ2→τ)=1 and therefore dim⁡V(τ3→1)=1, dim⁡V(τ3→τ)=2. Applying the fusion-tree count [F2] to the grouped tree, total charge 1 receives one basis vector from the (1,1) triple-output pair and four from (τ,τ), so dim⁡W1=1+2⋅2=5. Total charge τ receives two vectors from (1,τ), two from (τ,1), and four from (τ,τ), so dim⁡Wτ=2+2+4=8. The map Ga in [F4] is unitary, hence dim⁡V1=5 and dim⁡Vτ=8.

1.2F1F2F3F4givenalgebra

Each selected triple-total-τ factor has its two paths ∣1⟩ and ∣τ⟩, and the final τ⊗τ→a vertex has multiplicity one. Thus the four grouped-tree vectors ∣x,y;a⟩ are admissible tree vectors by [F1] and form an orthonormal family by [F2]. Applying the unitary Ga preserves orthonormality, so they define an isometric inclusion Ja; [F3] gives the projector Pa=JaJa∗ and dim⁡Ca=4.

2.1step 1.1step 1.2algebra∎

The orthogonal decompositions Va=Ca⊕Ca⊥ then give dim⁡C1⊥=5−4=1 and dim⁡Cτ⊥=8−4=4 by step 1.1. These code copies share the same ordered local triple paths, while their final output charge differs. This supplies the dimensions and path identification used in the two B6 blocks.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedOpen item page →

Three-Fibonacci-anyon qubit matrices

Example

For three τ anyons of total charge τ, the fusion space is two-dimensional. Fix the chiral convention F=(ϕ−1ϕ−1/2ϕ−1/2−ϕ−1),r=Rτ/R1=e−3πi/5. After removing the common scalar R1, the adjacent generators are B1=diag⁡(1,r),B2=FB1F.

The verification checks these matrices directly as a unitary B3 representation. It uses the listed sector data as input and does not infer global category coherence from this calculation.

Facts & Assumptions

Given: τ⊗τ=1⊕τ and the displayed fixed-convention Fibonacci F and R data.

[F1]

The Fibonacci supplier states the fusion rule, the displayed F block, and the pullback phases R1=e−4πi/5 and Rτ=e3πi/5, so Rτ/R1=e−3πi/5. Fibonacci fusion data and chiral convention

Verification

1.1givenF1algebra

Put u=ϕ−1 and v=ϕ−1/2. Since ϕ2=ϕ+1, u2+u=1 and v2=u. Matrix multiplication then gives F2=(u2+v2uv−uvuv−uvu2+v2)=I. Both diagonal entries of B1 have modulus one, so B1 is unitary; F is unitary because it is real and F∗F=F2=I. The data in [F1] give r=Rτ/R1=e−3πi/5. Also r5=−1 and r≠−1, so division of r5+1=0 by r+1 gives r4−r3+r2−r+1=0. With y=r+r−1, division by r2 gives y2−y−1=0; since y=2cos⁡(3π/5)<0, it follows that y=−u and r2+ur+1=0. Hence B2=FB1F is unitary.

1.2givenF1algebra

Write B2=(pqqt), where p=u2+ur, q=uv(1−r), and t=u+u2r. Then B1B2B1=(pqrqrr2t),B2B1B2=(p2+q2rq(p+rt)q(p+rt)q2+t2r). The relations r2=−ur−1 and u3=2u−1 give p+rt=r; expanding the remaining diagonal entries and using u2+u=1, v2=u, and r2+ur+1=0 gives p2+q2r=p and q2+t2r=−p. Thus both matrices reduce to (u2+uruvr(1−r)uvr(1−r)−(u2+ur)). The Artin relation follows entry by entry.

2.1givenstep 1.2algebra∎

The off-diagonal entry of B1B2−B2B1 is q(1−r)=uv(1−r)2≠0, because u,v≠0 and r≠1. Thus the generators do not commute. They are not two copies of a single diagonal phase gate in the same fusion basis.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedOpen item page →

Three-Ising-anyon braid matrices are Clifford

Example

In the three-σ, total-σ Ising sector, use F=H=2−1/2(111−1), R1=e−iπ/8, and Rψ=e3iπ/8. After removing the common phase R1, the two projective braid generators are B1=(100i),B2=HB1H.

Facts & Assumptions

Given: The displayed fixed Ising fusion sector, its ordered channel basis, and the Pauli matrices X,Y,Z.

[F1]

The Pauli matrices are X=(0110), Y=(0−ii0), Z=(100−1). The Pauli matrices

[F2]

A unitary is Clifford when it normalizes the phase-aware Pauli group. Clifford normalizer

[F3]

In the three-σ, total-σ sector, the Ising supplier gives F=H, R1=e−iπ/8, and Rψ=e3iπ/8; hence Rψ/R1=i. It explicitly limits this to sector data. Ising fusion data and chiral convention

Verification

1.1F3algebra

By [F3], Rψ/R1=i. Removing R1 gives B1=diag⁡(1,i), and recoupling by H=H−1 gives B2=HB1H. Both are unitary because H and B1 are unitary. Put a=(1+i)/2 and b=(1−i)/2, so B2=(abba). Direct multiplication, using a2+ib2=a, ab(1+i)=ib, and b2+ia2=−a, gives B1B2B1=(aibib−a)=B2B1B2. Thus these matrices define a unitary representation of the two-generator Artin presentation of B3, independently of any all-label Ising coherence claim.

2.1F1step 1.1algebra

Direct multiplication gives B1XB1∗=Y, B1YB1∗=−X, and B1ZB1∗=Z; also B2XB2∗=X, B2YB2∗=Z, and B2ZB2∗=−Y. Thus each generator conjugates every Pauli matrix to a signed Pauli matrix.

3.1F2step 1.1step 2.1algebra∎

Products and inverses of Pauli normalizers again normalize the Pauli group: for normalizers A,B, (AB)P(AB)∗=A(BPB∗)A∗=P, and the inverse property follows by conjugating the equality APA∗=P by A∗. The scalar phase removed in step 1.1 has trivial conjugation action, so the physical braids are projectively Clifford in this sector.

Remarks

This is a projective statement for an isolated fixed-charge sector. The scalar phase cannot be discarded when the braid is coherently controlled. The supplier gives sector data only; this item makes no all-label Ising category claim.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The braid phase is a common scalar character

Statement

Fix the Fibonacci convention with common exchange scalar R1. Let e:Bn→Z be exponent sum, sending each Artin generator σi to 1. If ρ~ is the generator-normalized representation ρ~(σi)=R1−1ρ(σi), then for every braid b and every total-charge block, ρ(b)=R1e(b)ρ~(b). The scalar is the same on every total-charge block and every spectator multiplicity. It is a global phase for an uncontrolled fixed-sector computation; under coherent control it is a relative phase and must be tracked.

Facts & Assumptions

Given: The fixed-chirality Fibonacci F/R data and the Artin presentation.

[A1]

Assume every generator has the same scalar R1 on all fusion channels; its relative channel phases define the normalized generator. The actual Fibonacci data carrier fixes R1=e−4πi/5 and Rτ=e3πi/5 in its stated gauge. Fibonacci fusion data and chiral convention

[F2]

Standalone unit-modulus phases leave pure-state measurement probabilities unchanged. Standalone Global Phase Leaves Pure-State POVM Probabilities Unchanged

[F3]

A separately controlled scalar phase can change measurement probabilities by becoming relative to the control branch. A Controlled Global Phase Becomes a Relative Control Phase

Proof

1.1givenalgebra

Exponent sum is well defined on the Artin group: both sides of every adjacent braid relation have sum 3, both sides of every distant commutation relation have sum 2, and inverse cancellation changes the sum by 0. Thus e:Bn→Z is a homomorphism.

2.1A1step 1.1algebra

For a word b=σi1ϵ1⋯σikϵk, each positive generator contributes R1 and each inverse contributes R1−1 to the scalar, by [A1]. The scalar product is therefore R1ϵ1+⋯+ϵk=R1e(b), while the remaining normalized matrices multiply to ρ~(b). Since every relation preserves exponent sum, this factorization is independent of the word representative.

3.1F2F3step 2.1∎

The same scalar multiplies every charge block, so [F2] applies to an uncontrolled isolated sector. Under coherent control the scalar multiplies only the active branch, and [F3] shows it becomes a relative phase; it cannot be discarded without recording or correcting it.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Fibonacci B6 path projectors satisfy the braid relations

Statement

Use the Fibonacci fusion rule τ⊗τ=1⊕τ and the fixed-chirality data Fττττ=(ϕ−1ϕ−1/2ϕ−1/2−ϕ−1) and r=Rτ/R1=e−3πi/5. The fixed-total-charge B6 path bases are

P1={0101010,0101110,0110110,0111010,0111110},

Pτ={0101011,0101101,0101111,0110101,0110111,0111011,0111101,0111111},

where each path is (x0,…,x6), x0=0 is the unit label, x1=1 is τ, and adjacent labels obey the fusion rule. For d0=1,d1=ϕ, define Ei on either path basis by (Ei)x,y={dxidyi/dxi−1,xj=yj (j≠i), xi−1=xi+1=yi−1=yi+1,0,otherwise,Pi:=ϕ−1Ei. Then Pi are orthogonal projections, have ranks 2 on P1 and 3 on Pτ, satisfy PiPi+1Pi=ϕ−2Pi and commute at separation at least two. Consequently Bi=rI+(1−r)Pi are unitary matrices satisfying the Artin relations of B6, with det⁡Bi=r3 on V(τ6→1) and det⁡Bi=r5 on V(τ6→τ).

Facts & Assumptions

Given: The fixed Fibonacci fusion rule, the unitary fusion-tree bases, and the chiral F/R coordinates displayed in the Statement.

[F2]

A fusion-tree basis retains each admissible intermediate charge and vertex multiplicity index. The current supplier body was inspected. Multiplicity-aware fusion-tree basis

[A1]

Assume the Fibonacci fusion rule and the fixed-chirality data displayed in the Statement: the normalized pair-channel eigenvalues are 1,r, and the nontrivial recoupling block is the displayed F matrix. The actual Fibonacci data carrier states this fusion rule and these fixed sector matrices. Fibonacci fusion data and chiral convention

Proof

1.1givenA1F2constructalgebra

Starting with (x0,x1)=(0,1), the fusion rule permits only xj+1=1 when xj=0, and permits xj+1∈{0,1} when xj=1. Enumerating the five remaining transitions with endpoint x6=0 or 1 gives exactly the two path sets displayed in the Statement; hence the block dimensions are 5 and 8. Also r5=−1 and r≠−1, so r4−r3+r2−r+1=0. For y=r+r−1, division by r2 gives y2−y−1=0; since y=2cos⁡(3π/5)<0, y=−ϕ−1. Thus r2+ϕ−1r+1=0.

1.2givenA1F2algebra

In a fixed left-tree basis, Pi is the projection onto pair channel 1. The F-move gives the only nontrivial local block, on the two intermediate channels (1,τ): (ϕ−2ϕ−3/2ϕ−3/2ϕ−1). Its square equals itself because ϕ−4+ϕ−3=ϕ−2, ϕ−3/2(ϕ−2+ϕ−1)=ϕ−3/2, and ϕ−3+ϕ−2=ϕ−1; its entries are real symmetric. When the surrounding charge is the unit, the only allowed pair-channel block is [1]. Thus each Pi=Pi∗=Pi2. Counting the diagonal entries of these blocks on the listed paths gives tr⁡Pi=2 on P1 and 3 on Pτ, so these are the ranks.

1.3A1algebra

On the nontrivial three-strand total-τ block, the adjacent projections are P=∣e1⟩⟨e1∣ and Q=∣f1⟩⟨f1∣, where f1=(ϕ−1,ϕ−1/2) is the first column of F. Therefore PQP=∣⟨e1,f1⟩∣2P=ϕ−2P and symmetrically QPQ=ϕ−2Q. In the one-dimensional total-1 block both adjacent projections are zero, so the same identities hold. Tensoring with spectator path factors leaves these identities unchanged. Operators on disjoint pairs commute by the interchange law for tensor products.

2.1A1step 1.3algebra

Put q0=ϕ−2. For adjacent P=Pi,Q=Pi+1 and s=1−r, direct expansion using P2=P, Q2=Q, PQP=q0P, and QPQ=q0Q gives [rI+sP][rI+sQ][rI+sP]−[rI+sQ][rI+sP][rI+sQ]=s(r+q0s2)(P−Q). Because r+r−1=−ϕ−1, (r+q0(1−r)2)/r=1+ϕ−2(r+r−1−2)=1−ϕ−2(ϕ−1+2)=0; here ϕ−1+2=ϕ2. Thus the adjacent braid relation holds.

3.1givenstep 1.2step 1.3step 2.1algebra∎

Since Pi is an orthogonal projection and ∣r∣=1, Bi acts by 1 on ran⁡Pi and by r on its orthogonal complement, so it is unitary. The distant commutation and adjacent relation from steps 1.3 and 2.1 are the defining Artin relations, hence the matrices represent B6. The rank table gives rank 2 on the five-dimensional block and rank 3 on the eight-dimensional block, so det⁡Bi=r5−2=r3 and det⁡Bi=r8−3=r5, respectively.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Fibonacci coefficient ring and its exact mod-31 specialization

Statement

Let r=e−3πi/5, ϕ=(1+5)/2=1−r−r−1, and s=ϕ>0. Then Z[r,s]≅Z[x,y]/(x4−x3+x2−x+1, y2−(1−x−x−1)), where x−1=x9. The assignment r↦15,r−1↦29,ϕ↦19,s↦9 defines a ring homomorphism to F31. The elements r and ϕ map to nonzero units, and conjugation of coefficients is handled by r↦r−1 before reduction.

Facts & Assumptions

Given: The fixed Fibonacci root r, the golden ratio ϕ, and the positive square root s=ϕ.

[A1]

Assume the fixed-chirality root r=Rτ/R1=e−3πi/5 from the actual Fibonacci data carrier; the positive square root s=ϕ is fixed in the Statement. The carrier states the phases R1=e−4πi/5 and Rτ=e3πi/5. Fibonacci fusion data and chiral convention

Proof

1.1givenA1algebra

The number r is a primitive tenth root of unity, so its minimal polynomial is Φ10(x)=x4−x3+x2−x+1 and [Q(r):Q]=4. Its maximal real subfield is Q(5), and the nontrivial conjugate of ϕ is (1−5)/2=−ϕ−1; hence the field norm of ϕ from Q(5) to Q is −1. Therefore ϕ is not a square in that real subfield, since the norm of a square would be a nonnegative rational square.

2.1givenstep 1.1algebra

If u∈Q(r) satisfied u2=ϕ, complex conjugation would give uˉ2=ϕ, hence uˉ=u or uˉ=−u. In the first case u∈Q(5), contradicting step 1.1. In the second case u is purely imaginary in the chosen embedding, so u2 is nonpositive real, contrary to ϕ>0. Thus Y2−ϕ is irreducible over Q(r) and [Q(r,s):Q]=8. The displayed monic relations therefore give the full degree-eight presentation; no additional relation is being assumed.

3.1givenA1step 2.1algebra

In F31, 15−1=29, Φ10(15)=0, 1−15−29=19, and 92=19. Thus the assignments satisfy both defining relations and extend to the stated ring homomorphism. The images 15 and 19 are nonzero, so r,ϕ and their powers are units; all denominators in the path projectors and normalized braid matrices are therefore invertible after specialization.

4.1givenstep 3.1algebra∎

In the number field, complex conjugation fixes ϕ,s and sends r to r−1. Therefore a coefficient involving conjugation is first rewritten with r−1 and only then reduced by r−1↦29. No conjugation operation on F31 is required.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Logical error and leakage add under code-preserving gate approximation

Statement

Let P be a code projection on a finite-dimensional Hilbert space V. Let W1,…,WG be ideal unitaries preserving ran⁡P, and let V1,…,VG be physical unitaries with ∥Vj−Wj∥op≤δj. If Vtot=VG⋯V1 and Wtot=WG⋯W1, then, with empty products equal to I and empty sums equal to 0, ∥Vtot−Wtot∥op≤∑j=1Gδj. Consequently the logical block error and leakage amplitude relative to the code action of Wtot are each at most ∑jδj.

Facts & Assumptions

Given: The code projection, the two finite lists of unitaries, and the individual bounds δj≥0.

[F1]

If W preserves the code, the logical block error and leakage amplitude are the compression and off-diagonal block norms. Logical block error and leakage amplitude

[F2]

A full-space operator approximation of size δ bounds both compressed logical error and leakage by δ. Block-target approximation bounds logical error and leakage

Proof

1.1givenF2algebra

If G=0, both products are the empty product I and the sum of errors is 0, so the full-space error is 0; [F2] then gives zero logical block error and zero leakage.

1.2givenalgebra

For G≥1, insert and subtract the mixed products to obtain the exact telescoping identity VG⋯V1−WG⋯W1=∑j=1GVG⋯Vj+1(Vj−Wj)Wj−1⋯W1. It follows by expanding the sum: consecutive terms cancel, leaving only VG⋯V1−WG⋯W1. Every outer product is unitary, so its operator norm is one and each summand has norm at most δj. The triangle inequality proves the displayed sum bound.

2.1F1F2step 1.1step 1.2algebra∎

The product Wtot preserves the code because each factor does. Apply [F2] with δ=∥Vtot−Wtot∥op; step 1.1 bounds this by ∑jδj using step 1.2 when G≥1 and step 1.1 when G=0. This gives the claimed logical error and leakage bounds, including on arbitrary ambient states before projection.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

Unitary Artin braid representation on fixed-charge fusion spaces

Statement

For a unitary braided fusion category C, simple representatives x,c∈Irr⁡(C) as in Multiplicity-aware fusion-tree basis, n≥2, and a nonzero fixed-total fusion space, the operators in Braid action on a fixed-charge fusion space define a unitary group homomorphism ρc:Bn⟶U(V(xn→c)). In particular, the adjacent Artin relations and distant commutation relations hold in each fixed-charge block.

Facts & Assumptions

Given: A unitary fusion category with a specified unitary braiding, the simple representatives x,c, the nonzero fixed-charge fusion space V(xn→c), and the generator matrices Ti−1RiTi.

[F1]

In a braided monoidal category, the local braidings on X⊗n give a canonical homomorphism from the Artin group; the associator transports the action to a fixed parenthesization. An object of a braided category carries canonical braid actions

[F2]

The current QC25 bodies define finite semisimple orthogonal fusion-tree spaces, unitary associators and braidings, and unitary F/R coordinates; their pentagon and hexagon coordinate identities match the categorical coherence maps. The fusion-tree dimension lemma supplies complete bases. Unitary fusion category Multiplicity-aware fusion-tree basis Fusion-tree basis and dimension recursion Braiding F-symbol unitarity R-symbol unitarity Pentagon in fusion-tree coordinates Hexagon in F/R coordinates

Proof

1.1givenF2algebra

By [F2], each generator matrix is a product of unitary operators: Ti and Ti−1 are unitary changes of orthonormal fusion-tree basis, and Ri is unitary on every orthogonal pair-charge summand. Therefore ρc(σi)∗ρc(σi)=I and every generator, as well as its inverse, is unitary.

2.1F1F2step 1.1givenalgebra∎

By [F1], let bi be the local categorical braidings on the fixed parenthesized tensor power; they satisfy the Artin relations. On the multiplicity space V=Hom⁡(x⊗n,c) define Bb(f)=f∘b−1. For object automorphisms g,h, Bh(Bg(f))=f∘g−1∘h−1=f∘(h∘g)−1=Bh∘g(f). Thus inverse precomposition transports the object-level relations to the Bbi. In the fusion-tree coordinates of [F2], reassociating to the pair-first tree, applying the pullback R-symbol, and reassociating back gives exactly Ti−1RiTi from Braid action on a fixed-charge fusion space. Hence this generator assignment satisfies the Artin presentation and defines a group homomorphism, unitary by step 1.1.

CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedOpen item page →

A controlled braid phase is observable

Statement refuted

A scalar phase that is irrelevant for an uncontrolled fixed-sector braid remains irrelevant when that braid is coherently controlled.

Facts & Assumptions

Given: A control qubit with basis ∣0⟩,∣1⟩, the target space C, and a control-first controlled-unitary convention.

[F1]

The phase-insensitive projective class identifies I and −I on the one-dimensional target. Projective braid gate and operator metric

[F2]

A controlled global phase becomes a relative control phase and is observable by a two-outcome measurement. A Controlled Global Phase Becomes a Relative Control Phase

Counterexample

Given: The target starts in the unit vector 1∈C, the control starts in ∣+⟩=(∣0⟩+∣1⟩)/2, and the measurement is in the {∣+⟩,∣−⟩} basis.

1.1givenF1algebra

Uncontrolled on C, the gates I and −I differ by the scalar −1, so they have the same projective class by [F1].

2.1givenF2step 1.1algebra∎

The controlled I is the identity, so it leaves the control in ∣+⟩ and the + outcome has probability 1. The controlled −I is diag⁡(1,−1) on the control; it maps ∣+⟩ to ∣−⟩, so the same outcome has probability 0. Thus the controlled outcome laws differ, refuting the statement.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Exact, projective, and encoded braid universality

Definition

Let Γ≤U(V) be a subgroup acting on a nonzero finite-dimensional Hilbert space V. It is exactly universal on V when Γ=U(V), projectively exactly universal when its image in PU(V) is all of PU(V), and projectively dense when that image is dense in the metric dP of Projective braid gate and operator metric.

For an encoding J:C→V with code projector P=JJ∗, the action is approximate logical-and-leakage universal if for every U∈U(C) and every ϵ>0 there is W∈Γ and a phase z∈U(1) such that ∥PWP−zJUJ∗∥op≤ϵ,∥(I−P)WP∥op≤ϵ. This last notion includes a leakage bound as a separate requirement; projective density on one fusion block alone does not supply it.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The projective one-qubit group is SO(3)

Statement

Assume ACω. Give PU(2) the quotient metric from Projective braid gate and operator metric. The map q:SU(2)⟶PU(2),q(A)=[A], is a two-sheeted covering with kernel {I,−I}. It induces a topological group isomorphism SU(2)/{±I}≅PU(2)≅SO(3).

Facts & Assumptions

Given: The projective unitary group PU(2) with its quotient metric, the matrix group SU(2), and ACω.

[F1]

The projective distance is a metric and dP([A],[B])=min⁡∣z∣=1∥A−zB∥op. Projective braid gate and operator metric

[F4]

Every unit complex number has the form eiθ for some real θ. t↦(cos⁡t,sin⁡t) is a bijection from [0,2π) onto the real unit circle

[F5]

Quaternionic conjugation gives a surjective two-sheeted covering ρ:SU(2)→SO(3) with kernel {I,−I}. SU(2) to SO(3) as a covering homomorphism

[A1]

Assume ACω, the exact choice principle used by [F5]. The Axiom of Countable Choice (ACω)

Proof

1.1givenF4algebra

The determinant of a unitary A∈U(2) has modulus one, since 1=det⁡(A∗A)=det⁡A‾det⁡A. Write det⁡A=eiθ by [F4] and put λ=e−iθ/2. Then ∣λ∣=1 and det⁡(λA)=λ2det⁡A=1, so λA∈SU(2) and q(λA)=q(A). Thus q is onto.

2.1givenstep 1.1algebra

If A∈SU(2) and q(A)=[I], then A=λI for some ∣λ∣=1. The determinant condition gives λ2=1, hence λ=±1. Conversely I and −I have the same projective class. Therefore ker⁡q={±I}, and two matrices have the same q-image exactly when they differ by this kernel.

2.2F1F2F3step 1.1algebra

The map q is continuous: by [F1], dP(q(A),q(B))≤∥A−B∥op. Identify M2(C) with R8. The equations A∗A=I and det⁡A=1 define a closed subset, and each matrix entry is bounded in modulus by 1 because each column has norm 1. Thus SU(2) is compact by [F2]. The metric space PU(2) is Hausdorff by [F1]. If F⊆SU(2) is closed, then it is compact and q(F) is compact, hence closed by [F3]. It is a quotient map: if q−1(W) is open, then q−1(PU(2)∖W) is closed; surjectivity and closedness of q make its image PU(2)∖W closed, so W is open.

3.1A1F3F5step 2.1step 2.2algebra∎

By [F5] and step 2.1, q and ρ have exactly the same fibers. There is therefore a unique bijective group homomorphism ρˉ:PU(2)→SO(3) with ρˉ(q(A))=ρ(A). It is continuous because q is a quotient map and ρ=ρˉ∘q is continuous. The space PU(2)=q(SU(2)) is compact, while SO(3) is Hausdorff as a subspace of the real 3×3 matrix space. A continuous bijection from a compact space to a Hausdorff space is a homeomorphism: images of closed sets are compact and therefore closed by [F3]. Hence ρˉ is a topological group isomorphism. Since q is a quotient map and its fibers are exactly the cosets of {±I} by step 2.1, the induced map SU(2)/{±I}→PU(2) is also a homeomorphism. The covering sheets for q are carried from those of ρ by this homeomorphism, so q is a two-sheeted covering.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Exact five-dimensional Fibonacci B6 density

Statement

Assume ACω. In the normalized Fibonacci B6 representation on V(τ6→1)≅C5, the closure of the braid image in U(5) contains SU(5).

Facts & Assumptions

Given: The fixed Fibonacci convention, the normalized generators Bi=rI+(1−r)Pi, the total-charge-1 fusion-path basis, and ACω.

[F1]

The path projectors are orthogonal, satisfy the adjacent and distant relations, and the normalized matrices are a unitary B6 representation. Fibonacci B6 path projectors satisfy the braid relations

[F2]

The coefficient field Q(r,ϕ) has the stated degree-eight presentation and admits the exact F31 specialization. Fibonacci coefficient ring and its exact mod-31 specialization

[F3]

Integer powers of a circle rotation with irrational angle are dense. Powers of an Irrational Rotation Are Dense on the Circle

[F4]

Under ACω, a closed subgroup of a finite-dimensional real Lie group is a Lie subgroup, and its Lie algebra is bracket closed. Cartan closed subgroup theorem The Lie algebra of a Lie subgroup is a Lie subalgebra

[F5]

su(n) consists of the trace-zero skew-Hermitian matrices. A real basis is given by i(Ejj−Enn) for j<n and, for each j<k, Ejk−Ekj and i(Ejk+Ekj). Thus its real dimension is (n−1)+2(n2)=n2−1, which is 24 for n=5. Unitary and special unitary Lie groups

[F6]

SU(5) is path connected. Special unitary groups are connected

[F9]

A smooth map between manifolds whose differential is an isomorphism at a point is a diffeomorphism between neighborhoods of that point. The smooth inverse function theorem on manifolds

[F7]

Fusion-tree dimensions are counted by summing products of the vertex multiplicities over all admissible internal charges. Fusion-tree basis and dimension recursion

[F8]

The current Fibonacci data carrier states τ⊗τ=1⊕τ and fixes Rτ/R1=e−3πi/5 and the displayed unitary F block in the stated gauge. Fibonacci fusion data and chiral convention

[A1]

ACω is countable choice, the exact axiom in [F4]. The Axiom of Countable Choice (ACω)

[A2]

Assume the Fibonacci fusion rule and the fixed-chirality F/R data stated in Fibonacci B6 path projectors satisfy the braid relations.

Proof

1.1F1F7F8A2algebra

Write u=ϕ−1 and r=Rτ/R1=e−3πi/5 by [F8]. The fusion-tree recurrence [F7] gives dim⁡V(τ2→1)=dim⁡V(τ2→τ)=1, dim⁡V(τ3→1)=1, dim⁡V(τ3→τ)=2, and dim⁡V(τ4→1)=2. The five paths in P1 therefore decompose by the charge of the first three strands as one dimension from charge 1, and 2⋅2=4 dimensions from charge τ: the latter are two copies of the same two-dimensional three-strand block. On the first summand C:=B1B2−1 is 1. On each two-dimensional summand, B1=diag⁡(1,r) and B2=FB1F with F2=I, so direct multiplication gives det⁡C=1 and tr⁡C=r+r−1+(2−r−r−1)u2=u2=ϕ−2; the last equality uses u2+u=1, since (2+u)u2=1. Consequently the full spectrum is 1,eiθ,e−iθ, with the last two eigenvalues each repeated twice and 2cos⁡θ=ϕ−2.

2.1givenstep 1.1algebra

The algebraic number ϕ−2 has minimal polynomial x2−3x+1, whose other root is ϕ2>2. If eiθ were a root of unity, then eiθ+e−iθ and every algebraic conjugate of that sum would be sums of two roots of unity and therefore have absolute value at most 2. The conjugate ϕ2>2 contradicts this. Thus θ/(2π) is irrational.

3.1F3step 2.1construct

Let H be the closure of the normalized B6 image in U(5). The powers of C contain a dense subgroup of the circle diag⁡(1,eitI2,e−itI2), by [F3] and step 2.1. Therefore the nonzero tangent X=C−C−1 belongs to Lie⁡(H).

4.1F1F4step 3.1algebra

Define Y0=X and, with Ad⁡i(Y)=BiYBi−1, define the remaining 23 words in order by Y1=Ad⁡1Y0, Y2=Ad⁡2Y0, Y3=Ad⁡3Y0, Y4=[Y3,Y0], Y5=[Y3,Y1], Y6=[Y3,Y2], Y7=Ad⁡3Y1, Y8=Ad⁡3Y2, Y9=Ad⁡2Y3, Y10=Ad⁡4Y3, Y11=Ad⁡2Y4, Y12=Ad⁡4Y4, Y13=Ad⁡4Y5, Y14=Ad⁡4Y6, Y15=[Y10,Y3], Y16=[Y10,Y4], Y17=[Y10,Y5], Y18=[Y10,Y6], Y19=[Y10,Y7], Y20=[Y10,Y8], Y21=[Y10,Y9], Y22=[Y12,Y0], Y23=[Y12,Y1]. Conjugation by an element of H preserves Lie⁡(H), and [F4] makes that Lie algebra bracket closed, so every Yj lies in it. Each is traceless and skew-Hermitian: this holds for X because C is unitary with spectrum invariant under inversion, and is preserved by unitary conjugation and commutators.

5.1F2step 4.1algebra

By [F2], every coefficient of the Yj matrices lies in Z[r,ϕ] with all denominators units. Reduce coefficients modulo 31 using r↦15, r−1↦29, ϕ↦19, ϕ↦9; for conjugated coefficients first replace r by r−1 in the number field. The exact integer-arithmetic certificate research/scaffold-audit-2026-10-16/topological-quantum-computing/b6-lie-rank-certificate.py forms the 24×24 matrix whose rows are the first 24 row-major coordinates of Y0,…,Y23 and returns determinant 17 in F31. Since the reduction is a ring homomorphism, a zero algebraic determinant would reduce to zero; the determinant is therefore nonzero over C. Tracelessness lets the omitted coordinate be recovered from the other 24, so the Yj are linearly independent.

6.1A1A2F1F4F5F6F9step 4.1step 5.1algebra∎

The determinant of each Bi is r3 by [F1], so det⁡(H)⊆⟨r3⟩ is finite. Since H0 is connected, its determinant is 1, and hence H0⊆SU(5). A connected coordinate neighborhood of the identity in the Lie group H lies in H0; translating it shows that H0 is open in H, so Lie⁡(H0)=Lie⁡(H). Step 4.1 and [F5] give Lie⁡(H0)=su(5). Thus the inclusion H0↪SU(5) has an isomorphism as its differential at the identity, and [F9] makes it a local diffeomorphism. Its image is an open subgroup of SU(5). By [F6], SU(5) is connected, so this subgroup is all of SU(5). Therefore the closure contains SU(5).

Remark

The proof constructs exactly Y0,…,Y23 from the shared initial tangent X=C−C−1 by conjugations and Lie brackets. The listed 24×24 minor has exact determinant 17 modulo 31, so these 24 Lie words are independent; each generator has determinant r3. These are the precise projection data used by the joint-closure argument; they are not a separate acceptance result.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Exact eight-dimensional Fibonacci B6 density

Statement

Assume ACω. In the normalized Fibonacci B6 representation on V(τ6→τ)≅C8, the closure of the braid image in U(8) contains SU(8).

Facts & Assumptions

Given: The fixed Fibonacci convention, the normalized generators Bi=rI+(1−r)Pi, the total-charge-τ fusion-path basis, and ACω.

[F1]

The path projectors are orthogonal, satisfy the adjacent and distant relations, and the normalized matrices are a unitary B6 representation. Fibonacci B6 path projectors satisfy the braid relations

[F2]

The coefficient field Q(r,ϕ) has the stated degree-eight presentation and admits the exact F31 specialization. Fibonacci coefficient ring and its exact mod-31 specialization

[F3]

Integer powers of a circle rotation with irrational angle are dense. Powers of an Irrational Rotation Are Dense on the Circle

[F4]

Under ACω, closed subgroups of finite-dimensional Lie groups are Lie subgroups and their Lie algebras are bracket closed. Cartan closed subgroup theorem The Lie algebra of a Lie subgroup is a Lie subalgebra

[F5]

su(n) consists of the trace-zero skew-Hermitian matrices. A real basis is given by i(Ejj−Enn) for j<n and, for each j<k, Ejk−Ekj and i(Ejk+Ekj). Thus its real dimension is (n−1)+2(n2)=n2−1, which is 63 for n=8. Unitary and special unitary Lie groups

[F6]

SU(8) is path connected. Special unitary groups are connected

[F9]

A smooth map between manifolds whose differential is an isomorphism at a point is a diffeomorphism between neighborhoods of that point. The smooth inverse function theorem on manifolds

[F7]

Fusion-tree dimensions are counted by summing products of the vertex multiplicities over all admissible internal charges. Fusion-tree basis and dimension recursion

[F8]

The current Fibonacci data carrier states τ⊗τ=1⊕τ and fixes Rτ/R1=e−3πi/5 and the displayed unitary F block in the stated gauge. Fibonacci fusion data and chiral convention

[A1]

ACω is countable choice, the exact axiom in [F4]. The Axiom of Countable Choice (ACω)

[A2]

Assume the Fibonacci fusion rule and the fixed-chirality F/R data stated in Fibonacci B6 path projectors satisfy the braid relations.

Proof

1.1F1F7F8A2algebra

The fusion rule and F/R convention in [F8], together with recurrence [F7], give dim⁡V(τ3→1)=1, dim⁡V(τ3→τ)=2, and dim⁡V(τ4→τ)=3. The eight paths in Pτ thus decompose by the first-three-charge label: charge 1 contributes 1⋅2=2 dimensions, and charge τ contributes V(τ3→τ)⊗V(τ⊗τ3→τ) of dimension 2⋅3=6. The operator C:=B1B2−1 is identity on the first summand. On the two-dimensional first-three charge-τ factor it has determinant 1 and trace ϕ−2, so the full spectrum of C is 1 with multiplicity 2 and eiθ,e−iθ each with multiplicity 3, where 2cos⁡θ=ϕ−2.

2.1givenstep 1.1algebra

The minimal polynomial of ϕ−2 is x2−3x+1, whose other root is ϕ2>2. If eiθ were a root of unity, every algebraic conjugate of its trace eiθ+e−iθ would be a sum of two roots of unity and have absolute value at most 2, contradicting the conjugate ϕ2. Thus θ/(2π) is irrational.

3.1F3step 2.1construct

By [F3], powers of C are dense in the circle T=diag⁡(I2,eitI3,e−itI3) after choosing an eigenbasis. Let H be the closure of the normalized B6 image in U(8). Then T⊆H, so the nonzero tangent X=C−C−1 lies in Lie⁡(H).

4.1F1F4step 3.1construct

Starting with Z0=X, construct a list as follows, all over F31 for the independence tests: repeatedly scan Ad⁡i(Zj)=BiZjBi−1 in current-list order j and generator order i=1,…,5, appending a word exactly when its specialized row is independent of previous rows. Using the resulting list as a snapshot, scan commutators [Zj,Zi] in lexicographic order j>i, again appending exactly the independent rows. Repeat full rounds until none is appended. Each accepted word is an adjoint or bracket applied to earlier Lie algebra elements, so it lifts to Lie⁡(H). Unitary conjugation and commutators preserve traceless skew-Hermitian matrices.

5.1F2step 4.1algebra

[F2] makes reduction of every coefficient and denominator in these words well defined. The exact integer-arithmetic certificate research/scaffold-audit-2026-10-16/topological-quantum-computing/b6-su8-lie-rank-certificate.py selects 63 words by the procedure of step 4.1 (the script labels them Y0,…,Y62; this proof renames them Z0,…,Z62) and returns determinant 22 for the 63×63 minor formed from the first 63 row-major coordinates of these matrices. A zero algebraic determinant would map to zero in F31; since 22≠0, the exact determinant is nonzero. The omitted coordinate is the final diagonal entry, determined by trace zero. Thus the selected traceless skew-Hermitian matrices are linearly independent over C.

6.1A1A2F1F4F5F6F9step 5.1algebra∎

Each Bi has determinant r8−3=r5 by [F1], hence det⁡(H)⊆⟨r5⟩ is finite. Since H0 is connected, its determinant is 1, so H0⊆SU(8). A connected coordinate neighborhood of the identity in the Lie group H lies in H0; translating it shows that H0 is open in H, so Lie⁡(H0)=Lie⁡(H)⊆su(8). By [F5], su(8) has real dimension 63. Step 5.1 supplies 63 independent elements of Lie⁡(H), so Lie⁡(H)=su(8). Thus the inclusion H0↪SU(8) has an isomorphism as its differential at the identity, and [F9] makes it a local diffeomorphism. Its image contains an open neighborhood of the identity and is an open subgroup of SU(8). By [F6], SU(8) is connected, so this subgroup equals SU(8). Hence the B6 closure contains SU(8).

Remark

The deterministic scan in step 4.1 constructs exactly 63 Lie words from the same initial tangent X=C−C−1 by conjugations and Lie brackets; the script prints their names as Y0,…,Y62, which this proof calls Z0,…,Z62. The exact 63×63 minor has determinant 22 modulo 31, so these Lie words are independent; each generator has determinant r5. These are the projection data used by the joint-closure argument; they do not assert an efficient braid compiler.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Even-Majorana Ising exchanges normalize logical Paulis

Statement

Assume a Majorana–Ising exchange interface as defined in Ising–Majorana exchange interface. Let γ1,…,γ2m be Majorana operators on the 2m-dimensional fermionic Fock space, with γj∗=γj, γj2=I, and γjγk=−γkγj for j≠k. On either fixed eigenspace of the total parity Π=imγ1γ2⋯γ2m, the adjacent Ising exchanges, up to their common physical scalar, are Uj=exp⁡(−πγjγj+1/4),1≤j<2m. For m≥2 they normalize the logical Pauli group on the m−1 encoded qubits. Their braid-only projective image is finite and is not dense in PU(2m−1).

Facts & Assumptions

Given: The Majorana relations, a fixed-parity sector, and the Pauli matrices.

[F1]

The phase-aware Pauli group is finite and is generated by the single qubit X,Z matrices and scalar phases; the Clifford normalizer consists of unitaries conjugating that group to itself. The Pauli matrices Phase aware n qubit pauli group Clifford normalizer

[F2]

PU(V) is a Hausdorff metric quotient of U(V) by scalar unitaries. Projective braid gate and operator metric

[F3]

The interface identifies the adjacent-pair channels with Q1(j)=(I−iγjγj+1)/2 and Qψ(j)=(I+iγjγj+1)/2, and the exchange with R1Q1(j)+RψQψ(j)=R1eiπ/4Uj for every adjacent pair. Ising–Majorana exchange interface

Proof

1.1givenalgebra

Reordering the 2m Majorana factors gives (γ1⋯γ2m)∗=(−1)mγ1⋯γ2m and (γ1⋯γ2m)2=(−1)mI. Therefore Π∗=Π and Π2=I. Also Πγj=−γjΠ for each j, so γ1 bijects the +1 and −1 eigenspaces; each has dimension 2m−1. Since each product γjγj+1 commutes with Π, every Uj, being a function of that product, preserves both parity sectors.

1.2givenF3algebra

Put Aj=iγjγj+1. Then Aj∗=Aj and Aj2=I, so Q1=(I−Aj)/2 and Qψ=(I+Aj)/2 are orthogonal complementary projections. The operator Uj=2−1/2(I−γjγj+1) has eigenvalues e−iπ/4 on Q1 and eiπ/4 on Qψ, whose ratio is i. By [F3], the channel exchange is therefore (R1eiπ/4)Uj; its common scalar has no effect on conjugation.

2.1givenstep 1.2algebra

Let c=s=2−1/2 and A=γjγj+1, so Uj=cI−sA and Uj∗=cI+sA. Multiplication using γjA=γj+1, Aγj=−γj+1, γj+1A=−γj, and Aγj+1=γj gives UjγjUj∗=γj+1 and Ujγj+1Uj∗=−γj. Every other γk commutes with A, so UjγkUj∗=γk.

2.2givenF3step 1.2algebra

For A=γjγj+1 and B=γj+1γj+2, the Majorana relations give A2=B2=−I and AB=−BA. Expanding with these identities gives UjUj+1Uj=−(A+B)/2=Uj+1UjUj+1. If ∣j−k∣≥2, then the two products γjγj+1 and γkγk+1 commute because moving their four distinct factors past each other contributes sign (−1)4=1; hence UjUk=UkUj. Thus the Uj satisfy the Artin braid relations. The common scalar in step 1.2 preserves these relations, since both sides of each relation have the same number of generators.

3.1F1step 1.1step 2.1algebra

For 1≤k<m define the even Majorana monomials Zˉk=iγ2k−1γ2k and Xˉk=∏ℓ=km−1(iγ2ℓγ2ℓ+1). Each bilinear is a Hermitian involution; the bilinears in a fixed Xˉk have disjoint supports and commute, so every Xˉk is also a Hermitian involution. All these even monomials commute with Π and preserve Hη. Their supports show that the Zˉj commute with one another, the Xˉk commute with one another, and Zˉj anticommutes with Xˉk exactly when j=k (their support intersection has odd size exactly in that case). The commuting involutions Zˉ1,…,Zˉm−1 have joint sign projections ∏k(I+ϵkZˉk)/2 whose sum is identity, so at least one joint eigenspace is nonzero. Applying products of the Xˉk flips each sign independently; hence all 2m−1 joint sign eigenspaces are nonzero and orthogonal. Their number equals dim⁡Hη=2m−1 from step 1.1, so each is one-dimensional. In this basis the Zˉk,Xˉk are the standard logical Pauli generators. To see they exhaust the restrictions of all even Majorana monomials, label γj by the jth standard vector of F22m. Even monomial labels form the 2m−1 dimensional even-sum subspace, and the all-ones parity label lies in it. The labels of the 2m−2 operators Zˉk,Xˉk are independent modulo the parity label: no combination uses coordinate 2m, while the successive coordinates 1,2,3,4,…,2m−1 force in turn the coefficients of Zˉ1,Xˉ1,Zˉ2,Xˉ2,…,Zˉm−1,Xˉm−1 to vanish. They therefore form a basis of the quotient of even labels by the parity label. Reordering and cancelling Majorana factors shows that monomials with the same label differ only by a scalar; on Hη the parity monomial is scalar. Thus every even Majorana monomial restricts to an element of the logical phase-aware Pauli group generated by the Zˉk,Xˉk. By step 2.1 each braid sends every Majorana to a signed Majorana, so it maps this finite Pauli group into itself; invertibility and finiteness make the image equal to the group. Hence each exchange normalizes the logical Pauli group.

4.1F1F2step 2.2step 3.1algebra∎

Conjugation gives a homomorphism from the projective Clifford group to the automorphism group of the phase-aware Pauli group. That Pauli group is finite, so its automorphism group is finite. The kernel consists of unitaries commuting with every logical Pauli; commuting with all logical Zk makes a unitary diagonal in the computational basis, and commuting with each logical Xk forces every diagonal entry to agree. Thus the kernel is scalar and the projective Clifford group is finite. For m≥2, PU(2m−1) is an infinite Hausdorff metric space by [F2]: the classes of diag⁡(1,eit,1,…,1) are distinct as t varies modulo 2π. A finite subgroup is closed in a metric space, so this braid subgroup is not dense.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Joint SU(5)×SU(8) closure from B6 path blocks

Statement

Assume ACω. For the normalized simultaneous six-τ Fibonacci B6 representation on V(τ6→1)⊕V(τ6→τ)≅C5⊕C8, the closure in U(5)×U(8) contains SU(5)×SU(8).

Facts & Assumptions

Given: The simultaneous normalized matrices Bi(5)⊕Bi(8), their common braid word C, and ACω. Let G be the closure of the simultaneous braid image and write g=Lie⁡(G), which is defined by [F2].

[F1]

The separate braid-image closures contain SU(5) and SU(8), respectively. Exact five-dimensional Fibonacci B6 density Exact eight-dimensional Fibonacci B6 density

[F2]

Closed subgroups are Lie subgroups under ACω, and their Lie algebras are bracket closed. Cartan closed subgroup theorem The Lie algebra of a Lie subgroup is a Lie subalgebra

[F3]

su(n) consists of the trace-zero skew-Hermitian matrices. A real basis is given by i(Ejj−Enn) for j<n and, for each j<k, Ejk−Ekj and i(Ejk+Ekj). Thus its real dimension is (n−1)+2(n2)=n2−1, giving dimensions 24 and 63 for n=5,8. Unitary and special unitary Lie groups

[F4]

Both SU(5) and SU(8) are connected. Special unitary groups are connected

[F5]

Integer powers of a circle rotation with irrational angle are dense in the circle. Powers of an Irrational Rotation Are Dense on the Circle

[F7]

A smooth map between manifolds whose differential is an isomorphism at a point is a diffeomorphism between neighborhoods of that point. The smooth inverse function theorem on manifolds

[A2]

Assume the fixed Fibonacci path convention and F/R data stated in Fibonacci B6 path projectors satisfy the braid relations.

Proof

1.1A2F6algebra

Group the paths in [A2] by the charge of their first three strands. The total-1 first-three sector contributes identity blocks of dimensions 1 and 2 in the five- and eight-dimensional spaces. The total-τ sector gives respectively two and three copies of the same two-dimensional block. On each copy, C=B1B2−1 is C0=DFD−1F, with D=diag⁡(1,r) and F from [A2]. Direct multiplication gives det⁡C0=1 and tr⁡C0=ϕ−2. By unitarity and [F6], choose eigenbases in which C5=diag⁡(1,eiθI2,e−iθI2) and C8=diag⁡(I2,eiθI3,e−iθI3), where 0<θ<π and 2cos⁡θ=ϕ−2.

1.2F3algebra

For n≥2, the complex Lie algebra sln(C) is simple. Let I be a nonzero ideal. If some X∈I has an off-diagonal entry Xij≠0, choose a traceless diagonal matrix D whose ordered differences λp−λq (p≠q) are nonzero and pairwise distinct. Such a D exists because each forbidden equality is a proper linear hyperplane in the trace-zero diagonal subspace, and finitely many proper hyperplanes do not cover a vector space over the infinite field C. The map ad⁡D has eigenvectors Epq with these eigenvalues and is zero on diagonal matrices. Lagrange interpolation therefore supplies a polynomial in ad⁡D that sends X to XijEij; since I is an ideal, Eij∈I. If instead a nonzero X∈I is diagonal, it is nonscalar because it is traceless. Choose i≠j with Xii≠Xjj; then [Eij,X]=(Xjj−Xii)Eij∈I, again giving a matrix unit. From Eij∈I, bracketing with Eji gives Eii−Ejj∈I, and bracketing that diagonal matrix with Eji gives Eji∈I. For each k∉{i,j}, [Eki,Eij]=Ekj and [Ejk,Eij]=−Eik, so these units lie in I. The additional unit Ejk follows explicitly from [Eji,Eik]=EjiEik−EikEji=Ejk−0=Ejk, since i,j,k are distinct. We now have Ekj and Ejl for every k,l≠j; for k≠l, [Ekj,Ejl]=Ekl. Thus every off-diagonal matrix unit lies in I, and their brackets give all trace-zero diagonal matrices. Hence I is the whole algebra. If n=2, there is no k∉{i,j}; the already obtained Eij,Eji and Eii−Ejj span sl2, so this case is complete as well. The complexification of su(n) is sln(C): every traceless complex matrix is uniquely a sum A+iB of traceless skew-Hermitian matrices. A nonzero real ideal of su(n) would complexify to a nonzero ideal of sln(C), hence to all of it; equality of dimensions then makes the real ideal all of su(n). Therefore su(5) and su(8) are simple. Their dimensions 24 and 63 from [F3] show they are not isomorphic.

2.1givenstep 1.1algebra

The algebraic number ϕ−2 has minimal polynomial x2−3x+1, whose other root is ϕ2>2. If eiθ were a root of unity, every algebraic conjugate of eiθ+e−iθ would be a sum of two roots of unity and have absolute value at most 2. The conjugate ϕ2>2 contradicts this, so θ/(2π) is irrational.

3.1F2F5step 1.1step 2.1constructalgebra

In the eigenbases of step 1.1, put γ(t)=(diag⁡(1,eitI2,e−itI2),diag⁡(I2,eitI3,e−itI3)). The simultaneous braid word is (C5,C8)=γ(θ), so its integer powers are γ(kθ). By step 2.1 and [F5], their closure is the whole circle γ(R), which therefore lies in G. Differentiating at zero shows that (X5,X8):=(C5−C5−1,C8−C8−1)=2sin⁡θ γ′(0) belongs to g; both coordinates are nonzero.

4.1A2F1F2F3step 1.2step 3.1algebra

By [A2], each generator has determinant pair (r3,r5), and r10=1, so the determinant image of G is finite. A connected coordinate neighborhood of the identity lies in G0, making G0 open in G and g=Lie⁡(G0). Connectedness forces its determinant pair to be (1,1); hence g⊆su(5)⊕su(8). For n=5,8, let Wn be the coordinate projection of g. Conjugation by simultaneous braids preserves g, so Wn is invariant under conjugation by their n-dimensional images. As a finite-dimensional vector subspace, Wn is closed; continuity and [F1] extend this invariance to SU(n). For A∈su(n) and Y∈Wn, differentiate h(t)Yh(t)−1∈Wn along a smooth curve in SU(n) with h(0)=I and h′(0)=A. This gives [A,Y]∈Wn, so Wn is an ideal. It is nonzero by step 3.1, and simplicity from step 1.2 gives Wn=su(n). Thus both projections are surjective.

5.1F2F3step 4.1step 1.2algebra

Define the kernel ideals K5={x∈su(5):(x,0)∈g} and K8={y∈su(8):(0,y)∈g}. They are ideals because g projects onto both factors and is closed under brackets. Simplicity says each kernel is either zero or the whole factor. If either is the whole factor, surjectivity of the other projection implies g=su(5)⊕su(8). If both are zero, each projection restricts to an isomorphism from g to its factor, yielding an isomorphism su(5)≅su(8), contrary to their different dimensions. Thus g=su(5)⊕su(8).

6.1A1F2F3F4F7step 5.1algebra∎

By [F2], the inclusion G0↪SU(5)×SU(8) has injective differential. Step 5.1 and [F3] show that its Lie algebra has the full dimension of SU(5)×SU(8), so the differential is an isomorphism. By [F7], the inclusion is a local diffeomorphism; its image therefore contains an open neighborhood of the identity and is an open subgroup. The product is connected by [F4], hence G0=SU(5)×SU(8). Therefore the joint closure contains SU(5)×SU(8). The only choice assumption is [A1].

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Fibonacci single-qubit projective density

Statement

Assume ACω. Let B1,B2 be the projective Fibonacci generators on the two-dimensional three-τ, total-τ fusion space from Three-Fibonacci-anyon qubit matrices. The subgroup they generate is dense in PU(2).

Facts & Assumptions

Given: u=ϕ−1, v=ϕ−1/2, r=e−3πi/5, F=(uvv−u), B1=diag⁡(1,r), and B2=FB1F.

[F1]

The matrix formulas, unitarity, Artin relation, and noncommutation are verified directly in Three-Fibonacci-anyon qubit matrices.

[F5]

A complex normal endomorphism of a finite-dimensional inner-product space has an orthonormal eigenbasis. Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely

[F2]

If α/(2π) is irrational, the powers of the circle rotation eiα are dense in the unit circle. Powers of an Irrational Rotation Are Dense on the Circle

[F3]

A closed subgroup of a finite-dimensional real Lie group is an embedded Lie subgroup under ACω; its tangent space is bracket closed. Cartan closed subgroup theorem The Lie algebra of a Lie subgroup is a Lie subalgebra

[F4]

The quotient map q:SU(2)→PU(2) is a two-sheeted covering, and PU(2) is topologically isomorphic as a group to SO(3). The projective one-qubit group is SO(3)

[F6]

Quaternionic conjugation ρ:SU(2)→SO(3) is a smooth local diffeomorphism, as shown by its explicit coordinate formula and differential. SU(2) to SO(3) as a covering homomorphism

[F7]

A smooth map between manifolds whose differential is an isomorphism at a point is a diffeomorphism between neighborhoods of that point. The smooth inverse function theorem on manifolds

[A1]

Assume ACω, exactly the hypothesis of [F3] and [F4]. The Axiom of Countable Choice (ACω)

Proof

1.1F1F5algebra

Put C=B1B2−1. Using F2=I, v2=u, and r+r−1=−u, direct multiplication gives det⁡C=1 and tr⁡C=r+r−1+(2−r−r−1)u2=u2; the last equality uses u2+u=1, since (2+u)u2=1. Thus the eigenvalues of the unitary C are eiθ and e−iθ, with 2cos⁡θ=u2=ϕ−2.

2.1givenstep 1.1algebra

The number ϕ−2 has minimal polynomial x2−3x+1, whose other root is ϕ2>2. If eiθ were a root of unity, then eiθ+e−iθ would have all algebraic conjugates of absolute value at most 2, since every such conjugate is a sum of two roots of unity. The conjugate ϕ2>2 contradicts this. Hence θ/(2π) is irrational.

3.1A1F2F3F4F6step 2.1construct

Let ρˉ:PU(2)→SO(3) be the topological group isomorphism supplied by [F4], and transport the standard smooth Lie-group structure of SO(3) to PU(2) along ρˉ. This transported structure has exactly the quotient-metric topology. The covering map ρ:SU(2)→SO(3) from [F6] satisfies ρ=ρˉ∘q and is a smooth local diffeomorphism; hence q=ρˉ−1∘ρ is a smooth local diffeomorphism too, so dqI is an isomorphism on tangent spaces. Since θ/π is irrational by step 2.1, [F2] shows that the projective powers of C are dense in the smooth circle T={[diag⁡(eit,e−it)]:t∈R}⊂PU(2) after choosing an eigenbasis; under ρˉ this is the ordinary rotation circle about an axis. Thus T⊆H, the closure of the projective braid image, and H is closed in the transported Lie group. By [A1] and [F3], H is an embedded Lie subgroup. In the eigenbasis, C−C−1=diag⁡(2isin⁡θ,−2isin⁡θ) is a nonzero tangent vector to the corresponding circle in SU(2), so dqI(C−C−1) is a nonzero tangent to T and lies in Lie⁡(H).

4.1A1F1F3F4step 3.1algebra

Write X=dq(C−C−1)∈Lie⁡(H). Conjugation by [B1] sends T to a circle with tangent Ad⁡[B1]X. If these circles had the same axis, the rotation in SO(3) induced by [B1] would either preserve or reverse that axis. A reversing rotation is a half-turn, but this projective generator has angle 3π/5≠π. If it preserved the oriented axis, it would commute projectively with C. Choose a determinant-one lift of [B1] to SU(2), using [F4]. Its conjugate of C would then be either C or −C, because the kernel of q is {±I}. The second case contradicts invariance of trace and tr⁡C=ϕ−2≠0, so B1 would commute with C, and hence with B2, contrary to [F1]. Therefore the two axes are nonparallel. The real Lie algebra so(3) is the three-dimensional space of skew-symmetric 3×3 matrices. Under its standard identification with R3, the Lie bracket is the cross product up to a nonzero scalar; the bracket of two nonparallel axes is nonzero and independent of both. Thus Lie⁡(H)=so(3) by [F3].

5.1A1F3F4F7step 4.1algebra∎

A connected coordinate neighborhood of the identity in the embedded Lie group H lies in H0; translating it shows that H0 is open in H, so Lie⁡(H0)=Lie⁡(H). By step 4.1, the inclusion H0↪SO(3) has an isomorphism as its differential at the identity. The inverse-function theorem [F7] makes this inclusion a local diffeomorphism, so H0 contains an open neighborhood of the identity and is an open subgroup of SO(3). Since SO(3) is connected, H0=SO(3) and H=SO(3). By [F4], the projective braid image is dense in PU(2). The only choice assumption is [A1], and the conclusion is projective; no efficient braid-length bound follows.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Dense projective SU(2) image has dense determinant-one lifts

Statement

Assume ACω. Let q:SU(2)→PU(2) be the quotient by {±I}, and let Γ≤PU(2) be dense. Then the full inverse image q−1(Γ) is dense in SU(2). Thus projective density gives determinant-one lifts arbitrarily close to any SU(2) target, while the choice of a lift can differ by the central sign.

Facts & Assumptions

Given: The two-sheeted covering homomorphism q:SU(2)→PU(2) and a dense subgroup Γ≤PU(2).

[F1]

q:SU(2)→PU(2) is a two-sheeted covering with kernel {±I}. The projective one-qubit group is SO(3)

[F2]

By the given density hypothesis, Γ meets every nonempty open subset of PU(2).

[A1]

ACω is the axiom assumed by the covering supplier. The Axiom of Countable Choice (ACω)

Proof

1.1givenF1choose

Let O be any nonempty open subset of SU(2) and choose u∈O. By [F1], there is an evenly covered neighborhood N0 of q(u) and a sheet S0 containing u such that q∣S0:S0→N0 is a homeomorphism. Set S=S0∩O and N=q(S). Since S is open in S0, N is open in N0; the restriction q∣S:S→N remains a homeomorphism.

2.1A1F1F2step 1.1choose∎

The open set N meets Γ by [F2]; choose g∈N∩Γ. Its unique lift v∈S lies in O and satisfies q(v)=g, hence v∈q−1(Γ). Thus every nonempty open O meets q−1(Γ), which is exactly density in SU(2). The only stated axiom is [A1].

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Fibonacci B6 approximates one logical two-qubit gate in both charge blocks

Statement

Assume ACω. Let U∈U(C4) and δ>0. There is one normalized six-strand Fibonacci braid word b such that its actions B1(b) and Bτ(b) on the total-charge-1 and total-charge-τ blocks are simultaneously within δ of T1=U⊕(det⁡U)−1∈SU(5),Tτ=U⊕diag⁡((det⁡U)−1,1,1,1)∈SU(8). For the triple-triple computational subspace in either block, the logical block error and leakage amplitude are each at most δ. The corresponding physical categorical braid differs from the normalized word by the common scalar phase specified by The braid phase is a common scalar character.

Facts & Assumptions

Given: The four-dimensional code Ca in each six-anyon block, the same ordered path basis in both blocks, U∈U(4), δ>0, and ACω.

[F1]

The normalized simultaneous braid closure contains SU(5)×SU(8) under ACω. Joint SU(5)×SU(8) closure from B6 path blocks

[F2]

The two code blocks have dimensions 4, and their leakage complements have dimensions 1 and 4. Six-anyon triple-encoded subspace and leakage complement

[F3]

If a unitary is within δ of a code-preserving block target, its logical block error and leakage are at most δ. Block-target approximation bounds logical error and leakage

[F4]

The original categorical word has one common scalar phase across both charge blocks. The braid phase is a common scalar character

[A1]

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

Proof

1.1givenF2algebra

Put λ=(det⁡U)−1. Since ∣det⁡U∣=1, ∣λ∣=1. Therefore det⁡(T1)=det⁡(U)λ=1 and det⁡(Tτ)=det⁡(U)λ=1; both targets are unitary by their orthogonal direct-sum definitions. Hence T1∈SU(5) and Tτ∈SU(8).

2.1A1F1step 1.1choose

The open product of operator-norm δ-balls around (T1,Tτ) meets the normalized braid image because its closure contains SU(5)×SU(8) by [A1] and [F1]. Thus one word b satisfies both block bounds at once. This is simultaneous density; separate choices of words in the two blocks are not used.

3.1F2F3step 2.1algebra

In each block, Ta acts as U on the four-dimensional code and as a unitary on its orthogonal complement. Apply [F3] to B1(b) and T1, then to Bτ(b) and Tτ. The logical block error and leakage amplitude are at most δ in both blocks.

4.1F2F4step 3.1∎

By [F4], the physical categorical braid is the same scalar multiple of both normalized blocks; multiplying by a unit scalar leaves leakage unchanged and is recorded as a projective phase for uncontrolled computation. It must be tracked under coherent control.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

Six-anyon braid target extends uniformly to fusion spectators

Statement

Assume ACω, n≥2, and a total-charge label c∈{1,τ} with V(τn→c)≠0. The code in 3n τ anyons factors as Cn≅(C2)⊗n⊗V(τn→c). For any adjacent pair of encoded triples, any U∈U(4), and any δ>0, one normalized six-strand braid induces an ambient operator within δ of the code-preserving ideal extension of U on the entire fixed-charge space V(τ3n→c). Consequently, on code inputs, its logical block error and leakage amplitude are each at most δ, uniformly over all spectator fusion paths. The full-space approximation bound also holds on arbitrary ambient inputs, including states that already have a component outside the code.

Facts & Assumptions

Given: The triple code, the full fusion space, an adjacent pair of triples, U∈U(4), δ>0, and ACω.

[F1]

The normalized six-strand image has closure containing SU(5)×SU(8), and for each U∈U(4) there are determinant-one extensions T1=U⊕(det⁡U)−1 and Tτ=U⊕diag⁡((det⁡U)−1,1,1,1). Joint SU(5)×SU(8) closure from B6 path blocks Six-anyon triple-encoded subspace and leakage complement

[F2]

A full-space norm bound by δ bounds logical block error and leakage by δ. Block-target approximation bounds logical error and leakage

[F3]

A local braid on a tensor factor acts as its braid operator tensored with the identity on spectator factors; unitary fusion-tree reassociation changes basis by a unitary. The physical braid phase is common to all charge and spectator blocks; write ρ~ for the normalized action obtained by removing it, which preserves the same local tensor-factor action. Gauge covariance of fusion-space braid actions The braid phase is a common scalar character

[F4]

Every finite-dimensional spectator multiplicity space has an orthonormal basis. Every finite-dimensional real or complex inner product space has an orthonormal basis

[A1]

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

Proof

1.1givenF1F3construct

Each triple has fusion factor V(τ3→τ)≅C2. Associating the n triple charges first gives the code factorization (C2)⊗n⊗V(τn→c); the second factor records all spectator fusion paths. This is an orthogonal fusion-tree decomposition by [F1, F3].

1.2givenF3algebra

Let the chosen adjacent pair of triples occupy strands 3j−2,…,3j+3, and put p=3(j−1) and q=3(n−j−1). Reassociate the ordered input only, retaining the prefix of p strands, the selected six-strand block, and the suffix of q strands in that order; no permutation of strands is used. The fusion-tree basis gives the orthogonal decomposition V(τ3n→c)≅⨁α,a,e,dV(τp→α)⊗V(τ6→a)⊗Vαae⊗V(τq→d)⊗Vedc, where the sums run over simple charges and zero-dimensional summands are omitted (with τ0=1). Every factor other than V(τ6→a) records a prefix, suffix, or fusion-multiplicity spectator. By [F3], a normalized braid word β supported on the selected six consecutive strands acts on each summand as the identity on all other factors and ρ~a(β) on V(τ6→a).

2.1A1F1step 1.1step 1.2choose

For each local total charge a, let Ta be the target extension in [F1]. On the decomposition in step 1.2 define W on each summand by the identity on every factor other than V(τ6→a) and by Ta on that block. This is a unitary direct sum; it preserves the triple code and acts there as U on the selected adjacent pair and identity on all other logical and spectator factors. Joint density [F1] gives one normalized six-strand braid word β with ∥ρ~a(β)−Ta∥op≤δ for both a=1,τ.

3.1F1F3F4step 2.1algebra

In a summand of step 1.2, group the factors before V(τ6→a) as SL and those after it as SR. Choose orthonormal bases (ek) and (fℓ) of SL,SR by [F4] and write ξ=∑k,ℓek⊗ξkℓ⊗fℓ. Then ∥(I⊗A⊗I)ξ∥2=∑k,ℓ∥Aξkℓ∥2≤∥A∥op2∑k,ℓ∥ξkℓ∥2, with equality on a maximizing vector in the middle factor tensored with basis vectors; hence the operator norm on each tensor summand equals ∥A∥op. For an orthogonal direct sum of blocks, squared norms add, so its operator norm is the maximum block norm (equality follows by testing a maximizing vector in a maximizing block). The decomposition in step 1.2 and the bounds in step 2.1 therefore give ∥ρ~(β)−W∥op≤δ on the whole ambient space.

4.1F1F2step 3.1∎

Apply [F2] to ρ~(β) and W. Their compression to the code differs from the target by at most δ, and (I−P)WP=0, so the leakage amplitude is also at most δ. The norm estimate is on the whole ambient space, so it remains valid for inputs with prior leakage. The physical categorical word has the common phase of The braid phase is a common scalar character, which is harmless only after phase matching or when reported projectively.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

Arbitrary-size triple-encoded braid universality

Statement

Assume ACω. For every n≥1, every total-charge label c∈{1,τ} with V(τn→c)≠0, every unitary U on n logical qubits, and every ϵ>0, the triple-τ code (C2)⊗n⊗V(τn→c) admits a finite normalized braid word Vb such that inf⁡∣z∣=1∥PcodeVbPcode−zJ(U⊗IS)J∗∥op≤ϵ,∥(I−Pcode)VbPcode∥op≤ϵ. Here S=V(τn→c) is the spectator space, J:(C2)⊗n⊗S→V(τ3n→c) is the isometric triple-code inclusion, and the logical target is lifted as U⊗IS. The bounds are uniform over spectator fusion states. No efficient braid word-length, search-time, or finite-precision bound is asserted.

Facts & Assumptions

Given: The finite logical target, the triple code and spectator space, ϵ>0, and ACω.

[F1]

The Fibonacci braid image on the three-τ, total-τ space is projectively dense in PU(2). Fibonacci single-qubit projective density

[F2]

Any adjacent two-logical-qubit target has a spectator-safe extension with logical error and leakage at most the requested tolerance. Six-anyon braid target extends uniformly to fusion spectators

[F3]

Every finite-dimensional unitary has a finite exact QSD decomposition into one-qubit gates and CNOTs; the theorem makes only its stated gate-count claim. Exact QSD CNOT Upper Bound

[F4]

Per-gate full-space errors add, and code-preserving ideal targets give the same total bounds on logical block error and leakage. Logical error and leakage add under code-preserving gate approximation

[F5]

Braid words carry a common scalar phase; it must be tracked under coherent control. The braid phase is a common scalar character

[F6]

The Fibonacci data and fusion-tree count give dim⁡V(τ3→1)=1 and dim⁡V(τ3→τ)=2. In an ordered fusion-tree decomposition, a braid supported on a contiguous local block acts on that block's fixed-charge factor and as the identity on the prefix, suffix, and their fusion multiplicities; its fixed-charge action is unitary. Dividing the physical action by its common R1 phase retains these properties; write ρ~ for the resulting normalized action. Unitary Artin braid representation on fixed-charge fusion spaces Gauge covariance of fusion-space braid actions Fusion-tree basis and dimension recursion Fibonacci fusion data and chiral convention The braid phase is a common scalar character

[F7]

Every finite-dimensional spectator fusion space has an orthonormal basis. Every finite-dimensional real or complex inner product space has an orthonormal basis

[A1]

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

Proof

1.1givenF2construct

Reassociation of the fusion trees gives the code factor (C2)⊗n⊗V(τn→c), with the second factor retaining every spectator fusion path. The code inclusion is J on this full logical-and-spectator tensor product, and the target on it is U⊗IS. For n=1, only c=τ occurs and the single triple supplies the one-qubit code.

1.2F3algebra

By [F3], U has a finite exact decomposition into one-qubit gates and CNOT gates. Replace each nonadjacent two-qubit gate by the exact standard sequence of adjacent SWAP targets, the gate on neighboring wires, and the inverse SWAP targets. These are abstract U(4) targets, not assumed to be exact leakage-free braids. The result is a finite list of G one-qubit or adjacent two-qubit targets whose product is U.

2.1A1F1F6F7step 1.1algebra

If G=0, then U=I and the empty braid proves the statement. Otherwise put δj=ϵ/G for 1≤j≤G. For a one-qubit target Uj at logical position j, let p=3(j−1) and q=3(n−j). Reassociate the ordered 3n strands into prefix, this triple, and suffix, without changing their order. The fusion-tree basis gives the orthogonal decomposition V(τ3n→c)≅⨁α,a,e,dV(τp→α)⊗V(τ3→a)⊗Vαae⊗V(τq→d)⊗Vedc, with zero-dimensional summands omitted and τ0=1. By [F6], a braid word βj on this triple acts on each summand by the normalized block ρ~a(βj) on V(τ3→a) and identity on all other factors. The code lies in the local total-τ summands, where V(τ3→τ)≅C2 is the logical qubit; total-1 summands lie in the orthogonal complement. Projective density [F1] supplies βj and zj∈U(1) with ∥ρ~τ(βj)−zjUj∥op≤δj. Define a code-preserving ideal unitary on each local total-τ summand as zjUj tensored with identity on the ordered prefix, suffix, and fusion multiplicities; on each local total-1 summand define it to equal the normalized ρ~1(βj). It is unitary, and its difference from the normalized braid is at most δj on every summand (at most δj on total τ and zero on total 1). In a fixed fusion summand, group the factors before the local triple as SL and those after it as SR. Expanding ξ=∑k,ℓek⊗ξkℓ⊗fℓ in orthonormal bases of SL,SR supplied by [F7] gives ∥(I⊗A⊗I)ξ∥2=∑k,ℓ∥Aξkℓ∥2≤∥A∥op2∑k,ℓ∥ξkℓ∥2 for each local block error A. Thus tensoring with the spectator identities does not increase the block error. For the orthogonal direct sum, squared norms add, so its norm is at most the maximum block norm (attained by a maximizing vector in a maximizing block); hence the full ambient error is at most δj.

3.1A1F2step 2.1algebra

For each adjacent two-qubit target, [F2] supplies a six-strand braid and a code-preserving ideal extension with full-space error at most δj, including all spectator fusion sectors. The ideal one- and two-qubit extensions therefore give a finite code-preserving target sequence whose action on the code is (∏jzj)U.

4.1F1F2F4F5step 3.1algebra∎

Apply [F4] to the G physical/ideal pairs. Their product differs in operator norm by at most ∑jδj=ϵ. Compression to the code gives the logical block bound, while projection to its orthogonal complement gives leakage at most ϵ. The product scalar ∏jzj, together with the common braid phases in [F5], is the single phase removed by the projective infimum; it is not free under coherent control. The proof gives existence only, because [F1] and [F2] supply no useful joint B6 word-length bound.

5 · Examples, counterexamples and false statements

None yet.

Sources