Theorem 1, p. 896–897 — lower bound δ(u) ≥ f(u)/f(∞): ε-optimal admissible strategies exist
OpenSchmidliRuin.Verif.near_optimal_strategy_existsIn the setting of Schmidli's verification theorem (classical risk model with Poisson claim arrivals of rate , continuous claim law with , premium rate , investment in a Black–Scholes asset with drift and volatility , proportional reinsurance with premium rate satisfying the standing assumption of p. 891), let satisfy the analytic hypotheses of Theorem 1: on , , strictly increasing and continuous on , on , and solving the HJB equation (1) at every . Suppose as with finite.
Then, for every initial capital and every , there is an admissible strategy with surplus process from whose survival probability satisfies
This is the lower-bound half of the identity in Theorem 1 (p. 896): it says , where is the supremum of the survival probabilities over all admissible strategies. In the paper this half is obtained on p. 897 from the sentence "This yields , with equality for ", i.e. by evaluating the survival probability of the surplus process that follows the feedback strategy , ; the paper takes the existence of this process (as an admissible strategy from every ) for granted. The milestone survival_le_and_eq supplies the upper bound and the equality for every feedback process from , but not the existence of an (approximately) optimal admissible strategy, which is what this statement isolates. The -form avoids assuming that the supremum is attained.
import Mathlib import Definitions.Def_SchmidliRuin_Verif_Setting import Definitions.Def_SchmidliRuin_Verif_Model open MeasureTheory ProbabilityTheory Set Filter open scoped Topology NNReal ENNReal
namespace SchmidliRuin.Verif
theorem near_optimal_strategy_exists {Ω : Type*} [MeasurableSpace Ω] (B : RiskBasis Ω)
(hB : B.IsValid) (c mu sigma : ℝ) (hc : 0 < c) (hmu : 0 < mu) (hsigma : 0 < sigma)
(cb : ℝ → ℝ) (hcb : ReinsPremium c cb)
(f : ℝ → ℝ) (hf : IsHJBSolution c B.lam mu sigma cb B.ν f)
(L : ℝ) (hL : Tendsto f atTop (𝓝 L)) (u : ℝ) (hu : 0 ≤ u) (ε : ℝ) (hε : 0 < ε) :
∃ A b X : ℝ≥0 → Ω → ℝ, IsAdmissible B c mu sigma cb u A b X ∧
f u / L - ε < survivalProb B X := by sorry
end SchmidliRuin.Verif