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 be proper, closed and convex in the epigraph convention of Proper closed convex extended-real functions on . For every and , the set is a singleton. Its unique element satisfies the resolvent equivalence For any and , In particular the proximal map is nonexpansive.
Facts & Assumptions
Given: The function , parameter , and input points in the Statement.
Proper closed convex extended-real functions on : has nonempty effective domain, is convex, and has closed epigraph.
A proper closed convex function has an affine minorant: there are with for every .
A finite continuous convex summand preserves proper closed convexity: adding a finite continuous convex function preserves properness, convexity and closed epigraph.
Semicontinuous extreme value theorem on compact Euclidean sets: a real-valued lower-semicontinuous function on a nonempty compact Euclidean set attains its minimum.
Semicontinuity on is characterized by strict open level sets and weak closed level sets: lower semicontinuity is equivalent to closedness of every weak sublevel set.
Subdifferentials of proper extended-real convex functions: means for every .
Proximal mapping: the proximal set consists of all global minimizers of .
The Euclidean inner product on : is the singleton zero vector space, and its inner product and norm are zero.
Proof
If , [F10] gives . Properness [F1] forces to be finite. Every input , candidate , competitor and subgradient vector is . The objective in [F8] has only the candidate , so . The inequality in [F7] is , so and ; both directions of the resolvent equivalence hold. Firm nonexpansiveness and nonexpansiveness both reduce to . This proves every conclusion for without compactness or an affine-minorant argument. For the remainder assume .
Define . The quadratic is finite and continuous, and the identity shows it is convex. Thus [F3] makes proper, closed and convex. Choose and put . Then is nonempty and closed: it is the inverse image of under the continuous map .
By [F2], completing the square gives Thus forces into a fixed-radius ball, so is bounded and hence compact by [F4]. The restriction is real-valued; each weak sublevel set is the intersection of with the inverse image of under for its level , hence closed in . By [F6] it is lower semicontinuous, so [F5] gives a minimizer on . Every point outside has value greater than , while the minimum on is at most , so this minimizer is global.
The quadratic satisfies . If two distinct points minimized , convexity of and this identity would make their midpoint have strictly smaller value, a contradiction. Hence the global minimizer is unique, proving the singleton claim.
Suppose minimizes and fix . For , convexity gives . Minimality and expansion of the quadratic therefore imply Divide by and let ; the parenthesized term is nonnegative. The same subgradient inequality is automatic for , so .
Conversely, if , then for every finite-valued the subgradient inequality and give . Infinite-valued competitors cannot lower , so is the unique minimizer from step 2.2. This proves the reverse implication.
Let and . From step 3.1, . Applying the two subgradient inequalities with and and adding yields . Substitution and multiplication by give . By [F9] the right side is at most ; if nonexpansiveness is immediate, and otherwise division gives it.
Depends on
- Proper closed convex extended-real functions on $\mathbb R^n$
- A proper closed convex function has an affine minorant
- Subdifferentials of proper extended-real convex functions
- Proximal mapping
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- A finite continuous convex summand preserves proper closed convexity
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Semicontinuous extreme value theorem on compact Euclidean sets
- Semicontinuity on $\mathbb R^n$ is characterized by strict open level sets and weak closed level sets
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
Used by
- Certified inexact proximal-gradient and FISTA updates Algorithm
- Chambolle–Pock primal-dual hybrid gradient Algorithm
- Proximal-gradient, FISTA, and fixed-period restarted FISTA Algorithm
- Randomized proximal coordinate descent with certified inner solves Algorithm
- Proximal-gradient mapping and projected-gradient mapping Definition
- The two-pixel total-variation proximal map Example
- Coordinate proximal subproblems are attained uniquely and descend Lemma
- Diagonal AdaGrad subproblem has a unique minimizer Lemma
- One-step proximal-gradient estimate Lemma
- PDHG one-step primal-dual gap telescope Lemma
- The convex normal-cone operator is maximal monotone and its resolvent is projection Lemma
- The proximal map of the l1 norm is soft thresholding Lemma
- Three-point inequality for the proximal-gradient model Lemma
- Vanishing aggregate-model error controls the proximal candidate Lemma
- Finite-time projected SGD bound for a convex objective Theorem
- Projected SGD converges almost surely on a strongly convex objective Theorem
- Proximal bundle accumulation under vanishing aggregate-model error Theorem
- Strong convexity gives linear proximal-gradient and restarted-FISTA rates Theorem
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
- Neal Parikh and Stephen Boyd, Proximal Algorithms, §§1.1 and 2.3 (standard reference, not scraped)
- Amir Beck, First-Order Methods in Optimization, SIAM, 2017, Chapter 6 (standard reference, not scraped)