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.
PDHG one-step primal-dual gap telescope
Statement
For the exact recurrence of Chambolle–Pock primal-dual hybrid gradient, put and . For every , and integer , The formula includes and uses .
Facts & Assumptions
Given: The exact PDHG recurrence, , , and test points in the stated domains.
The exact recurrence is used, , and the test points are in the stated domains.
Chambolle–Pock primal-dual hybrid gradient: the proximal updates, , and for .
Existence, resolvent characterization, and firm nonexpansiveness of the proximal map: in positive dimension, if , then .
Subdifferentials of proper extended-real convex functions: for a finite-valued point of a proper convex extended-real function, implies for every .
Cauchy-Schwarz with its equality case, the triangle inequality for , the parallelogram law and polarisation: and the Euclidean norm obeys polarization.
The Euclidean inner product on : consists of the single zero vector.
Proof
For each positive-dimensional proximal space, the optimality condition [F2] and extended-real subgradient definition [F3] give the relevant inequality. If a proximal space is zero-dimensional, [F6] says its only point is ; its update and test point are both , so the same inequality is equality in that coordinate. Therefore in every dimension the two inequalities are The identity applied to the primal and dual displacement terms gives the two distance differences and in their respective coordinates. The bilinear terms from the primal inequality and the gap expand as . Adding the dual update term gives in the upper bound for . Moving this term to the other side yields where , , , and .
Define , so , and . The extrapolation in [F1] gives By [F4,F5] and , Substitution into step 1.1 therefore gives
Sum step 2.1 for . The terms telescope, , and the terms satisfy . Thus For the terminal cross term, [F4,F5] and give Since contains and , these terminal terms leave a nonnegative remainder; all increment terms are also nonnegative because . Drop them to obtain , the claimed estimate. When , and the same inequalities hold without division by .
Depends on
- Chambolle–Pock primal-dual hybrid gradient
- Subdifferentials of proper extended-real convex functions
- Cauchy-Schwarz $\lvert\langle x,y\rangle\rvert \le \lVert x\rVert_2\lVert y\rVert_2$ with its equality case, the triangle inequality for $\lVert\cdot\rVert_2$, the parallelogram law and polarisation
- The matrix norm induced by a published vector p-norm
- Existence, resolvent characterization, and firm nonexpansiveness of the proximal map
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
Used by
Dependency tree · two levels
42 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, §3.1, equations (11)–(16) (standard reference, not scraped)
- Laurent Vandenberghe, UCLA EE236C Lecture Notes: Douglas–Rachford Splitting, §§4–5 (standard reference, not scraped)