Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2 p. 3 (T*2.4.4) and Proposition 3.1, p. 8 — K* is proper and F* is a ν-self-scaled barrier for K*

Open
SelfScaledLongStep.PrimalDual.dual_isSelfScaledBarrier

by tianyipeng · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

conjugate-barrierinterior-pointself-scaled-cone

Let K⊂E=RnK\subset E=\mathbb R^nK⊂E=Rn be a proper cone (closed, convex, pointed, with nonempty interior), let FFF be a ν\nuν-self-scaled barrier for KKK (Definition 2.1), and let

F∗(s)=sup⁡{−⟨s,x⟩−F(x):x∈int⁡K}F_*(s)=\sup\{-\langle s,x\rangle-F(x):x\in\operatorname{int}K\}F∗​(s)=sup{−⟨s,x⟩−F(x):x∈intK}

be its conjugate barrier on the dual cone K∗={s:⟨s,x⟩≥0 ∀x∈K}K^*=\{s:\langle s,x\rangle\ge0\ \forall x\in K\}K∗={s:⟨s,x⟩≥0 ∀x∈K} (2.6). Then:

  1. K∗K^*K∗ is again a proper cone (closed, convex, pointed, with nonempty interior);
  2. F∗F_*F∗​ is a ν\nuν-self-scaled barrier for K∗K^*K∗: it is a ν\nuν-self-concordant logarithmically homogeneous (nondegenerate) barrier for K∗K^*K∗, and for all u,s∈int⁡K∗u,s\in\operatorname{int}K^*u,s∈intK∗,
F∗′′(u)s∈int⁡K∗∗=int⁡K,(F∗)∗(F∗′′(u)s)=F∗(s)−2F∗(u)−ν.F_*''(u)s\in\operatorname{int}K^{**}=\operatorname{int}K,\qquad (F_*)_*\big(F_*''(u)s\big)=F_*(s)-2F_*(u)-\nu .F∗′′​(u)s∈intK∗∗=intK,(F∗​)∗​(F∗′′​(u)s)=F∗​(s)−2F∗​(u)−ν.

This is the primal–dual symmetry of self-scaled barriers stated on p. 3 (via T*2.4.4 of Nesterov–Nemirovskii: F∗F_*F∗​ is a ν\nuν-self-concordant logarithmically homogeneous barrier for K∗K^*K∗, and K∗K^*K∗ is pointed with nonempty interior) and in Proposition 3.1, p. 8, (3.3): F(F∗′′(u)s)=F∗(s)−2F∗(u)−νF(F_*''(u)s)=F_*(s)-2F_*(u)-\nuF(F∗′′​(u)s)=F∗​(s)−2F∗​(u)−ν; the conjugate of F∗F_*F∗​ over int⁡K∗\operatorname{int}K^*intK∗ equals FFF on int⁡K\operatorname{int}KintK. It lets every result stated for the primal pair (K,F)(K,F)(K,F) be applied verbatim to the dual pair (K∗,F∗)(K^*,F_*)(K∗,F∗​), which the paper does throughout ("the corresponding statements for the dual case have an absolutely symmetric form").

Formalization Note The conclusion is IsProperCone (dualCone K) ∧ IsSelfScaledBarrier (dualCone K) (conj K F) ν with the same definitions as for the primal side, so the conjugate of the conjugate is conj (dualCone K) (conj K F); E∗E^*E∗ is identified with EEE through the Euclidean inner product.

Preamble
import Mathlib
import Definitions.Def_dualCone
import Definitions.Def_SelfScaledIPM_ShortStep_Setting

open scoped InnerProductSpace
open SelfScaledIPM.ShortStep
Formal statement
namespace SelfScaledLongStep.PrimalDual

/-- **Dual symmetry of self-scaled barriers** (p. 3, via T*2.4.4 of Nesterov–Nemirovskii, and
Proposition 3.1, p. 8). If `F` is a `ν`-self-scaled barrier for the proper cone `K`, then the dual
cone `K*` is proper and the conjugate barrier `F* = conj K F` is a `ν`-self-scaled barrier for
`K*`. -/
theorem dual_isSelfScaledBarrier {n : ℕ} (K : Set (EuclideanSpace ℝ (Fin n))) (hK : IsProperCone K)
    (F : EuclideanSpace ℝ (Fin n) → ℝ) (ν : ℝ) (hν : 1 ≤ ν) (hF : IsSelfScaledBarrier K F ν) :
    IsProperCone (ConvexOptimization.dualCone K) ∧
      IsSelfScaledBarrier (ConvexOptimization.dualCone K) (conj K F) ν := by sorry

end SelfScaledLongStep.PrimalDual
Source
Nesterov & Todd, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res. 22(1) (1997) 1–42: p. 3 (§2, K* pointed with nonempty interior; F* is a ν-self-concordant logarithmically homogeneous barrier for K* by T*2.4.4 of Nesterov–Nemirovskii 1994), and p. 8, Proposition 3.1, (3.3)

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me