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.
Bfgs updates preserve the secant equations, symmetry, and positive definiteness
Statement
Let be SPD, let , and let satisfy and . Define by Bfgs curvature pairs and Hessian/inverse updates. Then and are SPD, , , and . In particular, the two updates remain consistent inverses and satisfy their secant equations.
Facts & Assumptions
Given: The matrices , vectors , and update formulas in the Statement.
Proof
Given: The matrices , vectors , and update formulas in the Statement.
[F1] Bfgs curvature pairs and Hessian/inverse updates: and .
Put . The matrix is symmetric. For any , the first two terms of satisfy because completing the square gives the minimum at . Equality holds exactly when is a scalar multiple of . If is such a multiple, the last term is strictly positive; if it is not a multiple, the displayed minimum is strictly positive. Hence is SPD.
The matrix is symmetric. For any , put . Then If , the second term is positive. If and , then and . Thus is SPD.
Substitution of into the Hessian update gives . In the inverse update, , so .
Let and . Since , we have . Using from step 1.3, because . Thus , since is SPD by step 1.1.
Depends on
Used by
- Reduced-BFGS SQP KKT step with projected Hessian error Algorithm
- An exact Bfgs secant update on a two-variable quadratic Example
- Powell damping repairs a negative-curvature trial pair Example
- Bfgs trace and determinant identities give a matrix potential inequality Lemma
- Fixed-memory L-Bfgs curvature and scale bounds imply uniform spectral bounds Lemma
- Locally Lipschitz Hessians give the BFGS Dennis–Moré condition Lemma
- Full-memory Bfgs converges globally and linearly on a uniformly strongly convex level set Theorem
Dependency tree · two levels
3 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
- Jorge Nocedal and Stephen J. Wright, Numerical Optimization, 2nd ed. (standard reference, not scraped)
- Manuel Carreira-Perpiñán, Lecture Notes on Numerical Optimization (standard reference, not scraped)