Alphabeta Math
TheoremStatement: 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.

Simultaneous bases for a submodule of a finite free module over a PID

Statement

Let R be a PID, let M be free of finite rank n, and let N≤M. For a submodule N of a finite free PID module, aligned bases have nonzero factors a1∣⋯∣ar. More precisely, there is a basis e1,…,en of M and nonzero elements a1∣⋯∣ar such that there is a basis a1e1,…,arer of the submodule with r≤n.

Facts & Assumptions

Given: Induction on natural-number rank (The principle of mathematical induction) and the rank convention of Invariant basis number and the rank of a free module.

[L1]

If 0≠N≤M with M finite free over a PID, there are ψ∈M∗, e1∈M, and 0≠a∈R such that ψ(e1)=1, M=Re1⊕ker⁡ψ, N=Rae1⊕(N∩ker⁡ψ), and ψ(N)=(a) is maximal among the functional value ideals containing a fixed nonzero value ideal (A nonzero PID submodule has a maximal coordinate ideal and a primitive pivot).

Proof

technique · induction
1.1base

If n=0, then M=N=0 and both bases are empty, giving r=0. If N=0 for any n, choose any basis of M and the empty basis of N.

1.2ih

Assume the theorem for free ambient modules of rank less than a fixed n≥1.

1.3L1

For nonzero N≤M of rank n, apply [L1] to obtain M=Re1⊕M1 and N=Ra1e1⊕N1, where M1=ker⁡ψ is free of rank n−1 and N1=N∩M1.

2.1step 1.3step 1.2L1discharge-induction∎

Apply the induction hypothesis of step 1.2 to N1≤M1, obtaining basis vectors e2,…,en and, when N1≠0, factors a2∣⋯∣ar. If N1=0, then r=1 and the required chain consists only of a1. Otherwise let e1∗,e2∗ be the coordinate functionals of the combined ambient basis and put φ=e1∗+e2∗. Since φ(a1e1)=a1, one has (a1)⊆φ(N); maximality of the pivot value ideal in [L1] forces equality, and a2=φ(a2e2)∈(a1), so a1∣a2. Concatenating the bases gives the required aligned bases and chain, with r≤n, and completes the induction.

Depends on

Used by

Dependency tree · two levels

10 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