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.
In the Heisenberg group over a commutative ring with , the subset is an Abelian subgroup of group order 16. Its product has central coordinate , symmetric in the two factors. Its inverse element is . The map is a surjective group homomorphism to the additive group of , with kernel of a group homomorphism . Thus is a normal subgroup and has four cosets in the 64-element group.
Unlike the odd-prime case, division by two is unavailable. In fact take and . Then , where the binomial coefficient is computed as an integer before reduction modulo four. Hence and has element order eight. The element has element order two and is not a power of : the powers with outer coordinates two have central coordinates one or three. Their generated subgroups intersect trivially, so the 16-element Abelian group is the direct product of groups .
Abstract algebra Created 2026-10-24 Updated 2026-11-05
Abstract algebra studies algebraic structures through their operations and axioms, including groups, rings, fields, and modules. Instead of proving a calculation separately for every example, it identifies which structural properties make the argument work.
For instance, a group can consist of permutations, spatial symmetries, or invertible matrices. A result using only associativity, an identity element, and inverse elements applies to all three. Homomorphisms compare structures by preserving their operations, while quotient structures encode relations and identify elements in a controlled way.
Additive group of integers Created 2026-10-20 Updated 2026-11-05
The integers form an infinite cyclic group under addition, with identity element zero and inverse element for . Its two generators are and . Every subgroup is for a unique nonnegative integer : if it is nonzero, take its least positive element and use division with remainder to show that every element is a multiple of it. The zero subgroup corresponds to .
Algebra Created 2026-09-24 Updated 2026-10-13
Algebra studies equations, algebraic operations, and the structures that make their rules work. Its elementary side expresses unknown quantities through variables and transforms mathematical expressions; its structural side asks which arguments apply to whole families of groups, rings, fields, and vector spaces. The useful step is identifying exactly which properties a calculation needs, so that it can be reused in a new setting.
For example, the polynomial equation over the real numbers factors as , giving roots and . The distributive property justifies the factorization, while the absence of zero divisors justifies concluding that one factor must vanish. Over the finite field , the same integer coefficients reduce to , with roots and . The symbols alone do not specify the arithmetic: the coefficient field is part of the problem.
In a ring with zero divisors, a familiar step can fail. Modulo , all four residue classes satisfy . For , the factorization holds modulo , yet neither factor is zero. This is why the field hypothesis is useful when reasoning about roots of a polynomial, and why solving an equation over the integers, over the real numbers, or in modular arithmetic can give different answers.
The structure is also useful beyond scalar arithmetic. Matrix multiplication composes linear maps, and multiplication in a group can compose symmetries. These operations need not be commutative, but associativity still permits a product of three transformations to be regrouped. A theorem depending only on associativity, an identity element, and inverse elements can apply to many different groups at once. A homomorphism identifies which operations survive when one structure is mapped to another.
Historically, al-Khwārizmī's treatise organizes equations involving squares, unknown quantities, and numbers. Frederic Rosen's 1831 English translation includes the calculation now written and geometric explanations for completing the square. In modern notation, gives or ; the historical treatment seeks the positive quantity . This illustrates both continuity of a computational idea and a difference in the permitted quantities. [ref]
Automorphism Created 2026-09-24 Updated 2026-10-14
An automorphism is an isomorphism : a structure-preserving self-map that can be undone by another structure-preserving self-map. Equivalently, it is an invertible endomorphism. Its inverse satisfies
where is the identity morphism. Both maps must be morphisms in the chosen category. For ordinary groups, rings, and vector spaces over a fixed field, a bijective morphism automatically has a compatible inverse. For topological spaces, an automorphism is a homeomorphism from the space to itself: a continuous bijection needs a continuous inverse as well. See Riehl, Category Theory in Context, Definition 1.1.10 and Example 1.1.11.
For example, is an automorphism of the vector space over the real numbers, with inverse . Both are linear maps. The linear endomorphism from endomorphism preserves addition and scalar multiplication too, but discards a coordinate and cannot be undone. Preserving the structure and preserving enough information for reversal are separate requirements.
The automorphisms of a fixed object in a locally small category form a group under composition in a category: the identity morphism is the identity element, and the inverse element of a composite reverses the order of its factors. This makes reversible internal changes calculable. For a group, the resulting automorphism group records which relabelings preserve all products; the examples in group automorphism show how restrictive that condition can be.
Cancellation law Created 2026-10-25 Updated 2026-11-05
A binary operation has left cancellation when implies , and right cancellation when implies . The common factor must be in the same position in the two expressions. A group has both laws: multiplying by the inverse element on the appropriate side removes that factor.
Cancellation does not itself require inverse elements. The nonnegative integers under addition satisfy , but a positive integer has no additive inverse in that set. Conversely, matrix multiplication need not allow cancellation: a zero matrix multiplied by different matrices gives the same zero matrix. The finite cancellative semigroup theorem explains why adding finiteness and the associative property changes the conclusion.
Cayley graph Created 2026-09-24 Updated 2026-10-14
A Cayley graph turns multiplication in a group into travel: the chosen generators of a group are the allowed one-step moves, and a word over an alphabet becomes a route. This lets us study a finitely generated group using graph distances, closed balls, and geodesics, rather than only equations between products.
Let be a group with a finite generating set of a group satisfying and . Such a symmetric subset of a group includes the inverse element of every allowed move. The Cayley graph has vertex set and joins to for each . We choose right multiplication for these moves. Reversing the move uses , so for graph distance we regard and as the two orientations of one undirected edge. An involution therefore gives one edge, not two parallel edges. Each edge has length one, regardless of its length in a drawing.[ref]
A sequence labels the walk
It ends at exactly when . Thus the Cayley graph is a connected graph precisely because generates , and its graph distance on vertices is the word metric. Left multiplication by sends the edge from to to the edge from to , preserving its generator label: this is a group action by graph automorphisms and isometries. Viewing groups as symmetries of geometric objects is the motivation of Clay and Margalit's introduction.[ref]
The useful geometric object includes its allowed moves, not just its drawing. Cayley graphs of the integers show how changing the moves adds shortcuts; word metric balls in the integer lattice show how the same group can acquire visibly different closed balls. Meier's book develops this passage from group operations to graphs as its central motivation.[ref]
Centralizer Created 2026-09-24 Updated 2026-10-14
The centralizer of an element of a group consists of all elements that commute with :
It is the stabilizer subgroup of under the conjugation action, hence a subgroup of . In conjugacy classes of the symmetric group on three letters, the three representative computations are
For the transposition , a commuting permutation must preserve the exchanged pair and fix ; only and do so. For , a commuting permutation is determined by where it sends : the equation forces the images of and , leaving exactly . For , every permutation commutes. These centralizer sizes give conjugacy class sizes .
The centralizer is useful because it measures how much freedom remains after fixing one operation. Its index of a subgroup counts the distinct results of conjugation, and the intersection of all element centralizers is the center of a group. A centralizer need not be an abelian group: even when is a nonabelian group. In an abelian group, all element centralizers equal . These observations also explain why the surrounding group matters: the centralizer of inside the alternating group is the whole , whereas its centralizer inside is a proper subgroup. See McKernan, the centralizer definition preceding lemma 23.6.
For an arbitrary subset , the centralizer of a subset fixes every element of individually under the conjugation action:
This is a pointwise stabilizer of the elements of , not of the vertices of a polygon in a geometric realization. In particular, belongs to although its rotation moves every vertex of a polygon of the equilateral triangle. If generates a subgroup , commuting with every element of implies commuting with every product of those elements and their inverse elements; hence . For the triangle rotation subgroup , this gives .
To see the commutation test directly on the equilateral triangle, compare a rotation with the reflection . Their permutations satisfy
The two orders send vertex of a polygon to different places: , but . Thus . By contrast and commute, with . The reflection reverses the chosen rotation while preserving the subgroup of all triangle rotations, so . The distinction is visible before any counting: commuting preserves an operation itself; membership in the normalizer permits exchanging it with another operation in the same subgroup.
Figure 1.
Commuting triangle rotations and noncommuting rotation–reflection products
. Colored labels track the original vertices of a polygon. Products act from right to left. The top row gives the same labeled triangle for and ; the bottom row gives different labeled triangles for and . All six permutations in are included in the centralizer and normalizer membership table. Details.
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, so
For a cyclic subgroup , commuting with the group generator is equivalent to commuting with all its powers, giving .
In the symmetric group , let and . Then
Every 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.
Figure 1.
The centralizer fixes , while the normalizer preserves and may exchange with its inverse element
. Details.
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.
Commutator subgroup Created 2026-09-24 Updated 2026-10-14
The commutator subgroup of a group is the subgroup generated by all its group commutators:
Here and throughout, . A group commutator is the identity element precisely when and commute. The generated subgroup includes finite products of group commutators and their inverse elements; an element of need not itself be a single group commutator. Thus precisely when is an abelian group.
The useful idea is to record exactly what must disappear to make multiplication commutative. The identity shows how a group commutator corrects a change in multiplication order. Setting every such correction equal to produces the abelianization , while preserving every piece of information that a group homomorphism to an abelian group can detect. This connects a local comparison of two operations to a canonical quotient group of the whole group.
The commutator subgroup is a characteristic subgroup, hence a normal subgroup: a group automorphism sends to . For any normal subgroup ,
Indeed, the group commutator of and is . This makes the smallest normal subgroup whose quotient group is an abelian group. See Conrad, Subgroup series I, section 4: commutators and abelian quotients.
Cyclic group Created 2026-09-24 Updated 2026-10-14
A cyclic group is a group that can be generated by repeating a single group element and its inverse element:
For an additive group, the same expression is written : means repeated addition, including subtraction when is negative. A finite cyclic group has a repeating cycle, while an infinite cyclic group is isomorphic to the additive integers. The notation refers to a finite cyclic group of order .
This definition compresses a whole composition rule into one repeatable operation. Once is chosen, , so working with group elements becomes working with integer exponents. In the finite case those exponents are reduced using modular arithmetic. It also proves that every cyclic group is an abelian group, because . A finite cyclic group of order has exactly solutions of for every positive integer divisor of : in exponents, has exactly solutions modulo . The standard finite and infinite models are described in Group Theory (v4.01) by James S. Milne (section 1.16).
Cyclic group of order four and Klein four-group Created 2026-10-14 Updated 2026-10-31
The finite cyclic group and the Klein four-group are both abelian groups of order four. In , composition is addition modulo four. In , label the elements and add each coordinate modulo two. For example, and .
Figure 1.
Two abelian groups of order four have different addition tables
. Each cell is the row element plus the column element. Diagonal cells record adding an element to itself. In , only and return to zero after two additions. In the Klein four-group, every diagonal cell is the identity element . The symmetric tables show commutativity, while the different doubling behavior distinguishes the groups. Details.
The order of a group element is preserved by a group isomorphism: an equation holds exactly when its image satisfies the same equation. In , both and have order four. In , each nonidentity element has order two. Hence these groups are not isomorphic, despite having the same order of a finite group. No relabelling can repair this discrepancy.
For a geometric model of , take the symmetries of a non-square rectangle: the identity element, reflection in its horizontal axis, reflection in its vertical axis, and rotation through . The two reflections commute, and their composite is the half-turn. Every nonidentity motion is its own inverse element. This makes the two binary switches concrete: choosing whether to apply each reflection specifies all four motions. The case of abelian groups of prime-square order generalizes this distinction from to any prime .
Direct product of groups Created 2026-09-24 Updated 2026-10-20
A direct product combines two groups into one while keeping their operations in separate coordinates. Its underlying set is the Cartesian product , and its group operation is
The identity element is , and the inverse element of is . Associativity follows coordinate by coordinate. For finite groups, the multiplication principle gives .
For example, write the cyclic group as the additive group of residue classes modulo . In ,
since each coordinate reduces with its own integer modulus. A pair can track two cyclic counters that advance independently. Updating the first coordinate does not alter the second, and vice versa.
This independence has an algebraic form. The embedded factor elements always commute:
The coordinate maps and are group homomorphisms, so one can analyze either component separately. This does not make the full product an abelian group when one of its factors is nonabelian: two arbitrary pairs need not commute.
The construction is useful in both directions. It builds a larger group from familiar pieces, while the internal direct product theorem recognizes when an existing group can be separated into such pieces. A cyclic group can sometimes be split this way; whether two finite cyclic factors combine into one cyclic group is decided by the cyclicity of a product of two finite cyclic groups. Definitions and the basic recognition theorems are developed in Thomas Judson, Abstract Algebra: Theory and Applications, §9.2, Direct Products.
Exponentiation by squaring Created 2026-10-03 Updated 2026-10-20
Exponentiation by squaring computes an integer power by reading the exponent's binary expansion. Appending a binary digit to a prefix of value replaces by , so the corresponding power changes by
Each new digit requires one squaring and, only for digit one, one further multiplication. The number of digits grows with the logarithm of the exponent, making this useful for modular exponentiation, primality testing, and powers of matrices using matrix multiplication.[ref]
For a concrete calculation, , so . The optimized left-to-right algorithm used here instead keeps one accumulated power: initialize from the leading digit one, then process only the remaining digits :
Thus , using three squarings and two further multiplications, instead of twelve successive multiplications starting at .
Figure 1.
Reading the same binary expansion computes and
. Each appended binary digit changes the prefix value by . The ordinary-power row grows to ; the modular exponentiation row stores only remainders . Both traces use three squarings and two further multiplications. Details.
For a general positive integer with leading digit , set and, for , first replace by , then multiply it by if . Return . This explicitly skips the leading digit's otherwise unnecessary operations on one. A Computational Introduction to Number Theory and Algebra by Victor Shoup (Section 3.4, pp. 65–66) presents the version initialized at one and processing every digit; the optimization here makes the counting convention unambiguous.
The loop invariant is , where is the value of the digits already read. Initially and . If the next digit is , then squaring and optionally multiplying give , exactly the next prefix. At termination . This proof uses associativity of multiplication; it works in any monoid, including matrices with the identity matrix as identity element, and needs no commutativity between different bases.
For , return the identity element without performing a multiplication. This is the empty-product convention ; if , the algorithm therefore returns one for by convention, rather than resolving its meaning in every mathematical setting. Negative integer exponents require an inverse element: compute , counting the inversion separately. Over the integers, such an inverse generally leaves the integers, and a zero base has no inverse.
Finite additive group Created 2026-09-24 Updated 2026-10-03
A finite additive group is a finite group whose operation is written as addition. Its identity element is denoted , the inverse element of is denoted , and translation is a bijection.
A nonempty finite set with an associative binary operation satisfying both cancellation laws is a group. For fixed , cancellation makes and injective, hence surjective. Choose with . Then gives , and gives . Choose ; associativity gives , so has a two-sided inverse element.
Finite cyclic group Created 2026-09-24 Updated 2026-10-14
A finite cyclic group of order is isomorphic to the additive group . The group isomorphism sends the congruence class of to , where is a chosen generator of a group. For , the identity element is , modulo six, and the inverse element of is .
One finite cyclic group can have several choices of generator of a group. Adding visits all six elements before returning to zero; adding also visits all six, in the reverse order. Adding reaches only from zero, and adding reaches only . The following permutations of the six elements show what each repeated step can reach.
Figure 1.
Repeated addition modulo six: one cycle, two cycles, or three cycles
. Each arrow applies modulo six. The panels use . Colors distinguish the separate cycles; only the cycle containing zero is the cyclic subgroup generated by . For , the other cycle is the coset ; for , the other two cycles are its other cosets. Details.
This gives a precise version of a familiar scheduling question: does a fixed step visit every position, or repeatedly miss some? The generators of a finite cyclic group are exactly the steps coprime to the total number of positions. Changing the step changes the orbit through the same underlying group; the diagram does not replace its group operation with a different one.
Free monoid Created 2026-10-03 Updated 2026-10-14
The free monoid on an alphabet consists of all finite words over an alphabet, including the empty word , with concatenation as its binary operation. Distinct strings represent distinct elements: there are no imposed equalities between different sequences of letters. The empty word is its identity element, and concatenation has the associative property.[ref]
For , the elements begin . Both and give the same word , but , so this monoid is not commutative. The length of a word over an alphabet obeys ; it is a monoid homomorphism to the nonnegative integers with addition. A nonempty word has no inverse element, since joining it to any other word cannot decrease its length to zero.
The defining benefit of being free is that letters can stand for arbitrary elements of another monoid. Choose a value for each letter ; then , with , is the unique monoid homomorphism extending those choices. Associativity and the identity element make this evaluation consistent for every finite word. For example, interpreting the letters as self-maps evaluates a word as a composed transformation; interpreting them as nonnegative counts evaluates it by addition.
The full transformation monoid consists of every self-map of , with function composition as its binary operation. For , there are four functions: the identity function , the swap , and the constant functions . Their composition order matters: , whereas . Thus associativity does not imply commutativity.
Figure 1. . The arrow diagrams show each function. The Cayley table reads row , column as , applying first. Only and have inverse elements. The constant functions lose information and satisfy idempotence. Details.
Only and are bijections, and their inverse elements are themselves. They form a two-element group within this monoid. The constant functions instead satisfy and , so they are idempotent elements of a semigroup. Such irreversible transformations explain why the monoid setting is useful even when a group would be too restrictive.