Proposition 1, p. 10 — the interpolated LPM F̂^(2)_{D,λ} lies above F^(2)_λ everywhere
ProvedAlmostSSDPortfolio.AASSD.proposition_1discretizationlower-partial-momentp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-dominance
In the setting of §2–§3.2, let be a discretization scheme containing every benchmark return, a portfolio, and the piecewise-linear interpolation (2) of at the grid points. Then
Consequently the approximate SSD violation is never smaller than the true one, which is the inequality (12a)→(12b) of the proof of Theorem 1.
Formalization Note. Outside the formalization sets (see the definition file), so the inequality there is an equality; the content is on .
Preamble
import Mathlib import Definitions.Def_AlmostSSDPortfolio_AASSD_Model open MeasureTheory Set
Formal statement
namespace AlmostSSDPortfolio.AASSD
theorem proposition_1 {n T Tb : ℕ} (S : Setting n T Tb) (hS : S.Standing)
(D : Discretization S) (lam : Fin n → ℝ) (hlam : lam ∈ simplex n) :
∀ x : ℝ, S.F2 lam x ≤ D.hatF2 lam x := by sorry
end AlmostSSDPortfolio.AASSD
Source
Luo, Chen & Jaillet, Portfolio Optimization Based on Almost Second-Degree Stochastic Dominance, accepted manuscript (April 2024) of Management Science doi:10.1287/mnsc.2022.01092, p. 10, Proposition 1
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.