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.
A pointed metric-group category is modular exactly when its radical is trivial
Statement
Let be pointed ribbon data as in Pointed ribbon categories from abelian 3-cocycles, and let . The associated pointed ribbon fusion category is modular if and only if
Facts & Assumptions
Given: Finite abelian pointed ribbon data and the modularity convention of Modular ribbon fusion category and Hopf-link data.
The simple objects are the grades , all have dimension , and their double braiding is the scalar (Pointed ribbon categories from abelian 3-cocycles).
The cocycle data and the two hexagon equations are those in Pointed ribbon categories from abelian 3-cocycles.
Proof
Given: The data in the Statement.
The two hexagon equations in [F2] give after multiplying the formula for by that for and cancelling the three factors. Since by definition, it is multiplicative in the second variable as well. For nonzero, the rows indexed by and in [F1] coincide, since for every . Thus is singular.
Because is finite and is a bicharacter, every is a root of unity, so . If , the characters are pairwise distinct. For , is nontrivial; choose with , and translating the finite sum gives , hence . Thus distinct rows of are orthogonal and each row has squared norm , so . Therefore is invertible and the category is modular.
Depends on
Used by
Dependency tree · two levels
10 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, Example 8.13.5 (standard reference, not scraped)
- Bakalov and Kirillov, Lectures on Tensor Categories and Modular Functor, §3.1 (standard reference, not scraped)