Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 16 — Q and Ξ are invariant under affine reparametrization

Proved
UniversalBarrier.NSC.lemma_3

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

moment-inequalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1s-concave-distribution

Let k≥2k\ge2k≥2 be an integer and let ppp be a 1k−1\tfrac1{k-1}k−11​-affine density, p∈Qp\in\mathcal Qp∈Q, i.e. p(t)=(αt+β)k−11[a,b](t)/∫ab(αu+β)k−1dup(t)=(\alpha t+\beta)^{k-1}\mathbb 1_{[a,b]}(t)/\int_a^b(\alpha u+\beta)^{k-1}dup(t)=(αt+β)k−11[a,b]​(t)/∫ab​(αu+β)k−1du with a<ba<ba<b and αt+β≥0\alpha t+\beta\ge0αt+β≥0 on [a,b][a,b][a,b]. Let α~,β~∈R\tilde\alpha,\tilde\beta\in\mathbb Rα~,β~​∈R with α~≠0\tilde\alpha\neq0α~=0 and p~(t)=∣α~∣ p(α~t+β~)\tilde p(t)=|\tilde\alpha|\,p(\tilde\alpha t+\tilde\beta)p~​(t)=∣α~∣p(α~t+β~​). Then

p~∈QandΞ(p)=Ξ(p~),\tilde p\in\mathcal Q\qquad\text{and}\qquad \Xi(p)=\Xi(\tilde p),p~​∈QandΞ(p)=Ξ(p~​),

where Ξ(p)=∣μ33(p)/μ23(p)∣\Xi(p)=\bigl|\mu_3^3(p)/\mu_2^3(p)\bigr|Ξ(p)=​μ33​(p)/μ23​(p)​.

The lemma lets the proof of inequality (4) reduce to the normalized densities ktk−11[0,1]k t^{k-1}\mathbb 1_{[0,1]}ktk−11[0,1]​ and tk−11[1,γ]t^{k-1}\mathbb 1_{[1,\gamma]}tk−11[1,γ]​ (up to normalization).

Formalization Note. Q\mathcal QQ is taken with a<ba<ba<b (the paper sets the degenerate case a=ba=ba=b aside as trivial on the same page). μ23(p)=(μ22(p))3/2\mu_2^3(p)=(\mu_2^2(p))^{3/2}μ23​(p)=(μ22​(p))3/2.

Preamble
import Mathlib
import Definitions.Def_UniversalBarrier_NSC_Model
Formal statement
namespace UniversalBarrier.NSC

theorem lemma_3 (k : ℕ) (hk : 2 ≤ k) (p : ℝ → ℝ) (hp : IsKAffine k p) (α' β' : ℝ) (hα' : α' ≠ 0) :
    IsKAffine k (fun t => |α'| * p (α' * t + β')) ∧
      Xi p = Xi (fun t => |α'| * p (α' * t + β')) := by sorry

end UniversalBarrier.NSC
Source
Lee & Yue, Universal Barrier is n-Self-Concordant, arXiv:1809.03011v4, p. 16, Lemma 3; (10), p. 7; definition of Ξ, p. 13
Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

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