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 finite continuous convex summand preserves proper closed convexity
Statement
Let be continuous and convex, and let be proper, closed and convex under the epigraph convention of Proper closed convex extended-real functions on . Then is proper, closed and convex in the same convention.
Facts & Assumptions
Given: The functions and hypotheses in the Statement.
Proper closed convex extended-real functions on : has a nonempty effective domain, is convex, and has a closed epigraph.
Convex and strictly convex functionals on a convex subset of a real vector space: convexity means the Jensen inequality for every pair of finite-domain points and .
The usual Euclidean topology has open balls about each point, and a set is closed exactly when its complement is open (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space).
Proof
Since , choose with . The value is real, so and is proper.
For with finite and , both are finite. Applying convexity separately to and and adding gives ; if either value of is , the extended-real convexity inequality is automatic. Thus is convex.
For , let . It is continuous: the first coordinates are unchanged, while continuity of makes the last coordinate continuous. The identity follows by rearranging , including points where . If a point lies outside , its image lies outside the closed set , so an open ball about that image misses ; continuity of supplies a neighborhood of the original point mapped into that ball. Hence the complement of is open and is closed.
Depends on
- Proper closed convex extended-real functions on $\mathbb R^n$
- Convex and strictly convex functionals on a convex subset of a real vector space
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Open ball, closed ball and sphere in a metric space
Used by
- Proximal-gradient, FISTA, and fixed-period restarted FISTA Algorithm
- One-step estimate for a certified inexact proximal call Lemma
- One-step proximal-gradient estimate Lemma
- Cyclic exact block descent has globally optimal accumulation points Theorem
- Existence, resolvent characterization, and firm nonexpansiveness of the proximal map Theorem
- Proximal coordinate contraction from strong convexity of the composite Theorem
- Strongly convex smooth-part proximal coordinate contraction Theorem
- The proximal-gradient method has an O(1/k) objective bound Theorem
Dependency tree · two levels
15 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 (standard reference, not scraped)
- Stephen Boyd and Lieven Vandenberghe, Convex Optimization, §3.1 (standard reference, not scraped)