Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary E(a): if a polynomial in u and ū has an exponent of absolute value at least four, its hull carries a 2×3 configuration exactly in the real pencil class

Proved
DiazModulus.laurent_conj_hull_large_exponent_configuration_iff_real_pencil_class

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

diaz-modulus-leannumber-theorytranscendence

Let u∈C∖Q‾u \in \mathbb{C} \setminus \overline{\mathbb{Q}}u∈C∖Q​ and s∈Q‾s \in \overline{\mathbb{Q}}s∈Q​ with s2=uuˉs^2 = u\bar us2=uuˉ (so s=±∣u∣s = \pm|u|s=±∣u∣ is real), and put v=u/sv = u/sv=u/s, so that vˉ=1/v\bar v = 1/vvˉ=1/v. Let k≥0k \geq 0k≥0, let cj∈Q‾c_j \in \overline{\mathbb{Q}}cj​∈Q​ for all j∈Zj \in \mathbb{Z}j∈Z, and put z=∑j=−kkcjvjz = \sum_{j=-k}^{k} c_jv^jz=∑j=−kk​cj​vj and W=spanQ‾(1,u,uˉ,z,zˉ)W = \mathrm{span}_{\overline{\mathbb{Q}}}(1, u, \bar u, z, \bar z)W=spanQ​​(1,u,uˉ,z,zˉ). Suppose cj≠0c_j \neq 0cj​=0 for some jjj with 4≤∣j∣≤k4 \leq |j| \leq k4≤∣j∣≤k. Then WWW carries a 2×32 \times 32×3 configuration (free x0,x1x_0, x_1x0​,x1​ and free y0,y1,y2y_0, y_1, y_2y0​,y1​,y2​ over Q‾\overline{\mathbb{Q}}Q​ with all six products xiyjx_iy_jxi​yj​ in the space) if and only if WWW is in the class

  • (R) W=spanQ‾(1,u,uˉ,g,gˉ)W = \mathrm{span}_{\overline{\mathbb{Q}}}(1, u, \bar u, g, \bar g)W=spanQ​​(1,u,uˉ,g,gˉ​) with g=G(v)+κ vG(v)‾g = G(v) + \kappa\,\overline{vG(v)}g=G(v)+κvG(v)​, for some κ∈Q‾\kappa \in \overline{\mathbb{Q}}κ∈Q​ with κκˉ=1\kappa\bar\kappa = 1κκˉ=1 and some G∈Q‾[X]G \in \overline{\mathbb{Q}}[X]G∈Q​[X] with G(0)=0G(0) = 0G(0)=0 and deg⁡G≥2\deg G \geq 2degG≥2.

Proof. If: class (R) gives dim⁡W=5\dim W = 5dimW=5 (DiazModulus.laurent_conj_hull_class_finrank_eq_five), and Theorem E (DiazModulus.laurent_conj_hull_two_by_three_configuration_iff) gives the configuration. Only if: Theorem E gives dim⁡W=5\dim W = 5dimW=5 and one of the classes (P), (Q), (R). In (Q), z∈Wz \in Wz∈W lies in the window span(v−3,…,v3)\mathrm{span}(v^{-3}, \dots, v^3)span(v−3,…,v3). In (P), m=αu2+βu3∈Wm = \alpha u^2 + \beta u^3 \in Wm=αu2+βu3∈W is itself a Laurent polynomial in vvv of class (P), so its hull, contained in WWW, is five-dimensional by DiazModulus.laurent_conj_hull_class_finrank_eq_five, hence equal to WWW, and again zzz lies in the window. Clearing by vkv^kvk and comparing the coefficients of ∑cjXj+k\sum c_jX^{j+k}∑cj​Xj+k then gives cj=0c_j = 0cj​=0 for ∣j∣≥4|j| \geq 4∣j∣≥4, a contradiction.

Novelty. Not found in the sources read; routine, given Theorem E (DiazModulus.laurent_conj_hull_two_by_three_configuration_iff).

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem laurent_conj_hull_large_exponent_configuration_iff_real_pencil_class
    (u s : ℂ) (hu : u ∉ Qbar) (hs : s ∈ Qbar) (hss : s * s = u * conj u)
    (k : ℕ) (c : ℤ → ℂ) (hc : ∀ j, c j ∈ Qbar)
    (hbig : ∃ j ∈ Finset.Icc (-(k : ℤ)) k, 4 ≤ |j| ∧ c j ≠ 0) :
    (∃ (x : Fin 2 → ℂ) (y : Fin 3 → ℂ), LinearIndependent (↥Qbar) x ∧ LinearIndependent (↥Qbar) y ∧
      ∀ i j, x i * y j ∈ Submodule.span Qbar ({1, u, conj u, (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * (u / s) ^ j), conj (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * (u / s) ^ j)} : Set ℂ)) ↔
      (∃ κ : ℂ, κ ∈ Qbar ∧ κ * conj κ = 1 ∧ ∃ G : Polynomial ↥Qbar, G.coeff 0 = 0 ∧ 2 ≤ G.natDegree ∧
        Submodule.span Qbar ({1, u, conj u, (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * (u / s) ^ j), conj (∑ j ∈ Finset.Icc (-(k : ℤ)) k, c j * (u / s) ^ j)} : Set ℂ) =
          Submodule.span Qbar ({1, u, conj u, Polynomial.aeval (u / s) G + κ * conj ((u / s) * Polynomial.aeval (u / s) G), conj (Polynomial.aeval (u / s) G + κ * conj ((u / s) * Polynomial.aeval (u / s) G))} : Set ℂ)) := by
  sorry

end DiazModulus
Source
Not found in the sources read. Uses DiazModulus.laurent_conj_hull_two_by_three_configuration_iff and DiazModulus.laurent_conj_hull_class_finrank_eq_five. 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