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.
The algebraic Verlinde formula
Statement
Let be modular with as in Modular ribbon fusion category and Hopf-link data. For simple labels ,
For simultaneous diagonalization, define the fusion matrix with rows indexed by the second input , columns indexed by the output , and entries . Then
This is the algebraic formula; no complex conjugation is used.
Facts & Assumptions
Given: A complex modular ribbon fusion category, its Hopf-link matrix , chosen square root , normalized matrix , and fusion coefficients .
The Hopf-link character identity is , with a unital character (Balancing and the Hopf-link character identity).
The matrix identity is , where , and therefore (The modular Hopf-link matrix squares to D² times duality).
is symmetric, , and is invertible (Modular ribbon fusion category and Hopf-link data, Balancing and the Hopf-link character identity, The modular Hopf-link matrix squares to D² times duality).
Proof
Given: The data in the Statement.
Divide the character identity in [F1] by to get . Multiply by and sum over . By [F2], the right side is . Thus .
Since and , dividing step 1.1 by rewrites it as , using symmetry of to exchange with .
For the stated matrix convention, . The character equation in [F1] gives . Hence . Since is invertible, it simultaneously diagonalizes these explicitly indexed fusion matrices.
Depends on
Used by
Dependency tree · two levels
16 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
- Etingof, Gelaki, Nikshych, and Ostrik, Tensor Categories, Corollaries 8.14.4–8.14.5 (standard reference, not scraped)
- Bakalov and Kirillov, Lectures on Tensor Categories and Modular Functor, §3.1 (standard reference, not scraped)