Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.6, p. 17 — a.s. Ef and every E^νf are proper, l.s.c., with domain S on which they are finite

Proved
DupacovaWets.Consistency.expectFn_proper_lsc

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

lower-semicontinuityp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

The standing data are those of §3: Ξ\XiΞ is a Polish space with its Borel σ\sigmaσ-field, PPP a probability measure on it, (Z,F,μ)(Z,\mathcal F,\mu)(Z,F,μ) a probability space with an increasing sequence of sub-σ\sigmaσ-fields F1⊆F2⊆⋯⊆F\mathcal F^1\subseteq\mathcal F^2\subseteq\dots\subseteq\mathcal FF1⊆F2⊆⋯⊆F, Pν(⋅,ζ)P^\nu(\cdot,\zeta)Pν(⋅,ζ) random probability measures on Ξ\XiΞ, and f:Rn×Ξ→(−∞,∞]f:\mathbb R^n\times\Xi\to(-\infty,\infty]f:Rn×Ξ→(−∞,∞] an integrand with domain S×ΞS\times\XiS×Ξ; fff, SSS and the measures satisfy Assumptions 3.4 and 3.5. Write Ef(x)=∫Ξf(x,ξ) P(dξ)Ef(x)=\int_\Xi f(x,\xi)\,P(d\xi)Ef(x)=∫Ξ​f(x,ξ)P(dξ) and Eνf(x,ζ)=∫Ξf(x,ξ) Pν(dξ,ζ)E^\nu f(x,\zeta)=\int_\Xi f(x,\xi)\,P^\nu(d\xi,\zeta)Eνf(x,ζ)=∫Ξ​f(x,ξ)Pν(dξ,ζ), with the +∞+\infty+∞ convention of p. 10.

Under Assumptions 3.4 and 3.5 there is Z0∈FZ_0\in\mathcal FZ0​∈F with μ(Z0)=1\mu(Z_0)=1μ(Z0​)=1 such that for every ζ∈Z0\zeta\in Z_0ζ∈Z0​ the functions EfEfEf and Eνf(⋅,ζ)E^\nu f(\cdot,\zeta)Eνf(⋅,ζ), ν=1,2,…\nu=1,2,\dotsν=1,2,…, are proper and lower semicontinuous, and

S=dom⁡Ef=dom⁡Eνf(⋅,ζ),S=\operatorname{dom} Ef=\operatorname{dom} E^\nu f(\cdot,\zeta),S=domEf=domEνf(⋅,ζ),

with all these expectation functionals finite on SSS.

The lemma shows that the true and the estimated problems are well posed: their objectives are proper l.s.c. functions with the same effective domain SSS, the feasible set.

Formalization Note Lean writes Rn\mathbb R^nRn as EuclideanSpace ℝ (Fin n), and the sample index is shifted: Lean's Pν k ζ and 𝔽 k are the paper's Pk+1(⋅,ζ)P^{k+1}(\cdot,\zeta)Pk+1(⋅,ζ) and Fk+1\mathcal F^{k+1}Fk+1, while P=P0P = P^0P=P0 is kept as the separate argument P. The paper also says that Ξ\XiΞ is the support of PPP; this hypothesis is not used in the proofs of §3 and is omitted, which makes the statement stronger.

Preamble
import Mathlib
import Definitions.Def_DupacovaWets_Consistency_expect
import Definitions.Def_DupacovaWets_Consistency_ExtendedFunctions
import Definitions.Def_DupacovaWets_Consistency_Assumptions
open MeasureTheory Filter Topology
Formal statement
namespace DupacovaWets.Consistency

/-- Dupačová–Wets (WP-86-41), p. 17, Lemma 3.6: under Assumptions 3.4 and 3.5 there is
`Z₀ ∈ F` with `μ(Z₀) = 1` such that for every `ζ ∈ Z₀`, `Ef` and every `E^ν f(·, ζ)` are
proper lower semicontinuous functions with `S = dom Ef = dom E^ν f(·, ζ)`, finite on `S`.
(`Pν k` is the paper's `P^{k+1}`.) -/
theorem expectFn_proper_lsc {n : ℕ} {Ξ : Type*} [TopologicalSpace Ξ] [PolishSpace Ξ] [MeasurableSpace Ξ] [BorelSpace Ξ]
    (P : Measure Ξ) [IsProbabilityMeasure P]
    {Z : Type*} [mZ : MeasurableSpace Z] (μ : Measure Z) [IsProbabilityMeasure μ]
    (𝔽 : Filtration ℕ mZ) (Pν : ℕ → Z → Measure Ξ)
    (f : EuclideanSpace ℝ (Fin n) → Ξ → EReal) (S : Set (EuclideanSpace ℝ (Fin n)))
    (h34 : Assumption3_4 f S) (h35 : Assumption3_5 f S P μ 𝔽 Pν) :
    ∃ Z₀ : Set Z, MeasurableSet Z₀ ∧ μ Z₀ = 1 ∧ ∀ ζ ∈ Z₀,
      (IsProperFn (expectFn P f) ∧ LowerSemicontinuous (expectFn P f) ∧
        effDom (expectFn P f) = S ∧ ∀ x ∈ S, expectFn P f x ≠ ⊥ ∧ expectFn P f x ≠ ⊤) ∧
      ∀ k, IsProperFn (expectFn (Pν k ζ) f) ∧ LowerSemicontinuous (expectFn (Pν k ζ) f) ∧
        effDom (expectFn (Pν k ζ) f) = S ∧
        ∀ x ∈ S, expectFn (Pν k ζ) f x ≠ ⊥ ∧ expectFn (Pν k ζ) f x ≠ ⊤ := by sorry

end DupacovaWets.Consistency
Source
Dupačová & Wets, IIASA Working Paper WP-86-41 (Aug. 1986), p. 17, Lemma 3.6
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

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