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

A singular shifted Hessian produces two hard-case minimizers

Example

Take n=2, Δ=1, B=diag⁡(−2,1), and g=(0,1). The gradient is orthogonal to the most negative eigenspace. The singular multiplier leaves a free component in that eigenspace, and the boundary condition produces two distinct global minimizers.

Facts & Assumptions

[F1]

The model quadratic part is q(p)=gTp+12pTBp and its feasible set is ∥p∥2≤1 (Quadratic trust-region models and the actual-to-predicted reduction ratio).

[F2]

Feasible points satisfying the shifted-Hessian conditions are global minimizers (Global trust-region minimizers satisfy the shifted-Hessian conditions, including the hard case).

Proof

1.1givenF1algebra

The least eigenvalue is μ=−2 with eigenspace Eμ=span⁡{(1,0)}, and g⊥Eμ. The equation (B−μI)p0=−g with p0⊥Eμ gives p0=(0,−1/3), so ∥p0∥2=1/3<1. The missing boundary component has squared norm 1−1/9=8/9.

2.1givenF1F2step 1.1algebra∎

Let p±=(±22/3,−1/3). Each has norm 1, and (B+2I)p±=(0,−1)=−g with B+2I=diag⁡(0,3)⪰0. Thus both satisfy [F2] with λ=2 and are global minimizers. They are distinct, and each has q(p±)=−13+12(−2⋅89+19)=−76. This verifies the singular hard case and its two boundary choices.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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.