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 Prüfer -group is Artinian but not Noetherian
Example
For every prime , the Prüfer group is Artinian but not Noetherian as a -module. See Noetherian modules: every submodule is finitely generated.
Facts & Assumptions
Given: The hypotheses and objects in the Example.
A left -module is Noetherian when every submodule of is finitely generated (def-generated-cyclic-finitely-generated-and-free-modules). This finite-generation definition is the convention; its equivalence with ACC and the maximal condition is proved in thm-equivalent-characterizations-of-noetherian-modules. (Noetherian modules: every submodule is finitely generated).
A left -module is Artinian when every descending chain of submodules stabilizes: there is such that for all . This is the descending chain condition. (Artinian modules by the descending chain condition).
with the operations of def-rat-operations is a field: a commutative ring with in which every nonzero element has a multiplicative inverse. (The rationals form a field).
The map is injective and preserves addition, multiplication, and order. Composing with lem-nat-embeds-int embeds in ; we write for throughout. (The integers embed in the rationals).
For , the additive cosets form the quotient module under the well-defined scalar action (Quotient module with scalar multiplication on additive cosets).
Verification
Let . The class generates and has order , while . If an element of has order dividing , cancelling its denominator shows that it lies in . Hence every cyclic subgroup of order is , and is the Prüfer -group.
The group is not finitely generated, which is the failure of [L1] directly: a finite subset of lies in a single , because each of its finitely many members lies in some and the are nested, so the submodule it generates is contained in and is proper. Equivalently, the strict ascending chain of step 1.1 does not stabilize.
If a subgroup contains elements of unbounded order, then for every it contains an element whose cyclic subgroup contains the unique , so and . Otherwise the element orders in are bounded by some , and step 1.1 gives . The subgroups of the cyclic group are the unique for , so every proper subgroup of the Prüfer group is one of these finite cyclic groups.
A descending chain either remains at the whole group or enters some finite , after which it stabilizes because has only the chain of subgroups. Thus DCC holds. The argument includes and is unchanged for . This proves the stated claim.
Depends on
Used by
- False statement: every Artinian module is Noetherian False statement
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 40 results over 11 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
- Arvind Nair, Algebra I, Lecture 5 (standard reference, not scraped)