Topological group Created 2026-09-24 Updated 2026-10-13
A topological group is a group equipped with a topology for which both the group operation and taking an inverse element are continuous functions:Here 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 of real numbers, with its usual topology, is a topological group: and are continuous functions. Its identity element is . 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 , 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 , and the next two quarter-turns return to . Ordinary addition would fail to stay on the unit circle, since .
For any fixed , the translations and are homeomorphisms, with inverses given by translation by . 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.
Torsion-free group 2026-10-03
A torsion-free group is a group in which the identity element is the only element of finite order of a group element.
Transitive group action Created 2026-10-03 Updated 2026-10-25
A group action on a nonempty set is transitive when every two points lie in the same orbit of a group action, equivalently when for all there is a group element with . There is exactly one group orbit: every position is reachable from every other. Requiring avoids calling the group action on the empty set transitive merely because the quantified statement has no points to test.[ref]
Transitive Group Actions by Keith Conrad. Definition 1.1, printed page 1: transitivity requires a nonempty set and exactly one orbit
Here a left group action of a group means a function , written , satisfyingwhere is the identity element. Products move the point by first, then by . Transitivity says that an orbit map , , is surjective for every ; it suffices to check one chosen point.[ref][ref]
For example, the symmetric group acts on by . This is a transitive group action, but it is not a free group action: the stabilizer subgroup of is . Both the transposition and the cyclic permutation send to . In contrast, the cyclic group acts on itself by , using modular arithmetic. The group element sending to is uniquely . These two group actions reach the same number of points, but only the second has unique transport between them.
Transitive group actions with and without unique transport
. The symmetric group on three labels has a stabilizer subgroup of group order two at each point, hence two group elements sending any chosen point to any other. The cyclic group acting on itself has trivial stabilizer subgroups and one transport per pair. Red arrows show a generating cyclic permutation; blue arrows show the extra transposition in . Gray loops show the identity element in both group actions. Details.The stabilizer subgroup measures the ambiguity of transport. If , thenThe first set is a left coset, and the second identity says that stabilizer subgroups in one group orbit are conjugate subgroups. Briefly, exactly when . Thus, for a finite group in a transitive group action, the orbit-stabilizer theorem gives , and there are exactly transports for each pair of points. The example counts are for and for . This separates the number of reachable positions from the number of ways to reach each one.[ref]
Trivial subgroup Created 2026-10-18 Updated 2026-11-05
Unit group Created 2026-09-24 Updated 2026-11-05
The units of a ring form a group under the ring's multiplication, denoted . Closure follows because a product of units has inverseThe identity element is the ring's one, associativity is inherited, and each multiplicative inverse is again a unit. The reversed order in the displayed formula is essential in a noncommutative ring.
For example, and . In the second group, each nonidentity element has square one. For a field , the unit group of the matrix ring is the general linear group , connecting the abstract definition with invertible matrices.
Word length Created 2026-10-05 Updated 2026-10-14
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 of a group , 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 to 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 , the expression has three letters but represents , whose word length is one. With , the integer has word length three, realized by . 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 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.
Zero-multiplication rng 2026-10-31
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 , whereas every such product is zero. This differs from the zero ring, which has just one element.
Zero polynomial 2026-10-25
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 when a formula requires one.
