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 , , and a total-charge label with . The code in anyons factors as . For any adjacent pair of encoded triples, any , and any , one normalized six-strand braid induces an ambient operator within of the code-preserving ideal extension of on the entire fixed-charge space . 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, , , and .
The normalized six-strand image has closure containing , and for each there are determinant-one extensions and . Joint SU(5)×SU(8) closure from B6 path blocks Six-anyon triple-encoded subspace and leakage complement
A full-space norm bound by bounds logical block error and leakage by . Block-target approximation bounds logical error and leakage
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
Every finite-dimensional spectator multiplicity space has an orthonormal basis. Every finite-dimensional real or complex inner product space has an orthonormal basis
is countable choice. The Axiom of Countable Choice ()
Proof
Each triple has fusion factor . Associating the triple charges first gives the code factorization ; the second factor records all spectator fusion paths. This is an orthogonal fusion-tree decomposition by [F1, F3].
Let the chosen adjacent pair of triples occupy strands , and put and . Reassociate the ordered input only, retaining the prefix of strands, the selected six-strand block, and the suffix of strands in that order; no permutation of strands is used. The fusion-tree basis gives the orthogonal decomposition where the sums run over simple charges and zero-dimensional summands are omitted (with ). Every factor other than 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 on .
For each local total charge , let be the target extension in [F1]. On the decomposition in step 1.2 define on each summand by the identity on every factor other than and by on that block. This is a unitary direct sum; it preserves the triple code and acts there as 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 for both .
In a summand of step 1.2, group the factors before as and those after it as . Choose orthonormal bases and of by [F4] and write . Then , with equality on a maximizing vector in the middle factor tensored with basis vectors; hence the operator norm on each tensor summand equals . 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 on the whole ambient space.
Apply [F2] to and . Their compression to the code differs from the target by at most , and , 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
- Joint SU(5)×SU(8) closure from B6 path blocks
- Six-anyon triple-encoded subspace and leakage complement
- Block-target approximation bounds logical error and leakage
- Gauge covariance of fusion-space braid actions
- The braid phase is a common scalar character
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
- Every finite-dimensional real or complex inner product space has an orthonormal basis
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
- Michael H. Freedman, Michael J. Larsen, and Zhenghan Wang, A Modular Functor Which Is Universal for Quantum Computation (standard reference, not scraped)
- Chetan Nayak, Steven H. Simon, Ady Stern, Michael Freedman, and Sankar Das Sarma, Non-Abelian Anyons and Topological Quantum Computation (standard reference, not scraped)