math / data /lean /OAI /NumberTheory /TwoPoint /PublishedInputs.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
7.09 kB
import OAI.NumberTheory.TwoPoint.Basic
import OAI.NumberTheory.TwoPoint.PretentiousDistance
import Mathlib.MeasureTheory.Integral.IntervalIntegral.Basic
import Mathlib.NumberTheory.DirichletCharacter.Orthogonality
namespace OAI
/-!
# Short-interval estimates for multiplicative functions
The estimates specialize K. MatomΓ€ki, M. RadziwiΕ‚Ε‚ and T. Tao,
*An averaged form of Chowla's conjecture*, Algebra & Number Theory 9 (2015),
2167–2196, corrected arXiv:1503.05121v3 (1 March 2022), Theorems 1.3 and 1.7;
DOI 10.2140/ant.2015.9.2167.
The frequency is fixed during the integral. A uniform lower bound on the
squared pretentious distances replaces the infimum in Theorem 1.7.
-/
namespace TwoPointCorrelations
open scoped BigOperators
open MeasureTheory
/-- The usual additive character `e(Ξ±n) = exp(2Ο€iΞ±n)`. -/
noncomputable def additiveCharacter (Ξ± : ℝ) (n : β„•) : β„‚ :=
Complex.exp (((2 * Real.pi * Ξ± * (n : ℝ) : ℝ) : β„‚) * Complex.I)
/-- Sum over the integers `y < n ≀ y+H` (for the nonnegative starting points
used in the integral). -/
noncomputable def shortExponentialSum (b : β„• β†’ β„‚) (H : β„•) (Ξ± y : ℝ) : β„‚ :=
βˆ‘ n ∈ Finset.Icc (Nat.floor y + 1) (Nat.floor (y + (H : ℝ))),
b n * additiveCharacter Ξ± n
/-- The mean over interval origins, with a single fixed frequency. -/
noncomputable def shortExponentialIntegral (b : β„• β†’ β„‚) (X H : β„•) (Ξ± : ℝ) : ℝ :=
∫ y in (0 : ℝ)..(X : ℝ), β€–shortExponentialSum b H Ξ± yβ€–
/-- The character-modulus cutoff in corrected MRT Theorem 1.7. -/
noncomputable def mrtModulusCutoff (X H : β„•) : ℝ :=
min ((Real.log (X : ℝ)) ^ (1 / (125 : ℝ))) ((Real.log (H : ℝ)) ^ (5 : β„•))
/-- The error shared by MRT Theorems 1.3 and 1.7. -/
noncomputable def mrtShortError (X H : β„•) : ℝ :=
Real.log (Real.log (H : ℝ)) / Real.log (H : ℝ) +
(Real.log (X : ℝ)) ^ (-1 / (700 : ℝ))
/-- The exact range of lower bounds required by corrected MRT Theorem 1.7. -/
def MRTDistanceLowerBound (b : β„• β†’ β„‚) (X H : β„•) (M : ℝ) : Prop :=
βˆ€ (q : β„•), 0 < q β†’ (q : ℝ) ≀ mrtModulusCutoff X H β†’
βˆ€ (Ο‡ : DirichletCharacter β„‚ q) (t : ℝ), |t| ≀ (X : ℝ) β†’
M ≀ squaredDistance b (characterTwist Ο‡ t) X
/-- Natural-cutoff specialization of corrected MRT Theorem 1.7, with an
explicit lower bound `M` in place of the infimum of squared distances. -/
def MRTShortExponentialInput : Prop :=
βˆƒ C : ℝ, 0 < C ∧ βˆ€ (X H : β„•), 10 ≀ H β†’ H ≀ X β†’
βˆ€ (b : β„• β†’ β„‚), Multiplicative b β†’ OneBounded b β†’
βˆ€ M : ℝ, MRTDistanceLowerBound b X H M β†’ βˆ€ Ξ± : ℝ,
shortExponentialIntegral b X H Ξ± ≀
C * (H : ℝ) * (X : ℝ) * (Real.exp (-M / 20) + mrtShortError X H)
/-- Natural-cutoff Liouville specialization of MRT Theorem 1.3. Endpoint
conventions differ only at a measure-zero set of interval origins. -/
def MRTLiouvilleShortInput : Prop :=
βˆƒ C : ℝ, 0 < C ∧ βˆ€ (X H : β„•), 10 ≀ H β†’ H ≀ X β†’ βˆ€ Ξ± : ℝ,
shortExponentialIntegral liouville X H Ξ± ≀
C * (H : ℝ) * (X : ℝ) * mrtShortError X H
/-- At a fixed modulus cutoff, uniform nonpretentiousness gives one bound
simultaneously for every character and every permitted finite-prime change. -/
theorem UniformlyNonpretentious.bounded_moduli {f : β„• β†’ β„‚}
(hfnp : UniformlyNonpretentious f) (hf : OneBounded f)
(P : Finset β„•) (Q : β„•) (K : ℝ) :
βˆ€αΆ  N : β„• in Filter.atTop, βˆ€ q : β„•, 0 < q β†’ q ≀ Q β†’
βˆ€ (Ο‡ : DirichletCharacter β„‚ q) (b : β„• β†’ β„‚), OneBounded b β†’
(βˆ€ p, Nat.Prime p β†’ p βˆ‰ P β†’ b p = f p) β†’
βˆ€ t : ℝ, |t| ≀ (N : ℝ) β†’ K ≀ squaredDistance b (characterTwist Ο‡ t) N := by
classical
let ΞΉ := (Ξ£ q : Fin Q, DirichletCharacter β„‚ (q.val + 1))
have hfamily := hfnp.finite_family (ΞΉ := ΞΉ) hf P
(fun i => i.1.val + 1) (fun _ => Nat.succ_pos _) (fun i => i.2) K
filter_upwards [hfamily] with N hN
intro q hq hqQ Ο‡ b hb heq t ht
cases q with
| zero => omega
| succ q =>
exact hN ⟨⟨q, Nat.lt_of_succ_le hqQ⟩, Ο‡βŸ© b hb heq t ht
/-- Fixing the short interval length leaves only finitely many moduli in the
published theorem. Thus the entire MRT distance hypothesis holds uniformly. -/
theorem UniformlyNonpretentious.eventually_mrt_lower_bound {f : β„• β†’ β„‚}
(hfnp : UniformlyNonpretentious f) (hf : OneBounded f)
(P : Finset β„•) (H : β„•) (M : ℝ) :
βˆ€αΆ  N : β„• in Filter.atTop, βˆ€ b : β„• β†’ β„‚, OneBounded b β†’
(βˆ€ p, Nat.Prime p β†’ p βˆ‰ P β†’ b p = f p) β†’ MRTDistanceLowerBound b N H M := by
have hfinite := hfnp.bounded_moduli hf P (Nat.ceil ((Real.log (H : ℝ)) ^ (5 : β„•))) M
filter_upwards [hfinite] with N hN
intro b hb heq q hq hqCutoff Ο‡ t ht
have hqQ : q ≀ Nat.ceil ((Real.log (H : ℝ)) ^ (5 : β„•)) := by
exact_mod_cast hqCutoff.trans ((min_le_right _ _).trans (Nat.le_ceil _))
exact hN q hq hqQ Ο‡ b hb heq t ht
/-- The published short-sum estimate immediately gives a bound on the
normalized mean, without moving a frequency supremum into the integral. -/
theorem MRTShortExponentialInput.normalized (hMRT : MRTShortExponentialInput) :
βˆƒ C : ℝ, 0 < C ∧ βˆ€ (X H : β„•), 10 ≀ H β†’ H ≀ X β†’
βˆ€ (b : β„• β†’ β„‚), Multiplicative b β†’ OneBounded b β†’
βˆ€ M : ℝ, MRTDistanceLowerBound b X H M β†’ βˆ€ Ξ± : ℝ,
shortExponentialIntegral b X H Ξ± / ((H : ℝ) * (X : ℝ)) ≀
C * (Real.exp (-M / 20) + mrtShortError X H) := by
obtain ⟨C, hC, hbound⟩ := hMRT
refine ⟨C, hC, ?_⟩
intro X H hH hX b hmult hbounded M hM Ξ±
have hHp : (0 : ℝ) < H := by exact_mod_cast (by omega : 0 < H)
have hXp : (0 : ℝ) < X := by exact_mod_cast (by omega : 0 < X)
apply (div_le_iffβ‚€ (mul_pos hHp hXp)).mpr
convert hbound X H hH hX b hmult hbounded M hM Ξ± using 1
ring
/-- A genuine conditional consequence of published MRT Theorem 1.7:
finite local modifications preserve the uniform short-sum estimate at every
fixed short-interval length. The estimate is uniform over all modifications
and frequencies, with the frequency still outside the integral. -/
theorem MRTShortExponentialInput.finite_prime_changes
(hMRT : MRTShortExponentialInput) {f : β„• β†’ β„‚}
(hfnp : UniformlyNonpretentious f) (hf : OneBounded f) (P : Finset β„•) :
βˆƒ C : ℝ, 0 < C ∧ βˆ€ (H : β„•), 10 ≀ H β†’ βˆ€ M : ℝ,
βˆ€αΆ  N : β„• in Filter.atTop, βˆ€ b : β„• β†’ β„‚,
Multiplicative b β†’ OneBounded b β†’
(βˆ€ p, Nat.Prime p β†’ p βˆ‰ P β†’ b p = f p) β†’ βˆ€ Ξ± : ℝ,
shortExponentialIntegral b N H Ξ± / ((H : ℝ) * (N : ℝ)) ≀
C * (Real.exp (-M / 20) + mrtShortError N H) := by
obtain ⟨C, hC, hbound⟩ := hMRT.normalized
refine ⟨C, hC, ?_⟩
intro H hH M
filter_upwards [hfnp.eventually_mrt_lower_bound hf P H M,
Filter.eventually_ge_atTop H] with N hN hHN
intro b hmult hb heq Ξ±
exact hbound N H hH hHN b hmult hb M (hN b hb heq) Ξ±
end TwoPointCorrelations
end OAI