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

Truncated sl2 fusion data give the sine Hopf-link matrix

Statement

Let ℓ≥3, t=π/ℓ, and suppose a spherical ribbon fusion category has simple labels a=0,…,ℓ−2 with

Nabc=1for c=∣a−b∣,∣a−b∣+2,…,min⁡(a+b,2ℓ−4−a−b),

and all other Nabc=0, with da=sin⁡((a+1)t)/sin⁡t and θa=eit a(a+2)/2. Then

sab=sin⁡((a+1)(b+1)t)sin⁡t,D2=ℓ2sin⁡2t,Sab=2ℓsin⁡((a+1)(b+1)t).

The sine matrix is invertible and S2=I. This is a conditional calculation from the displayed category data; it does not assert that a particular tilting quotient has those data.

Facts & Assumptions

Given: A spherical ribbon fusion category with the labels, fusion multiplicities, dimensions, and twists in the Statement.

[A1]

The complete truncated fusion rule, dimension function, and twist convention displayed in the Statement are hypotheses of this conditional lemma, not an excerpt from an unavailable supplier.

[F1]

The balancing equation and the fact that ha(b)=sab/da is a fusion-ring character are proved in Balancing and the Hopf-link character identity.

[F2]

The finite sine-transform orthogonality identity is proved in Finite sine-transform orthogonality at level ell.

Proof

Given: The hypotheses in [A1].

1.1A1F1algebra

For each fixed a, put ha(b)=sab/da. By [F1], ha(0)=1 and the truncated products b⊗1=(b−1)⊕(b+1) for 1≤b≤ℓ−3 give ha(b+1)=ha(1)ha(b)−ha(b−1). The endpoint product (ℓ−2)⊗1=ℓ−3 gives the corresponding terminal recurrence.

2.1A1F1step 1.1algebra

For 1≤a≤ℓ−3, balancing gives sa1=θa−1θ1−1(θa−1da−1+θa+1da+1)=q−(a+2)da−1+qada+1, where q=eit. Substituting the sine dimensions and using e−i(a+2)tsin⁡(at)+eiatsin⁡((a+2)t)=sin⁡(2(a+1)t) yields ha(1)=2cos⁡((a+1)t). For a=0, the single summand in 0⊗1 gives h0(1)=d1=2cos⁡t. For a=ℓ−2, the single summand ℓ−3 gives sa1=q−ℓdℓ−3=−2cos⁡t=2cos⁡((ℓ−1)t)dℓ−2, so the same formula holds at the upper endpoint.

3.1A1step 1.1step 2.1algebra

The sequence gb=sin⁡((a+1)(b+1)t)/sin⁡((a+1)t) has g0=1, g1=2cos⁡((a+1)t) and satisfies gb+1=2cos⁡((a+1)t)gb−gb−1 by the sine addition identity. Steps 1.1 and 2.1 therefore give ha(b)=gb for all 0≤b≤ℓ−2 by induction. Multiplying by da yields the displayed formula for sab.

4.1A1F2step 3.1algebra∎

By [F2] with its two sine indices equal to 1, ∑a=0ℓ−2da2=ℓ/(2sin⁡2t); choose the positive square root D=ℓ/2/sin⁡t, which is permitted because 0<t<π and each da>0. Dividing s by D gives the displayed S. Applying [F2] to rows of S proves S2=I; hence S and s are invertible.

Depends on

Used by

Dependency tree · two levels

15 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