math / data /lean /OAI /GroupTheory /SimpleAmenable /RandomFields /FieldSignalData.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.22 kB
import Mathlib
import OAI.GroupTheory.SimpleAmenable.RandomFields.ThresholdField
namespace OAI
section
section
open scoped symmDiff
namespace SimpleAmenable
open scoped commutatorElement
open scoped commutatorElement
section FieldSignalData
open Classical Set
open scoped ContDiff
structure FieldSignalData where
ψ : (ℝ×ℝ) β†’ ℝ
Ο‡ : (ℝ×ℝ) β†’ ℝ
smooth : ContDiff ℝ 2 ψ
compact : HasCompactSupport ψ
q : ℝ
K : ℝ
L : ℝ
Ξ› : ℝ
L_pos : 0<L
gap : K+2≀L
ψ_zero : βˆ€x,K≀‖xβ€– β†’ ψ x=0
Ο‡_range : βˆ€x,Ο‡ x∈Icc (0:ℝ) 1
Ο‡_one : βˆ€x,β€–x‖≀K+2 β†’ Ο‡ x=1
Ο‡_zero : βˆ€x,L≀‖xβ€– β†’ Ο‡ x=0
Ξ›_nonneg : 0≀Λ
Ο‡_lipschitz : βˆ€x y,|Ο‡ x-Ο‡ y|≀Λ*(|x.1-y.1|+|x.2-y.2|)
theorem exists_fieldSignalData (ψ : (ℝ×ℝ) β†’ ℝ) (hs : ContDiff ℝ 2 ψ)
(hc : HasCompactSupport ψ) (q : ℝ) :
βˆƒS : FieldSignalData,S.ψ=ψ ∧ S.q=q := by
obtain ⟨K,hK,hzero⟩ := hc.exists_pos_le_norm
let Ο‡ : ContDiffBump (0 : ℝ×ℝ) := ⟨K+2,K+3,by linarith,by linarith⟩
obtain βŸ¨Ξ›,hΞ›βŸ© := ContDiff.lipschitzWith_of_hasCompactSupport Ο‡.hasCompactSupport (Ο‡.contDiff : ContDiff ℝ 1 (Ο‡ : (ℝ×ℝ) β†’ ℝ)) (by simp)
refine ⟨⟨ψ,Ο‡,hs,hc,q,K,K+3,Ξ›,by linarith,by linarith,hzero,
fun x => βŸ¨Ο‡.nonneg,Ο‡.le_one⟩,?_,?_,Ξ›.coe_nonneg,?_⟩,rfl,rfl⟩
Β· intro x hx
exact Ο‡.one_of_mem_closedBall (by simpa only [Metric.mem_closedBall,dist_zero_right,Ο‡] using hx)
Β· intro x hx
exact Ο‡.zero_of_le_dist (by simpa only [dist_zero_right,Ο‡] using hx)
Β· intro x y
have hh := hΞ›.dist_le_mul x y
rw [Real.dist_eq,dist_eq_norm,Prod.norm_def] at hh
apply hh.trans
apply mul_le_mul_of_nonneg_left _ Ξ›.coe_nonneg
simp only [Prod.fst_sub,Prod.snd_sub,Real.norm_eq_abs]
exact max_le (le_add_of_nonneg_right (abs_nonneg _)) (le_add_of_nonneg_left (abs_nonneg _))
namespace FieldSignalData
noncomputable def signal (S : FieldSignalData) (x : ℝ×ℝ) : ℝ := S.q+S.ψ x
noncomputable def realLaw (S : FieldSignalData) {a m D : β„•} {v : ℝ×ℝ} (hD : 0<D)
(Ξ· ΞΊ : ℝ) (n : β„•) : MeasureTheory.Measure (FlagSite a m D v β†’ ℝ) :=
sourceSmoothFieldLaw hD S.signal S.Ο‡ S.L_pos ((D:ℝ)^4/5) Ξ· ΞΊ n
instance realLaw_probability (S : FieldSignalData) {a m D : β„•} {v : ℝ×ℝ} (hD : 0<D)
(Ξ· ΞΊ : ℝ) (n : β„•) : MeasureTheory.IsProbabilityMeasure (S.realLaw (a:=a) (m:=m) (v:=v) hD Ξ· ΞΊ n) :=
inferInstanceAs (MeasureTheory.IsProbabilityMeasure (sourceSmoothFieldLaw hD S.signal S.Ο‡ S.L_pos ((D:ℝ)^4/5) Ξ· ΞΊ n))
noncomputable def bitLaw (S : FieldSignalData) {a m D : β„•} {v : ℝ×ℝ} (hD : 0<D)
(Ξ· ΞΊ : ℝ) (n : β„•) : MeasureTheory.Measure (FlagSite a m D v β†’ Bool) :=
sourceBitFieldLaw hD S.signal S.Ο‡ S.L_pos ((D:ℝ)^4/5) Ξ· ΞΊ n
instance bitLaw_probability (S : FieldSignalData) {a m D : β„•} {v : ℝ×ℝ} (hD : 0<D)
(Ξ· ΞΊ : ℝ) (n : β„•) : MeasureTheory.IsProbabilityMeasure (S.bitLaw (a:=a) (m:=m) (v:=v) hD Ξ· ΞΊ n) :=
inferInstanceAs (MeasureTheory.IsProbabilityMeasure (sourceBitFieldLaw hD S.signal S.Ο‡ S.L_pos ((D:ℝ)^4/5) Ξ· ΞΊ n))
end FieldSignalData
end FieldSignalData
end SimpleAmenable
end
end
end OAI