math / data /lean /OAI /Probability /InvariantIsing /Fields /CascadeSeedRegular.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
3.55 kB
import OAI.Probability.InvariantIsing.Fields.CascadeSeedTree
import OAI.Probability.IsingPerceptron.NoiseGibbsRegular
namespace OAI
/-! Regularity of uniform-seed trees, independent of the ancestor state. -/
noncomputable section
open MeasureTheory ProbabilityTheory IsingPerceptron
open scoped ENNReal
namespace InvariantIsing
def CascadeSeedRegular (n : β„•) (b : β„• β†’ ℝ) (T : NoiseTree unitInterval n) : Prop :=
NoiseGibbsRegular n b (fun _ => cascadeSeedLaw)
(fun _ (_ : PUnit Γ— unitInterval) => 1) (fun _ _ => PUnit.unit) PUnit.unit T
lemma cascadeSeedRegular_ae (n : β„•) (b : β„• β†’ ℝ) (hb : CascadeExponents n b) :
βˆ€α΅ T βˆ‚(noiseCascadeLaw unitInterval n b (fun _ => cascadeSeedLaw) : Measure _),
CascadeSeedRegular n b T := by
exact noiseGibbsRegular_ae n b hb (fun _ => cascadeSeedLaw)
(fun _ => measurable_const) (fun _ => measurable_const) (fun _ _ _ => zero_lt_one)
(fun _ _ => by simp) PUnit.unit
lemma cascadeSeedRegular_sigma {n : β„•} {b : β„• β†’ ℝ} {T : NoiseTree unitInterval (n+1)}
(hT : CascadeSeedRegular (n+1) b T) :
sigmaPart ((powerIntensity (b 0)).prod ((cascadeSeedLaw : Measure unitInterval).prod
(noiseCascadeLaw unitInterval n (fun j => b (j+1)) (fun _ => cascadeSeedLaw)))) T = T :=
Marked.sigmaPart_eq_of_good _ hT.2.2.1
lemma cascadeSeedRegular_tail {n : β„•} {b : β„• β†’ ℝ} {T : NoiseTree unitInterval (n+1)}
(hT : CascadeSeedRegular (n+1) b T) :
βˆ€α΅ p βˆ‚T, CascadeSeedRegular n (fun j => b (j+1)) p.2.2 := by
have h := hT.2.2.2
rwa [cascadeSeedRegular_sigma hT] at h
lemma cascadeSeedRegular_total {n : β„•} {b : β„• β†’ ℝ} {T : NoiseTree unitInterval (n+1)}
(hT : CascadeSeedRegular (n+1) b T) :
0 < noiseTreeTotal unitInterval (n+1) T ∧ noiseTreeTotal unitInterval (n+1) T < ∞ := hT.1
theorem cascadeSeedTree_total {ΞΉ : Type} [Fintype ΞΉ] (n : β„•) (b : β„• β†’ ℝ)
(ψ : β„• β†’ (ΞΉ β†’ ℝ) β†’ unitInterval β†’ (ΞΉ β†’ ℝ))
(hψ : βˆ€ i, Measurable (Function.uncurry (ψ i)))
(T : NoiseTree unitInterval n) (hT : CascadeSeedRegular n b T) (z : ΞΉ β†’ ℝ) :
noiseTreeTotal (ΞΉ β†’ ℝ) n (cascadeSeedTree n b ψ z T) = noiseTreeTotal unitInterval n T := by
induction n generalizing b ψ z with
| zero => rfl
| succ n ih =>
have hmap : Measurable (fun p : ℝ Γ— (unitInterval Γ— NoiseTree unitInterval n) =>
(p.1,(ψ 0 z p.2.1,cascadeSeedTree n (fun j => b (j+1)) (fun j => ψ (j+1))
(z+ψ 0 z p.2.1) p.2.2))) := by
have hm : Measurable (fun p : ℝ Γ— (unitInterval Γ— NoiseTree unitInterval n) => ψ 0 z p.2.1) :=
(hψ 0).comp (measurable_const.prodMk (measurable_fst.comp measurable_snd))
exact measurable_fst.prodMk (hm.prodMk
((measurable_cascadeSeedTree n _ _ (fun i => hψ (i+1))).comp
((measurable_const.add hm).prodMk (by fun_prop))))
rw [cascadeSeedTree, cascadeSeedRegular_sigma hT, noiseTreeTotal_succ, noiseTreeTotal_succ]
rw [lintegral_map (show Measurable (fun p : ℝ Γ— ((ΞΉ β†’ ℝ) Γ— NoiseTree (ΞΉ β†’ ℝ) n) =>
ENNReal.ofReal (max p.1 0) * noiseTreeTotal (ΞΉ β†’ ℝ) n p.2.2) from
(by fun_prop : Measurable (fun p : ℝ Γ— ((ΞΉ β†’ ℝ) Γ— NoiseTree (ΞΉ β†’ ℝ) n) =>
ENNReal.ofReal (max p.1 0))).mul ((measurable_noiseTreeTotal (ΞΉ β†’ ℝ) n).comp
(measurable_snd.comp measurable_snd))) hmap]
apply lintegral_congr_ae
filter_upwards [cascadeSeedRegular_tail hT] with p hp
rw [ih _ _ (fun i => hψ (i+1)) _ hp]
end InvariantIsing
end
end OAI