Proof of Lemma 2.1, (10), pp. 6–7 — if κ* > 0 and bᵀy* > 0 then bᵀy* > 0, Aᵀy* + s* = 0, s* ∈ K_*
ProvedConicQuadIPM.Homogeneous.eq_10Let be a pointed closed convex cone with dual cone , and let be a solution of the homogeneous model (7). If and (8) holds, i.e. , then
Thus satisfies the hypothesis (5) of Theorem 2.1: is a Farkas-type certificate that is infeasible.
Formalization Note is Fin n → ℝ, is the dot product u ⬝ᵥ v, is A *ᵥ x and is Aᵀ *ᵥ y; the paper's first coordinate is index 0. The standing assumption that is a pointed closed convex cone is carried as the hypothesis IsPointedClosedConvexCone K. The paper's additional assumption that has full row rank ("for convenience and without loss of generality", p. 4) is not imposed, so the statement is a (harmless) generalization. The hypotheses are exactly those of the page ( and (8)); the vanishing of , which the identity requires, is part of what is to be shown and is not assumed.
import Mathlib import Definitions.Def_ConicQuadIPM_Homogeneous_Setting
namespace ConicQuadIPM.Homogeneous
open Matrix
/-- Proof of Lemma 2.1, (10), pp. 6–7: for a solution of (7) with `κ* > 0` satisfying (8),
`bᵀy* > 0`, `Aᵀy* + s* = 0` and `s* ∈ K_*`, so `y*` is a Farkas type certificate of primal
infeasibility. -/
theorem eq_10 {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (b : Fin m → ℝ) (c : Fin n → ℝ)
(K : Set (Fin n → ℝ)) (hK : IsPointedClosedConvexCone K)
(x : Fin n → ℝ) (τ : ℝ) (y : Fin m → ℝ) (s : Fin n → ℝ) (κ : ℝ)
(h : HomFeasible A b c K x τ y s κ) (hκ : 0 < κ) (h8 : 0 < b ⬝ᵥ y) :
0 < b ⬝ᵥ y ∧ Aᵀ *ᵥ y + s = 0 ∧ s ∈ dualCone K := by sorry
end ConicQuadIPM.Homogeneous
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.