Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Finite fusion transfer count model

Definition

A finite fusion transfer count model consists of a finite nonempty label set I, a distinguished label 0∈I, and an explicitly supplied matrix N=(Nab)a,b∈I whose entries lie in {0,1,2,…}. The entry Nab is the multiplicity of elementary transitions from label b to label a; formally, the transition copies from b to a are the triples (b,a,j) with integer 1≤j≤Nab. A length-n path is a sequence of n+1 labels together with a chosen transition copy between each consecutive pair. View each natural-number entry as a real number under the usual inclusion N⊂R. For a finite set J and F=R or C, FJ means the functions J→F, with pointwise addition (x+y)j=xj+yj and scalar multiplication (λx)j=λxj. For real matrices A,B indexed by I, define (A+B)ab:=Aab+Bab. Their action on x∈RI is (Ax)a:=∑b∈IAabxb. Matrix multiplication is (AB)ac:=∑b∈IAabBbc; it is associative by regrouping finite sums. These definitions are compatible because ((AB)x)a=∑b,c∈IAabBbcxc=∑b∈IAab(Bx)b=(A(Bx))a, and ((A+B)C)ac=∑b(Aab+Bab)Cbc=(AC)ac+(BC)ac. Thus the natural-entry powers can also act on real vectors and the addition used below distributes over matrix multiplication. Let II be the identity matrix with entries (II)ab=1 if a=b and 0 otherwise, and use the power convention N0:=II and Nn+1:=NNn for n≥0. Define the vacuum-return count Dn:=(Nn)00. If Dn>0, set Hn:=CDn, with coordinates x=(x1,…,xDn) and inner product ⟨x,y⟩:=∑j=1Dnxjyj‾, linear in the first argument. This pairing satisfies the inner-product axioms of Real and complex inner product spaces, with the inner product linear in the first argument: finite distributivity gives ⟨αx+βz,y⟩=α⟨x,y⟩+β⟨z,y⟩, and conjugating the finite sum gives ⟨y,x⟩‾=∑jyj‾xj=⟨x,y⟩. Writing xj=aj+ibj with real aj,bj gives ⟨x,x⟩=∑j(aj2+bj2)≥0; if this sum is zero, each nonnegative summand is zero, hence every aj=bj=0 and x=0. Conversely x=0 gives zero. The conjugation identities used here follow directly from a+ib‾=a−ib and finite distributivity. Therefore Hn is a finite-dimensional complex inner-product space; its coordinate unit vectors form a basis since every x equals their linear combination with coefficients xj, and a zero combination forces every coefficient to vanish. Let IHn be its identity endomorphism and define ρn:=Dn−1IHn. If Dn=0, no normalized operator ρn is assigned. The matrix N is model data; no fusion category, quantum group, or representation is presumed to realize it.

Remarks

The definition records a finite matrix count only. It does not assert the existence of a fusion category or identify Dn with a gravitational state count.

Depends on

Dependency tree · 2 levels

Sources