Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
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 nonzero PID submodule has a maximal coordinate ideal and a primitive pivot

Statement

Let R be a PID, let M be a nonzero finite free R-module, and let 0≠N≤M. A nonzero submodule of a finite free PID module admits a primitive pivot splitting both the ambient module and submodule. More precisely, there are ψ∈M∗, e1∈M, a nonzero a∈R, and v=ae1∈N such that ψ(e1)=1, the ideal ψ(N)=(a) is maximal among value ideals φ(N) containing a fixed nonzero value ideal, and

M=Re1⊕ker⁡ψ,N=Rae1⊕(N∩ker⁡ψ).

Moreover e1 belongs to a basis of M, and ker⁡ψ is free of rank one less than the rank of M.

The maximality is taken among all functional value ideals, so it remains available after the pivot is split off.

Facts & Assumptions

Given: The dual module M∗=Hom⁡R(M,R) of The R-module Hom⁡R(M,N) over a commutative ring and coordinate functionals from a finite free basis (The free module on a set and its standard basis).

[L1]

Every principal ideal domain is a unique factorisation domain (Every principal ideal domain is a unique factorisation domain).

Proof

technique · direct
1.1L1choose

Some coordinate functional has a nonzero value on N. Fix one such nonzero value ideal I0. By [L1], a nonzero generator of I0 has only finitely many divisor classes, so only finitely many principal ideals can contain I0. Choose a maximal value ideal among them, write it as ψ(N)=(a) with a≠0, and choose v∈N with ψ(v)=a.

2.1step 1.1algebra

For any coordinate functional φ, let d generate (a,φ(v)) and choose r,s with d=ra+sφ(v). The functional rψ+sφ takes v to d, so its value ideal contains (d)⊇(a); maximality in step 1.1 forces (d)=(a), hence a∣φ(v).

3.1step 2.1algebra

Divisibility of every coordinate of v gives v=ae1 for some e1∈M. Since a=ψ(v)=aψ(e1) and a≠0, cancellation gives ψ(e1)=1, so e1 is primitive.

4.1step 3.1algebra

The ideal generated by the coordinates of e1 in a basis of M is {φ(e1):φ∈M∗}, so it does not depend on the basis, and ψ(e1)=1 makes it all of R. Fix a basis f1,…,fn of M and let b1,…,bn be the coordinates of e1 in it. For j≥2 let d generate (b1,bj). If d=0 then b1=bj=0 and nothing is done; otherwise write d=rb1+sbj and put A=(rs−bj/db1/d), whose entries lie in R and whose determinant is (rb1+sbj)/d=1, so A−1 has entries in R as well. Replacing the basis pair (f1,fj) by the pair whose coordinates are the columns of A−1 again gives a basis of M, in which the coordinates of e1 at 1 and j are the entries of A(b1,bj)T=(d,0)T and the other coordinates are unchanged. Doing this for j=2,…,n in turn clears the coordinates 2,…,n, so the resulting basis g1,…,gn has e1=cg1 with (c) the coordinate ideal, which is R. Hence c is a unit and e1,g2,…,gn is a basis of M.

5.1step 4.1step 3.1step 1.1algebra∎

Put uj=gj−ψ(gj)e1 for 2≤j≤n. The passage from e1,g2,…,gn to e1,u2,…,un is triangular with 1 on the diagonal, so the latter is again a basis of M, and each uj lies in ker⁡ψ. If m=λ1e1+∑j≥2λjuj lies in ker⁡ψ, applying ψ gives λ1=0; hence u2,…,un is a basis of ker⁡ψ, which is therefore free of rank n−1, and zero when n=1. Every m∈M is ψ(m)e1+(m−ψ(m)e1) with the second summand in ker⁡ψ, and Re1∩ker⁡ψ=0 because ψ(re1)=r, so M=Re1⊕ker⁡ψ. For w∈N one has ψ(w)∈ψ(N)=(a), say ψ(w)=ra, and then w=rv+(w−rv) with w−rv∈N∩ker⁡ψ; also Rv∩ker⁡ψ=0, since ψ(rv)=ra and a≠0 in the domain R. Hence N=Rae1⊕(N∩ker⁡ψ). When a is a unit, v and e1 generate the same submodule and the second decomposition reads N=Re1⊕(N∩ker⁡ψ).

Depends on

Used by

Dependency tree · two levels

13 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