Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 5 — factorizations of p_{μ±}(t), μ± = ±2γ, and their nonnegativity for κ ≥ 1

Proved
ProjSelfConcordant.ConicExt.pmu_pm_factorization

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1polynomial-inequalityprojective-self-concordance

Let κ≥1\kappa\ge1κ≥1, ν=κ2+1\nu=\kappa^2+1ν=κ2+1, γ=(ν−2)/ν−1\gamma=(\nu-2)/\sqrt{\nu-1}γ=(ν−2)/ν−1​, so that μ±=±2γ=±2(κ2−1)/κ\mu_\pm=\pm2\gamma=\pm2(\kappa^2-1)/\kappaμ±​=±2γ=±2(κ2−1)/κ. Then for every real ttt

pμ+(t)=4κ−2(κt+1)2(κ(t2+2)(t−1)2+(κ−1)((t4+3t2+3)κ+1)),p_{\mu_+}(t)=4\kappa^{-2}(\kappa t+1)^2\bigl(\kappa(t^2+2)(t-1)^2+(\kappa-1)((t^4+3t^2+3)\kappa+1)\bigr),pμ+​​(t)=4κ−2(κt+1)2(κ(t2+2)(t−1)2+(κ−1)((t4+3t2+3)κ+1)), pμ−(t)=4κ−2(κt−1)2(κ(t2+2)(t+1)2+(κ−1)((t4+3t2+3)κ+1)),p_{\mu_-}(t)=4\kappa^{-2}(\kappa t-1)^2\bigl(\kappa(t^2+2)(t+1)^2+(\kappa-1)((t^4+3t^2+3)\kappa+1)\bigr),pμ−​​(t)=4κ−2(κt−1)2(κ(t2+2)(t+1)2+(κ−1)((t4+3t2+3)κ+1)),

and both values are nonnegative.

These factorizations certify that the sextic is nonnegative at the extreme admissible values μ=±2γ\mu=\pm2\gammaμ=±2γ, the sufficiency half of the sharp constant.

Formalization Note μ±\mu_\pmμ±​ is written directly as ±2(κ2−1)/κ\pm2(\kappa^2-1)/\kappa±2(κ2−1)/κ, which equals ±2γ\pm2\gamma±2γ for κ≥1\kappa\ge1κ≥1 (that equality is part of the companion statement pmu_inv_kappa_nonneg_iff).

Preamble
import Mathlib
import Definitions.Def_ProjSelfConcordant_ConicExt_Setting
Formal statement
namespace ProjSelfConcordant.ConicExt

/-- §2, p. 5: for `ν = κ² + 1`, `κ ≥ 1` and `μ± = ±2γ = ±2(κ² − 1)/κ`,
`p_{μ+}(t) = 4κ⁻²(κt + 1)²(κ(t² + 2)(t − 1)² + (κ − 1)((t⁴ + 3t² + 3)κ + 1))`,
`p_{μ−}(t) = 4κ⁻²(κt − 1)²(κ(t² + 2)(t + 1)² + (κ − 1)((t⁴ + 3t² + 3)κ + 1))`,
and both polynomials are nonnegative. -/
theorem pmu_pm_factorization (κ t : ℝ) (hκ : 1 ≤ κ) :
    pmu (κ ^ 2 + 1) (2 * (κ ^ 2 - 1) / κ) t
        = 4 * κ⁻¹ ^ 2 * (κ * t + 1) ^ 2
          * (κ * (t ^ 2 + 2) * (t - 1) ^ 2 + (κ - 1) * ((t ^ 4 + 3 * t ^ 2 + 3) * κ + 1)) ∧
      pmu (κ ^ 2 + 1) (-(2 * (κ ^ 2 - 1) / κ)) t
        = 4 * κ⁻¹ ^ 2 * (κ * t - 1) ^ 2
          * (κ * (t ^ 2 + 2) * (t + 1) ^ 2 + (κ - 1) * ((t ^ 4 + 3 * t ^ 2 + 3) * κ + 1)) ∧
      0 ≤ pmu (κ ^ 2 + 1) (2 * (κ ^ 2 - 1) / κ) t ∧
      0 ≤ pmu (κ ^ 2 + 1) (-(2 * (κ ^ 2 - 1) / κ)) t := by sorry

end ProjSelfConcordant.ConicExt
Source
Hildebrand, Projectively Self-Concordant Barriers, arXiv:1909.01883v2, p. 5, §2, proof of Theorem 1.5 (display for p_µ+(t), p_µ−(t))
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 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