Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-09 (codex)
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.

A submodule of an arbitrary-rank free module over a PID is free

Statement

Assume the Axiom of Choice. If R is a PID, F is a free R-module, and N⊆F, then N is free (with no finite-rank assumption on F).

Facts & Assumptions

Given: a basis (ea)a∈W of F, a submodule N⊆F, and AC.

[L1]

A PID is a domain and every ideal is principal (Principal ideal domain).

[L2]

Basis expansions are unique and have finite support (The free module on a set and its standard basis).

[L3]

AC permits simultaneous selections from a set-indexed family of nonempty sets (The Axiom of Choice).

[L4]

Under AC the set W admits a well-order (The well-ordering theorem).

[L5]

Induction over a well-ordered set is valid (Transfinite induction).

Proof

1.1L2L4construct

Use [L4] to well-order W. For a∈W let F≤a and F<a be the spans of the corresponding basis initial segments. Let Ia be the image of N∩F≤a under the a-coordinate map. This image is an ideal because the coordinate map is R-linear.

2.1step 1.1L1L3choose

If Ia≠0, [L1] supplies a nonzero generator ra and the definition of the image supplies xa∈N∩F≤a with a-coordinate ra. The sets of such pairs (ra,xa) are nonempty and indexed by a subset of W; use [L3] to choose them simultaneously. This is the second use of AC, after well-ordering the basis.

3.1step 1.1step 2.1L2algebra

If y∈N∩F≤a and Ia=0, then y∈F<a. If Ia≠0, write its a-coordinate as cra; then y−cxa∈N∩F<a. In either case the remainder has finite support below a.

4.1step 3.1L2L5

Induct on a using [L5] to show that N∩F≤a is spanned by the chosen xb with b≤a. By step 3.1 it suffices to handle a finite-support remainder in F<a. A zero remainder needs no generators; otherwise its support has a greatest element b<a, so the induction hypothesis at b applies. This includes least and limit positions without selecting a cofinal sequence. Every nonzero element of N has a greatest support element, so the chosen family spans N.

5.1step 1.1step 2.1step 4.1L1L2∎

In a nonzero finite relation among the chosen xa, take the greatest index a with nonzero coefficient ca. Its a-coordinate is cara: all smaller-index vectors have zero coordinate there. Since R is a domain and ra≠0, this coordinate is nonzero, a contradiction. Thus the family is independent and is a basis by step 4.1. If W or N is empty or zero as applicable, the same argument gives the empty basis.

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