Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 17.1 — second-order sufficient condition under linear constraints

Proved
VanderbeiLP.CentralPath.second_order_sufficient

by mikedeng1 · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

lagrange-multipliersnonlinear-programmingp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1second-order-conditions

Consider the equality-constrained problem "maximize f(x)f(x)f(x) subject to gi(x)=0g_i(x) = 0gi​(x)=0, i=1,…,mi = 1, \dots, mi=1,…,m" over x∈Rnx \in \mathbb{R}^nx∈Rn, where the constraints are linear: gi(x)=GiTx−βig_i(x) = G_i^T x - \beta_igi​(x)=GiT​x−βi​ for vectors G1,…,Gm∈RnG_1, \dots, G_m \in \mathbb{R}^nG1​,…,Gm​∈Rn and scalars β1,…,βm\beta_1, \dots, \beta_mβ1​,…,βm​, so that ∇gi≡Gi\nabla g_i \equiv G_i∇gi​≡Gi​. Let x∗x^*x∗ be a point at which fff is twice differentiable. Suppose x∗x^*x∗ is a critical point in the sense of (17.3): there are Lagrange multipliers y1,…,ym∈Ry_1, \dots, y_m \in \mathbb{R}y1​,…,ym​∈R with

g(x∗)=0,∇f(x∗)=∑i=1myi∇gi(x∗).g(x^*) = 0, \qquad \nabla f(x^*) = \sum_{i=1}^m y_i \nabla g_i(x^*).g(x∗)=0,∇f(x∗)=i=1∑m​yi​∇gi​(x∗).

Write Hf(x∗)=(∂2f/∂xi∂xj)(x∗)H_f(x^*) = \big(\partial^2 f / \partial x_i \partial x_j\big)(x^*)Hf​(x∗)=(∂2f/∂xi​∂xj​)(x∗) for the Hessian. If

ξTHf(x∗)ξ<0for each ξ≠0 satisfying ξT∇gi(x∗)=0, i=1,…,m,\xi^T H_f(x^*) \xi < 0 \qquad \text{for each } \xi \ne 0 \text{ satisfying } \xi^T \nabla g_i(x^*) = 0,\ i = 1, \dots, m,ξTHf​(x∗)ξ<0for each ξ=0 satisfying ξT∇gi​(x∗)=0, i=1,…,m,

then x∗x^*x∗ is a local maximum of fff on the feasible set {x:g(x)=0}\{x : g(x) = 0\}{x:g(x)=0}: there is a neighbourhood UUU of x∗x^*x∗ with f(x)≤f(x∗)f(x) \le f(x^*)f(x)≤f(x∗) for every feasible x∈Ux \in Ux∈U.

In the chapter this is the tool that shows the barrier problem has at most one critical point (the barrier Hessian is diagonal with negative entries).

Formalization Note The constraints are Gx=βGx = \betaGx=β for an m×nm \times nm×n matrix GGG with rows GiG_iGi​. "Twice differentiable at x∗x^*x∗" is: fff is (Fréchet) differentiable at every point of a neighbourhood of x∗x^*x∗, and its derivative x↦Df(x)x \mapsto Df(x)x↦Df(x) is differentiable at x∗x^*x∗; the quadratic form ξTHf(x∗)ξ\xi^T H_f(x^*)\xiξTHf​(x∗)ξ is D2f(x∗)(ξ)(ξ)D^2 f(x^*)(\xi)(\xi)D2f(x∗)(ξ)(ξ). The gradient condition is stated as an identity of linear functionals: Df(x∗)v=∑iyi GiTvDf(x^*)v = \sum_i y_i\, G_i^T vDf(x∗)v=∑i​yi​GiT​v for all vvv. The local maximum is relative to the feasible set, not to all of Rn\mathbb{R}^nRn.

Preamble
import Mathlib

open Matrix Filter Topology
Formal statement
namespace VanderbeiLP.CentralPath

/-- Theorem 17.1 (p. 261). Linear constraints `gᵢ(x) = (G x)ᵢ − βᵢ = 0`, `i = 1, …, m`; `f`
twice differentiable at `x*`. A critical point `x*` in the sense of (17.3) (feasible, and
`∇f(x*) = ∑ᵢ yᵢ ∇gᵢ(x*)` for some multipliers `y`) at which `ξᵀ H_f(x*) ξ < 0` (17.4) for every
`ξ ≠ 0` with `ξᵀ ∇gᵢ(x*) = 0` (17.5) is a local maximum of `f` on the feasible set. -/
theorem second_order_sufficient {m n : ℕ} (f : (Fin n → ℝ) → ℝ)
    (G : Matrix (Fin m) (Fin n) ℝ) (β : Fin m → ℝ) (xstar : Fin n → ℝ) (y : Fin m → ℝ)
    (hf : ∀ᶠ x in 𝓝 xstar, DifferentiableAt ℝ f x)
    (hf2 : DifferentiableAt ℝ (fderiv ℝ f) xstar)
    (hfeas : G *ᵥ xstar = β)
    (hcrit : ∀ v : Fin n → ℝ, fderiv ℝ f xstar v = ∑ i, y i * (G i ⬝ᵥ v))
    (hhess : ∀ ξ : Fin n → ℝ, ξ ≠ 0 → (∀ i, ξ ⬝ᵥ G i = 0) →
      fderiv ℝ (fderiv ℝ f) xstar ξ ξ < 0) :
    IsLocalMaxOn f {x | G *ᵥ x = β} xstar := by sorry

end VanderbeiLP.CentralPath
Source
Vanderbei, Linear Programming: Foundations and Extensions, 4th ed., Springer 2014, pp. 261–262, Theorem 17.1 with Eqs. (17.4)–(17.5) (PDF pp. 271–272); critical point: p. 260, Eq. (17.3) (PDF p. 270); "twice differentiable": p. 259 (PDF p. 269)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me