(iii″) — for K₂ = Q, condition (iii) says the columns of Y and the first-column differences lie in K
ProvedLovaszSchrijver.IntegerHull.mem_M_Q_iff_columnsLet be a closed convex cone in , and let be an real matrix that is symmetric and satisfies for (conditions (i) and (ii)). Write for the th column of (). Then if and only if
In the paper's words: "In this case, is generated by the vectors and [where ], and hence (iii′) has the following convenient form: (iii″) Every column of is in ; the difference of the first column and any other column is in ."
This column description of is the working form of condition (iii) used in the proofs of Lemmas 1.3 and 1.5.
Formalization Note Coordinates are indexed by Option ι, with none the 0th coordinate; the "first column" is column none. The paper derives (iii″) from the rewriting (iii′) , which uses ; the paper tacitly takes closed (polyhedral in all its applications), and the hypothesis IsClosed K is added for this reason.
import Mathlib import Definitions.Def_LovaszSchrijver_IntegerHull_Basic import Definitions.Def_LovaszSchrijver_IntegerHull_MatrixCone open Matrix Pointwise
namespace LovaszSchrijver.IntegerHull
theorem mem_M_Q_iff_columns {ι : Type} [Fintype ι] [DecidableEq ι]
(K : Set (Option ι → ℝ)) (hK : IsConvexCone K) (hKc : IsClosed K) (hKQ : K ⊆ Q)
(Y : Matrix (Option ι) (Option ι) ℝ) (hY_symm : Y.IsSymm)
(hY_diag : ∀ i : ι, Y (some i) (some i) = Y none (some i)) :
Y ∈ M K Q ↔
(∀ j : Option ι, Y *ᵥ Pi.single j 1 ∈ K) ∧
∀ i : ι, Y *ᵥ Pi.single none 1 - Y *ᵥ Pi.single (some i) 1 ∈ K := 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 with coordinates and . Let be the set of all finite nonnegative combinations of vectors whose coordinates are all in and whose -th coordinate is .
Let satisfy:
- is nonempty and closed under addition and under multiplication by every real ;
- is topologically closed;
- .
Let be a real matrix indexed by such that:
- is symmetric;
- for every .
For , let denote the -th column of .
The statement asserts:
Here is the set of symmetric matrices with for all and with
In this expression, , and is defined likewise. Because symmetry and the diagonal condition are assumed as hypotheses, the left-hand side holds exactly when the inequality condition holds.
Degenerate cases:
- The hypotheses are satisfiable. For example, and meet all of them.
- . Then , and the right-hand side requires every column of to be .
- Empty . Then , , and is or . is a matrix on which the hypotheses impose nothing. The right-hand side reduces to , since the second conjunct is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.