Math 2.0

Areas Group theory Topic

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 nn, 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

  1. Subgroup: the definition and the first examples.
  2. Subgroup criterion: the one-step, two-step and finite tests.
  3. Intersection of subgroups: intersections are subgroups, unions of two usually are not.
  4. Subgroup generated by a subset: the smallest subgroup that contains a set.
  5. Generating set: sets that generate the whole group.
  6. Finitely generated group: groups with a finite generating set.
  7. Lattice of subgroups: all subgroups, ordered by inclusion.
  8. Cyclic subgroup generated by an element: the powers of one element.
  9. Cyclic group: groups generated by one element.
  10. Cyclic group of order n: the finite model ℤ/nℤ\mathbb{Z}/n\mathbb{Z}.
  11. Infinite cyclic group: the infinite model ℤ\mathbb{Z}.
  12. Cyclic groups are abelian: powers of one element commute.
  13. Order of the cyclic subgroup equals the order of the element: the size of ⟨g⟩\langle g \rangle.
  14. Classification of cyclic groups: the order determines a cyclic group.
  15. Subgroups of cyclic groups are cyclic: the least positive exponent gives a generator.
  16. Subgroups of the integers: each one is nℤn\mathbb{Z}.
  17. Fundamental theorem of cyclic groups: one subgroup for each divisor of the order.
  18. Number of elements of each order in a cyclic group: the Euler totient counts them.
  19. Product of two cyclic groups: cyclic exactly when the orders are coprime.
  20. Exponent of a group: the least common multiple of the element orders.
  21. Finite abelian group is cyclic iff exponent equals order: a test for cyclicity.
  22. Finite subgroups of the units of a field are cyclic: an application to fields.
  23. Maximal subgroup: the proper subgroups that are as large as possible.
  24. Locally cyclic group: groups in which finitely generated subgroups are cyclic.

Prerequisites

  1. Groups and the group axioms: groups, the identity, inverses, the order of an element and the laws of exponents.
  2. The integers and divisibility: the division algorithm, the greatest common divisor and Bézout's identity.
  3. 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.

  1. Absolute value concept
  2. Affine group concept
  3. Alphabet concept
  4. Alternating group concept
  5. Arity concept
  6. Bijective function concept
  7. Boolean function concept
  8. Cardinality concept
  9. Cartesian product concept
  10. Commuting elements concept
  11. Complete lattice concept
  12. Complex conjugate concept
  13. Complex exponential concept
  14. Complex numbers object
  15. Congruence modulo n concept
  16. Coprime integers concept
  17. Countermodel concept
  18. Cycle notation concept
  19. Definition by recursion concept
  20. Determinant concept
  21. Dihedral group concept
  22. Direct product of groups concept
  23. Distributive lattice concept
  24. Divisibility definition
  25. Divisibility concept
  26. Effectively decidable set concept
  27. Element definition
  28. Elementary abelian group concept
  29. Equality (mathematics) concept
  30. Equinumerous sets concept
  31. Equivalence class concept
  32. Equivalence relation concept
  33. Euler's totient function concept
  34. Field concept
  35. Formal language concept
  36. Frattini subgroup concept
  37. Function concept
  38. General linear group object
  39. Greatest common divisor concept
  40. Group of units of a ring concept
  41. Identity matrix object
  42. Induction on well-formed formulas concept
  43. Injective function concept
  44. Integers object
  45. Integers modulo n concept
  46. Lattice concept
  47. Least common multiple concept
  48. Mathematical statement definition
  49. Matrix definition
  50. Modular lattice concept
  51. Multilinear map concept
  52. Natural numbers object
  53. Order isomorphism concept
  54. Peano axioms concept
  55. Permutation concept
  56. Polynomial concept
  57. Prime number concept
  58. Primitive root of unity concept
  59. Proof of Zorn's lemma proof
  60. Proposition concept
  61. Propositional letter concept
  62. Prüfer group example
  63. Rational numbers object
  64. Reflection concept
  65. Regular polygon concept
  66. Root of unity concept
  67. Rotation concept
  68. Set concept
  69. String concept
  70. Symmetric group concept
  71. Torsion group concept
  72. Torsion subgroup concept
  73. Transposition concept
  74. Tuple concept
  75. Vector space concept
  76. Vector space definition
  77. Signature concept
  78. Congruence modulo n definition
  79. Greatest common divisor definition
  80. Prime number definition
  81. Set definition
  82. Logical connective definition
  83. Binary operation definition
  84. Binary operation concept
  85. Connectives in mathematical language concept
  86. Matrix multiplication definition
  87. Square matrix definition
  88. Transpose definition
  89. Successor function definition
  90. Conjunction definition
  91. Disjunction definition
  92. Material implication definition
  93. Principle of bivalence concept
  94. Predicate concept
  95. Predicate definition
  96. Linear map definition
  97. Coprime integers definition
  98. Prime factorization definition
  99. Empty set object
  100. Family of sets definition
  101. Ordered pair definition
  102. Commutativity definition
  103. Associativity concept
  104. Cayley table concept
  105. Commutativity concept
  106. Identity element concept
  107. Set-builder notation concept
  108. Proof that congruence is compatible with addition proof
  109. Proof that congruence is compatible with multiplication proof
  110. Intersection definition
  111. Union definition
  112. Multilinear map definition
  113. Orthogonal matrix definition
  114. Addition of natural numbers definition
  115. Conditional statements concept
  116. Biconditional definition
  117. The successor function is injective statement
  118. Zero is not a successor statement
  119. Term concept
  120. Negation concept
  121. Negation definition
  122. Euler's totient function definition
  123. Cartesian product definition
  124. Congruence is compatible with addition statement
  125. Congruence is compatible with multiplication statement
  126. Disjoint sets definition
  127. Inverse element concept
  128. Atomic formula concept
  129. Alternating multilinear map definition
  130. Orthogonal group object
  131. Truth table concept
  132. Material implication concept
  133. Order on the natural numbers definition
  134. Conjunction concept
  135. Disjunction concept
  136. Group concept
  137. Determinant definition
  138. Biconditional concept
  139. Universal quantifier concept
  140. Universal quantifier definition
  141. Existential quantifier definition
  142. Direct product of groups definition
  143. Group homomorphism definition
  144. Group homomorphism concept
  145. Ring definition
  146. Subgroup definition
  147. Symmetric group definition
  148. Proof that a matrix with two equal rows has determinant zero proof
  149. Abelian group definition
  150. Order of a group concept
  151. Proof of the cancellation laws proof
  152. Abelian group concept
  153. Special orthogonal group object
  154. Subgroup concept member
  155. Proof of the uniqueness of identity and inverses proof
  156. Union of a family of sets definition
  157. Subset definition
  158. Axiom of extensionality statement
  159. Uniqueness quantifier definition
  160. Special linear group object
  161. Logical connective concept
  162. Proof that the determinant of the identity matrix is one proof
  163. Existential quantifier concept
  164. Proof that the determinant is multilinear in the rows proof
  165. Group isomorphism definition
  166. Image of a homomorphism concept
  167. Kernel of a homomorphism concept
  168. Commutative ring definition
  169. Polynomial ring definition
  170. Ring homomorphism definition
  171. Unit of a ring definition
  172. Zero divisor definition
  173. Determinant of a matrix with two equal rows statement
  174. Group isomorphism concept
  175. Klein four-group object
  176. Cancellation laws statement
  177. Proof of the intersection lemma for subgroups proof member
  178. Uniqueness of identity and inverses statement
  179. Binary relation definition
  180. Partition of a set definition
  181. Transposition definition
  182. Determinant is multilinear in the rows statement
  183. Well-formed formula concept
  184. Coset concept
  185. Determinant of the identity matrix statement
  186. Propositional formula definition
  187. Propositional formula concept
  188. Divisibility in a commutative ring definition
  189. Degree of a polynomial definition
  190. Polynomial evaluation definition
  191. Field definition
  192. Integral domain definition
  193. Proof of the laws of exponents in a group proof
  194. Left coset concept
  195. Antisymmetric relation definition
  196. Reflexive relation definition
  197. Symmetric relation definition
  198. Transitive relation definition
  199. Function definition
  200. Formal system concept
  201. Proof of unique readability by counting brackets proof
  202. Leading coefficient definition
  203. Root of a polynomial definition
  204. Proof of cancellation in an integral domain proof
  205. Evaluation homomorphism definition
  206. Laws of exponents in a group statement
  207. Equivalence relation definition
  208. Preorder definition
  209. Right coset concept
  210. Injective function definition
  211. Choice function definition
  212. Unique readability theorem statement
  213. Monic polynomial definition
  214. Multiplicity of a root definition
  215. Order of an element concept
  216. Proof of the degree of a product over an integral domain proof
  217. Proof of the remainder theorem proof
  218. Cancellation in an integral domain statement
  219. Cyclic subgroup generated by an element definition
  220. Index of a subgroup concept
  221. Partial order definition
  222. Equivalence class definition
  223. Proof that homomorphisms preserve identity and inverses proof
  224. Proof of the subgroup criterion proof member
  225. Proof that disjoint cycles commute proof
  226. Proof that all cosets have the same size proof
  227. Axiom of choice statement
  228. Truth valuation concept
  229. Division algorithm for polynomials statement
  230. Degree of a product statement
  231. Conjugate elements concept
  232. Cyclic subgroup generated by an element concept member
  233. Cyclic group definition
  234. All cosets have the same size statement
  235. Hasse diagram concept
  236. Homomorphisms preserve identity and inverses statement
  237. Maximal element definition
  238. Subgroup criterion statement member
  239. Total order definition
  240. Upper bound definition
  241. Proof that equivalence classes form a partition proof
  242. Disjoint cycles commute statement
  243. Logical consequence concept
  244. Remainder theorem statement
  245. Proof that R[x] is an integral domain iff R is proof
  246. The cyclic subgroup generated by i in the nonzero complex numbers example member
  247. Conjugate subgroup concept
  248. Intersection of subgroups statement member
  249. Chain definition
  250. Equivalence classes form a partition statement
  251. Proof that a homomorphism is injective iff its kernel is trivial proof
  252. Rule of inference concept
  253. The cyclic subgroup generated by 2 in the nonzero rational numbers example member
  254. The nonnegative powers of 2 are not the cyclic subgroup generated by 2 example member
  255. Proof of the factor theorem proof
  256. R[x] is an integral domain iff R is statement
  257. Subgroup generated by a subset definition
  258. Subgroup generated by a subset concept member
  259. Normal subgroup concept
  260. Modus ponens concept
  261. Proof of Lagrange's theorem proof
  262. A homomorphism is injective iff its kernel is trivial statement
  263. Zorn's lemma statement
  264. Factor theorem statement
  265. Product of two subgroups concept
  266. Proof that kernels are normal proof
  267. Generating set concept member
  268. Mathematical proof concept
  269. Lagrange's theorem statement
  270. Proof of normality via cosets proof
  271. Lattice of subgroups concept member
  272. The set of e, (1 2) and (1 3) is not the subgroup that they generate example member
  273. The transposition (1 2) and the 3-cycle (1 2 3) generate S3 example member
  274. Proof that a polynomial over a field has at most as many roots as its degree proof
  275. Kernels are normal statement
  276. Finitely generated group concept member
  277. Normality via cosets statement
  278. Direct proof concept
  279. The lattice of subgroups of D4 is not modular example member
  280. The 3-cycle (1 2 3) does not generate S3 example member
  281. The group Z/6 has minimal generating sets of sizes 1 and 2 example member
  282. The lattice of subgroups of S3 example member
  283. Mathematical induction concept
  284. The symmetries of a square are generated by a rotation and a reflection example member
  285. A polynomial over a field has at most as many roots as its degree statement
  286. A finitely generated group of affine maps with a subgroup that is not finitely generated example member
  287. Quotient group concept
  288. Proof by cases concept
  289. Proof of the commutativity of addition by induction proof
  290. Proof of strong induction from ordinary induction proof
  291. Proof of the universal property of the quotient group proof
  292. Proof of the correspondence theorem proof
  293. Strong induction statement
  294. Commutativity of addition statement
  295. Universal property of the quotient group statement
  296. Correspondence theorem statement
  297. Proof of the well-ordering principle from strong induction proof
  298. Proof of the first isomorphism theorem proof
  299. Maximal subgroup concept member
  300. Well-ordering principle statement
  301. Proof of the division algorithm proof
  302. First isomorphism theorem statement
  303. Proof of the existence of a prime divisor proof
  304. The point stabilizer S_{n-1} is a maximal subgroup of S_n example member
  305. Existence of a prime divisor statement
  306. Division algorithm statement
  307. Circle group object
  308. Proof of the existence of prime factorization proof
  309. Proof of the decomposition of a permutation into disjoint cycles proof
  310. Proof of Bézout's identity proof
  311. Proof that g^n = e if and only if the order of g divides n proof
  312. Additive group of integers example
  313. Existence of prime factorization statement
  314. Bézout's identity statement
  315. The odd integers are not a subgroup of the integers example member
  316. Decomposition of a permutation into disjoint cycles statement
  317. g^n = e if and only if the order of g divides n statement
  318. The even integers form a subgroup of the integers example member
  319. Proof that the order of ⟨g⟩ equals the order of g proof member
  320. Proof of the sum of the totient over the divisors proof
  321. Proof of the generalized Euclid's lemma proof
  322. Cyclic group concept member
  323. Proof of the decomposition of a permutation into transpositions proof
  324. Order of ⟨g⟩ equals the order of g statement member
  325. Proof that cyclic groups are abelian proof member
  326. The Klein four-group is abelian but not cyclic example member
  327. Decomposition of a permutation into transpositions statement
  328. Locally cyclic group concept member
  329. Sum of the totient over the divisors statement
  330. Generalized Euclid's lemma statement
  331. Integers modulo n form a cyclic group example member
  332. The integers modulo 2 and the group of signs are isomorphic example member
  333. Proof that the order of an element divides the order of the group proof
  334. Sign of a permutation definition
  335. Cyclic groups are abelian statement member
  336. Proof of the Chinese remainder theorem proof
  337. Proof that the symmetric group is generated by transpositions proof
  338. The group Z × Z is finitely generated but not cyclic example member
  339. Proof of Euclid's lemma proof
  340. Proof of the formula for the order of a power proof
  341. The cyclic subgroups of the Klein four-group do not form a lattice example member
  342. Chinese remainder theorem statement
  343. Order of an element divides the order of the group statement
  344. The symmetric group is generated by transpositions statement
  345. Proof that subgroups and quotients of cyclic groups are cyclic proof member
  346. Euclid's lemma statement
  347. Order of a power statement
  348. Proof that g to the order of the group is the identity proof
  349. Proof of the fundamental theorem of arithmetic proof
  350. Subgroups of cyclic groups are cyclic statement member
  351. Exponent of a group concept member
  352. Proof that permuting rows multiplies the determinant by the sign proof
  353. Group of nth roots of unity object
  354. Fundamental theorem of arithmetic statement
  355. Permuting rows multiplies the determinant by the sign statement
  356. g to the power of the group order is 1 statement
  357. The additive group of rational numbers is locally cyclic but not finitely generated example member
  358. Proof of the classification of subgroups of the integers proof member
  359. The exponent of the symmetric group S3 is 6 example member
  360. The Prüfer group is locally cyclic example member
  361. Cyclic group of order n example member
  362. An infinite direct product of copies of Z/2 has exponent 2 example member
  363. The Prüfer group has no finite exponent example member
  364. Subgroups of the integers statement member
  365. Proof of the Leibniz formula from the defining properties of the determinant proof
  366. Leibniz formula for determinants statement
  367. The subgroup 4Z of Z is not maximal example member
  368. The subgroup of the integers generated by 4 and 6 is 2Z example member
  369. Infinite cyclic group example member
  370. Proof that Z/m × Z/n is cyclic iff gcd(m, n) = 1 proof member
  371. Proof of the fundamental theorem of cyclic groups proof member
  372. Proof of the classification of cyclic groups proof member
  373. Proof that the determinant is multiplicative by expanding the rows proof
  374. Fundamental theorem of cyclic groups statement member
  375. Z/m × Z/n is cyclic iff gcd(m, n) = 1 statement member
  376. Classification of finite abelian groups statement
  377. Determinant is multiplicative statement
  378. Classification of cyclic groups statement member
  379. Proof of the count of elements of each order in a cyclic group proof member
  380. The lattice of subgroups of Z/12 example member
  381. The maximal subgroups of Z/12 are the subgroups generated by 2 and by 3 example member
  382. Proof that a finite abelian group is cyclic iff its exponent equals its order proof member
  383. Number of elements of each order in a cyclic group statement member
  384. The special linear group is a subgroup of the general linear group example member
  385. A finite abelian group is cyclic iff its exponent equals its order statement member
  386. Counting proof that finite subgroups of the multiplicative group of a field are cyclic proof member
  387. Proof that finite subgroups of the multiplicative group of a field are cyclic proof member
  388. Finite subgroups of the multiplicative group of a field are cyclic statement member
About this page
TagBAVE5RN4EE
URIm2://BAVE5RN4EE
Kindtopic
WritingW0 stub
MSC20A05, 20D30
Part ofGroup theory
Changed17 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.

The changes to this page, the oldest first
DateChangeFieldBy
2026-11-17addthe whole nodetamnd
2026-11-17addthe section Remarkstamnd
2026-11-17changethe section Summarytamnd

What links here

Nodes in this topic