Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

An integer combination of entire functions that is small on a polydisc, for given T, X and ℓ (Proposition 4.10 with the parameters left free)

Proved
Transcendence.siegel_small_values_of_count

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

diaz-modulus-leannumber-theorytranscendence

Let ι\iotaι and Λ\LambdaΛ be finite sets, n=∣ι∣n = |\iota|n=∣ι∣ and L=∣Λ∣L = |\Lambda|L=∣Λ∣, and let φλ\varphi_\lambdaφλ​ (λ∈Λ\lambda \in \Lambdaλ∈Λ) be entire functions on Cι\mathbb{C}^\iotaCι with ∣φλ∣≤Bλ|\varphi_\lambda| \le B_\lambda∣φλ​∣≤Bλ​ on the closed polydisc of radius RRR about 000 and ∑λBλ≤C\sum_\lambda B_\lambda \le C∑λ​Bλ​≤C, where C>0C > 0C>0. Let 0<r<R0 < r < R0<r<R, and let TTT, XXX and ℓ≥1\ell \ge 1ℓ≥1 be integers with ℓ2Tn<(X+1)L\ell^{2T^n} < (X+1)^{L}ℓ2Tn<(X+1)L. Then there are integers pλp_\lambdapλ​, not all zero, with ∣pλ∣≤X|p_\lambda| \le X∣pλ​∣≤X, such that on the closed polydisc of radius rrr

∣∑λpλφλ∣≤Tn⋅2CXℓ+XC (r/R)T1−r/R.\Bigl|\sum_{\lambda} p_\lambda\varphi_\lambda\Bigr| \le T^n\cdot\frac{2CX}{\ell} + \frac{XC\,(r/R)^{T}}{1 - r/R}.​λ∑​pλ​φλ​​≤Tn⋅ℓ2CX​+1−r/RXC(r/R)T​.

With the parameters of Transcendence.siegel_small_values_parameters, it gives Proposition 4.10 (Transcendence.siegel_small_values).

It is one step of the proof of Baker's theorem formalised in this mission, which follows Chapter 4 of Waldschmidt's book: Baker's theorem from the criterion of Schneider–Lang for Cartesian products, as observed by Bertrand and Masser (1980).

Novelty. None: the argument of §4.5 of Waldschmidt's book (Lemmas 4.11–4.13 and the proof of Proposition 4.10, pp. 132–136) with TTT, XXX and ℓ\ellℓ left free. Thue–Siegel's lemma over C\mathbb{C}C (the book's Lemma 4.12) is proved inside, as in the book from Lemma 4.11 applied to real and imaginary parts, with the factor 222 in place of 2\sqrt{2}2​. In Lemma 4.13 the tail is bounded by Transcendence.taylor_tail_le. The contribution of this node is the formal proof.

Preamble
import Mathlib
Formal statement
namespace Transcendence

/-- **An auxiliary function with small values, for given parameters** (Waldschmidt, *Diophantine
Approximation on Linear Algebraic Groups*, Prop. 4.10 with `T`, `X` and `ℓ` free, proved with Lemmas
4.11–4.13). Let `φ_λ` (`λ ∈ Λ`, `L = |Λ|`) be entire functions on `ℂ^ι` (`n = |ι|`) with `|φ_λ| ≤ B_λ` on the
closed polydisc of radius `R` (the sup-norm ball) and `Σ_λ B_λ ≤ C`, and let `0 < r < R`. If `T`, `X` and
`ℓ ≥ 1` are integers with `ℓ^{2Tⁿ} < (X + 1)^L`, there are integers `p_λ`, not all zero, with `|p_λ| ≤ X`,
such that `|Σ_λ p_λ φ_λ| ≤ Tⁿ · 2CX/ℓ + XC (r/R)^T / (1 - r/R)` on the closed polydisc of radius `r`. -/
theorem siegel_small_values_of_count {ι Λ : Type*} [Fintype ι] [Fintype Λ]
    (φ : Λ → (ι → ℂ) → ℂ) (hφ : ∀ l, AnalyticOnNhd ℂ (φ l) Set.univ) {r R C : ℝ}
    (hr : 0 < r) (hrR : r < R) (B : Λ → ℝ)
    (hB : ∀ l, ∀ z ∈ Metric.closedBall (0 : ι → ℂ) R, ‖φ l z‖ ≤ B l)
    (hC : 0 < C) (hBC : ∑ l, B l ≤ C) {T X ℓ : ℕ} (hℓ : 0 < ℓ)
    (hcount : ℓ ^ (2 * T ^ Fintype.card ι) < (X + 1) ^ Fintype.card Λ) :
    ∃ p : Λ → ℤ, p ≠ 0 ∧ (∀ l, |p l| ≤ X) ∧
      ∀ z ∈ Metric.closedBall (0 : ι → ℂ) r, ‖∑ l, (p l : ℂ) * φ l z‖ ≤
        (T : ℝ) ^ Fintype.card ι * (2 * (C * X / ℓ)) + X * C * (r / R) ^ T / (1 - r / R) := by
  sorry

end Transcendence
Source
M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren 326, Springer, 2000, §4.5: Lemmas 4.11–4.13 and the proof of Proposition 4.10 (pp. 132–136), with the parameters left free. Formal proof: Diaz modulus mission, 2 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