Alphabeta Math
LemmaStatement: 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.

Module functor adjoints and separable-monad splittings in Mod(C)

Statement

Let C be a fusion category over an algebraically closed field of characteristic zero, and let M,N be finite semisimple right C-module categories. Every module functor F:M→N has left and right adjoints whose adjunction units and counits are module-natural. Every separable monad in the 2-category of finite semisimple C-module categories has a separable splitting in that 2-category.

Here a separable monad is (T,μ,η) with a module-natural section σ:T→T2 of μ satisfying Tμ∘σT=σ∘μ=μT∘Tσ. A separable splitting means an adjunction L⊣U inducing this monad whose counit admits a module-natural section.

Facts & Assumptions

[F1]

Right module categories and module functors have the specified associators, unitors and comparisons in Finite semisimple module category over a fusion category.

[F2]

Rigidity in Fusion and multifusion categories supplies evaluation and coevaluation maps satisfying both zigzag identities. For a finite semisimple k-linear category, write V⊗ka for a finite copower.

Proof

Given: C,M,N,F as stated, with comparison fm,X:F(m⊙X)→F(m)⊙X.

1.1F1F2construct

Choose representatives a of the finitely many simple objects of M. Put R(n)=⨁aHom⁡N(F(a),n)⊗ka and L(n)=⨁aHom⁡N(n,F(a))∗⊗ka. Since End⁡(a)=k, decomposition into these simples gives natural bijections Hom⁡M(m,Rn)=Hom⁡N(Fm,n) and Hom⁡M(Ln,m)=Hom⁡N(n,Fm). Define the units and counits to represent the identity maps under these bijections. The two triangle identities follow by applying either bijection: in each case the composite corresponds to the original identity. Thus these are actual ordinary adjunctions, with no exactness or representability assumption left implicit.

1.2F1construct

Let (T,μ,η,σ) be a separable monad on M. Define MT to consist of pairs (x,a) with a:Tx→x, aηx=1 and aT(a)=aμx; its arrows h:(x,a)→(y,b) obey ha=bT(h). The underlying additive functor T is exact because M is semisimple. Thus the kernel and cokernel of h carry induced T-actions, by exactness and the universal properties, satisfying the two algebra equations. They give the categorical kernel and cokernel in MT. The canonical comparison from coimage to image is the underlying isomorphism and preserves actions; its inverse preserves them as well. Therefore MT is abelian and the forgetful functor U is exact and faithful. Its free left adjoint is LT(x)=(Tx,μx), with unit ηx and counit at (x,a) equal to a. The two triangles are respectively μxTηx=1 and aηx=1.

2.1step 1.1F1F2construct

Fix a dual pair X,X∨ with evaluation X⊗X∨→1 and coevaluation 1→X∨⊗X. Define rn,X:R(n⊙X)→Rn⊙X by the following natural bijections in m: Hom⁡M(m,R(n⊙X))≅Hom⁡N(Fm,n⊙X)≅Hom⁡N(F(m⊙X∨),n)≅Hom⁡M(m⊙X∨,Rn)≅Hom⁡M(m,Rn⊙X). The middle identification uses fm,X∨ and the other identifications use the adjunction or the displayed duality. Every arrow is invertible, so Yoneda gives an invertible module comparison. To verify its pentagon, apply Hom⁡(m,−) to the two paths for X,Y. Both paths move Y∨ and then X∨ across Hom, apply f to the resulting action, then move them back. The equality of these composites is exactly the module pentagon for f, since evaluation of the dual of X⊗Y is the consecutive evaluation of Y and X with the associators. For X=1 the same comparison reduces to the module unit equation for f. This proves all module-functor axioms for R.

2.2step 1.2constructalgebra

For (x,a) put s(x,a)=T(a)σxηx:x→Tx. Its composite with a is aT(a)σxηx=aμxσxηx=aηx=1. It is an algebra map to (Tx,μx): indeed sa=T(a)σxηxa=T(a)σxT(a)ηTx=T(a)T2(a)σTxηTx=T(a)T(μx)σTxηTx=T(a)σxμxηTx=T(a)σx, while μxT(s)=μxT2(a)T(σx)T(ηx)=T(a)μTxT(σx)T(ηx)=T(a)σxμxT(ηx)=T(a)σx. Here the middle equalities use, in order, naturality, the algebra equation, the two bimodule equations for σ, and the unit equations. Naturality of s in algebra maps follows by the same naturality of σ,η and ha=bT(h). Thus every algebra is a natural retract of its free algebra.

3.1step 1.1step 2.1F1F2construct

Under the bijections of step 2.1, the image of the adjunction counit ϵn:FRn→n is its tensor translate, so the equality (ϵn⊙1X)fRn,XF(rn,X)=ϵn⊙X holds. This is precisely module-naturality of ϵ. For the unit, apply the adjunction bijection to its two proposed module-naturality composites; both correspond to the identity of F(m⊙X) after f and its inverse cancel. Faithfulness of the bijection proves their equality. Hence both triangles from step 1.1 are identities of module-natural transformations. For L, use the dual pair with evaluation X♭⊗X→1 and coevaluation 1→X⊗X♭ in the identical argument with the Hom adjunction reversed: Hom⁡(L(n⊙X),m)≅Hom⁡(n,Fm⊙X♭)≅Hom⁡(Ln,m⊙X♭)≅Hom⁡(Ln⊙X,m). Its middle comparison is that of F. Evaluation of tensor products gives the module pentagon, the unit pair gives its unit equation, and applying this bijection proves module-naturality of its unit and counit.

3.2step 1.2step 2.2construct

For each x, LT(x) is projective, since Hom⁡MT(LTx,−)=Hom⁡M(x,U−) is exact. Hence all objects are projective by step 2.2. Let g be the sum of the finitely many simples of M. Every object of MT is a quotient of a finite sum of copies of LTg: first its underlying object is a summand of a finite sum of copies of g, and then its action is an epimorphism from its free object. Also End⁡(LTg) is finite dimensional, being a subspace of an underlying Hom space in M. Every object has finite length, since a strict chain of subobjects remains a strict chain after the faithful exact functor U and U(x,a)=x has finite length. With all objects projective, all short exact sequences split, so each object is a finite sum of simples. Each simple is a summand of LTg because its quotient from a finite sum of LTg splits; the finite length of LTg bounds the number of such simples. Thus MT is finite semisimple with finite dimensional Hom spaces.

4.1step 1.2step 2.2step 3.2F1construct∎

Write tx,X:T(x⊙X)→Tx⊙X for the module comparison. Define (x,a)⊙X=(x⊙X,(a⊙1)tx,X). The fact that μ and η are module-natural proves its two algebra equations. The associativity and unit constraints inherited from M are algebra maps by the pentagon and unit equation for t, and obey their own pentagon and triangle because U is faithful. Thus MT is a finite semisimple right module category. The displayed action makes U a module functor, and t gives LT its module structure. Module-naturality of η,μ verifies the adjunction unit and counit. Module-naturality of σ,η and of the action a verifies that s from step 2.2 is module-natural as well. Consequently LT⊣U is a separable adjunction, induces exactly T with its multiplication and unit, and supplies the required splitting.

Depends on

Used by

Dependency tree · two levels

5 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