Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

Proximal gradient and accelerated composite optimization — Examples

1 · Prerequisites

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 O(1/k2) bound relative to the optimum.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

The two-pixel total-variation proximal map

Example

For λ,t>0, let g(u1,u2)=λ∣u2−u1∣. For input v=(v1,v2), define its mean m=(v1+v2)/2 and half-difference d=(v2−v1)/2. Then prox⁡tg(v)=(m−Stλ(d), m+Stλ(d)). Thus the proximal map preserves the mean and soft-thresholds the half-difference by tλ.

Facts & Assumptions

Given: λ,t>0 and v∈R2.

[F1]

Proximal mapping: the proximal point minimizes g(u)+∥u−v∥22/(2t).

[F2]

The proximal map of the l1 norm is soft thresholding: for n=1, the ℓ1 penalty is proper, closed and convex and its proximal map applies Ssα; identify a scalar r with the sole coordinate r of R1 as defined in The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn.

[F3]

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.

[F4]

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

[F5]

Verification

1.1F1F4F5givenalgebra

The function g is finite everywhere, hence proper. Its epigraph is the intersection of the two closed halfspaces λ(u2−u1)≤s and −λ(u2−u1)≤s, so it is closed. The triangle inequality for absolute value gives convexity under [F5]. Write a candidate u uniquely as u=(a−b,a+b), so a is its mean and b its half-difference. Direct expansion gives ∥u−v∥22=2(a−m)2+2(b−d)2 and g(u)=2λ∣b∣. Hence the objective is (a−m)2t+(b−d)2t+2λ∣b∣. The first term is uniquely minimized at a=m; the remaining terms depend only on b.

2.1F2F3step 1.1algebra∎

The b-dependent objective is 2λ∣b∣+(b−d)2/t, which under the scalar/one-coordinate identification is the proximal objective for the proper, closed, convex function 2λ∣⋅∣ with parameter t/2. By [F2], its unique minimizer is S(t/2)(2λ)(d)=Stλ(d). This and a=m give the displayed vector. The objective is strictly convex because of its positive quadratic term, consistent with uniqueness in [F3].

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

FISTA can increase the objective between consecutive iterates

Example

Take f(x)=x2/4 on R, g=0, L=1, and x0=1. The gradient has Lipschitz constant 1/2, so L=1 is valid. Standard FISTA gives ∣x5∣>∣x4∣, hence f(x5)>f(x4); consecutive accelerated objective values need not decrease.

Facts & Assumptions

Given: The scalar objective, smoothness constant and initial point in the Example.

[F1]

Proximal-gradient, FISTA, and fixed-period restarted FISTA: xk=TL(yk), tk+1=(1+1+4tk2)/2, and yk+1=xk+((tk−1)/tk+1)(xk−xk−1).

[F2]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: identify a scalar s with the sole coordinate s of its corresponding vector in R1.

[F3]

Proper closed convex extended-real functions on Rn: properness is a nonempty effective domain, convexity is the Jensen inequality, and closedness is closed epigraph.

Verification

1.1F1F2F3givenalgebra

Under the scalar/one-coordinate identification [F2], f(x)=x2/4 is convex and continuously differentiable, since f((1−α)x+αz)=(1−α)f(x)+αf(z)−α(1−α)4(x−z)2(0≤α≤1). Also f′(x)=x/2, so its gradient is 1/2-Lipschitz and L=1 is valid. The zero function g has nonempty domain, is convex, and has epigraph R1×[0,+∞), which is closed; hence it is proper, closed and convex by [F3]. Its proximal map is the identity, so T1(y)=y−∇f(y)=y/2. Starting from t1=1,y1=x0=1, recurrence [F1] gives x1=1/2, x2=1/4, and t2=1+52,t3=1+1+4t222,t4=1+1+4t322,t5=1+1+4t422. The first interval follows from 2.23602<5<2.23612. For the next three, substituting the already established intervals gives radicands 1+4t22, 1+4t32, and 1+4t42 in (11.471696,11.472991), (20.244014,20.249279), and (31.228004,31.272004) respectively. The endpoint squares 3.38682<11.471696, 3.38742>11.472991, 4.4982<20.244014, 4.5022>20.249279, 5.5862<31.228004, and 5.5942>31.272004 then give 1.6180<t2<1.6181, 2.1934<t3<2.1937, 2.749<t4<2.751, and 3.293<t5<3.297.

2.1F1step 1.1algebra

The momentum coefficients satisfy 0.281<(t2−1)/t3<0.283, 0.433<(t3−1)/t4<0.435, and 0.529<(t4−1)/t5<0.533: for example, the bounding cross-products are 0.281(2.1937)=0.6164297<0.6180, 0.283(2.1934)=0.6207322>0.6181, 0.433(2.751)=1.191183<1.1934, 0.435(2.749)=1.195815>1.1937, 0.529(3.297)=1.744113<1.749, and 0.533(3.293)=1.755169>1.751. Substitution into x3=18(1−(t2−1)/t3) gives 0.0896<x3<0.0899. Then x4=12[x3+t3−1t4(x3−1/4)] lies between 12[(1+0.435)(0.0896)−0.435/4]=0.009913 and 12[(1+0.433)(0.0899)−0.433/4]=0.01028835, so 0.0099<x4<0.0103. Finally x5=12[x4+t4−1t5(x4−x3)] and endpoint monotonicity gives 12[(1+0.533)(0.0099)−0.533(0.0899)]=−0.01637<x5<12[(1+0.529)(0.0103)−0.529(0.0896)]=−0.01582485. Thus −0.0164<x5<−0.0158.

3.1step 2.1givenalgebra∎

The intervals imply ∣x5∣>0.0158>0.0103>∣x4∣. Since f(x)=x2/4 is strictly increasing as a function of ∣x∣, f(x5)>f(x4).

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

One proximal-gradient step for a nonorthogonal Lasso design

Example

Use the Lasso objective of Lasso estimator for fixed design with n=d=2, X=(1011),y=(11),τ=110, and start at θ0=(0,0). The columns of X have inner product 1, so this is not an orthogonal design. With valid smoothness constant L=3, one exact proximal-gradient update is θ1=(35,415). This is a first iterate calculation; it does not claim that θ1 minimizes the Lasso objective.

Facts & Assumptions

Given: The design, response, penalty and initial vector displayed in the Example.

[F1]

Lasso estimator for fixed design: Qy(θ)=n−1∥y−Xθ∥22+2τ∥θ∥1.

[F2]

Proximal-gradient, FISTA, and fixed-period restarted FISTA: one proximal-gradient step is θ1=prox⁡g/L(θ0−∇f(θ0)/L) with f=n−1∥y−Xθ∥22 and g=2τ∥⋅∥1.

[F3]

The proximal map of the l1 norm is soft thresholding: the positive multiple of ∥⋅∥1 is proper, closed and convex, and its proximal map applies Ssλ coordinatewise.

Verification

1.1F1F2F3givenalgebra

Here f(θ)=12∥y−Xθ∥22 is a convex continuously differentiable quadratic: for 0≤α≤1, f((1−α)u+αv)=(1−α)f(u)+αf(v)−α(1−α)∥X(u−v)∥22/2. Its gradient is ∇f(θ)=Hθ−XTy with H=XTX=(2111). For h=(a,b), ∥Hh∥22=(2a+b)2+(a+b)2=5a2+6ab+2b2≤8a2+5b2≤8∥h∥22, using 6ab≤3(a2+b2). Thus ∇f is 8-Lipschitz and L=3 is valid. The nonsmooth term g=(1/5)∥⋅∥1 is proper, closed and convex by [F3]. Also XTy=(2,1), so ∇f(θ0)=(−2,−1) and θ0−∇f(θ0)/3=(2/3,1/3).

2.1F2F3step 1.1algebra∎

The nonsmooth term is g=(1/5)∥⋅∥1, and the proximal parameter is 1/3, so its soft-threshold level is (1/3)(1/5)=1/15. Applying [F3] to (2/3,1/3) gives (2/3−1/15,1/3−1/15)=(3/5,4/15).

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Projected gradient on the nonnegative orthant

Example

Let C=R+2={x:x1≥0,x2≥0} and f(x)=12((x1+2)2+x22),x0=(0,0),L=2. Then L is a valid gradient-Lipschitz constant, the projected-gradient step stays at x1=(0,0), and −∇f(x1)=(−2,0)∈NC(x1). The KKT multipliers for inequalities −xi≤0 are λ=(2,0), so the fixed point is a global constrained minimizer.

Facts & Assumptions

Given: The objective, orthant, initial point and step constant in the Example.

[F1]

Proximal-gradient, FISTA, and fixed-period restarted FISTA: a projected-gradient update is PC(x−∇f(x)/L).

[F2]

The proximal map of an indicator is Euclidean projection: the proximal map of ιC is PC.

[F3]

Projected-gradient fixed points are normal-cone certificates: for a convex smooth objective and polyhedral C, a vanishing projected-gradient mapping is equivalent to the outward normal condition; a feasible KKT tuple certifies a global minimum.

Verification

1.1F1F2givenalgebra

The function is a continuously differentiable convex quadratic, with f((1−α)x+αz)=(1−α)f(x)+αf(z)−α(1−α)2∥x−z∥22(0≤α≤1). Its gradient is ∇f(x)=(x1+2,x2), whose Lipschitz constant is 1, hence L=2 is valid. At x0, the unprojected point is x0−∇f(x0)/2=(−1,0); coordinatewise projection onto C gives x1=(0,0). Repeating the same computation shows the iterate remains there.

2.1F3step 1.1givenalgebra∎

For every z∈C, ⟨(−2,0),z−(0,0)⟩=−2z1≤0, hence (−2,0)∈NC(0) by the outward-cone definition. Equivalently, write C as −xi≤0 with G=−I,d=0; at x∗=0, λ=(2,0)≥0 has zero complementarity and ∇f(0)+GTλ=(2,0)−(2,0)=0. By [F3], this KKT tuple certifies global minimality and the projected-gradient fixed point.

Sources