Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

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.

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