Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
GPT-4o
Gemini 2.5 Pro Pro
o3 Pro
GPT-4.1 Pro
DeepSeek R1 via Azure Pro
2000 character limit reached

Reconstruction Module in Tensor Categories

Updated 4 August 2025
  • Reconstruction Module is a framework that defines methods to recover module categories from internal data in tensor categories using algebraic and categorical tools.
  • It employs structures such as quasi-finite coalgebra objects and lax module monads to extend classical reconstruction beyond finite, rigid settings.
  • The approach bridges classical algebra-object methods with modern techniques, enabling Morita equivalence and a categorical proof of the Hopf–monadic fundamental theorem.

A reconstruction module, within the context of modern tensor category theory and module category theory, refers to the set of methods, algebraic structures, and categorical formalisms that enable one to recover or "reconstruct" a module category from internal data in the ambient monoidal (or tensor) category. The classical paradigm applies to finite tensor categories and rigid monoidal categories, where reconstruction proceeds via algebra objects. In the infinite or non-rigid settings, the reconstruction module must deploy more general structures—such as quasi-finite coalgebra objects and lax module monads—to effect the reconstruction and classification of module categories. This shift is motivated by the failure of the classical algebra-object-based approach once rigidity and finiteness are relaxed, necessitating deeper examination of categorical projectives, coalgebraic invariants, and equivariant (lax) monad structures.

1. Extension of Reconstruction Theory Beyond the Finite–Rigid Setting

In the classical Etingof–Ostrik framework, a finite tensor category C\mathcal{C} and its module category M\mathcal{M} admit reconstruction as the category of right modules over an algebra object ACA \in \mathcal{C}: MmodCA.\mathcal{M} \simeq \mathrm{mod}_{\mathcal{C}} A. The new approach replaces AA by a quasi-finite coalgebra object when C\mathcal{C} and M\mathcal{M} are only locally finite, not finite; thus, reconstruction proceeds as

McomodC(C)\mathcal{M} \simeq \mathrm{comod}_{\mathcal{C}}(C)

where CC is a quasi-finite coalgebra object in C\mathcal{C} [(Stroiński et al., 1 Sep 2024), Section 1].

This shift is necessary as the direct use of algebra objects becomes untenable outside the finite and rigid environments. The methods require a careful analysis of internal projective and injective objects in M\mathcal{M} and their categorical (co)ends, rendering the reconstruction module inherently coalgebraic and suitable for truly infinite settings.

2. Treatment of Non-Rigid Monoidal Categories via Lax Module Monads

When the monoidal category C\mathcal{C} lacks rigidity (i.e., not every object admits left and right duals), classical strategies to produce internal algebra or coalgebra objects from M\mathcal{M} fail. The reconstruction module in this context is a lax C\mathcal{C}-module monad, a generalization of the algebra-object: Tma:T(VM)VT(M)T_\mathrm{ma}: T(V \odot M) \to V \odot T(M) where TT is a monad on M\mathcal{M}, VCV \in \mathcal{C}, MMM \in \mathcal{M}, and TmaT_\mathrm{ma} (the "module action structure map") may fail to be invertible ((Stroiński et al., 1 Sep 2024), Def. 2.4, Sec. 3). When C\mathcal{C} is rigid, every lax module monad is automatically strong, and hence equivalent to giving an algebra object in C\mathcal{C} ((Stroiński et al., 1 Sep 2024), Prop. 3.16, Prop. 3.21), but when rigidity fails, lax module monads capture the required generalization.

The central reconstruction equivalence in this context states that for a suitable "generator" XMX \in \mathcal{M},

MEM(Hom(X,X))\mathcal{M} \simeq EM(\mathrm{Hom}(X, - \odot X))

where EMEM is the Eilenberg-Moore category of the lax module monad ((Stroiński et al., 1 Sep 2024), Thms. 4.1, 4.2). The requisite coherence conditions—associativity and unit maps for TmaT_\mathrm{ma}—mirror the underlying monoidal structure but allow for non-invertibility due to the absence of duals.

3. Concrete Realization for Comodule Categories and Hopf Trimodule Algebras

For the pivotal case where C=comfd[B]\mathcal{C} = \mathrm{com}_{fd}[B] is the category of finite-dimensional left comodules over a bialgebra BB (not necessarily Hopf), the reconstruction module is explicitly realized as a category of contramodules over a Hopf trimodule algebra AA ((Stroiński et al., 1 Sep 2024), Sec. 5).

A Hopf trimodule consists of a BB-bicomodule equipped with a left BB-action satisfying suitable compatibility diagrams. If the action functor in M\mathcal{M} has both left and right adjoints, there exists such a Hopf trimodule algebra AA with an equivalence: EM(Hom(X,X))A-Contramod.EM(\mathrm{Hom}(X, - \odot X)) \simeq A\text{-Contramod}. When BB is Hopf, this recovers the established tensor-categorical reconstruction theorem for finite tensor categories. The authors provide explicit computations (e.g., (Stroiński et al., 1 Sep 2024), Ex. 5.12), contrasting the classical algebra-object based methods and the Hopf trimodule approach.

4. Morita and Eilenberg–Watts-Type Characterizations

The reconstruction module incorporates a bicategorical perspective, relating module category equivalences to Morita equivalence classes of module monads. A right exact lax C\mathcal{C}-module functor between Eilenberg-Moore categories EM(T)EM(S)EM(T) \rightarrow EM(S) corresponds to a "biact functor" (or bimodule functor) in the 2-category of right exact lax C\mathcal{C}-module endofunctors ((Stroiński et al., 1 Sep 2024), Thm. 4.18).

Given two such monads SS and TT, Morita equivalence is witnessed by the existence of SSTT and TTSS biact functors whose respective compositions (via relative tensor product) yield the identity functors up to isomorphism ((Stroiński et al., 1 Sep 2024), Def. 4.20, Prop. 4.21). The equivalence between module categories is then classified by the Morita classes of right exact lax C\mathcal{C}-module monads ((Stroiński et al., 1 Sep 2024), Thm. 4.24).

5. Fusion Operators, Categorical Proofs, and the Hopf–Monadic Fundamental Theorem

In the context of Hopf monads (as in Bruguières, Lack, and Virelizier), a fusion operator H:T(V)VT()H: T \circ (V \odot -) \to V \odot T(-) is central. The paper demonstrates that such a fusion operator is categorically a coherence cell for the module functor structure on TT ((Stroiński et al., 1 Sep 2024), e.g., following Prop. 4.12), so the property of having a unique invertible cell characterizes Hopf monads categorically.

This enables a categorical proof—bypassing explicit algebraic computations—of a variant of the fundamental theorem of Hopf modules: the Eilenberg-Moore category of a Hopf monad, equipped with its canonical extended module structure, is equivalent to the module category of the associated Hopf trimodule algebra. That is,

EM(T)ModAEM(T) \simeq \mathrm{Mod}_{A}

whenever the appropriate fusion (coherence) conditions are satisfied ((Stroiński et al., 1 Sep 2024), Section 4), reproducing the Hopf–monadic fundamental theorem in this broad context.

6. Bridging Classical and Infinite/Non-Rigid Settings

The comprehensive approach developed in (Stroiński et al., 1 Sep 2024) establishes a bridge between earlier finite, rigid module-category reconstruction (via algebra objects) and the more general infinite and non-rigid settings (via quasi-finite coalgebra objects and lax module monads). The methodology is robust to the loss of finiteness and rigidity, incorporating diagrammatic arguments (notably Linton coequalizers), generalized Morita theory, and the use of categorical projectives/injectives.

These results provide an extensible foundation for further paper in tensor-categorical representation theory, quantum groups, vertex operator algebras, and related domains where module categories over general monoidal categories are central objects of paper. The categorical perspective adopted—especially regarding fusion operator coherence and Morita classification—offers a unified and flexible toolkit for the analysis and reconstruction of module categories in a variety of settings.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)