Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

A coercive Fenchel tilt attains its minimum and conjugate supremum

Statement

Let d≥1 be an integer, let f:Rd→R‾ be closed, proper, and convex, and let p∈Rd. Define g(x)=f(x)−⟨p,x⟩. Assume g is coercive, meaning that for every M∈R there is R>0 such that ∥x∥2≥R implies g(x)>M. Then g has a finite global minimum at some x∗∈dom⁡f. The supremum defining f∗(p) is finite and attained at x∗, and p∈∂f(x∗). No uniqueness is asserted.

Facts & Assumptions

Given: The function conventions of Proper, convex, and lower-semicontinuous extended-real functions on Euclidean space, the Fenchel definitions of Fenchel conjugate, biconjugate, and subdifferential, and the coercivity condition in the Statement.

[L1]

Extended-real convexity and lower semicontinuity are characterized by the epigraph: the epigraph is closed if and only if every weak sublevel set is closed, equivalently if and only if the function is lower semicontinuous.

[L2]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn makes the shear T(x,r)=(x,r+⟨p,x⟩) linear, and Every Euclidean linear map has a unique matrix and satisfies ∥Lh∥2≤K∥h∥2 for some K≥0 supplies K≥0 such that ∥Tz−Tz′∥2≤K∥z−z′∥2 for all z,z′∈Rd+1.

[L4]

A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection: a family of closed subsets of a compact metric space with the finite intersection property has nonempty intersection.

[L5]

Every nonempty set bounded below has an infimum and Greatest lower bound (infimum): every nonempty real set bounded below has an infimum; Epsilon characterisation of the infimum gives a point below m+ε for every ε>0.

[L6]

Every nonempty finite set of reals has a maximum and a minimum: every nonempty finite set of real numbers has a maximum.

[L7]

Fenchel inequality and its equality condition: equality in Fenchel's inequality at a finite point is equivalent to the subgradient inequality.

Proof

technique · direct
1.1givenL3choose

Since f is proper, choose x0∈dom⁡f and put c=g(x0)∈R. By coercivity, first choose a radius R0>0 such that g(x)>c+1 whenever ∥x∥2≥R0, then enlarge it to R>max⁡{R0,∥x0∥2}; the same implication holds for this R. Let K={x:∥x∥2≤R}; it is nonempty, closed, bounded, and therefore compact by [L3].

1.2L1L2givenalgebra

The epigraph of g is T−1(epi⁡f), because g(x)≤r exactly when f(x)≤r+⟨p,x⟩. By [L1], epi⁡f is closed. Fix z∉T−1(epi⁡f); openness of the complement of epi⁡f gives ε>0 such that the Euclidean ball of radius ε around Tz misses epi⁡f. Set ρ=ε/(K+1)>0. If ∥z′−z∥2<ρ, [L2] gives ∥Tz′−Tz∥2≤K∥z′−z∥2<ε, so Tz′ also lies outside epi⁡f. Thus the complement of T−1(epi⁡f) is open and epi⁡g is closed. By [L1], g is lower semicontinuous.

2.1L1L3L6givenstep 1.1algebra

For each real r>0, Ur={x∈K:g(x)>−r} is relatively open in K, since its complement is the weak sublevel K∩{g≤−r}. These sets cover K because g(x)∈R∪{+∞} for every x (properness excludes −∞ and the tilt is finite). Compactness gives a finite subcover, and [L6] supplies a largest real index r∗ among its finitely many indices. Since the Ur are nested, Ur∗=K, so every finite value of g on K is greater than −r∗.

3.1L1L4L5step 1.1step 2.1choose

Let S:={g(x):x∈K, g(x)<+∞}. It is nonempty because x0∈K and g(x0)=c, and it is a real set bounded below by −r∗ by step 2.1. It therefore has a real infimum m. For every ε>0, [L5] gives s∈S with s<m+ε; choosing x∈K with g(x)=s shows Fε:=K∩{x:g(x)≤m+ε} is nonempty. It is closed in K by [L1]. Any nonempty finite subfamily has nonempty intersection, because the member with least positive ε is contained in all the others; the empty subfamily has intersection K≠∅.

4.1L4step 3.1algebrachoose

Applying [L4] to the family (Fε)ε>0 gives x∗∈⋂ε>0Fε. The bound g(x∗)≤m+1 makes g(x∗) finite, so g(x∗)∈S and m≤g(x∗). If g(x∗)>m, choose ε=(g(x∗)−m)/2>0; then x∗∈Fε would give g(x∗)≤m+ε<g(x∗), a contradiction. Thus g(x∗)=m.

5.1step 1.1step 4.1algebra

For x∉K, step 1.1 gives g(x)>c+1≥m+1, because x0∈K implies m≤c. Thus x∗ is a global minimizer over Rd, and its value m is finite.

6.1givenL7step 5.1algebra∎

On dom⁡f, −g(x)=⟨p,x⟩−f(x), and outside this domain g(x)=+∞. The global minimum m is attained at x∗∈dom⁡f, so the supremum in the definition of f∗(p) is finite, equals −m, and is attained at x∗. Therefore f∗(p)=⟨p,x∗⟩−f(x∗); [L7] yields p∈∂f(x∗).

Depends on

Dependency tree · 2 levels

Sources