Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 2026-08-17
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 p-group is Artinian but not Noetherian

Example

For every prime p, the Prüfer group Z(p∞)≤Q/Z is Artinian but not Noetherian as a Z-module. See Noetherian modules: every submodule is finitely generated.

Facts & Assumptions

Given: The hypotheses and objects in the Example.

[L1]

A left R-module M is Noetherian when every submodule of M 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).

[L2]

A left R-module M is Artinian when every descending chain M0⊇M1⊇⋯ of submodules stabilizes: there is N such that Mn=MN for all n≥N. This is the descending chain condition. (Artinian modules by the descending chain condition).

[L3]

(Q,+,⋅,0,1) with the operations of def-rat-operations is a field: a commutative ring with 1≠0 in which every nonzero element has a multiplicative inverse. (The rationals form a field).

[L4]

The map j(k)=[(k,1)] is injective and preserves addition, multiplication, and order. Composing with lem-nat-embeds-int embeds N in Q; we write k for j(k) throughout. (The integers embed in the rationals).

[L5]

For N≤M, the additive cosets m+N form the quotient module M/N under the well-defined scalar action r(m+N):=rm+N. (Quotient module M/N with scalar multiplication on additive cosets).

Verification

technique · direct
1.1L1L2L3L4L5givenalgebra

Let Cn={a/pn+Z:a∈Z}≤Q/Z. The class 1/pn+Z generates Cn and has order pn, while Cn<Cn+1. If an element of ⋃kCk has order dividing pn, cancelling its denominator shows that it lies in Cn. Hence every cyclic subgroup of order pn is Cn, and Z(p∞):=⋃n≥0Cn is the Prüfer p-group.

2.1step 1.1L1givenalgebra

The group is not finitely generated, which is the failure of [L1] directly: a finite subset of ⋃kCk lies in a single CN, because each of its finitely many members lies in some Ck and the Ck are nested, so the submodule it generates is contained in CN and is proper. Equivalently, the strict ascending chain C0<C1<C2<⋯ of step 1.1 does not stabilize.

3.1step 1.1step 2.1givenalgebra

If a subgroup H contains elements of unbounded order, then for every n it contains an element whose cyclic subgroup contains the unique Cn, so Cn≤H and H=Z(p∞). Otherwise the element orders in H are bounded by some pn, and step 1.1 gives H≤Cn. The subgroups of the cyclic group Cn are the unique Cm for 0≤m≤n, so every proper subgroup of the Prüfer group is one of these finite cyclic groups.

4.1step 3.1givenalgebra∎

A descending chain either remains at the whole group or enters some finite Cn, after which it stabilizes because Cn has only the chain 0=C0<C1<⋯<Cn of subgroups. Thus DCC holds. The argument includes C0=0 and is unchanged for p=2. This proves the stated claim.

Depends on

Used by

Dependency tree · two levels

17 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