Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

F-symbol as a recoupling matrix

Definition

Let a,b,c,d be simple charges in a unitary fusion category, and put PL=((a⊗b)⊗c) and PR=a⊗(b⊗c). The local fusion-tree basis result Fusion-tree basis and dimension recursion identifies

HL:=⨁eVabe⊗VecdwithHom⁡(PL,d),

and

HR:=⨁fVbcf⊗VafdwithHom⁡(PR,d),

by the corresponding tree compositions. These direct sums carry the orthonormal left- and right-tree bases. If μ:a⊗b→e and ν:e⊗c→d are vertex basis maps, write Le,μ,ν:=ν∘(μ⊗id⁡c):PL→d. If ρ:b⊗c→f and σ:a⊗f→d are vertex basis maps, write Rf,ρ,σ:=σ∘(id⁡a⊗ρ):PR→d. Let αa,b,c:PL→PR be the associator. Define the F-symbol matrix Fdabc by

Le,μ,ν∘αa,b,c−1=∑f,ρ,σFdabc[(f,ρ,σ),(e,μ,ν)]Rf,ρ,σ.

Rows index target-tree labels and multiplicity indices; columns index source-tree labels and multiplicity indices. The sums retain every fusion channel and every multiplicity coordinate. If the fixed-total fusion space is zero-dimensional, the F-symbol is the unique empty 0×0 matrix.

Associator convention

The object-level associator is drawn below. The F matrix records its induced change of coordinates on the Hom spaces by the inverse-precomposition rule in the Definition; the diagram is only a convention aid.

((a¬b)¬c)a¬(b¬c)®a;b;c

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