Box count along a ray: when
ProvedDiazModulus.box_ray_upper_boundcommutative-algebradiaz-modulus-leanhilbert-functiontranscendence
Let be finite types with and elements, and . Then (the left side is written in Lean as a product of constant factors over and over ).
Proof. Since , and ; take powers and regroup the factors .
Novelty. Classical; routine formalisation.
Preamble
import Mathlib
Formal statement
namespace DiazModulus
theorem box_ray_upper_bound {A₀ A₁ : Type*} [Fintype A₀] [Fintype A₁] (D₀ D₁ : ℕ) (h0 : 1 ≤ D₀) (h1 : 1 ≤ D₁) (v : ℕ) :
(∏ _h : A₀, (v * D₀ + 1)) * ∏ _i : A₁, (2 * (v * D₁) + 1)
≤ (v + 1) ^ (Fintype.card A₀ + Fintype.card A₁) * (D₀ ^ Fintype.card A₀ * (2 * D₁) ^ Fintype.card A₁) := by
sorry
end DiazModulus
Source
Elementary. The number of monomials of the box (vD₀; vD₁), 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).