Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Finite semisimple module category over a fusion category

Definition

Let C be a fusion category over k. A finite semisimple right C-module category consists of a k-linear abelian category M, semisimple in the sense of Semisimple objects and semisimple abelian categories, with finitely many isomorphism classes of simple objects and finite-dimensional k-vector spaces Hom⁡M(m,n) for all m,n∈M, together with a bilinear action functor ⊙:M×C→M and natural isomorphisms αm,X,Y:(m⊙X)⊙Y⟶m⊙(X⊗Y),ρm:m⊙1⟶m, which satisfy the module pentagon and triangle equations obtained from the associator and unitors of C. The left-action convention is defined by reversing the order of the action factors.

A module functor F:M→N is a linear functor with natural action comparisons F(m⊙X)≅F(m)⊙X satisfying the module associativity and unit equations. A module-natural transformation is a natural transformation commuting with those comparisons. These objects, functors, and transformations form a 2-category denoted Mod⁡(C) with ordinary composition of module functors and horizontal and vertical composition of module-natural transformations. The action comparison for a composite is the composite of the two action comparisons; identity functors have identity comparisons.

This definition alone does not assert that there are finitely many equivalence classes of simple module categories, nor that Mod⁡(C) is a fusion 2-category.

Depends on

Used by

Dependency tree · two levels

6 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