Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-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.

Two-component design with an active demand constraint

Statement

Consider the design problem min⁡x∈R212(x12+x22)subject to 1−x1−x2≤0. At x0=(0,0), use B=I in the SQP quadratic subproblem. The exact active-set solve returns p=(1/2,1/2), and x0+p is the unique global minimizer of the nonlinear problem, with active demand constraint and multiplier 1/2.

Facts & Assumptions

Given: The quadratic objective, linear demand constraint, and SQP subproblem and exact active-set conventions.

[F1]

The linearized quadratic subproblem in sequential quadratic programming defines the SQP model as the objective gradient plus a positive-definite quadratic term and affine linearized constraints.

[F2]

Exact exhaustive active-set solve for the SQP quadratic subproblem tests feasible active KKT supports and returns an accepted exact candidate.

[F3]
[F4]

Convex KKT conditions certify a global minimum and an outward normal: a feasible KKT tuple for a convex objective with affine constraints certifies global optimality.

[A1]

The SQP model matrix at x0 is I, and all arithmetic is exact.

Proof

1.1givenA1F1algebra

At x0, ∇f(x0)=0 and the linearized inequality is 1−p1−p2≤0. The unconstrained minimizer p=0 is infeasible. On the active face p1+p2=1, stationarity for q(p)=12∥p∥22 is p−λ(1,1)T=0; combining with the face equation gives p1=p2=λ=1/2. This point is feasible with nonnegative multiplier.

2.1A1F2F3step 1.1

The positive-definite QP has a unique minimizer; its feasible KKT tuple passes the active-set acceptance filters in [F2]. By [F3] the returned step is exactly (1/2,1/2).

3.1F4algebrastep 2.1∎

The nonlinear point x∗=(1/2,1/2) is feasible and has ∇f(x∗)=(1/2,1/2), ∇g(x∗)=(−1,−1), and multiplier λ∗=1/2. Thus stationarity holds, the multiplier is nonnegative, and complementarity holds with g(x∗)=0. Since the objective is convex and the constraint affine, [F4] proves global optimality; strict convexity of the objective makes the minimizer unique.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

9 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