Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Roy's Theorem 4, semistable case, from the multiplicity estimate: if ddim⁡(U∩S)≤ndim⁡Sd \dim(U \cap S) \le n \dim Sddim(U∩S)≤ndimS for all rational SSS and n=dim⁡U<dn = \dim U < dn=dimU<d, then (d−n) ℓ≤dn(d - n)\,\ell \le dn(d−n)ℓ≤dn

Proved
DiazModulus.roy_semistable_node

by carlok · Nov 13, 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.

Assume the multiplicity estimate hME, and assume the conclusion of DiazModulus.roy_slope_bound in every dimension t<dt < dt<d (hypothesis hIH). Let U⊆CdU \subseteq \mathbb C^dU⊆Cd with n=dim⁡U<dn = \dim U < dn=dimU<d and ddim⁡(U∩S)≤ndim⁡Sd \dim(U \cap S) \le n \dim Sddim(U∩S)≤ndimS for every rational S⊆CdS \subseteq \mathbb C^dS⊆Cd, and z1,…,zℓ∈U∩L~dz_1, \dots, z_\ell \in U \cap \widetilde{\mathcal L}^dz1​,…,zℓ​∈U∩Ld are linearly independent over Q‾\overline{\mathbb Q}Q​. Then (d−n) ℓ≤d n(d - n)\,\ell \le d\,n(d−n)ℓ≤dn.

The multiplicity estimate is the explicit hypothesis hME : MultiplicityEstimateElem (proved on the platform as DiazModulus.multiplicityEstimateElem).

Preamble
import Definitions.Def_DiazModulus
import Definitions.Def_MultiplicityEstimateElem
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem roy_semistable_node (hME : MultiplicityEstimateElem) {d : ℕ}
    (hIH : ∀ t < d, ∀ (U' : Submodule ℂ (Fin t → ℂ)) (a b ℓ' : ℕ) (z' : Fin ℓ' → Fin t → ℂ),
        a < b → (∀ S : Submodule ℂ (Fin t → ℂ), Submodule.span ℂ {v : Fin t → ℂ | v ∈ S ∧ ∀ i, v i ∈ Qbar} = S →
          b * Module.finrank ℂ ↥(U' ⊓ S) ≤ a * Module.finrank ℂ ↥(S)) →
        (∀ i, z' i ∈ U') → (∀ i j, z' i j ∈ LogAlgTilde) → LinearIndependent (↥Qbar) z' →
        (b - a) * ℓ' ≤ b * Module.finrank ℂ ↥(U'))
    (U : Submodule ℂ (Fin d → ℂ)) (hUd : Module.finrank ℂ ↥(U) < d)
    (hss : ∀ S : Submodule ℂ (Fin d → ℂ), Submodule.span ℂ {v : Fin d → ℂ | v ∈ S ∧ ∀ i, v i ∈ Qbar} = S →
      d * Module.finrank ℂ ↥(U ⊓ S) ≤ Module.finrank ℂ ↥(U) * Module.finrank ℂ ↥(S))
    {ℓ : ℕ} (z : Fin ℓ → Fin d → ℂ) (hzU : ∀ i, z i ∈ U) (hz : ∀ i j, z i j ∈ LogAlgTilde)
    (hzind : LinearIndependent (↥Qbar) z) :
    (d - Module.finrank ℂ ↥(U)) * ℓ ≤ d * Module.finrank ℂ ↥(U) := by
  sorry

end DiazModulus
Source
D. Roy, Matrices whose coefficients are linear forms in logarithms, J. Number Theory 41 (1992), 22–47, Th. 4, first case; M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, Prop. 11.19 (§11.6.2), first case, through M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, Th. 11.21 (§11.7.1), as DiazModulus.linear_subgroup_transcendence, applied once. The route is the Diaz modulus mission's: an induction on d that splits along a rational subspace of maximal slope and applies DALAG Th. 11.21 once at each semistable step, counting the periods through one extra rational subspace; DALAG and Roy argue instead through Th. 11.5 (3′) and Lemma 11.24, respectively Roy's Th. 2. Formal proof: Diaz modulus mission, 13 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