In abstract algebra, a generating set of a group is a subset that is not contained in any proper subgroup of the group. Equivalently, a generating set of a group is a subset such that every element of the group can be expressed as the combination (under the group operation) of finitely many elements of the subset and their inverses.
More generally, if S is a subset of a group G, then <S>, the subgroup generated by S, is the smallest subgroup of G containing every element of S, meaning the intersection over all subgroups containing the elements of S; equivalently, is the subgroup of all elements of G that can be expressed as the finite product of elements in S and their inverses.
If G = , then we say S generates G; and the elements in S are called generators or group generators. If S is the empty set, then <S> is the trivial group {e}, since we consider the empty product to be the identity.
When there is only a single element x in S, <S> is usually written as <x>. In this case, <x> is the cyclic subgroup of the powers of x, a cyclic group, and we say this group is generated by x. Equivalent to saying an element x generates a group is saying that <x> equals the entire group G. For finite groups, it is also equivalent to saying that x has order |G|.
Read more about Generating Set Of A Group: Finitely Generated Group, Free Group, Frattini Subgroup, Examples
Famous quotes containing the words set and/or group:
“When desire, having rejected reason and overpowered judgment which leads to right, is set in the direction of the pleasure which beauty can inspire, and when again under the influence of its kindred desires it is moved with violent motion towards the beauty of corporeal forms, it acquires a surname from this very violent motion, and is called love.”
—Socrates (469–399 B.C.)
“No group and no government can properly prescribe precisely what should constitute the body of knowledge with which true education is concerned.”
—Franklin D. Roosevelt (1882–1945)