math / data /lean /OAI /Probability /MemoryPrecision /StochasticContinuation.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
5.42 kB
import Mathlib
import OAI.Probability.GaussianRegression.Main
import OAI.Probability.MemoryPrecision.AmbientGram
namespace OAI
open MeasureTheory ProbabilityTheory Set Filter EuclideanGeometry
open scoped ENNReal NNReal RealInnerProductSpace Topology Pointwise
noncomputable section
universe u v
open MeasureTheory ProbabilityTheory Set Filter
open scoped ENNReal NNReal RealInnerProductSpace Topology Pointwise
namespace MemoryPrecision
open NoiselessRegression
section Stochastic
variable {J X : Type*} [Fintype J] {d : β„•}
def stochRoute (Ξ΄ : β„• β†’ J β†’ (Space d Γ— ℝ) β†’ J β†’ ℝβ‰₯0∞) (n : β„•) :
(k : β„•) β†’ J β†’ ((Fin k β†’ Space d) Γ— (Fin k β†’ ℝ)) β†’ J β†’ ℝβ‰₯0∞
| 0, j, _, w => by classical exact if j = w then 1 else 0
| k+1, j, x, w => βˆ‘ a, Ξ΄ (n+1) j (x.1 0,x.2 0) a *
stochRoute Ξ΄ (n+1) k a (Fin.tail x.1,Fin.tail x.2) w
lemma measurable_stochRoute {Ξ΄ : β„• β†’ J β†’ (Space d Γ— ℝ) β†’ J β†’ ℝβ‰₯0∞}
(hΞ΄ : βˆ€ n j a, Measurable (fun obs => Ξ΄ n j obs a)) (n k : β„•) (j w : J) :
Measurable (fun x => stochRoute Ξ΄ n k j x w) := by
induction k generalizing n j with
| zero => exact measurable_const
| succ k ih =>
apply Finset.measurable_sum _
intro a _
exact ((hΞ΄ (n+1) j a).comp (by fun_prop)).mul ((ih (n+1) a).comp (by fun_prop))
lemma stochRoute_sum_le_one {Ξ΄ : β„• β†’ J β†’ (Space d Γ— ℝ) β†’ J β†’ ℝβ‰₯0∞}
(hΞ΄ : βˆ€ n j obs, βˆ‘ a, Ξ΄ n j obs a ≀ 1) (n k : β„•) (j : J)
(x : (Fin k β†’ Space d) Γ— (Fin k β†’ ℝ)) : βˆ‘ w, stochRoute Ξ΄ n k j x w ≀ 1 := by
classical
induction k generalizing n j with
| zero => simp [stochRoute]
| succ k ih =>
simp only [stochRoute]
rw [Finset.sum_comm]
calc
_ = βˆ‘ a, Ξ΄ (n+1) j (x.1 0,x.2 0) a *
(βˆ‘ w, stochRoute Ξ΄ (n+1) k a (Fin.tail x.1,Fin.tail x.2) w) := by simp [Finset.mul_sum]
_ ≀ βˆ‘ a, Ξ΄ (n+1) j (x.1 0,x.2 0) a := Finset.sum_le_sum (fun a _ =>
mul_le_of_le_one_right' (ih (n+1) a _))
_ ≀ 1 := hΞ΄ _ _ _
def stochCont (Ξ΄ : β„• β†’ J β†’ (Space d Γ— ℝ) β†’ J β†’ ℝβ‰₯0∞)
(w : β„• β†’ J β†’ X β†’ ℝβ‰₯0∞) (ΞΉ : X β†’ Space d) (n : β„•) : β„• β†’ J β†’ X β†’ ℝβ‰₯0∞
| 0, j, s => w n j s
| k+1, j, s => ∫⁻ x, βˆ‘ a, Ξ΄ (n+1) j (x,βŸͺΞΉ s,x⟫) a *
stochCont Ξ΄ w ΞΉ (n+1) k a s βˆ‚stdGaussian (Space d)
lemma measurable_stochCont [MeasurableSpace X] {Ξ΄ : β„• β†’ J β†’ (Space d Γ— ℝ) β†’ J β†’ ℝβ‰₯0∞}
{w : β„• β†’ J β†’ X β†’ ℝβ‰₯0∞} {ΞΉ : X β†’ Space d}
(hΞ΄ : βˆ€ n j a, Measurable (fun obs => Ξ΄ n j obs a))
(hw : βˆ€ n j, Measurable (w n j)) (hΞΉ : Measurable ΞΉ) (n k : β„•) (j : J) :
Measurable (stochCont Ξ΄ w ΞΉ n k j) := by
induction k generalizing n j with
| zero => exact hw n j
| succ k ih =>
apply Measurable.lintegral_prod_left
exact Finset.measurable_sum _ (fun a _ =>
((hΞ΄ (n+1) j a).comp (by fun_prop)).mul ((ih (n+1) a).comp measurable_snd))
lemma stochCont_le_one {Ξ΄ : β„• β†’ J β†’ (Space d Γ— ℝ) β†’ J β†’ ℝβ‰₯0∞}
{w : β„• β†’ J β†’ X β†’ ℝβ‰₯0∞} (ΞΉ : X β†’ Space d)
(hΞ΄ : βˆ€ n j obs, βˆ‘ a, Ξ΄ n j obs a ≀ 1)
(hw : βˆ€ n j s, w n j s ≀ 1) (n k : β„•) (j : J) (s : X) :
stochCont Ξ΄ w ΞΉ n k j s ≀ 1 := by
induction k generalizing n j with
| zero => exact hw n j s
| succ k ih =>
apply (lintegral_mono (fun x => (Finset.sum_le_sum
(fun a _ => mul_le_of_le_one_right' (ih (n+1) a))).trans (hΞ΄ _ _ _))).trans_eq
simp
lemma stochCont_unroll {Ξ΄ : β„• β†’ J β†’ (Space d Γ— ℝ) β†’ J β†’ ℝβ‰₯0∞}
{w : β„• β†’ J β†’ X β†’ ℝβ‰₯0∞} (ΞΉ : X β†’ Space d)
(hΞ΄ : βˆ€ n j a, Measurable (fun obs => Ξ΄ n j obs a))
(n m k : β„•) (j : J) (s : X) :
stochCont Ξ΄ w ΞΉ n (m+k) j s =
∫⁻ A : Fin m β†’ Space d, βˆ‘ a, stochRoute Ξ΄ n m j (A,fun i => βŸͺΞΉ s,A i⟫) a *
stochCont Ξ΄ w ΞΉ (n+m) k a s βˆ‚Measure.pi (fun _ => stdGaussian (Space d)) := by
classical
induction m generalizing n j with
| zero => simp [stochRoute]
| succ m ih =>
rw [Nat.succ_add, stochCont]
simp_rw [ih]
have hf : Measurable (fun A : Fin (m+1) β†’ Space d => βˆ‘ a,
stochRoute Ξ΄ n (m+1) j (A,fun i => βŸͺΞΉ s,A i⟫) a *
stochCont Ξ΄ w ΞΉ (n+(m+1)) k a s) := by
exact Finset.measurable_sum _ (fun a _ =>
((measurable_stochRoute hΞ΄ n (m+1) j a).comp (by fun_prop)).mul measurable_const)
rw [lintegral_pi_cons _ _ hf]
apply lintegral_congr
intro x
have hm (a : J) : Measurable (fun A : Fin m β†’ Space d => βˆ‘ b,
stochRoute Ξ΄ (n+1) m a (A,fun i => βŸͺΞΉ s,A i⟫) b *
stochCont Ξ΄ w ΞΉ (n+1+m) k b s) := by
exact Finset.measurable_sum _ (fun b _ =>
((measurable_stochRoute hΞ΄ (n+1) m a b).comp (by fun_prop)).mul measurable_const)
simp_rw [← lintegral_const_mul _ (hm _)]
rw [← lintegral_finsetSum _ (fun a _ => (hm a).const_mul _)]
apply lintegral_congr
intro A
simp only [stochRoute, Fin.cons_zero, Fin.tail_cons]
have het : Fin.tail (fun i : Fin (m+1) => βŸͺΞΉ s,(Fin.cons x A : Fin (m+1) β†’ Space d) i⟫) =
(fun i => βŸͺΞΉ s,A i⟫) := rfl
rw [het]
simp only [Finset.mul_sum, Finset.sum_mul, mul_assoc]
rw [Finset.sum_comm]
congr 1
funext a
congr 1
funext b
simp [Nat.add_comm, Nat.add_left_comm]
end Stochastic
end MemoryPrecision
end
end OAI