Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

When only e^{x₁y₂} and e^{x₂y₂} are algebraic, transcendence degree one yields integer polynomials too small at a transcendental number

Proved
FourExp.small_polynomials_of_column

by carlok · Sep 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Let x1,x2x_1, x_2x1​,x2​ be Q\mathbb{Q}Q-linearly independent, and likewise y1,y2y_1, y_2y1​,y2​. Suppose that ex1y2e^{x_1y_2}ex1​y2​ and ex2y2e^{x_2y_2}ex2​y2​ are algebraic and that

trdeg⁡Q Q[x1,x2,y1,y2,ex1y1,ex2y1]≤1.\operatorname{trdeg}_{\mathbb{Q}}\, \mathbb{Q}[x_1, x_2, y_1, y_2, e^{x_1y_1}, e^{x_2y_1}] \le 1.trdegQ​Q[x1​,x2​,y1​,y2​,ex1​y1​,ex2​y1​]≤1.

Then there are a transcendental ω\omegaω and growth functions σ1,σ2\sigma_1, \sigma_2σ1​,σ2​ with constants a1,a2≥1a_1, a_2 \ge 1a1​,a2​≥1, satisfying the hypotheses of FourExp.transcendence_criterion, such that for every CCC there are non-zero PN∈Z[X]P_N \in \mathbb{Z}[X]PN​∈Z[X] for all large NNN, with coefficients at most eσ1(N)e^{\sigma_1(N)}eσ1​(N), degree at most σ2(N)\sigma_2(N)σ2​(N) and

∣PN(ω)∣<e−Cσ1(N)σ2(N).|P_N(\omega)| < e^{-C\sigma_1(N)\sigma_2(N)}.∣PN​(ω)∣<e−Cσ1​(N)σ2​(N).

This is FourExp.small_polynomials_of_counterexample with only ex1y2e^{x_1y_2}ex1​y2​ and ex2y2e^{x_2y_2}ex2​y2​ assumed algebraic and with ex1y1e^{x_1y_1}ex1​y1​, ex2y1e^{x_2y_1}ex2​y1​ in the transcendence-degree hypothesis, stated for given xxx and yyy instead of a 2×22 \times 22×2 matrix of logarithms. In Waldschmidt (1973) it is Lemmes 4–7 together: FourExp.auxiliary_construction_column builds the auxiliary function, and FourExp.nonvanishing_derivative finds a non-zero derivative on the grid. Gel'fond's criterion then makes ω\omegaω algebraic, which is the contradiction in DiazModulus.two_algebraically_independent_of_exp_column; so the hypotheses never hold together.

Preamble
import Mathlib
Formal statement
open Filter Topology

namespace FourExp

/-- The analytic half of Waldschmidt's theorem of 1973, in the column case.

Let `x₁, x₂` and `y₁, y₂` be `ℚ`-linearly independent, with `e^{x₁y₂}` and `e^{x₂y₂}` algebraic,
and suppose that `ℚ[x₁, x₂, y₁, y₂, e^{x₁y₁}, e^{x₂y₁}]` has transcendence degree at most one.
Then there are a transcendental `ω` and integer polynomials `P_N ≠ 0`, of height at most
`e^{σ₁(N)}` and degree at most `σ₂(N)`, with `|P_N(ω)| < e^{-C σ₁(N) σ₂(N)}` for every `C`; the
functions `σ₁, σ₂` satisfy the growth conditions of Gel'fond's criterion
(`FourExp.transcendence_criterion`), which then makes `ω` algebraic.

This is `FourExp.small_polynomials_of_counterexample` with the column hypothesis in place of the
four algebraic exponentials. -/
theorem small_polynomials_of_column :
    ∀ x₁ x₂ y₁ y₂ : ℂ, LinearIndependent ℚ ![x₁, x₂] → LinearIndependent ℚ ![y₁, y₂] →
      IsAlgebraic ℚ (Complex.exp (x₁ * y₂)) → IsAlgebraic ℚ (Complex.exp (x₂ * y₂)) →
      Algebra.trdeg ℚ ↥(Algebra.adjoin ℚ ({x₁, x₂, y₁, y₂, Complex.exp (x₁ * y₁),
          Complex.exp (x₂ * y₁)} : Set ℂ)) ≤ 1 →
      ∃ ω : ℂ, Transcendental ℚ ω ∧
        ∃ σ₁ σ₂ : ℝ → ℝ, StrictMono σ₁ ∧ StrictMono σ₂ ∧
          Tendsto σ₁ atTop atTop ∧ Tendsto σ₂ atTop atTop ∧
          ∃ a₁ a₂ : ℝ, 1 ≤ a₁ ∧ 1 ≤ a₂ ∧
            (∀ x : ℝ, 0 < x → σ₂ x ≤ σ₁ x) ∧
            (∀ x : ℝ, 0 < x → σ₁ (x + 1) ≤ a₁ * σ₁ x) ∧
            (∀ x : ℝ, 0 < x → σ₂ (x + 1) ≤ a₂ * σ₂ x) ∧
            ∀ C : ℝ, ∃ N₀ : ℕ, ∃ P : ℕ → Polynomial ℤ, ∀ N : ℕ, N₀ < N →
              P N ≠ 0 ∧
              (∀ i : ℕ, |((P N).coeff i : ℝ)| ≤ Real.exp (σ₁ N)) ∧
              ((P N).natDegree : ℝ) ≤ σ₂ N ∧
              ‖Polynomial.aeval ω (P N)‖ < Real.exp (-(C * σ₁ N * σ₂ N)) := by
  sorry

end FourExp
Source
M. Waldschmidt, Solution du huitième problème de Schneider, J. Number Theory 5 (1973), 191–202, Lemmes 4–7, with the zero estimate of M. Waldschmidt, Indépendance algébrique des valeurs de la fonction exponentielle, Bull. Soc. Math. France 99 (1971), 285–304, Lemme 3, in place of Gel'fond's zero lemma (Lemme 2 of the 1973 paper) in Lemme 6. Formal proof: Diaz modulus mission, 30 September 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