Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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 m,n∈N with m,n≥1, let y∈Rm, and let ϵ≥0. Define f:Rn→R by f(x)=∥x∥1, and define g:Rm→(−∞,+∞] by g(u)=0 when ∥u−y∥2≤ϵ and g(u)=+∞ otherwise. Then f and g 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.

Facts & Assumptions

Given: Positive integers m,n, a center y∈Rm, a radius ϵ≥0, the functions f(x)=∥x∥1 and g=ιC for C={u:∥u−y∥2≤ϵ}.

[F2]

Proper closed convex extended-real functions on Rn: a function is proper when its finite domain is nonempty, convex under real convex combinations, and closed when its epigraph is closed.

[F3]

Convex and strictly convex functionals on a convex subset of a real vector space: for 0≤θ≤1, convexity is the inequality q((1−θ)a+θb)≤(1−θ)q(a)+θq(b), with 0⋅(+∞)=0 at endpoints.

[F4]

A convex subset of Rm contains every line segment between two of its points: a set is convex when every segment between two of its points remains in it.

[F5]

Extended-real indicator of a set: ιC equals 0 on C and +∞ outside it.

[F6]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: the Euclidean norm on a product coordinate space is the square root of the sum of squared coordinate differences.

[F7]

The canonical natural ι(n)=n⋅1F of a field: n denotes the canonical real image of n.

[F9]

Laws of finite sums and finite products and Squaring is monotone on the nonnegatives: finite sums preserve inequalities, and a2≤b2 for nonnegative reals implies a≤b.

Proof

1.1givenF1F2F3algebra

The function f is finite everywhere because it is a finite sum of absolute values, and f(0)=0, so its effective domain is nonempty. For 0≤θ≤1, the triangle inequality and homogeneity in [F1] give f((1−θ)x+θz)≤f((1−θ)x)+f(θz)=(1−θ)f(x)+θf(z). Thus f is proper and convex by [F2,F3].

1.2givenF1F6F7F8F9constructalgebra

For (x,t)∈Rn+1 outside epi⁡f, the gap d=f(x)−t is positive. Put L=n+1>0. If (x′,t′) has product Euclidean distance D<d/(2L) from (x,t), then coordinate-square domination gives ∥x′−x∥2≤D and ∣t′−t∣≤D. By [F1], f(x′)−t′≥f(x)−t−∣f(x′)−f(x)∣−∣t′−t∣≥d−(n+1)D>d/2>0. So the complement of epi⁡f is open and its epigraph is closed. The scalar L is positive by [F8]; the coordinate-square domination follows by comparing a partial sum with the full nonnegative sum and using [F9].

1.3givenF1F4constructalgebra

The residual ball C contains y because ϵ≥0. If u,v∈C and 0≤θ≤1, homogeneity and the triangle inequality in [F1] give ∥(1−θ)u+θv−y∥2≤(1−θ)∥u−y∥2+θ∥v−y∥2≤ϵ, so C is convex. If u∉C, the gap d=∥u−y∥2−ϵ>0 and the reverse triangle inequality show that every v with ∥v−u∥2<d/2 also lies outside C. Thus C is closed.

2.1F2F3F5step 1.3constructalgebra∎

By [F5], epi⁡g=C×[0,∞). If (u,t) is outside this epigraph, either u∉C or t<0. In the first case step 1.3 supplies an open ball about u disjoint from C, hence a product neighborhood disjoint from the epigraph; in the second case an interval about t contained in (−∞,0) supplies such a product neighborhood. Therefore epi⁡g is closed. Since C is nonempty by step 1.3, g is proper. If both endpoints lie in C, their convex combination lies in C by step 1.3 and g 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 g is convex, and [F2] proves that both functions have the asserted proper, closed, convex properties.

Depends on

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