Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7, p. 38 — y ↦ ((1/n)Σ|yᵢ|^{k*})^{1/k*} is n^{−1/(2∨k*)}-Lipschitz for ‖·‖₂

Proved
UniformDRO.Concentration.lemma_7

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

concentrationlipschitzlp-normp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let k>1k>1k>1, k∗=k/(k−1)k_*=k/(k-1)k∗​=k/(k−1) and n≥1n\ge1n≥1. For all y,y′∈Rny,y'\in\mathbb R^ny,y′∈Rn,

∣(1n∑i=1n∣yi∣k∗)1/k∗−(1n∑i=1n∣yi′∣k∗)1/k∗∣≤n−1/(2∨k∗) ∥y−y′∥2,\bigg|\Big(\frac1n\sum_{i=1}^n|y_i|^{k_*}\Big)^{1/k_*}-\Big(\frac1n\sum_{i=1}^n|y'_i|^{k_*}\Big)^{1/k_*}\bigg|\le n^{-1/(2\vee k_*)}\,\|y-y'\|_2 ,​(n1​i=1∑n​∣yi​∣k∗​)1/k∗​−(n1​i=1∑n​∣yi′​∣k∗​)1/k∗​​≤n−1/(2∨k∗​)∥y−y′∥2​,

that is, the normalized ℓk∗\ell_{k_*}ℓk∗​​-norm is n−1/(2∨k∗)n^{-1/(2\vee k_*)}n−1/(2∨k∗​)-Lipschitz with respect to the Euclidean norm.

It gives the Lipschitz constant of the plug-in dual objective gk(η;P^n)g_k(\eta;\widehat P_n)gk​(η;Pn​) as a function of the data, the input to the convex concentration inequality in (28).

Formalization Note The Euclidean distance is written out as ∑i(yi−yi′)2\sqrt{\sum_i(y_i-y'_i)^2}∑i​(yi​−yi′​)2​, because the default norm on Fin n → ℝ is the sup norm.

Preamble
import Mathlib
import Definitions.Def_UniformDRO_Concentration_RobustRisk
Formal statement
namespace UniformDRO.Concentration

/-- Lemma 7 (Duchi & Namkoong, arXiv:1810.08750v6, App. C.1, p. 38): the map
`y ↦ ((1/n) ∑ᵢ |yᵢ|^{k*})^{1/k*}` on `ℝⁿ` is `n^{-1/(2 ∨ k*)}`-Lipschitz for the Euclidean norm.
The Euclidean distance is written out as `√(∑ᵢ (yᵢ - y'ᵢ)²)`, since the default norm on
`Fin n → ℝ` is the sup norm. -/
theorem lemma_7 (k : ℝ) (hk : 1 < k) (n : ℕ) (hn : 0 < n) (y y' : Fin n → ℝ) :
    |((1 / n : ℝ) * ∑ i, |y i| ^ kstar k) ^ (1 / kstar k) -
        ((1 / n : ℝ) * ∑ i, |y' i| ^ kstar k) ^ (1 / kstar k)| ≤
      (n : ℝ) ^ (-(1 / max 2 (kstar k))) * Real.sqrt (∑ i, (y i - y' i) ^ 2) := by sorry

end UniformDRO.Concentration
Source
Duchi & Namkoong, arXiv:1810.08750v6, Lemma 7, App. C.1, p. 38; proof pp. 38–39
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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