How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Every positive divisor of the order of a finite cyclic group occurs as the order of a subgroup
Example
Let be finite of order . If the positive integer divides , write with . Then
is a subgroup of order .
Facts & Assumptions
Given: A finite cyclic group of order , and positive integers satisfying .
The generated set is a subgroup, and its cardinality is the order of (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups, , and every cyclic group is abelian, If then iff is an integer multiple of , the powers are distinct, and has exactly elements; if has infinite order then only for ).
The canonical embedding preserves products and order; is an ordered commutative ring and multiplication by a nonzero integer is cancellative (The naturals embed in the integers, The integers form a commutative ring, The integers form a totally ordered ring, The integers have no zero divisors; multiplicative cancellation, Divisibility in : when for some integer ).
If a positive natural exponent satisfies , then has finite order, and its order is the least such positive exponent and is at most ; if there is no such exponent, its order is (The order of a finite group and the order of an element, with when no positive power of is the identity).
Verification
Put . Then , so has finite order and .
If for a positive natural , then , so [L1] gives . Thus for some integer , and cancellation by the positive integer gives .
No positive satisfies : step 1.2 would give ; positivity forces , hence , a contradiction. Together with step 1.1, this gives .
Therefore is a subgroup with .
Depends on
- Divisibility in $\mathbb{Z}$: $d \mid a$ when $a = dq$ for some integer $q$
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
- If $\operatorname{ord}(g) = n$ then $g^{k} = e$ iff $k$ is an integer multiple of $n$, the powers $g^{0}, \dots, g^{n-1}$ are distinct, and $\langle g \rangle$ has exactly $n$ elements; if $g$ has infinite order then $g^{j} = g^{k}$ only for $j = k$
- Powers $g^{n}$: natural exponents in a monoid and integer exponents in a group, with $g^{0} = e$
- Exponent laws in a group: $g^{m+n} = g^{m}g^{n}$ and $(g^{m})^{n} = g^{mn}$ for all $m, n \in \mathbb{Z}$, and $(gh)^{n} = g^{n}h^{n}$ **when $g$ and $h$ commute**
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- $\langle g \rangle = \{\, g^{n} : n \in \mathbb{Z} \,\}$, and every cyclic group is abelian
- The naturals embed in the integers
- The integers form a commutative ring
- The integers form a totally ordered ring
- The integers have no zero divisors; multiplicative cancellation
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 69 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Thomas W. Judson, Abstract Algebra: Theory and Applications, Cyclic Groups (standard reference, not scraped)
- Thomas W. Judson, Abstract Algebra: Theory and Applications, §4.1: Cyclic Subgroups (standard reference, not scraped)
- Thomas W. Judson, Abstract Algebra: Theory and Applications, §6.2: Lagrange's Theorem (standard reference, not scraped)