Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 8.3 — entries of FU\mathcal F UFU are at most 2ηln⁡(2mn/δ)\sqrt{2\eta\ln(2mn/\delta)}2ηln(2mn/δ)​ w.p. 1−δ1-\delta1−δ

Proved
TraceEstimation.UnitVector.mixing_matrix_entry_bound

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

concentrationp2o-batch-p200ap2o-gran-per-chapterp2o-plan-paperp2o-v1rademacherrandomized-numerical-linear-algebratrace-estimation

Let n≥1n \ge 1n≥1, let F∈Rn×nF \in \mathbb{R}^{n\times n}F∈Rn×n be an orthogonal seed matrix with η=max⁡i,j∣Fij∣2\eta = \max_{i,j}|F_{ij}|^2η=maxi,j​∣Fij​∣2, and let F=FD\mathcal F = FDF=FD be the random mixing matrix, DDD diagonal with i.i.d. Rademacher entries. Let UUU be an n×mn\times mn×m matrix with orthonormal columns (UTU=ImU^TU = I_mUTU=Im​). Then for every δ>0\delta > 0δ>0, with probability at least 1−δ1-\delta1−δ, for all iii and jjj,

∣(FU)ij∣≤2ηln⁡(2mnδ).|(\mathcal F U)_{ij}| \le \sqrt{2\eta\ln\left(\frac{2mn}{\delta}\right)} .∣(FU)ij​∣≤2ηln(δ2mn​)​.

The mixing matrix thus prevents the entries of an orthonormal matrix from being large: every entry of FU\mathcal FUFU is, with high probability, within a logarithmic factor of η\sqrt{\eta}η​. The paper imports this lemma from Ailon and Chazelle (2006) and Avron, Maymounkov and Toledo (2010) without proof.

Formalization Note The probability is over the diagonal ddd of DDD under signMeasure n; F=\mathcal F = F= mixingMatrix F d. The paper writes η=max⁡∣Fij∣2\eta = \max|F_{ij}|^2η=max∣Fij​∣2 for the seed FFF; since ∣Fij∣=∣Fij∣|\mathcal F_{ij}| = |F_{ij}|∣Fij​∣=∣Fij​∣ almost surely the two readings agree. For m=0m = 0m=0 the claim is vacuous in i,ji, ji,j; when 2mn/δ<12mn/\delta < 12mn/δ<1 Lean's Real.sqrt of the negative logarithm is 000, but then δ>2\delta > 2δ>2 and 1−δ<01 - \delta < 01−δ<0, so the claim is trivially true there as on the page.

Preamble
import Mathlib
import Definitions.Def_TraceEstimation_UnitVector_mixingMatrix
Formal statement
namespace TraceEstimation.UnitVector

open MeasureTheory ProbabilityTheory Matrix Real

/-- Lemma 8.3 (Avron–Toledo, p. 8:13; Ailon–Chazelle 2006, Avron et al. 2010): let `F` be an
orthogonal `n × n` seed matrix (`n ≥ 1`), `𝓕 = F D` the random mixing matrix with `D` a diagonal
matrix of i.i.d. Rademacher signs, and `U` an `n × m` matrix with orthonormal columns. For every
`δ > 0`, with probability at least `1 - δ`, for all `i` and `j`,
`|(𝓕 U)_ij| ≤ √(2 η ln(2mn/δ))`, where `η = max |F_ij|²`. -/
theorem mixing_matrix_entry_bound {n m : ℕ} (hn : 0 < n)
    (F : Matrix (Fin n) (Fin n) ℝ) (hF : Fᵀ * F = 1)
    (U : Matrix (Fin n) (Fin m) ℝ) (hU : Uᵀ * U = 1)
    (δ : ℝ) (hδ : 0 < δ) :
    1 - δ ≤ (signMeasure n).real
      {d | ∀ i j, |(mixingMatrix F d * U) i j| ≤
        Real.sqrt (2 * eta F * Real.log (2 * (m : ℝ) * (n : ℝ) / δ))} := by sorry

end TraceEstimation.UnitVector
Source
Avron and Toledo, Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix, J. ACM 58(2), Article 8 (2011), p. 8:13, Lemma 8.3 (after Ailon and Chazelle 2006; Avron, Maymounkov and Toledo 2010)
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me