nLab group object

Redirected from "group objects".
Contents

Context

Categorical algebra

Group Theory

Contents

Idea

A group object in a cartesian category CC is a group internal to CC (see at internalization for more on the general idea).

In other words, a group object is something that behaves “just like” a group but which need not have (just) an underlying set.

For example, group objects in Top are topological groups, while group objects in SmthMfd are Lie groups, etc., see the Examples below.

Given a non-cartesian but braided monoidal category one can still make sense of group objects in the dual guise of Hopf monoids, see there for more and see further below.

Definition

In a cartesian monoidal category

Definition

(group object in cartesian monoidal category)
A group object or internal group internal to a category 𝒞\mathcal{C} with finite products (binary Cartesian products and a terminal object *\ast) is

such that the following diagrams commute:

(associativity)

(1)G×G×G id×m G×G m×id m G×G m G \array{ G\times G\times G & \stackrel{id\times m}{\longrightarrow} & G\times G \\ {}^{ \mathllap{ m\times id } } \big\downarrow && \big\downarrow m \\ G\times G & \stackrel{m}{\longrightarrow} & G }

(unitality)

(2)G (e,id) G×G (id,e) id m G×G m G \array{ G & \stackrel{(\mathrm{e},id)}{\longrightarrow} & G\times G \\ {}^{\mathllap{(\id,\mathrm{e})}} \big\downarrow &\underset{\id}{\searrow}& \big\downarrow m \\ G\times G & \underset{m}{\longrightarrow} &G }

(invertibility):

(3)G (() 1,id) G×G (id,() 1) ep m G×G m G \array{ G & \overset{ ((-)^{-1},id) } {\longrightarrow} & G\times G \\ {}^{ \mathllap{ (id,(-)^{-1}) } } \big\downarrow & \underset{\mathrm{e} \circ p}{\searrow} & \big\downarrow m \\ G\times G & \stackrel{m}{\longrightarrow} & G }

Remark

More pedantically, the associativity law (1) actually factors through the associator isomorphisms (G×G)×GG×(G×G)(G\times G)\times G \xrightarrow{\phantom{--}} G\times (G\times G), which is notationally suppressed above.

Remark

The pairing (f,g)(f,g) denotes (f×g)Δ(f\times g)\circ\Delta where Δ\Delta is a diagonal morphism.

Remark

Even if CC does not have all binary products, as long as products with GG (and the terminal object **) exist, then one can clearly still speak of a group object GG in 𝒞\mathcal{C}, as above.

Remark

The first two structures in Def. (binary operation and neutral element) together with the first two properties (associativity and unitality) make a internal monoid object. The remaining structure (inverses) is what specializes this monoid object to a group object.

There is an alternative way to encode the specialization from monoid objects to group objects:

Proposition

A monoid object (G,m,e)(G, m, \mathrm{e}) can be made into a group object according to Def. iff its associativity diagram (1) is cartesian (meaning: exhibiting a pullback or fiber product).

Proof

First assume that (G,m,e)(G,m,\mathrm{e}) becomes a group object via some () 1:GG(-)^{-1} \,\colon\, G \to G. In order to show that then (1) is Cartesian we may verify the universal property of a fiber product:

Given any domain DD and morphisms

(l i,r i):DG×G,i{1,2} (l_i, r_i) \;\colon\; D \longrightarrow G \times G \,,\;\;\;\;\;\;\; i \in \{1,2\}

such that the following solid diagram commutes

(4)

we need to show that there exists a unique dashed morphism making the left and right triangles commute.

By alternative projection to the two factors in the codomain G×GG \times G of these triangles, one immediately finds that the dashed morphism must be equal to both

(5)(l 2,m(l 2 1,l 1),r 1)and(l 2,m(r 2,r 1 1),r 1), \big( l_2 ,\, m(l_2^{-1},l_1) ,\, r_1 \big) \;\;\; \text{and} \;\;\; \big( l_2 ,\, m(r_2,r_1^{-1}) ,\, r_1 \big) \,,

which is indeed consistent by the assumption that the solid diagram commutes, and using again the assumed inverses, since this says that:

m(l 1,r 1)=m(l 2,r 2)m(l 2 1,l 1)=m(r 2,r 1 1). m(l_1, r_1) \;=\; m(l_2, r_2) \;\;\;\;\;\;\; \Leftrightarrow \;\;\;\;\;\;\; m(l_2^{-1}, l_1) \;=\; m(r_2, r_1^{-1}) \,.

Conversely, assuming that the associativity square is Cartesian, we need to produce a consistent inverse-assigning map. To this end, specialize the maps in (4) to DGD \,\coloneqq\, G and

(l 1,r 1)(ep,id)and(l 2,r 2)(id,ep), (l_1, r_1) \coloneqq (\mathrm{e}\circ p, id) \;\;\;\;\;\; \text{and} \;\;\;\;\;\; (l_2, r_2) \coloneqq (id, \mathrm{e}\circ p) \,,

whence the dashed map (5) gives

G(ep,() 1,ep)G×G×G G \xrightarrow{ \; \big( \mathrm{e}\circ p ,\, (-)^{-1} ,\, \mathrm{e} \circ p \big) \; } G \times G \times G

from which we may project out the desired map () 1(-)^{-1}, that one readily checks to satisfy the invertibility law.

In a braided monoidal category

Notice (with Rem. ) that the use of diagonal maps in Def. precludes direct generalization of this definition of group objects to non-cartesian monoidal categories, where such maps in general do not exist.

Hence, while the underlying monoid object may generally be defined in any monoidal category, the internal formulation of existence of inverse elements typically uses extra structure, such as that of a compatible comonoid object-structure to substitute for the missing diagonal maps.

Given this, inverses may be encoded by an antipode map and the resulting “monoidal group objects” are known as Hopf monoids. These subsume and generalize Hopf algebras, which are widely studied, for instance in their role as quantum groups.

Hopf monoids may be defined in any symmetric monoidal category, or more generally any braided monoidal category, where the braiding is used in stating the fact that the comultiplication is a homomorphism of monoid objects.

In terms of presheaves of groups

Proposition

Given a cartesian monoidal category 𝒞\mathcal{C}, the category of internal groups in 𝒞\mathcal{C} (in the sense of Def. ) is equivalent to the full subcategory of the category of presheaves of groups Grp C opGrp^{C^{op}} on CC, spanned by those presheaves whose underlying set part in Set C opSet^{C^{op}} is representable.

This is a special case of the general theory of structures in presheaf toposes.

It means that the forgetful functor from the functor category Func(𝒞 op,Grp)Func\big(\mathcal{C}^{op}, Grp\big) to the presheaf category Func(𝒞 op,Set)Func\big(\mathcal{C}^{op}, Set\big) (obtained by composing with the forgetful functor Grp \to Set) creates representable group objects from representable objects.

We unwind how this works:

An object GG in 𝒞\mathcal{C} equipped with internal group structure is identified equivalently with a diagram of functors of the form

(6) Grp (G,) 𝒞 op y(G) Set, \array{ && Grp \\ & \mathllap{{}^{(G,\cdot)}}\nearrow & \big\downarrow \\ \mathcal{C}^{op} &\underset{y(G)}{\longrightarrow}& Set } \,,

where 𝒞 op\mathcal{C}^{op} is the opposite category of CC, Grp is the category of groups with group homomorphisms between them, and Set is the category of sets with maps/functions between them. Finally,

y: C PSh(C) G Hom C(,G) \array{ y \colon & C &\xhookrightarrow{\phantom{--}}& PSh(C) \\ & G &\mapsto& Hom_C(-,G) }

is the Yoneda embedding of 𝒞\mathcal{C} into its category of presheaves PSh(C)Func(C op,Set)PSh(C) \,\coloneqq\, Func(C^{op}, Set), which sends each object GG to the representable presheaf that it represents.

Since the Yoneda embedding is fully faithful, it is natural to leave it notationally implicit and to write G(S)G(S) (for S𝒞S \in \mathcal{C}) as shorthand for

G(S)y(G)(S)Hom C(S,G). G(S) \coloneqq y(G)(S) \coloneqq Hom_C(S,G) \,.

(This a also referred to as “GG seen at stage SS”, or similar.)

Now, the lift (6) of such a presheaf of sets to a presheaf of groups equips for each object S𝒞S \in \mathcal{C} the set G(S)y(G)(S)Hom C(S,G)G(S) \coloneqq y(G)(S) \coloneqq Hom_C(S,G) with an ordinary group structure (G(S), S,e S)\big(G(S), \cdot_S, \mathrm{e}_S\big), in particular with a product operation (a map of sets) of the form

S:G(S)×G(S)G(S). \cdot_S \,\colon\, G(S) \times G(S) \longrightarrow G(S) \,.

Moreover, since morphisms in Grp are group homomorphisms, it follows that for every morphism f:STf \colon S \to T in CC we get a commuting diagram of the form

G(S)×G(S) S G(S) G(f)×G(f) G(f) G(T)×G(T) T G(T). \array{ G(S) \times G(S) &\stackrel{\cdot_S}{\to}& G(S) \\ \big\uparrow\mathrlap{^{G(f)\times G(f)}} && \big\uparrow\mathrlap{^{G(f)}} \\ G(T) \times G(T) &\underset{\cdot_T}{\longrightarrow}& G(T) \mathrlap{\,.} }

Taken together this means that there is a morphism

y(G×G)y(G) y(G \times G) \longrightarrow y(G)

of representable presheaves. By the Yoneda lemma, this uniquely comes from a morphism :G×GG\cdot \colon G \times G \to G in 𝒞\mathcal{C}, which is the product of the group structure on the object GG that we are after.

etc.

As data structure

In the language of dependent type theory (using the notation for dependent pair types here) the type of group data structures is:

Examples

Theory

The basic results of elementary group theory apply to group objects in any category with finite products. (Arguably, it is precisely the elementary results that apply in any such category.)

The theory of group objects is an example of a Lawvere theory.

References

The general definition of internal groups seems to have first been formulated in:

  • Alexander Grothendieck, p. 104 (7 of 21) of: FGA Techniques de construction et théorèmes d’existence en géométrie algébrique III: préschémas quotients, Séminaire Bourbaki: années 1960/61, exposés 205-222, Séminaire Bourbaki, no. 6 (1961), Exposé no. 212, (numdam:SB_1960-1961__6__99_0, pdf, English translation: web version)

following the general principle of internalization formulated in:

  • Alexander Grothendieck, p. 340 (3 of 23) in: FGA Technique de descente et théorèmes d’existence en géométrie algébriques. II: Le théorème d’existence en théorie formelle des modules, Séminaire Bourbaki : années 1958/59 - 1959/60, exposés 169-204, Séminaire Bourbaki, no. 5 (1960), Exposé no. 195 (numdam:SB_1958-1960__5__369_0, pdf, English translation: web version)

reviewed in:

On internalization, H-spaces, monoid objects, group objects in algebraic topology/homotopy theory and introducing the Eckmann-Hilton argument:

With emphasis of the role of the Yoneda lemma:

Review:

In the broader context of internalization via sketches:

With focus on internalization in sheaf toposes:

Last revised on December 11, 2024 at 17:52:16. See the history of this page for a list of all contributions to it.