Mathlib Map

Theorems · Theorem · measure theory

MeasureTheory.isTightMeasureSet_range_of_tendsto_limsup_measure_norm_gt

∀ {E : Type u_1} {mE : MeasurableSpace E} [inst : NormedAddCommGroup E] [BorelSpace E] [ProperSpace E]
  {μ : ℕ → MeasureTheory.Measure E} [∀ (i : ℕ), MeasureTheory.IsFiniteMeasure (μ i)],
  Filter.Tendsto (fun r => Filter.limsup (fun n => (μ n) {x | r < ‖x‖}) Filter.atTop) Filter.atTop (nhds 0) →
    MeasureTheory.IsTightMeasureSet (Set.range μ)

For a sequence of measures indexed by , if the function r : ℝ ↦ limsup (fun n ↦ μ n {x | r < ‖x‖}) atTop tends to 0 at infinity, then the set of measures in the sequence is tight. Compared to isTightMeasureSet_of_tendsto_measure_norm_gt, this lemma replaces a supremum over all measures by a limsup. This is possible because the sequence is indexed by .

Defined in
Mathlib.MeasureTheory.Measure.TightNormed
Cited by
1 results in Mathlib
Foundations
Depth 211 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
NormedAddCommGroupBorelSpaceProperSpaceMeasureTheory.IsFiniteMeasure

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites29

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.