math / data /lean /OAI /Probability /SKBarriers /Scalar /PartitionChain.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.83 kB
import Mathlib
import OAI.Probability.SKBarriers.Hierarchy.TimeChainSplit
namespace OAI
section
noncomputable section
open scoped NNReal Topology BigOperators
open MeasureTheory ProbabilityTheory Filter Set
namespace SK.Analytic
@[simp] theorem chainDuration_append (l r : List (ℝ Γ— ℝβ‰₯0)) :
chainDuration (l++r)=chainDuration l+chainDuration r := by
simp [chainDuration]
theorem TimeChainModels.append {Ξ± : ℝ β†’ ℝ} {s : ℝ} {l r : List (ℝ Γ— ℝβ‰₯0)}
(hl : TimeChainModels Ξ± s l) (hr : TimeChainModels Ξ± (s+chainDuration l) r) :
TimeChainModels Ξ± s (l++r) := by
induction l generalizing s with
| nil => simpa only [chainDuration_nil,NNReal.coe_zero,add_zero,List.nil_append] using hr
| cons p l ih =>
rcases p with ⟨m,t⟩
rcases hl with ⟨hc,hl⟩
exact ⟨hc,ih hl (by simpa only [chainDuration_cons,NNReal.coe_add,add_assoc] using hr)⟩
def partitionTimeChain (n : β„•) (q : Fin (n+1) β†’ ℝ) (hq : Monotone q)
(m : Fin n β†’ ℝ) : List (ℝ Γ— ℝβ‰₯0) :=
List.ofFn (fun i : Fin n => (m i,NNReal.mk (q i.succ-q i.castSucc) (sub_nonneg.mpr (hq (Fin.castSucc_le_succ i)))))
theorem partitionTimeChain_cons (n : β„•) (q : Fin (n+2) β†’ ℝ) (hq : Monotone q)
(m : Fin (n+1) β†’ ℝ) :
partitionTimeChain (n+1) q hq m =
(m 0,NNReal.mk (q 1-q 0) (sub_nonneg.mpr (hq (Fin.zero_le _))))::
partitionTimeChain n (fun i => q i.succ)
(fun _ _ h => hq (Fin.succ_le_succ_iff.mpr h)) (fun i => m i.succ) := by
simp only [partitionTimeChain,List.ofFn_succ]
rfl
theorem partitionTimeChain_duration (n : β„•) (q : Fin (n+1) β†’ ℝ) (hq : Monotone q)
(m : Fin n β†’ ℝ) : (chainDuration (partitionTimeChain n q hq m):ℝ)=q (Fin.last n)-q 0 := by
simp only [partitionTimeChain,chainDuration,List.map_ofFn,List.sum_ofFn,
NNReal.coe_sum,NNReal.coe_mk,Function.comp_apply,Finset.sum_sub_distrib]
have H₁ := Fin.sum_univ_succ q
have Hβ‚‚ := Fin.sum_univ_castSucc q
linarith
theorem partitionTimeChain_models (n : β„•) (q : Fin (n+1) β†’ ℝ) (hq : Monotone q)
(m : Fin n β†’ ℝ) {Ξ± : ℝ β†’ ℝ}
(hc : βˆ€ i : Fin n, βˆ€ z∈Ico (q i.castSucc) (q i.succ), Ξ± z=m i) :
TimeChainModels Ξ± (q 0) (partitionTimeChain n q hq m) := by
induction n with
| zero => trivial
| succ n ih =>
simp only [partitionTimeChain,List.ofFn_succ,TimeChainModels,NNReal.coe_mk]
constructor
Β· intro z hz
apply hc 0 z
simpa only [Fin.castSucc_zero,Fin.succ_zero_eq_one,add_sub_cancel] using hz
Β· have H := ih (fun i => q i.succ) (fun _ _ h => hq (Fin.succ_le_succ_iff.mpr h))
(fun i => m i.succ) (fun i z hz => hc i.succ z hz)
simpa only [partitionTimeChain,Fin.succ_zero_eq_one,Fin.castSucc_zero,Fin.succ_castSucc,add_sub_cancel] using H
end SK.Analytic
end
end
end OAI