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.
If is cyclic, then is abelian
Statement
If the quotient group is cyclic, then is abelian.
Facts & Assumptions
Given: A group such that is cyclic.
The center consists of the elements commuting with every element of (The center of a group).
The center is a normal subgroup of (The center of a group is a normal subgroup).
Multiplication in is (The quotient group and coset product ).
A cyclic group is generated by one element (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
The subgroup generated by an element is the set of its integer powers (, and every cyclic group is abelian).
Powers of one group element commute with one another (Exponent laws in a group: and for all , and when and commute).
Equality of left cosets is equivalent to ( iff , and iff ).
Proof
Choose generating . By [L3]--[L6], arbitrary satisfy and for some integers . By [L7], and lie in ; setting and gives and .
The elements commute with every element by [L1], and commutes with by [L6].
Therefore . Since were arbitrary, is abelian.
Depends on
- The center $Z(G)$ of a group
- The center of a group is a normal subgroup
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- 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
- 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**
- $x\in aH$ iff $a^{-1}x\in H$, and $aH=bH$ iff $a^{-1}b\in H$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 63 results over 17 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
- T. W. Judson, Abstract Algebra: Theory and Applications, Corollary 14.16, proof (standard reference, not scraped)