Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Modular ribbon fusion category and Hopf-link data

Definition

Let C be a complex finite semisimple rigid tensor category with simple unit 1 and a finite set I of isomorphism classes of simple objects. Fix a braiding c and a ribbon twist θ. The induced pivotal map is jX=uXθX:X→X∨∨, where u is the Drinfeld morphism of A braided rigid category has a Drinfeld morphism. Throughout this pair we use the associated spherical pivotal structure: j is part of the data, and sphericality means dim⁡j(X)=dim⁡j(X∨) for every object, as in Spherical structure. Its trace is tr⁡j(f)=Tr⁡L(jXf) for f∈End⁡(X).

Write 0 for the unit label and i∗ for the dual of i. Put Nijk=dim⁡CHom⁡(k,i⊗j), di=tr⁡j(1i), and sij=tr⁡j(cj,ici,j). Define D2=∑i∈Idi2. The unnormalized Hopf-link matrix is s=(sij). The ribbon fusion category is modular when s is invertible. When D2≠0, either square root D defines the normalized matrix S=s/D; for a modular category, The modular Hopf-link matrix squares to D² times duality proves this nonvanishing. No positivity of the general di or of D is assumed.

Convention

The trace in di and sij uses the pivotal map j=uθ and the chosen left duals. Thus sij is the trace of the double braiding on i⊗j, not the trace of a bare endomorphism without a pivotal comparison. The labels and order in sij=tr⁡j(cj,ici,j) are fixed throughout this pair.

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