Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

A generic hyperplane section over a countable model is a domain

Open
OAI.MaximalSeshadri.BertiniIntegral.generic_hyperplane_section_over_model

by wurtle · Nov 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

maximal-seshadrioai-math

Let R⊂KR\subset KR⊂K be fields of characteristic zero (with KKK an RRR-algebra), AAA a domain over KKK with A⊗KAA\otimes_K AA⊗K​A a domain, and A0A_0A0​ an RRR-algebra with an isomorphism e:K⊗RA0≅Ae:K\otimes_R A_0\cong Ae:K⊗R​A0​≅A of KKK-algebras. Let σ\sigmaσ be finite, v0:σ→A0v_0:\sigma\to A_0v0​:σ→A0​, v:σ→Av:\sigma\to Av:σ→A with e(1⊗v0,i)=vie(1\otimes v_{0,i})=v_ie(1⊗v0,i​)=vi​, and suppose aeval⁡\operatorname{aeval}aeval of the linear form ∑vkxk\sum v_kx_k∑vk​xk​ is injective on K[σ][X]K[\sigma][X]K[σ][X]. If i≠ji\neq ji=j, vjv_jvj​ is transcendental over KKK (Mathlib's predicate Transcendental K), δi≠0\delta_i\ne0δi​=0 and δi∣δjr\delta_i\mid\delta_jrδi​∣δj​r implies δi∣r\delta_i\mid rδi​∣r in A⊗KAA\otimes_KAA⊗K​A, where δt=vt⊗1−1⊗vt\delta_t=v_t\otimes1-1\otimes v_tδt​=vt​⊗1−1⊗vt​, then for each injective RRR-algebra map f:R[σ][X]→Kf:R[\sigma][X]\to Kf:R[σ][X]→K the quotient of AAA by the element f(X)−∑kf(xk)vkf(X)-\sum_k f(x_k)v_kf(X)−∑k​f(xk​)vk​ is a domain.

Formalization Note The statement is verbatim from OpenAI's Lean development, with Definitions files of this development imported in place of the upstream modules; these are supporting code for the statement.

Preamble
import Mathlib
import Definitions.Def_MaximalSeshadriConstants
import Definitions.Def_SeshadriPrelim6

namespace OAI

section
noncomputable section
namespace MaximalSeshadri.BertiniIntegral
noncomputable section
open Polynomial
open scoped TensorProduct
attribute [local instance] MvPolynomial.algebraMvPolynomial
attribute [local instance] Polynomial.algebra
attribute [local instance 1100] Polynomial.algebraOfAlgebra

Formal statement
theorem generic_hyperplane_section_over_model {R K A A₀ σ : Type}
    [Field R] [CharZero R] [Field K] [CharZero K]
    [Algebra R K]
    [CommRing A] [IsDomain A] [Algebra K A] [Algebra R A]
    [IsScalarTower R K A] [IsDomain (A ⊗[K] A)]
    [CommRing A₀] [Algebra R A₀] [Fintype σ]
    (e : (K ⊗[R] A₀) ≃ₐ[K] A) (v₀ : σ → A₀) (v : σ → A)
    (hv : ∀ i, e (1 ⊗ₜ[R] v₀ i) = v i)
    (hdom : Function.Injective (Polynomial.aeval (homogeneousLinearForm v) :
      (MvPolynomial σ K)[X] →ₐ[MvPolynomial σ K] MvPolynomial σ A))
    (i j : σ) (hji : j ≠ i) (hj : Transcendental K (v j))
    (hi : v i ⊗ₜ[K] (1 : A) - (1 : A) ⊗ₜ[K] v i ≠ 0)
    (hij : ∀ r : A ⊗[K] A,
      (v i ⊗ₜ[K] (1 : A) - (1 : A) ⊗ₜ[K] v i) ∣
        (v j ⊗ₜ[K] (1 : A) - (1 : A) ⊗ₜ[K] v j) * r →
      (v i ⊗ₜ[K] (1 : A) - (1 : A) ⊗ₜ[K] v i) ∣ r) :
    ∀ f : (MvPolynomial σ R)[X] →ₐ[R] K, Function.Injective f →
      IsDomain (A ⧸ Ideal.span {algebraMap K A (f X) -
        ∑ k, algebraMap K A (f (C (MvPolynomial.X k))) * v k}) := by
  sorry

end
end MaximalSeshadri.BertiniIntegral
end
end
end OAI
Source
OpenAI, Maximal Seshadri constants on arbitrary polarized surfaces, September 23, 2026, https://github.com/openai/math (paper: preprints/Maximal-Seshadri-Constants-on-Arbitrary-Polarized-Surfaces-September-23-2026/main.pdf; Lean: lean/OAI/AlgebraicGeometry/Seshadri, Apache License 2.0); Lean declaration `OAI.MaximalSeshadri.BertiniIntegral.generic_hyperplane_section_over_model`, https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/AlgebraicGeometry/Seshadri/Bertini/SimultaneousHyperplanes.lean#L18

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me