introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
6.13 kB
import Mathlib
import OAI.Probability.CriticalPercolation.ProductMeasure.FiniteMarkovAvg
namespace OAI
section
section
open Set MeasureTheory ProbabilityTheory
open Set
open scoped BigOperators
namespace CriticalPercolation.FiniteMarkov
open Filter
open scoped Topology
variable {X : Type*} [Fintype X] [Preorder X]
def Associated (ΞΌ : X β†’ ℝ) : Prop :=
βˆ€ f g : X β†’ ℝ, Monotone f β†’ Monotone g β†’
avg ΞΌ f * avg ΞΌ g ≀ avg ΞΌ (fun x => f x * g x)
omit [Preorder X] in
lemma avg_neg (ΞΌ : X β†’ ℝ) (f : X β†’ ℝ) :
avg ΞΌ (fun x => -f x) = -avg ΞΌ f := by
simp [avg, Finset.sum_neg_distrib]
lemma Associated.antitone {ΞΌ : X β†’ ℝ} (h : Associated ΞΌ)
(f g : X β†’ ℝ) (hf : Antitone f) (hg : Antitone g) :
avg ΞΌ f * avg ΞΌ g ≀ avg ΞΌ (fun x => f x * g x) := by
have hh := h (fun x => -f x) (fun x => -g x) hf.neg hg.neg
simpa only [avg_neg, neg_mul_neg] using hh
lemma Associated.cross {ΞΌ : X β†’ ℝ} (h : Associated ΞΌ)
(f g : X β†’ ℝ) (hf : Monotone f) (hg : Antitone g) :
avg ΞΌ (fun x => f x * g x) ≀ avg ΞΌ f * avg ΞΌ g := by
have hh := h f (fun x => -g x) hf hg.neg
simp only [avg_neg, mul_neg] at hh
linarith
omit [Preorder X] in
lemma step_mono {K : X β†’ X β†’ ℝ} (hK : βˆ€ x y, 0 ≀ K x y)
{f g : X β†’ ℝ} (hfg : βˆ€ x, f x ≀ g x) (x : X) :
step K f x ≀ step K g x := avg_mono (hK x) hfg
lemma association_halfstep {K L : X β†’ X β†’ ℝ}
(hK : βˆ€ x y, 0 ≀ K x y)
(hKa : βˆ€ x, Associated (K x)) (hLa : βˆ€ x, Associated (L x))
(hLa' : βˆ€ f : X β†’ ℝ, Monotone f β†’ Antitone (step L f))
(f g : X β†’ ℝ) (hf : Monotone f) (hg : Monotone g) (x : X) :
step K (step L f) x * step K (step L g) x ≀
step K (step L (fun y => f y * g y)) x := by
calc
_ ≀ step K (fun y => step L f y * step L g y) x :=
(hKa x).antitone _ _ (hLa' f hf) (hLa' g hg)
_ ≀ _ := step_mono hK (fun y => hLa y f g hf hg) x
lemma step_antitone_of_neg {K : X β†’ X β†’ ℝ}
(hK : βˆ€ f : X β†’ ℝ, Monotone f β†’ Antitone (step K f))
{f : X β†’ ℝ} (hf : Antitone f) : Monotone (step K f) := by
have hh := (hK (fun x => -f x) hf.neg).neg
change Monotone (fun x => avg (K x) f)
simpa only [step, avg_neg, neg_neg] using hh
lemma iterate_association {K : X β†’ X β†’ ℝ}
(hK : βˆ€ x y, 0 ≀ K x y)
(hKa : βˆ€ x, Associated (K x))
(hmono : βˆ€ f : X β†’ ℝ, Monotone f β†’ Monotone (step K f))
(f g : X β†’ ℝ) (hf : Monotone f) (hg : Monotone g) (n : β„•) (x : X) :
(step K)^[n] f x * (step K)^[n] g x ≀
(step K)^[n] (fun y => f y * g y) x := by
have hit (f : X β†’ ℝ) (hf : Monotone f) (n : β„•) : Monotone ((step K)^[n] f) := by
induction n with
| zero => exact hf
| succ n ih => simpa only [Function.iterate_succ_apply'] using hmono _ ih
induction n generalizing x with
| zero => exact le_rfl
| succ n ih =>
rw [Function.iterate_succ_apply', Function.iterate_succ_apply',
Function.iterate_succ_apply']
calc
_ ≀ step K (fun y => (step K)^[n] f y * (step K)^[n] g y) x :=
hKa x _ _ (hit f hf n) (hit g hg n)
_ ≀ _ := step_mono hK (fun y => ih y) x
noncomputable def compose (K L : X β†’ X β†’ ℝ) (x z : X) : ℝ :=
βˆ‘ y, K x y * L y z
omit [Preorder X] in
lemma step_compose (K L : X β†’ X β†’ ℝ) (f : X β†’ ℝ) :
step (compose K L) f = step K (step L f) := by
funext x
simp only [step, avg, compose, Finset.sum_mul, Finset.mul_sum, mul_assoc]
exact Finset.sum_comm
omit [Preorder X] in
lemma compose_nonneg {K L : X β†’ X β†’ ℝ}
(hK : βˆ€ x y, 0 ≀ K x y) (hL : βˆ€ x y, 0 ≀ L x y) (x z : X) :
0 ≀ compose K L x z := Finset.sum_nonneg fun y _ => mul_nonneg (hK x y) (hL y z)
omit [Preorder X] in
lemma compose_mass {K L : X β†’ X β†’ ℝ}
(hK : βˆ€ x, βˆ‘ y, K x y = 1) (hL : βˆ€ x, βˆ‘ y, L x y = 1) (x : X) :
βˆ‘ z, compose K L x z = 1 := by
simp only [compose]
rw [Finset.sum_comm]
simp only [← Finset.mul_sum, hL, mul_one, hK]
omit [Preorder X] in
lemma compose_minorization {K L : X β†’ X β†’ ℝ}
(hK : βˆ€ x y, 0 ≀ K x y) (hKm : βˆ€ x, βˆ‘ y, K x y = 1)
{a : ℝ} {z : X} (haL : βˆ€ x, a ≀ L x z) (x : X) :
a ≀ compose K L x z := by
calc
a = βˆ‘ y, K x y * a := by rw [← Finset.sum_mul, hKm, one_mul]
_ ≀ _ := Finset.sum_le_sum fun y _ => mul_le_mul_of_nonneg_left (haL y) (hK x y)
lemma compose_associated {K L : X β†’ X β†’ ℝ}
(hK : βˆ€ x y, 0 ≀ K x y)
(hKa : βˆ€ x, Associated (K x)) (hLa : βˆ€ x, Associated (L x))
(hLa' : βˆ€ f : X β†’ ℝ, Monotone f β†’ Antitone (step L f)) (x : X) :
Associated (compose K L x) := by
intro f g hf hg
change step (compose K L) f x * step (compose K L) g x ≀
step (compose K L) (fun y => f y * g y) x
simp only [step_compose]
exact association_halfstep hK hKa hLa hLa' f g hf hg x
lemma compose_monotone {K L : X β†’ X β†’ ℝ}
(hKa' : βˆ€ f : X β†’ ℝ, Monotone f β†’ Antitone (step K f))
(hLa' : βˆ€ f : X β†’ ℝ, Monotone f β†’ Antitone (step L f))
{f : X β†’ ℝ} (hf : Monotone f) : Monotone (step (compose K L) f) := by
rw [step_compose]
exact step_antitone_of_neg hKa' (hLa' f hf)
theorem stationary_associated {K : X β†’ X β†’ ℝ}
(hK : βˆ€ x y, 0 ≀ K x y) (hmass : βˆ€ x, βˆ‘ y, K x y = 1)
(hKa : βˆ€ x, Associated (K x))
(hmono : βˆ€ f : X β†’ ℝ, Monotone f β†’ Monotone (step K f))
{a : ℝ} {z : X} (ha : 0 < a) (ha_one : a ≀ 1) (haK : βˆ€ x, a ≀ K x z)
(ΞΌ : X β†’ ℝ) (hΞΌ : βˆ€ x, 0 ≀ ΞΌ x) (hΞΌmass : βˆ‘ x, ΞΌ x = 1)
(hstat : βˆ€ y, βˆ‘ x, ΞΌ x * K x y = ΞΌ y) : Associated ΞΌ := by
intro f g hf hg
have hf' := tendsto_iterate hK hmass ha ha_one haK ΞΌ hΞΌ hΞΌmass hstat f z
have hg' := tendsto_iterate hK hmass ha ha_one haK ΞΌ hΞΌ hΞΌmass hstat g z
have hfg' := tendsto_iterate hK hmass ha ha_one haK ΞΌ hΞΌ hΞΌmass hstat
(fun x => f x * g x) z
exact le_of_tendsto_of_tendsto (hf'.mul hg') hfg'
(Filter.Eventually.of_forall fun n => iterate_association hK hKa hmono f g hf hg n z)
end CriticalPercolation.FiniteMarkov
end
end
end OAI