HOME

TheInfoList



OR:

A class of groups is a set-theoretical collection of groups satisfying the property that if ''G'' is in the collection then every group
isomorphic In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between the ...
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 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. Perhaps most familiar as a p ...
). Since
set theory Set theory is the branch of mathematical logic that studies Set (mathematics), 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 mathema ...
does not admit the "set of all groups", it is necessary to work with the more general concept of ''
class Class, Classes, or The Class may refer to: Common uses not otherwise categorized * Class (biology), a taxonomic rank * Class (knowledge representation), a collection of individuals or objects * Class (philosophy), an analytical concept used d ...
''.


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 is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them ...
.


Examples

The most common examples of classes of groups are: * \emptyset: the empty class of groups * \mathfrak~: the class of cyclic groups * \mathfrak~: the class of abelian groups * \mathfrak~: the class of finite supersolvable groups * \mathfrak~: the class of nilpotent groups * \mathfrak~: the class of finite solvable groups * \mathfrak~: the class of finite simple groups * \mathfrak~: the class of
finite group In abstract algebra, a finite group is a group whose underlying set is finite. Finite groups often arise when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving tra ...
s * \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 In mathematics, a binary operation or dyadic operation is a rule for combining two elements (called operands) to produce another element. More formally, a binary operation is an operation of arity two. More specifically, a binary operation ...
on the class of classes of groups is neither
associative In mathematics, the associative property is a property of some binary operations that rearranging the parentheses in an expression will not change the result. In propositional logic, associativity is a valid rule of replacement for express ...
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. Perhaps most familiar as a pr ...
. For instance, consider the
alternating group In mathematics, an alternating group is the Group (mathematics), 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 ...
of degree 4 (and
order Order, ORDER or Orders may refer to: * A socio-political or established or existing order, e.g. World order, Ancien Regime, Pax Britannica * Categorization, the process in which ideas and objects are recognized, differentiated, and understood ...
12); this group belongs to the class (\mathfrak\mathfrak)\mathfrak because it has as a
subgroup In group theory, a branch of mathematics, a subset of a group G is a subgroup of G if the members of that subset form a group with respect to the group operation in G. Formally, given a group (mathematics), group under a binary operation  ...
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 a particularly simple object possessing a given structure (e.g., group, topological space). The noun triviality usual ...
normal 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)


See also

* Formation


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 Properties of groups Group theory Algebraic structures