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.
Proximal gradient and accelerated composite optimization — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Convex and Semicontinuous Functions on Rⁿ
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inequality KKT duality and optimality certificates
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Properties of the Integral and the Working FTC
- Proximal gradient and accelerated composite optimization
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Sparse Estimation and Covariance
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Analytic Hahn Banach Theorem
- The Derivative and the Mean Value Theorems
- The Direct Method and Euler--Lagrange Equations
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak and Weak Star Topologies
2 · Summary
These examples calculate a two-pixel total-variation proximal map, an exact first step for a nonorthogonal Lasso design, and a projected-gradient KKT fixed point. The scalar FISTA example shows by rational interval bounds that the accelerated objective can increase from one iterate to the next, despite the bound relative to the optimum.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The two-pixel total-variation proximal map
Example
For , let . For input , define its mean and half-difference . Then Thus the proximal map preserves the mean and soft-thresholds the half-difference by .
Facts & Assumptions
Given: and .
Proximal mapping: the proximal point minimizes .
The proximal map of the l1 norm is soft thresholding: for , the penalty is proper, closed and convex and its proximal map applies ; identify a scalar with the sole coordinate of as defined in The Euclidean inner product on .
Existence, resolvent characterization, and firm nonexpansiveness of the proximal map: the proximal objective has a unique minimizer for proper closed convex input and positive parameter.
Proper closed convex extended-real functions on : properness is nonempty effective domain and closedness means a closed epigraph.
Convex and strictly convex functionals on a convex subset of a real vector space: convexity is the extended-real Jensen inequality.
Verification
The function is finite everywhere, hence proper. Its epigraph is the intersection of the two closed halfspaces and , so it is closed. The triangle inequality for absolute value gives convexity under [F5]. Write a candidate uniquely as , so is its mean and its half-difference. Direct expansion gives and . Hence the objective is The first term is uniquely minimized at ; the remaining terms depend only on .
The -dependent objective is , which under the scalar/one-coordinate identification is the proximal objective for the proper, closed, convex function with parameter . By [F2], its unique minimizer is . This and give the displayed vector. The objective is strictly convex because of its positive quadratic term, consistent with uniqueness in [F3].
FISTA can increase the objective between consecutive iterates
Example
Take on , , , and . The gradient has Lipschitz constant , so is valid. Standard FISTA gives , hence ; consecutive accelerated objective values need not decrease.
Facts & Assumptions
Given: The scalar objective, smoothness constant and initial point in the Example.
The Euclidean inner product on : identify a scalar with the sole coordinate of its corresponding vector in .
Proper closed convex extended-real functions on : properness is a nonempty effective domain, convexity is the Jensen inequality, and closedness is closed epigraph.
Verification
Under the scalar/one-coordinate identification [F2], is convex and continuously differentiable, since Also , so its gradient is -Lipschitz and is valid. The zero function has nonempty domain, is convex, and has epigraph , which is closed; hence it is proper, closed and convex by [F3]. Its proximal map is the identity, so . Starting from , recurrence [F1] gives , , and The first interval follows from . For the next three, substituting the already established intervals gives radicands , , and in , , and respectively. The endpoint squares , , , , , and then give , , , and .
The momentum coefficients satisfy , , and : for example, the bounding cross-products are , , , , , and . Substitution into gives . Then lies between and , so . Finally and endpoint monotonicity gives Thus .
The intervals imply . Since is strictly increasing as a function of , .
One proximal-gradient step for a nonorthogonal Lasso design
Example
Use the Lasso objective of Lasso estimator for fixed design with , and start at . The columns of have inner product , so this is not an orthogonal design. With valid smoothness constant , one exact proximal-gradient update is This is a first iterate calculation; it does not claim that minimizes the Lasso objective.
Facts & Assumptions
Given: The design, response, penalty and initial vector displayed in the Example.
Proximal-gradient, FISTA, and fixed-period restarted FISTA: one proximal-gradient step is with and .
The proximal map of the l1 norm is soft thresholding: the positive multiple of is proper, closed and convex, and its proximal map applies coordinatewise.
Verification
Here is a convex continuously differentiable quadratic: for , Its gradient is with . For , using . Thus is -Lipschitz and is valid. The nonsmooth term is proper, closed and convex by [F3]. Also , so and .
The nonsmooth term is , and the proximal parameter is , so its soft-threshold level is . Applying [F3] to gives .
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.