Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Openness of finite tensor products over a normal Noetherian domain

Proved
PiTensorProduct.isOpenMap_comap_of_quasiFinite

by tomasz · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrycommutative-algebraquasi-finitetensor-products

Let AAA be a normal Noetherian integral domain, let III be a finite set, and let RiR_iRi​ be a finite-type commutative AAA-algebra for each i∈Ii\in Ii∈I. Suppose each structure morphism

fi:Spec⁡Ri⟶Spec⁡Af_i:\operatorname{Spec}R_i\longrightarrow\operatorname{Spec}Afi​:SpecRi​⟶SpecA

is open and quasi-finite. Then the structure morphism

Spec⁡ ⁣(⨂i∈I,ARi)⟶Spec⁡A\operatorname{Spec}\!\left(\bigotimes_{i\in I,A} R_i\right) \longrightarrow\operatorname{Spec}ASpec​i∈I,A⨂​Ri​​⟶SpecA

is open.

No reducedness, flatness or surjectivity is assumed for the RiR_iRi​. For an empty index set the tensor product is AAA, and the conclusion is the openness of the identity. The zero ring is allowed among the RiR_iRi​.

This isolates the geometric input needed to specialize finitely many rational points subject to a joint polynomial nonvanishing condition. It is an affine finite-product consequence of universal openness over a geometrically unibranch base, rather than a verbatim statement of the cited source lemma.

Formalization Note. Finite type is separate from Mathlib's Algebra.QuasiFinite, which asserts finite-dimensional residue-field fibers. Normality is expressed by IsDomain A and IsIntegrallyClosed A. The tensor product is Mathlib's PiTensorProduct; the conclusion concerns the actual Zariski topologies on prime spectra.

Verified reduction (8 October 2026). Component dominance is now proved from ordinary openness and Noetherianity. The full finite-family assembly is also proved: the empty tensor product, reindexing and one-factor splitting are verified as algebra isomorphisms, and induction composes the appropriate affine base-change maps. The sole Open input is the single-algebra normal-base universal-openness criterion with dominating components, an affine specialization of Stacks Tag 0F32. The original formal statement is unchanged.

Preamble
import Mathlib
set_option autoImplicit false
open scoped TensorProduct Topology
Formal statement
/-- Finite tensor products of open quasi-finite affine families are open over
a normal Noetherian domain. -/
theorem PiTensorProduct.isOpenMap_comap_of_quasiFinite
    (A : Type*) [CommRing A] [IsDomain A] [IsIntegrallyClosed A] [IsNoetherianRing A]
    (ι : Type*) [Finite ι]
    (R : ι → Type*) [∀ i, CommRing (R i)] [∀ i, Algebra A (R i)]
    [∀ i, Algebra.FiniteType A (R i)]
    (hopen : ∀ i, IsOpenMap (PrimeSpectrum.comap (algebraMap A (R i))))
    (hquasi : ∀ i, Algebra.QuasiFinite A (R i)) :
    IsOpenMap (PrimeSpectrum.comap (algebraMap A (⨂[A] i, R i))) := by sorry
Source
Stacks Project, Lemma 37.74.2 (Tag 0F32), https://stacks.math.columbia.edu/tag/0F32; Lemma 28.16.2 (Tag 0BQ3), https://stacks.math.columbia.edu/tag/0BQ3; Definition 29.24.1 and Lemma 29.24.3 (Section Tag 01TZ), https://stacks.math.columbia.edu/tag/01TZ. Auxiliary affine finite-product consequence: finite-type sources over the Noetherian base have finitely many irreducible components. A nonempty open part belonging to only one component has nonempty open image, so every component dominates the integral base. Normality makes the base geometrically unibranch; 0F32 gives universal openness of each quasi-finite map. Base change and composition yield openness of their finite fiber product. These geometric steps remain Open in the formalization.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me