File size: 1,538 Bytes
4a56cd6
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
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