Cyclic group

Cyclic group
Original: Jakob.scholbach Vector: Pbroks13 · CC BY-SA 3.0 · source
Name	Cyclic group
Notation	C_n, Z_n, Z
Type	Algebraic structure
Field	Évariste Galois's context, Niels Henrik Abel's era
Examples	Integers, Complex numbers, Additive group of integers mod n

Cyclic group A cyclic group is a group generated by a single element; every member equals a power or multiple of that element. Originating in the work of Évariste Galois, Niels Henrik Abel, Augustin-Louis Cauchy, and influenced later by Arthur Cayley, cyclic groups underpin many constructions in Carl Friedrich Gauss's number theory, Émile Picard-era topology, and David Hilbert's algebraic frameworks. Their elementary structure links to classical results from Leonhard Euler, Joseph-Louis Lagrange, and modern treatments by Emmy Noether, Emil Artin, and Saunders Mac Lane.

Definition and basic properties

A cyclic group is formally a group G for which there exists g in G with G = {g^k : k in Z}; this definition was clarified in expositions by William Rowan Hamilton and Camille Jordan. Basic properties include finiteness criteria influenced by Adrien-Marie Legendre's divisibility insights and order relationships governed by Lagrange's theorem as applied in works by Arthur Cayley and Camille Jordan. The classification of elements by order ties to early results of Leonhard Euler on totients and to counting principles used by Joseph-Louis Lagrange and Carl Friedrich Gauss. Cyclic groups are abelian, a fact central in developments by Emmy Noether and Emil Artin, and their automorphism groups connect to ideas pursued by Hermann Minkowski and Helmut Hasse.

Examples and classification

Standard examples arise from the additive group of integers Integers and quotients like the additive group of integers modulo n Integers modulo n; such finite cyclic groups are often denoted C_n or Z_n, following notation standardized in texts by Nicolas Bourbaki and Emil Artin. Multiplicative groups of nth roots of unity in the Complex numbers produce cyclic examples used extensively by Carl Friedrich Gauss in his cyclotomy investigations and by Niels Henrik Abel and Évariste Galois in polynomial resolvent studies. Cyclic subgroups appear in Klein four-group analyses by Felix Klein and in permutation contexts treated by Évariste Galois and Augustin-Louis Cauchy. Classification results—finite cyclic groups up to isomorphism as Z_n and the infinite cyclic group as Z—feature in foundational treatments by David Hilbert, Emmy Noether, Richard Dedekind, and Ernst Zermelo. Historical examples include rotations of regular polygons studied by Johannes Kepler and symmetry groups catalogued by Arthur Cayley and Felix Klein.

Subgroups and generators

Subgroup structure in cyclic groups was systematized in the work of Joseph-Louis Lagrange and later by Richard Dedekind; every subgroup is cyclic and for a finite cyclic group of order n each divisor d of n corresponds to a unique subgroup of order d, a principle echoed in Carl Friedrich Gauss's divisor theory. The number of generators (primitive elements) equals φ(n), invoking Leonhard Euler's totient function introduced in his correspondence and formalized in treatises by Adrien-Marie Legendre and Peter Gustav Lejeune Dirichlet. Generators and primitive roots were central to investigations by Gauss and Évariste Galois and appear in modular arithmetic expositions by Srinivasa Ramanujan and G. H. Hardy. Results on generator existence link to criteria explored by Émile Picard and later by H. S. M. Coxeter in geometric symmetry contexts.

Structure theorem and isomorphism classes

The classification of finitely generated abelian groups places cyclic groups as building blocks in the fundamental theorem developed by Emmy Noether, Emil Artin, and expounded by Nicolas Bourbaki; cyclic groups correspond to rank-one free abelian summands or finite cyclic factors Z_n. Isomorphism classes for finite cyclic groups are determined uniquely by order, a viewpoint advanced in the foundational algebra texts of David Hilbert and Emmy Noether. Decompositions of finite abelian groups into cyclic components appear in the works of Leopold Kronecker and Richard Dedekind and are crucial in class field theory developed by Ernst Witt and Heinrich Weber.

Applications and occurrences in mathematics

Cyclic groups pervade number theory via multiplicative groups modulo n studied by Carl Friedrich Gauss, Évariste Galois, and Srinivasa Ramanujan; they structure Galois groups in solvable extension cases examined by Évariste Galois and Niels Henrik Abel. In topology, fundamental groups of the circle S^1 are cyclic, a core example in work by Henri Poincaré and L. E. J. Brouwer; covering space theory uses cyclic deck transformation groups in expositions by Hassler Whitney and H. S. M. Coxeter. In geometry, cyclic rotation groups govern regular polygon symmetries analyzed by Johannes Kepler and Felix Klein. Coding theory and cryptography exploit cyclic structures in cyclic codes and discrete log problems, areas advanced by Claude Shannon, Whitfield Diffie, Martin Hellman, and Ron Rivest. Representation theory and character theory treat one-dimensional representations as homomorphisms from cyclic groups, topics elaborated by Frobenius and Issai Schur.

Generalizations and related concepts

Generalizations include cyclic modules studied by Emmy Noether and Emil Artin, quasi-cyclic groups (Prüfer groups) investigated by Otto Prüfer and Emil Artin, and procyclic groups appearing in profinite theory developed by Helmut Hasse and John Tate. Related concepts involve finite abelian groups classified by Leopold Kronecker and Richard Dedekind, torsion groups discussed by Issai Schur, and concepts of generators and relations formalized by Arthur Cayley and William Rowan Hamilton. Connections extend to algebraic number theory via class groups examined by Richard Dedekind and David Hilbert, and to algebraic topology via homotopy groups advanced by Henri Poincaré and Samuel Eilenberg.

Category:Group theory