Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Fenchel conjugate of a proper closed convex function is proper closed convex

Statement

If f:Rn→(−∞,+∞] is proper, closed and convex, then its conjugate f∗ from Fenchel conjugate of an extended-real function is also proper, closed and convex. The affine-minorant result cited below is used only to prove properness; closedness and convexity follow directly from the supremum formula.

Facts & Assumptions

Given: Proper closed convex f on Rn.

[A1]

The function f is proper, closed and convex.

[F1]

Fenchel conjugate of an extended-real function: f∗(s)=sup⁡x(⟨s,x⟩−f(x)).

[F2]

A proper closed convex function has an affine minorant: some a∈Rn,b∈R satisfy f(x)≥⟨a,x⟩+b for every x.

[F3]

Proper closed convex extended-real functions on Rn: f has a nonempty effective domain, is convex, and has a closed epigraph.

[F5]

Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation: ∣⟨u,v⟩∣≤∥u∥2∥v∥2, and for n≥1, d2(u,v)=∥u−v∥2.

Proof

1.1A1F1F2F3choose

Choose x0∈dom⁡f by [F3]. The affine minorant [F2] gives ⟨a,x⟩−f(x)≤−b for every x with finite f(x), so f∗(a)≤−b<+∞. The term at x0 gives f∗(a)≥⟨a,x0⟩−f(x0)>−∞. Thus f∗ is proper.

1.2A1F1F4F5algebra

If n=0, [F4] gives the singleton R0={0} and properness makes f(0) finite, so f∗(0)=−f(0) is proper, closed and convex directly. Hence assume n≥1. For each x∈dom⁡f and s,s′∈Rn, [F5] gives ∣⟨s,x⟩−⟨s′,x⟩∣≤∥s−s′∥2∥x∥2=d2(s,s′)∥x∥2. Thus s↦⟨s,x⟩−f(x) is finite continuous affine. A pointwise supremum of these affine functions is convex: apply each affine function to (1−θ)s0+θs1, bound by (1−θ)f∗(s0)+θf∗(s1), then take the supremum.

2.1A1F1F3F4F5step 1.2algebra∎

The epigraph of f∗ is the intersection, over x∈dom⁡f, of the closed half-spaces {(s,t):t≥⟨s,x⟩−f(x)}. Each half-space is closed because its defining affine function is continuous by step 1.2, and any intersection of closed sets is closed. Hence f∗ is closed in the epigraph convention of [F3].

Depends on

Used by

Dependency tree · two levels

29 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources