Theorems · Theorem · real analysis
Set.limsup_eq_tendsto_sum_indicator_atTop
∀ {α : Type u_1} {R : Type u_2} [inst : AddCommMonoid R] [inst_1 : PartialOrder R] [IsOrderedAddMonoid R]
[AddLeftStrictMono R] [Archimedean R] {r : R},
0 < r →
∀ (s : ℕ → Set α),
Filter.limsup s Filter.atTop =
{ω | Filter.Tendsto (fun n => ∑ k ∈ Finset.range n, (s k).indicator (fun x => r) ω) Filter.atTop Filter.atTop}- Cited by
- 1 results in Mathlib
- Foundations
- Depth 98 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites21
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- AddCommMonoidstatement and proof · cited by 12,281
- Filterproof · cited by 8,121
- PartialOrderstatement and proof · cited by 6,410
- Set.ofPredstatement and proof · cited by 6,101
- Finset.sumstatement and proof · cited by 5,195
- Filter.Tendstostatement and proof · cited by 3,814
- Filter.atTopstatement and proof · cited by 2,405
- Set.extproof · cited by 2,266
- IsOrderedAddMonoidstatement and proof · cited by 1,659
- Finset.rangestatement and proof · cited by 1,341
- Set.indicatorstatement and proof · cited by 723
Cited by1
Results whose statement or proof uses this declaration.
- MeasureTheory.ae_mem_limsup_atTop_iffproof · cited by 1