math / data /lean /ComparatorChallenges /OrdinaryElliott.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
1.54 kB
import Mathlib
namespace OAI
noncomputable section
open scoped BigOperators
open Filter
namespace OrdinaryCorrelations
def OneBounded (f : β„• β†’ β„‚) : Prop := βˆ€ n, β€–f nβ€– ≀ 1
def Multiplicative (f : β„• β†’ β„‚) : Prop :=
βˆ€ m n : β„•, 0 < m β†’ 0 < n β†’ m.Coprime n β†’ f (m * n) = f m * f n
def distanceSq (f : β„• β†’ β„‚) {q : β„•} (Ο‡ : DirichletCharacter β„‚ q)
(t X : ℝ) : ℝ :=
βˆ‘ p ∈ (Finset.Icc 2 ⌊XβŒ‹β‚Š).filter Nat.Prime,
(1 - (f p * star (Ο‡ (p : ZMod q) *
Complex.exp ((t * Real.log (p : ℝ) : ℝ) * Complex.I))).re) / (p : ℝ)
def distance (f : β„• β†’ β„‚) {q : β„•} (Ο‡ : DirichletCharacter β„‚ q)
(t X : ℝ) : ℝ := Real.sqrt (distanceSq f Ο‡ t X)
def UniformlyNonpretentious (f : β„• β†’ β„‚) : Prop :=
βˆ€ (q : β„•), 0 < q β†’ βˆ€ Ο‡ : DirichletCharacter β„‚ q,
Tendsto (fun N : β„• => sInf ((fun t : ℝ => distance f Ο‡ t (N : ℝ)) ''
Set.Icc (-(N : ℝ)) (N : ℝ))) atTop atTop
def shiftAverage (f₁ fβ‚‚ : β„• β†’ β„‚) (h₁ hβ‚‚ N : β„•) : β„‚ :=
(N : β„‚)⁻¹ * βˆ‘ n ∈ Finset.Icc 1 N, f₁ (n + h₁) * fβ‚‚ (n + hβ‚‚)
theorem binary_corrected_elliott
(f₁ fβ‚‚ : β„• β†’ β„‚) (hf₁ : OneBounded f₁) (hfβ‚‚ : OneBounded fβ‚‚)
(hm₁ : Multiplicative f₁) (hmβ‚‚ : Multiplicative fβ‚‚)
(hNP : UniformlyNonpretentious f₁ ∨ UniformlyNonpretentious fβ‚‚)
(h₁ hβ‚‚ : β„•) (hne : h₁ β‰  hβ‚‚) :
Tendsto (shiftAverage f₁ fβ‚‚ h₁ hβ‚‚) atTop (nhds 0) := by
sorry
end OrdinaryCorrelations
end
end OAI