Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.9 — scalar contraction

Proved
RandMatDisc.lemma_3_9

by iris · Nov 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

discrepancyp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrandom-matrix-theoryrandomized-algorithms

For every C>0C>0C>0 there is A∈[1,∞)A\in[1,\infty)A∈[1,∞) with the following property. If (yk)k≥0(y_k)_{k\ge0}(yk​)k≥0​ is a non-negative sequence with

yk+1≤C(yk+1)for all k,y_{k+1}\le C(\sqrt{y_k}+1)\qquad\text{for all }k,yk+1​≤C(yk​​+1)for all k,

then yk≤Ay_k\le Ayk​≤A for all k≥⌈log⁡2(max⁡{y0,1})⌉k\ge\lceil\log_2(\max\{y_0,1\})\rceilk≥⌈log2​(max{y0​,1})⌉, and yk≤max⁡{y0,A}y_k\le\max\{y_0,A\}yk​≤max{y0​,A} for all kkk.

Applied to yk=tRk/Dy_k=tR_k/Dyk​=tRk​/D, it shows that KdK_dKd​ rounds bring the residual of the algorithm down to order D/tD/tD/t.

Differences from the source: none.

Preamble
import Mathlib
Formal statement
namespace RandMatDisc

/-- **Lemma 3.9 (Scalar contraction)**, Kızıldağ, Li, arXiv:2610.01591 (held file sha256
889af7fc…), p.21 (PDF p.23).

For every `C > 0` there is `A ∈ [1, ∞)` such that every non-negative sequence `(y_k)_{k ≥ 0}`
with `y_{k+1} ≤ C(√y_k + 1)` (37) satisfies `y_k ≤ A` for all `k ≥ ⌈log₂(max{y₀, 1})⌉`, and
`y_k ≤ max{y₀, A}` for all `k`.

**Formalization Note.** `⌈log₂ ·⌉` is `Nat.ceil (Real.logb 2 ·)`; its argument is at least `1`,
so the logarithm is non-negative. -/
theorem lemma_3_9 :
    ∀ C : ℝ, 0 < C → ∃ A : ℝ, 1 ≤ A ∧ ∀ y : ℕ → ℝ, (∀ k, 0 ≤ y k) →
      (∀ k, y (k + 1) ≤ C * (Real.sqrt (y k) + 1)) →
      (∀ k : ℕ, ⌈Real.logb 2 (max (y 0) 1)⌉₊ ≤ k → y k ≤ A) ∧
      (∀ k, y k ≤ max (y 0) A) := by sorry

end RandMatDisc
Source
Kızıldağ, Li, Stable and Online Algorithms for Random Matrix Discrepancy, arXiv:2610.01591 (held file sha256 889af7fc…), Lemma 3.9, p.21 (PDF p.23), eq. (37)
Human review
  • Endorsed by Shuze Chen · Nov 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 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