math / data /lean /ComparatorChallenges /PattersonFirstMoment.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.25 kB
import Mathlib
namespace OAI
/-! Primary Eisenstein elements, residue characters, Gauss sums and first-moment target definitions. -/
section
noncomputable section
open scoped BigOperators
open Module
attribute [local instance] Classical.propDecidable
namespace CubicFirstMoment
def omega : β„‚ := Complex.exp (2 * (Real.pi : β„‚) * Complex.I / 3)
def eisensteinRing : Subalgebra β„€ β„‚ := Algebra.adjoin β„€ {omega}
abbrev Eisenstein := eisensteinRing
def omegaE : Eisenstein :=
⟨omega, Algebra.subset_adjoin (Set.mem_singleton omega)⟩
def norm (a : Eisenstein) : ℝ := Complex.normSq (a : β„‚)
def normNat (a : Eisenstein) : β„• := ⌊norm aβŒ‹β‚Š
def primary (a : Eisenstein) : Prop := (3 : Eisenstein) ∣ a - 1
def primaryPrime (a : Eisenstein) : Prop := primary a ∧ Prime a
def modulus (a : Eisenstein) : Ideal Eisenstein := Ideal.span {a}
abbrev Residues (a : Eisenstein) := Eisenstein β§Έ modulus a
def residueRepresentative (a : Eisenstein) (v : Residues a) : Eisenstein :=
Classical.choose (Ideal.Quotient.mk_surjective v)
def cubicSymbolAtPrime (p v : Eisenstein) : β„‚ :=
if IsUnit (Ideal.Quotient.mk (modulus p) v) then
if h : βˆƒ j : Fin 3,
Ideal.Quotient.mk (modulus p) (v ^ ((normNat p - 1) / 3)) =
Ideal.Quotient.mk (modulus p) (omegaE ^ (j : β„•)) then
omega ^ ((Classical.choose h : Fin 3) : β„•)
else 0
else 0
def additivePhase (p v : Eisenstein) : β„‚ :=
let z : β„‚ := (v : β„‚) / (p : β„‚)
Complex.exp (2 * (Real.pi : β„‚) * Complex.I * (z + star z))
def gaussAtPrime (p : Eisenstein) : β„‚ :=
(Real.sqrt (norm p) : β„‚)⁻¹ *
βˆ‘' v : Residues p,
cubicSymbolAtPrime p (residueRepresentative p v) *
additivePhase p (residueRepresentative p v)
def cStar : ℝ := (2 * Real.pi) ^ (2 / 3 : ℝ) / (3 * Real.Gamma (2 / 3))
def primeCutoffSum (f : Eisenstein β†’ β„‚) (X : ℝ) : β„‚ :=
βˆ‘' p : Eisenstein, if primaryPrime p ∧ norm p ≀ X then f p else 0
def firstMomentScale (X : ℝ) : ℝ := X ^ (5 / 6 : ℝ) / Real.log X
def FirstMomentStatement : Prop :=
Asymptotics.IsLittleO Filter.atTop
(fun X : ℝ => primeCutoffSum gaussAtPrime X -
(((6 / 5 : ℝ) * cStar * firstMomentScale X : ℝ) : β„‚))
firstMomentScale
def theta (β„“ : β„€) (a : Eisenstein) : β„‚ := ((a : β„‚) / (β€–(a : β„‚)β€– : β„‚)) ^ β„“
def AngularComparisonStatement : Prop :=
βˆ€ β„“ : β„€, Asymptotics.IsLittleO Filter.atTop
(primeCutoffSum (fun p => theta β„“ p *
(gaussAtPrime p - ((cStar * norm p ^ (-1 / 6 : ℝ) : ℝ) : β„‚))))
firstMomentScale
def AngularCancellationStatement : Prop :=
βˆ€ β„“ : β„€, β„“ β‰  0 β†’ Asymptotics.IsLittleO Filter.atTop
(primeCutoffSum (fun p => theta β„“ p * gaussAtPrime p)) firstMomentScale
/-- The sharp first moment over all primary Eisenstein primes. -/
theorem patterson_firstMoment : FirstMomentStatement := by
sorry
/-- Model comparison in every fixed integer angular mode. -/
theorem patterson_angularComparison : AngularComparisonStatement := by
sorry
/-- Cancellation at the first-moment scale for each nonzero angular mode. -/
theorem patterson_angularCancellation : AngularCancellationStatement := by
sorry
end CubicFirstMoment
end
end
end OAI