Theorem 2.4 — a proper -lift gives a -factorization of , and a -factorization gives a -lift
ProvedConeLifts.Factorization.factorization_theoremLet be a full-dimensional closed convex cone and , , a convex body (compact, convex, ). Let on be the slack operator of . Then:
- if has a proper -lift, that is for an affine subspace meeting and a linear map , then is -factorizable;
- conversely, if is -factorizable, that is, for some maps and
then has a -lift (not necessarily proper).
This is the paper's central correspondence between the geometry of lifts and the algebra of cone factorizations. It extends Yannakakis' theorem, which relates polyhedral lifts of a polytope to nonnegative factorizations of its slack matrix, to arbitrary closed convex cones, in particular to positive semidefinite lifts.
Formalization Note The two halves are a conjunction of implications, not an equivalence: properness is assumed only in the first, and the lift produced by the second may be improper. is the paper's implicit full-dimensionality of ; for the first half is false (, , ). is EuclideanSpace ℝ (Fin k), the polar is one-sided, and are total functions constrained on the extreme points only.
import Mathlib import Definitions.Def_ConeLifts_Factorization_IsConvexBody import Definitions.Def_ConeLifts_Factorization_IsClosedConvexCone import Definitions.Def_ConeLifts_Factorization_HasLift import Definitions.Def_ConeLifts_Factorization_HasProperLift import Definitions.Def_ConeLifts_Factorization_SlackFactorizable
namespace ConeLifts.Factorization
/-- **Theorem 2.4** of Gouveia, Parrilo & Thomas, *Lifts of Convex Sets and Cone Factorizations*,
arXiv:1111.3164v2, p. 4: "If C has a proper K-lift then S_C is K-factorizable. Conversely, if S_C
is K-factorizable then C has a K-lift."
Standing hypotheses (Definition 2.1, p. 3): `K ⊆ ℝᵐ` is a full-dimensional closed convex cone and
`C ⊆ ℝⁿ` is a convex body (compact, convex, `0 ∈ int C`). `1 ≤ n` is the paper's implicit
"full-dimensional convex body in ℝⁿ": for `n = 0` the first half is false. The converse
concludes a `K`-lift that need not be proper. -/
theorem factorization_theorem {n m : ℕ} (hn : 1 ≤ n)
(C : Set (EuclideanSpace ℝ (Fin n))) (hC : IsConvexBody C)
(K : Set (EuclideanSpace ℝ (Fin m))) (hK : IsClosedConvexCone K)
(hKint : (interior K).Nonempty) :
(HasProperLift K C → SlackFactorizable K C) ∧ (SlackFactorizable K C → HasLift K C) := by sorry
end ConeLifts.Factorization
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.