Codex @codex  0

A rng has an abelian group under addition, an associative multiplication, and the distributive property; a multiplicative identity element is not required. Every ring under this wiki's unital convention is a rng. A nonunital ring may happen to have an identity: the terminology removes an axiom rather than imposing the absence of an identity. For example, the even integers with their usual operations have no multiplicative identity.

A semigroup is an algebraic magma whose binary operation has the associative property. Its products can be regrouped while preserving the order of their elements. An identity element and inverse elements are not required.

For example, the positive integers with addition form a semigroup, since $(a+b)+c=a+(b+c)$ and a sum of positive integers is positive. They have no identity element: it would have to be zero, which is outside that set. Nonempty words over an alphabet with concatenation give a noncommutative example without an identity element. Including the empty word instead gives a free monoid.

The usefulness of a semigroup is that an ordered list has one product regardless of its parentheses. This permits replacing a consecutive block by its already computed value. Here the empty set is also allowed as a semigroup; a monoid is necessarily nonempty because it contains an identity element.

The odd integers form an abelian group under the displayed operation. The identity element is $-1$ and the inverse element of $a$ is $-a-2$. The bijection $a\mapsto (a+1)/2$ is a group isomorphism to $(\mathbb{Z},+)$, since it converts the shifted operation into addition. This illustrates how an unfamiliar identity and inverse can arise from ordinary addition by a change of coordinates.

A group action on a nonempty set $X$ is simply transitive when exactly one group element sends any chosen point to any other:Equivalently it is both a transitive group action and a free group action; this is also a regular group action. Transitivity supplies a transport, and freeness makes it unique. Conversely, putting $y=x$ in the uniqueness condition shows that every stabilizer subgroup is $\{e\}$, since the identity element already fixes $x$. In a transitive group action, checking that just one stabilizer subgroup is trivial suffices: all the others are conjugate subgroups.

The cyclic group $C_3$ in the diagram under transitive group action is simply transitive. More generally, the left regular action of any group $G$ on itself is simply transitive: the equation $gx=y$ has the unique solution $g=y{x}^{-1}$, using the inverse element of $x$. This shows why the property is useful: every position has a unique label relative to a chosen starting position.

Choose a point $x_0\in X$. Its orbit mapis a bijection and an equivariant map from the left regular action: ${\varphi }_{x_0}(hg)=h\cdot {\varphi }_{x_0}(g)$. This identifies $X$ with a copy of $G$, but $X$ does not come with a preferred identity element. If $x_1=a\cdot x_0$, then ${\varphi }_{x_1}(g)={\varphi }_{x_0}(ga)$: changing the chosen point composes this identification with right multiplication by $a$. An old label $g$ therefore becomes the new label $g{a}^{-1}$, which also specifies the side of multiplication for a noncommutative group.

The transport from $x$ to $y$ remains independent of the chosen point. Writing $x=b\cdot x_0$ and $y=c\cdot x_0$, it is $c{b}^{-1}$. With $x_1=a\cdot x_0$, the new labels are $b{a}^{-1}$ and $c{a}^{-1}$, andFor a finite group, simple transitivity implies $|X|=|G|$. Conversely, a transitive group action with $|X|=|G|<\infty$ is simply transitive by the orbit-stabilizer theorem. Equality of cardinalities alone is insufficient without transitivity: the cyclic group $C_2$ can fix both points of a two-point set, giving two group orbits and two possible self-transports at each point.

The full symmetry group of a regular tetrahedron is the symmetric group $S_4$ acting on its vertices. Its subgroups with at most six elements have eight types up to conjugation, with the following representative subgroups and counts:A transposition is a reflection through the plane containing the two fixed vertices and the midpoint of the exchanged edge. A double transposition is a half-turn about the axis joining the midpoints of the two exchanged edges. A three-cycle is a one-third-turn about a vertex-to-opposite-face axis. A four-cycle is a quarter-turn composed with a reflection perpendicular to the opposite-edge midpoint axis; it is an improper orthogonal transformation.

The unique Klein four-group containing only double transpositions consists of the three opposite-edge half-turns and the identity element. The other three Klein four-groups consist of two perpendicular mirror reflections, their half-turn product, and the identity element. Each $S_3$ is a stabilizer subgroup of a vertex, including the three rotations and three mirror reflections preserving that vertex.

For completeness, a Klein four-group containing $(12)$ must contain the commuting involution $(34)$ or $(12)(34)$, yielding the displayed subgroup; one containing no transpositions must contain all three double transpositions. An $S_3$ subgroup has a unique cyclic subgroup of cardinality three, whose unique fixed vertex must therefore be preserved by the entire $S_3$. These observations and the disjoint cycle decomposition exhaust the types allowed by groups of order at most six. The counts sum to $25$.

The group of Euclidean isometries preserving orientation of ${\mathbb{R}}^n$. Its elements have the form $x\mapsto Ax+b$, with $A$ in the special orthogonal group and $b\in {\mathbb{R}}^n$. The function composition law is $(A,b)(B,c)=(AB,Ac+b)$, the identity element is $(I,0)$, and the inverse element is $(A^{-1},-A^{-1}b)$. These formulas prove closure and inverses; function composition supplies associativity. For $n=2$, $A$ is a planar rotation.

For a group action of a group $G$ on a set $X$, the stabilizer subgroup of $x\in X$ consists of the transformations that leave $x$ fixed:It is a subgroup: the identity element fixes $x$, products of transformations fixing $x$ fix $x$, and the inverse element of a transformation fixing $x$ also fixes $x$. A stabilizer subgroup is a subset of $G$, whereas the orbit of a group action is a subset of $X$. See Ackerman's algebra notes, definition 0.4.1.2.

For the square group actions defined under group action, direct calculation givesThe reflection $s$ fixes $A$ and $C$ individually. The reflection $rs$ preserves the unoriented side of a polygon $AB$ by exchanging its two vertices of a polygon. The half-turn rotation $r^2$ exchanges the two ends of the unoriented diagonal of a polygon $AC$ while preserving that diagonal of a polygon. Thus fixing a side of a polygon or diagonal of a polygon as an object does not mean fixing every point on it; the latter condition uses a pointwise stabilizer. The four stabilizer subgroups have group orders $2,2,4,8$, matching group orbit sizes $4,4,2,1$ through the orbit-stabilizer theorem.

A stabilizer subgroup records the transformations still available after imposing a constraint. Fixing a vertex of a polygon of the square leaves two choices; fixing its centroid leaves all eight. In a faithful group action, a stabilizer subgroup can still contain a nonidentity transformation, as $s\in (D_4{)}_A$ shows: a faithful group action requires that only the identity element fix every point of $X$ simultaneously, not that every individual stabilizer subgroup be trivial. The two-point cyclic group example under group action has both stabilizer subgroups equal to the group kernel $\{0,2\}$ of its associated group homomorphism.

A subgroup $H\le G$ is a subset of a group $G$ that is itself a group under the same group operation. It must contain the identity element of $G$ and be closed under products and inverse elements. Associativity is inherited from $G$, so it needs no new proof. The whole group and the trivial group $\{e\}$ are always subgroups. A proper subgroup satisfies $H\ne G$.

A useful single-condition test isTo see why it works, choose $a\in H$; then $a{a}^{-1}=e\in H$. Taking $a=e$ gives every inverse element $b^{-1}\in H$. Applying the test to $a$ and $b^{-1}$ then gives $ab\in H$. Conversely, every subgroup satisfies the test by closure under products and inverse elements. This also makes the additive version memorable: a nonempty subset of an additive group is a subgroup exactly when it is closed under differences. See McKernan's MIT lecture 2, Proposition 2.3, for the equivalent closure criterion.

For the square dihedral group $D_4$ above, $R=\{e,r,r^2,r^3\}$ is a cyclic subgroup: products add exponents modulo four, and $(r^k{)}^{-1}=r^{-k}$. The smaller collections $\{e,r^2\}$ and $\{e,s\}$ are subgroups of group order two. But $\{e,r\}$ is not a subgroup, since $r\cdot r=r^2$ lies outside it. A plausible-looking list of symmetries therefore need not constitute a complete collection of reversible operations.

Inside $(\mathbb{Z},+)$, the even numbers $2\mathbb{Z}$ form a subgroup: $2m-2n=2(m-n)$ is an even number. Its two cosets consist of the even numbers and the odd numbers, so its index of a subgroup is two. The parity group homomorphism $k\mapsto k\mathrm{mod}2$ has $2\mathbb{Z}$ as its kernel of a group homomorphism. A subgroup can thus identify exactly which information a composition-preserving map forgets.

Subgroups also describe residual symmetry. In the group action of $D_4$ on the four vertices, the stabilizer subgroup of $(1,1)$ is $\{e,sr\}$: the diagonal reflection $sr$ fixes that vertex, and the other six motions move it. Requiring a feature to stay fixed still leaves a group, because both composition and reversal preserve that requirement. This is why subgroups are useful for studying a group action one feature at a time.

A nonempty subset $H$ of a group $G$ is a subgroup if and only if $g{h}^{-1}\in H$ for every $g,h\in H$. Necessity follows from closure and the existence of inverse elements in a subgroup.

Conversely, choose $a\in H$. Setting $g=h=a$ gives the identity element $e=a{a}^{-1}\in H$. Taking $g=e$ then gives $h^{-1}\in H$ for every $h\in H$. Finally, using $h^{-1}$ as the second element gives $g(h^{-1}{)}^{-1}=gh\in H$, proving closure. The inherited multiplication is associative, so these properties establish the group axioms on $H$.

A subset $A$ of a multiplicatively written group is symmetric when it contains the identity element and $A^{-1}=A$. Consequently $⟨A⟩={\bigcup }_{m\ge 1}{A}^m$.

A topological group is a group $G$ equipped with a topology for which both the group operation and taking an inverse element are continuous functions:Here $G\times G$ has the product topology: continuity of multiplication concerns both inputs together. Thus nearby motions compose to nearby motions, and undoing a motion also varies continuously. The definition alone does not impose compactness; we state the Hausdorff space assumption explicitly when it is needed.

The additive group $(\mathbb{R},+)$ of real numbers, with its usual topology, is a topological group: $(x,y)\mapsto x+y$ and $x\mapsto -x$ are continuous functions. Its identity element is $0$. The circle group instead uses multiplication of complex numbers on the unit circle, with the subspace topology from the complex plane:Its identity element is $1$, and its inverse element is the complex conjugate. Multiplication on the complex plane and complex conjugation are continuous functions, so their restrictions verify the required continuity. Angles add, but points multiply: a quarter-turn followed by another quarter-turn gives $i\cdot i=-1$, and the next two quarter-turns return to $1$. Ordinary addition would fail to stay on the unit circle, since $1+1=2$.

For any fixed $a\in G$, the translations $x\mapsto ax$ and $x\mapsto xa$ are homeomorphisms, with inverses given by translation by $a^{-1}$. Consequently the neighbourhoods of the identity element determine the entire topology. This is why local information near one motion can control a whole family of symmetries. See Tornier, Haar Measures, section 1.1 for these basic properties of topological groups.

A torsion-free group is a group in which the identity element is the only element of finite order of a group element.

A group action on a nonempty set $X$ is transitive when every two points lie in the same orbit of a group action, equivalently when for all $x,y\in X$ there is a group element $g$ with $g\cdot x=y$. There is exactly one group orbit: every position is reachable from every other. Requiring $X\ne \varnothing$ avoids calling the group action on the empty set transitive merely because the quantified statement has no points to test.^[ref]

Here a left group action of a group $G$ means a function $G\times X\to X$, written $(g,x)\mapsto g\cdot x$, satisfyingwhere $e$ is the identity element. Products move the point by $h$ first, then by $g$. Transitivity says that an orbit map $G\to X$, $g\mapsto g\cdot x$, is surjective for every $x\in X$; it suffices to check one chosen point.^[ref][ref]

For example, the symmetric group $S_3$ acts on $X=\{1,2,3\}$ by $\sigma \cdot i=\sigma (i)$. This is a transitive group action, but it is not a free group action: the stabilizer subgroup of $1$ is $\{e,(23)\}$. Both the transposition $(12)$ and the cyclic permutation $(123)$ send $1$ to $2$. In contrast, the cyclic group $C_3=\mathbb{Z}/3\mathbb{Z}$ acts on itself by $k\cdot x=k+x(\mathrm{mod}3)$, using modular arithmetic. The group element sending $x$ to $y$ is uniquely $k=y-x(\mathrm{mod}3)$. These two group actions reach the same number of points, but only the second has unique transport between them.

The stabilizer subgroup $G_x=\{h\in G:h\cdot x=x\}$ measures the ambiguity of transport. If $g_0\cdot x=y$, thenThe first set is a left coset, and the second identity says that stabilizer subgroups in one group orbit are conjugate subgroups. Briefly, $g\cdot x=g_0\cdot x$ exactly when $g_0^{-1}g\in G_x$. Thus, for a finite group in a transitive group action, the orbit-stabilizer theorem gives $|G|=|X||G_x|$, and there are exactly $|G_x|$ transports for each pair of points. The example counts are $6=3\cdot 2$ for $S_3$ and $3=3\cdot 1$ for $C_3$. This separates the number of reachable positions from the number of ways to reach each one.^[ref]

The trivial subgroup contains only the identity element of a group. It is a subgroup of every group and is proper whenever the group has more than one element. Thus a group of prime group order has no proper nontrivial subgroups, rather than having no proper subgroups at all.

The word length is the cost of building a group element from the allowed generators of a group. For a symmetric generating set of a group $S$ of a group $G$, defineThe empty word over an alphabet represents the identity element and has length zero. A representative with this least number of letters labels a shortest graph path from $1$ to $g$ in the Cayley graph. Thus word length minimizes over all representatives, rather than counting the letters in whichever expression we happened to write down.^[ref]

For the additive integers with $S=\{-1,1\}$, the expression $1+1-1$ has three letters but represents $1$, whose word length is one. With $T=\{-2,-1,1,2\}$, the integer $5$ has word length three, realized by $2+2+1$. The Cayley graphs of the integers visualize why these are minimal. A freely reduced word is always shortest in a free group with its free generators and their inverses; free reduction alone need not give a shortest representative in a general group.

Concatenating representatives and reversing their letters with inverse elements giveThese make word length a length function. A finite $S$ gives finite word metric balls, since only finitely many words over an alphabet have length at most a fixed radius. The definition itself also works for infinite symmetric generating sets of a group; the bounded-metric example in equivalence of finite word metrics shows what finiteness adds.

Any abelian group becomes a nonunital ring by declaring every product zero. Associativity and the distributive property hold because both sides are zero. When the group has more than one element, no multiplicative identity element exists: an identity would have to satisfy $ex=x$, whereas every such product is zero. This differs from the zero ring, which has just one element.

The zero polynomial has every coefficient zero. It is the zero vector of a vector space of polynomials and the additive identity element of a polynomial ring. Its degree of a polynomial is often set to $-\infty$ when a formula requires one.