Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

For u ∉ Q̄ with uū algebraic and deg P ≤ 1 or ≥ 4, no 2×3 configuration lies in the span of 1, u, ū, P(u), P(u)‾

Proved
DiazModulus.polynomial_hull_no_two_by_three_configuration

by carlok · Oct 16, 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​ with ρ=uuˉ\rho = u\bar uρ=uuˉ algebraic (so uˉ=ρ/u\bar u = \rho/uuˉ=ρ/u). Let P∈Q‾[X]P \in \overline{\mathbb{Q}}[X]P∈Q​[X] have degree at most 111 or at least 444, and let W=Q‾+Q‾u+Q‾uˉ+Q‾P(u)+Q‾P(u)‾W = \overline{\mathbb{Q}} + \overline{\mathbb{Q}}u + \overline{\mathbb{Q}}\bar u + \overline{\mathbb{Q}}P(u) + \overline{\mathbb{Q}}\overline{P(u)}W=Q​+Q​u+Q​uˉ+Q​P(u)+Q​P(u)​. Then WWW carries no 2×32 \times 32×3 configuration (free x1,x2x_1, x_2x1​,x2​ and free y1,y2,y3y_1, y_2, y_3y1​,y2​,y3​ over Q‾\overline{\mathbb{Q}}Q​ with all six products xiyjx_iy_jxi​yj​ in the space).

Proof. Suppose a configuration lies in WWW. If uNu^NuN times each spanning number is the value at uuu of a polynomial in a subspace H⊆Q‾[X]H \subseteq \overline{\mathbb{Q}}[X]H⊆Q​[X], DiazModulus.config_shifted_polynomial_spans gives free a0,a1a_0, a_1a0​,a1​, free b0,b1,b2b_0, b_1, b_2b0​,b1​,b2​ and P0≠0P_0 \neq 0P0​=0 in Q‾[X]\overline{\mathbb{Q}}[X]Q​[X] with fg=P0hfg = P_0hfg=P0​h, h∈Hh \in Hh∈H, for fff in the span of the aaa's and ggg in that of the bbb's; along it orders at 000 and degrees add, and each span has as many orders, and as many degrees, as its dimension (DiazModulus.polynomial_submodule_trailing_degrees_card, DiazModulus.polynomial_submodule_degrees_card). If deg⁡P≤1\deg P \leq 1degP≤1, take N=1N = 1N=1 and HHH the polynomials of degree at most 222: the six degree sums would lie in a window of three values, which two and three distinct degrees cannot do. If k=deg⁡P≥4k = \deg P \geq 4k=degP≥4, let L=P−p0−p1XL = P - p_0 - p_1XL=P−p0​−p1​X, mmm its order, Q1=XkLQ_1 = X^kLQ1​=XkL and Q2=∑jpˉjρjXk−jQ_2 = \sum_j \bar p_j \rho^j X^{k-j}Q2​=∑j​pˉ​j​ρjXk−j, so ukL(u)‾=Q2(u)u^k\overline{L(u)} = Q_2(u)ukL(u)​=Q2​(u); with N=kN = kN=k and H=span(Xk−1,Xk,Xk+1,Q1,Q2)H = \mathrm{span}(X^{k-1}, X^k, X^{k+1}, Q_1, Q_2)H=span(Xk−1,Xk,Xk+1,Q1​,Q2​), DiazModulus.shifted_polynomial_hull_orders puts the shifted orders and the reflected degrees of HHH in {−k,−1,0,1,m}\{-k, -1, 0, 1, m\}{−k,−1,0,1,m}, and DiazModulus.five_point_sumset_rigid makes the shifted order sums, and the reflected degree sums, exactly {−1,0,1,2}\{-1, 0, 1, 2\}{−1,0,1,2}. A product fg=P0hfg = P_0hfg=P0​h with order sum 222 then has ord h=k+2\mathrm{ord}\,h = k + 2ordh=k+2 and deg⁡h≤k+1\deg h \leq k + 1degh≤k+1, which is impossible.

Novelty. For deg⁡P≤1\deg P \leq 1degP≤1 the space has dimension 333, where no 2×32 \times 32×3 configuration exists (Roy, Acta Math. 1995, Th. 3.4; Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Exercise 12.10). For deg⁡P≥4\deg P \geq 4degP≥4 the statement was not found in the sources read; the proof applies the valuation and sumset method of Bachoc, Serra and Zémor (2017, §7, proof of Th. 33) at the two ends together, and pinching the support between the orders at 000 and at ∞\infty∞ was not seen there. Routine. The case P=XkP = X^kP=Xk is DiazModulus.power_hull_strong_six_exp_configuration_iff.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

open Polynomial in
theorem polynomial_hull_no_two_by_three_configuration {u : ℂ} (hu : u ∉ Qbar)
    (hρ : IsAlgebraic ℚ (u * conj u)) (P : (↥Qbar)[X])
    (hP : P.natDegree ≤ 1 ∨ 4 ≤ P.natDegree) :
    ¬ ∃ (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, aeval u P, conj (aeval u P)} : Set ℂ) := by
  sorry

end DiazModulus
Source
For degree at most 1: D. Roy, Points whose coordinates are logarithms of algebraic numbers on algebraic varieties, Acta Math. 175 (1995), 49–73, Th. 3.4. For degree at least 4, not found in the sources read; the method is that of C. Bachoc, O. Serra, G. Zémor, An analogue of Vosper's theorem for extension fields, Math. Proc. Cambridge Philos. Soc. (2017), §7. Uses DiazModulus.config_shifted_polynomial_spans, DiazModulus.polynomial_submodule_trailing_degrees_card, DiazModulus.polynomial_submodule_degrees_card, DiazModulus.shifted_polynomial_hull_orders and DiazModulus.five_point_sumset_rigid. 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