Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 11 — for separable 𝒳₂, ρ is the supremum of countably many weakly* ℱ₁-measurable selections of 𝒜 (4.7)

Disproved
CondRiskMap.Repr.lemma_1

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

conditional-riskmeasurable-selectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1risk-enveloperisk-mapping

Let X2,Y2\mathcal X_2,\mathcal Y_2X2​,Y2​ be paired locally convex spaces over F1⊂F2\mathcal F_1\subset\mathcal F_2F1​⊂F2​ satisfying (C) and (C′), with X2\mathcal X_2X2​ separable (it has a countable dense subset). Let ρ\rhoρ be a positively homogeneous, lower semicontinuous conditional risk mapping, so that the representation (3.8) holds with the risk envelope A(ω)\mathcal A(\omega)A(ω). Then there is a sequence μi\mu^iμi, i∈Ni\in\mathbb Ni∈N, of weakly* F1\mathcal F_1F1​-measurable selections of A\mathcal AA (that is, μωi∈A(ω)\mu^i_\omega\in\mathcal A(\omega)μωi​∈A(ω) for every ω\omegaω, and ω↦⟨μωi,X⟩\omega\mapsto\langle\mu^i_\omega,X\rangleω↦⟨μωi​,X⟩ is F1\mathcal F_1F1​-measurable for every X∈X2X\in\mathcal X_2X∈X2​) such that

[ρ(X)](ω)=sup⁡i∈N⟨μωi,X⟩(4.7)[\rho(X)](\omega)=\sup_{i\in\mathbb N}\langle\mu^i_\omega,X\rangle\qquad(4.7)[ρ(X)](ω)=i∈Nsup​⟨μωi​,X⟩(4.7)

for all X∈X2X\in\mathcal X_2X∈X2​ and ω∈Ω\omega\in\Omegaω∈Ω.

The lemma replaces the possibly uncountable envelope by countably many measurable selections; combined with fixed points of the operators Qμi\mathbb Q_{\mu^i}Qμi​ it yields the conditional expectation representation of Theorem 2.

Formalization Note "The representation (3.8) holds" is not a separate hypothesis: under the stated hypotheses it is the content of the milestone envelope_representation_3_8. The supremum is stated with IsLUB.

Preamble
import Mathlib
import Definitions.Def_CondRiskMap_Repr_Setting
Formal statement
namespace CondRiskMap.Repr

theorem lemma_1 {Ω : Type*} [MeasurableSpace Ω] {𝒳 𝒴 : Type*}
    [AddCommGroup 𝒳] [Module ℝ 𝒳] [TopologicalSpace 𝒳]
    [IsTopologicalAddGroup 𝒳] [ContinuousSMul ℝ 𝒳] [LocallyConvexSpace ℝ 𝒳]
    [AddCommGroup 𝒴] [Module ℝ 𝒴] [TopologicalSpace 𝒴]
    [IsTopologicalAddGroup 𝒴] [ContinuousSMul ℝ 𝒴] [LocallyConvexSpace ℝ 𝒴]
    [TopologicalSpace.SeparableSpace 𝒳]
    (S : PairedSpaces Ω 𝒳 𝒴) (hC : CondC S) (hC' : CondC' S)
    (ρ : 𝒳 → 𝒳) (hρ : IsCondRiskMapping S ρ) (hph : PosHomogeneous ρ) (hlsc : IsLsc S ρ) :
    ∃ κ : ℕ → Ω → 𝒴, (∀ i, IsSelection S ρ (κ i)) ∧
      ∀ X ω, IsLUB (Set.range fun i => pair (S.toMeasure (κ i ω)) (S.toFun X)) (ρω S ρ ω X) := by sorry

end CondRiskMap.Repr
Source
Ruszczyński, Shapiro, Conditional risk mappings, preprint dated February 21, 2004, p. 11, Lemma 1, (4.7)
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