Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Under unmixedness, if every prime over (ps0)+(V)(ps_0) + (V)(ps0​)+(V) has height at least ∣ps0∣+r|ps_0| + r∣ps0​∣+r, then rrr elements of VVV extend ps0ps_0ps0​ to a weakly regular sequence

Proved
DiazModulus.exists_isWeaklyRegular_append_of_height

by carlok · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

commutative-algebradiaz-modulus-leanhilbert-functiontranscendence

Let KKK be an infinite field and SSS a commutative Noetherian KKK-algebra with hU : UnmixedHeight S. Let ps0ps_0ps0​ be a weakly regular list on SSS, VVV a KKK-subspace of SSS and r∈Nr \in \mathbb{N}r∈N, and assume that every prime ideal ppp of SSS containing (ps0)+(V)(ps_0) + (V)(ps0​)+(V) has height at least ∣ps0∣+r|ps_0| + r∣ps0​∣+r (a vacuous hypothesis when (ps0)+(V)=S(ps_0) + (V) = S(ps0​)+(V)=S). Then there is a list rsrsrs of rrr elements of VVV such that ps0ps_0ps0​ followed by rsrsrs is weakly regular on SSS. A list is weakly regular on SSS when each entry is a nonzerodivisor on the quotient of SSS by the ideal generated by the earlier entries (Mathlib's IsWeaklyRegular; the final quotient may be zero). For a list ps0ps_0ps0​, (ps0)(ps_0)(ps0​) is the ideal generated by its entries and ∣ps0∣|ps_0|∣ps0​∣ its length. Heights of prime ideals are taken in N∪{∞}\mathbb{N} \cup \{\infty\}N∪{∞}, and (V)(V)(V) is the ideal generated by VVV. The hypothesis hU : UnmixedHeight S is assumed here, not proved: it says that for every weakly regular sequence r1,…,rkr_1, \dots, r_kr1​,…,rk​ of the ring, every associated prime of the quotient by (r1,…,rk)(r_1, \dots, r_k)(r1​,…,rk​) has height at most kkk. For polynomial rings over a field it follows from Macaulay's unmixedness theorem (DALAG §8.2.1); its formal proof is planned for C1.2 of the Diaz modulus mission. The names boxHilb, blockBox, torusBox, torusIdeal, torusList, torusReduced, boxD, torusCoeffPoly, torusPoint and UnmixedHeight are those of the published Definition DiazHilbertBox (module Definitions.Def_DiazHilbertBox).

Proof. Induction on the length m≤rm \le rm≤r of rsrsrs. Let L=ps0L = ps_0L=ps0​ followed by rsrsrs be weakly regular, with m<rm < rm<r. Every associated prime ppp of S/(L)S/(L)S/(L) contains (L)⊇(ps0)(L) \supseteq (ps_0)(L)⊇(ps0​), and hU bounds its height by ∣ps0∣+m|ps_0| + m∣ps0​∣+m; if V⊆pV \subseteq pV⊆p, the height hypothesis would give ∣ps0∣+r≤∣ps0∣+m|ps_0| + r \le |ps_0| + m∣ps0​∣+r≤∣ps0​∣+m, so V⊈pV \not\subseteq pV⊆p. DiazModulus.exists_mem_isSMulRegular_of_associatedPrimes, applied to the finite module S/(L)S/(L)S/(L), gives x∈Vx \in Vx∈V regular on S/(L)S/(L)S/(L), and LLL followed by xxx is weakly regular. If S/(L)=0S/(L) = 0S/(L)=0 there is no associated prime and the step is the same.

Novelty. Classical; routine formalisation. The construction in the proof of DALAG Th. 8.4 (pp. 237–238), with ranks replaced by heights and unmixedness made an explicit hypothesis.

Preamble
import Definitions.Def_DiazHilbertBox
Formal statement
namespace DiazModulus

theorem exists_isWeaklyRegular_append_of_height {K S : Type*} [Field K] [CommRing S] [Algebra K S]
    [IsNoetherianRing S] [Infinite K]
    (hU : UnmixedHeight S)
    (ps₀ : List S) (hps₀ : RingTheory.Sequence.IsWeaklyRegular S ps₀) (V : Submodule K S) (r : ℕ)
    (hH : ∀ p : Ideal S, p.IsPrime → Ideal.ofList ps₀ ⊔ Ideal.span (V : Set S) ≤ p →
      ((ps₀.length + r : ℕ) : ℕ∞) ≤ p.height) :
    ∃ rs : List S, rs.length = r ∧ (∀ x ∈ rs, x ∈ V) ∧
      RingTheory.Sequence.IsWeaklyRegular S (ps₀ ++ rs) := by
  sorry

end DiazModulus
Source
M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, the proof of Th. 8.4 (§8.2.3, pp. 237–238; Chapter 8 is by D. Roy), with Macaulay's unmixedness theorem (§8.2.1, p. 235) taken as the hypothesis UnmixedHeight. Uses DiazModulus.exists_mem_isSMulRegular_of_associatedPrimes. C1.1 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 29 October 2026 (C. Perassi).

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