In , a branch of mathematics, group objects are certain generalizations of groups that are built on more complicated structures than sets. A typical example of a group object is a topological group, a group whose underlying set is a topological space such that the group operations are continuous.
Formally, we start with a C with finite products (i.e. C has a terminal object 1 and any two of C have a ). A group object in C is an object G of C together with morphisms
m : G × G → G (thought of as the "group multiplication")
e : 1 → G (thought of as the "inclusion of the identity element")
inv : G → G (thought of as the "inversion operation")
such that the following properties (modeled on the group axioms – more precisely, on the definition of a group used in universal algebra) are satisfied
m is associative, i.e. m (m × idG) = m (idG × m) as morphisms G × G × G → G, and where e.g. m × idG : G × G × G → G × G; here we identify G × (G × G) in a canonical manner with (G × G) × G.
e is a two-sided unit of m, i.e. m (idG × e) = p1, where p1 : G × 1 → G is the canonical projection, and m (e × idG) = p2, where p2 : 1 × G → G is the canonical projection
inv is a two-sided inverse for m, i.e. if d : G → G × G is the diagonal map, and eG : G → G is the composition of the unique morphism G → 1 (also called the counit) with e, then m (idG × inv) d = eG and m (inv × idG) d = eG.
Note that this is stated in terms of maps – product and inverse must be maps in the category – and without any reference to underlying "elements" of the group object – categories in general do not have elements of their objects.
Another way to state the above is to say G is a group object in a category C if for every object X in C, there is a group structure on the morphisms Hom(X, G) from X to G such that the association of X to Hom(X, G) is a (contravariant) functor from C to the .
Each set G for which a group structure (G, m, u, −1) can be defined can be considered a group object in the category of sets.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In mathematics, an algebraic group is an algebraic variety endowed with a group structure that is compatible with its structure as an algebraic variety. Thus the study of algebraic groups belongs both to algebraic geometry and group theory. Many groups of geometric transformations are algebraic groups; for example, orthogonal groups, general linear groups, projective groups, Euclidean groups, etc. Many matrix groups are also algebraic. Other algebraic groups occur naturally in algebraic geometry, such as elliptic curves and Jacobian varieties.
In mathematics, a Hopf algebra, named after Heinz Hopf, is a structure that is simultaneously an (unital associative) algebra and a (counital coassociative) coalgebra, with these structures' compatibility making it a bialgebra, and that moreover is equipped with an antiautomorphism satisfying a certain property. The representation theory of a Hopf algebra is particularly nice, since the existence of compatible comultiplication, counit, and antipode allows for the construction of tensor products of representations, trivial representations, and dual representations.
In mathematics, a group scheme is a type of object from algebraic geometry equipped with a composition law. Group schemes arise naturally as symmetries of schemes, and they generalize algebraic groups, in the sense that all algebraic groups have group scheme structure, but group schemes are not necessarily connected, smooth, or defined over a field. This extra generality allows one to study richer infinitesimal structures, and this can help one to understand and answer questions of arithmetic significance.
Distributed computing is one of the major trends in the computer industry. As systems become more distributed, they also become more complex and have to deal with new kinds of problems, such as partial crashes and link failures. To answer the growing deman ...
We investigate Farley’s CAT(0) cubical model for Thompson’s group F (we adopt the classical language of F, using binary trees and piecewise linear maps, avoiding the one of diagram groups and pictures). Main results include: in general, Thompson’s group el ...
Kan spectra provide a combinatorial model for the stable homotopy category. They were introduced by Dan Kan in 1963 under the name semisimplicial spectra. A Kan spectrum is similar to a pointed simplicial set, but it has simplices in negative degrees as we ...