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

✓ 30 results · all verified · 28 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Modules over a Principal Ideal Domain and the Canonical Forms

1 · Prerequisites

2 · Summary

Modules, free modules, exact sequences, Noetherian conditions, principal ideals, determinants, and fraction fields supply the algebraic setting. The published finite-abelian-group classification provides the comparison target, while polynomial evaluation, minimal and characteristic polynomials, cyclic subspaces, similarity, and Jordan strings provide the operator language used by the canonical forms.

Principal ideal domains are first shown to be unique-factorisation domains, after which aligned bases produce invariant factors, primary components, elementary divisors, and their uniqueness. Determinantal divisors give Smith normal form, and scalar extension identifies free rank with fraction-field dimension. Applying the structure theorem to VT yields rational canonical form, the minimal- and characteristic-polynomial dictionaries, a module-theoretic Cayley-Hamilton proof, and a second Jordan-form construction whose blocks agree with the published Jordan-string classification.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The p-primary component of a module over a domain

Definition

Let R be an integral domain, let M be an R-module, and let p∈R be irreducible (Irreducible and prime elements of an integral domain). The p-primary component of M is

M[p∞]:={m∈M:pkm=0 for some integer k≥1}.

It is contained in the torsion subset Tor⁡(M) of Annihilators, torsion elements and the torsion subset of a module. That both sets are submodules, as their names require, is proved in Torsion elements and p-primary elements form submodules over a domain ↗.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Torsion elements and p-primary elements form submodules over a domain

Statement

Let R be an integral domain and M an R-module. The torsion subset Tor⁡(M) is a submodule. For every irreducible p∈R, the p-primary component M[p∞] is a submodule of Tor⁡(M).

Facts & Assumptions

Given: An integral domain R, an R-module M, the p-primary definition of The p-primary component of a module over a domain, and the submodule test of Submodule of a module.

[F1]

If R is an integral domain, an element m∈M is a torsion element when rm=0M for some nonzero r∈R (Annihilators, torsion elements and the torsion subset of a module).

Proof

technique · direct
1.1F1algebra

The zero element is torsion. If am=0 and bn=0 with a,b≠0, then ab≠0 and ab(m+n)=b(am)+a(bn)=0; if c∈R, then a(cm)=c(am)=0. Closure under negatives is the scalar case c=−1, so Tor⁡(M) is a submodule.

2.1givenalgebra∎

The zero element lies in M[p∞]. If pkm=0 and pℓn=0 with k,ℓ≥1, then pmax⁡(k,ℓ)(m+n)=0, and pk(cm)=0 for every c∈R. Thus M[p∞] is a submodule contained in Tor⁡(M). The proof includes k=1, the zero module, and replacing p by an associate.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Every principal ideal domain is Noetherian

Statement

Every principal ideal domain is Noetherian.

Facts & Assumptions

Given: A principal ideal domain R, regarded as its left regular module, and the Noetherian-ring convention of Left and right Noetherian rings.

[F1]

An integral domain R is a principal ideal domain when every ideal I⊴R is principal: I=(a) for some a∈R (Principal ideal domain).

[L1]

A module is Noetherian exactly when every submodule is finitely generated (Finite generation, ACC, and maximal-condition characterizations of Noetherian modules).

Proof

technique · direct
1.1F1

A submodule of the left regular module RR is an ideal. By [F1] it is generated by one element; this includes the zero ideal (0) and unit ideal (1).

2.1step 1.1L1∎

Thus every submodule of RR is finitely generated, so [L1] makes the regular module Noetherian and hence makes R a Noetherian ring. Commutativity makes the same statement valid on the right.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Every irreducible element of a principal ideal domain is prime

Statement

Every irreducible element of a principal ideal domain is prime.

Facts & Assumptions

Given: A PID R, an irreducible p∈R, the irreducible and prime element definitions of Irreducible and prime elements of an integral domain, and maximal and prime ideals as in Prime ideals and maximal ideals in a commutative ring.

[F1]

In a PID, there is an a∈R with I=(a) for every ideal I (Principal ideal domain).

[L1]

Every maximal ideal in a commutative unital ring is prime (Every maximal ideal of a commutative ring is prime).

Proof

technique · direct
1.1F1givenalgebra

Let (p)⊆I⊆R. By [F1], write I=(a), so p=ab for some b. Irreducibility makes a or b a unit. If a is a unit, I=R; if b is a unit, (a)=(p). Since p is a nonzero nonunit, (p) is proper and therefore maximal.

2.1step 1.1L1

By [L1], the maximal ideal (p) is prime.

3.1step 2.1given∎

If p∣xy, then xy∈(p), so primality of the ideal gives x∈(p) or y∈(p), equivalently p∣x or p∣y. Thus p is a prime element. Associates generate the same ideal and give the same conclusion.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-24Open item page →

Every principal ideal domain is a unique factorisation domain

Statement

Assuming the Axiom of Choice, every principal ideal domain is a unique factorisation domain.

Facts & Assumptions

Given: A PID R, the Axiom of Choice (The Axiom of Choice), hence dependent choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain), and the UFD definition of Unique factorisation domain, which excludes zero from the factorization clause and treats a unit as an empty product of irreducibles.

[L1]

Every principal ideal domain is Noetherian (Every principal ideal domain is Noetherian).

[L2]

In a Noetherian module, every nonempty family of submodules has a maximal member; the route from ACC to this maximal condition carries the published dependent-choice cost (Finite generation, ACC, and maximal-condition characterizations of Noetherian modules).

[L3]

Every irreducible element of a principal ideal domain is prime (Every irreducible element of a principal ideal domain is prime).

Proof

technique · contradiction
1.1assume-contraL1L2givenchoosealgebra

Suppose, for contradiction, that some nonzero nonunit is not a product of irreducibles. The principal ideals generated by such bad elements form a nonempty family; by [L1] and [L2], choose a maximal member (a). This use of the maximal condition spends DC, supplied by the assumed AC. The element a is not irreducible, so a=bc with nonunit nonzero b,c. Then (a) is strictly contained in both (b) and (c): for example, (a)=(b) would give b=at=bct and cancellation would make c a unit. Maximality therefore makes b and c products of irreducibles, and their product is a factorization of a, a contradiction. Thus every nonzero nonunit factors into irreducibles.

1.2L3algebra

For uniqueness, if p1⋯pr=q1⋯qs are irreducible factorizations, primality of p1 from [L3] makes it divide some qj, hence the two factors are associates. Cancel them in the domain and repeat on the remaining finite product. This induction pairs every factor and shows r=s up to order and associates; the empty product is the unit case.

2.1step 1.1step 1.2givendischarge-contradiction∎

Step 1.1 gives factorization existence and step 1.2 gives the uniqueness required in the UFD definition. Therefore every PID is a UFD; the contradictory assumption in step 1.1 is discharged.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

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⁡ψ).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

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.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A submodule of a free module of finite rank over a PID is free of no larger rank

Statement

If M is free of finite rank n over a PID and N≤M, then N is free of a uniquely determined finite rank r≤n.

Facts & Assumptions

Given: Invariant basis number for nonzero commutative rings (Every nonzero commutative ring has invariant basis number for finite bases).

[L1]

There is a basis a1e1,…,arer of the submodule with r≤n (Simultaneous bases for a submodule of a finite free module over a PID).

Proof

technique · direct
1.1L1

The family in [L1] is an R-basis of N, so N is free and has a basis of length r≤n. The zero submodule has the empty basis, and ambient rank zero forces r=0.

2.1step 1.1given∎

Invariant basis number makes the finite basis length unique, so r is the rank of N. The endpoints r=0 and r=n, including N=M, are permitted.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Invariant factors and elementary divisors of a finitely generated module over a PID

Definition

Let R be a principal ideal domain and M a finitely generated R-module. In a decomposition

M≅Rr⊕R/(a1)⊕⋯⊕R/(at),a1∣a2∣⋯∣at,

where every ai is a nonzero nonunit, the associate classes of a1,…,at are the invariant factors of M. Unit factors are omitted.

After each ai is factored into powers of irreducibles and the coprime cyclic quotients are split, the resulting prime powers pe, counted with multiplicity and up to associates, are the elementary divisors of M. The summands belonging to one associate class of p form the p-primary component (The p-primary component of a module over a domain). The integer r is separate data and is not an elementary divisor.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Invariant-factor decomposition of a finitely generated module over a PID

Statement

Every finitely generated PID module is a finite free module direct-summed with cyclic torsion quotients. Precisely, if M is finitely generated over a PID R, then

M≅Rs⊕R/(a1)⊕⋯⊕R/(at),

where each ai is a nonzero nonunit and a1∣⋯∣at. Every finitely generated PID module has an invariant-factor decomposition. This assertion is existence; uniqueness is proved separately.

Facts & Assumptions

Given: A finitely generated module M, quotient modules (Quotient module M/N with scalar multiplication on additive cosets), and the first isomorphism theorem for modules (First isomorphism theorem for modules: M/ker⁡f≅im⁡f).

[L1]

For a submodule N of a free PID module M of finite rank n, there are a basis e1,…,en of M and nonzero elements a1∣⋯∣ar with r≤n such that a1e1,…,arer is a basis of N (Simultaneous bases for a submodule of a finite free module over a PID).

Proof

technique · constructive
1.1givenconstruct

Choose generators m1,…,mn of M and define the surjection π:Rn→M by sending the standard basis to them; put N=ker⁡π. For the zero module one may take n=0.

2.1step 1.1L1

Apply [L1] to N≤Rn. There is a basis e1,…,en of Rn and a basis a1e1,…,arer of N, with nonzero a1∣⋯∣ar.

3.1step 2.1givenalgebradischarge-construct∎

The first isomorphism theorem and coordinatewise quotient give M≅Rn/N≅R/(a1)⊕⋯⊕R/(ar)⊕Rn−r. Any unit ai contributes the zero quotient and is removed; the remaining nonunit factors preserve the divisibility chain. This constructs the stated decomposition, including purely free, purely torsion, cyclic, and empty cases.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Every finitely generated torsion-free module over a PID is free

Statement

Every finitely generated torsion-free module over a principal ideal domain is finite free.

Facts & Assumptions

Given: A finitely generated torsion-free R-module M, where torsion-free means Tor⁡(M)={0} (Annihilators, torsion elements and the torsion subset of a module).

[L1]

Every finitely generated PID module is a finite free module direct-summed with cyclic torsion quotients (Invariant-factor decomposition of a finitely generated module over a PID).

Proof

technique · direct
1.1L1given

In the decomposition from [L1], every nonzero quotient R/(ai) with ai≠0 consists of torsion elements, whereas the free summand is torsion-free because R is a domain. Torsion-freeness therefore forces every cyclic quotient summand to be zero.

2.1step 1.1∎

Only the finite free summand remains, so M is finite free. The zero module is the free module on the empty basis, and unit invariant factors already give zero summands.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A finitely generated PID module is its torsion submodule direct-summed with a finite free module

Statement

If M is finitely generated over a PID R, then

M≅Tor⁡(M)⊕Rr

for some r≥0. A finitely generated PID module is its torsion submodule direct-summed with a finite free module. The torsion submodule is canonical; a free complement need not be.

Facts & Assumptions

[L1]

Every finitely generated PID module is a finite free module direct-summed with cyclic torsion quotients (Invariant-factor decomposition of a finitely generated module over a PID).

Proof

technique · direct
1.1L1givenalgebra

In [L1], every cyclic quotient R/(ai) is torsion, and every torsion element has zero component in the free summand because a free module over a domain is torsion-free. Thus the direct sum of the cyclic quotients is exactly Tor⁡(M).

2.1step 1.1

Substituting that identification into the invariant-factor decomposition gives M≅Tor⁡(M)⊕Rr. It includes pure torsion when r=0, pure free modules when Tor⁡(M)=0, and the zero module when both vanish.

3.1step 2.1givenalgebra∎

The torsion submodule is canonical because it is defined by M alone, while a free complement is not. Suppose a∈R is a nonzero nonunit and put M=R⊕R/(a). Since R is a domain, an element (x,y+(a)) killed by some nonzero scalar has x=0, and a kills every (0,y+(a)); hence Tor⁡(M)=0⊕R/(a). Both C1=R (1,0+(a)) and C2=R (1,1+(a)) are free of rank one, because r(1,∗)=0 forces r=0, and each meets Tor⁡(M) only in 0 while (x,y+(a))=(0,(y−x)+(a))+x (1,1+(a)) shows Tor⁡(M)+C2=M and likewise for C1. They are distinct: (1,1+(a))∈C2 lies in C1 only if a∣1, contrary to a being a nonunit.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Coprime cyclic quotients over a PID split by the Chinese remainder map

Statement

Let R be a PID. If (a)+(b)=R, then R/(ab)≅R/(a)⊕R/(b). More generally, for a finite pairwise coprime family a1,…,at,

R/(a1⋯at)≅⨁j=1tR/(aj).

The empty family reads R/(1)=0, and the singleton case is the identity.

Facts & Assumptions

[F1]

In a PID every ideal is principal (Principal ideal domain).

Proof

technique · direct
1.1F1choose

Coprimality means (a,b)=R, so choose r,s∈R with ra+sb=1.

2.1step 1.1algebra

The map Φ:R/(ab)→R/(a)⊕R/(b) given by x+(ab)↦(x+(a),x+(b)) is well defined. If both residues vanish, a∣x and b∣x; multiplying the Bezout identity appropriately gives ab∣x, so Φ is injective. Given residues u+(a) and v+(b), the element usb+vra maps to them, so Φ is surjective and is an R-module isomorphism.

3.1step 2.1algebra∎

Repeatedly apply step 2.1 to a finite pairwise coprime family; the product of any subfamily remains coprime to the next factor. This gives the displayed finite direct sum, with the empty and singleton conventions stated above and with unit factors contributing zero quotients.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Primary decomposition and elementary-divisor form for finitely generated PID modules

Statement

Let M be finitely generated over a PID R. For each irreducible p, the p-primary component is a finite direct sum of modules R/(pe). A finitely generated torsion PID module is the direct sum of its prime-power cyclic elementary-divisor summands. In general,

M≅Rr⊕⨁p⨁jR/(pep,j),

with only finitely many nonzero summands. Conversely, aligning the prime powers into divisibility columns reconstructs an invariant-factor decomposition.

Facts & Assumptions

[L1]

Every finitely generated PID module is a finite free module direct-summed with cyclic torsion quotients (Invariant-factor decomposition of a finitely generated module over a PID).

[L2]

Coprime cyclic quotients split by the Chinese remainder map (Coprime cyclic quotients over a PID split by the Chinese remainder map).

Proof

technique · constructive
1.1L1given

Take the invariant-factor decomposition from [L1]. Factor each nonunit ai uniquely up to associates as a finite product of powers of pairwise nonassociate irreducibles. The free part is kept separate, and no factorization is assigned to zero or to a unit.

2.1step 1.1L2

The prime-power factors of one ai are pairwise coprime, so [L2] splits R/(ai) into the corresponding quotients R/(pe). Applying this to every invariant factor gives a finite elementary-divisor direct sum.

3.1step 2.1algebra

Grouping the summands by the associate class of p gives exactly M[p∞], because an element is killed by a power of p precisely in those summands. Thus the torsion submodule is the direct sum of its primary components, each having the asserted form.

4.1step 3.1L2constructdischarge-construct∎

Conversely, order the powers for each prime by exponent, align the largest powers in the last column, pad missing entries by units, and multiply down columns. Each column divides the next, and repeated use of [L2] recovers the original elementary-divisor sum. This constructs the invariant factors, including empty torsion data.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

p-power torsion dimensions recover the elementary divisors of a PID module

Statement

Let M be a finitely generated module over a PID R, fix an irreducible p, and for k≥1 put M[pk]={m∈M:pkm=0}. Then pk−1M[pk] is a vector space over R/(p), and

dk:=dim⁡R/(p)pk−1M[pk]

is the number of p-primary elementary divisors pe with e≥k. Hence dk−dk+1 is the multiplicity of pk. The dimensions of pk−1M[pk] recover every elementary-divisor exponent multiplicity.

Facts & Assumptions

[L1]

The p-primary component is a finite direct sum of modules R/(pe) (Primary decomposition and elementary-divisor form for finitely generated PID modules).

[L2]

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

Proof

technique · direct
1.1givenalgebra

Since p is prime, (p) is a prime ideal; in a PID it is maximal by the same divisibility argument as for irreducibles, so R/(p) is a field. Every element of pk−1M[pk] is killed by p, making this set an R/(p)-vector space.

2.1L1L2step 1.1algebra

On one summand C=R/(pe), if e≥k then C[pk]=pe−kC and pk−1C[pk]=pe−1C, a one-dimensional R/(p)-space. If e<k, then pk−1C=0, so the contribution is zero. For a q-primary summand with q not associated to p, unique factorisation [L2] makes pk and qe coprime, so choose u,v with upk+vqe=1; multiplication by u is inverse to multiplication by pk on R/(qe), and its pk-torsion is zero. Free summands likewise contribute no p-power torsion.

3.1step 2.1algebra

Direct sums commute with M[pk] and multiplication by pk−1, so dimensions add. By step 2.1, dk counts exactly the exponents e≥k; for k=1 it counts every p-primary cyclic summand, and beyond the largest exponent it is zero.

4.1step 3.1algebra∎

The summands counted by dk but not by dk+1 are exactly those with exponent e=k, so dk−dk+1 recovers their multiplicity. Empty primary data and the zero module give the zero sequence.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Uniqueness of invariant factors and elementary divisors over a PID

Statement

A finitely generated PID module is classified by its free rank and invariant factors, equivalently its elementary divisors. More precisely, the free rank is unique; invariant factors are unique up to associates in their divisibility order; elementary divisors are unique up to associates and permutation; and two finitely generated modules are isomorphic exactly when these data agree.

Facts & Assumptions

[L1]

The dimensions of pk−1M[pk] recover every elementary-divisor exponent multiplicity (p-power torsion dimensions recover the elementary divisors of a PID module).

Proof

technique · constructive
1.1given

An isomorphism carries torsion elements to torsion elements, so it induces an isomorphism of torsion submodules and of the quotients by torsion. The latter quotients are finite free, and invariant basis number recovers their common free rank.

2.1L1step 1.1

For every associate class of irreducible p and every k≥1, an isomorphism preserves M[pk], multiplication by pk−1, and the resulting R/(p)-dimension. By [L1], it therefore preserves every elementary-divisor multiplicity.

3.1step 2.1algebra

Aligning the unique prime-power columns as in the primary-decomposition theorem recovers one divisibility chain of invariant factors up to associates. Hence invariant factors are unique as well. Empty torsion data, pure torsion, pure free, and the zero module are included.

4.1step 3.1constructdischarge-construct∎

Conversely, equal free ranks and equal invariant-factor or elementary-divisor data give termwise isomorphisms between the corresponding direct-sum decompositions; their direct sum constructs a module isomorphism. This proves both directions of the classification.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The free rank of a finitely generated module over a PID

Definition

Let M be a finitely generated module over a principal ideal domain R. Its free rank, denoted rank⁡RM, is the unique integer r≥0 for which its invariant-factor decomposition has free summand Rr.

Uniqueness follows from Uniqueness of invariant factors and elementary divisors over a PID and agrees with the rank convention for finite free modules in Invariant basis number and the rank of a free module. In particular a torsion module has free rank 0.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Extension to the fraction field recovers the free rank of a finitely generated PID module

Statement

Let R be a PID, Q=Frac⁡(R), and M a finitely generated R-module. Then

dim⁡Q(Q⊗RM)=rank⁡RM.

Thus dim⁡Frac⁡(R)(Frac⁡(R)⊗RM) equals the free rank of M.

Facts & Assumptions

[L1]

Every finitely generated module over a PID R is isomorphic to Rs⊕R/(a1)⊕⋯⊕R/(at) with each ai a nonzero nonunit and a1∣⋯∣at (Invariant-factor decomposition of a finitely generated module over a PID).

[L2]

For every integral domain D, the localisation Frac⁡(D) is a field and contains an embedded copy of D (Frac⁡(D) is a field and d↦d/1 embeds the integral domain D).

[L3]

The unit tensor maps are module isomorphisms and respect every displayed outer module structure (The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M).

[L4]

Tensor products commute with arbitrary direct sums in either variable, including the empty sum (Tensor products commute with arbitrary direct sums).

Proof

technique · direct
1.1L1L4given

Write M≅Rr⊕T by [L1], with T=⨁i=1tR/(ai) and each ai a nonzero nonunit. This is an invariant-factor decomposition, so r=rank⁡RM by the free-rank definition in the Given. Extension of scalars and [L4] give Q⊗RM≅(Q⊗RT)⊕(Q⊗RRr).

2.1step 1.1L2algebra

Every m∈T is killed by the nonzero product a1⋯at∈R; in Q that scalar is invertible by [L2], so each simple tensor satisfies q⊗m=a−1q⊗am=0 for that a. Simple tensors generate the tensor product, hence Q⊗RT=0.

3.1step 1.1step 2.1L3L4∎

By [L3] and [L4], Q⊗RRr≅Qr. Therefore Q⊗RM≅Qr and its Q-dimension is r, which step 1.1 identified with rank⁡RM. This includes r=0, pure torsion, pure free, rank one, and the zero module, where t=0 makes T the zero module.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Matrix equivalence and Smith normal form over a PID

Definition

Let R be a principal ideal domain and let A,B∈Mm×n(R). The matrices are equivalent when

B=PAQ

for some P∈GL⁡m(R) and Q∈GL⁡n(R) (Invertible square matrices and similarity over a commutative ring).

A Smith normal form of A is an equivalent diagonal rectangular matrix

diag⁡(d1,…,dr,0,…,0),

where every di is nonzero and d1∣d2∣⋯∣dr. Multiplying any di by a unit gives the same Smith data. The zero matrix has r=0, and the definition also covers matrices with zero rows or zero columns.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Determinantal divisors from the minors of a matrix over a PID

Definition

Let A∈Mm×n(R) over a principal ideal domain R. For k≥1, the k-th determinantal ideal Dk(A) is the ideal generated by the determinants of all k×k minors of A (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix, The ideal generated by a subset and principal ideals). Set D0(A)=R. If k>min⁡(m,n), there are no such minors and Dk(A)=(0).

Since R is a PID (Principal ideal domain), write Dk(A)=(Δk(A)). The associate class of Δk(A) is the k-th determinantal divisor. Thus Δ0(A) is a unit up to associates, while a vanishing determinantal ideal has divisor 0.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Every matrix over a PID has a Smith normal form

Statement

Every rectangular matrix over a PID is equivalent to a Smith diagonal matrix. Equivalently, for every A∈Mm×n(R) there are invertible P,Q such that

PAQ=diag⁡(d1,…,dr,0,…,0),d1∣⋯∣dr,

with every di≠0. This is an existence theorem over a PID and does not assert a Euclidean row-reduction algorithm.

Facts & Assumptions

Given: Matrix equivalence and Smith form as in Matrix equivalence and Smith normal form over a PID; a matrix as a homomorphism φ:Rn→Rm; free modules are projective (Under the stated choice boundary, free modules are projective and hence flat); and the first isomorphism theorem identifies Rn/ker⁡φ with im⁡φ (First isomorphism theorem for modules: M/ker⁡f≅im⁡f).

[L1]

A submodule of a finite free PID module admits aligned bases with a divisibility chain (Simultaneous bases for a submodule of a finite free module over a PID).

[L2]

Given a section of a short exact sequence, the middle module is the direct sum of the kernel and the section image (The splitting lemma for short exact sequences of modules).

Proof

technique · constructive
1.1givenL1

Regard A as φ:Rn→Rm and put I=im⁡φ. By [L1], both I≤Rm and ker⁡φ≤Rn are finite free; the sequence 0→ker⁡φ→Rn→I→0 is exact.

2.1step 1.1L1

Apply [L1] to align I in the codomain: choose a basis e1,…,em of Rm such that d1e1,…,drer is a basis of I with d1∣⋯∣dr.

2.2step 1.1L2givenchoose

Since I is free and projective, the surjection Rn→I has a section. By [L2], Rn=ker⁡φ⊕s(I). Place the lifted basis s(d1e1),…,s(drer) first and then a basis of the kernel to obtain a domain basis.

3.1step 2.1step 2.2constructdischarge-construct∎

In the bases from steps 2.1 and 2.2, φ sends the lifted vector for diei to diei and kills the kernel basis, so its matrix is the displayed Smith diagonal. Empty matrices, the zero map, and all rank deficiencies give the appropriate empty or trailing-zero diagonal.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Smith normal form is unique through the gcds of its minors

Statement

Smith normal form is unique and its entries are recovered from successive determinantal divisors. If a matrix has nonzero Smith entries d1∣⋯∣dr, then, up to associates,

Δk=d1⋯dk(0≤k≤r),Δk=0(k>r),

and dk is the successive quotient Δk/Δk−1.

Facts & Assumptions

Given: Determinantal ideals and divisors from Determinantal divisors from the minors of a matrix over a PID, including D0=R; determinant multilinearity and alternation (The determinant is the unique normalized alternating multilinear function on the columns).

[L1]

Every rectangular matrix over a PID is equivalent to a Smith diagonal matrix (Every matrix over a PID has a Smith normal form).

Proof

technique · direct
1.1givenalgebra

Every k-minor of PA is an R-linear combination of k-minors of A by determinant multilinearity, so Dk(PA)⊆Dk(A); applying the same argument to P−1 gives equality. Right multiplication is identical. Thus equivalent matrices have the same determinantal ideals.

1.2L1algebra

For a Smith diagonal matrix with d1∣⋯∣dr, every nonzero k-minor is a product of k diagonal entries and is divisible by d1⋯dk, while the leading k-minor equals that product. Hence Δk is associate to d1⋯dk for k≤r and is 0 for k>r.

2.1step 1.1step 1.2∎

Step 1.1 makes the Δk invariants of equivalence. Step 1.2 recovers r as the last nonzero index and recovers each dk up to a unit from successive products, proving uniqueness. It includes k=0, zero matrices, one-by-one matrices, and all rectangular ranks.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Abelian groups and Z-modules have the same objects and morphisms

Statement

Every abelian group carries a unique Z-module structure whose scalar action is integer multiplication. Abelian groups and Z-modules have the same objects and morphisms; their subgroups, generated subobjects, cyclic objects, finite generation, and quotients agree.

Facts & Assumptions

Given: An abelian group G and the published additive integer-power construction.

[L1]

The integers form a commutative ring with multiplicative identity (The integers form a commutative ring).

[F1]

A group is abelian when its operation is commutative (Group and abelian group).

[F2]

A left R-module is an abelian group with a unital distributive scalar action (Unital left and right modules over a ring; unqualified module means left module).

[F3]

A group homomorphism preserves the group operation (Monoid homomorphism and group homomorphism).

[F4]

An R-module homomorphism preserves addition and scalar multiplication (Module homomorphism and isomorphism, kernel, image and cokernel).

[F5]

A subgroup is closed under the group operation and inverses (Subgroup).

[F6]

A submodule is an additive subgroup closed under scalars (Submodule of a module).

[F7]

The subgroup generated by S is the smallest subgroup containing S (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

[F8]

The submodule generated by S is the smallest submodule containing S (Generated submodule, cyclic and finitely generated modules, module basis and free module).

[F9]

The quotient group G/N consists of cosets when N is normal (The quotient group G/N and coset product (gN)(hN)=ghN).

[F10]

The quotient module M/N has the same additive cosets with induced scalar action (Quotient module M/N with scalar multiplication on additive cosets).

[L2]

Every subgroup of an abelian group is normal (Every subgroup of an abelian group is normal).

[F11]

Proof

technique · direct
1.1L1F1F2F11L3L4L5

Define n⋅g:=ng using [F11]. The integer-power laws [L3], [L4], and [L5], together with 1g=g and 0g=0, give the four module axioms over the ring in [L1]; commutativity in [F1] supplies the hypothesis for [L5]. Thus every abelian group becomes a Z-module.

2.1F2step 1.1algebra

Conversely, any Z-module action must satisfy 1g=g and (n+1)g=ng+g, so induction forces the action of every nonnegative integer. The equation 0=(−n+n)g=(−n)g+ng forces the negative action. Hence the action in step 1.1 is unique, including the zero scalar and the trivial group.

2.2F3F4step 1.1algebra

An additive group homomorphism preserves repeated sums and negatives, hence preserves ng for every integer n and is Z-linear. Every Z-linear map is additive by definition, so group homomorphisms and module homomorphisms are the same maps.

2.3F5F6step 1.1algebra

A subgroup of an abelian group is closed under every integer multiple and is therefore a Z-submodule; every submodule is already an additive subgroup. Thus subgroups and submodules agree.

3.1F7F8step 2.3

Since the two families of subobjects agree, their intersections over subobjects containing S agree. Hence generated subgroups and generated Z-submodules coincide, including S=∅, so cyclicity and finite generation agree.

3.2F9F10L2step 1.1step 2.3

By [L2], every subgroup is normal. The quotient group and quotient module have the same cosets and addition, and the unique integer action on cosets is n(g+N)=ng+N, so the quotient objects agree, including N=0 and N=G.

4.1step 1.1step 2.1step 2.2step 2.3step 3.1step 3.2∎

Steps 1.1 and 2.1 identify the objects in both directions, step 2.2 identifies morphisms, steps 2.3 and 3.1 identify subobjects and generation, and step 3.2 identifies quotients. This proves the complete dictionary.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The fundamental theorem of finitely generated abelian groups from PID modules

Statement

Every finitely generated abelian group G has unique canonical decompositions

G≅Zr⊕Z/(n1)⊕⋯⊕Z/(nt),1<n1∣⋯∣nt,

and

G≅Zr⊕⨁p,jZ/(pep,j),

where r and the finite torsion data are unique up to the stated order. The torsion summand is finite. The trivial group has r=0 and empty torsion data.

Facts & Assumptions

Given: The PID definition of Principal ideal domain.

[L1]

Abelian groups and Z-modules have the same objects and morphisms; their subgroups, generated subobjects, cyclic objects, finite generation, and quotients agree (Abelian groups and Z-modules have the same objects and morphisms).

[L2]

The integers form a commutative ring with multiplicative identity (The integers form a commutative ring).

[L3]

If x,y∈Z are nonzero, then xy≠0 (The integers have no zero divisors; multiplicative cancellation).

[L5]

A finitely generated PID module is classified by its free rank and invariant factors, equivalently its elementary divisors: the free rank is unique, invariant factors are unique up to associates in their divisibility order, elementary divisors are unique up to associates and permutation, and two such modules are isomorphic exactly when these data agree (Uniqueness of invariant factors and elementary divisors over a PID).

[L6]

Every finitely generated module over a PID R is isomorphic to Rs⊕R/(a1)⊕⋯⊕R/(at) with each ai a nonzero nonunit and a1∣⋯∣at, and also to Rr⊕⨁p,jR/(pep,j) with finitely many nonzero prime-power summands (Invariant-factor decomposition of a finitely generated module over a PID, Primary decomposition and elementary-divisor form for finitely generated PID modules).

Proof

technique · constructive
1.1L2L3

By [L2] and [L3], Z is a commutative unital ring without zero divisors, hence an integral domain.

1.2L4algebra

Every ideal of Z is an additive subgroup and is cyclic by [L4], so it is generated by one integer.

2.1step 1.1step 1.2given

Steps 1.1 and 1.2 verify the domain and principal-ideal clauses, so Z is a PID.

3.1step 2.1L1L5L6construct

Regard G as the canonical finitely generated Z-module from [L1]. Applying [L6] over the PID in step 2.1 gives the free summand and the invariant-factor and elementary-divisor decompositions, and [L5] makes the free rank and the torsion data unique; [L1] translates the cyclic quotients back to cyclic abelian groups. Uniqueness and the converse construction are preserved by the dictionary.

4.1step 3.1algebradischarge-construct∎

Each torsion summand Z/(n) is finite, and only finitely many occur, so their direct sum is finite. The free rank may be zero, and empty torsion data gives a finitely generated free abelian group.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The PID-module and finite-abelian-group classifications have the same canonical data

Statement

For a finite abelian group, the PID-module elementary divisors and invariant factors agree with the published group-theoretic data. In particular the two classifications attach the same prime-power multiset and the same divisibility chain, including the empty data for the trivial group.

Facts & Assumptions

[L1]

Every finite abelian group is isomorphic to a finite direct product of cyclic groups of prime-power order, with unique factor orders up to permutation (Fundamental theorem of finite abelian groups: elementary-divisor form).

[L2]

Every finite abelian group has a unique divisibility list of invariant factors, with the trivial group represented by the empty list (Fundamental theorem of finite abelian groups: invariant-factor form).

Proof

technique · direct
1.1given

A finite abelian group cannot contain a nonzero free summand Zr, so its module-theoretic free rank is 0.

2.1step 1.1L1given

The module elementary-divisor form and [L1] both express the group as cyclic groups of prime-power order. Their uniqueness clauses force the same prime powers with the same multiplicities, which is exactly agreement of the two elementary-divisor definitions.

3.1step 2.1L2∎

Aligning those common prime powers produces the module invariant factors, while [L2] uniquely characterizes the group invariant-factor chain. The two chains therefore agree. Conversely either common list reconstructs the same cyclic direct sum, proving agreement in both directions.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The index of a full-rank subgroup of Zn is the absolute determinant of a generating matrix

Statement

Let n≥1.

  1. Let A∈Mn(Z) and let L=AZn⊆Zn be the subgroup generated by the columns of A. If det⁡A≠0, then the quotient group Zn/L is finite of order ∣det⁡A∣; if det⁡A=0, then Zn/L is infinite.
  2. Every subgroup L⊆Zn is AZn for some A∈Mn(Z).

So a subgroup of Zn has finite index exactly when it is generated by the columns of a square integer matrix of nonzero determinant, and its index is then the absolute determinant of every such matrix.

Facts & Assumptions

Given: A natural number n≥1, and for clause 1 a matrix A∈Mn(Z) with L=AZn.

[F1]

Abelian groups and Z-modules have the same objects and morphisms, so a subgroup of Zn is a Z-submodule and the quotient group is the quotient module (Abelian groups and Z-modules have the same objects and morphisms). The ring Z is a commutative ring with identity in which a product of nonzero elements is nonzero, so it is an integral domain, and every subgroup of (Z,+) is cyclic, so every ideal of Z is principal: Z is a principal ideal domain (The integers form a commutative ring, The integers have no zero divisors; multiplicative cancellation, Every subgroup of (Z,+) is ⟨n⟩=nZ for exactly one natural number n, Principal ideal domain).

[F2]

For every A∈Mm×n(R) over a PID there are invertible P,Q with PAQ=diag⁡(d1,…,dr,0,…,0) and d1∣⋯∣dr, every di≠0; equivalence means B=PAQ with P∈GL⁡m(R) and Q∈GL⁡n(R) (Every matrix over a PID has a Smith normal form, Matrix equivalence and Smith normal form over a PID).

[F4]

For every module homomorphism f:M→N there is an isomorphism M/ker⁡f≅im⁡f (First isomorphism theorem for modules: M/ker⁡f≅im⁡f).

[F5]

For a submodule of a free module of finite rank n over a PID there is a basis e1,…,en of the ambient module and nonzero elements a1∣⋯∣ar with r≤n such that a1e1,…,arer is a basis of the submodule (Simultaneous bases for a submodule of a finite free module over a PID).

Proof

technique · direct
1.1givenF1F2

By [F1] the quotient Zn/L is a quotient of Z-modules, and by [F2] applied over the PID Z there are P,Q∈GL⁡n(Z) with PAQ=D=diag⁡(d1,…,dr,0,…,0), every di≠0.

1.2givenF3algebra

By [F3], det⁡P and det⁡Q are units of Z, hence ±1, so ∣det⁡D∣=∣det⁡P∣∣det⁡A∣∣det⁡Q∣=∣det⁡A∣; and D is diagonal, so det⁡D=d1⋯dr⋅0 n−r, which is d1⋯dn when r=n and 0 when r<n.

2.1step 1.1algebra

Since Q is invertible over Z, QZn=Zn, so AZn=AQZn=P−1DZn. The map x↦Px is an automorphism of Zn carrying L=P−1DZn onto DZn, so it induces an isomorphism Zn/L≅Zn/DZn.

3.1step 2.1F4algebra

Write di=0 for r<i≤n, and let π:Zn→⨁i=1nZ/diZ send x to the tuple of residues xi+diZ, a surjective homomorphism whose kernel is DZn. By [F4], Zn/DZn≅⨁i=1nZ/diZ, and with step 2.1 this group is isomorphic to Zn/L.

4.1step 1.2step 3.1algebra

If det⁡A≠0 then det⁡D≠0 by step 1.2, so r=n and every di is nonzero; each Z/diZ is then finite of order ∣di∣, so by step 3.1 the quotient Zn/L is finite of order ∣d1⋯dn∣=∣det⁡D∣=∣det⁡A∣.

4.2step 1.2step 3.1algebra

If det⁡A=0 then det⁡D=0 by step 1.2, so r<n and dn=0; the summand Z/dnZ=Z is infinite, so by step 3.1 the quotient Zn/L is infinite. This proves clause 1.

5.1givenF1F5step 4.1step 4.2construct∎

For clause 2, let L be any subgroup of Zn. By [F1] it is a Z-submodule of the free module Zn of rank n over the PID Z, so [F5] gives a basis e1,…,en of Zn and nonzero a1∣⋯∣ar, r≤n, with a1e1,…,arer a basis of L. Let A be the matrix whose first r columns are a1e1,…,arer and whose remaining n−r columns are zero; its entries are integers because the ei and the ai are. Then AZn is the set of integer combinations of those columns, which is exactly L, so clause 2 holds; combining it with clause 1 gives the final sentence of the Statement.

Remark

The corollary is what makes the determinant a counting invariant: clause 2 says every subgroup of Zn is a column lattice, and for A with nonzero determinant the columns of A generate a subgroup of Zn of index exactly ∣det⁡A∣, and the Smith invariant factors d1∣⋯∣dn refine that single number into the isomorphism type ⨁iZ/diZ of the quotient. Nothing here needs a Euclidean volume: the count comes from the invariant factors, and the determinant enters only because it is unchanged up to sign by multiplication with matrices invertible over Z.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The companion matrix of a monic polynomial

Definition

For a monic polynomial

f(x)=xd+ad−1xd−1+⋯+a1x+a0

of positive degree over a commutative ring, its companion matrix is

C(f)=(00⋯0−a010⋯0−a101⋱0−a2⋮⋱⋱⋮⋮0⋯01−ad−1).

Thus the ones are on the subdiagonal. This is the matrix of multiplication by x on the power basis 1,x,…,xd−1 of the cyclic module R[x]/(f).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The F[x]-module VT of an endomorphism

Definition

Let V be a vector space over a field F and let T:V→V be an endomorphism. The polynomial module of T, denoted VT, is the additive group of V with the F[x]-action

p⋅v:=p(T)v

from Polynomial evaluation at an endomorphism: p(T)=∑kakTk. This is a unital left F[x]-module (Unital left and right modules over a ring; unqualified module means left module): distributivity follows from linearity, 1(T)=IV, and (pq)(T)=p(T)q(T) by expanding the finite polynomial sums. The subscript records the action; it does not change the underlying vectors or addition.

PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-24Open item page →

For finite-dimensional V, VT is finitely generated and torsion, with annihilator generated by the minimal polynomial

Statement

Let T be an endomorphism of a finite-dimensional F-vector space V. The F[x]-module VT is finitely generated and torsion. The annihilator of VT is generated by the minimal polynomial μT.

Facts & Assumptions

[L1]

For every endomorphism T of a finite-dimensional F-vector space, Ann⁡(T) is a nonzero ideal of F[x] and has a unique monic generator μT; moreover p(T)=0 exactly when μT∣p (The annihilator ideal is nonzero and has a unique monic generator; p(T)=0 if and only if μT∣p).

Proof

technique · direct
1.1given

Any finite F-basis of V generates VT over F[x], because constant polynomials already give every F-linear combination. On the zero space the empty basis generates.

1.2L1

By [L1], μT(T)=0, so μT kills every vector. Thus every vector is torsion and VT is a torsion F[x]-module.

2.1L1given∎

A polynomial p annihilates the whole module exactly when p(T)v=0 for every v, exactly when p(T)=0. By [L1], this is equivalent to p∈(μT), so Ann⁡F[x](VT)=(μT). For V=0, both ideals are (1).

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Invariant factors and elementary divisors of an endomorphism

Definition

Let T be an endomorphism of a finite-dimensional vector space over F. The invariant factors and elementary divisors of T are those of the F[x]-module VT (The F[x]-module VT of an endomorphism), normalized to be monic polynomials.

The ring F[x] is a PID by For every field F, F[x] is a principal ideal domain, and For finite-dimensional V, VT is finitely generated and torsion, with annihilator generated by the minimal polynomial makes VT a finitely generated torsion module. These data therefore exist by Invariant-factor decomposition of a finitely generated module over a PID and Primary decomposition and elementary-divisor form for finitely generated PID modules, and are unique by Uniqueness of invariant factors and elementary divisors over a PID.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Existence and uniqueness of rational canonical form

Statement

Every square matrix over a field is similar to the unique rational canonical form determined by its invariant factors. If the monic invariant factors are f1∣⋯∣fr, then

RCF⁡(T)=diag⁡(C(f1),…,C(fr)).

In rational canonical form, the blocks are the companion matrices of the invariant factors. The zero-dimensional form and invariant-factor list are empty.

Facts & Assumptions

[L1]

A finitely generated PID module is classified by its free rank together with its invariant factors, the latter unique up to associates in their divisibility order (Uniqueness of invariant factors and elementary divisors over a PID).

[L2]

On the power basis of a cyclic subspace, multiplication by x has the companion matrix with ones on the subdiagonal and the negative coefficients in the last column (A vector annihilator gives a power basis and its companion matrix).

[L3]

Every finitely generated module over a PID R is isomorphic to Rs⊕R/(a1)⊕⋯⊕R/(at) with each ai a nonzero nonunit and a1∣⋯∣at (Invariant-factor decomposition of a finitely generated module over a PID).

Proof

technique · constructive
1.1L3given

Apply [L3] to the finitely generated torsion F[x]-module VT. A free summand F[x]s with s≥1 contains a nonzero element with zero annihilator, so torsion forces s=0, and VT≅⨁i=1rF[x]/(fi) for monic nonconstant f1∣⋯∣fr after normalizing each generator to be monic.

2.1step 1.1L2construct

In the power basis of each cyclic quotient, multiplication by x, hence the action of T, has companion matrix C(fi) by [L2]. Concatenating these bases gives the displayed block diagonal matrix and therefore a similarity from the original matrix to rational canonical form.

3.1step 1.1step 2.1L1discharge-construct∎

By [L1], the monic invariant factors are unique; unit factors give zero modules and are omitted. Thus the ordered companion-block form is unique and determines the similarity class. Dimension zero has no summands and gives the empty matrix.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

On a nonzero finite-dimensional space, the largest invariant factor is the minimal polynomial

Statement

On a nonzero finite-dimensional space, the largest invariant factor is the minimal polynomial. On the zero space the invariant-factor list is empty and the minimal polynomial is 1, so there is no largest invariant factor.

Facts & Assumptions

Given: A nonzero finite-dimensional space with invariant factors f1∣⋯∣fr supplied by Existence and uniqueness of rational canonical form.

[L1]

Proof

technique · direct
1.1givenalgebra

A polynomial p annihilates ⨁iF[x]/(fi) exactly when fi∣p for every i. Since f1∣⋯∣fr, this is equivalent to fr∣p, so the module annihilator is (fr).

2.1step 1.1L1∎

By [L1], the same annihilator ideal is (μT). Both generators are monic, so fr=μT. The nonzero-space hypothesis ensures r≥1; the zero-space convention is as stated.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

The product of the invariant factors is the characteristic polynomial

Statement

If f1,…,fr are the invariant factors of an endomorphism T, then the product of the invariant factors is the characteristic polynomial:

χT(x)=∏i=1rfi(x).

On the zero space this is the empty product 1.

Facts & Assumptions

[L1]

In rational canonical form, the blocks are the companion matrices of the invariant factors (Existence and uniqueness of rational canonical form).

Proof

technique · direct
1.1givenalgebra

Expanding det⁡(xI−C(fi)) along the companion rows gives the monic polynomial fi(x); this includes zero coefficients and linear companion matrices.

2.1step 1.1L1given∎

By [L1], T is similar to the block diagonal matrix with blocks C(fi). Characteristic polynomials are similarity-invariant and multiply over block diagonals, so step 1.1 gives χT=∏ifi. With no blocks, the determinant and product are both 1.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Cayley-Hamilton by the PID-module structure theorem

Statement

For every endomorphism T of a finite-dimensional vector space, its characteristic polynomial annihilates it:

χT(T)=0.

Facts & Assumptions

[L1]

On a nonzero finite-dimensional space, the largest invariant factor is the minimal polynomial (On a nonzero finite-dimensional space, the largest invariant factor is the minimal polynomial).

[L2]

The product of the invariant factors is the characteristic polynomial (The product of the invariant factors is the characteristic polynomial).

Proof

technique · direct
1.1L1L2

On a nonzero space, [L1] and [L2] show that μT, the largest factor, divides the product χT; write χT=qμT. On the zero space, χT=1 and the identity endomorphism equals the zero endomorphism because there is only one map from the zero space to itself.

2.1step 1.1givenalgebra∎

Evaluating the factorization from step 1.1 gives χT(T)=q(T)μT(T)=0. The zero endomorphism and one-dimensional spaces are included.

Remarks

This is the module-theoretic route to Cayley-Hamilton. The published proof Cayley-Hamilton: every finite-dimensional endomorphism satisfies its characteristic polynomial, χT(T)=0 instead uses the adjugate identity for the polynomial matrix xI−A.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

A companion block for (x−λ)e is similar to the Jordan block Je(λ)

Statement

For e≥1 and λ∈F, C((x−λ)e) is similar to Je(λ).

Facts & Assumptions

[F1]

For m≥1 and λ∈F, the Jordan block Jm(λ) has λ on the diagonal, 1 on the superdiagonal, and 0 elsewhere (Jordan blocks, Jordan strings, and their endpoints).

Proof

technique · direct
1.1algebra

In F[x]/((x−λ)e), the residue classes 1,(x−λ),…,(x−λ)e−1 form a basis. Reversing their order gives the basis (x−λ)e−1,…,x−λ,1.

2.1step 1.1F1

Multiplication by x=λ+(x−λ) in the reversed basis has λ on the diagonal and sends each basis vector except the first to itself times λ plus the preceding basis vector. Its matrix therefore has ones on the superdiagonal and is Je(λ) by [F1]. For e=1 it is the matrix (λ).

3.1step 2.1given∎

In the ordinary power basis 1,x,…,xe−1, the same multiplication operator has companion matrix C((x−λ)e). The two matrices represent one operator in two bases, so they are similar.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Jordan canonical form from the elementary divisors of VT

Statement

Let T be an endomorphism of a finite-dimensional F-vector space whose characteristic polynomial splits over F. If the elementary divisors of VT are (x−λ)e, then T has a Jordan canonical form with one block Je(λ) for each elementary divisor. The multiset of blocks is unique, and conversely each Jordan block yields its corresponding cyclic primary module. The zero space has empty lists.

Facts & Assumptions

[L1]

A finitely generated torsion PID module is the direct sum of its prime-power cyclic elementary-divisor summands (Primary decomposition and elementary-divisor form for finitely generated PID modules).

[L2]

C((x−λ)e) is similar to Je(λ) (A companion block for (x−λ)e is similar to the Jordan block Je(λ)).

[L3]

The product of the invariant factors of T is its characteristic polynomial (The product of the invariant factors is the characteristic polynomial).

Proof

technique · constructive
1.1L1L3given

By [L3], every invariant factor divides the split polynomial χT, so every irreducible factor occurring in an elementary divisor is linear. By [L1], VT is the direct sum of cyclic modules F[x]/((x−λ)e), one for each elementary divisor.

2.1step 1.1L2construct

On each cyclic summand, multiplication by x has companion matrix C((x−λ)e), which [L2] turns by a basis change into Je(λ). Concatenating these bases constructs a Jordan basis for T.

3.1step 2.1givendischarge-construct∎

Every Jordan block gives the reverse cyclic module F[x]/((x−λ)e), and uniqueness of elementary divisors gives uniqueness of the block multiset up to order. Empty elementary-divisor data gives the empty Jordan form on the zero space.

Remarks

This proof obtains the blocks from the F[x]-module structure. The published criterion Jordan form over the base field exists exactly when the characteristic polynomial splits obtains existence through generalized eigenspaces and Jordan strings.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

For split characteristic polynomial, elementary divisors and Jordan strings give the same Jordan blocks

Statement

For an endomorphism with split characteristic polynomial, the elementary divisors (x−λ)e in the module construction and the Jordan strings in the rank-of-powers construction determine exactly the same block sizes and multiplicities, including the empty data on the zero space.

Facts & Assumptions

Given: The module-derived Jordan form of Jordan canonical form from the elementary divisors of VT.

[L1]

The ranks of all shifted powers determine the Jordan form uniquely up to permutation of its blocks (Ranks of shifted powers determine Jordan form up to block order).

[L2]

For a nilpotent operator, successive kernel dimensions or rank differences give the number of blocks of each size (Power ranks determine every nilpotent Jordan-block multiplicity).

Proof

technique · direct
1.1algebra

On the cyclic summand F[x]/((x−λ)e), multiplication by (x−λ)k has kernel dimension min⁡(k,e) for k≥0: it kills exactly the final min⁡(k,e) translated-power basis vectors.

2.1step 1.1algebra

Kernel dimensions add over direct sums, so for each λ the module elementary divisors give dim⁡ker⁡(T−λI)k=∑emin⁡(k,e), counted with multiplicity.

3.1step 2.1L1L2∎

By [L2], successive differences of the sequence in step 2.1 recover the number of blocks of size at least k and exactly k. These are the same shifted-power invariants used in [L1], so the module and Jordan-string constructions have identical block multisets. For k=0 the kernel is zero; after the largest exponent the sequence stabilizes, and on the zero space every sequence and list is empty.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24Open item page →

Two matrices are similar exactly when their invariant factors agree

Statement

Two square matrices over a field are similar exactly when their invariant factors agree. No splitting hypothesis is required.

Facts & Assumptions

Given: Similar matrices in the sense of Similar matrices: B=P−1AP for an invertible P and the endomorphism invariant factors of Invariant factors and elementary divisors of an endomorphism.

[L1]

Every square matrix over a field is similar to the unique rational canonical form determined by its invariant factors (Existence and uniqueness of rational canonical form).

Proof

technique · direct
1.1L1given

For the forward direction, if B=P−1AP, then P intertwines the two endomorphisms and hence is an isomorphism of their polynomial modules. Module classification, equivalently [L1], gives equal invariant factors.

2.1L1step 1.1∎

For the reverse direction, if the invariant factors agree, [L1] makes both matrices similar to the same rational canonical block matrix. Composing the two conjugating changes of basis shows that they are similar to each other. The argument covers nonsplit factors, repeated factors, zero matrices, one-by-one matrices, and the unique zero-by-zero matrix.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

The word problem for finitely generated abelian groups is solvable

Statement

Every finitely generated abelian group has solvable word problem. More explicitly, given a finite presentation known to present an abelian group, there is a terminating procedure deciding whether any input word represents the identity.

Facts & Assumptions

Given: A finitely generated abelian group A, and, for the algorithm, a finite presentation ⟨x1,…,xn∣r1,…,rm⟩ of A. The algorithm is required to decide identity of words in this fixed presentation (The word problem for a fixed finite presentation).

[L1]

A presentation is the quotient of the free group by the normal closure of its relators (Group presentation by generators and relations); the abelianisation of a free group on n generators is the free abelian group Zn (The abelianisation of a free group on X is a free abelian group on X).

[L3]

Every rectangular integer matrix M has a Smith form D=UMV, with integer matrices U,V invertible over Z (Every matrix over a PID has a Smith normal form).

Proof technique: direct.

Proof

1.1L2inductionchoosealgebra

First, every subgroup H≤Zn is finitely generated, by induction on n. For n=0 it is zero. For n>0, projection on the last coordinate has image dZ by [L2], and its kernel is a subgroup of Zn−1, finitely generated by induction. If d=0, these kernel generators generate H. Otherwise fix one h∈H with last coordinate d; every v∈H has last coordinate qd for some integer q, so v−qh lies in the kernel. The kernel generators together with h therefore generate H. This finite induction uses only finitely many choices of witnesses.

1.2givenL1algebra

Now use the given finite presentation, and let e(w)∈Zn be the vector of exponent sums of a word w. Let M∈Mn×m(Z) have columns e(rj), and let L=MZm. Put F=F(x1,…,xn) and let N be the normal closure of the relators. Since F/N=A is abelian, the kernel of the exponent-sum map e:F→Zn, namely the commutator subgroup by [L1], is contained in N. Also e(N)=L: every element of a normal closure is a finite product of conjugates of relators and their inverses, whose exponent vectors are sums of signed columns of M, and every such integer combination occurs. Hence w∈N if and only if e(w)∈L. For the reverse implication, choose v∈N with e(v)=e(w); then wv−1∈ker⁡e⊆N.

1.3L3constructalgebra

Compute suitable U,V,D by enumerating integer square matrices U of size n and V of size m, with all entries bounded in absolute value by b=0,1,2,…. Each bounded stage is finite. Check whether det⁡U,det⁡V∈{1,−1} and whether UMV is a rectangular diagonal matrix with its nonzero diagonal entries first and each dividing the next. Determinants, matrix multiplication and integer divisibility are computable by finitely many integer operations; for a zero-dimensional square matrix the determinant is 1. The search terminates by [L3], since the required pair has a finite entry bound. Integer matrices with determinant ±1 have integer inverses by the adjugate formula, so every accepted pair has the required invertibility.

2.1givenL1step 1.1construct

Choose a finite generating list for A. Commutativity gives a surjection Zn→A sending standard basis vectors to these generators. Its kernel has a finite generating list h1,…,ht by step 1.1. A finite presentation of A is obtained by imposing the finitely many pairwise commutator relators and the words x1(hj)1⋯xn(hj)n: the commutator relators make the quotient Zn, and the remaining relators make its quotient by precisely the kernel. Thus every finitely generated abelian group admits a finite presentation.

2.2step 1.2step 1.3algebra

Write the nonzero diagonal entries of D as d1,…,ds. Because VZm=Zm, we have UL=DZm. Compute y=Ue(w). Then e(w)∈L if and only if di divides yi for 1≤i≤s and yi=0 for s<i≤n: these are exactly the coordinate conditions for the image of a rectangular diagonal matrix. The conditions include the zero matrix, empty relator list and empty generating list. Each is a finite integer check, and step 1.2 identifies the outcome with identity of w in A.

3.1step 2.1step 1.3step 2.2∎

The preprocessing in step 1.3 terminates, and exponent sums and the tests in step 2.2 terminate for every input word. Therefore the word problem for every finite presentation of an abelian group is solvable; step 2.1 supplies such presentations for every finitely generated abelian group. For another fixed finite generating set, fix words in the presentation generators for its finitely many generators, substitute these into the input word, and apply the same algorithm. No infinite choice or effective recognition of whether an arbitrary presentation is abelian is required.

5 · Examples, counterexamples and false statements

None yet.

Sources