Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Θₙ(L), the least total degree of L distinct multi-indices in ℕⁿ, is at least A·(L − Aⁿ) for every A

Proved
DiazModulus.thetaN_ge_mul_sub

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

diaz-modulus-leannumber-theorytranscendence

Let n≥1n \geq 1n≥1 and L,A∈NL, A \in \mathbb{N}L,A∈N. Then A (L−An)≤Θn(L)A\,(L - A^n) \leq \Theta_n(L)A(L−An)≤Θn​(L), where Θn(L)\Theta_n(L)Θn​(L) is the least value of ∑l∣κ′(l)∣\sum_l |\kappa'(l)|∑l​∣κ′(l)∣ over the injective maps κ′:{1,…,L}→Nn\kappa' : \{1, \dots, L\} \to \mathbb{N}^nκ′:{1,…,L}→Nn, with ∣⋅∣|\cdot|∣⋅∣ the total degree of a multi-index (000 if there is no such map), and L−AnL - A^nL−An is truncated at 000.

Proof. For n≥1n \geq 1n≥1 the map l↦(l,…,l)l \mapsto (l, \dots, l)l↦(l,…,l) is injective, so it suffices to bound every admissible sum from below. Fix an injective κ′\kappa'κ′. At most AnA^nAn indices lll have κ′(l)\kappa'(l)κ′(l) in the box {0,…,A−1}n\{0, \dots, A - 1\}^n{0,…,A−1}n, as κ′\kappa'κ′ maps them injectively into it; every other lll has a coordinate ≥A\geq A≥A, hence degree ≥A\geq A≥A. So the total degree is at least AAA times the number of indices outside the box, which is at least L−AnL - A^nL−An.

Novelty. Not found in the sources read in this form; routine. An elementary lower bound for Θn(L)\Theta_n(L)Θn​(L) (DALAG §6.2.2), enough here in place of the sharper DALAG Lemma 6.5 (§6.2.3).

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem thetaN_ge_mul_sub (n L A : ℕ) (hn : 1 ≤ n) :
    A * (L - A ^ n) ≤ sInf {S | ∃ κ' : Fin (L) → (Fin n → ℕ), Function.Injective κ' ∧ S = ∑ l, ∑ i, κ' l i} := by
  sorry

end DiazModulus
Source
The function Θₙ(L) is that of M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, §6.2.2; compare Lemma 6.5 (§6.2.3) there. Not found in the sources read in this form; routine. C1.4 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 29 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me