Skip to content

Commit 1762356

Browse files
committed
feat: generalize Submartingale.expected_stoppedValue_mono to processes taking values in an ordered module (leanprover-community#34770)
I generalize the Submartingale.expected_stoppedValue_mono to processes taking values in a normed ordered module with a ClosedIciTopology. I think this generalization is meaningful because there are many nontrivial examples satisfying these hypothesis. e.g. ℝⁿ equipped with product ordering, Lp spaces. I also replaced the finiteness of measure in several theorems by the assumption that the the filtration is sigma finite.
1 parent c18ef68 commit 1762356

1 file changed

Lines changed: 10 additions & 8 deletions

File tree

Mathlib/Probability/Martingale/OptionalStopping.lean

Lines changed: 10 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ submartingale if and only if for all bounded stopping times `τ` and `π` such t
1616
stopped value of `f` at `τ` has expectation smaller than its stopped value at `π`.
1717
1818
This file also contains Doob's maximal inequality: given a non-negative submartingale `f`, for all
19-
`ε : ℝ≥0`, we have `ε • μ {ε ≤ f* n} ≤ ∫ ω in {ε ≤ f* n}, f n` where `f* n ω = max_{k ≤ n}, f k ω`.
19+
`ε : ℝ≥0`, we have `ε • μ {ε ≤ f* n} ≤ ∫ ω in {ε ≤ f* n}, f n` where `f * n ω = max_{k ≤ n}, f k ω`.
2020
2121
### Main results
2222
@@ -37,12 +37,12 @@ namespace MeasureTheory
3737
variable {Ω : Type*} {m0 : MeasurableSpace Ω} {μ : Measure Ω} {𝒢 : Filtration ℕ m0} {f : ℕ → Ω → ℝ}
3838
{τ π : Ω → ℕ∞}
3939

40-
-- We may generalize the below lemma to functions taking value in a `NormedLatticeAddCommGroup`.
41-
-- Similarly, generalize `(Super/Sub)martingale.setIntegral_le`.
4240
/-- Given a submartingale `f` and bounded stopping times `τ` and `π` such that `τ ≤ π`, the
4341
expectation of `stoppedValue f τ` is less than or equal to the expectation of `stoppedValue f π`.
4442
This is the forward direction of the optional stopping theorem. -/
45-
theorem Submartingale.expected_stoppedValue_mono [SigmaFiniteFiltration μ 𝒢]
43+
theorem Submartingale.expected_stoppedValue_mono {E : Type*} [NormedAddCommGroup E]
44+
[NormedSpace ℝ E] [CompleteSpace E] [PartialOrder E] [IsOrderedAddMonoid E]
45+
[IsOrderedModule ℝ E] [ClosedIciTopology E] [SigmaFiniteFiltration μ 𝒢] {f : ℕ → Ω → E}
4646
(hf : Submartingale f 𝒢 μ) (hτ : IsStoppingTime 𝒢 τ) (hπ : IsStoppingTime 𝒢 π) (hle : τ ≤ π)
4747
{N : ℕ} (hbdd : ∀ ω, π ω ≤ N) : μ[stoppedValue f τ] ≤ μ[stoppedValue f π] := by
4848
rw [← sub_nonneg, ← integral_sub', stoppedValue_sub_eq_sum' hle hbdd]
@@ -68,7 +68,8 @@ theorem Submartingale.expected_stoppedValue_mono [SigmaFiniteFiltration μ 𝒢]
6868
/-- The converse direction of the optional stopping theorem, i.e. a strongly adapted integrable
6969
process `f` is a submartingale if for all bounded stopping times `τ` and `π` such that `τ ≤ π`, the
7070
stopped value of `f` at `τ` has expectation smaller than its stopped value at `π`. -/
71-
theorem submartingale_of_expected_stoppedValue_mono [IsFiniteMeasure μ] (hadp : StronglyAdapted 𝒢 f)
71+
theorem submartingale_of_expected_stoppedValue_mono [SigmaFiniteFiltration μ 𝒢]
72+
(hadp : StronglyAdapted 𝒢 f)
7273
(hint : ∀ i, Integrable (f i) μ) (hf : ∀ τ π : Ω → ℕ∞, IsStoppingTime 𝒢 τ → IsStoppingTime 𝒢 π →
7374
τ ≤ π → (∃ N : ℕ, ∀ ω, π ω ≤ N) → μ[stoppedValue f τ] ≤ μ[stoppedValue f π]) :
7475
Submartingale f 𝒢 μ := by
@@ -89,16 +90,17 @@ theorem submartingale_of_expected_stoppedValue_mono [IsFiniteMeasure μ] (hadp :
8990
/-- **The optional stopping theorem** (fair game theorem): a strongly adapted integrable process `f`
9091
is a submartingale if and only if for all bounded stopping times `τ` and `π` such that `τ ≤ π`, the
9192
stopped value of `f` at `τ` has expectation smaller than its stopped value at `π`. -/
92-
theorem submartingale_iff_expected_stoppedValue_mono [IsFiniteMeasure μ]
93+
theorem submartingale_iff_expected_stoppedValue_mono [SigmaFiniteFiltration μ 𝒢]
9394
(hadp : StronglyAdapted 𝒢 f) (hint : ∀ i, Integrable (f i) μ) :
9495
Submartingale f 𝒢 μ ↔ ∀ τ π : Ω → ℕ∞, IsStoppingTime 𝒢 τ → IsStoppingTime 𝒢 π →
9596
τ ≤ π → (∃ N : ℕ, ∀ x, π x ≤ N) → μ[stoppedValue f τ] ≤ μ[stoppedValue f π] :=
9697
fun hf _ _ hτ hπ hle ⟨_, hN⟩ => hf.expected_stoppedValue_mono hτ hπ hle hN,
9798
submartingale_of_expected_stoppedValue_mono hadp hint⟩
9899

99100
/-- The stopped process of a submartingale with respect to a stopping time is a submartingale. -/
100-
protected theorem Submartingale.stoppedProcess [IsFiniteMeasure μ] (h : Submartingale f 𝒢 μ)
101-
(hτ : IsStoppingTime 𝒢 τ) : Submartingale (stoppedProcess f τ) 𝒢 μ := by
101+
protected theorem Submartingale.stoppedProcess [SigmaFiniteFiltration μ 𝒢]
102+
(h : Submartingale f 𝒢 μ) (hτ : IsStoppingTime 𝒢 τ) :
103+
Submartingale (stoppedProcess f τ) 𝒢 μ := by
102104
rw [submartingale_iff_expected_stoppedValue_mono]
103105
· intro σ π hσ hπ hσ_le_π hπ_bdd
104106
simp_rw [stoppedValue_stoppedProcess]

0 commit comments

Comments
 (0)