Documentation

Atlas.AnAlgorithmistsToolkit.code.RVTheorem

def RudelsonVershynin.vecOuterProduct {n : } (v : Fin n) :
Matrix (Fin n) (Fin n)
Instances For
    noncomputable def RudelsonVershynin.euclideanNorm {n : } (v : Fin n) :
    Instances For
      theorem RudelsonVershynin.rv_theorem (n : ) (hn : 0 < n) {Ω : Type u_1} [MeasurableSpace Ω] (μ : MeasureTheory.Measure Ω) [MeasureTheory.IsProbabilityMeasure μ] (Y : ΩFin n) (hY_meas : Measurable Y) (t : ) (ht : 0 < t) (hY_bound : ∀ᵐ (ω : Ω) μ, euclideanNorm (Y ω) t) (hY_cov : (ω : Ω), vecOuterProduct (Y ω) μ 1) (q : ) (hq : 1 < q) {Ω' : Type u_2} [MeasurableSpace Ω'] (ν : MeasureTheory.Measure Ω') [MeasureTheory.IsProbabilityMeasure ν] (Ys : Fin qΩ'Fin n) (hYs_iid : ∀ (i : Fin q), MeasureTheory.Measure.map (Ys i) ν = MeasureTheory.Measure.map Y μ) (hYs_indep : ProbabilityTheory.iIndepFun Ys ν) :
      ∃ (k : ), 0 < k (ω' : Ω'), (ω : Ω), vecOuterProduct (Y ω) μ - (1 / q) i : Fin q, vecOuterProduct (Ys i ω') ν k * t * (Real.log q / q)