When only e^{x₁y₂} and e^{x₂y₂} are algebraic, transcendence degree one yields integer polynomials too small at a transcendental number
ProvedFourExp.small_polynomials_of_columnLet be -linearly independent, and likewise . Suppose that and are algebraic and that
Then there are a transcendental and growth functions with constants , satisfying the hypotheses of FourExp.transcendence_criterion, such that for every there are non-zero for all large , with coefficients at most , degree at most and
This is FourExp.small_polynomials_of_counterexample with only and assumed algebraic and with , in the transcendence-degree hypothesis, stated for given and instead of a 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 algebraic, which is the contradiction in DiazModulus.two_algebraically_independent_of_exp_column; so the hypotheses never hold together.
import Mathlib
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