Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Example 1 — the sum of a linear-system solution is a martingale

Proved
AntonelliBFSDE.SingularExample.example_1_martingale

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

backward-stochastic-differential-equationmartingalep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (U,V)(U,V)(U,V) solve the linear system (3.8)–(3.9) on [0,T][0,T][0,T] under the assumptions of Example 1. There is a jointly measurable adapted process NNN such that, for each t≤Tt\le Tt≤T,

Nt=J0+EP ⁣[∫0T(Us+Vs) ds+Y∣Ft]N_t=J_0+E_P\!\left[\int_0^T(U_s+V_s)\,ds+Y\mid\mathcal F_t\right]Nt​=J0​+EP​[∫0T​(Us​+Vs​)ds+Y∣Ft​]

almost surely; NNN is an integrable martingale on [0,T][0,T][0,T]; and U+V=NU+V=NU+V=N in L1(dt⊗P)L^1(dt\otimes P)L1(dt⊗P). This identifies the constant mean used in the next step.

Formalization Note A martingale means Ns=EP[Nt∣Fs]N_s=E_P[N_t\mid\mathcal F_s]Ns​=EP​[Nt​∣Fs​] almost surely whenever s≤t≤Ts\le t\le Ts≤t≤T, with each NtN_tNt​ integrable and Ft\mathcal F_tFt​-measurable. Equality with U+VU+VU+V is dt⊗Pdt\otimes Pdt⊗P-almost everywhere, matching the paper's L1L^1L1 solution notion.

Preamble
import Mathlib
import Definitions.Def_AntonelliBFSDE_SingularExample_Setting

open MeasureTheory
open scoped NNReal ENNReal
Formal statement
namespace AntonelliBFSDE.SingularExample

/-- Example 1, p. 791: adding (3.8) and (3.9) gives a martingale.
Equality with `U + V` is in `L¹(dt ⊗ P)`; the martingale law is for
every `s ≤ t ≤ T` up to `P`-almost-sure equality. -/
theorem example_1_martingale {Ω : Type*} [mΩ : MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P]
    (𝓕 : Filtration ℝ≥0 mΩ) (T : ℝ≥0) (hT : 0 < T)
    (J₀ Y : Ω → ℝ) (U V : ℝ≥0 → Ω → ℝ)
    (husual : AntonelliBFSDE.BackwardForward.UsualHypotheses 𝓕 P)
    (hJmeas : Measurable[𝓕 0] J₀) (hJint : Integrable J₀ P)
    (hJpos : ∀ᵐ ω ∂P, 0 < J₀ ω)
    (hYmeas : Measurable[𝓕 T] Y) (hYint : Integrable Y P)
    (hYpos : ∀ᵐ ω ∂P, 0 < Y ω)
    (hsol : IsDtSystemSolution 𝓕 P T J₀ (fun u v => u + v)
      (fun u v => u + v) Y U V) :
    ∃ N : ℝ≥0 → Ω → ℝ,
      Measurable (Function.uncurry N) ∧
      (∀ t ≤ T, Integrable (N t) P ∧ StronglyMeasurable[𝓕 t] (N t) ∧
        N t =ᵐ[P] (fun ω => J₀ ω + P[xiDt T (fun u v => u + v) Y U V 0 | 𝓕 t] ω)) ∧
      (∀ s ≤ T, ∀ t ≤ T, s ≤ t → N s =ᵐ[P] P[N t | 𝓕 s]) ∧
      L1NormDt P T (fun t ω => U t ω + V t ω - N t ω) = 0 := by sorry

end AntonelliBFSDE.SingularExample
Source
Antonelli, Backward-forward stochastic differential equations, Ann. Appl. Probab. 3(3) (1993), p. 791, Example 1, display after (3.9), https://doi.org/10.1214/aoap/1177005363
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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