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.
Finite presentation data descend to Noetherian algebra and module stages
Statement
Assume the Axiom of Choice. Let be a finitely presented ring map, and let be a finitely presented -module. There is a directed system with the following properties.
- Each is a finitely generated -algebra, each is a finitely presented -algebra, and each is a finitely presented -module. In particular the stage rings are Noetherian.
- For , the maps and are isomorphisms. The colimits are , , and , respectively.
- For primes and , write and . Then is a system of Noetherian local maps with colimit , and the localized modules have colimit . For , is a localization, and the corresponding module transition is base change.
This lemma constructs the approximating system. It does not assert that flatness at the colimit descends to a finite stage.
Facts & Assumptions
Given: The finitely presented algebra and module, and, for clause 3, the specified primes.
Finite presentation of an algebra gives finitely many polynomial variables and equations; finite presentation of a module gives a finite matrix presentation (Finitely presented modules and finitely presented algebras).
A finitely generated -algebra, its finite-type algebra, and their localizations are Noetherian by Hilbert basis and localization (Hilbert basis theorem: if is Noetherian then is Noetherian, Every quotient and every localisation of a Noetherian ring is Noetherian).
Tensor products carry a finite presentation to its coefficient base change by right exactness, and localization commutes with the cokernel of a finite matrix (Tensoring is right exact, Localisation of modules is exact).
Proof
Proof technique: put all finite coefficients in one stage and localize the resulting exact base-change system at contracted primes.
Choose presentations and as in [F1]. The coefficients of the and of representatives in for the finitely many entries of form a finite subset . Let be the directed set of finite subsets containing , ordered by inclusion, and put . The images of the same polynomial equations and matrix coefficients over define and .
For , the equations and matrix entries at stage are the images of those at stage . By [F3], tensoring their finite presentations gives canonical isomorphisms and . Every element of lies in some , so ; applying the same finite presentations gives and . Each is finitely generated over , and [F2] makes and Noetherian. This proves clauses 1 and 2.
The contractions and are compatible primes, with . Localize the system at their complements. Any numerator of or occurs at some stage, and any denominator outside the selected prime already occurs outside its contracted stage prime; therefore and . The same argument for representatives of module elements, using exact localization [F3], gives .
For , the source of the asserted local transition is the localization of obtained by inverting and . Both sets avoid . Localizing this ring once more at the prime induced by yields exactly ; hence the transition is a localization. Localizing the matrix presentation and using [F3] yields . This proves clause 3.
If or is the zero ring, the global construction still uses the same finite equations and matrices; there are no primes for clause 3. The Axiom of Choice only selects the finite presentations and their finite lifts; no infinite stage selection is needed. The next flatness-descent result must be proved separately before this approximation can be used to transfer flatness hypotheses. [F1, step 2.1, step 4.1]
Depends on
Used by
Dependency tree · two levels
33 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
- The Stacks Project, Algebra, Lemma 10.127.18 (tag 00R1), finite-presentation approximation (standard reference, not scraped)
- The Stacks Project, Algebra, Lemma 10.127.13 (tag 00QX), local approximation with modules (standard reference, not scraped)