math / data /lean /ComparatorChallenges /TriangularGaussian.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
9.66 kB
import Mathlib
namespace OAI
/-!
# Sharp Gaussian minorants with atomic interpolation
The sharp Gaussian minorants of the atomic certificate for triangular-lattice
universal optimality, including the construction for parameters at least one.
-/
noncomputable section
open scoped BigOperators FourierTransform SchwartzMap
open Complex Polynomial
namespace AtomicTriangular
abbrev Plane := EuclideanSpace ℝ (Fin 2)
def b : ℝ := Real.sqrt 3 / 2
def triangularPoint (jk : β„€ Γ— β„€) : Plane :=
(Real.sqrt b)⁻¹ β€’
(EuclideanSpace.single 0 ((jk.1 : ℝ) + (jk.2 : ℝ) / 2) +
EuclideanSpace.single 1 ((jk.2 : ℝ) * b))
def A : Set Plane := Set.range triangularPoint
def dualA : Set Plane := {w | βˆ€ a ∈ A, βˆƒ n : β„€, inner ℝ a w = (n : ℝ)}
def gaussian (Ξ± : ℝ) (x : Plane) : ℝ := Real.exp (-Real.pi * Ξ± * β€–xβ€– ^ 2)
def Radial (f : Plane β†’ ℝ) : Prop := βˆ€ x y, β€–xβ€– = β€–yβ€– β†’ f x = f y
def realFourier (f : Plane β†’ ℝ) (w : Plane) : β„‚ := 𝓕 (fun x => (f x : β„‚)) w
end AtomicTriangular
namespace AtomicTriangular.Construction
def b : ℝ := Real.sqrt 3 / 2
def h : ℝ := 17 / 50
def H : ℝ := 27 / 50
def eta : ℝ := 1 / 5
def kappa : ℝ := Real.pi / 36
def residues : Finset β„€ := {0,1,3,4,7,9,12,13,16,19,21,25,27,28,31}
def residue (a : Fin 15) : β„€ := ![0,1,3,4,7,9,12,13,16,19,21,25,27,28,31] a
def Node : Type := {n : β„€ // 0 < n ∧ n % 36 ∈ residues}
def FiniteNodes : Finset β„€ := {1,3,4,7,9,12,13,16,19,21}
def sineFactor (a : Fin 15) (s : β„‚) : β„‚ :=
2 * Complex.sin ((kappa : β„‚) * (s - (residue a : β„‚)))
def P (s : β„‚) : β„‚ := ∏ a : Fin 15, (sineFactor a s)^2
def dBasis (n : Node) : β„‚ β†’ β„‚ := dslope P (n.val : β„‚)
def cBasis (n : Node) : β„‚ β†’ β„‚ := dslope (dBasis n) (n.val : β„‚)
def finiteC (a : Fin 15) (s : β„‚) : β„‚ :=
4 * (kappa : β„‚)^2 * ∏ r ∈ Finset.univ.erase a, (sineFactor r s)^2
def finiteD (a : Fin 15) (s : β„‚) : β„‚ :=
2 * (kappa : β„‚) * sineFactor a s *
Complex.cos ((kappa : β„‚) * (s - (residue a : β„‚))) *
∏ r ∈ Finset.univ.erase a, (sineFactor r s)^2
def phase (s : β„‚) : β„‚ := Complex.exp ((Real.pi : β„‚) * Complex.I * s / 18)
def atomFactor (a : Fin 15) : Polynomial β„‚ :=
-C (phase (residue a)) + C 2 * X - C (phase (-residue a)) * X^2
def atomPolynomial : Polynomial β„‚ := ∏ a : Fin 15, atomFactor a
def cAtomPolynomial (a : Fin 15) : Polynomial β„‚ :=
C (4 * (kappa : β„‚)^2) * ∏ r ∈ Finset.univ.erase a, atomFactor r
def dAtomPolynomial (a : Fin 15) : Polynomial β„‚ :=
C (Complex.I * (kappa : β„‚)) *
(C (phase (residue a)) - C (phase (-residue a)) * X^2) *
∏ r ∈ Finset.univ.erase a, atomFactor r
def fourierCoeff (j : Fin 31) : β„‚ := atomPolynomial.coeff j.val
def frequency (j : Fin 31) : ℝ := ((j.val : ℝ)-15)/18
def waveDerivative (k : β„•) (s : β„‚) : β„‚ :=
βˆ‘ j : Fin 31, fourierCoeff j * (I*Real.pi*frequency j)^k *
exp (I*Real.pi*frequency j*s)
def Q (n : β„€) : ℝ := (waveDerivative 2 n).re / 2
def D (n : β„€) : ℝ := (waveDerivative 3 n).re / (6 * Q n)
end AtomicTriangular.Construction
namespace AtomicTriangular.FiniteCertificate
open Construction
def cShiftPolynomial (a : Fin 15) : Polynomial β„‚ := X * cAtomPolynomial a
def cCoefficient (a : Fin 15) (j : Fin 31) : β„‚ := (cShiftPolynomial a).coeff j.val
def dCoefficient (a : Fin 15) (j : Fin 31) : β„‚ := (dAtomPolynomial a).coeff j.val
end AtomicTriangular.FiniteCertificate
namespace AtomicTriangular.Construction
abbrev Plane := EuclideanSpace ℝ (Fin 2)
def radial (x : Plane) : ℝ := b*β€–xβ€–^2
def waveDen (k t : ℝ) : ℝ := k^2+t^2
def Xwave (k t : ℝ) : ℝ := (4/3)/waveDen k t
def lambda (k t : ℝ) : β„‚ := ((k:β„‚)+I*t)/(b*waveDen k t : ℝ)
def zeta (k v t : ℝ) : β„‚ := -(t:β„‚)*(Xwave k t:β„‚)+I*(k*Xwave k t-v:ℝ)
def transformedWave (k v t : ℝ) (s : β„‚) : β„‚ := lambda k t*exp (I*Real.pi*zeta k v t*s)
def finiteColumn (col : Fin 23) (j : Fin 31) : β„‚ :=
if hc : col.val<22 then
if col.val%2=0 then FiniteCertificate.cCoefficient ⟨col.val/2,by omega⟩ j
else FiniteCertificate.dCoefficient ⟨col.val/2,by omega⟩ j
else fourierCoeff j
def finiteNode (n : Fin 10) : β„€ := residue ⟨n.val+1,by omega⟩
def jetMultiplier (k v : ℝ) (n : β„€) (d : Fin 2) (t : ℝ) : β„‚ :=
(Q n:β„‚)⁻¹*transformedWave k v t n *
(if d.val=0 then -1 else (D n:β„‚)-I*Real.pi*zeta k v t)
def jet (k v : ℝ) (n : β„€) (d : Fin 2) (S : Fin 31 β†’ β„‚) : ℝ :=
(βˆ‘ j : Fin 31, jetMultiplier k v n d (frequency j)*S j).re
def fullJetMatrix : Matrix (Fin 20) (Fin 23) ℝ := fun i col =>
jet (if col.val=22 then h else H) H
(finiteNode ⟨i.val/2,by omega⟩) ⟨i.val%2,by omega⟩ (finiteColumn col)
def R : Matrix (Fin 20) (Fin 20) ℝ := fun i j => fullJetMatrix i ⟨j.val+2,by omega⟩
def R0 : Matrix (Fin 20) (Fin 3) ℝ := fun i j =>
fullJetMatrix i (if j.val<2 then ⟨j.val,by omega⟩ else 22)
abbrev TailNode := {n : Node // n.val βˆ‰ FiniteNodes}
structure InputCoefficients where
C : ℝ
finiteC : Fin 11 β†’ ℝ
finiteD : Fin 11 β†’ ℝ
tailC : TailNode β†’ ℝ
tailD : TailNode β†’ ℝ
summable : Summable (fun n => |tailC n|+|tailD n|)
def tailInput (a : InputCoefficients) (s : β„‚) : β„‚ :=
(a.C:β„‚)*P s + βˆ‘' n : TailNode, ((a.tailC n:β„‚)*cBasis n.val s+(a.tailD n:β„‚)*dBasis n.val s)
def finiteInput (a : InputCoefficients) (s : β„‚) : β„‚ :=
βˆ‘ j : Fin 11, ((a.finiteC j:β„‚)*finiteC ⟨j.val,by omega⟩ s +
(a.finiteD j:β„‚)*finiteD ⟨j.val,by omega⟩ s)
def inputComplex (a : InputCoefficients) (x : Plane) : β„‚ :=
exp (-(Real.pi:β„‚)*h*(radial x:β„‚))*tailInput a (radial x) +
exp (-(Real.pi:β„‚)*H*(radial x:β„‚))*finiteInput a (radial x)
def targetCoefficient (n : Fin 10) : ℝ := Q 1 / Q (finiteNode n) * Real.exp (Real.pi*eta*(finiteNode n))
def Yf : Matrix (Fin 20) (Fin 8) ℝ := fun i j =>
if i.val<8 then
targetCoefficient ⟨i.val/2,by omega⟩ *
(if i.val%2=0 then (if j.val=i.val then 1 else 0)
else (if j.val=i.val then -1 else if j.val=i.val-1 then Real.pi*eta-D (finiteNode ⟨i.val/2,by omega⟩) else 0))
else 0
def gamma (side : Fin 2) : Matrix (Fin 3) (Fin 8) ℝ := fun i j =>
if j.val=1 then (if i.val=0 then 11/25 else if i.val=1 then 0 else if side.val=0 then -(3/500) else 3/500) else 0
def Uplus : Matrix (Fin 20) (Fin 8) ℝ :=
(1-R)⁻¹*(Yf+R0*(gamma 1+gamma 0))
def Uminus : Matrix (Fin 20) (Fin 8) ℝ :=
(1+R)⁻¹*(Yf+R0*(gamma 1-gamma 0))
def finiteSolution (side : Fin 2) : Matrix (Fin 20) (Fin 8) ℝ :=
if side.val=0 then (1/2:ℝ) β€’ (Uplus+Uminus) else (1/2:ℝ) β€’ (Uplus-Uminus)
def Acoefficient (side : Fin 2) : Matrix (Fin 23) (Fin 8) ℝ := fun i j =>
if hi : i.val<2 then gamma side ⟨i.val,by omega⟩ j
else if h22 : i.val=22 then gamma side 2 j
else finiteSolution side ⟨i.val-2,by omega⟩ j
def gaussianZ (Ξ± : ℝ) : ℝ := 1/(Real.pi*(Ξ±/b-h))
def actualParameter (z : ℝ) : Fin 8 β†’ ℝ :=
![z,1,z*Real.exp (-2/z),Real.exp (-2/z),z*Real.exp (-3/z),Real.exp (-3/z),
z*Real.exp (-6/z),Real.exp (-6/z)]
def normalizingDen (z : ℝ) := Q 1*z*Real.exp (1/z)
end AtomicTriangular.Construction
end
noncomputable section
open scoped BigOperators FourierTransform
namespace AtomicTriangular.Construction
def correctedFinite (side : Fin 2) (z : ℝ) (Ξ΄ : Fin 20 β†’ ℝ) (j : Fin 22) : ℝ :=
(βˆ‘ r : Fin 8, Acoefficient side ⟨j.val, by omega⟩ r * actualParameter z r) +
if hj : j.val < 2 then 0 else δ ⟨j.val - 2, by omega⟩
end AtomicTriangular.Construction
namespace AtomicTriangular
open Construction
local instance finite_pair_neZero : NeZero (2 : β„•) := inferInstance
local instance three_atLeastTwo : Nat.AtLeastTwo 3 := inferInstance
local instance ten_atLeastTwo : Nat.AtLeastTwo 10 := inferInstance
local instance five_hundred_atLeastTwo : Nat.AtLeastTwo 500 := inferInstance
local instance plane_borelSpace : BorelSpace Plane := inferInstance
local instance plane_finite : Module.Finite ℝ Plane := inferInstance
def AtomicConstruction (Ξ± : ℝ) (f : Plane β†’ ℝ) : Prop :=
IsUnit (1 - R) ∧ IsUnit (1 + R) ∧
(1 - R) * Uplus = Yf + R0 * (gamma 1 + gamma 0) ∧
(1 + R) * Uminus = Yf + R0 * (gamma 1 - gamma 0) ∧
βˆƒ (Ξ΄ : Fin 2 β†’ Fin 20 β†’ ℝ) (a : Fin 2 β†’ InputCoefficients),
(βˆ€ side, (βˆ‘ j : Fin 20, |Ξ΄ side j|) < (1 / 10^5 : ℝ)) ∧
(βˆ€ side, (a side).C = if side.val = 0 then -(3/500) else 3/500) ∧
(βˆ€ side (j : Fin 11),
(a side).finiteC j =
correctedFinite side (gaussianZ α) (δ side) ⟨2*j.val, by omega⟩ ∧
(a side).finiteD j =
correctedFinite side (gaussianZ α) (δ side) ⟨2*j.val+1, by omega⟩) ∧
(βˆ€ side, Summable (fun n => |(a side).tailC n| + |(a side).tailD n|) ∧
(βˆ‘' n, (|(a side).tailC n| + |(a side).tailD n|)) < (3 / 10^9 : ℝ)) ∧
(βˆ€ x, (f x : β„‚) =
(inputComplex (a 0) x + 𝓕 (inputComplex (a 1)) x) /
(normalizingDen (gaussianZ Ξ±) : β„‚))
end AtomicTriangular
end
noncomputable section
open scoped BigOperators FourierTransform
namespace AtomicTriangular
open Construction
theorem sharp_gaussian_minorants_with_construction (Ξ± : ℝ) (hΞ± : 0 < Ξ±) :
βˆƒ f : SchwartzMap Plane ℝ,
Radial f ∧ (βˆ€ x, f x ≀ gaussian Ξ± x) ∧
(βˆ€ w, (realFourier f w).im = 0 ∧ 0 ≀ (realFourier f w).re) ∧
(βˆ€ a ∈ A, a β‰  0 β†’ f a = gaussian Ξ± a) ∧
(βˆ€ w ∈ dualA, w β‰  0 β†’ realFourier f w = 0) ∧
(1 ≀ Ξ± β†’ AtomicConstruction Ξ± f) := by
sorry
end AtomicTriangular
end
end OAI