Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

§2.b — the dual of f ∈ Γ₀(H) lies in Γ₀(H), and its dual is f

Proved
MoreauProx.Decomposition.conj_gammaZero_and_conj_conj

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

conjugate-dualityconvex-analysisfenchel-moreaup2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let HHH be a real Hilbert space and f∈Γ0(H)f \in \Gamma_0(H)f∈Γ0​(H). Let g=f∗g = f^{*}g=f∗ be the dual function of fff, g(y)=sup⁡x∈H[(x∣y)−f(x)]g(y) = \sup_{x\in H}[(x\mid y) - f(x)]g(y)=supx∈H​[(x∣y)−f(x)]. Then

  1. g∈Γ0(H)g \in \Gamma_0(H)g∈Γ0​(H);
  2. fff is the dual function of ggg: for every x∈Hx \in Hx∈H,
f(x)=sup⁡y∈H [(x∣y)−g(y)].f(x) = \sup_{y \in H}\,\big[(x \mid y) - g(y)\big].f(x)=y∈Hsup​[(x∣y)−g(y)].

Together these say that f↦f∗f \mapsto f^{*}f↦f∗ is an involution of Γ0(H)\Gamma_0(H)Γ0​(H) (the Fenchel–Moreau theorem). It is what makes the relation "fff and ggg are dual to each other" symmetric, and what makes proxg\mathrm{prox}_gproxg​ meaningful in Moreau's decomposition theorem.

Preamble
import Mathlib
import Definitions.Def_MoreauProx_Decomposition_ConvexDuality
Formal statement
namespace MoreauProx.Decomposition

open scoped InnerProductSpace

/-- Moreau 1965, §2.b, p. 276: the dual of `f ∈ Γ₀(H)` belongs to `Γ₀(H)`, and `f` is the
dual of its dual. -/
theorem conj_gammaZero_and_conj_conj {H : Type*} [NormedAddCommGroup H]
    [InnerProductSpace ℝ H] [CompleteSpace H] (f : H → EReal) (hf : GammaZero f) :
    GammaZero (conj f) ∧ conj (conj f) = f := by sorry

end MoreauProx.Decomposition
Source
Moreau, Proximité et dualité dans un espace hilbertien, Bull. Soc. Math. France 93 (1965), pp. 276–277, §2.b (after (2.2))
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let HHH be a real Hilbert space. Let f:H→[−∞,+∞]f : H \to [-\infty,+\infty]f:H→[−∞,+∞] belong to Γ0(H)\Gamma_0(H)Γ0​(H), meaning:

  • fff never equals −∞-\infty−∞;
  • fff is finite at some point;
  • the epigraph {(x,r)∈H×R:f(x)≤r}\{(x,r) \in H\times\mathbb R : f(x)\le r\}{(x,r)∈H×R:f(x)≤r} is convex;
  • fff is lower semicontinuous.

Let f∗(y)=sup⁡x∈H(⟨x,y⟩−f(x))f^*(y) = \sup_{x\in H}(\langle x,y\rangle - f(x))f∗(y)=supx∈H​(⟨x,y⟩−f(x)) be the conjugate, computed in the extended reals, where terms with f(x)=+∞f(x) = +\inftyf(x)=+∞ equal −∞-\infty−∞.

The theorem asserts two things together:

  1. f∗∈Γ0(H)f^* \in \Gamma_0(H)f∗∈Γ0​(H). So f∗f^*f∗ never equals −∞-\infty−∞, is finite at some point, has a convex epigraph in H×RH \times \mathbb RH×R, and is lower semicontinuous.
  2. The biconjugate equals fff at every point:
f∗∗(x)  =  sup⁡y∈H(⟨x,y⟩−f∗(y))  =  f(x)for all x∈H.f^{**}(x) \;=\; \sup_{y\in H}\big(\langle x,y\rangle - f^*(y)\big) \;=\; f(x) \qquad \text{for all } x \in H.f∗∗(x)=y∈Hsup​(⟨x,y⟩−f∗(y))=f(x)for all x∈H.

This includes the points where f(x)=+∞f(x) = +\inftyf(x)=+∞.

Degenerate case. When H={0}H = \{0\}H={0}, f(0)=cf(0) = cf(0)=c is real. The statement then says that f∗(0)=−cf^*(0) = -cf∗(0)=−c is real and f∗∗(0)=cf^{**}(0) = cf∗∗(0)=c.

Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me