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.
Three-point inequality for the proximal-gradient model
Statement
Let be proper, closed and convex, let , let be differentiable at , and set . For every ,
Facts & Assumptions
Given: The function, point, and scalar in the Statement.
Subdifferentials of proper extended-real convex functions: implies for every .
Proximal mapping: the proximal step uses and parameter .
Proof
By [F1] and [F3], . For finite , [F2] gives Add and to both sides. Using and cancels the cross terms and leaves . Rearranging is the claimed inequality.
If , the right side is and the inequality holds automatically, so the finite- calculation proves the statement for every .
Depends on
- Proper closed convex extended-real functions on $\mathbb R^n$
- Proximal mapping
- Existence, resolvent characterization, and firm nonexpansiveness of the proximal map
- Subdifferentials of proper extended-real convex functions
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
Used by
Dependency tree · two levels
28 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, §4.2 (standard reference, not scraped)
- Amir Beck and Marc Teboulle, A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems, Lemma 2.3 (standard reference, not scraped)