Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7 — sup norm of a uniform spherical direction

Proved
AdaptiveStepIPM.Probabilistic.lemma_7

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

p2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrandom-subspaces

For every n≥2n\ge2n≥2, let Fn=[gn,Hn]F_n=[g_n,H_n]Fn​=[gn​,Hn​] be an orthogonal matrix, and draw vnv_nvn​ uniformly from the unit sphere in Rn−1\mathbb R^{n-1}Rn−1. The frames may vary arbitrarily with nnn. Then

Pr⁡ ⁣(∥Hnvn∥∞≤3log⁡nn)⟶1as n⟶∞.\Pr\!\left(\|H_nv_n\|_\infty \le\sqrt{\frac{3\log n}{n}}\right) \longrightarrow1\quad\text{as }n\longrightarrow\infty.Pr(∥Hn​vn​∥∞​≤n3logn​​)⟶1as n⟶∞.

This is the probabilistic coordinate bound applied to the direction from Lemma 6 in the proof of Theorem 5.

Formalization Note The spherical law is the normalized standard Gaussian law. The finitely many dimensions below two are assigned probability one in the limit expression; no orthogonal frame is requested there.

Preamble
import Definitions.Def_AdaptiveStepIPM_Probabilistic_Model

open MeasureTheory ProbabilityTheory Filter
Formal statement
namespace AdaptiveStepIPM.Probabilistic

/-- Lemma 7 for an arbitrary sequence of orthogonal frames. -/
theorem lemma_7 (F : ∀ n : ℕ, 2 ≤ n → Frame n) :
    Tendsto (fun n : ℕ =>
      if hn : 2 ≤ n then
        ((sphereGaussian (n - 1))
          {v | supNorm ((F n hn).H v) ≤
            Real.sqrt (3 * Real.log (n : ℝ) / (n : ℝ))}).toReal
      else 1) 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, Lemma 7; 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