Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

If every non-zero element of a plane M has degree ≥ N + 2, and p y, q y lie in H_N + M with deg p < deg q, then p y lies in H_N + K n for n of least degree in M

Proved
DiazModulus.laurent_window_factor_in_hull_plus_min_degree_line

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

diaz-modulus-leannumber-theorytranscendence

Let KKK be a field, N≥0N \geq 0N≥0, HN=spanK(XN−1,XN,XN+1)⊆K[X]H_N = \mathrm{span}_K(X^{N-1}, X^N, X^{N+1}) \subseteq K[X]HN​=spanK​(XN−1,XN,XN+1)⊆K[X] (with N−1N - 1N−1 read as 000 when N=0N = 0N=0), and M⊆K[X]M \subseteq K[X]M⊆K[X] a subspace of dimension 222 whose non-zero elements all have degree at least N+2N + 2N+2. Then MMM has a non-zero element nnn of least degree among its non-zero elements such that, for all p,q,y∈K[X]p, q, y \in K[X]p,q,y∈K[X] with deg⁡p<deg⁡q\deg p < \deg qdegp<degq: if pypypy and qyqyqy lie in HN+MH_N + MHN​+M, then py∈HN+Knpy \in H_N + Knpy∈HN​+Kn.

Proof. Take n∈Mn \in Mn∈M non-zero of least degree. Write py=h+mpy = h + mpy=h+m and qy=h′+m′qy = h' + m'qy=h′+m′ with h,h′∈HNh, h' \in H_Nh,h′∈HN​ and m,m′∈Mm, m' \in Mm,m′∈M; if m=0m = 0m=0 there is nothing to prove. Otherwise deg⁡(py)=deg⁡m≥N+2>deg⁡h\deg(py) = \deg m \geq N + 2 > \deg hdeg(py)=degm≥N+2>degh, so p,y≠0p, y \neq 0p,y=0 and deg⁡(qy)>deg⁡(py)\deg(qy) > \deg(py)deg(qy)>deg(py); hence m′≠0m' \neq 0m′=0, deg⁡(qy)=deg⁡m′\deg(qy) = \deg m'deg(qy)=degm′ and deg⁡m<deg⁡m′\deg m < \deg m'degm<degm′. Two elements of distinct degrees span the plane MMM, so n=am+bm′n = am + bm'n=am+bm′, and the minimality of deg⁡n\deg ndegn forces b=0b = 0b=0: m∈Knm \in Knm∈Kn.

Novelty. Not found in the sources read; routine. The degree count is in the manner of the valuation argument of Bachoc, Serra and Zémor (2017, §7, proof of Th. 33).

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

open Polynomial in
theorem laurent_window_factor_in_hull_plus_min_degree_line (K : Type*) [Field K] (N : ℕ) (M : Submodule K K[X]) (hM2 : Module.finrank K M = 2)
    (hMd : ∀ f ∈ M, f ≠ 0 → N + 2 ≤ f.natDegree) :
    ∃ n ∈ M, n ≠ 0 ∧ (∀ f ∈ M, f ≠ 0 → n.natDegree ≤ f.natDegree) ∧
      ∀ p q y : K[X], p.natDegree < q.natDegree → p * y ∈ (Submodule.span K ({X ^ (N - 1), X ^ N, X ^ (N + 1)} : Set K[X]) ⊔ M) →
        q * y ∈ (Submodule.span K ({X ^ (N - 1), X ^ N, X ^ (N + 1)} : Set K[X]) ⊔ M) →
        p * y ∈ Submodule.span K ({X ^ (N - 1), X ^ N, X ^ (N + 1), n} : Set K[X]) := by
  sorry

end DiazModulus
Source
Not found in the sources read; a degree count in the manner of C. Bachoc, O. Serra, G. Zémor, An analogue of Vosper's theorem for extension fields, Math. Proc. Cambridge Philos. Soc. (2017), §7. R18 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 18 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me