Category of groups: Difference between revisions

From Groupprops
 
(5 intermediate revisions by the same user not shown)
Line 18: Line 18:
| composition of morphisms || compose the homomorphisms as set maps || Given homomorphisms <math>\alpha:G \to H</math> and <math>\beta:H \to K</math>, the composite is the set composition <math>\beta \circ \alpha</math>, a homomorphism <math>G \to K</math>.
| composition of morphisms || compose the homomorphisms as set maps || Given homomorphisms <math>\alpha:G \to H</math> and <math>\beta:H \to K</math>, the composite is the set composition <math>\beta \circ \alpha</math>, a homomorphism <math>G \to K</math>.
|-
|-
| identity morphism || identity map from a group to itself. ||
| identity morphism || identity map from a group to itself. || For a group <math>G</math>, the identity map is a map <math>\operatorname{id}_G: G \to G</math> given by <math>\operatorname{id}_G(x) = x</math> for all <math>x \in G</math>.
|}
|}
==Categorical constants and constructs==
==Categorical constants and constructs==


Line 29: Line 30:
| monomorphism || injective homomorphism || The kernel of the mapping is trivial. Alternatively, it can be identified with a [[subgroup]] inclusion mapping. This is relatively straightforward to prove; see [[monomorphism iff injective in the category of groups]]
| monomorphism || injective homomorphism || The kernel of the mapping is trivial. Alternatively, it can be identified with a [[subgroup]] inclusion mapping. This is relatively straightforward to prove; see [[monomorphism iff injective in the category of groups]]
|-
|-
| epimorphism || surjective homomorphism || The mapping is surjective. This is not immediately obvious, see [[epimorphism iff surjective in the category of groups]]
| epimorphism || surjective homomorphism || The mapping is surjective. This is not immediately obvious, but relies on the [[amalgamated free product]] construction. For more, see [[epimorphism iff surjective in the category of groups]].
|-
|-
| zero object || [[trivial group]] || The group with one element, namely its identity element.
| zero object || [[trivial group]] || The group with one element, namely its identity element.
Line 40: Line 41:
==Important functors==
==Important functors==


For lists of important functors involving the category of groups, refer the following:
{| class="sortable" border="1"
 
! Target category !! Description of functor !! Important facts about this functor
===Forgetful functor to sets===
|-
 
| category of sets || send each group to its underlying set and send each homomorphism to its underlying set map. This functor is often called the ''forgetful functor to Sets'' because it involves forgetting the group structure.|| This is a faithful functor but not a full functor, and it gives the category of groups the structure of a [[cattheory:concrete category|concrete category]].
This functor takes a group and outputs the underlying set of the group. The forgetful functor is a faithful functor, because any group homomorphism is completely determined by the corresponding map at the set-theoretic level. Thus, the category of groups is a [[cattheory:concrete category|concrete category]]. This in particular shows that the category of groups is a [[cattheory:locally small category|locally small category]].
|-
| category of monoids || send each group to its underlying [[monoid]] (i.e., forget the inverse operation) and send each homomorphism to its underlying monoid homomorphism. This functor is also often called a ''forgetful functor'' because it involves forgetting part of the group structure. || This functor is faithful and full (which means that the monoidal homomorphisms between groups are precisely the same as the group homomorphisms between them). For more, see [[groups form a full subcategory of monoids]].
|-
| category of semigroups || send each group to its underlying [[semigroup]] (i.e., retain only the binary operation; forget the identity element and inverse operation) and send each homomorphism to its underlying semigroup homomorphism. This functor is also often called a ''forgetful functor'' because it involves forgetting part of the group structure.|| This functor is faithful and full (which means that the semigroup homomorphisms between groups are precisely the same as the group homomorphisms between them). For more, see [[groups form a full subcategory of semigroups]].
|}


==Facts==
==Facts==


* [[Category of groups has no nontrivial auto-equivalences]]
* [[Category of groups has no nontrivial auto-equivalences]]

Latest revision as of 05:01, 20 January 2013

This article describes a category (in the mathematical sense) where the notion of "object" is groupand the notion of morphism is homomorphism of groups. In other words, it gives a category structure to the collection of all groups.
View other category structures on groups

This article describes a way of viewing the collection of groups as a structure in its own right

Definition

The category of groups is defined as follows:

Aspect Name Definition/description
objects groups A group is a set with associative binary operation admitting an identity element and inverse map.
morphisms homomorphisms of groups A homomorphism between groups G and H is a set map φ:G→H such that φ(xy)=φ(x)φ(y) for all x,y∈G. Note that this also forces that it preserves the identity element and the inverse map, and some definitions include these additional (redundant) conditions.
composition of morphisms compose the homomorphisms as set maps Given homomorphisms α:G→H and β:H→K, the composite is the set composition β∘α, a homomorphism G→K.
identity morphism identity map from a group to itself. For a group G, the identity map is a map idG:G→G given by idG(x)=x for all x∈G.

Categorical constants and constructs

Construct Name in this category Definition/description
isomorphism isomorphism of groups A bijective homomorphism; equivalently, a homomorphism whose inverse map is also a homomorphism.
monomorphism injective homomorphism The kernel of the mapping is trivial. Alternatively, it can be identified with a subgroup inclusion mapping. This is relatively straightforward to prove; see monomorphism iff injective in the category of groups
epimorphism surjective homomorphism The mapping is surjective. This is not immediately obvious, but relies on the amalgamated free product construction. For more, see epimorphism iff surjective in the category of groups.
zero object trivial group The group with one element, namely its identity element.
categorical product the usual external direct product We take the external direct product with the coordinate-wise projection maps.
categorical coproduct the usual external free product We take the external free product with the natural inclusions.

Important functors

Target category Description of functor Important facts about this functor
category of sets send each group to its underlying set and send each homomorphism to its underlying set map. This functor is often called the forgetful functor to Sets because it involves forgetting the group structure. This is a faithful functor but not a full functor, and it gives the category of groups the structure of a concrete category.
category of monoids send each group to its underlying monoid (i.e., forget the inverse operation) and send each homomorphism to its underlying monoid homomorphism. This functor is also often called a forgetful functor because it involves forgetting part of the group structure. This functor is faithful and full (which means that the monoidal homomorphisms between groups are precisely the same as the group homomorphisms between them). For more, see groups form a full subcategory of monoids.
category of semigroups send each group to its underlying semigroup (i.e., retain only the binary operation; forget the identity element and inverse operation) and send each homomorphism to its underlying semigroup homomorphism. This functor is also often called a forgetful functor because it involves forgetting part of the group structure. This functor is faithful and full (which means that the semigroup homomorphisms between groups are precisely the same as the group homomorphisms between them). For more, see groups form a full subcategory of semigroups.

Facts