Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 1(iii), p. 12 — the relative entropy I(ℙ′,ℙ) is lower semicontinuous on 𝒫 × 𝒫

Proved
DROOptimal.Predictor.proposition_1_iii

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

information-theoryp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relative-entropysemicontinuity

Let P\mathcal PP be the probability simplex on Ξ={1,…,d}\Xi=\{1,\dots,d\}Ξ={1,…,d}, with the topology inherited from Rd\mathbb R^dRd, and I(P′,P)∈[0,∞]I(\mathbb P',\mathbb P)\in[0,\infty]I(P′,P)∈[0,∞] the relative entropy (Definition 5, with 0log⁡(0/p)=00\log(0/p)=00log(0/p)=0 and p′log⁡(p′/0)=+∞p'\log(p'/0)=+\inftyp′log(p′/0)=+∞ for p′>0p'>0p′>0). Then

(P′,P) ⟼ I(P′,P)is lower semicontinuous on P×P.(\mathbb P',\mathbb P)\ \longmapsto\ I(\mathbb P',\mathbb P)\quad\text{is lower semicontinuous on }\mathcal P\times\mathcal P .(P′,P) ⟼ I(P′,P)is lower semicontinuous on P×P.

Lower semicontinuity makes the relative entropy balls {P:I(P′,P)≤r}\{\mathbb P: I(\mathbb P',\mathbb P)\le r\}{P:I(P′,P)≤r} closed, hence compact, which is why the supremum defining c^r\hat c_rc^r​ in (10) is attained.

Formalization Note The function is EReal-valued and P×P\mathcal P\times\mathcal PP×P carries the product of the subspace topologies.

Preamble
import Mathlib
import Definitions.Def_DROOptimal_Predictor_Setting
Formal statement
namespace DROOptimal.Predictor

/-- Proposition 1(iii) (Lower semicontinuity), p. 12: the relative entropy I(ℙ′, ℙ) is lower
semicontinuous in (ℙ′, ℙ) ∈ 𝒫 × 𝒫 (product of the relative topologies of 𝒫). -/
theorem proposition_1_iii {d : ℕ} :
    LowerSemicontinuous (fun q : Δ d × Δ d => relEntropy q.1 q.2) := by sorry

end DROOptimal.Predictor
Source
Van Parys, Mohajerin Esfahani & Kuhn, From Data to Decisions: Distributionally Robust Optimization is Optimal, arXiv:1704.04118v3, p. 12, Proposition 1(iii)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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