class of groups
   HOME

TheInfoList



OR:

A class of groups is a set theoretical collection of
groups A group is a number of persons or things that are located, gathered, or classed together. Groups of people * Cultural group, a group whose members share the same cultural identity * Ethnic group, a group whose members share the same ethnic ide ...
satisfying the property that if ''G'' is in the collection then every group isomorphic to ''G'' is also in the collection. This concept arose from the necessity to work with a bunch of groups satisfying certain special property (for example finiteness or commutativity). Since
set theory Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly conce ...
does not admit the "set of all groups", it is necessary to work with the more general concept of '' class''.


Definition

A class of groups \mathfrak is a collection of groups such that if G \in \mathfrak and G\cong H then H \in \mathfrak. Groups in the class \mathfrak~ are referred to as \mathfrak-groups. For a set of groups \mathfrak, we denote by (\mathfrak) the smallest class of groups containing \mathfrak. In particular for a group G, (G) denotes its
isomorphism class In mathematics, an isomorphism class is a collection of mathematical objects isomorphic to each other. Isomorphism classes are often defined as the exact identity of the elements of the set is considered irrelevant, and the properties of the stru ...
.


Examples

The most common examples of classes of groups are: * \emptyset: the
empty Empty may refer to: ‍ Music Albums * ''Empty'' (God Lives Underwater album) or the title song, 1995 * ''Empty'' (Nils Frahm album), 2020 * ''Empty'' (Tait album) or the title song, 2001 Songs * "Empty" (The Click Five song), 2007 * ...
class of groups * \mathfrak: the class of
cyclic groups In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative binary ...
. * \mathfrak~: the class of
abelian groups In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commut ...
. * \mathfrak~: the class of finite supersolvable groups * \mathfrak~: the class of nilpotent groups * \mathfrak~: the class of finite
solvable groups In mathematics, more specifically in the field of group theory, a solvable group or soluble group is a group that can be constructed from abelian groups using extensions. Equivalently, a solvable group is a group whose derived series terminate ...
* \mathfrak~: the class of finite simple groups * \mathfrak~: the class of finite groups * \mathfrak~: the class of all groups


Product of classes of groups

Given two classes of groups \mathfrak and \mathfrak it is defined the product of classes :\mathfrak\mathfrak = (G \mid G \text N \in \mathfrak \text G/N \in \mathfrak) This construction allows us to recursively define the power of a class by setting :\mathfrak^0 = (1) and \mathfrak^n = \mathfrak^\mathfrak It must be remarked that this binary operation on the class of classes of groups is neither associative nor
commutative In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name of ...
. For instance, consider the
alternating group In mathematics, an alternating group is the group of even permutations of a finite set. The alternating group on a set of elements is called the alternating group of degree , or the alternating group on letters and denoted by or Basic pr ...
of degree 4 (and order 12); this group belongs to the class (\mathfrak\mathfrak)\mathfrak because it has as a
subgroup In group theory, a branch of mathematics, given a group ''G'' under a binary operation ∗, a subset ''H'' of ''G'' is called a subgroup of ''G'' if ''H'' also forms a group under the operation ∗. More precisely, ''H'' is a subgroup ...
the group V_4 which belongs to \mathfrak\mathfrak and furthermore A_4/V_4\cong C_3 which is in \mathfrak. However A_4 has no
non-trivial In mathematics, the adjective trivial is often used to refer to a claim or a case which can be readily obtained from context, or an object which possesses a simple structure (e.g., groups, topological spaces). The noun triviality usually refers to a ...
normal Normal(s) or The Normal(s) may refer to: Film and television * ''Normal'' (2003 film), starring Jessica Lange and Tom Wilkinson * ''Normal'' (2007 film), starring Carrie-Anne Moss, Kevin Zegers, Callum Keith Rennie, and Andrew Airlie * ''Norma ...
cyclic subgroup, so A_4\not\in\mathfrak(\mathfrak\mathfrak). Then \mathfrak(\mathfrak\mathfrak)\not=(\mathfrak\mathfrak)\mathfrak. However it is straightforward from the definition that for any three classes of groups \mathfrak, \mathfrak, and \mathfrak, :\mathfrak(\mathfrak\mathfrak)\subseteq(\mathfrak\mathfrak)\mathfrak


Class maps and closure operations

A class map c is a map which assigns a class of groups \mathfrak to another class of groups c\mathfrak. A class map is said to be a closure operation if it satisfies the next properties: # c is expansive: \mathfrak\subseteq c\mathfrak # c is
idempotent Idempotence (, ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of pl ...
: c\mathfrak=c(c\mathfrak) # c is monotonic: If \mathfrak\subseteq\mathfrak then c\mathfrak\subseteq c\mathfrak Some of the most common examples of closure operations are: * S\mathfrak = (G \mid G\leq H, \ H\in\mathfrak) * Q\mathfrak = (G \mid \textH\in\mathfrak \text H \text G) * N_0\mathfrak = (G \mid \textK_i\ (i=1,\cdots,r)\textG\textK_i \in \mathfrak\textG = \langle K_1,\cdots,K_r\rangle) * R_0\mathfrak = (G \mid \textN_i\ (i=1,\cdots,r)\textG\textG/N_i \in \mathfrak\text\bigcap\limits_^rNi=1) * S_n\mathfrak = (G \mid G\text H \text H \in \mathfrak)


References

* *{{Citation , last1=Doerk , first1=Klaus , last2=Hawkes , first2=Trevor , title=Finite soluble groups , url=https://books.google.com/books?id=E7iL1eWB1TkC , publisher=Walter de Gruyter & Co. , location=Berlin , series=de Gruyter Expositions in Mathematics , isbn=978-3-11-012892-5 , mr=1169099 , year=1992 , volume=4


See also

Formation Properties of groups Group theory Algebraic structures