Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Local anyonic channel projector

Definition

Fix a fusion-path space with repeated simple site charge a, a position i with two adjacent a-labels, and a simple output s of a⊗a, chosen from the fixed internal representative set of Fixed-boundary anyonic fusion-path space. Choose bases in the split spaces Hom⁡(z,x⊗y) at every vertex of the trees used below, retaining the fixed path vertex bases on the fixed tree. In the tree basis where this adjacent pair is fused first, let Πs be the projection onto the direct summand with pair output s, acting as the identity on every multiplicity index inside that channel and as zero on all other pair outputs. Let Ai:Tfixed→Tpair be a typed composite of associators and their inverses carrying the fixed path tree to this pair-first tree, without permuting the ordered inputs (including the boundary charge). In the split-tree bases of Hom⁡(c,T), let Fi be the matrix of h↦Ai∘h, with target coordinates as rows and source coordinates as columns. The proof below constructs these bases and proves invertibility in any complex fusion category. Define the local channel projector in the fixed path basis by

Pi,s:=Fi−1ΠsFi.

This is an idempotent for any fusion category because Fi is invertible. In a unitary fusion category with orthonormal tree bases, Fi is unitary and Pi,s is an orthogonal projection. The channel projection includes every multiplicity coordinate; the definition has no multiplicity-free restriction. The split Hom convention here is Hom⁡(c,T), as in Fixed-boundary anyonic fusion-path space. In the unitary case with adjoint vertex bases, each local left-to-right split recoupling matrix is the entrywise conjugate of the QC25 inverse-precomposition F matrix, as proved below; they agree for the displayed real Fibonacci and Ising blocks.

Facts & Assumptions

Given: The complex fusion category, simple external objects, internal representative labels, finite trees, vertex bases, and channel projection in the Definition. Unitarity is assumed only for the unitary clauses.

[F1]

Fusion and multifusion categories: every object is a finite direct sum of simple objects, and tensor product is bilinear.

[F2]

Absolutely simple objects: simple endomorphisms are scalar, and Hom spaces between distinct simple representatives vanish.

[F3]

Monoidal category: the associator is an isomorphism; tensor product is a bifunctor.

[F4]

Unitary fusion category: in the unitary case orthogonal decompositions exist, tensor product preserves dagger, and associators are unitary. The split path inner product is specified in Unitary fusion paths form an orthonormal Hilbert basis.

[F5]

F-symbol as a recoupling matrix: in the unitary fusion Hom convention the local associator matrix satisfies fj∘α−1=∑kFkjgk.

Proof

Given: The Definition's split-tree coordinate data, with no dagger or positivity assumed in steps 1.1–2.1.

1.1F1F2givenconstructalgebra

A semisimple decomposition of an object X has inclusions iz,μ:z→X and retractions pz,μ:X→z, with pz,μiz,ν=δμνid⁡z, zero cross-composites for distinct representatives, and ∑z,μiz,μpz,μ=id⁡X. By [F2], its inclusions for each z form a basis of Hom⁡(z,X). Any other basis is obtained by an invertible column change; multiplying the retractions by the inverse matrix retains both identities. Thus any specified split basis can be the inclusion basis of such a decomposition. A simple leaf itself has the one-term decomposition with identity inclusion, even when it is an external object different from its representative.

2.1F1F2F3step 1.1constructalgebra

Build up a finite binary tree from its leaves. Suppose its child objects TL,TR have decompositions with inclusion bases (ix,μ) and (jy,ν) as in step 1.1. Tensoring their decompositions gives inclusions ix,μ⊗jy,ν of x⊗y into TL⊗TR, with tensor retractions whose composites and sum satisfy the same identities by bifunctoriality. Therefore, for any simple output z, composition gives the isomorphism ⨁x,y,μ,νHom⁡(z,x⊗y)→Hom⁡(z,TL⊗TR); its inverse applies those tensor retractions. Inserting the specified vertex basis in each summand produces exactly all split-tree composites for output z, and proves they are a basis. For a nonroot subtree take z once over the internal representative set and apply step 1.1 to obtain its decomposition. At the root use the actual external output c and its specified vertex bases directly. This finite recursion proves the basis assertion for arbitrary external simple objects, without requiring arbitrary endpoint bases to be transported copies of representative bases. Every internal simple label and every multiplicity index is retained.

3.1F3step 2.1givenalgebra

Postcomposition by Ai is linear and invertible, with inverse postcomposition by Ai−1. Step 2.1 supplies bases on both sides, hence its matrix Fi is invertible. The pair-first basis is partitioned by the pair output s, retaining every coordinate within that channel, so Πs2=Πs. Consequently Pi,s2=Fi−1Πs2Fi=Pi,s, proving the general algebraic assertion without unitarity.

4.1F2F4step 1.1step 2.1step 3.1algebra

In the unitary case choose orthonormal split vertex bases. Start step 1.1 with an orthogonal decomposition; any orthonormal change of its inclusion basis is unitary and retains pz,μ=iz,μ†. Tensor compatibility and composition make the decompositions in step 2.1 orthogonal. Thus its tree inclusions are orthonormal for g†h=⟨h,g⟩id⁡c. For unitary Ai one has (Aig)†(Aih)=g†Ai†Aih=g†h. Its matrix Fi is therefore unitary. The coordinate projection Πs is self-adjoint in the orthonormal pair-first basis, so Pi,s=Fi†ΠsFi is self-adjoint as well as idempotent.

5.1F4F5step 3.1step 4.1algebra∎

To compare Hom conventions, take daggers in [F5]. Unitarity of the associator gives α∘fj†=∑kFkj‾gk†. The maps fj†,gk† are exactly the corresponding adjoint split-tree bases. Hence the split postcomposition matrix for this local move is F‾, while the QC25 fusion Hom matrix is F. This proves the claimed convention conversion and completes the well-definedness and unitary assertions, including zero-dimensional spaces with their unique empty coordinate maps.

Coordinate convention

The coordinate convention is illustrated below: vectors move from the fixed tree to the pair-first tree by Fi, the channel projection acts there, and Fi−1 returns to the fixed tree. The curved arrow denotes the defined composite, not an additional morphism.

H¯xedHpairHpairH¯xedFiPi;s¦sF¡1i

Depends on

Used by

Dependency tree · two levels

23 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