Subgroups and cyclic groups
Summary
This topic is a part of group theory. It covers subgroups, the subgroup generated by a set, the lattice of subgroups, and the structure of cyclic groups. A subgroup is a subset of a group that is a group under the same operation. The subgroups generated by one element are the cyclic subgroups, and the groups generated by one element are the cyclic groups. Every cyclic group is isomorphic to the integers or to the integers modulo , and its subgroups are known exactly. The topic ends with the exponent of a group, cyclic subgroups of the units of a field, maximal subgroups and locally cyclic groups.
Remarks
Reading order
- Subgroup: the definition and the first examples.
- Subgroup criterion: the one-step, two-step and finite tests.
- Intersection of subgroups: intersections are subgroups, unions of two usually are not.
- Subgroup generated by a subset: the smallest subgroup that contains a set.
- Generating set: sets that generate the whole group.
- Finitely generated group: groups with a finite generating set.
- Lattice of subgroups: all subgroups, ordered by inclusion.
- Cyclic subgroup generated by an element: the powers of one element.
- Cyclic group: groups generated by one element.
- Cyclic group of order n: the finite model .
- Infinite cyclic group: the infinite model .
- Cyclic groups are abelian: powers of one element commute.
- Order of the cyclic subgroup equals the order of the element: the size of .
- Classification of cyclic groups: the order determines a cyclic group.
- Subgroups of cyclic groups are cyclic: the least positive exponent gives a generator.
- Subgroups of the integers: each one is .
- Fundamental theorem of cyclic groups: one subgroup for each divisor of the order.
- Number of elements of each order in a cyclic group: the Euler totient counts them.
- Product of two cyclic groups: cyclic exactly when the orders are coprime.
- Exponent of a group: the least common multiple of the element orders.
- Finite abelian group is cyclic iff exponent equals order: a test for cyclicity.
- Finite subgroups of the units of a field are cyclic: an application to fields.
- Maximal subgroup: the proper subgroups that are as large as possible.
- Locally cyclic group: groups in which finitely generated subgroups are cyclic.
Prerequisites
- Groups and the group axioms: groups, the identity, inverses, the order of an element and the laws of exponents.
- The integers and divisibility: the division algorithm, the greatest common divisor and Bézout's identity.
- The Euler totient function, for rows 18 and 22.
Everything in this topic
The members of this topic and each page that they need, 388 pages in all.
- Absolute value concept
- Affine group concept
- Alphabet concept
- Alternating group concept
- Arity concept
- Bijective function concept
- Boolean function concept
- Cardinality concept
- Cartesian product concept
- Commuting elements concept
- Complete lattice concept
- Complex conjugate concept
- Complex exponential concept
- Complex numbers object
- Congruence modulo n concept
- Coprime integers concept
- Countermodel concept
- Cycle notation concept
- Definition by recursion concept
- Determinant concept
- Dihedral group concept
- Direct product of groups concept
- Distributive lattice concept
- Divisibility definition
- Divisibility concept
- Effectively decidable set concept
- Element definition
- Elementary abelian group concept
- Equality (mathematics) concept
- Equinumerous sets concept
- Equivalence class concept
- Equivalence relation concept
- Euler's totient function concept
- Field concept
- Formal language concept
- Frattini subgroup concept
- Function concept
- General linear group object
- Greatest common divisor concept
- Group of units of a ring concept
- Identity matrix object
- Induction on well-formed formulas concept
- Injective function concept
- Integers object
- Integers modulo n concept
- Lattice concept
- Least common multiple concept
- Mathematical statement definition
- Matrix definition
- Modular lattice concept
- Multilinear map concept
- Natural numbers object
- Order isomorphism concept
- Peano axioms concept
- Permutation concept
- Polynomial concept
- Prime number concept
- Primitive root of unity concept
- Proof of Zorn's lemma proof
- Proposition concept
- Propositional letter concept
- Prüfer group example
- Rational numbers object
- Reflection concept
- Regular polygon concept
- Root of unity concept
- Rotation concept
- Set concept
- String concept
- Symmetric group concept
- Torsion group concept
- Torsion subgroup concept
- Transposition concept
- Tuple concept
- Vector space concept
- Vector space definition
- Signature concept
- Congruence modulo n definition
- Greatest common divisor definition
- Prime number definition
- Set definition
- Logical connective definition
- Binary operation definition
- Binary operation concept
- Connectives in mathematical language concept
- Matrix multiplication definition
- Square matrix definition
- Transpose definition
- Successor function definition
- Conjunction definition
- Disjunction definition
- Material implication definition
- Principle of bivalence concept
- Predicate concept
- Predicate definition
- Linear map definition
- Coprime integers definition
- Prime factorization definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Commutativity definition
- Associativity concept
- Cayley table concept
- Commutativity concept
- Identity element concept
- Set-builder notation concept
- Proof that congruence is compatible with addition proof
- Proof that congruence is compatible with multiplication proof
- Intersection definition
- Union definition
- Multilinear map definition
- Orthogonal matrix definition
- Addition of natural numbers definition
- Conditional statements concept
- Biconditional definition
- The successor function is injective statement
- Zero is not a successor statement
- Term concept
- Negation concept
- Negation definition
- Euler's totient function definition
- Cartesian product definition
- Congruence is compatible with addition statement
- Congruence is compatible with multiplication statement
- Disjoint sets definition
- Inverse element concept
- Atomic formula concept
- Alternating multilinear map definition
- Orthogonal group object
- Truth table concept
- Material implication concept
- Order on the natural numbers definition
- Conjunction concept
- Disjunction concept
- Group concept
- Determinant definition
- Biconditional concept
- Universal quantifier concept
- Universal quantifier definition
- Existential quantifier definition
- Direct product of groups definition
- Group homomorphism definition
- Group homomorphism concept
- Ring definition
- Subgroup definition
- Symmetric group definition
- Proof that a matrix with two equal rows has determinant zero proof
- Abelian group definition
- Order of a group concept
- Proof of the cancellation laws proof
- Abelian group concept
- Special orthogonal group object
- Subgroup concept member
- Proof of the uniqueness of identity and inverses proof
- Union of a family of sets definition
- Subset definition
- Axiom of extensionality statement
- Uniqueness quantifier definition
- Special linear group object
- Logical connective concept
- Proof that the determinant of the identity matrix is one proof
- Existential quantifier concept
- Proof that the determinant is multilinear in the rows proof
- Group isomorphism definition
- Image of a homomorphism concept
- Kernel of a homomorphism concept
- Commutative ring definition
- Polynomial ring definition
- Ring homomorphism definition
- Unit of a ring definition
- Zero divisor definition
- Determinant of a matrix with two equal rows statement
- Group isomorphism concept
- Klein four-group object
- Cancellation laws statement
- Proof of the intersection lemma for subgroups proof member
- Uniqueness of identity and inverses statement
- Binary relation definition
- Partition of a set definition
- Transposition definition
- Determinant is multilinear in the rows statement
- Well-formed formula concept
- Coset concept
- Determinant of the identity matrix statement
- Propositional formula definition
- Propositional formula concept
- Divisibility in a commutative ring definition
- Degree of a polynomial definition
- Polynomial evaluation definition
- Field definition
- Integral domain definition
- Proof of the laws of exponents in a group proof
- Left coset concept
- Antisymmetric relation definition
- Reflexive relation definition
- Symmetric relation definition
- Transitive relation definition
- Function definition
- Formal system concept
- Proof of unique readability by counting brackets proof
- Leading coefficient definition
- Root of a polynomial definition
- Proof of cancellation in an integral domain proof
- Evaluation homomorphism definition
- Laws of exponents in a group statement
- Equivalence relation definition
- Preorder definition
- Right coset concept
- Injective function definition
- Choice function definition
- Unique readability theorem statement
- Monic polynomial definition
- Multiplicity of a root definition
- Order of an element concept
- Proof of the degree of a product over an integral domain proof
- Proof of the remainder theorem proof
- Cancellation in an integral domain statement
- Cyclic subgroup generated by an element definition
- Index of a subgroup concept
- Partial order definition
- Equivalence class definition
- Proof that homomorphisms preserve identity and inverses proof
- Proof of the subgroup criterion proof member
- Proof that disjoint cycles commute proof
- Proof that all cosets have the same size proof
- Axiom of choice statement
- Truth valuation concept
- Division algorithm for polynomials statement
- Degree of a product statement
- Conjugate elements concept
- Cyclic subgroup generated by an element concept member
- Cyclic group definition
- All cosets have the same size statement
- Hasse diagram concept
- Homomorphisms preserve identity and inverses statement
- Maximal element definition
- Subgroup criterion statement member
- Total order definition
- Upper bound definition
- Proof that equivalence classes form a partition proof
- Disjoint cycles commute statement
- Logical consequence concept
- Remainder theorem statement
- Proof that R[x] is an integral domain iff R is proof
- The cyclic subgroup generated by i in the nonzero complex numbers example member
- Conjugate subgroup concept
- Intersection of subgroups statement member
- Chain definition
- Equivalence classes form a partition statement
- Proof that a homomorphism is injective iff its kernel is trivial proof
- Rule of inference concept
- The cyclic subgroup generated by 2 in the nonzero rational numbers example member
- The nonnegative powers of 2 are not the cyclic subgroup generated by 2 example member
- Proof of the factor theorem proof
- R[x] is an integral domain iff R is statement
- Subgroup generated by a subset definition
- Subgroup generated by a subset concept member
- Normal subgroup concept
- Modus ponens concept
- Proof of Lagrange's theorem proof
- A homomorphism is injective iff its kernel is trivial statement
- Zorn's lemma statement
- Factor theorem statement
- Product of two subgroups concept
- Proof that kernels are normal proof
- Generating set concept member
- Mathematical proof concept
- Lagrange's theorem statement
- Proof of normality via cosets proof
- Lattice of subgroups concept member
- The set of e, (1 2) and (1 3) is not the subgroup that they generate example member
- The transposition (1 2) and the 3-cycle (1 2 3) generate S3 example member
- Proof that a polynomial over a field has at most as many roots as its degree proof
- Kernels are normal statement
- Finitely generated group concept member
- Normality via cosets statement
- Direct proof concept
- The lattice of subgroups of D4 is not modular example member
- The 3-cycle (1 2 3) does not generate S3 example member
- The group Z/6 has minimal generating sets of sizes 1 and 2 example member
- The lattice of subgroups of S3 example member
- Mathematical induction concept
- The symmetries of a square are generated by a rotation and a reflection example member
- A polynomial over a field has at most as many roots as its degree statement
- A finitely generated group of affine maps with a subgroup that is not finitely generated example member
- Quotient group concept
- Proof by cases concept
- Proof of the commutativity of addition by induction proof
- Proof of strong induction from ordinary induction proof
- Proof of the universal property of the quotient group proof
- Proof of the correspondence theorem proof
- Strong induction statement
- Commutativity of addition statement
- Universal property of the quotient group statement
- Correspondence theorem statement
- Proof of the well-ordering principle from strong induction proof
- Proof of the first isomorphism theorem proof
- Maximal subgroup concept member
- Well-ordering principle statement
- Proof of the division algorithm proof
- First isomorphism theorem statement
- Proof of the existence of a prime divisor proof
- The point stabilizer S_{n-1} is a maximal subgroup of S_n example member
- Existence of a prime divisor statement
- Division algorithm statement
- Circle group object
- Proof of the existence of prime factorization proof
- Proof of the decomposition of a permutation into disjoint cycles proof
- Proof of Bézout's identity proof
- Proof that g^n = e if and only if the order of g divides n proof
- Additive group of integers example
- Existence of prime factorization statement
- Bézout's identity statement
- The odd integers are not a subgroup of the integers example member
- Decomposition of a permutation into disjoint cycles statement
- g^n = e if and only if the order of g divides n statement
- The even integers form a subgroup of the integers example member
- Proof that the order of ⟨g⟩ equals the order of g proof member
- Proof of the sum of the totient over the divisors proof
- Proof of the generalized Euclid's lemma proof
- Cyclic group concept member
- Proof of the decomposition of a permutation into transpositions proof
- Order of ⟨g⟩ equals the order of g statement member
- Proof that cyclic groups are abelian proof member
- The Klein four-group is abelian but not cyclic example member
- Decomposition of a permutation into transpositions statement
- Locally cyclic group concept member
- Sum of the totient over the divisors statement
- Generalized Euclid's lemma statement
- Integers modulo n form a cyclic group example member
- The integers modulo 2 and the group of signs are isomorphic example member
- Proof that the order of an element divides the order of the group proof
- Sign of a permutation definition
- Cyclic groups are abelian statement member
- Proof of the Chinese remainder theorem proof
- Proof that the symmetric group is generated by transpositions proof
- The group Z × Z is finitely generated but not cyclic example member
- Proof of Euclid's lemma proof
- Proof of the formula for the order of a power proof
- The cyclic subgroups of the Klein four-group do not form a lattice example member
- Chinese remainder theorem statement
- Order of an element divides the order of the group statement
- The symmetric group is generated by transpositions statement
- Proof that subgroups and quotients of cyclic groups are cyclic proof member
- Euclid's lemma statement
- Order of a power statement
- Proof that g to the order of the group is the identity proof
- Proof of the fundamental theorem of arithmetic proof
- Subgroups of cyclic groups are cyclic statement member
- Exponent of a group concept member
- Proof that permuting rows multiplies the determinant by the sign proof
- Group of nth roots of unity object
- Fundamental theorem of arithmetic statement
- Permuting rows multiplies the determinant by the sign statement
- g to the power of the group order is 1 statement
- The additive group of rational numbers is locally cyclic but not finitely generated example member
- Proof of the classification of subgroups of the integers proof member
- The exponent of the symmetric group S3 is 6 example member
- The Prüfer group is locally cyclic example member
- Cyclic group of order n example member
- An infinite direct product of copies of Z/2 has exponent 2 example member
- The Prüfer group has no finite exponent example member
- Subgroups of the integers statement member
- Proof of the Leibniz formula from the defining properties of the determinant proof
- Leibniz formula for determinants statement
- The subgroup 4Z of Z is not maximal example member
- The subgroup of the integers generated by 4 and 6 is 2Z example member
- Infinite cyclic group example member
- Proof that Z/m × Z/n is cyclic iff gcd(m, n) = 1 proof member
- Proof of the fundamental theorem of cyclic groups proof member
- Proof of the classification of cyclic groups proof member
- Proof that the determinant is multiplicative by expanding the rows proof
- Fundamental theorem of cyclic groups statement member
- Z/m × Z/n is cyclic iff gcd(m, n) = 1 statement member
- Classification of finite abelian groups statement
- Determinant is multiplicative statement
- Classification of cyclic groups statement member
- Proof of the count of elements of each order in a cyclic group proof member
- The lattice of subgroups of Z/12 example member
- The maximal subgroups of Z/12 are the subgroups generated by 2 and by 3 example member
- Proof that a finite abelian group is cyclic iff its exponent equals its order proof member
- Number of elements of each order in a cyclic group statement member
- The special linear group is a subgroup of the general linear group example member
- A finite abelian group is cyclic iff its exponent equals its order statement member
- Counting proof that finite subgroups of the multiplicative group of a field are cyclic proof member
- Proof that finite subgroups of the multiplicative group of a field are cyclic proof member
- Finite subgroups of the multiplicative group of a field are cyclic statement member
About this page
| Tag | BAVE5RN4EE |
|---|---|
| URI | m2://BAVE5RN4EE |
| Kind | topic |
| Writing | W0 stub |
| MSC | 20A05, 20D30 |
| Part of | Group theory |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
| 2026-11-17 | add | the section Remarks | tamnd |
| 2026-11-17 | change | the section Summary | tamnd |
What links here
Nodes in this topic
- Infinite cyclic group
- Order of ⟨g⟩ equals the order of g
- Fundamental theorem of cyclic groups
- Cyclic groups are abelian
- Subgroup criterion
- Classification of cyclic groups
- Finitely generated group
- Cyclic subgroup generated by an element
- Z/m × Z/n is cyclic iff gcd(m, n) = 1
- Lattice of subgroups
- Finite subgroups of the multiplicative group of a field are cyclic
- Cyclic group of order n
- Subgroups of cyclic groups are cyclic
- Cyclic group
- Generating set
- A finite abelian group is cyclic iff its exponent equals its order
- Subgroup generated by a subset
- Subgroups of the integers
- Subgroup
- Number of elements of each order in a cyclic group
- Exponent of a group
- Intersection of subgroups
- The cyclic subgroups of the Klein four-group do not form a lattice
- The lattice of subgroups of D4 is not modular
- The group Z/6 has minimal generating sets of sizes 1 and 2
- The integers modulo 2 and the group of signs are isomorphic
- Proof that cyclic groups are abelian
- The even integers form a subgroup of the integers
- The cyclic subgroup generated by 2 in the nonzero rational numbers
- The lattice of subgroups of S3
- Proof that finite subgroups of the multiplicative group of a field are cyclic
- Proof that subgroups and quotients of cyclic groups are cyclic
- Proof of the fundamental theorem of cyclic groups
- The point stabilizer S_{n-1} is a maximal subgroup of S_n
- The Prüfer group has no finite exponent
- Proof of the classification of subgroups of the integers
- The Klein four-group is abelian but not cyclic
- The additive group of rational numbers is locally cyclic but not finitely generated
- Counting proof that finite subgroups of the multiplicative group of a field are cyclic
- Proof that Z/m × Z/n is cyclic iff gcd(m, n) = 1
- The subgroup of the integers generated by 4 and 6 is 2Z
- The transposition (1 2) and the 3-cycle (1 2 3) generate S3
- The exponent of the symmetric group S3 is 6
- Integers modulo n form a cyclic group
- The set of e, (1 2) and (1 3) is not the subgroup that they generate
- The cyclic subgroup generated by i in the nonzero complex numbers
- The symmetries of a square are generated by a rotation and a reflection
- Proof of the intersection lemma for subgroups
- Proof of the count of elements of each order in a cyclic group
- The special linear group is a subgroup of the general linear group
- The Prüfer group is locally cyclic
- Proof that a finite abelian group is cyclic iff its exponent equals its order
- Proof that the order of ⟨g⟩ equals the order of g
- The maximal subgroups of Z/12 are the subgroups generated by 2 and by 3
- Maximal subgroup
- An infinite direct product of copies of Z/2 has exponent 2
- Locally cyclic group
- Proof of the classification of cyclic groups
- The subgroup 4Z of Z is not maximal
- The group Z × Z is finitely generated but not cyclic
- The odd integers are not a subgroup of the integers
- The lattice of subgroups of Z/12
- A finitely generated group of affine maps with a subgroup that is not finitely generated
- Proof of the subgroup criterion
- The nonnegative powers of 2 are not the cyclic subgroup generated by 2
- The 3-cycle (1 2 3) does not generate S3