Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Remark after Lemma 1.1 — N(K₁ ∩ K₂, K₁ ∩ K₂) ⊆ N(K₁, K₂) ⊆ N(K₁ ∩ K₂, Q)

Proved
LovaszSchrijver.IntegerHull.N_inter_subset_N_subset_N_inter_Q

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

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

Let K1,K2⊆QK_1, K_2 \subseteq QK1​,K2​⊆Q be closed convex cones in Rn+1\mathbb R^{n+1}Rn+1. Then

N(K1∩K2,K1∩K2)⊆N(K1,K2)⊆N(K1∩K2,Q).N(K_1 \cap K_2, K_1 \cap K_2) \subseteq N(K_1, K_2) \subseteq N(K_1 \cap K_2, Q).N(K1​∩K2​,K1​∩K2​)⊆N(K1​,K2​)⊆N(K1​∩K2​,Q).

The paper introduces it with "It is easy to see that"; it explains why it suffices to study the two special choices K1=K2=KK_1 = K_2 = KK1​=K2​=K and K1=KK_1 = KK1​=K, K2=QK_2 = QK2​=Q, and the operator N(K)=N(K,Q)N(K) = N(K, Q)N(K)=N(K,Q) that is iterated in Theorem 1.4.

Formalization Note The right-hand inclusion uses the rewriting (iii′), which needs Ki∗∗=KiK_i^{**} = K_iKi∗∗​=Ki​; the paper tacitly takes the cones closed (polyhedral in all its applications), and both cones are assumed closed.

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

theorem N_inter_subset_N_subset_N_inter_Q {ι : Type} [Fintype ι] [DecidableEq ι]
    (K₁ K₂ : Set (Option ι → ℝ)) (hK₁ : IsConvexCone K₁) (hK₂ : IsConvexCone K₂)
    (hK₁c : IsClosed K₁) (hK₂c : IsClosed K₂) (hK₁Q : K₁ ⊆ Q) (hK₂Q : K₂ ⊆ Q) :
    N (K₁ ∩ K₂) (K₁ ∩ K₂) ⊆ N K₁ K₂ ∧ N K₁ K₂ ⊆ N (K₁ ∩ K₂) Q := 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. 170, Section 1.a (display after Lemma 1.1)
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 K1,K2⊆VιK_1, K_2 \subseteq V_\iotaK1​,K2​⊆Vι​ each satisfy:

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

The statement asserts both inclusions

N(K1∩K2, K1∩K2) ⊆ N(K1,K2)andN(K1,K2) ⊆ N(K1∩K2, Q).N(K_1\cap K_2,\ K_1\cap K_2) \ \subseteq\ N(K_1,K_2) \qquad\text{and}\qquad N(K_1,K_2) \ \subseteq\ N(K_1 \cap K_2,\ Q).N(K1​∩K2​, K1​∩K2​) ⊆ N(K1​,K2​)andN(K1​,K2​) ⊆ N(K1​∩K2​, Q).

For sets A,BA, BA,B, N(A,B)={Ye0:Y∈M(A,B)}N(A,B) = \{Y e_0 : Y \in M(A,B)\}N(A,B)={Ye0​:Y∈M(A,B)} is the set of 000-th columns of matrices YYY, indexed by {0}⊔ι\{0\}\sqcup\iota{0}⊔ι, that satisfy:

  1. YYY is symmetric;
  2. Yii=Y0iY_{ii} = Y_{0i}Yii​=Y0i​ for all i∈ιi \in \iotai∈ι;
  3. u⊤Yv≥0u^\top Y v \ge 0u⊤Yv≥0 for all u∈A∗u \in A^*u∈A∗ and v∈B∗v \in B^*v∈B∗, where A∗={u:u⊤x≥0 ∀x∈A}A^* = \{u : u^\top x \ge 0\ \forall x \in A\}A∗={u:u⊤x≥0 ∀x∈A}.

Degenerate cases:

  • Intersection is {0}\{0\}{0}. K1∩K2K_1 \cap K_2K1​∩K2​ always contains 000. If it equals {0}\{0\}{0}, its dual cone is all of VιV_\iotaVι​, and condition 3 must then hold for all uuu (and, in the first set, for all vvv).
  • Hypotheses are satisfiable. K1=K2={0}K_1 = K_2 = \{0\}K1​=K2​={0} meets them.
  • Empty ι\iotaι. Vι=RV_\iota = \mathbb{R}Vι​=R, Q=[0,∞)Q = [0,\infty)Q=[0,∞), each KjK_jKj​ is {0}\{0\}{0} or [0,∞)[0,\infty)[0,∞), and YYY is a 1×11\times11×1 matrix.
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