Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

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.

Depends on

Used by

Dependency tree · two levels

45 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