Quotient set Created 2026-09-28 Updated 2026-10-14
A quotient set packages each equivalence class as a single new set element. It remembers which class an original set element belongs to and forgets which member of that class it was. For an equivalence relation on a set ,Each set element of the quotient set is itself a nonempty subset of . The canonical projection of a quotient set sends an original set element to this entire equivalence class. [ref]
https://www.math.umd.edu/~pbrosnan/notes/ugalg/sect0018.html. Patrick Brosnan, Undergraduate Algebra, §2.10, Definitions 2.78 and 2.80
For integer congruence modulo three restricted to , the quotient set isIt has cardinality three. The set is a choice of equivalence class representatives, not literally this quotient set: is an integer, while is a set. The function sending each chosen equivalence class representative to its equivalence class is a bijection between these two different sets.
The quotient projection sends nine elements to three classes, with each class appearing as one fiber
. Details. A quotient set alone specifies no arithmetic. To obtain the familiar modular arithmetic example with addition, use integer congruence on the whole set of integers. Its quotient set is , where is an infinite residue class. Define addition byThe answer must be independent of the equivalence class representatives. If and , then , so both sums have the same residue class. This is what it means for the group operation to be well-defined. With this addition, the quotient set is a cyclic group, with identity and inverse for . [ref]
https://math-cs.gordon.edu/ntic/ntic2017/section-cong-props.html. Karl-Dieter Crisman, Number Theory: In Context and Interactive, §4.3, Proposition 4.3.2: congruence arithmetic is well-defined
For example, . Choosing and as different representatives of an equivalence class for gives the same sum; choosing and gives again. These calculations use residue classes of all integers. Raw addition on the finite does not stay in : . The formula for addition on therefore cannot be applied as a raw inherited operation on that finite example.
Representation theory Created 2026-09-24 Updated 2026-10-20
Representation theory describes abstract symmetries by linear maps on vector spaces. A group representation assigns an invertible linear map to each group element, respecting multiplication. The payoff is that a symmetry problem becomes a problem about matrices, invariant subspaces, and eigenvalues. Decomposing the action can reveal combinations of variables that a symmetric system cannot mix.
Take the cyclic group , with . On three real coordinates, let send to :This permutation representation does more than relabel a list: it acts linearly on every possible assignment of values to the three positions. The vector stays fixed. The vector subspace is also preserved, since a permutation does not change the sum.
Every vector separates uniquely into these two types:For example, . The first term belongs to a trivial representation; the second is a contrast with zero coordinate sum. This is a direct sum decomposition . The symmetry preserves the mean and rotates the contrasts.
Three-coordinate cyclic symmetry preserves the mean and rotates the zero-sum contrasts by 120 degrees
. Details. The rotation is literal after choosing the orthonormal basis , of . In this basis,It is a rotation through degrees, and three applications return to the starting point. There is no nonzero invariant real line, because this rotation has no real eigenvector. Thus the two-dimensional action is an irreducible representation over the real numbers. Over the complex numbers it instead splits into two eigenlines with eigenvalues and . The coefficient field is part of an irreducibility claim.
Why would this decomposition matter for a physical calculation? Consider three equal masses with scalar displacements and the symmetric quadratic coupling energyThe equations of motion are , whereis a graph Laplacian and is the all-ones matrix. The constant vector has eigenvalue zero: translating all coordinates equally costs no coupling energy. On , vanishes and , so both independent contrast directions have angular frequency . A three-coordinate coupled problem reduces to a free mean and two identical harmonic oscillators.
Equal pair couplings leave the mean fixed and make two independent zero-sum modes oscillate at the same frequency
. Details. For initial displacement and initial velocity zero, the exact solution is . The fixed mean and oscillating contrast can be read directly from the decomposition. More generally, a linear operator commuting with the group action carries its fixed-vector subspace into itself; with an invariant inner product, it preserves the corresponding orthogonal complement too.
For a finite group, averaging over the action constructs an invariant inner product over the real numbers or complex numbers. The resulting invariant complements explain Maschke's theorem: a finite-dimensional group representation decomposes into irreducible representations. Characters compress the action into traces and help identify those pieces. The assumptions matter; in modular representation theory the coefficient field can have characteristic dividing the group order, and such decompositions can fail. Chapter 4 of Pavel Etingof and coauthors' notes develops these mechanisms. [ref]
https://math.mit.edu/~etingof/reprbook.pdf. Etingof and coauthors: Introduction to representation theory
. Root of unity over a finite field 2026-10-14
These roots are taken in an algebraic closure, not merely in . If the characteristic of a field is and with , then ; hence there are distinct roots. They form a cyclic group by the finite multiplicative subgroup of a field is cyclic theorem. In particular they have order when .
Roots-of-unity filter Created 2026-10-20 Updated 2026-11-05
Let be a primitive th root of unity. The finite geometric series givesConsequently, for a polynomial , the expression keeps exactly the terms whose exponents are congruent to modulo . This is orthogonality of characters for a cyclic group in concrete form.
For , the even and odd parts are and . Taking extracts sums of binomial coefficients in chosen residue classes. The same calculation works for formal power series coefficient by coefficient over a coefficient field containing and .
Roots of unity in a rational cyclotomic field Created 2026-09-24 Updated 2026-11-05
Ruzsa modelling lemma Created 2026-09-28 Updated 2026-11-05
For a nonempty finite set with bounded doubling constant and a fixed positive integer , the Ruzsa modelling lemma finds a subset of size at least that is Freiman s-isomorphic to a dense subset of a finite cyclic group. The model order is at most when . The cyclic Freiman model of a small-doubling integer set gives an explicit order-eight version.
The integer, or appropriate torsion-free, setting matters. If , then for every . A Freiman 2-isomorphism into a cyclic group would force . All image differences would lie in its subgroup of elements killed by two, which has at most two elements. Thus no subset with more than two points can be Freiman 2-isomorphic to a cyclic model. General abelian groups need models retaining their torsion, rather than an unrestricted cyclic-model assertion.
Schur multiplier of an abelian group Created 2026-09-24 Updated 2026-11-05
For an abelian group ,For a finite direct sum of cyclic groups this gives one summand for every pair .
Seventh cyclotomic field Created 2026-09-24 Updated 2026-11-05
For a primitive seventh root of unity ,where . Its four intermediate fields correspond to the four subgroups of the cyclic group .
Simply transitive group action 2026-10-14
A group action on a nonempty set 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 in the uniqueness condition shows that every stabilizer subgroup is , since the identity element already fixes . In a transitive group action, checking that just one stabilizer subgroup is trivial suffices: all the others are conjugate subgroups.
The cyclic group in the diagram under transitive group action is simply transitive. More generally, the left regular action of any group on itself is simply transitive: the equation has the unique solution , using the inverse element of . This shows why the property is useful: every position has a unique label relative to a chosen starting position.
Choose a point . Its orbit mapis a bijection and an equivariant map from the left regular action: . This identifies with a copy of , but does not come with a preferred identity element. If , then : changing the chosen point composes this identification with right multiplication by . An old label therefore becomes the new label , which also specifies the side of multiplication for a noncommutative group.
The transport from to remains independent of the chosen point. Writing and , it is . With , the new labels are and , andFor a finite group, simple transitivity implies . Conversely, a transitive group action with is simply transitive by the orbit-stabilizer theorem. Equality of cardinalities alone is insufficient without transitivity: the cyclic group can fix both points of a two-point set, giving two group orbits and two possible self-transports at each point.
Stabilizer subgroup Created 2026-09-24 Updated 2026-10-14
For a group action of a group on a set , the stabilizer subgroup of consists of the transformations that leave fixed:It is a subgroup: the identity element fixes , products of transformations fixing fix , and the inverse element of a transformation fixing also fixes . A stabilizer subgroup is a subset of , whereas the orbit of a group action is a subset of . See Ackerman's algebra notes, definition 0.4.1.2.
For the square group actions defined under group action, direct calculation givesThe reflection fixes and individually. The reflection preserves the unoriented side of a polygon by exchanging its two vertices of a polygon. The half-turn rotation exchanges the two ends of the unoriented diagonal of a polygon 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 , matching group orbit sizes 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 shows: a faithful group action requires that only the identity element fix every point of 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 of its associated group homomorphism.
Subgroup generated by complex scalings and reciprocal inversion Created 2026-10-14 Updated 2026-11-05
The Möbius transformations generated by with and have exactly the two displayed forms. The relations and reduce every word to , . This is a semidirect product of with a cyclic group of order two acting by multiplicative inversion. It preserves the unordered pair , and only its scaling elements fix zero.
Subgroups of polycyclic groups are polycyclic Created 2026-10-31 Updated 2026-11-05
Given a cyclic-factor subnormal series and , intersect each term with . The induced map is injective. Since every subgroup of a cyclic group is cyclic, the intersection chain is again a cyclic-factor subnormal series, after removing repetitions. Hence is a polycyclic group. In particular, every subgroup is finitely generated.
Subnormal series 2026-10-14
A subnormal series is a finite chain of subgroups in which each is a normal subgroup of the next. A member need not be normal in the whole group. Requiring the factors to be cyclic groups defines a polycyclic group; allowing finite factors as well defines a poly-(cyclic or finite) group.
Sumset Created 2026-09-24 Updated 2026-10-13
For finite sets in an abelian group , their sumset isEach distinct value occurs only once in this set, even if many ordered pairs produce it. When , repetitions are allowed: belongs to . For the two integer sets introduced above,For , the value comes from . For , two ordered pairs give the same sum only when one reverses the other, apart from a pair being identical to itself. Thus its four pairs and six pairs with distinct members, counted without regard to order, produce ten distinct sums.
Every nonempty finite set of integers satisfies . To see this, list its members as . The distinct sumsall belong to . A nonconstant arithmetic progression attains this bound. The ordered list is essential: in the cyclic group , the subgroup instead satisfies , of cardinality three. Addition wraps around, for example in this group.
Symmetric-group embedding at one less than the group order Created 2026-09-24 Updated 2026-11-05
For , a cyclic group of prime-power order cannot embed in , because a permutation of order requires a cycle of length at least . If is not a prime power, every group of order embeds in by combining coset actions on subgroups of two distinct prime orders.
Torsion subgroup killed by an integer Created 2026-10-14 Updated 2026-11-05
For an abelian group and an integer , its -torsion subgroup is , the kernel of multiplication by . In a finite abelian group, every nonempty fiber of this homomorphism has cardinality , so . This follows directly: if , then , and conversely translating by an element of leaves the image unchanged. On the cyclic group , the solutions of number ; divide both integers by their greatest common divisor to see that must be a multiple of .
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]
Triangle-removal proof of Roth theorem 2026-10-14
Embed in the odd cyclic group , so additive three-term relations in cannot wrap around. Form three copies of , putting edges when , when , and when . A triangle in a graph encodes in . If has no nonconstant arithmetic progression, every triangle in a graph has ; there are exactly triangles in a graph, and they are edge-disjoint. Thus at least edges must be removed to eliminate them. For fixed positive subset density of , this is a positive fraction of the squared vertex count, whereas the triangle in a graph count is only quadratic. The triangle removal lemma permits deletion of an arbitrarily small quadratic fraction when the cubic triangle in a graph subset density is sufficiently small. This contradiction establishes Roth theorem on three-term arithmetic progressions.
Twisted cyclic pair group Created 2026-10-07 Updated 2026-11-05
Let be prime, , and . Fermat's little theorem makes the displayed multiplication well defined. Its identity is and inverse is ; associativity follows by expanding both bracketings. Projection onto the first coordinate is a group homomorphism with normal cyclic kernel of order . Under the change , multiplication becomes , the semidirect product of the additive prime field by the cyclic group of order . The group is abelian precisely when ; need not be a generator of the multiplicative field group.
A finite abelian group is a cyclic group if and only if it has at most one subgroup of each order dividing its order. A cyclic group has exactly one subgroup of order for each , generated by the th power of a generator.
Conversely, the structure theorem for finitely generated modules over a principal ideal domain expresses as with . If , choose a prime number . The first and second summands then provide distinct subgroups of order , contradicting the hypothesis. Hence , so is cyclic, including the trivial group when . This criterion combines with the root bound for a polynomial to prove that a finite subgroup of a field multiplicative group is cyclic.



