Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(21), App. B, p. 2325 — 0 ≤ F_β(w) − max_j(w_j − y_j) ≤ β⁻¹ log p = φ⁻¹ for β = φ log p

Proved
HighDimCLT.Hyperrect.eq_21

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

high-dimensional-cltlog-sum-expp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1smooth-max

Let p≥3p \ge 3p≥3, ϕ≥1\phi \ge 1ϕ≥1 and y∈Rpy \in \mathbb R^py∈Rp, and put β:=ϕlog⁡p\beta := \phi\log pβ:=ϕlogp. Let Fβ(w)=β−1log⁡∑j=1pexp⁡(β(wj−yj))F_\beta(w) = \beta^{-1}\log\sum_{j=1}^p \exp(\beta(w_j - y_j))Fβ​(w)=β−1log∑j=1p​exp(β(wj​−yj​)) be the smooth maximum. Then for every w∈Rpw \in \mathbb R^pw∈Rp,

0≤Fβ(w)−max⁡1≤j≤p(wj−yj)≤β−1log⁡p=ϕ−1.0 \le F_\beta(w) - \max_{1\le j\le p}(w_j - y_j) \le \beta^{-1}\log p = \phi^{-1}.0≤Fβ​(w)−1≤j≤pmax​(wj​−yj​)≤β−1logp=ϕ−1.

The smooth maximum FβF_\betaFβ​ approximates the maximum coordinate of w−yw - yw−y within ϕ−1\phi^{-1}ϕ−1, which is what lets the proof of Lemma 5.1 replace the indicator of {w≤y}\{w \le y\}{w≤y} by a smooth function of www.

Formalization Note The maximum is the finite supremum over j∈{1,…,p}j \in \{1,\dots,p\}j∈{1,…,p}; with p≥3p \ge 3p≥3 the logarithm log⁡p\log plogp is positive, so β>0\beta > 0β>0.

Preamble
import Mathlib
import Definitions.Def_HighDimCLT_Hyperrect_Setting

open MeasureTheory ProbabilityTheory
Formal statement
namespace HighDimCLT.Hyperrect

theorem eq_21 (p : ℕ) (hp : 3 ≤ p) (φ : ℝ) (hφ : 1 ≤ φ) (y w : E p) :
    0 ≤ Fβ (φ * Real.log p) y w - (⨆ j : Fin p, (w j - y j)) ∧
    Fβ (φ * Real.log p) y w - (⨆ j : Fin p, (w j - y j)) ≤ (φ * Real.log p)⁻¹ * Real.log p ∧
    (φ * Real.log p)⁻¹ * Real.log p = φ⁻¹ := by sorry

end HighDimCLT.Hyperrect
Source
Chernozhukov, Chetverikov and Kato, Central limit theorems and bootstrap in high dimensions, Ann. Probab. 45 (2017), p. 2325, App. B, display (21)
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