Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (20) — Gaussian Euclidean norm lower bound

Proved
AdaptiveStepIPM.Probabilistic.equation_20

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

gaussian-concentrationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probability

Let λn\lambda_nλn​ be a standard Gaussian vector in Rn−1\mathbb R^{n-1}Rn−1. For every real ε>0\varepsilon>0ε>0,

Pr⁡ ⁣(∥λn∥2≥(1−ε)n−1)⟶1as n⟶∞.\Pr\!\left(\|\lambda_n\|_2\ge(1-\varepsilon)\sqrt{n-1}\right)\longrightarrow1 \quad\text{as }n\longrightarrow\infty.Pr(∥λn​∥2​≥(1−ε)n−1​)⟶1as n⟶∞.

This supplies the denominator control when a uniform spherical vector is represented as λn/∥λn∥2\lambda_n/\|\lambda_n\|_2λn​/∥λn​∥2​.

Formalization Note The Gaussian law is Mathlib's standard Gaussian on Euclidean space. The first few dimensions use Lean's total natural subtraction and do not affect the limit.

Preamble
import Definitions.Def_AdaptiveStepIPM_Probabilistic_Model

open MeasureTheory ProbabilityTheory Filter
Formal statement
namespace AdaptiveStepIPM.Probabilistic

/-- Equation (20), the high dimensional Gaussian norm lower bound. -/
theorem equation_20 (ε : ℝ) (hε : 0 < ε) :
    Tendsto (fun n : ℕ =>
      ((stdGaussian (EuclideanSpace ℝ (Fin (n - 1))))
        {w | (1 - ε) * Real.sqrt ((n - 1 : ℕ) : ℝ) ≤ ‖w‖}).toReal)
      atTop (nhds 1) := by sorry

end AdaptiveStepIPM.Probabilistic
Source
Mizuno, Todd, Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Cornell ORIE Technical Report No. 944 (1990, rev. 1991), p. 15, Eq. (20); https://doi.org/10.1287/moor.18.4.964
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