Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 5 — the values p_μ(∓κ⁻¹) factor as products of two linear terms in μ

Proved
ProjSelfConcordant.ConicExt.pmu_at_inv_kappa

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, μ∈R\mu\in\mathbb Rμ∈R, and ν=κ2+1\nu=\kappa^2+1ν=κ2+1. Then

pμ(−κ−1)=(2(κ4+5κ2+2)κ3+μ)(2(κ2−1)κ−μ),pμ(κ−1)=(2(κ4+5κ2+2)κ3−μ)(2(κ2−1)κ+μ).p_\mu(-\kappa^{-1})=\Bigl(\frac{2(\kappa^4+5\kappa^2+2)}{\kappa^3}+\mu\Bigr)\Bigl(\frac{2(\kappa^2-1)}{\kappa}-\mu\Bigr),\qquad p_\mu(\kappa^{-1})=\Bigl(\frac{2(\kappa^4+5\kappa^2+2)}{\kappa^3}-\mu\Bigr)\Bigl(\frac{2(\kappa^2-1)}{\kappa}+\mu\Bigr).pμ​(−κ−1)=(κ32(κ4+5κ2+2)​+μ)(κ2(κ2−1)​−μ),pμ​(κ−1)=(κ32(κ4+5κ2+2)​−μ)(κ2(κ2−1)​+μ).

Evaluating the sextic at the two points ∓κ−1\mp\kappa^{-1}∓κ−1 isolates the bound ∣μ∣≤2(κ2−1)/κ|\mu|\le 2(\kappa^2-1)/\kappa∣μ∣≤2(κ2−1)/κ.

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

/-- §2, p. 5: for `ν = κ² + 1`, `κ ≥ 1`,
`p_μ(−κ⁻¹) = (2(κ⁴ + 5κ² + 2)/κ³ + μ)(2(κ² − 1)/κ − μ)` and
`p_μ(κ⁻¹) = (2(κ⁴ + 5κ² + 2)/κ³ − μ)(2(κ² − 1)/κ + μ)`. -/
theorem pmu_at_inv_kappa (κ μ : ℝ) (hκ : 1 ≤ κ) :
    pmu (κ ^ 2 + 1) μ (-κ⁻¹)
        = (2 * (κ ^ 4 + 5 * κ ^ 2 + 2) / κ ^ 3 + μ) * (2 * (κ ^ 2 - 1) / κ - μ) ∧
      pmu (κ ^ 2 + 1) μ κ⁻¹
        = (2 * (κ ^ 4 + 5 * κ ^ 2 + 2) / κ ^ 3 - μ) * (2 * (κ ^ 2 - 1) / κ + μ) := 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_µ(−κ⁻¹), p_µ(κ⁻¹))
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