Lemma 8.3 — entries of are at most w.p.
ProvedTraceEstimation.UnitVector.mixing_matrix_entry_boundLet , let be an orthogonal seed matrix with , and let be the random mixing matrix, diagonal with i.i.d. Rademacher entries. Let be an matrix with orthonormal columns (). Then for every , with probability at least , for all and ,
The mixing matrix thus prevents the entries of an orthonormal matrix from being large: every entry of is, with high probability, within a logarithmic factor of . 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 of under signMeasure n; mixingMatrix F d. The paper writes for the seed ; since almost surely the two readings agree. For the claim is vacuous in ; when Lean's Real.sqrt of the negative logarithm is , but then and , so the claim is trivially true there as on the page.
import Mathlib import Definitions.Def_TraceEstimation_UnitVector_mixingMatrix
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.