Artin–Tate lemma¶

If A is commutative Noetherian, C is a finite-type A-algebra and finite as a module over an intermediate A-subalgebra B, then B is finite type over A.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3339
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Commutative Algebra → Mathematics

Core Idea¶

Finite means module-finite while finite type means algebra-finitely-generated, commutativity and Noetherian hypotheses are essential and the inclusion chain must be fixed. Generators of C over A and module generators over B yield finitely many coefficients in B; their Noetherian subalgebra controls relations and proves that B is module-finite over a finite-type A-algebra. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

No faithful explanation at this level. All three generators agree a five-year-old version merges module-finite and finite type into one idea of being made from a few things and drops the hypotheses, yielding a false inheritance rule the lemma exists to prevent.

No faithful explanation at this level. All three generators agree a ten-year-old version cannot keep module-finiteness and finite type apart and drops the Noetherian base, collapsing into a false claim that finiteness passes to anything in between.

Finiteness Passes to the Middle Ring

Think of three number-like systems, A inside B inside C, where you can add and multiply and multiplication does not depend on order. There are two different senses in which C can be small over something. Finite type means C can be built from A using finitely many chosen elements, with addition and multiplication allowed. Finite, or module-finite, is stronger in flavor: C is spanned by finitely many elements using coefficients taken from B, with no further multiplying needed. The Artin-Tate lemma says that if A has the Noetherian property, meaning every increasing chain of its ideals eventually stops growing, and C is finite type over A while also module-finite over B, then B must itself be finite type over A. The proof is a bookkeeping argument: write out generators of C over A and module generators of C over B, multiply them out, and collect the finitely many coefficients from B that appear; the subalgebra of B generated by those coefficients is Noetherian and controls all the relations, which forces B to be finite type over A. Keeping the chain A inside B inside C fixed, and not confusing finite with finite type, is essential, and the lemma is the engine behind proofs of results such as the Nullstellensatz.

The Artin-Tate lemma is a statement about commutative rings with inclusions A subset B subset C in which A is Noetherian, C is a finite-type A-algebra, and C is a finite (that is, module-finite) B-module; the conclusion is that B is a finite-type A-algebra. The distinction between finite and finite type is essential: finite means module-finite, generated as a module by finitely many elements, while finite type means generated as an algebra by finitely many elements. The argument chooses algebra generators of C over A and module generators of C over B, expresses the products of generators in terms of the module generators, and collects the finitely many B-coefficients that appear. The A-subalgebra A_0 of B generated by those coefficients is of finite type over A, hence Noetherian, and C is module-finite over A_0; consequently B, as an A_0-submodule of C, is finitely generated over A_0, which makes B of finite type over A. Commutativity, the Noetherian hypothesis on A and the fixed direction of the inclusion chain are all load-bearing, and dropping any of them breaks the conclusion. The lemma is a standard tool in proofs of the Nullstellensatz and sits near results such as Eakin-Nagata on the transfer of Noetherian conditions.

Scope of Application¶

Artin–Tate lemma belongs to commutative algebra and is useful where the analyst can specify the typed commutative algebra carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the commutative rings and inclusions A to B to C, Noetherian property of A, finite-type A-algebra structure of C, finite B-module structure of C, conclusion that B is finite type over A, distinction of finite and finite type and relation to Nullstellensatz and Eakin–Nagata are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the commutative rings and inclusions A to B to C, Noetherian property of A, finite-type A-algebra structure of C, finite B-module structure of C, conclusion that B is finite type over A, distinction of finite and finite type and relation to Nullstellensatz and Eakin–Nagata are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Artin–Tate lemma. Artin–Tate lemma compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed commutative algebra carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the commutative rings and inclusions A to B to C, Noetherian property of A, finite-type A-algebra structure of C, finite B-module structure of C, conclusion that B is finite type over A, distinction of finite and finite type and relation to Nullstellensatz and Eakin–Nagata are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of commutative algebra because they reuse the typed commutative algebra carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Generators of C over A and module generators over B yield finitely many coefficients in B; their Noetherian subalgebra controls relations and proves that B is module-finite over a finite-type A-algebra., and type the carrier, state every parameter and convention in the definition, test that the commutative rings and inclusions A to B to C, Noetherian property of A, finite-type A-algebra structure of C, finite B-module structure of C, conclusion that B is finite type over A, distinction of finite and finite type and relation to Nullstellensatz and Eakin–Nagata are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Artin–Tate lemma Domain-specific

Parents (1) — outgoing typed relations

Artin–Tate lemma is a kind of Inference Prime

It remains its own entry because its identity is fixed by the commutative rings and inclusions A to B to C, Noetherian property of A, finite-type A-algebra structure of C, finite B-module structure of C, conclusion that B is finite type over A, distinction of finite and finite type and relation to Nullstellensatz and Eakin–Nagata.

Hierarchy path (1) — routes to 1 parentless root

Artin–Tate lemma → is a kind of Inference → is a kind of Rationality → is a kind of Normativity → is a decomposition of Constraint

Neighborhood in Abstraction Space¶

Artin–Tate lemma sits in a crowded region of the domain-specific corpus (9^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Commutative Algebra & Ring Structures (28 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25