Abelian group Created 2026-09-24 Updated 2026-11-05
An abelian group is a group whose group operation is commutative: for every . Thus rearranging a finite sequence of operations preserves the result. Associativity already permits changing parentheses; commutativity additionally permits exchanging the elements.
The additive integers, the additive real numbers, and every cyclic group are abelian groups. Additive notation is often convenient: the identity element is written , the inverse element of is , and . It does not force an element to be an ordinary number: in , an element is a pair of binary coordinates, added componentwise modulo two.
Commutativity is useful because an integer linear combination of chosen group elements depends only on their coefficients, rather than on the order in which the operations were performed. The Fundamental theorem of finitely generated abelian groups turns this simplicity into a classification by cyclic groups. However, commutativity does not imply that a single generator of a group suffices: the Klein four-group is the smallest counterexample, as the cyclic group of order four and Klein four-group demonstrate.
Let be distinct prime numbers. Every group of group order is Abelian if and only if does not divide .
For sufficiency, the Sylow theorems make the number of Sylow p-subgroups one of , congruent to one modulo . The divisibility hypothesis excludes both nontrivial choices, so that subgroup is normal. The number of Sylow subgroups for is one of , congruent to one modulo . The choice is impossible because . If divided , primality and would force , hence ; this pair violates the hypothesis. Thus the other Sylow subgroup is normal too. Their intersection is trivial, and their group commutators lie in that intersection, so the group is their direct product of groups. A group of prime-square order is abelian: its nontrivial center of a group is either the whole group or has cyclic quotient, and a cyclic central quotient also forces commutativity. Both factors are therefore abelian.
For necessity, suppose . The multiplicative group of a finite field is cyclic, so contains of order . Let the cyclic group act on the additive group of by mapping its generator to multiplication by . This is a well-defined nontrivial group action, since . The resulting semidirect product has order and is nonabelian, because the generator does not commute with a nonzero field element. Thus a nonabelian group of this order exists exactly when .
Abelian groups as integer modules Created 2026-10-14 Updated 2026-10-25
Every abelian group has exactly one unital module structure over the integers. For , define by adding to itself times, put , and put . The module axioms force this action, so no additional choice is involved. Moreover, every Abelian group homomorphism respects it and is a module homomorphism. See David McKinnon's Modules, the integer-scalar example.
Abelianization of the square symmetry group 2026-10-14
Let denote the dihedral group of group order eight acting on a square. Here the subscript specifies group order; the same group is called in the convention that counts vertices of a polygon, as in the group action example. Let be a counterclockwise quarter-turn rotation and a reflection in a diagonal. ThenProducts act rightmost first. The group commutator of the generators of a group isIt is a half-turn rotation, so forcing and to commute must identify a half-turn with .
More concretely, write each element uniquely as , with and . The functionis a surjective group homomorphism. Indeed, giveswhere the exponents are reduced modulo four and two. Modulo two, and agree, so adds the two coordinates separately. Its group kernel is . Since the target is an abelian group, ; since , also . ThusThe four cosets are , , , and . Each coset forgets the difference of a half-turn. The quotient group still distinguishes rotations from reflections, and even from odd numbers of quarter-turns; the two surviving choices are independent. This is the Klein four-group, rather than the cyclic group , because each nonidentity element squares to the identity element. For the general dihedral group calculation, see Conrad, Dihedral groups I, theorem A.1; that source uses the vertex-count convention and for individual group commutators.
Absolute irreducibility of a group representation Created 2026-10-14 Updated 2026-11-05
A group representation over a field is absolutely irreducible if it remains irreducible after every field extension. For a finite-dimensional representation it is enough to check an algebraic closure. Irreducibility over the original field alone is weaker: the two-dimensional real rotation representation of the cyclic group of order three splits into two lines over the complex numbers.
Addition modulo an integer Created 2026-10-18 Updated 2026-11-05
For an integer , add residue classes by adding their representatives and taking the class modulo . This is well-defined because replacing either representative by a multiple-of- translate changes the sum by a multiple of . The associativity, identity class and inverse are inherited from integer addition. The result is the additive cyclic group .
Additive combinatorics Created 2026-09-24 Updated 2026-10-13
Additive combinatorics studies how the cardinalities and sumset representation functions of sumsets reveal structure in finite sets contained in abelian groups. Write the group operation as addition: the ambient abelian group may be the integers , a finite cyclic group, or another abelian group. The same definitions apply, but the ambient group changes which bounds are possible.
The basic experiment is to add every ordered pair of members of a finite set. The sumset records the distinct answers; the sumset representation function records how often each answer occurs; the additive energy counts coincidences between those answers. An arithmetic progression produces many repeated sums, so its sumset grows slowly and its additive energy is relatively large. The doubling constant measures that growth relative to the original cardinality.
The examples below compare the arithmetic progression with the more spread-out integer set . Their four members give sixteen ordered pairs in each case, but different numbers of distinct sums. This small comparison illustrates the definitions; it does not establish a claim about arbitrarily large sets. For a systematic introduction, see Tao and Vu's author page for Additive Combinatorics, with free sample chapters on sum set estimates and additive geometry.
Adjoining a root by an HNN extension 2026-10-14
To adjoin an th root of , let be the order of a group element and take a cyclic group of order when is finite, or infinite order when has infinite order. In the free product , and have the same order. The HNN extension with therefore embeds its base by Britton's lemma, and satisfies . If , take of order and identify the two trivial subgroups. This is an existence construction, not an algorithm for finding an unknown element order.
Alternating group Created 2026-09-24 Updated 2026-11-05
The alternating group is the subgroup of the symmetric group consisting of even permutations, those expressible as an even number of transpositions. It is the kernel of the sign homomorphism , so it is a normal subgroup and has order for .
A three-cycle is even because , and three-cycles generate . For example, is a cyclic group of order three. For , is a nonabelian simple group, a central family in finite group theory and the obstruction behind the general unsolvability of polynomial equations by radicals.
Artin induction 2026-10-14
Every complex character of a representation of a finite group is a rational linear combination of characters of induced representations from one-dimensional group representations of cyclic subgroups . One-dimensionality follows because the irreducible representations of a finite cyclic group over the complex numbers are one-dimensional. The rational coefficients distinguish this statement from Brauer induction, which permits integer coefficients by allowing more general subgroups. For a rational-valued character, another form of Artin induction uses rational combinations of induced representations of trivial group representations of cyclic subgroups.
An opposite-vertex line in the full octahedral symmetry group is an unoriented coordinate axis. Its stabilizer subgroup has the block form , where is a signed two-dimensional permutation matrix and . The eight possibilities for form the dihedral group of a square, of order eight; the independent axial sign gives a cyclic group of order two. Thus the stabilizer is their direct product, of order sixteen. It is larger than the stabilizer of an individual vertex, because exchanging the two endpoints still fixes the line.
Brauer induction Created 2026-10-14 Updated 2026-11-05
Every complex character of a representation of a finite group is an integer linear combination of characters of induced representations from one-dimensional group representations of subgroups . Negative coefficients are allowed. Unlike Artin induction, the subgroups need not be cyclic groups. Applied to an Artin L-function, compatibility with induced representations turns this character identity into a product of one-dimensional Artin L-functions with integer exponents, reducing the behavior at to abelian extensions.
Breuillard-Green-Tao structure theorem for approximate groups Created 2026-10-03 Updated 2026-11-05
For every finite -approximate group in a group , there are subgroups such that , the quotient group is nilpotent of class , and is contained in the union of left cosets of .
The structural subgroup may equal . For example, if is a cyclic group of large prime order, then is a -approximate group. Its only proper subgroup is trivial, so a bounded number of cosets of a proper subgroup cannot cover uniformly in the prime. The full structure theorem provides finer nilpotent progression control; the statement here records its quotient-and-covering consequence.
Carmichael function Created 2026-09-24 Updated 2026-10-20
For an integer , the Carmichael function is the exponent of a finite group for the unit group : the least positive integer for whichHere the greatest common divisor condition selects the units. Euler's totient function counts them; the Carmichael function gives their least common return exponent.[ref]
Modulo eight, the units are , and their squares are all congruent to one. Their multiplicative orders are , so although . Modulo fifteen, the units have multiplicative orders . For example, the powers of two return through . Thus although ; the multiplicative order of four is only two.
The three quantities are related byA common return exponent must be a multiple of every multiplicative order, hence of their least common multiple. Conversely, that least common multiple makes every unit return to one. Lagrange's theorem makes each multiplicative order divide the group order , proving the final divisibility. The Carmichael function applies to all units at once, while the multiplicative order concerns a chosen unit.
For the prime factorization with distinct prime numbers and , the formulas areThese are least common multiples, rather than products: . The convention handles the trivial case separately.[ref]
The Chinese remainder theorem for unit groups explains the least common multiple: a power returns to one in every prime power component exactly when it is a multiple of each component's exponent of a finite group. For an odd prime power, the unit group is a cyclic group of group order . For , the unit group modulo is a direct product of groups , generated by the classes of and five, so its exponent of a finite group is .[ref]
A Computational Introduction to Number Theory and Algebra by Victor Shoup. Section 7.5, pp. 203–205, Theorem 7.28 and its proof
This gives a uniform reduction for modular exponentiation: for a unit and a nonnegative integer , reduce modulo . For example, because . The unit hypothesis matters: , but . Computing the formula assumes the prime factorization is available. The same common-exponent viewpoint explains Carmichael numbers: a composite number passes the Fermat primality test for every unit base exactly when . For example, .
Cauchy theorem for groups Created 2026-09-24 Updated 2026-11-05
Cayley's theorem 2026-10-14
Every group is isomorphic to a subgroup of the symmetric group on its underlying set. The construction uses the left regular action: each group element becomes a permutation of all the group elements, given byFor a finite group of group order , labeling these elements by gives a group embedding into . The same construction works for an infinite group, with the symmetric group of all bijections of its underlying set.[ref]
Group Theory (v4.01) by James S. Milne. Theorem 1.22 and Corollary 1.23, printed page 16: left multiplication embeds a group into its symmetric group
The beauty is that the multiplication rule itself supplies a concrete model. Whatever the group elements originally represent, each one rearranges the entire group by multiplication. A product becomes function composition, and no distinctions between group elements are lost. For a finite group, a row of its Cayley table lists the images under one : the multiplication table is already a catalogue of permutations.
Throughout this construction, products of permutations act rightmost first:Thus first multiplies by , then by . This is a left group action, not a license to reverse the multiplication order in a nonabelian group. Ordinary right multiplication instead satisfies with this convention; replacing it by restores the group homomorphism law.[ref]
Group Actions by Keith Conrad. Example 2.10, printed page 7: left multiplication and the reversed composition law for right multiplication
For an explicit cyclic group example, take under addition, using modular arithmetic. Its left regular action consists of . In permutation cycles on the labels ,The function composition sends to , to , to , and to : squaring the four-point permutation cycle produces two disjoint permutation cycles. Also . These four permutations form a cyclic subgroup of , reproducing addition in exactly.
For a nonabelian group example, let , with , , and its identity element. The six group elements are , where and . Now the labels being permuted are themselves permutations of three points. Computing the left regular action gives permutations of these six labels:For example, ; putting here would accidentally switch to right multiplication. Noncommutativity survives in the model:These different outputs prove that . The group generators become group generators of a six-element subgroup of .
Why does a group action here produce a group embedding? Any group action on a set gives a group homomorphism ; it is a group embedding precisely when it is a faithful group action. The group kernel consists of the group elements fixing every point of . In the left regular action, , so fixing the identity element already forces . In fact every stabilizer subgroup is trivial, since forces ; this stronger property makes the left regular action a regular group action.[ref]
Compare two group actions of the same cyclic group . Its left regular action on four labels distinguishes all four group elements. On , the rule defines a transitive group action, but and both fix both points, while and both exchange them. Its group kernel is , so it is not a faithful group action. Its image is a two-element subgroup of , isomorphic to the quotient group rather than to .
The guaranteed number of labels need not be the smallest possible for a faithful group action. The symmetric group naturally acts faithfully on : a permutation fixing all three labels is the identity element. Its left regular action uses six labels instead. Three is the smallest possible here, since and have fewer than six elements and cannot contain an isomorphic copy of . Moreover, in the natural three-point group action, the stabilizer subgroup of is : a faithful group action can have nontrivial point stabilizer subgroups. Cayley's construction supplies a universal model, while a smaller model can reveal particular symmetries.
The proof is short. Each is a bijection with inverse . Associativity givesso is a group homomorphism. If , evaluating both at the identity element gives . Hence is injective, and its image is the required isomorphic subgroup. No finiteness assumption entered the argument.
The historical connection is unusually close to the notation. The opening paragraph of Arthur Cayley's 1854 paper already treats permutations as one example of operations on a collection of quantities and explicitly performs the rightmost operation first in a product. It also allows noncommutativity while insisting on associativity. The modern left regular action shows how that viewpoint reaches every abstract group, by choosing the group itself as the set to be acted on.[ref]
Abstract awakenings in algebra: Early group theory in the works of Lagrange, Cauchy, and Cayley by Janet Heine Barnett. Abstract awakenings in algebra: Early group theory in the works of Lagrange, Cauchy, and Cayley by Janet Heine Barnett, Section 3.1, printed page 50: reproduced opening paragraph of Arthur Cayley's On the theory of groups, as depending on the symbolic equation theta^n = 1; reference 5, printed page 91: original publication in 1854
Centralizer and normalizer Created 2026-09-24 Updated 2026-10-14
Both constructions are stabilizer subgroups for the conjugation action. The centralizer fixes an individual element ; the normalizer preserves a subgroup as a whole, while possibly moving its elements. The centralizer of a subset fixes every member of individually, soFor a cyclic subgroup , commuting with the group generator is equivalent to commuting with all its powers, giving .
In the symmetric group , let and . ThenEvery transposition sends to under conjugation. In particular, for ,Thus belongs to the normalizer of but not to the centralizer of . Preserving the collection of powers allows the two possible directions of its group generator to be exchanged.
This distinction lets one ask separately which operations leave a chosen operation unchanged and which operations preserve the subgroup it generates. The normalizer also supplies a group homomorphism to the automorphism group of , by ; its group kernel is . In this example the group homomorphism has two possible outputs, fixing or replacing it by . The quotient group is therefore a cyclic group of group order two. Milne develops the normalizer as a stabilizer subgroup in Group Theory (v4.01) by James S. Milne.
Classification of groups of order ten 2026-10-14
A group of order ten is either a cyclic group or the dihedral group of the pentagon. Lagrange's theorem and the fact that a group of exponent two has power-of-two order force an element of order five or ten. In the latter case the group is cyclic. In the former case its order-five cyclic subgroup is normal by index two; an outside involution acts on it either trivially or by inversion. The trivial action gives , and inversion gives .
The alternating resolution maps and for a cyclic group become zero after applying homomorphisms to its trivial prime field module. Thus there is one class in every degree. A two-step shift of the resolution represents a degree-two periodicity class . For odd , a degree-one class squares to zero by graded commutativity, andOne can take for the Bockstein homomorphism. For the two maps agree over , so a one-step shift gives with . The Künneth theorem then gives dimension in degree for , obstructing periodic group cohomology and hence such a free sphere action.
Coloring bracelet Created 2026-09-29 Updated 2026-10-14
A coloring bracelet also identifies colorings related by reflection, so it is an orbit under a dihedral group rather than only a cyclic group.




