File size: 5,128 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 | import OAI.Probability.FreeIsing.Brownian.SimpleIntegral
namespace OAI
noncomputable section
open MeasureTheory ProbabilityTheory
open scoped NNReal
namespace Problem367.BrownianGrid
def integralSum {Ξ© : Type*} (B : ββ₯0 β Ξ© β β) (t : β β ββ₯0)
(H : β β Ξ© β β) (n : β) (Ο : Ξ©) : β :=
β i β Finset.range n, H i Ο * (B (t (i + 1)) Ο - B (t i) Ο)
lemma sum_range_blocks {E : Type*} [AddCommMonoid E] (f : β β E) (n k : β) :
β i β Finset.range (n * k), f i =
β j β Finset.range n, β l β Finset.range k, f (j * k + l) := by
induction n with
| zero => simp
| succ n ih =>
rw [Nat.succ_mul, Finset.sum_range_add, ih, Finset.sum_range_succ]
lemma weighted_sum_refinement (x H : β β β) (n : β) {k : β} (hk : 0 < k) :
(β j β Finset.range n, H j * (x ((j + 1) * k) - x (j * k))) =
β i β Finset.range (n * k), H (i / k) * (x (i + 1) - x i) := by
rw [sum_range_blocks]
apply Finset.sum_congr rfl
intro j hj
calc
H j * (x ((j + 1) * k) - x (j * k)) =
H j * (β l β Finset.range k, (x (j * k + (l + 1)) - x (j * k + l))) := by
rw [Finset.sum_range_sub (fun l => x (j * k + l)) k]
simp [Nat.add_mul]
_ = β l β Finset.range k, H j * (x (j * k + (l + 1)) - x (j * k + l)) :=
Finset.mul_sum _ _ _
_ = _ := by
apply Finset.sum_congr rfl
intro l hl
have hdiv : (j * k + l) / k = j := by
rw [Nat.mul_comm j k, Nat.mul_add_div hk, Nat.div_eq_of_lt (Finset.mem_range.mp hl)]
omega
rw [hdiv]
congr 3
theorem integralSum_refinement {Ξ© : Type*} (B : ββ₯0 β Ξ© β β)
(t : β β ββ₯0) (H : β β Ξ© β β) (n : β) {k : β} (hk : 0 < k) :
integralSum B (fun j => t (j * k)) H n =
integralSum B t (fun i => H (i / k)) (n * k) := by
funext Ο
exact weighted_sum_refinement (fun i => B (t i) Ο) (fun i => H i Ο) n hk
lemma integralSum_sub {Ξ© : Type*} (B : ββ₯0 β Ξ© β β) (t : β β ββ₯0)
(H K : β β Ξ© β β) (n : β) :
integralSum B t (fun i Ο => H i Ο - K i Ο) n =
fun Ο => integralSum B t H n Ο - integralSum B t K n Ο := by
funext Ο
simp only [integralSum, sub_mul, Finset.sum_sub_distrib]
theorem stronglyMeasurable_refined {Ξ© : Type*} [mΞ© : MeasurableSpace Ξ©]
{B : ββ₯0 β Ξ© β β} (hm : β t, StronglyMeasurable (B t))
{t : β β ββ₯0} (ht : Monotone t) {H : β β Ξ© β β} {k : β}
(hH : β j, StronglyMeasurable[Filtration.natural B hm (t (j * k))] (H j))
(i : β) : StronglyMeasurable[Filtration.natural B hm (t i)] (H (i / k)) :=
(hH (i / k)).mono ((Filtration.natural B hm).mono (ht (Nat.div_mul_le_self i k)))
theorem preBrownian_difference_isometry
{Ξ© : Type*} [mΞ© : MeasurableSpace Ξ©] {P : Measure Ξ©}
{B : ββ₯0 β Ξ© β β} (hB : IsPreBrownianReal B P)
(hm : β t, StronglyMeasurable (B t))
(t : β β ββ₯0) (ht : Monotone t) (H K : β β Ξ© β β)
{k : β} (hk : 0 < k)
(hH : β j, StronglyMeasurable[Filtration.natural B hm (t (j * k))] (H j))
(hK : β i, StronglyMeasurable[Filtration.natural B hm (t i)] (K i))
(hH2 : β j, MemLp (H j) 2 P) (hK2 : β i, MemLp (K i) 2 P) (n : β) :
(β« Ο, (integralSum B (fun j => t (j * k)) H n Ο -
integralSum B t K (n * k) Ο) ^ 2 βP) =
β i β Finset.range (n * k), ((t (i + 1) : β) - (t i : β)) *
β« Ο, (H (i / k) Ο - K i Ο) ^ 2 βP := by
rw [integralSum_refinement B t H n hk]
simpa only [integralSum, sub_mul, Finset.sum_sub_distrib] using
preBrownian_predictable_sum_isometry hB hm t ht
(fun i Ο => H (i / k) Ο - K i Ο)
(fun i => (stronglyMeasurable_refined hm ht hH i).sub (hK i))
(fun i => (hH2 (i / k)).sub (hK2 i)) (Finset.range (n * k))
theorem preBrownian_difference_bound
{Ξ© : Type*} [mΞ© : MeasurableSpace Ξ©] {P : Measure Ξ©}
{B : ββ₯0 β Ξ© β β} (hB : IsPreBrownianReal B P)
(hm : β t, StronglyMeasurable (B t))
(t : β β ββ₯0) (ht : Monotone t) (H K : β β Ξ© β β)
{k : β} (hk : 0 < k)
(hH : β j, StronglyMeasurable[Filtration.natural B hm (t (j * k))] (H j))
(hK : β i, StronglyMeasurable[Filtration.natural B hm (t i)] (K i))
(hH2 : β j, MemLp (H j) 2 P) (hK2 : β i, MemLp (K i) 2 P)
(n : β) {Ξ΅ : β}
(happrox : β i < n * k, (β« Ο, (H (i / k) Ο - K i Ο) ^ 2 βP) β€ Ξ΅) :
(β« Ο, (integralSum B (fun j => t (j * k)) H n Ο -
integralSum B t K (n * k) Ο) ^ 2 βP) β€
((t (n * k) : β) - (t 0 : β)) * Ξ΅ := by
rw [preBrownian_difference_isometry hB hm t ht H K hk hH hK hH2 hK2 n]
calc
_ β€ β i β Finset.range (n * k), ((t (i + 1) : β) - (t i : β)) * Ξ΅ := by
apply Finset.sum_le_sum
intro i hi
apply mul_le_mul_of_nonneg_left (happrox i (Finset.mem_range.mp hi))
exact sub_nonneg.mpr (NNReal.coe_le_coe.mpr (ht (Nat.le_succ i)))
_ = _ := by rw [β Finset.sum_mul, Finset.sum_range_sub (fun i => (t i : β)) (n * k)]
end Problem367.BrownianGrid
end
end OAI
|