Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

An exact Bfgs secant update on a two-variable quadratic

Example

Let A=(2003) and f(x)=12xTAx on R2. Start at x0=(1,1)T with B0=H0=I. The exact steepest-descent BFGS direction is p0=−∇f(x0)=(−2,−3)T. Take the exact line-search step α0=13/35 and form the Hessian BFGS update.

Facts & Assumptions

Given: The objective, start, initial matrices, direction, and step in the Example.

[F1]

Bfgs curvature pairs and Hessian/inverse updates: s=αp, y=g+−g, and B+=B−BssTB/(sTBs)+yyT/(sTy) when sTy>0.

[F2]

Full-memory Bfgs with Wolfe search, descent reset, and Powell damping: an exact full-memory iteration uses p=−Hg and accepts a positive strong Wolfe step before updating.

[F3]

Bfgs updates preserve the secant equations, symmetry, and positive definiteness: an SPD BFGS update with positive curvature satisfies B+s=y and remains SPD.

Verification

Given: The objective, start, initial matrices, direction, and step in the Example.

[F1] Bfgs curvature pairs and Hessian/inverse updates: s=αp, y=g+−g, and B+=B−BssTB/(sTBs)+yyT/(sTy) when sTy>0.

[F2] Full-memory Bfgs with Wolfe search, descent reset, and Powell damping: an exact full-memory iteration uses p=−Hg and accepts a positive strong Wolfe step before updating.

[F3] Bfgs updates preserve the secant equations, symmetry, and positive definiteness: an SPD BFGS update with positive curvature satisfies B+s=y and remains SPD.

1.1givenF1F2algebra

The gradient is ∇f(x)=Ax, so g0=(2,3)T and the direction in [F2] is p0=−g0=(−2,−3)T. Along this ray, ϕ′(t)=g0Tp0+t p0TAp0=−13+35t, so the exact minimizer is α0=13/35.

1.2givenF2algebra

At this step ϕ′(α0)=0, which satisfies the strong curvature test for c2=2/5. The quadratic identity ϕ(α)=ϕ(0)+αϕ′(0)+12α2p0TAp0 gives ϕ(α0)−ϕ(0)=−169/70≤−(10−4)(169/35)=10−4α0ϕ′(0), so the strong Wolfe Armijo test also holds.

1.3givenF1algebra

The step and gradient change are s0=α0p0 and y0=As0=α0(−4,−9)T. Hence s0Ty0=35α02>0 and s0TB0s0=13α02>0.

2.1givenF1F3step 1.3algebra∎

Substitution in [F1] gives B1=I−113(4669)+135(16363681)=1455(5232582581193). Multiplication yields B1s0=α0(−4,−9)T=y0. The positive curvature from step 1.3 and [F3] also imply B1 is SPD.

Remarks

This verifies one exact strong-Wolfe input to the BFGS recurrence. A finite-budget bracketing search may return a different acceptable step or a failure status; this example does not claim that the search returns exactly 13/35.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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