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.
The rank of is the number of conjugacy classes of cyclic subgroups
Statement
Let be a finite group. The rank of the free abelian group equals the number of conjugacy classes of cyclic subgroups of .
Facts & Assumptions
Given: A finite group .
The map from to the product over cyclic conjugacy classes is injective (Cyclic fixed-space dimensions detect rational virtual characters).
The induced trivial representation is the permutation representation of on (Inducing the trivial representation gives the permutation representation on ).
The character of a permutation representation counts fixed points (The character of a permutation representation counts fixed points).
Proof
Choose representatives of the conjugacy classes of cyclic subgroups of . By [F1], the group injects into , so its rank is at most .
For each , let , viewed as an element of . Suppose that with . Reorder the representatives so that , and choose minimal with . Let be a generator of .
If , then [F2] and [F3] show that fixes some coset , so . Therefore a conjugate of the cyclic subgroup lies in , which implies . In the relation from step 1.2, every index has by minimality of , so only can contribute. For such , the ordering gives , hence . A subgroup of with the same finite order as must equal , so the conjugate of lying in is all of . Thus is conjugate to , and because were chosen as distinct conjugacy-class representatives, this forces . On the other hand, fixes the coset itself, so [F2] and [F3] give . Evaluating the relation from step 1.2 at therefore yields , a contradiction. Thus the are linearly independent.
Step 2.1 gives linearly independent elements of , while step 1.1 shows that the rank is at most . Hence , the number of cyclic conjugacy classes.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Tammo tom Dieck, Representation Theory, Proposition (4.5.4) (standard reference, not scraped)