Equations
Instances For
A pointwise reformulation of fenchelConjugateBilin p f x★ ≤ μ★.
In finite dimensions, PointedCone.dual p s is a closed set.
Slice characterization for the lifted-epigraph cone (core of Theorem 14.4).
Key inclusion for Theorem 14.3: any functional nonpositive on the closed cone generated by the
0-sublevel set {x | f x ≤ 0} lies in the closed cone generated by the 0-sublevel set of the
Fenchel conjugate {φ | f* φ ≤ 0}.
Theorem 14.3. Let f be a closed proper convex function such that f 0 > 0 > inf f.
Then the closed convex cones generated by the sublevel sets {x | f x ≤ 0} and
{x★ | f* x★ ≤ 0} are polar to each other, where f* denotes the Fenchel–Legendre conjugate
of f with respect to the evaluation pairing.
Coordinate involution used in Theorem 14.4: swapNeg (λ, x, μ) = (-μ, x, -λ).
Equations
Instances For
Elements of the dual of the lifted-epigraph cone have nonpositive last coordinate.
Cone-slicing reconstruction for the lifted-epigraph polar (reverse inclusion in Theorem 14.4).
If swapNeg z lies in the polar of the lifted-epigraph cone, then z lies in the closure of
the cone generated by the epigraph of the Fenchel conjugate.
Theorem 14.4. Let f be a closed proper convex function on ℝⁿ. Let K be the convex cone
generated by points (1, x, μ) ∈ ℝ × ℝⁿ × ℝ such that μ ≥ f x, and let K★ be the convex cone
generated by points (1, x★, μ★) such that μ★ ≥ f★ x★, where f★ is the Fenchel–Legendre
conjugate of f. Then
cl K★ = { (λ★, x★, μ★) | (-μ★, x★, -λ★) ∈ Kᵒ }.
In this formalization, f★ is fenchelConjugateBilin p f for a chosen bilinear pairing p on E,
and Kᵒ is modeled as PointedCone.dual (-q) K for a chosen bilinear pairing q on
ℝ × E × ℝ.
Sanity check for Theorem 14.5: mathlib's gauge is real-valued, so it cannot match a support
function that can take the value ⊤ (e.g. for C = {0}).