Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact actual strict two-sided horizon killed payoff partitions into upper exit and surviving-strip remainder

Proved
AvramDividend.Classical.avram_ws01b_actual_horizon_killed_reward_two_way_split

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

avram-dividend-classicalbvexit-payofffinite-horizonws01b

For the actual spectrally negative Lévy strict two-sided passage clocks, at every finite horizon and path the exact killed q-scale terminal reward equals the discounted successful upper-first payoff once that exit has occurred, plus the discounted original reserve reward on paths still inside both bounds. Finite simultaneous upper and lower exits are excluded by the accepted source no-finite-tie theorem. This deterministic identity is the missing bridge from finite-horizon BV killed expectation to infinite-horizon exit reward.

Preamble
import Mathlib
import Definitions.Def_AvramDividend_Classical_TwoSidedExit
import Theorems.Thm_AvramDividend_Classical_chat04_two_sided_strict_exit_no_finite_tie

open AvramDividend.Classical MeasureTheory Filter Topology Set
open scoped NNReal ENNReal
Formal statement
theorem AvramDividend.Classical.avram_ws01b_actual_horizon_killed_reward_two_way_split
    {Ω : Type*} [mΩ : MeasurableSpace Ω] {P : Measure Ω}
    {𝓕 : Filtration ℝ≥0 mΩ}
    (X : SpectrallyNegativeLevy P 𝓕)
    (q : ℝ) (W : ℝ → ℝ)
    (a x : ℝ) (ha : 0 < a) (hxa : x ≤ a)
    (T : ℝ≥0) (ω : Ω) :
    (let U : ℝ≥0∞ := twoSidedExitUpTime X (a-x) ω
     let D : ℝ≥0∞ := twoSidedExitDownTime X (-x) ω
     (if (T : ℝ≥0∞) < D then
        if min U D < ⊤ then
          Real.exp (-(q * ((min (min U D).toNNReal T) : ℝ))) *
            W (x + X.X (min (min U D).toNNReal T) ω)
        else Real.exp (-(q * (T : ℝ))) * W (x + X.X T ω)
      else if D < U then 0
      else Real.exp (-(q * (U.toNNReal : ℝ))) *
        W (x + X.X U.toNNReal ω)) =
     (if U < D ∧ U.toNNReal ≤ T then
        Real.exp (-(q * (U.toNNReal : ℝ))) *
          W (x + X.X U.toNNReal ω) else 0) +
     (if (T : ℝ≥0∞) < U ∧ (T : ℝ≥0∞) < D then
        Real.exp (-(q * (T : ℝ))) * W (x + X.X T ω) else 0)) := by sorry
Source
Source twoSidedExitUpTime/DownTime definitions and accepted no-finite-tie theorem. All bounds are exact original-clock values.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me