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.

Three-point inequality for the proximal-gradient model

Statement

Let g be proper, closed and convex, let L>0, let f be differentiable at y, and set x+=prox⁡g/L(y−∇f(y)/L). For every z∈Rn, g(x+)+⟨∇f(y),x+−y⟩+L2∥x+−y∥22+L2∥x+−z∥22≤g(z)+⟨∇f(y),z−y⟩+L2∥z−y∥22.

Facts & Assumptions

Given: The function, point, and scalar in the Statement.

[F1]

Existence, resolvent characterization, and firm nonexpansiveness of the proximal map: x+=prox⁡g/L(w) iff L(w−x+)∈∂g(x+).

[F2]

Subdifferentials of proper extended-real convex functions: p∈∂g(x) implies g(z)≥g(x)+⟨p,z−x⟩ for every z.

[F3]

Proximal mapping: the proximal step uses w=y−∇f(y)/L and parameter 1/L.

Proof

1.1F1F2F3givenalgebra

By [F1] and [F3], L(y−x+)−∇f(y)∈∂g(x+). For finite g(z), [F2] gives g(z)−g(x+)≥⟨L(y−x+)−∇f(y),z−x+⟩. Add ⟨∇f(y),z−x+⟩ and L2(∥z−y∥22−∥x+−y∥22) to both sides. Using ∥z−y∥22−∥x+−y∥22=∥z−x+∥22+2⟨z−x+,x+−y⟩ and y−x+=−(x+−y) cancels the cross terms and leaves L∥z−x+∥22/2. Rearranging is the claimed inequality.

2.1step 1.1algebra∎

If g(z)=+∞, the right side is +∞ and the inequality holds automatically, so the finite-g(z) calculation proves the statement for every z.

Depends on

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