Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2 — consequences of logarithmic homogeneity: F′(τx)=F′(x)/τF'(\tau x)=F'(x)/\tauF′(τx)=F′(x)/τ, F′′(τx)=F′′(x)/τ2F''(\tau x)=F''(x)/\tau^2F′′(τx)=F′′(x)/τ2, F′′(x)x=−F′(x)F''(x)x=-F'(x)F′′(x)x=−F′(x), F′′′(x)x=−2F′′(x)F'''(x)x=-2F''(x)F′′′(x)x=−2F′′(x), ⟨F′(x),x⟩=−ϑ\langle F'(x),x\rangle=-\vartheta⟨F′(x),x⟩=−ϑ

Proved
ExpConeIPM.Corrector.homogeneity_identities

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

conic-optimizationinterior-point-methodsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1self-concordant-barrier

Let K⊆RNK\subseteq\mathbb R^NK⊆RN be a proper cone (pointed, closed, convex, with nonempty interior) and let FFF be a ϑ\varthetaϑ-logarithmically homogeneous self-concordant barrier for KKK, so that in particular F(τx)=F(x)−ϑlog⁡τF(\tau x)=F(x)-\vartheta\log\tauF(τx)=F(x)−ϑlogτ for x∈int⁡Kx\in\operatorname{int}Kx∈intK and τ>0\tau>0τ>0. Then for every x∈int⁡Kx\in\operatorname{int}Kx∈intK and every τ>0\tau>0τ>0,

F′(τx)=1τF′(x),F′′(τx)=1τ2F′′(x),F′′(x)x=−F′(x),F′′′(x)[x]=−2F′′(x),⟨F′(x),x⟩=−ϑ.F'(\tau x)=\frac1\tau F'(x),\qquad F''(\tau x)=\frac1{\tau^2}F''(x),\qquad F''(x)x=-F'(x),\qquad F'''(x)[x]=-2F''(x),\qquad \langle F'(x),x\rangle=-\vartheta .F′(τx)=τ1​F′(x),F′′(τx)=τ21​F′′(x),F′′(x)x=−F′(x),F′′′(x)[x]=−2F′′(x),⟨F′(x),x⟩=−ϑ.

Here F′F'F′ is the gradient, F′′F''F′′ the Hessian, and F′′′(x)[x]F'''(x)[x]F′′′(x)[x] is the third derivative contracted once with xxx, a linear map.

These identities are the algebraic engine of the paper's analysis: F′′′(x)[x]=−2F′′(x)F'''(x)[x]=-2F''(x)F′′′(x)[x]=−2F′′(x) is what makes the corrector (16) orthogonal to the complementarity gap (Lemma 3), and ⟨F′(x),x⟩=−ϑ\langle F'(x),x\rangle=-\vartheta⟨F′(x),x⟩=−ϑ turns the centering term γμv~\gamma\mu\tilde vγμv~ into γ⟨x,s⟩\gamma\langle x,s\rangleγ⟨x,s⟩ (Lemma 4).

Formalization Note F′F'F′ is gradient F, F′′F''F′′ is the published hess F (the derivative of the gradient), and F′′′(x)[x]F'''(x)[x]F′′′(x)[x] is fderiv ℝ (hess F) x x. The barrier is the published IsLogHomBarrier, which contains the paper's two conditions (self-concordance with F∈C3F\in C^3F∈C3, logarithmic homogeneity) plus three standard ones the paper uses implicitly (boundary blow-up, the ϑ\varthetaϑ-inequality, positive definite Hessian).

Preamble
import Mathlib
import Definitions.Def_SelfScaledIPM_ShortStep_Setting

open scoped InnerProductSpace
Formal statement
namespace ExpConeIPM.Corrector

/-- **§2 homogeneity identities** (Dahl–Andersen, Math. Program. 194 (2022), p. 345). Let `K ⊆ ℝᴺ`
be a proper cone and `F` a `ϑ`-logarithmically homogeneous self-concordant barrier for `K`. Then for
every `x ∈ int K` and `τ > 0`:
`F'(τx) = (1/τ) F'(x)`, `F''(τx) = (1/τ²) F''(x)`, `F''(x)x = −F'(x)`, `F'''(x)[x] = −2F''(x)`,
`⟨F'(x), x⟩ = −ϑ`.
`F' = gradient F`, `F'' = hess F`, and `F'''(x)[x] = fderiv ℝ (hess F) x x`, a linear map. -/
theorem homogeneity_identities {N : ℕ} (K : Set (EuclideanSpace ℝ (Fin N)))
    (F : EuclideanSpace ℝ (Fin N) → ℝ) (ϑ : ℝ)
    (hK : SelfScaledIPM.ShortStep.IsProperCone K)
    (hF : SelfScaledIPM.ShortStep.IsLogHomBarrier K F ϑ)
    (x : EuclideanSpace ℝ (Fin N)) (hx : x ∈ interior K) (τ : ℝ) (hτ : 0 < τ) :
    gradient F (τ • x) = (1 / τ) • gradient F x ∧
      SelfScaledIPM.ShortStep.hess F (τ • x) = (1 / τ ^ 2) • SelfScaledIPM.ShortStep.hess F x ∧
      SelfScaledIPM.ShortStep.hess F x x = -gradient F x ∧
      fderiv ℝ (SelfScaledIPM.ShortStep.hess F) x x = (-2 : ℝ) • SelfScaledIPM.ShortStep.hess F x ∧
      ⟪gradient F x, x⟫_ℝ = -ϑ := by sorry

end ExpConeIPM.Corrector
Source
Dahl, Andersen, A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization, Math. Program. 194 (2022), p. 345, §2 (consequences of the homogeneity property)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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