Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(A.4), p. 60 — for x near x₀ and small y, y ∈ Ax + a + ∂ψ_C(x) iff 0 ∈ P_L(Ah − y) + ∂ψ_T(h), h = x − x₀

Proved
RobinsonSR.Reduction.correspondence_A_4

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

generalized-equationnormal-conep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polyhedral-setreduced-formtangent-cone

Let CCC be a nonempty polyhedral convex set in Rn\mathbb R^nRn, AAA a real n×nn\times nn×n matrix and a∈Rna\in\mathbb R^na∈Rn, and suppose x0x_0x0​ solves the linear generalized equation

0∈Ax+a+∂ψC(x).(A.1)0\in Ax+a+\partial\psi_C(x).\qquad\text{(A.1)}0∈Ax+a+∂ψC​(x).(A.1)

Put y0:=Ax0+ay_0:=Ax_0+ay0​:=Ax0​+a, F:=∂ψC∗(−y0)F:=\partial\psi_C^*(-y_0)F:=∂ψC∗​(−y0​), T:=TF(x0)T:=T_F(x_0)T:=TF​(x0​), and let LLL be the subspace parallel to FFF and PLP_LPL​ the orthogonal projector on LLL. Then there are neighbourhoods NNN of x0x_0x0​ and WWW of 000 such that for every x∈Nx\in Nx∈N and y∈Wy\in Wy∈W, with h:=x−x0h:=x-x_0h:=x−x0​,

y∈Ax+a+∂ψC(x) (A.2)⟺0∈PL(Ah−y)+∂ψT(h). (A.4)y\in Ax+a+\partial\psi_C(x)\ \text{(A.2)}\quad\Longleftrightarrow\quad 0\in P_L(Ah-y)+\partial\psi_T(h).\ \text{(A.4)}y∈Ax+a+∂ψC​(x) (A.2)⟺0∈PL​(Ah−y)+∂ψT​(h). (A.4)

This is the correspondence between solutions of the perturbed linear generalized equation (A.2) near x0x_0x0​ and solutions of the reduced problem on the cone TTT; written in an orthonormal basis adapted to LLL and to the lineality space of TTT, (A.4) becomes the reduced form z∈Bw+∂ψRr×K(w)z\in Bw+\partial\psi_{\mathbb R^r\times K}(w)z∈Bw+∂ψRr×K​(w) (A.3).

Formalization Note (A.2) is written as y−(Ax+a)∈∂ψC(x)y-(Ax+a)\in\partial\psi_C(x)y−(Ax+a)∈∂ψC​(x) and (A.4), equivalently, as PLy−PL(Ah)∈∂ψT(h)P_Ly-P_L(Ah)\in\partial\psi_T(h)PL​y−PL​(Ah)∈∂ψT​(h).

Preamble
import Mathlib
import Definitions.Def_RobinsonSR_Reduction_Setting

open scoped Topology RealInnerProductSpace
Formal statement
namespace RobinsonSR.Reduction

/-- The correspondence (A.4) (Robinson 1980, p. 60). Let `C` be a nonempty polyhedral convex set
in `ℝⁿ`, `A` an `n × n` matrix, `a ∈ ℝⁿ`, and let `x₀` solve `0 ∈ A x + a + ∂ψ_C(x)` (A.1).
With `y₀ := A x₀ + a`, `F := ∂ψ*_C(-y₀)`, `T := T_F(x₀)` and `L` the subspace parallel to `F`,
there are neighbourhoods `N` of `x₀` and `W` of `0` such that for `x ∈ N` and `y ∈ W`,
`y ∈ A x + a + ∂ψ_C(x)` (A.2) holds if and only if `0 ∈ P_L(A h - y) + ∂ψ_T(h)` with
`h := x - x₀` (A.4), written here as `P_L y - P_L (A h) ∈ ∂ψ_T(h)`. -/
theorem correspondence_A_4 {n : ℕ} (C : Set (EuclideanSpace ℝ (Fin n))) (hCp : IsPolyhedral C)
    (hCne : C.Nonempty) (A : Matrix (Fin n) (Fin n) ℝ) (a x0 : EuclideanSpace ℝ (Fin n))
    (hsol : -(Matrix.toEuclideanLin A x0 + a) ∈ normalCone C x0) :
    let y0 := Matrix.toEuclideanLin A x0 + a
    let F := exposedFace C y0
    let T := tangentCone F x0
    let L := parallelSubspace F
    ∃ N ∈ 𝓝 x0, ∃ W ∈ 𝓝 (0 : EuclideanSpace ℝ (Fin n)), ∀ x ∈ N, ∀ y ∈ W,
      (y - (Matrix.toEuclideanLin A x + a) ∈ normalCone C x ↔
        L.starProjection y - L.starProjection (Matrix.toEuclideanLin A (x - x0)) ∈
          normalCone T (x - x0)) := by sorry

end RobinsonSR.Reduction
Source
Robinson, Strongly regular generalized equations, Math. Oper. Res. 5 (1980), p. 60, construction preceding Theorem A.4, (A.2) and (A.4)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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