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.
The basis-pursuit denoising objective and residual indicator are proper closed convex
Statement
Let with , let , and let . Define by , and define by when and otherwise. Then and are proper (finite somewhere), closed (their epigraphs are closed), and convex (they satisfy the extended-real convex-combination inequality) on their respective finite-dimensional Euclidean spaces.
Statement references
Facts & Assumptions
Given: Positive integers , a center , a radius , the functions and for .
The -norms for rational , and , Each is a norm on , and the induced metrics are exactly , and of the published metric-spaces page, and The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for : the one- and two-norms are finite-valued norms, satisfy homogeneity and both triangle inequalities, and for .
Proper closed convex extended-real functions on : a function is proper when its finite domain is nonempty, convex under real convex combinations, and closed when its epigraph is closed.
Convex and strictly convex functionals on a convex subset of a real vector space: for , convexity is the inequality , with at endpoints.
A convex subset of contains every line segment between two of its points: a set is convex when every segment between two of its points remains in it.
Extended-real indicator of a set: equals on and outside it.
The Euclidean inner product on : the Euclidean norm on a product coordinate space is the square root of the sum of squared coordinate differences.
The canonical natural of a field: denotes the canonical real image of .
Laws of finite sums and finite products and Squaring is monotone on the nonnegatives: finite sums preserve inequalities, and for nonnegative reals implies .
Proof
The function is finite everywhere because it is a finite sum of absolute values, and , so its effective domain is nonempty. For , the triangle inequality and homogeneity in [F1] give Thus is proper and convex by [F2,F3].
For outside , the gap is positive. Put . If has product Euclidean distance from , then coordinate-square domination gives and . By [F1], So the complement of is open and its epigraph is closed. The scalar is positive by [F8]; the coordinate-square domination follows by comparing a partial sum with the full nonnegative sum and using [F9].
The residual ball contains because . If and , homogeneity and the triangle inequality in [F1] give so is convex. If , the gap and the reverse triangle inequality show that every with also lies outside . Thus is closed.
By [F5], . If is outside this epigraph, either or . In the first case step 1.3 supplies an open ball about disjoint from , hence a product neighborhood disjoint from the epigraph; in the second case an interval about contained in supplies such a product neighborhood. Therefore is closed. Since is nonempty by step 1.3, is proper. If both endpoints lie in , their convex combination lies in by step 1.3 and is zero there; if either endpoint has value with positive coefficient, the convexity inequality has right side . Endpoint coefficients reduce to equality at the endpoint with coefficient one. Thus is convex, and [F2] proves that both functions have the asserted proper, closed, convex properties.
Depends on
- The $p$-norms $\lVert x\rVert_p$ for rational $p \ge 1$, and $\lVert x\rVert_\infty$
- Each $\lVert\cdot\rVert_p$ is a norm on $\mathbb{R}^n$, and the induced metrics are exactly $d_1$, $d_2$ and $d_\infty$ of the published metric-spaces page
- The finite and reverse triangle inequalities for a norm; and for $n \ge 1$ every norm $N$ on $\mathbb{R}^n$ satisfies $N(x) \le C\lVert x\rVert_1$ and is Lipschitz, hence continuous, for $d_2$
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Proper closed convex extended-real functions on $\mathbb R^n$
- Convex and strictly convex functionals on a convex subset of a real vector space
- A convex subset of $\mathbb{R}^m$ contains every line segment between two of its points
- Extended-real indicator of a set
- The canonical natural $\iota(n) = n \cdot 1_F$ of a field
- Canonical naturals are positive and strictly increasing
- Laws of finite sums and finite products
- Squaring is monotone on the nonnegatives
Used by
Dependency tree · two levels
67 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
- Antonin Chambolle and Thomas Pock, A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging, §2 (standard reference, not scraped)