Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Partial box count along a ray: u∣H∣+∣J∣D0∣H∣D1∣J∣≤(uD0+1)∣H∣(2uD1+1)∣J∣u^{|H|+|J|} D_0^{|H|} D_1^{|J|} \le (uD_0+1)^{|H|} (2uD_1+1)^{|J|}u∣H∣+∣J∣D0∣H∣​D1∣J∣​≤(uD0​+1)∣H∣(2uD1​+1)∣J∣

Proved
DiazModulus.box_ray_lower_bound

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

commutative-algebradiaz-modulus-leanhilbert-functiontranscendence

Let HHH and JJJ be finite sets (of elements of arbitrary types) and D0,D1,u∈ND_0, D_1, u \in \mathbb{N}D0​,D1​,u∈N. Then u∣H∣+∣J∣D0∣H∣D1∣J∣≤(uD0+1)∣H∣(2uD1+1)∣J∣u^{|H|+|J|} D_0^{|H|} D_1^{|J|} \le (uD_0 + 1)^{|H|} (2uD_1 + 1)^{|J|}u∣H∣+∣J∣D0∣H∣​D1∣J∣​≤(uD0​+1)∣H∣(2uD1​+1)∣J∣ (the right side is written in Lean as a product of constant factors over HHH and over JJJ). No hypothesis is needed.

Proof. The left side is (uD0)∣H∣(uD1)∣J∣(uD_0)^{|H|} (uD_1)^{|J|}(uD0​)∣H∣(uD1​)∣J∣, and uD0≤uD0+1uD_0 \le uD_0 + 1uD0​≤uD0​+1, uD1≤2uD1+1uD_1 \le 2uD_1 + 1uD1​≤2uD1​+1; take powers and multiply.

Novelty. Classical; routine formalisation.

Preamble
import Mathlib
Formal statement
namespace DiazModulus

theorem box_ray_lower_bound {A₀ A₁ : Type*} (D₀ D₁ : ℕ) (H : Finset A₀) (J : Finset A₁) (u : ℕ) :
    u ^ (H.card + J.card) * (D₀ ^ H.card * D₁ ^ J.card)
      ≤ (∏ _h ∈ H, (u * D₀ + 1)) * ∏ _j ∈ J, (2 * (u * D₁) + 1) := by
  sorry

end DiazModulus
Source
Elementary. A partial count of the box (uD₀; uD₁), compare M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, Prop. 5.7 (§5.3.1, p. 159; Chapter 5 is by D. Roy). C1.1 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