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 abelian groups of order in elementary-divisor and invariant-factor form
Example
Since , the elementary-divisor and invariant-factor forms pair as follows:
| Elementary-divisor form | Invariant-factor form |
|---|---|
Facts & Assumptions
Given: Partitions of positive integers (Partitions of a positive integer).
For a finite abelian group, the PID-module elementary divisors and invariant factors agree with the published group-theoretic data (The PID-module and finite-abelian-group classifications have the same canonical data).
Verification
The exponent of has partitions , , and ; the exponent of has partitions and ; the exponent of has partition . By [L1], independently combining these choices gives exactly the elementary-divisor rows displayed.
Align prime-power factors on the right and multiply columns. The resulting columns are respectively , , , , , and , giving the displayed invariant forms by [L1].
In every row the product of the invariant factors is , and each factor divides the next. Factoring those factors back into prime powers reproduces its elementary-divisor row, so no regrouping is duplicated.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
9 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
- K. Conrad, Modules over a PID, finite abelian group specialization (standard reference, not scraped)
- M. Brussel, Finitely Generated Modules over a PID, Section 4 (standard reference, not scraped)