Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Fixed-boundary anyonic fusion-path space

Definition

Let C be a fusion category over C, so it is finite semisimple, rigid, monoidal, and has simple unit Fusion and multifusion categories. Let a,b,c be simple objects and let n≥0. Fix one representative of each simple isomorphism class for the internal path labels; the external objects a,b,c need not equal their representatives. Set T0=b and recursively fix the left-associated parenthesization Tj+1:=Tj⊗a. The fixed-boundary anyonic path space is

Ha,n;b,c:=Hom⁡C(c,Tn).

For simple labels x,y, define the split multiplicity space Wx,ay:=Hom⁡C(y,x⊗a). For n≥1, a fusion path is a sequence of simple labels x0=b,x1,…,xn=c, with x1,…,xn−1 drawn from the fixed representative set, together with, for every 1≤j≤n, one basis index μj in a chosen basis Bxj−1,axj of Wxj−1,axj. The basis index is retained even when distinct indices have the same adjacent labels. Fusion rules are the nonnegative integers Nxay in [x][a]=∑yNxay[y] Fusion rules.

For n=0, there is no path if b≇c. If b≅c, fix an isomorphism uc,b:c→b and take it as the single empty-path vector (use ub,b=id⁡b when the objects coincide). In the unitary setting choose this isomorphism unitary.

For n≥1, if ij∈Bxj−1,axj is the selected inclusion xj→xj−1⊗a, define the path composite by γ0:=id⁡b and γj:=(γj−1⊗id⁡a)∘ij:xj→Tj. For xn=c, γn is a vector in Ha,n;b,c. The next lemma proves these composites form a basis and computes the dimension. No Hilbert-space or physical Hamiltonian structure is part of this definition.

Split-tree convention

For three sites the diagram records the split direction c→b⊗a⊗a⊗a and the recursively parenthesized tree. Each vertex also carries its basis index μj; the picture omits no mathematical datum used in the definition.

c=x3x2x1b=x0a¹1a¹2a¹3

Each internal label xj is simple, and each μj ranges over a basis of the displayed split Hom space. A periodic closed chain is obtained by summing the fixed-boundary spaces over representative boundary labels b=c; its path labels satisfy the cyclic boundary condition.

Depends on

Used by

Dependency tree · two levels

11 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