Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Gaussian zero-jump cutoff supplies all model and analytical premises of the canonical unbounded-variation verification core

Proved
AvramDividend.Classical.gaussian_cutoff_canonical_analytic_hypotheses

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

counterexample-audithjbstochastic-verificationunbounded-variation

For a canonical spectrally negative Lévy process with strictly positive Gaussian coefficient, zero Lévy jump measure, drift coefficient −1 and integrable X1, the zero-extended affine candidate meets all model, smoothness, generator and gradient hypotheses of the canonical unbounded-variation stochastic verification core at q=1, for any capital cap. The remaining assumptions concern the chosen dividend strategy and ruin-time reward.

Preamble
import Mathlib.Analysis.Calculus.ContDiff.Operations
import Mathlib.MeasureTheory.Integral.Bochner.Basic
import Mathlib.Tactic
import Definitions.Def_AvramDividend_Classical_SpectrallyNegativeLevy
import Theorems.Thm_AvramDividend_Classical_affine_cutoff_continuous_nonnegative_smooth_positive
import Theorems.Thm_AvramDividend_Classical_affine_cutoff_contDiffOn_positive_below_cap
import Theorems.Thm_AvramDividend_Classical_zero_jump_affine_cutoff_HJB_drift_neg_one
import Theorems.Thm_AvramDividend_Classical_positive_gaussian_standing_and_unbounded_variation

open MeasureTheory Set
open scoped NNReal ENNReal
open AvramDividend.Classical
Formal statement
theorem AvramDividend.Classical.gaussian_cutoff_canonical_analytic_hypotheses
    {Ω : Type*} [mΩ : MeasurableSpace Ω] {P : Measure Ω}
    {𝓕 : Filtration ℝ≥0 mΩ}
    (X : SpectrallyNegativeLevy P 𝓕) (hσ : 0 < X.σ)
    (hI : Integrable (X.X 1) P) (hν : X.ν = 0) (hc : X.c = -1)
    (C : ℝ≥0∞) :
    X.Standing ∧ ¬ X.BoundedVariation ∧
    ContinuousOn (fun z : ℝ => if z < 0 then 0 else z - 1) (Ici (0 : ℝ)) ∧
    (∀ y : ℝ, y < 0 → (fun z : ℝ => if z < 0 then 0 else z - 1) y = 0) ∧
    ContDiffOn ℝ 2 (fun z : ℝ => if z < 0 then 0 else z - 1) {y : ℝ | 0 < y ∧ ENNReal.ofReal y < C} ∧
    (∀ y : ℝ, 0 < y → ENNReal.ofReal y < C →
      X.GeneratorIntegrable (fun z : ℝ => if z < 0 then 0 else z - 1) y ∧
        X.generator (fun z : ℝ => if z < 0 then 0 else z - 1) y - (1 : ℝ) * (fun z : ℝ => if z < 0 then 0 else z - 1) y ≤ 0) ∧
    (∀ y : ℝ, 0 < y → ENNReal.ofReal y < C →
      1 ≤ deriv (fun z : ℝ => if z < 0 then 0 else z - 1) y) := by sorry
Source
Avram, Palmowski and Pistorius (2007), Proposition 4(i) and exact Prove2Me canonical UBV core; preceding verified Gaussian-cutoff lemmas.

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