A group is a set equipped with a binary operation satisfying the group axioms: closure; associativity, ; an identity element with ; and an inverse element for every , with .
A subgroup is a subset that is a group under the restricted operation. Equivalently, it is nonempty and contains whenever . A generating set of a group is a set whose elements and inverses can be multiplied in finite words to produce every group element.
The group order is its number of elements, . The order of a group element is the least positive integer with , or infinity if there is none. Lagrange's theorem states that for a finite group and subgroup , divides and . In particular, every finite element order divides the group order.
A cyclic group is generated by one element, so every element is a power of that generator. A group isomorphism is a bijective group homomorphism: a bijection satisfying for all .
By Lagrange's theorem, the possible values of the order of a group element are
These are possibilities across groups of order eight; they need not all occur in one group.
If every element has order at most two, every element equals its own inverse. Thus for any ,
so is an abelian group. Choose , and then . The four elements are distinct and form a subgroup : commutativity and prove closure and inverses. Choose . The elements of and are disjoint, since would imply . These two four-element sets therefore exhaust .
Every element consequently has a unique expression , with . The map from triples to these products is bijective and respects multiplication by addition of exponents modulo two. Hence
a direct product of groups and an elementary abelian group.
The cyclic subgroup has order four and index two. Every index-two subgroup is normal: its complement is both the only nontrivial left coset and the only nontrivial right coset. Thus conjugation by is an automorphism of . It must send its generator to another element of order four, namely or . Since ,
equivalently or , as required. Also , since otherwise could generate at most four elements.
In the commuting case, every word reduces uniquely to with and . The eight expressions are distinct because and are disjoint. Multiplication is addition of the two exponents modulo four and two, respectively. Therefore
This gives the multiplication table independently of any other properties of , proving uniqueness up to group isomorphism.
In the inversion case, the relation gives the same eight unique normal forms, now with multiplication
with exponents reduced modulo four and two. Thus this case also has a uniquely determined group structure. A faithful geometric realization is the dihedral group of a square, with a quarter-turn and a reflection in a line through opposite edge midpoints. For example, on the plane,
These preserve the square with vertices and satisfy , . They generate eight distinct transformations, so
No. The quaternion group
is another non-abelian group of order eight: for example while . Its multiplication comes from the associative quaternion algebra, so it does define a group.
It is not isomorphic to the dihedral group of the square. In , only has order two; the six elements have order four. The square's dihedral group has five elements of order two: four reflections and the half-turn. Group isomorphisms preserve element orders, so these groups are distinct. The hypothesis in part (c) excludes , since its only element of order two is already in each cyclic subgroup of order four.

Articles by others on the same topic (0)

There are currently no matching articles.