Remark after Lemma 1.1 — N(K₁ ∩ K₂, K₁ ∩ K₂) ⊆ N(K₁, K₂) ⊆ N(K₁ ∩ K₂, Q)
ProvedLovaszSchrijver.IntegerHull.N_inter_subset_N_subset_N_inter_QLet be closed convex cones in . Then
The paper introduces it with "It is easy to see that"; it explains why it suffices to study the two special choices and , , and the operator that is iterated in Theorem 1.4.
Formalization Note The right-hand inclusion uses the rewriting (iii′), which needs ; the paper tacitly takes the cones closed (polyhedral in all its applications), and both cones are assumed closed.
import Mathlib import Definitions.Def_LovaszSchrijver_IntegerHull_Basic import Definitions.Def_LovaszSchrijver_IntegerHull_MatrixCone open Matrix Pointwise
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
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Let be a finite type with decidable equality, and let . Let be the set of finite nonnegative combinations of vectors with all coordinates in and -th coordinate .
Let each satisfy:
- nonempty and closed under addition and nonnegative scaling;
- topologically closed;
- contained in .
The statement asserts both inclusions
For sets , is the set of -th columns of matrices , indexed by , that satisfy:
- is symmetric;
- for all ;
- for all and , where .
Degenerate cases:
- Intersection is . always contains . If it equals , its dual cone is all of , and condition 3 must then hold for all (and, in the first set, for all ).
- Hypotheses are satisfiable. meets them.
- Empty . , , each is or , and is a matrix.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.