Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Waldschmidt 2005 (Further variations), Th. 2.1, for finite-dimensional Y: if dim_Q̄ X = d > n and μ(Y, ℂⁿ) > d/(d − n), then x · y ∉ ℒ̃ for some x ∈ X, y ∈ Y

Proved
DiazModulus.fv_theorem_2_1

by carlok · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Here Q‾\overline{\mathbb Q}Q​ is the field of algebraic numbers, L\mathcal LL the set of logarithms of algebraic numbers (z∈Cz \in \mathbb Cz∈C with eze^zez algebraic), and L~\widetilde{\mathcal L}L the Q‾\overline{\mathbb Q}Q​-vector space spanned by 111 and L\mathcal LL. A subspace S⊆CdS \subseteq \mathbb C^dS⊆Cd is rational if it is spanned by vectors with algebraic coordinates.

For u,v∈Cnu, v \in \mathbb C^nu,v∈Cn, u⋅v=∑kukvku \cdot v = \sum_k u_k v_ku⋅v=∑k​uk​vk​ is the bilinear dot product (not the Hermitian one). For a Q‾\overline{\mathbb Q}Q​-subspace XXX and a C\mathbb CC-subspace WWW of Cn\mathbb C^nCn, X∩WX \cap WX∩W is a Q‾\overline{\mathbb Q}Q​-subspace; dimensions are over Q‾\overline{\mathbb Q}Q​ for Q‾\overline{\mathbb Q}Q​-subspaces and over C\mathbb CC for C\mathbb CC-subspaces.

For a finite-dimensional Q‾\overline{\mathbb Q}Q​-subspace Y⊆CnY \subseteq \mathbb C^nY⊆Cn with n≥1n \ge 1n≥1, μ(Y,Cn)\mu(Y, \mathbb C^n)μ(Y,Cn) is the minimum of (dim⁡Q‾Y−dim⁡Q‾(Y∩V))/(n−dim⁡CV)\big(\dim_{\overline{\mathbb Q}} Y - \dim_{\overline{\mathbb Q}}(Y \cap V)\big)/(n - \dim_{\mathbb C} V)(dimQ​​Y−dimQ​​(Y∩V))/(n−dimC​V) over the C\mathbb CC-subspaces V≠CnV \ne \mathbb C^nV=Cn (Further variations, p. 4); the ratio takes finitely many values, so the minimum is attained.

Let X,Y⊆CnX, Y \subseteq \mathbb C^nX,Y⊆Cn be finite-dimensional Q‾\overline{\mathbb Q}Q​-subspaces with d=dim⁡Q‾X>nd = \dim_{\overline{\mathbb Q}} X > nd=dimQ​​X>n, and assume that for every C\mathbb CC-subspace V≠CnV \ne \mathbb C^nV=Cn

d (n−dim⁡CV)<(d−n)(dim⁡Q‾Y−dim⁡Q‾(Y∩V)),d\,(n - \dim_{\mathbb C} V) < (d - n)\big(\dim_{\overline{\mathbb Q}} Y - \dim_{\overline{\mathbb Q}}(Y \cap V)\big),d(n−dimC​V)<(d−n)(dimQ​​Y−dimQ​​(Y∩V)),

that is, μ(Y,Cn)>d/(d−n)\mu(Y, \mathbb C^n) > d/(d - n)μ(Y,Cn)>d/(d−n). Then x⋅y∉L~x \cdot y \notin \widetilde{\mathcal L}x⋅y∈/L for some x∈Xx \in Xx∈X and y∈Yy \in Yy∈Y.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem fv_theorem_2_1 {n : ℕ} (X Y : Submodule (↥Qbar) (Fin n → ℂ))
    [FiniteDimensional (↥Qbar) ↥X] [FiniteDimensional (↥Qbar) ↥Y]
    (hdn : n < Module.finrank (↥Qbar) ↥X)
    (hμ : ∀ V : Submodule ℂ (Fin n → ℂ), V ≠ ⊤ →
      Module.finrank (↥Qbar) ↥X * (n - Module.finrank ℂ ↥V) <
        (Module.finrank (↥Qbar) ↥X - n) *
          (Module.finrank (↥Qbar) ↥Y - Module.finrank (↥Qbar) ↥(Y ⊓ V.restrictScalars (↥Qbar)))) :
    ∃ x ∈ X, ∃ y ∈ Y, x ⬝ᵥ y ∉ LogAlgTilde := by
  sorry

end DiazModulus
Source
M. Waldschmidt, Further variations on the six exponentials theorem, Hardy-Ramanujan J. 28 (2005), 1–9, Th. 2.1 (p. 5; proof pp. 5–6). Stated here for finite-dimensional Y, as the printed proof covers; Further variations states it for every Q̄-subspace Y. The proof replaces the reduction of Further variations (p. 5, after M. Waldschmidt, Transcendance et exponentielles en plusieurs variables, Invent. Math. 63 (1981), 97–127, Lemmes 5.1–5.2) and inequality (2.3) by one ℂ-subspace of maximal slope for X and a relative form of the semistable case, and uses Roy's Corollary 1 once (Roy 1992, Cor. 1; DALAG, Th. 12.20, p. 435; proved on the platform as DiazModulus.roy_rank_bound). Formal proof: Diaz modulus mission, 14 November 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me