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 .
Finitely generated group
If is finite, then a group is called finitely generated. The structure of finitely generated abelian groups in particular is easily described.
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.
The student who follows this course will get acquainted with computational tools used to analyze systems with uncertainty arising in engineering, physics, chemistry, and economics. Focus will be on s
In mathematics, specifically in group theory, the direct product is an operation that takes two groups G and H and constructs a new group, usually denoted G × H. This operation is the group-theoretic analogue of the Cartesian product of sets and is one of several important notions of direct product in mathematics. In the context of abelian groups, the direct product is sometimes referred to as the direct sum, and is denoted .
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 transformations. Important examples of finite groups include cyclic groups and permutation groups. The study of finite groups has been an integral part of group theory since it arose in the 19th century.
In mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power n. Roots of unity are used in many branches of mathematics, and are especially important in number theory, the theory of group characters, and the discrete Fourier transform. Roots of unity can be defined in any field. If the characteristic of the field is zero, the roots are complex numbers that are also algebraic integers.
We investigate generalizations along the lines of the Mordell-Lang conjecture of the author's p-adic formal Manin-Mumford results for n-dimensional p-divisible formal groups F. In particular, given a finitely generated subgroup (sic) of F(Q(p)) and a close ...
SPRINGER INT PUBL AG2023
, , ,
Since the 70s, there has been a growing interest in activity-based modelling. This approach models the need to travel as a result of performing daily activities (Bowman and Ben-Akiva, 2001). Nevertheless, the activities need to be scheduled which involves ...
Before the twentieth century and concrete modernity, it was stone that embodied the “well built”. Could sustainable wood one day replace concrete as the archetypal material? Will it find a place on the scale of values that gives archi- tecture its referenc ...