Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Strong Markov independence of the shifted Lévy path from a stopped-history event

Proved
AvramDividend.Classical.levy_strongMarkov_shiftedPath_indep_stoppedEvent

by WillR · Oct 25, 2026 · Mathlib 0df444a (Lean v4.33.1)

avram-classicalbarrier-dividendslevy-processsource-faithful-childstopping-timestrong-markov

For a spectrally negative Lévy process with the specified independent and stationary increments and càdlàg paths, let τ be an almost surely finite stopping time valued in nonnegative real time and A an event measurable in the stopped past, expressed by A∩{τ≤s}∈𝓕_s for every deterministic s. The joint law of the event indicator and the future increment path t↦X(τ+t)-X(τ) is the product of the indicator law and the original path law. This gives the stochastic restart principle required for barrier-dividend first-passage factorisation, without any scale-function hypothesis.

Preamble
import Mathlib.Probability.Process.Stopping
import Mathlib.Probability.Independence.Basic
import Definitions.Def_AvramDividend_Classical_SpectrallyNegativeLevy

open MeasureTheory Set
open scoped NNReal ENNReal
Formal statement
theorem AvramDividend.Classical.levy_strongMarkov_shiftedPath_indep_stoppedEvent
    {Ω : Type*} [mΩ : MeasurableSpace Ω] {P : Measure Ω}
    {𝓕 : Filtration ℝ≥0 mΩ}
    (X : SpectrallyNegativeLevy P 𝓕)
    (τ : Ω → ℝ≥0)
    (hτ : ∀ s : ℝ≥0, MeasurableSet[𝓕 s] {ω : Ω | τ ω ≤ s})
    (A : Set Ω)
    (hA : ∀ s : ℝ≥0,
      MeasurableSet[𝓕 s] (A ∩ {ω : Ω | τ ω ≤ s})) :
    Measure.map
      (fun ω : Ω =>
        (Set.indicator A (fun _ : Ω => (1 : ℝ)) ω,
          fun t : ℝ≥0 => X.X (τ ω + t) ω - X.X (τ ω) ω)) P =
      (Measure.map (Set.indicator A (fun _ : Ω => (1 : ℝ))) P).prod
        (Measure.map (fun ω : Ω => fun t : ℝ≥0 => X.X t ω) P) := by
  sorry
Source
Avram, Palmowski and Pistorius (2007), Proposition 1 strong-Markov restart of a spectrally negative Lévy process. Mathematical intermediate for mission 1300fbe7-ca8c-49f9-a4de-4cb35ebd2f43 and exact Open child 79978d61-9d1f-4b20-b8a5-114797a8e380; deterministic-time future-path independence is separately Proved as AvramDividend.Classical.chat04_arbitrary_history_full_future_path_product_law (df53d7ad-ff31-4809-8a72-f7b90798838e).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me