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

Unitary fusion paths form an orthonormal Hilbert basis

Statement

Let C be a unitary fusion category, and use orthonormal bases in each split space Wx,ay=Hom⁡(y,x⊗a), equivalently the adjoints of orthonormal bases of Vxay=Hom⁡(x⊗a,y). Give Ha,n;b,c=Hom⁡(c,Tn) the Hom-space inner product linear in the first variable, determined by g†f=⟨f,g⟩id⁡c. For n=0 use the unitary empty-path isomorphism specified in Fixed-boundary anyonic fusion-path space. Then the path composites of Fixed-boundary anyonic fusion-path space are an orthonormal basis of Ha,n;b,c.

Facts & Assumptions

Given: A unitary fusion category, simple labels a,b,c, fixed n≥0, and orthonormal vertex bases.

[F1]

Fixed-boundary anyonic fusion-path space: Ha,n;b,c=Hom⁡(c,Tn) and every path composite is formed from the inclusions ij:xj→xj−1⊗a by tensoring with identities and composition.

[F2]

Unitary fusion category: dagger is conjugate-linear and reverses composition; v†v is positive and is zero only for v=0; tensor product preserves daggers; finite semisimple decompositions may be chosen orthogonally; associators and unitors are unitary.

[F3]

Fusion multiplicity space and Fusion multiplicity spaces are finite-dimensional inner-product spaces: for simple output y, the pairing on Vxay=Hom⁡(x⊗a,y) is positive definite and the chosen vertex maps are orthonormal.

[F4]

Fusion paths give a basis of the fixed-boundary path space: the path composites are already a basis of Ha,n;b,c.

Proof

Given: The unitary category, the path space, and the vertex bases described above.

1.1F1F2F3givenbase

For n=0, T0=b. If b≇c, simplicity gives Hom⁡(c,b)=0 and there are no paths. If b≅c, the only empty-path vector is the chosen unitary isomorphism uc,b:c→b, and uc,b†uc,b=id⁡c shows it has norm one. Such a choice exists: for any isomorphism v:c→b, [F3] gives End⁡(c)=Cid⁡c, so v†v=λid⁡c. Positivity in [F2] gives λ≥0, and v†v=0 would imply v=0 by [F2]; hence λ>0. The rescaled map uc,b=λ−1/2v satisfies uc,b†uc,b=id⁡c. Since it is invertible, uc,b†=uc,b−1, so it is unitary. Thus the length-zero path family is orthonormal. For n=1, the path family is the given orthonormal split vertex basis Bb,ac itself, so the positive-length base case holds independently of the empty-path choice.

1.2F1F2givenih

Fix n≥1 and assume that all length-n path composites, for every simple endpoint, are orthonormal in their Hom spaces.

1.3F2F3algebra

If fμ:x⊗a→y are the chosen orthonormal vertex maps, their adjoints iμ=fμ†:y→x⊗a satisfy iμ†iν=fμfν†=δμνid⁡y by [F3]. Distinct simple outputs are orthogonal, and the orthogonal semisimple decomposition has projections iμiμ† summing to the identity.

2.1F1F2step 1.2step 1.3ihinduction

Tensoring the orthonormal length-n path inclusions by id⁡a preserves their adjoint products because (f⊗id⁡a)†=f†⊗id⁡a by [F2]. Composing with the isometric inclusions of step 1.3 therefore gives orthonormal path inclusions at length n+1. Induction from step 1.1 proves orthonormality for every finite n.

3.1F4step 1.1step 2.1inductiondischarge-induction: step 1.1∎

By induction, every path composite is orthonormal. The basis lemma [F4] says the same finite family spans Ha,n;b,c; if there are no admissible paths, that space is zero and the empty family is its basis. Thus the path composites are an orthonormal basis for each n, completing induction from step 1.1.

Depends on

Used by

Dependency tree · two levels

9 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