Partial box count along a ray:
ProvedDiazModulus.box_ray_lower_boundcommutative-algebradiaz-modulus-leanhilbert-functiontranscendence
Let and be finite sets (of elements of arbitrary types) and . Then (the right side is written in Lean as a product of constant factors over and over ). No hypothesis is needed.
Proof. The left side is , and , ; 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).