Height vocabulary and the six-contact estimate (Theorem 4.1)
DefinitionZInQHeightThis bundle defines the height vocabulary used by the six-contact estimate and the estimate itself (hypothesis , Theorem 4.1 of the manuscript). The logarithmic height is for in lowest terms. The contact set is . For a finite set of primes , is the product of the primes for which some () has positive, odd -adic valuation. The constants , , , , , , and are fixed. The six-contact estimate asserts for every admissible and every .
import Mathlib
namespace ZInQ
open scoped BigOperators
/-- The logarithmic height h(a/b) = log max(|a|, b) of a rational in lowest terms. -/
noncomputable def ratHeight (u : ℚ) : ℝ :=
Real.log (max |(u.num : ℝ)| (u.den : ℝ))
/-- The six contact values. -/
def contactSet : Finset ℚ := {0, -15, -20, -24, -30, -60}
open Classical in
/-- M_S(u): the product of primes p not in S at which some u - c has positive odd p-adic valuation. -/
noncomputable def contactSupport (S : Finset ℕ) (u : ℚ) : ℕ :=
∏ p ∈ (∏ c ∈ contactSet, (u - c).num.natAbs).primeFactors with
p ∉ S ∧ ∃ c ∈ contactSet, 0 < padicValRat p (u - c) ∧ Odd (padicValRat p (u - c)),
p
noncomputable def heightF0 : ℕ := Nat.factorial 324
noncomputable def heightD : ℕ := heightF0 * 3 ^ (256 * heightF0 ^ 4)
def heightG0 : ℕ := 116064000000
noncomputable def heightE0 : ℕ := 10 * (heightD * heightG0) ^ 2
noncomputable def heightBcm : ℕ := heightD ^ 2 * 3 ^ (21000 * heightD ^ 2) + 1
noncomputable def heightCcm : ℕ := 2 * heightBcm + 4096 * (1028 + 5 * heightD + 84000 * heightD ^ 2)
noncomputable def heightQ (R : ℝ) : ℝ := R ^ (R * heightE0)
noncomputable def heightH6 (R : ℝ) : ℝ :=
2 * 10 ^ 13 * max 1 (max (heightCcm : ℝ) (heightQ R ^ 17))
/-- Hypothesis H (Theorem 4.1, the six-contact estimate). -/
def SixContactEstimate : Prop :=
∀ S : Finset ℕ, (∀ p ∈ S, p.Prime) → (∀ p : ℕ, p.Prime → p ≤ 324 → p ∈ S) →
∀ R : ℝ, (heightD : ℝ) ≤ R → (∀ p ∈ S, (p : ℝ) ≤ R) → (10 : ℝ) ^ 12 ≤ R →
∀ u : ℚ, u ∉ contactSet → ratHeight u ≤ heightH6 R * (contactSupport S u : ℝ) ^ 24
end ZInQRead-back
What the Lean code literally says, in plain math · glm
The bundle defines the following. as a real number, where and are the numerator and denominator of in lowest terms. is the finite set . is the product of those primes dividing such that and there exists with and odd; it is a natural number. The constants are , , , , , , (real exponentiation), and . The proposition asserts: for every finite set of natural numbers such that every element of is prime and every prime lies in , and for every real with , every satisfying , and , and for every rational , one has .