Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Trailing degrees and degrees in the span of X^(k−1), X^k, X^(k+1) and two polynomials supported at the two ends

Proved
DiazModulus.shifted_polynomial_hull_orders

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

diaz-modulus-leannumber-theorytranscendence

Let KKK be a field, 2≤m≤k2 \leq m \leq k2≤m≤k, Q1≠0Q_1 \neq 0Q1​=0 with trailing degree k+mk + mk+m and degree 2k2k2k, and Q2Q_2Q2​ with non-zero constant term and degree k−mk - mk−m. Every non-zero fff in the span of Xk−1,Xk,Xk+1,Q1,Q2X^{k-1}, X^k, X^{k+1}, Q_1, Q_2Xk−1,Xk,Xk+1,Q1​,Q2​ has trailing degree in {0,k−1,k,k+1,k+m}\{0, k - 1, k, k + 1, k + m\}{0,k−1,k,k+1,k+m} and degree in {k−m,k−1,k,k+1,2k}\{k - m, k - 1, k, k + 1, 2k\}{k−m,k−1,k,k+1,2k}.

Proof. Write f=c1Xk−1+c2Xk+c3Xk+1+αQ1+βQ2f = c_1X^{k-1} + c_2X^k + c_3X^{k+1} + \alpha Q_1 + \beta Q_2f=c1​Xk−1+c2​Xk+c3​Xk+1+αQ1​+βQ2​. As k−1≥1k - 1 \geq 1k−1≥1, only Q2Q_2Q2​ has a constant term; Q1Q_1Q1​ is supported in [k+m,2k][k+m, 2k][k+m,2k] with k+m≥k+2k + m \geq k + 2k+m≥k+2, and Q2Q_2Q2​ in [0,k−m][0, k - m][0,k−m] with k−m≤k−2k - m \leq k - 2k−m≤k−2. Reading off coefficients, the trailing degree is 000 if β≠0\beta \neq 0β=0, else the first of k−1,k,k+1k - 1, k, k + 1k−1,k,k+1 with ci≠0c_i \neq 0ci​=0, else k+mk + mk+m; the degree is 2k2k2k if α≠0\alpha \neq 0α=0, else the last of k+1,k,k−1k + 1, k, k - 1k+1,k,k−1 with ci≠0c_i \neq 0ci​=0, else k−mk - mk−m.

Novelty. Not found in the sources read; routine.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

open Polynomial in
theorem shifted_polynomial_hull_orders (K : Type*) [Field K] (k m : ℕ) (hm : 2 ≤ m) (hmk : m ≤ k)
    (Q₁ Q₂ : K[X]) (hQ₁ : Q₁ ≠ 0) (hQ₁t : Q₁.natTrailingDegree = k + m)
    (hQ₁d : Q₁.natDegree = 2 * k) (hQ₂ : Q₂.coeff 0 ≠ 0) (hQ₂d : Q₂.natDegree = k - m)
    (f : K[X]) (hf : f ∈ Submodule.span K ({X ^ (k - 1), X ^ k, X ^ (k + 1), Q₁, Q₂} : Set K[X]))
    (hf0 : f ≠ 0) :
    f.natTrailingDegree ∈ ({0, k - 1, k, k + 1, k + m} : Finset ℕ) ∧
      f.natDegree ∈ ({k - m, k - 1, k, k + 1, 2 * k} : Finset ℕ) := by
  sorry

end DiazModulus
Source
Not found in the sources read. R16 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 16 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