Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

The vacuum F-coefficient records the Frobenius–Schur sign

Statement

Let a and (v,ev⁡,coev⁡,da,κa) be as in Frobenius–Schur sign in a normalized anyonic vacuum channel. In the multiplicity-free vacuum-normalized gauge of F-symbol as a recoupling matrix,

(Faaaa)1,1=κada,δa:=1((Faaaa)−1)1,1=κada.

Facts & Assumptions

Given: A unitary spherical fusion category, a self-dual simple a, the normalized duality datum, and the F-symbol convention.

[F1]

Frobenius–Schur sign in a normalized anyonic vacuum channel: v†v=id⁡1, coev⁡=dav, and ev⁡=κadav†, with κa=±1.

[F2]

F-symbol as a recoupling matrix: in orthonormal tree bases, the coefficient Ff,e is defined by Le∘α−1=∑fFf,eRf; rows index the right-tree channel and columns the left-tree channel.

[F3]

Unitary fusion category and F-symbol unitarity: the chosen trivalent basis maps are orthonormal and the associator F-matrix is unitary.

[F4]

Absolutely simple objects: every simple object has endomorphism space Cid⁡, so the overlap and zig-zag scalars are well-defined.

[F5]

Fusion and multifusion categories: C is finite semisimple with simple tensor unit; a is simple by the hypotheses.

Proof

Given: The normalized cap/cup maps, the chosen vacuum-channel bases, and the typed associator between ((a⊗a)⊗a) and a⊗(a⊗a).

1.1F1F3given

Let L1 be the left-tree basis map obtained by applying v† to the first pair and then the unit unitor, and let R1 be the right-tree basis map obtained by applying v† to the last pair and then the other unit unitor. Both have norm one because v†v=id⁡1 and the unit constraints are unitary.

2.1F2F3F4F5step 1.1algebra

By the F-symbol definition, L1∘α−1=∑f(Faaaa)f,1Rf. Composing on the right with R1† kills every f≠1 by orthogonality, so (L1∘α−1)R1†=(Faaaa)1,1id⁡a. In the chosen basis maps this left side is (v†⊗id⁡a)α−1(id⁡a⊗v), with unitors inserted at the two ends.

3.1F1F2F4F5step 2.1algebra

The first duality zig-zag is (ev⁡⊗id⁡a)α−1(id⁡a⊗coev⁡)=id⁡a. Substituting [F1] gives κada(v†⊗id⁡a)α−1(id⁡a⊗v)=id⁡a. Step 2.1 therefore yields (Faaaa)1,1=1/(κada)=κa/da, since κa2=1.

4.1F3step 3.1algebra∎

The entry in step 3.1 is real. Unitarity [F3] gives ((Faaaa)−1)1,1=(Faaaa)1,1‾=κa/da. Its reciprocal is δa=κada, proving the normalization with the actual FS sign.

Depends on

Used by

Dependency tree · two levels

20 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