Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

An auxiliary function whose grid exceeds the zero count and whose non-zero derivatives give small integer polynomials, when only e^{x₁y₂} and e^{x₂y₂} are algebraic

Proved
FourExp.auxiliary_construction_column

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

complex-analysisdiaz-modulus-leanexponential-polynomialsnumber-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 Q[x1,x2,y1,y2,ex1y1,ex2y1]\mathbb{Q}[x_1, x_2, y_1, y_2, e^{x_1y_1}, e^{x_2y_1}]Q[x1​,x2​,y1​,y2​,ex1​y1​,ex2​y1​] has transcendence degree at most one. 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 and every large NNN there are integers S,T,R1,R2,S′S, T, R_1, R_2, S'S,T,R1​,R2​,S′, coefficients cijkc_{ijk}cijk​ (i<Si < Si<S, j,k<Tj, k < Tj,k<T), not all zero, and λ>0\lambda > 0λ>0 with two properties. First, with n=ST2n = ST^{2}n=ST2,

nλ+2 1+nλλlog⁡n(1+(R1∣y1∣+R2∣y2∣) T(∣x1∣+∣x2∣))≤R1R2S′.\frac{n}{\lambda} + 2\,\frac{1 + n^{\lambda}}{\lambda\log n}\Big(1 + (R_1|y_1| + R_2|y_2|)\,T(|x_1| + |x_2|)\Big) \le R_1R_2S'.λn​+2λlogn1+nλ​(1+(R1​∣y1​∣+R2​∣y2​∣)T(∣x1​∣+∣x2​∣))≤R1​R2​S′.

Second, with G(z)=∑i,j,kcijk zie(jx1+kx2)zG(z) = \sum_{i,j,k} c_{ijk}\, z^{i} e^{(jx_1 + kx_2)z}G(z)=∑i,j,k​cijk​zie(jx1​+kx2​)z, every non-zero G(s)(ay1+by2)G^{(s)}(ay_1 + by_2)G(s)(ay1​+by2​) with a<R1a < R_1a<R1​, b<R2b < R_2b<R2​, s<S′s < S's<S′ gives a non-zero P∈Z[X]P \in \mathbb{Z}[X]P∈Z[X] 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 ∣P(ω)∣<e−Cσ1(N)σ2(N)|P(\omega)| < e^{-C\sigma_1(N)\sigma_2(N)}∣P(ω)∣<e−Cσ1​(N)σ2​(N).

The first property is the zero-count inequality of FourExp.nonvanishing_derivative. This is FourExp.auxiliary_construction 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; it is stated for given xxx and yyy instead of a 2×22 \times 22×2 matrix of logarithms, so no rank-one parametrisation is needed. In Waldschmidt (1973) it gathers Lemmes 4, 5 and 7 and the count that Lemme 6 needs; here it combines FourExp.construction_core_column, FourExp.construction_growth and FourExp.construction_count_1973. The hypotheses never hold together, by DiazModulus.two_algebraically_independent_of_exp_column: this node is a step of its proof by contradiction.

Preamble
import Mathlib
Formal statement
open Filter Topology

namespace FourExp

/-- The auxiliary construction 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 functions `σ₁, σ₂` as in Gel'fond's criterion such that,
for every `C` and every large `N`, some exponential polynomial
`F(z) = ∑ c_{ijk} z^i e^{(j x₁ + k x₂) z}` with a non-zero coefficient satisfies the zero-count
inequality of `FourExp.nonvanishing_derivative` on a grid of points `a y₁ + b y₂`, and every
non-zero derivative `F⁽ˢ⁾(a y₁ + b y₂)` on that grid gives an integer polynomial `P ≠ 0` of height
at most `e^{σ₁(N)}` and degree at most `σ₂(N)` with `|P(ω)| < e^{-C σ₁(N) σ₂(N)}`.

This is `FourExp.auxiliary_construction` with the column hypothesis in place of the four algebraic
exponentials. The numbers `x`, `y` are given, so no rank-one parametrization is needed, and the
construction is stated for them. -/
theorem auxiliary_construction_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₀ : ℕ, ∀ N : ℕ, N₀ < N →
              ∃ (S T R₁ R₂ S' : ℕ) (c : Fin S → Fin T → Fin T → ℂ), (∃ i j k, c i j k ≠ 0) ∧
              (∃ lam : ℝ, 0 < lam ∧ (((S * T * T : ℕ) : ℝ) / lam
              + 2 * (1 + ((S * T * T : ℕ) : ℝ) ^ lam) / (lam * Real.log ((S * T * T : ℕ) : ℝ))
                * (1 + ((R₁ : ℝ) * ‖y₁‖ + (R₂ : ℝ) * ‖y₂‖) * ((T : ℝ) * (‖x₁‖ + ‖x₂‖)))
            ≤ ((R₁ * R₂ * S' : ℕ) : ℝ))) ∧
              ∀ a b s : ℕ, a < R₁ → b < R₂ → s < S' →
                iteratedDeriv s (fun z : ℂ => ∑ i : Fin S, ∑ j : Fin T, ∑ k : Fin T,
              c i j k * z ^ (i : ℕ) * Complex.exp ((((j : ℕ) : ℂ) * x₁ + ((k : ℕ) : ℂ) * x₂) * z))
                  ((a : ℂ) * y₁ + (b : ℂ) * y₂) ≠ 0 →
                ∃ P : Polynomial ℤ, P ≠ 0 ∧
                  (∀ i : ℕ, |(P.coeff i : ℝ)| ≤ Real.exp (σ₁ N)) ∧
                  (P.natDegree : ℝ) ≤ σ₂ N ∧
                  ‖Polynomial.aeval ω P‖ < 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, 5 and 7, with the growth functions of p. 201; the count is made for 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, which replaces 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