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.
Projected gradient on the nonnegative orthant
Example
Let and Then is a valid gradient-Lipschitz constant, the projected-gradient step stays at , and . The KKT multipliers for inequalities are , so the fixed point is a global constrained minimizer.
Facts & Assumptions
Given: The objective, orthant, initial point and step constant in the Example.
Proximal-gradient, FISTA, and fixed-period restarted FISTA: a projected-gradient update is .
The proximal map of an indicator is Euclidean projection: the proximal map of is .
Projected-gradient fixed points are normal-cone certificates: for a convex smooth objective and polyhedral , a vanishing projected-gradient mapping is equivalent to the outward normal condition; a feasible KKT tuple certifies a global minimum.
Verification
The function is a continuously differentiable convex quadratic, with Its gradient is , whose Lipschitz constant is , hence is valid. At , the unprojected point is ; coordinatewise projection onto gives . Repeating the same computation shows the iterate remains there.
For every , , hence by the outward-cone definition. Equivalently, write as with ; at , has zero complementarity and . By [F3], this KKT tuple certifies global minimality and the projected-gradient fixed point.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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
- Neal Parikh and Stephen Boyd, Proximal Algorithms, §4.2 (standard reference, not scraped)