← ALL STATEMENTS
AcceptedTheorem · Statement with omitted proof

Expected spectral error of Gaussian rangefinding

The expected residual combines the next singular value with a Frobenius-tail contribution.

Halko, Martinsson & Tropp ↗
Source label: thm:avg-spec-error-gauss

Formal statement. The assumptions and conclusion are explicit; the theorem proof is omitted (sorry).

01 / MATHEMATICAL STATEMENT

Meaning & conditions

Mathematical summary

The expected residual combines the next singular value with a Frobenius-tail contribution.

E∥(I−PY)A∥≤(1+kp−1)σk+1+ek+pp(∑j>kσj2)1/2\mathbb E\|(I-P_Y)A\|\le\left(1+\sqrt{\frac{k}{p-1}}\right)\sigma_{k+1}+\frac{e\sqrt{k+p}}p\left(\sum_{j>k}\sigma_j^2\right)^{1/2}

Assumptions & context

  • A is real, k ≥ 2, p ≥ 2, k+p ≤ min(m,n), and Y = AΩ for standard Gaussian Ω.

Source

Halko, Martinsson & Tropp. Finding structure with randomness.

Source label: thm:avg-spec-error-gauss

02 / LEAN REPRESENTATION

Formal statement

Statement with omitted proof. Expand the complete file below to read imports, local definitions and surrounding context.

theorem avg_spec_error_gauss
    {S : Type*} [MeasurableSpace S] (P : Measure S)
    (m n k p : ℕ) (A : Matrix (Fin m) (Fin n) ℝ)
    (hk : 2 ≤ k) (hp : 2 ≤ p) (hkp : k + p ≤ min m n)
    (Om : S → Matrix (Fin n) (Fin (k + p)) ℝ)
    (hOm : RNLAPhaseB.StandardGaussianTestMatrix P Om) :
    (∫ ω, ‖(1 - orthogonalProjector (A * Om ω)) * A‖ ∂P)
      ≤ (1 + Real.sqrt ((k : ℝ) / ((p : ℝ) - 1))) * singularValue A (k + 1)
        + Real.exp 1 * Real.sqrt ((k : ℝ) + (p : ℝ)) / (p : ℝ)
          * Real.sqrt (∑ j ∈ Finset.Icc (k + 1) n, singularValue A j ^ 2) := by
  sorry
Complete Lean file and local definitions
import RNLAPhaseB.B3Base
import RNLAPhaseB.Complexity

open MeasureTheory
open scoped Matrix
open scoped Matrix.Norms.L2Operator
open scoped BigOperators
open scoped ENNReal

namespace RNLAPhaseB.HMT2011.AvgSpecErrorGauss

/-- The `j`-th (1-based) singular value `σ_j` of a real `m × n` matrix `A`, computed from `A`.
The singular values are the square roots of the eigenvalues of `Aᴴ * A`, counted with
multiplicity. `σ_j` is the `j`-th largest of them: the supremum of all `s ≥ 0` such that at
least `j` of these values are `≥ s`. For `j > n` the set is empty and `sSup ∅ = 0`, which gives
the usual zero padding `σ_j = 0`. -/
noncomputable def singularValue {m n : ℕ} (A : Matrix (Fin m) (Fin n) ℝ) (j : ℕ) : ℝ := by
  classical
  exact sSup {s : ℝ | 0 ≤ s ∧
    j ≤ (Finset.univ.filter (fun i : Fin n =>
      s ≤ Real.sqrt ((Matrix.isHermitian_conjTranspose_mul_self A).eigenvalues i))).card}

/-- HMT 2011, Theorem `thm:avg-spec-error-gauss`, under the hypotheses of Theorem
`thm:avg-frob-error-gauss`.

The hypotheses are as follows. `A` is a real `m × n` matrix with singular values
`σ₁ ≥ σ₂ ≥ ⋯`. The target rank satisfies `k ≥ 2` and the oversampling parameter satisfies
`p ≥ 2`, with `k + p ≤ min {m, n}`. `Ω` is an `n × (k+p)` standard Gaussian matrix and
`Y = A Ω`.

The conclusion is
`E ‖(I - P_Y) A‖ ≤ (1 + √(k/(p-1))) σ_{k+1} + (e √(k+p) / p) (∑_{j>k} σ_j²)^{1/2}`.
Here `‖·‖` is the spectral (ℓ₂ operator) norm and `e` is Euler's number. -/
theorem avg_spec_error_gauss
    {S : Type*} [MeasurableSpace S] (P : Measure S)
    (m n k p : ℕ) (A : Matrix (Fin m) (Fin n) ℝ)
    (hk : 2 ≤ k) (hp : 2 ≤ p) (hkp : k + p ≤ min m n)
    (Om : S → Matrix (Fin n) (Fin (k + p)) ℝ)
    (hOm : RNLAPhaseB.StandardGaussianTestMatrix P Om) :
    (∫ ω, ‖(1 - orthogonalProjector (A * Om ω)) * A‖ ∂P)
      ≤ (1 + Real.sqrt ((k : ℝ) / ((p : ℝ) - 1))) * singularValue A (k + 1)
        + Real.exp 1 * Real.sqrt ((k : ℝ) + (p : ℝ)) / (p : ℝ)
          * Real.sqrt (∑ j ∈ Finset.Icc (k + 1) n, singularValue A j ^ 2) := by
  sorry

end RNLAPhaseB.HMT2011.AvgSpecErrorGauss

How to read the formalization

  • The oversampling parameter p controls both coefficients; the projector is tied to the sampled matrix.
← Back to all statements