Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 proximal map of an indicator is Euclidean projection

Statement

Let C⊆Rn be nonempty, closed and convex. Its indicator ιC is proper, closed and convex in the convention of Proper closed convex extended-real functions on Rn. For every t>0 and v∈Rn, prox⁡tιC(v) is the singleton consisting of the unique nearest point in C to v.

Facts & Assumptions

Given: The set C, scalar t>0, and point v in the Statement.

[F1]

Extended-real indicator of a set: ιC is 0 on C and +∞ off C.

[F2]

A convex subset of Rm contains every line segment between two of its points: every convex combination of two points of C belongs to C.

[F3]

Proper closed convex extended-real functions on Rn: properness means nonempty effective domain; closedness means a closed epigraph.

[F4]

Every point has a unique nearest point in a nonempty closed Euclidean convex set: for n≥1, every point has a unique Euclidean nearest point in a nonempty closed convex set.

[F5]

Proximal mapping: prox⁡tιC(v) is the set of global minimizers of ιC(u)+∥u−v∥22/(2t).

[F6]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: R0 is the singleton zero vector space, and its norm and inner product are zero.

Proof

1.1F1F2F3givenchoose

Since C is nonempty, some x∈C has ιC(x)=0<+∞, so the indicator is proper. If x,y∈C, convexity of C puts every convex combination in C, where the indicator is zero; if either endpoint is outside C, the convexity inequality is automatic for an interior coefficient, and at endpoints it is equality. Thus ιC is convex.

1.2F1F3givenalgebra

Its epigraph is exactly C×[0,+∞): for x∈C the inequality 0≤s is required, and for x∉C no real s satisfies +∞≤s. This product is closed because both factors are closed, so ιC is closed.

1.3F5F6givenalgebra

If n=0, then R0={0} by [F6], and nonempty C⊆R0 is {0}. The proximal objective has this sole point as its unique minimizer, and it is also the unique nearest point in C to v=0. Hence the claim holds for n=0.

2.1F4F5givenalgebra∎

Now assume n≥1. The proximal objective is finite exactly on C, where it equals ∥u−v∥22/(2t). Since 2t>0, minimizing it over all Rn is equivalent to minimizing distance from v over C. By [F4] the latter has a unique minimizer, which is therefore exactly the singleton in [F5].

Depends on

Used by

Dependency tree · two levels

27 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