math / data /lean /OAI /Probability /PosteriorReplicas /Regression /StreamIntegrals.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
11.6 kB
import OAI.Probability.PosteriorReplicas.Regression.ProjectionBlocks
namespace OAI
open MeasureTheory ProbabilityTheory Set Filter
open scoped ENNReal NNReal RealInnerProductSpace
noncomputable section
universe u
namespace PosteriorRegression
open scoped Topology
open InnerProductSpace
open scoped Pointwise
section StreamAux
variable {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℝ E]
[FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E]
variable {J : Type*} [Fintype J] [MeasurableSpace J] [MeasurableSingletonClass J]
lemma measurable_select {X Y : Type*} [MeasurableSpace X] [MeasurableSpace Y]
{h : J β†’ X β†’ Y} (hh : βˆ€ j, Measurable (h j)) {Ο† : X β†’ J} (hΟ† : Measurable Ο†) :
Measurable (fun x => h (Ο† x) x) :=
(measurable_from_prod_countable_right (f := fun p : J × X => h p.1 p.2) hh).comp (hφ.prodMk measurable_id)
omit [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [BorelSpace E] in
lemma lintegral_pi_cons (Ξ½ : Measure E) [SigmaFinite Ξ½] {n : β„•}
(f : (Fin (n+1) β†’ E) β†’ ℝβ‰₯0∞) (hf : Measurable f) :
(∫⁻ v, f v βˆ‚Measure.pi (fun _ => Ξ½)) =
∫⁻ x, ∫⁻ v : Fin n β†’ E, f (Fin.cons x v) βˆ‚Measure.pi (fun _ => Ξ½) βˆ‚Ξ½ := by
have hp := (measurePreserving_piFinSuccAbove (fun _ : Fin (n+1) => Ξ½) (0 : Fin (n+1))).symm
rw [← hp.lintegral_comp_emb (MeasurableEquiv.measurableEmbedding _) f, lintegral_prod]
Β· congr 1
ext x
congr 1
ext v
congr 1
simp only [MeasurableEquiv.piFinSuccAbove_symm_apply, Fin.insertNthEquiv]
simp
Β· exact (hf.comp hp.measurable).aemeasurable
def streamRoute (Ξ΄ : β„• β†’ J β†’ (E Γ— ℝ) β†’ J) (n : β„•) :
(k : β„•) β†’ J β†’ ((Fin k β†’ E) Γ— (Fin k β†’ ℝ)) β†’ J
| 0, j, _ => j
| k+1, j, x => streamRoute Ξ΄ (n+1) k (Ξ΄ (n+1) j (x.1 0, x.2 0)) (Fin.tail x.1, Fin.tail x.2)
omit [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [BorelSpace E] in
lemma measurable_streamRoute {Ξ΄ : β„• β†’ J β†’ (E Γ— ℝ) β†’ J}
(hΞ΄ : βˆ€ n j, Measurable (Ξ΄ n j)) (n k : β„•) (j : J) :
Measurable (streamRoute Ξ΄ n k j) := by
induction k generalizing n j with
| zero => exact measurable_const
| succ k ih =>
change Measurable (fun x : (Fin (k+1) β†’ E) Γ— (Fin (k+1) β†’ ℝ) => streamRoute Ξ΄ (n+1) k (Ξ΄ (n+1) j (x.1 0,x.2 0)) (Fin.tail x.1,Fin.tail x.2))
have ht : Measurable (fun x : (Fin (k+1) β†’ E) Γ— (Fin (k+1) β†’ ℝ) =>
(Fin.tail x.1, Fin.tail x.2)) := by
change Measurable (fun x : (Fin (k+1) β†’ E) Γ— (Fin (k+1) β†’ ℝ) =>
((fun i : Fin k => x.1 i.succ), (fun i : Fin k => x.2 i.succ)))
fun_prop
have hd : Measurable (fun x : (Fin (k+1) β†’ E) Γ— (Fin (k+1) β†’ ℝ) =>
Ξ΄ (n+1) j (x.1 0,x.2 0)) := (hΞ΄ (n+1) j).comp (by fun_prop)
exact measurable_select (fun a => (ih (n+1) a).comp ht) hd
def continuation (Ξ΄ : β„• β†’ J β†’ (E Γ— ℝ) β†’ J) (w : β„• β†’ J β†’ E β†’ ℝβ‰₯0∞)
(n : β„•) : β„• β†’ J β†’ E β†’ ℝβ‰₯0∞
| 0, j, s => w n j s
| k+1, j, s => ∫⁻ x, continuation Ξ΄ w (n+1) k (Ξ΄ (n+1) j (x, βŸͺs,x⟫)) s βˆ‚stdGaussian E
lemma measurable_continuation {Ξ΄ : β„• β†’ J β†’ (E Γ— ℝ) β†’ J} {w : β„• β†’ J β†’ E β†’ ℝβ‰₯0∞}
(hΞ΄ : βˆ€ n j, Measurable (Ξ΄ n j)) (hw : βˆ€ n j, Measurable (w n j)) (n k : β„•) (j : J) :
Measurable (continuation Ξ΄ 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 measurable_select (fun a => (ih (n+1) a).comp measurable_snd)
((hΞ΄ (n+1) j).comp (by fun_prop))
omit [Fintype J] [MeasurableSpace J] [MeasurableSingletonClass J] [BorelSpace E] in
lemma continuation_le_one {Ξ΄ : β„• β†’ J β†’ (E Γ— ℝ) β†’ J} {w : β„• β†’ J β†’ E β†’ ℝβ‰₯0∞}
(hw : βˆ€ n j s, w n j s ≀ 1) (n k : β„•) (j : J) (s : E) :
continuation Ξ΄ w n k j s ≀ 1 := by
induction k generalizing n j with
| zero => exact hw n j s
| succ k ih => exact (lintegral_mono (fun x => ih _ _)).trans_eq (by simp)
lemma continuation_unroll {Ξ΄ : β„• β†’ J β†’ (E Γ— ℝ) β†’ J} {w : β„• β†’ J β†’ E β†’ ℝβ‰₯0∞}
(hΞ΄ : βˆ€ n j, Measurable (Ξ΄ n j))
(n m k : β„•) (j : J) (s : E) :
continuation Ξ΄ w n (m+k) j s =
blockValue (fun a => continuation Ξ΄ w (n+m) k a) (streamRoute Ξ΄ n m j) s := by
induction m generalizing n j with
| zero =>
simp [blockValue, streamRoute]
| succ m ih =>
rw [Nat.succ_add, continuation]
simp_rw [ih]
unfold blockValue
have hf : Measurable (fun A : Fin (m+1) β†’ E =>
continuation Ξ΄ w (n+(m+1)) k (streamRoute Ξ΄ n (m+1) j (A,fun i => βŸͺs,A i⟫)) s) := by
exact (measurable_of_finite (fun a => continuation Ξ΄ w (n+(m+1)) k a s)).comp
((measurable_streamRoute hΞ΄ n (m+1) j).comp (by fun_prop))
rw [lintegral_pi_cons _ _ hf]
apply lintegral_congr
intro x
apply lintegral_congr
intro A
have he : Fin.tail (fun i : Fin (m+1) => βŸͺs,(Fin.cons x A : Fin (m+1) β†’ E) i⟫) = (fun i => βŸͺs,A i⟫) := by
ext i
simp [Fin.tail]
simp [streamRoute, he, Nat.add_left_comm, Nat.add_comm]
def streamFactor (q : β„•) : ℝβ‰₯0∞ :=
(32768 : ℝβ‰₯0∞)^Module.finrank ℝ E * (Fintype.card J : ℝβ‰₯0∞)^(1/(q : ℝ))
omit [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E] [MeasurableSpace J] [MeasurableSingletonClass J] in
lemma streamFactor_ne_top (q : β„•) : streamFactor (E := E) (J := J) q β‰  ∞ := by
exact ENNReal.mul_ne_top (by simp) (ENNReal.rpow_ne_top_of_nonneg (by positivity) (by simp))
omit [FiniteDimensional ℝ E] [MeasurableSpace E] [BorelSpace E] [MeasurableSpace J] [MeasurableSingletonClass J] in
lemma one_le_streamFactor [Nonempty J] {q : β„•} (hq : 0 < q) :
1 ≀ streamFactor (E := E) (J := J) q := by
apply one_le_mul (one_le_powβ‚€ (by norm_num))
exact ENNReal.one_le_rpow (by exact_mod_cast Fintype.card_pos (Ξ± := J)) (by positivity)
omit [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [BorelSpace E] in
lemma PolynomialMass.mono {ΞΌ : Measure E} {a : β„•} {C D : ℝβ‰₯0∞}
(h : PolynomialMass ΞΌ a C) (hCD : C ≀ D) : PolynomialMass ΞΌ a D :=
fun z r hr => (h z r hr).trans (mul_le_mul' hCD le_rfl)
lemma continuation_mass_bound [Nonempty J] (ΞΌ : Measure E) [IsFiniteMeasure ΞΌ]
{Ξ΄ : β„• β†’ J β†’ (E Γ— ℝ) β†’ J} {w : β„• β†’ J β†’ E β†’ ℝβ‰₯0∞}
(hΞ΄ : βˆ€ n j, Measurable (Ξ΄ n j)) (hw : βˆ€ n j, Measurable (w n j))
(hw1 : βˆ€ n j s, w n j s ≀ 1)
{a q : β„•} {C : ℝβ‰₯0∞} (hC : C β‰  0) (hCt : C β‰  ∞)
(hlocal : βˆ€ n j, PolynomialMass (ΞΌ.withDensity (w n j)) a C)
(hd : 1 ≀ Module.finrank ℝ E) (ha : a ≀ Module.finrank ℝ E)
(hq : 2 ≀ q) (hqa : 2*q ≀ a) (n k : β„•) (j : J) :
PolynomialMass (ΞΌ.withDensity (continuation Ξ΄ w n k j)) a
(C * streamFactor (E := E) (J := J) q ^ (k/q+1)) := by
have hden : ((q-1 : β„•) : ℝ)+1 = (q : ℝ) := by
rw [Nat.cast_sub (by omega : 1 ≀ q), Nat.cast_one]
ring
have hq0 : 0 < q := by omega
have hK1 := one_le_streamFactor (E := E) (J := J) hq0
have hK0 : streamFactor (E := E) (J := J) q β‰  0 := ne_of_gt (lt_of_lt_of_le zero_lt_one hK1)
have hKt := streamFactor_ne_top (E := E) (J := J) q
induction k using Nat.strong_induction_on generalizing n j with
| h k ih =>
by_cases hk : q ≀ k
Β· have hki : k-q < k := by omega
have hC1 : C * streamFactor (E := E) (J := J) q ^ ((k-q)/q+1) β‰  0 :=
mul_ne_zero hC (pow_ne_zero _ hK0)
have hC1t : C * streamFactor (E := E) (J := J) q ^ ((k-q)/q+1) β‰  ∞ :=
ENNReal.mul_ne_top hCt (ENNReal.pow_ne_top hKt)
have hb := blockValue_mass_bound ΞΌ
(fun b => measurable_continuation hΞ΄ hw (n+q) (k-q) b)
(fun b s => continuation_le_one hw1 (n+q) (k-q) b s)
(fun b => ih (k-q) hki (n+q) b) hC1 hC1t hd ha
(by omega : q ≀ Module.finrank ℝ E) (by omega : 1 ≀ q-1)
(by omega : q-1+q ≀ a) (measurable_streamRoute hΞ΄ n q j)
have he : continuation Ξ΄ w n k j =
blockValue (fun b => continuation Ξ΄ w (n+q) (k-q) b) (streamRoute Ξ΄ n q j) := by
funext s
simpa [Nat.add_sub_of_le hk] using continuation_unroll hΞ΄ n q (k-q) j s
rw [he]
have hdiv : k/q = (k-q)/q+1 := by
conv_lhs => rw [← Nat.add_sub_of_le hk]
exact Nat.add_div_left _ hq0
convert hb using 1
rw [hden, ← streamFactor, hdiv, pow_succ]
ring
Β· have hkm : k ≀ q := by omega
have hb := blockValue_mass_bound ΞΌ
(fun b => hw (n+k) b) (fun b s => hw1 (n+k) b s) (hlocal (n+k)) hC hCt hd ha
(by omega : k ≀ Module.finrank ℝ E) (by omega : 1 ≀ q-1)
(by omega : q-1+k ≀ a) (measurable_streamRoute hΞ΄ n k j)
have he : continuation Ξ΄ w n k j = blockValue (w (n+k)) (streamRoute Ξ΄ n k j) := by
funext s
simpa [continuation] using continuation_unroll hΞ΄ n k 0 j s
rw [he]
convert hb using 1
rw [hden, ← streamFactor, Nat.div_eq_of_lt (by omega : k < q)]
simp [mul_comm]
lemma fin_tail_snoc {X : Type*} {k : β„•} (A : Fin (k+1) β†’ X) (x : X) :
Fin.tail (Fin.snoc A x : Fin (k+2) β†’ X) =
(Fin.snoc (Fin.tail A : Fin k β†’ X) x : Fin (k+1) β†’ X) := by
rw [← Fin.cons_self_tail A, ← Fin.cons_snoc_eq_snoc_cons, Fin.tail_cons, Fin.tail_cons]
omit [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E]
[MeasurableSpace E] [BorelSpace E] [Fintype J] [MeasurableSpace J] [MeasurableSingletonClass J] in
lemma streamRoute_snoc (Ξ΄ : β„• β†’ J β†’ (E Γ— ℝ) β†’ J) (n k : β„•) (j : J)
(A : Fin k β†’ E) (b : Fin k β†’ ℝ) (x : E) (y : ℝ) :
streamRoute Ξ΄ n (k+1) j (Fin.snoc A x, Fin.snoc b y) =
Ξ΄ (n+k+1) (streamRoute Ξ΄ n k j (A,b)) (x,y) := by
induction k generalizing n j with
| zero => simp [streamRoute, Fin.snoc_zero]
| succ k ih =>
rw [streamRoute]
simp only [Fin.snoc_apply_zero, fin_tail_snoc]
rw [ih, streamRoute]
congr 1; omega
omit [NormedAddCommGroup E] [InnerProductSpace ℝ E] [FiniteDimensional ℝ E] [BorelSpace E] in
lemma lintegral_pi_prefix (Ξ½ : Measure E) [IsProbabilityMeasure Ξ½] {t T : β„•} (ht : t ≀ T)
(f : (Fin t β†’ E) β†’ ℝβ‰₯0∞) (hf : Measurable f) :
(∫⁻ x : Fin T β†’ E, f (fun i => x (Fin.castLE ht i)) βˆ‚Measure.pi (fun _ => Ξ½)) =
∫⁻ x, f x βˆ‚Measure.pi (fun _ => Ξ½) := by
induction T with
| zero =>
have : t = 0 := by omega
subst t
rfl
| succ T ih =>
by_cases h : t ≀ T
Β· have he (x : Fin T β†’ E) (y : E) :
(fun i : Fin t => (Fin.snoc x y : Fin (T+1) β†’ E) (Fin.castLE ht i)) =
(fun i : Fin t => x (Fin.castLE h i)) := by
ext i
change (Fin.snoc x y : Fin (T+1) β†’ E) (Fin.castLE h i).castSucc = _
exact Fin.snoc_castSucc _ _ _
rw [lintegral_pi_snoc Ξ½ (fun x : Fin (T+1) β†’ E => f (fun i => x (Fin.castLE ht i)))
(hf.comp (by fun_prop))]
simp_rw [he, lintegral_const, measure_univ, mul_one]
exact ih h
Β· have he : t = T+1 := by omega
subst t
rfl
end StreamAux
lemma fin_prefix_snoc {X : Type*} {n T : β„•} (h : n+1 ≀ T) (x : Fin T β†’ X) :
(fun i : Fin (n+1) => x (Fin.castLE h i)) =
(Fin.snoc (fun i : Fin n => x (Fin.castLE (by omega) i))
(x ⟨n, by omega⟩) : Fin (n+1) β†’ X) := by
ext i
refine Fin.lastCases ?_ (fun j => ?_) i
Β· simp only [Fin.snoc_last]
rfl
Β· simp
end PosteriorRegression
end
end OAI