Alphabeta Math
TheoremStatement: 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.

Existence, resolvent characterization, and firm nonexpansiveness of the proximal map

Statement

Let g:Rn→(−∞,+∞] be proper, closed and convex in the epigraph convention of Proper closed convex extended-real functions on Rn. For every t>0 and v∈Rn, the set prox⁡tg(v) is a singleton. Its unique element u satisfies the resolvent equivalence u=prox⁡tg(v)⟺(v−u)/t∈∂g(u). For any v1,v2 and ui=prox⁡tg(vi), ∥u1−u2∥22≤⟨u1−u2,v1−v2⟩. In particular the proximal map is nonexpansive.

Facts & Assumptions

Given: The function g, parameter t>0, and input points in the Statement.

[F1]

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

[F2]

A proper closed convex function has an affine minorant: there are a∈Rn,b∈R with g(x)≥⟨a,x⟩+b for every x.

[F3]

A finite continuous convex summand preserves proper closed convexity: adding a finite continuous convex function preserves properness, convexity and closed epigraph.

[F5]

Semicontinuous extreme value theorem on compact Euclidean sets: a real-valued lower-semicontinuous function on a nonempty compact Euclidean set attains its minimum.

[F6]

Semicontinuity on Rn is characterized by strict open level sets and weak closed level sets: lower semicontinuity is equivalent to closedness of every weak sublevel set.

[F7]

Subdifferentials of proper extended-real convex functions: p∈∂g(u) means g(z)≥g(u)+⟨p,z−u⟩ for every z.

[F8]

Proximal mapping: the proximal set consists of all global minimizers of g(x)+∥x−v∥22/(2t).

[F10]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: R0 is the singleton zero vector space, and its inner product and norm are zero.

Proof

1.1F1F7F8F10givenalgebra

If n=0, [F10] gives R0={0}. Properness [F1] forces g(0) to be finite. Every input v, candidate u, competitor z and subgradient vector p is 0. The objective in [F8] has only the candidate 0, so prox⁡tg(0)={0}. The inequality in [F7] is g(0)≥g(0)+0, so ∂g(0)={0} and (v−u)/t=0∈∂g(0); both directions of the resolvent equivalence hold. Firm nonexpansiveness and nonexpansiveness both reduce to 0≤0. This proves every conclusion for n=0 without compactness or an affine-minorant argument. For the remainder assume n≥1.

1.2F1F3F8givenchoose

Define H(x)=g(x)+∥x−v∥22/(2t). The quadratic is finite and continuous, and the identity ∥(1−θ)x+θy−v∥22=(1−θ)∥x−v∥22+θ∥y−v∥22−θ(1−θ)∥x−y∥22 shows it is convex. Thus [F3] makes H proper, closed and convex. Choose x0∈dom⁡g and put c=H(x0). Then S={x:H(x)≤c} is nonempty and closed: it is the inverse image of epi⁡H under the continuous map x↦(x,c).

2.1F2F4F5F6step 1.2algebra

By [F2], completing the square gives H(x)≥b+⟨a,x⟩+∥x−v∥222t=b+⟨a,v⟩−t2∥a∥22+12t∥x−(v−ta)∥22. Thus H(x)≤c forces x into a fixed-radius ball, so S is bounded and hence compact by [F4]. The restriction H∣S is real-valued; each weak sublevel set is the intersection of S with the inverse image of epi⁡H under x↦(x,r) for its level r, hence closed in S. By [F6] it is lower semicontinuous, so [F5] gives a minimizer on S. Every point outside S has value greater than c, while the minimum on S is at most c, so this minimizer is global.

2.2F1step 1.2algebra

The quadratic satisfies ∥x+y2−v∥22=12∥x−v∥22+12∥y−v∥22−14∥x−y∥22. If two distinct points minimized H, convexity of g and this identity would make their midpoint have strictly smaller value, a contradiction. Hence the global minimizer is unique, proving the singleton claim.

3.1F1F7F8step 2.2algebra

Suppose u minimizes H and fix z∈dom⁡g. For 0<α<1, convexity gives g(u+α(z−u))≤(1−α)g(u)+αg(z). Minimality and expansion of the quadratic therefore imply 0≤H(u+α(z−u))−H(u)≤α(g(z)−g(u)+⟨u−v,z−u⟩t)+α22t∥z−u∥22. Divide by α and let α↓0; the parenthesized term is nonnegative. The same subgradient inequality is automatic for z∉dom⁡g, so (v−u)/t∈∂g(u).

3.2F7F8step 2.2algebra

Conversely, if (v−u)/t∈∂g(u), then for every finite-valued g(z) the subgradient inequality and ∥z−v∥22−∥u−v∥22=∥z−u∥22+2⟨u−v,z−u⟩ give H(z)−H(u)≥∥z−u∥22/(2t)≥0. Infinite-valued competitors cannot lower H, so u is the unique minimizer from step 2.2. This proves the reverse implication.

4.1F7F9step 3.1givenalgebra∎

Let ui=prox⁡tg(vi) and pi=(vi−ui)/t. From step 3.1, pi∈∂g(ui). Applying the two subgradient inequalities with (u1,u2) and (u2,u1) and adding yields ⟨p1−p2,u1−u2⟩≥0. Substitution and multiplication by t>0 give ∥u1−u2∥22≤⟨u1−u2,v1−v2⟩. By [F9] the right side is at most ∥u1−u2∥2∥v1−v2∥2; if u1=u2 nonexpansiveness is immediate, and otherwise division gives it.

Depends on

Used by

Cited to discharge well-definedness by Proximal mapping.

Dependency tree · two levels

61 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