Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 1.3 — N(K) ⊆ (K ∩ Hᵢ) + (K ∩ Gᵢ)

Proved
LovaszSchrijver.IntegerHull.N1_subset_H_add_G

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-conelift-and-projectmatrix-conep2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let K⊆QK \subseteq QK⊆Q be a closed convex cone in Rn+1\mathbb R^{n+1}Rn+1, and let 1≤i≤n1 \le i \le n1≤i≤n. With Hi={x:xi=0}H_i = \{x : x_i = 0\}Hi​={x:xi​=0} and Gi={x:xi=x0}G_i = \{x : x_i = x_0\}Gi​={x:xi​=x0​},

N(K)⊆(K∩Hi)+(K∩Gi),N(K) \subseteq (K \cap H_i) + (K \cap G_i),N(K)⊆(K∩Hi​)+(K∩Gi​),

where +++ is the Minkowski sum {y+z:y∈K∩Hi, z∈K∩Gi}\{y + z : y \in K\cap H_i,\ z \in K \cap G_i\}{y+z:y∈K∩Hi​, z∈K∩Gi​} and N(K)=N(K,Q)N(K) = N(K, Q)N(K)=N(K,Q).

This is the geometric property of N(K)N(K)N(K): every point of N(K)N(K)N(K) splits into a point of KKK on the facet xi=0x_i = 0xi​=0 of QQQ and a point of KKK on the opposite facet xi=x0x_i = x_0xi​=x0​. It is the base case (t=1t = 1t=1) of the induction proving Theorem 1.4.

Formalization Note The paper's proof goes through (iii″), which needs KKK closed; the paper tacitly takes KKK closed (polyhedral in all its applications), and the hypothesis is added. Without it the statement fails (for the cone {x:0<x1<x0}∪{0}\{x : 0 < x_1 < x_0\} \cup \{0\}{x:0<x1​<x0​}∪{0} in R2\mathbb R^2R2, N(K)=QN(K) = QN(K)=Q while the right-hand side is {0}\{0\}{0}).

Preamble
import Mathlib
import Definitions.Def_LovaszSchrijver_IntegerHull_Basic
import Definitions.Def_LovaszSchrijver_IntegerHull_MatrixCone
open Matrix Pointwise
Formal statement
namespace LovaszSchrijver.IntegerHull

theorem N1_subset_H_add_G {ι : Type} [Fintype ι] [DecidableEq ι]
    (K : Set (Option ι → ℝ)) (hK : IsConvexCone K) (hKc : IsClosed K) (hKQ : K ⊆ Q) (i : ι) :
    N1 K ⊆ (K ∩ H i) + (K ∩ G i) := by sorry

end LovaszSchrijver.IntegerHull
Source
Lovász and Schrijver, Cones of matrices and set-functions and 0–1 optimization, SIAM J. Optim. 1(2) (1991), p. 171, Lemma 1.3
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let ι\iotaι be a finite type with decidable equality, and let Vι=R{0}⊔ιV_\iota = \mathbb{R}^{\{0\}\sqcup\iota}Vι​=R{0}⊔ι. Let QQQ be the set of finite nonnegative combinations of vectors with all coordinates in {0,1}\{0,1\}{0,1} and 000-th coordinate 111.

Let K⊆VιK \subseteq V_\iotaK⊆Vι​ satisfy:

  • nonempty and closed under addition and nonnegative scaling;
  • topologically closed;
  • contained in QQQ.

Fix a coordinate i∈ιi \in \iotai∈ι. The statement asserts

N(K,Q) ⊆ (K∩Hi)+(K∩Gi),N(K,Q) \ \subseteq\ (K \cap H_i) + (K \cap G_i),N(K,Q) ⊆ (K∩Hi​)+(K∩Gi​),

where the terms mean the following.

  • Hi={x:xi=0}H_i = \{x : x_i = 0\}Hi​={x:xi​=0} and Gi={x:xi=x0}G_i = \{x : x_i = x_0\}Gi​={x:xi​=x0​}.
  • The sum is the Minkowski sum {a+b:a∈K∩Hi, b∈K∩Gi}\{a + b : a \in K\cap H_i,\ b \in K \cap G_i\}{a+b:a∈K∩Hi​, b∈K∩Gi​}.
  • N(K,Q)={Ye0:Y∈M(K,Q)}N(K,Q) = \{Y e_0 : Y \in M(K,Q)\}N(K,Q)={Ye0​:Y∈M(K,Q)} is the set of 000-th columns of matrices YYY that satisfy:
    • YYY is symmetric;
    • Yjj=Y0jY_{jj} = Y_{0j}Yjj​=Y0j​ for all j∈ιj \in \iotaj∈ι;
    • u⊤Yv≥0u^\top Y v \ge 0u⊤Yv≥0 for all u∈K∗u \in K^*u∈K∗, v∈Q∗v \in Q^*v∈Q∗, where K∗={u:u⊤x≥0 ∀x∈K}K^* = \{u : u^\top x \ge 0\ \forall x \in K\}K∗={u:u⊤x≥0 ∀x∈K} and Q∗Q^*Q∗ is defined likewise.

Degenerate cases:

  • Nonempty ι\iotaι. The existence of iii forces ι\iotaι to be nonempty.
  • Hypotheses are satisfiable. K={0}K = \{0\}K={0} meets them. In that case the right-hand side is {0}\{0\}{0}, and the statement asserts N({0},Q)⊆{0}N(\{0\},Q) \subseteq \{0\}N({0},Q)⊆{0}.
Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me