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.

A proper closed convex function has an affine minorant

Statement

Let n∈N and let g:Rn→(−∞,+∞] be proper, closed and convex in the epigraph convention of Proper closed convex extended-real functions on Rn. Then there are a∈Rn and b∈R such that g(x)≥⟨a,x⟩+b(x∈Rn).

Facts & Assumptions

Given: The function g in the Statement, with effective domain D={x:g(x)<+∞} and epigraph Eg={(x,s):g(x)≤s}.

[A1]

Proper closed convex extended-real functions on Rn: D is nonempty and convex, and Eg is a nonempty closed convex subset of Rn+1.

[F1]

Every point has a unique nearest point in a nonempty closed Euclidean convex set: every point of a nonempty closed convex Euclidean set has a unique nearest point.

[F2]

Metric projection onto a closed convex set satisfies the variational inequality: if p is the nearest point of a closed convex set to q, then ⟨q−p,z−p⟩≤0 for every point z in that set.

[F3]

For n≥1 every bounded sequence in Rn has a convergent subsequence: every bounded sequence in a positive-dimensional Euclidean space has a convergent subsequence; this corollary records a choice-free proof.

Proof

technique · direct
1.1A1construct

Let d be the dimension of the direction space of aff⁡D. If d=0, then D is a singleton {x0} and the constant affine function g(x0) is a minorant. If d>0, choose affinely independent points a0,…,ad∈D spanning aff⁡D and let x0 be their barycenter. Iterating the two-point convexity condition shows their simplex lies in D. In affine barycentric coordinates, this simplex is defined by λi≥0 and ∑i=0dλi=1; at x0 every λi=1/(d+1). These affine coordinate functions on the finite-dimensional space aff⁡D are continuous, so they remain positive on a relative neighborhood of x0, which therefore lies in the simplex and in D. Thus x0 is a relative-interior point of D.

1.2A1F1givenalgebra

Put p=(x0,g(x0))∈Eg and qj=(x0,g(x0)−1/j) for integers j≥1. Each qj lies outside Eg and tends to p. Let pj be its unique nearest point in Eg, supplied by [F1]. Since p∈Eg, ∥qj−pj∥2≤1/j. For each coordinate ℓ<n+1, ∣(qj−pj)ℓ∣≤∥qj−pj∥2≤1/j, because each squared coordinate is a term of the sum defining the squared Euclidean norm. As qj→p coordinatewise, this gives pj→p coordinatewise and hence in Euclidean norm, since there are finitely many coordinates.

2.1F1F2F3step 1.2algebra

Normalize uj=(qj−pj)/∥qj−pj∥2, which is defined because qj∉Eg and Eg is closed. The vectors uj have norm one, so their range lies in the Euclidean ball B(0,2). By [F3], choose a subsequence (ujℓ) converging in Rn+1 to u=(a,c). Since each coordinate difference is bounded by the Euclidean norm, this convergence gives coordinate convergence; the finite-sum formula for the squared norm then gives ∥u∥22=lim⁡ℓ→∞∥ujℓ∥22=1. Both qj and pj have horizontal coordinate in aff⁡D, so each horizontal component of uj lies in the direction space V of aff⁡D. This finite-dimensional subspace is closed: after extending a basis of V to one of Rn, it is the common zero set of the remaining continuous coordinate functionals. Hence a∈V. For each fixed z∈Eg, [F2] gives ⟨uj,z−pj⟩≤0. Along the chosen subsequence, coordinate convergence and the finite-sum formula for the inner product show ⟨ujℓ,z−pjℓ⟩→⟨u,z−p⟩, so ⟨u,z−p⟩≤0.

3.1A1step 1.1step 2.1algebra

The upward vertical ray p+(0,s) lies in Eg for all s≥0, so step 2.1 forces c≤0. If c=0, the relative neighborhood from step 1.1 lets each direction h∈V be tested at x0+εh and x0−εh for sufficiently small ε>0. Applying step 2.1 to the corresponding epigraph points gives both ε⟨a,h⟩≤0 and −ε⟨a,h⟩≤0, so ⟨a,h⟩=0 for every h∈V. Taking h=a∈V gives ∥a∥22=0, hence a=0, contradicting ∥u∥2=1. Thus c<0.

4.1step 2.1step 3.1algebra∎

For any x∈D, apply step 2.1 to (x,g(x))∈Eg to get ⟨a,x−x0⟩+c(g(x)−g(x0))≤0. Dividing by c<0 reverses the inequality and yields g(x)≥g(x0)+⟨−a/c,x−x0⟩. Set a0=−a/c and b0=g(x0)−⟨a0,x0⟩. This is the desired affine bound on D, and outside D the value is +∞, so the bound holds on all of Rn.

Remarks

The proof constructs a support normal using nearest points to a sequence below the epigraph. It uses the choice-free finite-dimensional Bolzano–Weierstrass supplier [F3], not the separate boundary-support theorem whose published statement assumes Countable Choice and the Axiom of Choice.

Depends on

Used by

Dependency tree · two levels

45 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