Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

The algebraic 2-category Mod(C) is a fusion 2-category

Statement

Assume the Axiom of Choice. Let C be a braided fusion category over an algebraically closed field of characteristic zero. The 2-category Mod⁡(C) of finite semisimple right C-module categories, module functors, and module-natural transformations, with monoidal product given by relative Deligne tensor product over C (using its braiding to convert one action), is a fusion 2-category. In particular it is finite semisimple, has a simple unit, has left and right object duals, every 1-morphism has adjoints, every separable monad splits, and it has finitely many equivalence classes of simple objects.

Facts & Assumptions

Given: The Axiom of Choice and a braided fusion category C over an algebraically closed field of characteristic zero.

[F1]

Module-functor categories are finite semisimple gives finite semisimple hom categories and identifies regular-module endofunctors with C, sending the identity to its unit.

[F2]

Module functor adjoints and separable-monad splittings in Mod(C) gives both module adjoints and separable-monad splittings.

[F3]

A uniform rank and action-multiplicity bound for module categories bounds indecomposable ranks and all action multiplicities by fixed fusion data.

[F4]

Bounded-rank module-structure varieties have finitely many open orbits gives finitely many equivalence classes at every bounded rank.

[F5]

The relative Deligne product is represented by the braided tensor algebra constructs the relative products, their unit, and their complete weak monoidal coherence on objects, functors and transformations.

[F6]

Object duals in the separable-algebra model of Mod(C) constructs the object duals with both invertible cusp composites.

[F7]

Finite semisimple module categories are separable algebra modules gives separable algebra presentations of every object and the bimodule equivalence on hom categories.

[F8]

Fusion 2-category requires finite semisimplicity, weak monoidality, simple unit and left and right object duals.

[A1]

The Axiom of Choice is used through the classical algebraic geometry suppliers of [F4]; finite category decompositions introduce no additional choice.

Proof

1.1F1F2givenconstruct

Composition of module functors is ordinary functor composition with the composite action comparison; its module equation follows by substituting the two module equations. Identities have identity comparison. Horizontal and vertical composition of module-natural transformations are their ordinary compositions and obey interchange because horizontal composition is a functor on the functor categories. Each hom category is finite semisimple by [F1]. The zero module category and finite direct sums of module categories are obtained componentwise; inclusions and projections are module functors. Their biproduct equations hold componentwise, and composition preserves these sums since every functor is linear. Both adjoints and all separable-monad splittings exist by [F2].

2.1A1F1F3F4step 1.1algebra

To identify simple objects, write the simple objects of a module category as ma. Join a to b when mb is a summand of ma⊙X for a simple X∈C. Rigidity makes this an undirected graph. Its components are precisely action-stable full semisimple summands, so indecomposability is connectedness. A natural endomorphism of the identity acts on ma as ta1ma, because the field is algebraically closed and simple endomorphism rings are finite dimensional. Module-naturality and naturality along each summand inclusion force ta=tb along every edge. Conversely scalars constant on components define module-natural endomorphisms. Thus the endomorphism algebra of the identity is one copy of the field for every component. In the semisimple hom category from [F1], an object is simple exactly when its endomorphism algebra is the field: decompose it into simples, whose endomorphism algebras are the field, and use the resulting product of matrix algebras. Hence nonzero simple objects of Mod⁡(C) are exactly indecomposable module categories. By [F3] their ranks are bounded and only finitely many action multiplicity arrays occur; [F4] gives finitely many module equivalence classes for each array. There are consequently finitely many simple-object equivalence classes.

2.2F1F5F6F7step 1.1construct

The universal relative products from [F5] supply the tensor pseudofunctor, its composition and identity comparisons, unit C, associator and unit equivalences, and their coherence modifications. Its proofs establish naturality, the pentagon and triangle and interchange on transformations, so this is a weak monoidal structure on the same 2-category of step 1.1. Under [F1], the identity of the regular module is the simple unit of C; therefore the tensor unit is simple. Every object admits a separable algebra presentation by [F7]. The orientation is essential: an A-B bimodule X, regarded as A→B in the algebra bicategory, acts on left modules by X⊗B−:Mod⁡l(B)→Mod⁡l(A). Thus Eilenberg–Watts identifies Mod⁡(C) with the 1-morphism-opposite of that algebra bicategory. Composing these functors identifies composition with balanced tensor, by the common balanced trilinear universal property. The product construction in [F5], evaluated on free modules and extended to their separability retracts, identifies tensoring these functors with tensoring their bimodules using the positive middle braid. Consequently this identification is monoidal with the stated reversal of 1-morphisms. Fact [F6] supplies both left and right object duals there, with separate negative and positive opposite algebras. Reversing 1-morphisms interchanges evaluation and coevaluation, so a left dual becomes a right dual and conversely; its invertible cusp maps become the corresponding inverse comparisons. Therefore both duals transport to Mod⁡(C) with all their required source, target and inverse equations.

3.1F8step 1.1step 2.1step 2.2algebra∎

Steps 1.1 and 2.1 establish every clause of finite semisimplicity; step 2.2 establishes weak monoidality, a simple unit, and both object duals. These are exactly the requirements in [F8]. Thus Mod⁡(C) is a fusion 2-category under the full stated hypotheses.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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