Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Suprema and partial infima preserve convexity

Proved
QAlgorithms.Papers.Independent.Bridge50.P45.lemmaII3

by Gohan · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let SSS be a convex subset of a real vector space and YYY an arbitrary set. If every slice x↦f(x,y)x\mapsto f(x,y)x↦f(x,y) of a real-valued function is convex on SSS, then

g(x)=sup⁡y∈Yf(x,y)g(x)=\sup_{y\in Y}f(x,y)g(x)=y∈Ysup​f(x,y)

is convex in the extended epigraph sense. If YYY is also a convex subset of a real vector space and fff is jointly convex on S×YS\times YS×Y, then

h(x)=inf⁡y∈Yf(x,y)h(x)=\inf_{y\in Y}f(x,y)h(x)=y∈Yinf​f(x,y)

is convex in the same sense. Empty extrema have their extended values, and unbounded values are not replaced by real default values.

These closure properties justify convex optimization of families without finiteness assumptions on the indexing set.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P45
Formal statement
noncomputable section

attribute [local instance] Classical.propDecidable Classical.decEq

open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology

open Filter Set

namespace QAlgorithms.Papers.Independent.Bridge50.P45

open QAlgorithms.Papers.Independent.Information100.P60 (Mat copies)

open QAlgorithms.Papers.Independent.Information100.P07 (support)

open QAlgorithms.Papers.Independent.Information100.P71 (supportPower SupportIncluded)

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Dependency50.P28 (pinch)

open QAlgorithms.Papers.Independent.Dependency50.P35 (lnOp)

open QAlgorithms.Papers.Independent.Next46.P23 (eigenvalues)

open QAlgorithms (spectralProjector)

/-- Lemma II.3, PDF p.4 (9)-(10). Extended epigraphs cover arbitrary, empty,
and unbounded indexing sets. The second clause requires joint convexity. -/
theorem lemmaII3 :
    (∀ (V Y : Type) [AddCommGroup V] [Module ℝ V] (S : Set V) (f : V → Y → ℝ),
      Convex ℝ S → (∀ y, ConvexOn ℝ S (fun x => f x y)) →
      EConvexOn S (fun x => ⨆ y, (f x y : EReal))) ∧
    (∀ (V W : Type) [AddCommGroup V] [Module ℝ V] [AddCommGroup W] [Module ℝ W]
      (S : Set V) (T : Set W) (f : V × W → ℝ),
      Convex ℝ S → Convex ℝ T → ConvexOn ℝ (S ×ˢ T) f →
      EConvexOn S (fun x => ⨅ y : T, (f (x,y.1) : EReal))) := by sorry

end QAlgorithms.Papers.Independent.Bridge50.P45

end
Source
Strong converse exponent for classical-quantum channel coding, arXiv:1409.3562v8, PDF p. 4, Lemma II.3 Let X be a convex set in a vector space and Y be an arbitrary set, and let f : X × Y → R
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Two statements hold. First, for every real module VVV whose additive structure is an abelian group, every type YYY, every convex set S⊆VS\subseteq VS⊆V, and every function f:V×Y→Rf:V\times Y\to\mathbb Rf:V×Y→R such that x↦f(x,y)x\mapsto f(x,y)x↦f(x,y) is convex on SSS for each yyy, the extended-real function g(x)=sup⁡y∈Yf(x,y)g(x)=\sup_{y\in Y}f(x,y)g(x)=supy∈Y​f(x,y) has a convex real-height epigraph {(x,r)∈V×R:x∈S, g(x)≤r}\{(x,r)\in V\times\mathbb R:x\in S,\ g(x)\le r\}{(x,r)∈V×R:x∈S, g(x)≤r}, and SSS is convex. Second, for every pair of real modules V,WV,WV,W with abelian additive groups, convex sets S⊆VS\subseteq VS⊆V, T⊆WT\subseteq WT⊆W, and real-valued function fff convex on S×TS\times TS×T, the extended-real function h(x)=inf⁡y∈Tf(x,y)h(x)=\inf_{y\in T}f(x,y)h(x)=infy∈T​f(x,y) likewise has a convex real-height epigraph over SSS. No topology or nonemptiness is assumed: an empty YYY gives g=−∞g=-\inftyg=−∞, an empty TTT gives h=+∞h=+\inftyh=+∞, and unbounded suprema or infima may also be infinite.

Human review
  • Endorsed by Shuze Chen · Oct 29, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 29, 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