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.
Integrality and finite-module characterizations for one element
Statement
Let be commutative rings with , and let . The following are equivalent: is integral over ; is finitely generated as an -module; and there exists a faithful -module that is finitely generated over , where faithful means that implies for . See Integral elements over a commutative ring and algebraic integers.
Facts & Assumptions
Given: The hypotheses and objects in the Statement.
Let be a homomorphism of commutative rings. An element is integral over when it is a root of a monic polynomial in . The extension is integral when every element is integral. An algebraic integer is a complex number integral over . (Integral elements over a commutative ring and algebraic integers).
Let be a left -module and . The submodule generated by is The family is nonempty because , and its intersection is a submodule by lem-submodule-criterion-sums-and-intersections. Thus is the smallest submodule of containing , just as def-generated-subgroup defines a generated subgroup. (Generated submodule, cyclic and finitely generated modules, module basis and free module).
For a commutative ring , , and , . (For every positive-sized square matrix over a commutative ring, ).
Proof
If satisfies a monic equation of degree , every power with is an -linear combination of ; hence is finite over . Taking itself gives a faithful -module finite over .
Conversely, let a faithful -module be generated over by . Write with , so the matrix annihilates the generating column.
Multiplying by the adjugate shows that the value annihilates every . It therefore annihilates , so faithfulness makes it zero. The formal polynomial is monic of degree and evaluates at to this element, giving a monic relation for over .
The case cannot occur: then , so faithfulness would force , contradicting . Hence , and the determinant in step 3.1 is a nonzero monic polynomial of positive degree. This proves the stated claim.
Depends on
Used by
- Integral elements over a nonzero base ring form a subring Corollary
- Minimal-polynomial criterion for algebraic integers Corollary
- Quasi-finite does not imply finite Counterexample
- A finite algebra is its own Zariski Main factor Example
- Every element of k[X] is integral over k[X²], and k[X] has basis 1, X over k[X²] Example
- A monic relation makes the last generator integral over the earlier ones Lemma
- A subalgebra generated by finitely many integral elements is module-finite Lemma
- A zero-dimensional projective scheme has finitely many closed points with finite-dimensional local rings Lemma
- Conductor radical detects every polynomial coefficient Lemma
- Finite algebras over a strongly transcendental variable are nowhere quasi-finite Lemma
- Integral closure commutes with étale base change Lemma
- One-variable integral correction after leading-coefficient localization Lemma
- Polynomial rings over normal domains are normal Lemma
- A domain is integrally closed if and only if its prime localisations are, equivalently if and only if its maximal localisations are Theorem
- A finite-type domain over a field has finite normalization Theorem
- Algebraic Zariski Main localization at a quasi-finite prime Theorem
- Finite morphisms are integral and universally closed Theorem
- Integral extensions are transitive Theorem
- The values of a central character are algebraic integers Theorem
Dependency tree · two levels
14 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
- Eloisa Grifo, Commutative Algebra I, Section 1.4 (standard reference, not scraped)