Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix A, (A.1), p. 20 — for k ≥ 1, λᵏᵢ = 0 or yᵏᵢ = ψᵢ for all i

Proved
PDASNewton.MMatrix.complementarity_A1

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

active-setcomplementarityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let A∈Rn×nA \in \mathbb{R}^{n\times n}A∈Rn×n, f,ψ∈Rnf,\psi \in \mathbb{R}^nf,ψ∈Rn, c∈Rc \in \mathbb{R}c∈R, and let (yk,λk)k≥0(y^k,\lambda^k)_{k\ge0}(yk,λk)k≥0​ be any run of the primal-dual active set algorithm from arbitrary initial data. Then for every k≥1k \ge 1k≥1 and every index iii,

λik=0oryik=ψi.\lambda^k_i = 0 \quad\text{or}\quad y^k_i = \psi_i .λik​=0oryik​=ψi​.

This is the complementarity property (A.1) on which the whole proof of Theorem 3.2 rests: after one iteration, every coordinate is either dual-free or primal-active.

Formalization Note No hypothesis on AAA or on ccc is needed and none is assumed. The bound k≥1k \ge 1k≥1 is essential, since (y0,λ0)(y^0,\lambda^0)(y0,λ0) is arbitrary.

Preamble
import Mathlib
import Definitions.Def_PDASNewton_MMatrix_Setting

open Filter Topology Matrix
Formal statement
namespace PDASNewton.MMatrix

theorem complementarity_A1 {n : ℕ} (A : Matrix (Fin n) (Fin n) ℝ) (f ψ : Fin n → ℝ) (c : ℝ)
    (y lam : ℕ → Fin n → ℝ) (hrun : PDASNewton.Local.IsRun A f ψ c y lam) :
    ∀ k, 1 ≤ k → ∀ i, lam k i = 0 ∨ y k i = ψ i := by sorry

end PDASNewton.MMatrix
Source
Hintermüller, Ito, Kunisch, The primal-dual active set strategy as a semismooth Newton method, HAL hal-01660511v1, p. 20, Appendix A, proof of Theorem 3.2, (A.1)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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