For a normal subgroup of , each is a group automorphism of . Its inverse is , but the dependence on is a group antihomomorphism under ordinary function composition, because . The assignment instead is a group homomorphism to the automorphism group. Equivalently the first convention is a right group action, while the second is a left group action.
A right-topological semigroup is a semigroup with a topology such that, for each fixed , the right translation is a continuous map. The varying input is on the left. Requiring instead gives a left-topological semigroup; requiring multiplication jointly continuous gives a topological semigroup.
For a one-sided example, take all functions with function composition and the product topology, so convergence is pointwise convergence. For fixed , the map is continuous because its value at is the evaluation of at the fixed point .
Left composition can fail to be continuous. Let for and zero otherwise, and let be constant . Then converges pointwise to the zero function, but is constantly one while is constantly zero. Thus right-translation continuity alone does not imply continuity of the other translations.
Ring Created 2026-09-24 Updated 2026-10-14
A ring is a set with two binary operations, addition and multiplication, satisfying three requirements. Under addition, is an abelian group: there is a zero, every element has an inverse element, and grouping or exchanging summands does not change the result. Multiplication is associative and has an identity element , so and . Finally, both versions of the distributive property hold:
Here every ring is unital, but the zero ring, with , is allowed. Commutativity of multiplication is an additional condition defining a commutative ring. These conventions agree with [ref].
The integers form a ring with their usual operations. The polynomial ring is another: addition combines coefficients, while multiplication uses the distributive property. For example,
The same rules justify symbolic calculations in both rings; this is why one definition can organize apparently different kinds of arithmetic. In every ring, , and . The first identity follows by distributing and subtracting ; the second follows by distributing . Thus familiar sign rules are consequences of the structure.
Order still matters in some rings. In the matrix ring , take
Then matrix multiplication gives
Nevertheless, matrix multiplication is associative, distributes over addition, and has the identity matrix as its identity element. This is a valid ring. On a column vector, applies first and second: swapping coordinates before discarding the second coordinate differs from doing those actions in reverse. The failure of commutativity records a meaningful difference in function composition.
Figure 1.
Two orders of matrix multiplication give different outputs on the same vector
. Details.
Sign homomorphism Created 2026-09-24 Updated 2026-11-05
The sign homomorphism sends an even permutation to and an odd permutation to ; its kernel is the alternating group.
A symmetric group is the group of all bijections from a set to itself, with function composition as its operation.
Special Euclidean group 2026-10-25
The group of Euclidean isometries preserving orientation of . Its elements have the form , with in the special orthogonal group and . The function composition law is , the identity element is , and the inverse element is . These formulas prove closure and inverses; function composition supplies associativity. For , is a planar rotation.
Symmetric group Created 2026-09-24 Updated 2026-11-05
The symmetric group is the group of all bijections of an -element set, with multiplication given by function composition. There are such permutations, since one chooses the images successively in ways.
For , composition is not commutative: but the reversed product is , applying the rightmost permutation first. Every permutation decomposes into disjoint cycles and into transpositions. By Cayley's theorem, every finite group embeds in some symmetric group, so permutation actions provide a universal concrete model of finite group operations.
Symmetry group Created 2026-10-14 Updated 2026-10-14
A symmetry group collects bijections of an object to itself that preserve a specified structure in both directions, with function composition as the operation. For a geometric object one may require Euclidean distances to be preserved, giving an isometry group; for a graph, one preserves adjacency, giving a graph automorphism group. For an unstructured finite set, every permutation is allowed. The structure to be preserved is part of the definition.
For a square with its usual geometric structure, the symmetry group consists of four rotations and four reflections. These form the dihedral group of group order eight. The existing group action example shows how its eight elements move the vertices of a polygon; changing the object to its edges or a marked configuration changes the group action being studied.[ref]
Specifying the preserved data makes it possible to test a proposed symmetry exactly. After the preserved data are declared, function composition, the identity map, and inverse maps automatically preserve them too. Symmetry transformations therefore form a group, and questions about equivalent configurations become questions about group orbits, stabilizer subgroups, and group homomorphisms. This supplies reusable mathematics for comparing many different kinds of objects.
For two coordinate charts in a topological atlas, the topological transition map is the homeomorphism
Both domains are open sets in Euclidean space. Function composition gives and wherever all three coordinate charts overlap. These identities express consistency of the coordinate descriptions; imposing smooth functions as the coordinate changes gives a smooth atlas.
Transformation monoid 2026-10-14
A transformation monoid is a collection of self-maps of a fixed set that contains the identity function and is closed under function composition. The associative property comes from function composition. A monoid action describes transformations of a set that obey a monoid's multiplication and identity laws.
Unary operation 2026-11-05
A unary operation on a set is a function taking one input and returning an element of the same set. Examples include the additive inverse on the integers and inversion in a group.
Unary operations can be composed and iterated. The identity function and all maps form a monoid under function composition. For negation, ; for a successor map on the nonnegative integers, iteration instead produces an unbounded sequence.
An operation's identities are extra data. Being unary alone says nothing about injectivity, surjectivity or whether repeated application returns to the starting element.