File size: 1,738 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
import OAI.NumberTheory.TwoPoint.Basic
import OAI.NumberTheory.TwoPoint.PretentiousDistance
import Mathlib.Analysis.SpecialFunctions.Pow.Real

namespace OAI

open Filter

namespace TwoPointCorrelations

/-- Theorem 1.1 (`thm:q-affine`) of the manuscript, through all real
cutoffs, with a single exponent independent of the four affine coefficients. -/
def LiouvilleLogSaving : Prop :=
  βˆƒ c : ℝ, 0 < c ∧ βˆ€ a₁ aβ‚‚ b₁ bβ‚‚ : β„•,
    0 < a₁ β†’ 0 < aβ‚‚ β†’ a₁ * bβ‚‚ β‰  aβ‚‚ * b₁ β†’
    βˆƒ C : ℝ, 0 < C ∧ βˆ€ X : ℝ, 3 ≀ X β†’
      β€–affineSum liouville liouville a₁ aβ‚‚ b₁ bβ‚‚ ⌊XβŒ‹β‚Šβ€– ≀
        C * X / Real.rpow (Real.log X) c

/-- Theorem 1.2 (`thm:elliott`): the factors are ordinary multiplicative
functions; either original factor satisfies the growing-height condition. -/
def BinaryCorrectedElliott : Prop :=
  βˆ€ f₁ fβ‚‚ : β„• β†’ β„‚, Multiplicative f₁ β†’ Multiplicative fβ‚‚ β†’
    OneBounded f₁ β†’ OneBounded fβ‚‚ β†’
    (UniformlyNonpretentious f₁ ∨ UniformlyNonpretentious fβ‚‚) β†’
    βˆ€ h₁ hβ‚‚ : β„•, h₁ β‰  hβ‚‚ β†’
      Tendsto (fun N : β„• => correlationSum f₁ fβ‚‚ h₁ hβ‚‚ N / (N : β„‚)) atTop (nhds 0)

/-- Corollary 1.3 (`cor:affine`), including coefficients sharing prime factors. -/
def AffineCorrectedElliott : Prop :=
  βˆ€ f₁ fβ‚‚ : β„• β†’ β„‚, Multiplicative f₁ β†’ Multiplicative fβ‚‚ β†’
    OneBounded f₁ β†’ OneBounded fβ‚‚ β†’
    (UniformlyNonpretentious f₁ ∨ UniformlyNonpretentious fβ‚‚) β†’
    βˆ€ a₁ aβ‚‚ b₁ bβ‚‚ : β„•, 0 < a₁ β†’ 0 < aβ‚‚ β†’ a₁ * bβ‚‚ β‰  aβ‚‚ * b₁ β†’
      Tendsto (fun N : β„• => affineSum f₁ fβ‚‚ a₁ aβ‚‚ b₁ bβ‚‚ N / (N : β„‚)) atTop (nhds 0)

end TwoPointCorrelations

end OAI