Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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 Artin–Tate lemma with integrality in place of module finiteness

Statement

Let ABC be commutative rings, each a subring of the next (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication), with A Noetherian. Suppose C is of finite type over A (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras) and every element of C is integral over B (Integral elements over a commutative ring and algebraic integers). Then C is module-finite over B, and B is of finite type over A.

Facts & Assumptions

Given: Commutative rings ABC, each a subring of the next, with A Noetherian, C of finite type over A, and every element of C integral over B.

[L1]

R[a1,,an] is the smallest subring of A containing the image of R and a1,,an; an algebra is of finite type over R when it equals R[a1,,an] for some finite list, and module-finite over R when it is finitely generated as an R-module (Subalgebra generated by a subset, algebras of finite type, and module-finite algebras).

[L2]

For a homomorphism of commutative rings AB, an element bB is integral over A when it is a root of a monic polynomial in A[X] (Integral elements over a commutative ring and algebraic integers).

[L3]

For commutative rings AB with A a subring of B and b1,,bnB integral over A, the subalgebra A[b1,,bn] is module-finite over A (A subalgebra generated by finitely many integral elements is module-finite).

[L4]

For commutative rings ABC, each a subring of the next, with A Noetherian, C of finite type over A and C module-finite over B, the ring B is of finite type over A (Artin–Tate lemma: an intermediate ring over which a finite-type algebra is module-finite is itself of finite type).

[L5]

A subring contains the identity of the ambient ring and is closed under sums, additive inverses and products (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication).

Proof

technique · direct
1.1

Fix rN and t1,,trC with C=A[t1,,tr]. The subring B[t1,,tr] of C contains B, hence contains A, and contains every ti; since A[t1,,tr] is the smallest subring of C with those two properties, C=A[t1,,tr]B[t1,,tr]C. So C=B[t1,,tr] is of finite type over B, generated by the same elements.

L1L5given
2.1

Every element of C is integral over B, so in particular each ti is; B is a subring of C; hence B[t1,,tr] is module-finite over B. By step 1.1 that ring is C, so C is module-finite over B.

L2L3step 1.1
3.1

The hypotheses of the Artin–Tate lemma are now all in place for ABC: A is Noetherian, C is of finite type over A, and C is module-finite over B. Therefore B is of finite type over A.

L4step 2.1

Remarks

  • Finite type over A gives finite type over B for free. Step 1.1 uses only that AB: the same algebra generators work over the larger base ring. That is what lets the integrality hypothesis be applied to the finitely many ti rather than to all of C at once.

  • Integrality of every element is more than integrality of the generators, and only the generators are used. The hypothesis as stated is the usual one and is what the applications supply; the proof needs it only at t1,,tr.

Depends on

Used by

Dependency tree · two levels

21 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