The 5th roots of unity in the complex plane form a group under multiplication. Each non-identity element generates the group.
In abstract algebra, a generating set of a group is a subset of the group set such that every element of the group can be expressed as a combination (under the group operation) of finitely many elements of the subset and their inverses.
In other words, if is a subset of a group , then , the subgroup generated by , is the smallest subgroup of containing every element of , which is equal to the intersection over all subgroups containing the elements of ; equivalently, is the subgroup of all elements of that can be expressed as the finite product of elements in and their inverses. (Note that inverses are only needed if the group is infinite; in a finite group, the inverse of an element can be expressed as a power of that element.)
If , then we say that generates, and the elements in are called generators or group generators. If is the empty set, then is the trivial group , since we consider the empty product to be the identity.
When there is only a single element in , is usually written as . In this case, is the cyclic subgroup of the powers of , a cyclic group, and we say this group is generated by . Equivalent to saying an element generates a group is saying that equals the entire group . For finite groups, it is also equivalent to saying that has order .
A group may need an infinite number of generators. For example the additive group of rational numbers is not finitely generated. It is generated by the inverses of all the integers, but any finite number of these generators can be removed from the generating set without it ceasing to be a generating set. In a case like this, all the elements in a generating set are nevertheless "non-generating elements", as are in fact all the elements of the whole group − see Frattini subgroup below.
If is a topological group then a subset of is called a set of topological generators if is dense in , i.e. the closure of is the whole group .
and 24 Related for: Generating set of a group information
algebra, ageneratingsetofagroup is a subset of the groupset such that every element of the group can be expressed as a combination (under the group operation)...
constructing expander graphs. Let G {\displaystyle G} be agroup and S {\displaystyle S} be ageneratingsetof G {\displaystyle G} . The Cayley graph Γ = Γ ( G...
Generator matrix, a matrix used in coding theory Generator (category theory) ofa category, in category mathematics Generatingsetofagroup, group generators...
multi-dimensional arrays of numbers. There are various types ofgenerating functions, including ordinary generating functions, exponential generating functions, Lambert...
expressed as a word whose letters come from ageneratingset for the group. The word metric on G is very closely related to the Cayley graph of G: the word...
In mathematics, a partition ofaset is a grouping of its elements into non-empty subsets, in such a way that every element is included in exactly one...
(2p^{k})=p^{k}-p^{k-1}.} By definition, the group is cyclic if and only if it has a generator g (ageneratingset {g} of size one), that is, the powers g 0 ,...
mathematics, a finitely generated module is a module that has a finite generatingset. A finitely generated module over a ring R may also be called a finite...
the commutative ring of p-adic numbers), that is generated by a single element. That is, it is asetof invertible elements with a single associative binary...
their symmetries. The setof symmetries ofa frieze pattern is called a frieze group. Frieze groups are two-dimensional line groups, having repetition in...
symmetric group with the structure ofa Coxeter group (and so also a reflection group). Other possible generatingsets include the setof transpositions...
other liquid fuels or natural gas (CNG). Diesel generatingsets are used in places without connection to a power grid or as an emergency power supply if...
than that of their non-abelian counterparts, and finite abelian groups are very well understood and fully classified. An abelian group is asetA {\displaystyle...
is, the collection of all open sets in X . {\displaystyle X.} There are multiple (non-equivalent) definitions of compactly generated space or k-space in...
groups, and briefly mentioned (on page 274) the group M24, giving its order. In Mathieu (1873) he gave further details, including explicit generating...
involution on A {\displaystyle A} to the group G {\displaystyle G} . If B {\displaystyle B} is another finite generatingset for G {\displaystyle G} , then...
set S generates G, so a boundedly generatedgroup is finitely generated. An equivalent definition can be given in terms of cyclic subgroups. Agroup G...
Global Information
