Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 birational algebras descend across a flat completion neighbourhood

Statement

Assume AC and DC. Let B→C be a faithfully flat map of Noetherian domains and let 0≠I⊂B be a finitely generated ideal such that B/In→C/InC is an isomorphism for every n≥1. Let C⊂C′ be a finite birational algebra inside Frac⁡C, with C′/C annihilated by a power of IC. Then there is a finite birational algebra B⊂B′⊂Frac⁡B, isomorphic to B away from V(I), and an isomorphism B′⊗BC≅C′ as C-algebras.

Facts & Assumptions

Given: A faithfully flat map B→C of Noetherian domains, a finitely generated ideal 0≠I⊂B with B/In→C/InC an isomorphism for every n≥1, and a finite birational algebra C⊂C′⊂Frac⁡C with C′/C annihilated by a power of IC.

[F1]

def-axiom-of-choice. The Axiom of Choice (AC) is the following statement. > Every family of nonempty sets has a choice function > (def-choice-function). Written out: for every set F all of whose members are nonempty, there exists a function g with domain F satisfying g(S)∈S for all S∈F. (The Axiom of Choice)

[F2]

def-dependent-choice. Let X be a set and let R⊆X×X be a binary relation on X. Call R entire on X when for every x∈X there is y∈X with xRy. The Axiom of Dependent Choice, written DC, is the following statement. (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain)

[F3]

thm-yoneda-ext-one-is-naturally-isomorphic-to-derived-ext-one. Assume the Axiom of Dependent Choice, the balanced-Ext hypotheses of def-balanced-ext-bifunctor, and that the extension classes in question form a set. Sending an extension of M by N to the connecting image of 1M gives a natural isomorphism of abelian groups YExt⁡1(M,N)≅Ext⁡1(M,N). (Yoneda Ext one is naturally isomorphic to derived Ext one)

[F4]

thm-faithfully-flat-ring-map-characterisations. Assume the Axiom of Choice for the prime and maximal ideal existence used in the spectral reformulations. Let f:R→S be a flat homomorphism of commutative rings. The following are equivalent: 1. f is faithfully flat. 2. For every proper ideal I⊊R, the extended ideal IS is proper. 3. Every maximal ideal of R has a prime ideal of S lying over it. 4. (A flat ring map is faithfully flat exactly when it detects proper ideals and is surjective on spectra)

[F5]

cor-faithfully-flat-ring-maps-are-injective. Assume the Axiom of Choice. Every faithfully flat homomorphism of commutative rings is injective. (Every faithfully flat ring map is injective)

[F6]

thm-localisation-of-modules-is-exact. If 0⟶M′→fM→gM′′⟶0 is a short exact sequence of R-modules, then 0⟶S−1M′→S−1fS−1M→S−1gS−1M′′⟶0 is a short exact sequence of S−1R-modules. (Localisation of modules is exact)

[F7]

thm-finitely-generated-modules-over-noetherian-rings-are-noetherian. Every finitely generated left module over a left Noetherian ring is Noetherian. See def-noetherian-ring. (Finitely generated modules over a left Noetherian ring are Noetherian)

[F8]

cor-ext-can-be-computed-from-any-projective-resolution-of-the-first-variable. Assume the Axiom of Dependent Choice and the hypotheses of def-balanced-ext-bifunctor. If Q is any other supplied projective resolution datum on the same class of objects, then for every M,N and n≥0, Ext⁡An(M,N)≅HnHom⁡(Q∙,N), naturally in M and N. (Ext can be computed from any projective resolution of the first variable)

Proof

1.1F4given

Put Q=C′/C and choose n≥1 with InQ=0. Since C′ is finite over C the quotient Q is a finite C-module killed by InC, so it is a finite module over C/InC≅B/In and hence a finite B-module.

2.1F4F5step 1.1

Because Q is a B/In-module, Q⊗BC≅Q⊗B/In(C/InC)≅Q⊗B/In(B/In)=Q, using the given identification B/In≅C/InC; faithfully flat base change also makes Q→Q⊗BC injective.

3.1F5F7step 1.1step 2.1

Since B is Noetherian and Q is finite, Q is Noetherian, so a finite free presentation can be extended indefinitely: all syzygies of Q are finitely generated, and Q admits a projective resolution F∙→Q→0 with every Fi a finite free B-module.

4.1F4F6F8step 2.1step 3.1

Base change of the resolution along B→C computes the Ext of Q over C, because C is flat over B and Hom of a finite free module commutes with the base change: Ext⁡B1(Q,B)⊗BC≅Ext⁡C1(Q⊗BC,C)=Ext⁡C1(Q,C), with F∙⊗BC a resolution of Q by finite free C-modules.

5.1F7F8step 1.1step 4.1

Every element of In kills Ext⁡B1(Q,B): multiplication by x∈In is zero on Q, so on the resolution it is a chain map lifting the zero map and, by successive projective lifts, is chain homotopic to zero, hence induces zero on the cohomology of the Hom complex.

6.1F4step 2.1step 4.1step 5.1

Since In kills Ext⁡B1(Q,B), the same argument as for Q shows Ext⁡B1(Q,B)⊗BC≅Ext⁡B1(Q,B); combined with the previous step the base-change map Ext⁡B1(Q,B)→Ext⁡C1(Q,C) is an isomorphism.

7.1F3F8step 6.1

The extension class of 0→C→C′→Q→0 in Ext⁡C1(Q,C) therefore has a unique preimage in Ext⁡B1(Q,B), which is the class of a short exact sequence 0→B→E→Q→0 of B-modules whose base change to C is isomorphic to 0→C→C′→Q→0. The module E is finite over B because B and Q are.

8.1F4F5F6F7step 7.1

Choose 0≠a∈I. Since Q is killed by In, we have Qa=0, so localizing the extension at a identifies Ea with Ba. The kernel K of E→Ea is killed by a power of a: it is a submodule of the finite B-module E, hence finite because B is Noetherian, and each of its finitely many generators is killed by some power of a. After tensoring with the flat ring map B→C, this kernel is the kernel of C′→Ca′, which is zero because C′⊂Frac⁡C is a domain and localization is injective. Faithful-flatness detects zero modules here: for any nonzero module element m, its cyclic submodule is B/J for a proper annihilator J; flatness embeds (B/J)⊗BC=C/JC into the tensor of the module, and [F4] makes C/JC nonzero. Thus K=0, and E embeds as a B-submodule of Ba⊂Frac⁡B.

9.1F4F6step 7.1step 8.1

Let M:=Ba/E. Flatness identifies M⊗BC with the quotient of Ca=Ba⊗BC by the image of E⊗BC. The extension isomorphism E⊗BC≅C′ respects the submodule C; after localizing at a, both middle terms identify with Ca, and the isomorphism is the identity on this submodule. Therefore the image of E⊗BC in Ca is exactly C′. For u,v∈E, the class m:=uv+E maps in M⊗BC≅Ca/C′ to zero, since the images of u and v lie in the ring C′. The faithful-flat detection argument in step 8.1 shows that M→M⊗BC is injective, so m=0 and uv∈E. With this multiplication E=:B′ is a ring, finite over B, with B⊂B′⊂Frac⁡B, and the extension isomorphism E⊗BC≅C′ is an isomorphism of C-algebras.

10.1F1F2step 7.1step 9.1∎

Let p∉V(I). Choose b∈I∖p. Since InQ=0, localization at b gives Qb=0, so the exact sequence in step 7.1 makes Bb→Eb an isomorphism of modules. It is already a ring map, and both rings have the multiplication inherited from E⊆Ba, so it is an isomorphism of rings. These principal opens cover Spec⁡(B)∖V(I), proving that B′ agrees with B away from V(I). The algebra is birational because B⊆B′⊆Frac⁡(B). AC and DC are inherited from the Ext-one classification and resolution suppliers; no formal-gluing theorem is used.

Remarks

  • The construction is explicit: the descended algebra is the middle term of the unique lifted extension, and it is a subring of the localization Ba rather than an abstract glued object.
  • The hypothesis that the maps B/In→C/InC are isomorphisms for all n is used twice, once to make Q a B/In-module and once to identify the base change of the Ext group with itself.

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