Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.4, p. 22 — a continuous bounded cylindrical claim f = F(B_{t_1}, …, B_{t_d}) belongs to Γ

Proved
UncertainPricing.Superrep.lemma_5_4

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1path-dependent-optionsstone-cechsuperreplication

Let P\mathbf PP be a set of martingale measures on Ω\OmegaΩ satisfying H(μˉ)H(\bar\mu)H(μˉ​), with μˉ\bar\muμˉ​ Hölder continuous. If fff is a continuous and bounded cylindrical function, f=F(Bt1,…,Btd)f=F(B_{t_1},\dots,B_{t_d})f=F(Bt1​​,…,Btd​​) with FFF bounded continuous, then f∈Γf\in\Gammaf∈Γ:

EQf~=EQ∗ffor every Q∈Q.E_Q\tilde f=E_{Q^*}f\qquad\text{for every }Q\in\mathcal Q .EQ​f~​=EQ∗​ffor every Q∈Q.

European options on finitely many dates are therefore covered by the pricing formula of Theorem 3.1.

Formalization Note. Q∗Q^*Q∗ is the law of any continuous modification of B~\tilde BB~ under QQQ. d=0d=0d=0 is allowed.

Preamble
import Mathlib
import Definitions.Def_UncertainPricing_Superrep_Setting
import Definitions.Def_UncertainPricing_Superrep_Compact
Formal statement
namespace UncertainPricing.Superrep

open MeasureTheory Filter Topology BoundedContinuousFunction

theorem lemma_5_4 (T : ℝ) (hT : 0 < T) (μU : StieltjesFunction ℝ) (hμU : IsDistFn T μU)
    (Ps : Set (Measure (Ω T))) (hPs : ∀ P ∈ Ps, IsMartingaleMeasure P ∧ HypU μU P)
    (hHol : IsHolder T μU) (f : Ω T →ᵇ ℝ) (hf : IsCylindrical f) : InGamma Ps μU f := by sorry

end UncertainPricing.Superrep
Source
Denis & Martini, arXiv:math/0607111v1, Lemma 5.4, p. 22
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 2026

    Confirmed by the mission captain (proposal self-audit).

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