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 , , and suppose a spherical ribbon fusion category has simple labels with
and all other , with and . Then
The sine matrix is invertible and . 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.
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.
The balancing equation and the fact that is a fusion-ring character are proved in Balancing and the Hopf-link character identity.
The finite sine-transform orthogonality identity is proved in Finite sine-transform orthogonality at level ell.
Proof
Given: The hypotheses in [A1].
For each fixed , put . By [F1], and the truncated products for give . The endpoint product gives the corresponding terminal recurrence.
For , balancing gives , where . Substituting the sine dimensions and using yields . For , the single summand in gives . For , the single summand gives , so the same formula holds at the upper endpoint.
The sequence has , and satisfies by the sine addition identity. Steps 1.1 and 2.1 therefore give for all by induction. Multiplying by yields the displayed formula for .
By [F2] with its two sine indices equal to , ; choose the positive square root , which is permitted because and each . Dividing by gives the displayed . Applying [F2] to rows of proves ; hence and 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
- Bakalov and Kirillov, Lectures on Tensor Categories and Modular Functor, §3.3 (standard reference, not scraped)
- Stephen F. Sawin, Quantum Groups at Roots of Unity and Modularity, §3.3 (standard reference, not scraped)