Statements
Source excerpts; proofs omitted. recall restates an existing declaration; #check records an expression, not its inferred type.
Theorem 4.12 is source-facing in the chapter Fenchel-conjugacy API. Its owner declarations
are already upstream: IsProperExtendedRealFunction and is_convex_function from Chapter 2,
the notation owner ∂ f(x) from Chapter 3, conjugate_function from Chapter 4, and the bridge/view
theorems pairing_eq_add_conjugate_iff_eval_mem_subdifferential_conjugate,
conjugate_function_eq_iff_isMaxOn_pairing_sub_function, and
self_eq_pairing_sub_conjugate_iff_isMaxOn_dual_of_proper_closed_convex from the preceding theorem
files. The only extra view language used here is Mathlib's IsMaxOn/IsMinOn over Set.univ, so
this file states only the textbook argmax/argmin characterizations on top of those owners instead
of introducing parallel local set wrappers.
The nonempty-effective-domain part of properness is semantically active for parts (1) and (3):
without it, f ≡ ⊤ gives an empty subdifferential ∂ f(x) but every dual vector is an
argmax/minimizer on the right-hand side. For parts (2) and (4), properness is also semantically
active because the
owner bridge
pairing_eq_add_conjugate_iff_eval_mem_subdifferential_conjugate
requires IsProperExtendedRealFunction f: if f ≡ ⊥, then ∂ (conjugate_function f)(y) is empty
while the primal argmax/image set is nonempty. Lower semicontinuity and convexity are still needed
there to identify f** with f.
recall IsProperExtendedRealFunction
Source context
universe u
variable {E : Type u} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]recall is_convex_function
Source context
universe u
variable {E : Type u} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]recall subdifferential
Source context
universe u
variable {E : Type u} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]recall conjugate_function
Source context
universe u
variable {E : Type u} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]recall IsMaxOn
Source context
universe u
variable {E : Type u} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]recall IsMinOn
Source context
universe u
variable {E : Type u} [NormedAddCommGroup E] [NormedSpace ℝ E] [FiniteDimensional ℝ E]Helper for Theorem 4.12: y ∈ ∂ f(x) is equivalent to y maximizing
y' ↦ y' x - f*(y') on the whole dual space.
Helper for Theorem 4.12: on Set.univ, maximizing the negation of an objective is equivalent
to minimizing the original objective.
Theorem 4.12 (1): for a proper closed convex extended-real-valued function, the
subdifferential at x is exactly the set of dual vectors maximizing y' ↦ y' x - f*(y').
Theorem 4.12 (3): for a proper closed convex extended-real-valued function, the
subdifferential at the origin is exactly the minimizer set of the conjugate f*.
Theorem 4.12 (2): for a proper closed convex extended-real-valued function,
the subdifferential of the conjugate at y is the image under the canonical double-dual map
Module.Dual.eval ℝ E of
the maximizers of x' ↦ y x' - f(x').
Companion theorem for Theorem 4.12 (2): the canonical double-dual image of x lies in
∂(f∗)(y) exactly when x maximizes x' ↦ y x' - f(x') on the whole space.
Theorem 4.12 (4): for a proper closed convex extended-real-valued function,
at the zero dual vector the subdifferential of the conjugate is the canonical double-dual image
of the minimizer set of f.