Loogle!
Result
Found 135 declarations mentioning FirstCountableTopology.
- FirstCountableTopology 📋 Mathlib.Topology.Bases
(α : Type u) [t : TopologicalSpace α] : Prop - TopologicalSpace.SecondCountableTopology.to_firstCountableTopology 📋 Mathlib.Topology.Bases
(α : Type u) [t : TopologicalSpace α] [SecondCountableTopology α] : FirstCountableTopology α - TopologicalSpace.instSecondCountableTopologyOfCountableOfFirstCountableTopology 📋 Mathlib.Topology.Bases
(α : Type u) [t : TopologicalSpace α] [Countable α] [FirstCountableTopology α] : SecondCountableTopology α - FirstCountableTopology.mk 📋 Mathlib.Topology.Bases
{α : Type u} [t : TopologicalSpace α] (nhds_generated_countable : ∀ (a : α), (nhds a).IsCountablyGenerated) : FirstCountableTopology α - FirstCountableTopology.nhds_generated_countable 📋 Mathlib.Topology.Bases
{α : Type u} {t : TopologicalSpace α} [self : FirstCountableTopology α] (a : α) : (nhds a).IsCountablyGenerated - TopologicalSpace.firstCountableTopology_induced 📋 Mathlib.Topology.Bases
(α : Type u_1) (β : Type u_2) [t : TopologicalSpace β] [FirstCountableTopology β] (f : α → β) : FirstCountableTopology α - Topology.IsEmbedding.firstCountableTopology 📋 Mathlib.Topology.Bases
{α : Type u} [t : TopologicalSpace α] {β : Type u_1} [TopologicalSpace β] [FirstCountableTopology β] {f : α → β} (hf : Topology.IsEmbedding f) : FirstCountableTopology α - Topology.IsInducing.firstCountableTopology 📋 Mathlib.Topology.Bases
{α : Type u} [t : TopologicalSpace α] {β : Type u_1} [TopologicalSpace β] [FirstCountableTopology β] {f : α → β} (hf : Topology.IsInducing f) : FirstCountableTopology α - TopologicalSpace.instFirstCountableTopologyProd 📋 Mathlib.Topology.Bases
{α : Type u} [t : TopologicalSpace α] {β : Type u_1} [TopologicalSpace β] [FirstCountableTopology α] [FirstCountableTopology β] : FirstCountableTopology (α × β) - TopologicalSpace.instFirstCountableTopologyForallOfCountable 📋 Mathlib.Topology.Bases
{ι : Type u_1} {X : ι → Type u_2} [Countable ι] [(i : ι) → TopologicalSpace (X i)] [∀ (i : ι), FirstCountableTopology (X i)] : FirstCountableTopology ((i : ι) → X i) - TopologicalSpace.Subtype.firstCountableTopology 📋 Mathlib.Topology.Bases
{α : Type u} [t : TopologicalSpace α] (s : Set α) [FirstCountableTopology α] : FirstCountableTopology ↑s - ClusterPt.exists_seq_tendsto 📋 Mathlib.Topology.Bases
{α : Type u} [t : TopologicalSpace α] [FirstCountableTopology α] {x : α} {f : Filter α} [f.IsCountablyGenerated] (hx : ClusterPt x f) : ∃ ψ, Filter.Tendsto ψ Filter.atTop (nhds x) ∧ Filter.Tendsto ψ Filter.atTop f - MapClusterPt.tendsto_subseq 📋 Mathlib.Topology.Bases
{α : Type u} [t : TopologicalSpace α] [FirstCountableTopology α] {x : α} {u : ℕ → α} (hx : MapClusterPt x Filter.atTop u) : ∃ ψ, StrictMono ψ ∧ Filter.Tendsto (u ∘ ψ) Filter.atTop (nhds x) - TopologicalSpace.FirstCountableTopology.tendsto_subseq 📋 Mathlib.Topology.Bases
{α : Type u} [t : TopologicalSpace α] [FirstCountableTopology α] {u : ℕ → α} {x : α} (hx : MapClusterPt x Filter.atTop u) : ∃ ψ, StrictMono ψ ∧ Filter.Tendsto (u ∘ ψ) Filter.atTop (nhds x) - MapClusterPt.exists_seq_tendsto 📋 Mathlib.Topology.Bases
{α : Type u} [t : TopologicalSpace α] [FirstCountableTopology α] {ι : Type u_1} {f : Filter ι} [f.IsCountablyGenerated] {x : α} {u : ι → α} (hx : MapClusterPt x f u) : ∃ ψ, Filter.Tendsto (u ∘ ψ) Filter.atTop (nhds x) ∧ Filter.Tendsto ψ Filter.atTop f - instFirstCountableTopologyOrderDual 📋 Mathlib.Topology.Order.OrderClosed
{α : Type u} [TopologicalSpace α] [h : FirstCountableTopology α] : FirstCountableTopology αᵒᵈ - UniformSpace.firstCountableTopology 📋 Mathlib.Topology.UniformSpace.Cauchy
(α : Type u) [uniformSpace : UniformSpace α] [(uniformity α).IsCountablyGenerated] : FirstCountableTopology α - IsTopologicalAddGroup.exists_antitone_basis_nhds_zero 📋 Mathlib.Topology.Algebra.Group.Neighborhood
(G : Type u_1) [TopologicalSpace G] [AddGroup G] [IsTopologicalAddGroup G] [FirstCountableTopology G] : ∃ u, (nhds 0).HasAntitoneBasis u ∧ ∀ (n : ℕ), u (n + 1) + u (n + 1) ⊆ u n - IsTopologicalGroup.exists_antitone_basis_nhds_one 📋 Mathlib.Topology.Algebra.Group.Neighborhood
(G : Type u_1) [TopologicalSpace G] [Group G] [IsTopologicalGroup G] [FirstCountableTopology G] : ∃ u, (nhds 1).HasAntitoneBasis u ∧ ∀ (n : ℕ), u (n + 1) * u (n + 1) ⊆ u n - QuotientAddGroup.instFirstCountableTopology 📋 Mathlib.Topology.Algebra.Group.Quotient
{G : Type u_1} [TopologicalSpace G] [AddGroup G] [SeparatelyContinuousAdd G] (N : AddSubgroup G) [FirstCountableTopology G] : FirstCountableTopology (G ⧸ N) - QuotientGroup.instFirstCountableTopology 📋 Mathlib.Topology.Algebra.Group.Quotient
{G : Type u_1} [TopologicalSpace G] [Group G] [SeparatelyContinuousMul G] (N : Subgroup G) [FirstCountableTopology G] : FirstCountableTopology (G ⧸ N) - QuotientAddGroup.completeSpace_left' 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
(G : Type u) [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] [FirstCountableTopology G] (N : AddSubgroup G) [N.Normal] [hG : CompleteSpace G] : CompleteSpace (G ⧸ N) - QuotientAddGroup.completeSpace_right' 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
(G : Type u) [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] [FirstCountableTopology G] (N : AddSubgroup G) [N.Normal] [CompleteSpace G] : CompleteSpace (G ⧸ N) - QuotientGroup.completeSpace_left' 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
(G : Type u) [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [FirstCountableTopology G] (N : Subgroup G) [N.Normal] [hG : CompleteSpace G] : CompleteSpace (G ⧸ N) - QuotientGroup.completeSpace_right' 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
(G : Type u) [Group G] [TopologicalSpace G] [IsTopologicalGroup G] [FirstCountableTopology G] (N : Subgroup G) [N.Normal] [CompleteSpace G] : CompleteSpace (G ⧸ N) - QuotientAddGroup.completeSpace_left 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
(G : Type u_1) [AddGroup G] [us : UniformSpace G] [IsLeftUniformAddGroup G] [FirstCountableTopology G] (N : AddSubgroup G) [N.Normal] [hG : CompleteSpace G] : CompleteSpace (G ⧸ N) - QuotientAddGroup.completeSpace_right 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
(G : Type u_1) [AddGroup G] [us : UniformSpace G] [IsRightUniformAddGroup G] [FirstCountableTopology G] (N : AddSubgroup G) [N.Normal] [hG : CompleteSpace G] : CompleteSpace (G ⧸ N) - QuotientGroup.completeSpace_left 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
(G : Type u_1) [Group G] [us : UniformSpace G] [IsLeftUniformGroup G] [FirstCountableTopology G] (N : Subgroup G) [N.Normal] [hG : CompleteSpace G] : CompleteSpace (G ⧸ N) - QuotientGroup.completeSpace_right 📋 Mathlib.Topology.Algebra.IsUniformGroup.Basic
(G : Type u_1) [Group G] [us : UniformSpace G] [IsRightUniformGroup G] [FirstCountableTopology G] (N : Subgroup G) [N.Normal] [hG : CompleteSpace G] : CompleteSpace (G ⧸ N) - TopologicalSpace.PseudoMetrizableSpace.firstCountableTopology 📋 Mathlib.Topology.Metrizable.Basic
{X : Type u_2} [TopologicalSpace X] [h : TopologicalSpace.PseudoMetrizableSpace X] : FirstCountableTopology X - eventually_const_le_iff_forall_lt_eventually_const_lt 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} {γ : Type u_2} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [FirstCountableTopology α] {l : Filter γ} [CountableInterFilter l] {f : γ → α} {a : α} : (∀ᶠ (x : γ) in l, a ≤ f x) ↔ ∀ b < a, ∀ᶠ (x : γ) in l, b < f x - eventually_le_const_iff_forall_gt_eventually_lt_const 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} {γ : Type u_2} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [FirstCountableTopology α] {l : Filter γ} [CountableInterFilter l] {f : γ → α} {a : α} : (∀ᶠ (x : γ) in l, f x ≤ a) ↔ ∀ (b : α), a < b → ∀ᶠ (x : γ) in l, f x < b - exists_seq_tendsto_sInf 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_3} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] [FirstCountableTopology α] {S : Set α} (hS : S.Nonempty) (hS' : BddBelow S) : ∃ u, Antitone u ∧ Filter.Tendsto u Filter.atTop (nhds (sInf S)) ∧ ∀ (n : ℕ), u n ∈ S - exists_seq_tendsto_sSup 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_3} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] [FirstCountableTopology α] {S : Set α} (hS : S.Nonempty) (hS' : BddAbove S) : ∃ u, Monotone u ∧ Filter.Tendsto u Filter.atTop (nhds (sSup S)) ∧ ∀ (n : ℕ), u n ∈ S - exists_seq_strictAnti_tendsto 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [NoMaxOrder α] [FirstCountableTopology α] (x : α) : ∃ u, StrictAnti u ∧ (∀ (n : ℕ), x < u n) ∧ Filter.Tendsto u Filter.atTop (nhds x) - exists_seq_strictMono_tendsto 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [NoMinOrder α] [FirstCountableTopology α] (x : α) : ∃ u, StrictMono u ∧ (∀ (n : ℕ), u n < x) ∧ Filter.Tendsto u Filter.atTop (nhds x) - exists_seq_strictAnti_tendsto' 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [FirstCountableTopology α] {x y : α} (hy : x < y) : ∃ u, StrictAnti u ∧ (∀ (n : ℕ), u n ∈ Set.Ioo x y) ∧ Filter.Tendsto u Filter.atTop (nhds x) - exists_seq_strictMono_tendsto' 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_3} [LinearOrder α] [TopologicalSpace α] [DenselyOrdered α] [OrderTopology α] [FirstCountableTopology α] {x y : α} (hy : y < x) : ∃ u, StrictMono u ∧ (∀ (n : ℕ), u n ∈ Set.Ioo y x) ∧ Filter.Tendsto u Filter.atTop (nhds x) - exists_seq_strictAnti_tendsto_nhdsWithin 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [NoMaxOrder α] [FirstCountableTopology α] (x : α) : ∃ u, StrictAnti u ∧ (∀ (n : ℕ), x < u n) ∧ Filter.Tendsto u Filter.atTop (nhdsWithin x (Set.Ioi x)) - exists_seq_strictMono_tendsto_nhdsWithin 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [NoMinOrder α] [FirstCountableTopology α] (x : α) : ∃ u, StrictMono u ∧ (∀ (n : ℕ), u n < x) ∧ Filter.Tendsto u Filter.atTop (nhdsWithin x (Set.Iio x)) - Dense.exists_seq_strictAnti_tendsto 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [NoMaxOrder α] [FirstCountableTopology α] {s : Set α} (hs : Dense s) (x : α) : ∃ u, StrictAnti u ∧ (∀ (n : ℕ), u n ∈ Set.Ioi x ∩ s) ∧ Filter.Tendsto u Filter.atTop (nhds x) - Dense.exists_seq_strictMono_tendsto 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [NoMinOrder α] [FirstCountableTopology α] {s : Set α} (hs : Dense s) (x : α) : ∃ u, StrictMono u ∧ (∀ (n : ℕ), u n ∈ Set.Iio x ∩ s) ∧ Filter.Tendsto u Filter.atTop (nhds x) - Dense.exists_seq_strictAnti_tendsto_of_lt 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [FirstCountableTopology α] {s : Set α} (hs : Dense s) {x y : α} (hy : x < y) : ∃ u, StrictAnti u ∧ (∀ (n : ℕ), u n ∈ Set.Ioo x y ∩ s) ∧ Filter.Tendsto u Filter.atTop (nhds x) - Dense.exists_seq_strictMono_tendsto_of_lt 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [FirstCountableTopology α] {s : Set α} (hs : Dense s) {x y : α} (hy : y < x) : ∃ u, StrictMono u ∧ (∀ (n : ℕ), u n ∈ Set.Ioo y x ∩ s) ∧ Filter.Tendsto u Filter.atTop (nhds x) - DenseRange.exists_seq_strictAnti_tendsto 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] {β : Type u_3} [LinearOrder β] [DenselyOrdered α] [NoMaxOrder α] [FirstCountableTopology α] {f : β → α} (hf : DenseRange f) (hmono : Monotone f) (x : α) : ∃ u, StrictAnti u ∧ (∀ (n : ℕ), f (u n) ∈ Set.Ioi x) ∧ Filter.Tendsto (f ∘ u) Filter.atTop (nhds x) - DenseRange.exists_seq_strictMono_tendsto 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] {β : Type u_3} [LinearOrder β] [DenselyOrdered α] [NoMinOrder α] [FirstCountableTopology α] {f : β → α} (hf : DenseRange f) (hmono : Monotone f) (x : α) : ∃ u, StrictMono u ∧ (∀ (n : ℕ), f (u n) ∈ Set.Iio x) ∧ Filter.Tendsto (f ∘ u) Filter.atTop (nhds x) - DenseRange.exists_seq_strictAnti_tendsto_of_lt 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] {β : Type u_3} [LinearOrder β] [DenselyOrdered α] [FirstCountableTopology α] {f : β → α} {x y : α} (hf : DenseRange f) (hmono : Monotone f) (hlt : x < y) : ∃ u, StrictAnti u ∧ (∀ (n : ℕ), f (u n) ∈ Set.Ioo x y) ∧ Filter.Tendsto (f ∘ u) Filter.atTop (nhds x) - DenseRange.exists_seq_strictMono_tendsto_of_lt 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] {β : Type u_3} [LinearOrder β] [DenselyOrdered α] [FirstCountableTopology α] {f : β → α} {x y : α} (hf : DenseRange f) (hmono : Monotone f) (hlt : y < x) : ∃ u, StrictMono u ∧ (∀ (n : ℕ), f (u n) ∈ Set.Ioo y x) ∧ Filter.Tendsto (f ∘ u) Filter.atTop (nhds x) - exists_seq_strictAnti_strictMono_tendsto 📋 Mathlib.Topology.Order.IsLUB
{α : Type u_1} [TopologicalSpace α] [LinearOrder α] [OrderTopology α] [DenselyOrdered α] [FirstCountableTopology α] {x y : α} (h : x < y) : ∃ u v, StrictAnti u ∧ StrictMono v ∧ (∀ (k : ℕ), u k ∈ Set.Ioo x y) ∧ (∀ (l : ℕ), v l ∈ Set.Ioo x y) ∧ (∀ (k l : ℕ), u k < v l) ∧ Filter.Tendsto u Filter.atTop (nhds x) ∧ Filter.Tendsto v Filter.atTop (nhds y) - DiscreteTopology.firstCountableTopology 📋 Mathlib.Topology.Instances.Discrete
{α : Type u_1} [TopologicalSpace α] [DiscreteTopology α] : FirstCountableTopology α - Multipliable.countable_mulSupport 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {G : Type u_4} [TopologicalSpace G] [CommGroup G] [IsTopologicalGroup G] {f : α → G} [FirstCountableTopology G] [T1Space G] (hf : Multipliable f) : (Function.mulSupport f).Countable - Summable.countable_support 📋 Mathlib.Topology.Algebra.InfiniteSum.Group
{α : Type u_1} {G : Type u_4} [TopologicalSpace G] [AddCommGroup G] [IsTopologicalAddGroup G] {f : α → G} [FirstCountableTopology G] [T1Space G] (hf : Summable f) : (Function.support f).Countable - eventually_le_limsup 📋 Mathlib.Topology.Order.LiminfLimsup
{α : Type u_2} {β : Type u_3} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] [FirstCountableTopology α] {f : Filter β} [CountableInterFilter f] {u : β → α} (hf : Filter.IsBoundedUnder (fun x1 x2 => x1 ≤ x2) f u := by isBoundedDefault) : ∀ᶠ (b : β) in f, u b ≤ Filter.limsup u f - eventually_liminf_le 📋 Mathlib.Topology.Order.LiminfLimsup
{α : Type u_2} {β : Type u_3} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] [FirstCountableTopology α] {f : Filter β} [CountableInterFilter f] {u : β → α} (hf : Filter.IsBoundedUnder (fun x1 x2 => x1 ≥ x2) f u := by isBoundedDefault) : ∀ᶠ (b : β) in f, Filter.liminf u f ≤ u b - exists_seq_tendsto_limsInf 📋 Mathlib.Topology.Order.LiminfLimsup
{α : Type u_2} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] [FirstCountableTopology α] {f : Filter α} [f.NeBot] [f.IsCountablyGenerated] (hc : Filter.IsCobounded (fun x1 x2 => x1 ≥ x2) f := by isBoundedDefault) (hb : Filter.IsBounded (fun x1 x2 => x1 ≥ x2) f := by isBoundedDefault) : ∃ x, Filter.Tendsto x Filter.atTop (nhds f.limsInf) ∧ Filter.Tendsto x Filter.atTop f - exists_seq_tendsto_limsSup 📋 Mathlib.Topology.Order.LiminfLimsup
{α : Type u_2} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] [FirstCountableTopology α] {f : Filter α} [f.NeBot] [f.IsCountablyGenerated] (hc : Filter.IsCobounded (fun x1 x2 => x1 ≤ x2) f := by isBoundedDefault) (hb : Filter.IsBounded (fun x1 x2 => x1 ≤ x2) f := by isBoundedDefault) : ∃ x, Filter.Tendsto x Filter.atTop (nhds f.limsSup) ∧ Filter.Tendsto x Filter.atTop f - exists_seq_tendsto_liminf 📋 Mathlib.Topology.Order.LiminfLimsup
{α : Type u_2} {β : Type u_3} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] [FirstCountableTopology α] {f : Filter β} [f.NeBot] {u : β → α} [f.IsCountablyGenerated] (hc : Filter.IsCoboundedUnder (fun x1 x2 => x1 ≥ x2) f u := by isBoundedDefault) (hb : Filter.IsBoundedUnder (fun x1 x2 => x1 ≥ x2) f u := by isBoundedDefault) : ∃ x, Filter.Tendsto (u ∘ x) Filter.atTop (nhds (Filter.liminf u f)) ∧ Filter.Tendsto x Filter.atTop f - exists_seq_tendsto_limsup 📋 Mathlib.Topology.Order.LiminfLimsup
{α : Type u_2} {β : Type u_3} [ConditionallyCompleteLinearOrder α] [TopologicalSpace α] [OrderTopology α] [FirstCountableTopology α] {f : Filter β} [f.NeBot] [f.IsCountablyGenerated] {u : β → α} (hc : Filter.IsCoboundedUnder (fun x1 x2 => x1 ≤ x2) f u := by isBoundedDefault) (hb : Filter.IsBoundedUnder (fun x1 x2 => x1 ≤ x2) f u := by isBoundedDefault) : ∃ x, Filter.Tendsto (u ∘ x) Filter.atTop (nhds (Filter.limsup u f)) ∧ Filter.Tendsto x Filter.atTop f - liminf_eq_top 📋 Mathlib.Topology.Order.LiminfLimsup
{α : Type u_2} {β : Type u_3} [CompleteLinearOrder α] [TopologicalSpace α] [FirstCountableTopology α] [OrderTopology α] {f : Filter β} [CountableInterFilter f] {u : β → α} : Filter.liminf u f = ⊤ ↔ u =ᶠ[f] ⊤ - limsup_eq_bot 📋 Mathlib.Topology.Order.LiminfLimsup
{α : Type u_2} {β : Type u_3} [CompleteLinearOrder α] [TopologicalSpace α] [FirstCountableTopology α] [OrderTopology α] {f : Filter β} [CountableInterFilter f] {u : β → α} : Filter.limsup u f = ⊥ ↔ u =ᶠ[f] ⊥ - FirstCountableTopology.frechetUrysohnSpace 📋 Mathlib.Topology.Sequences
{X : Type u_1} [TopologicalSpace X] [FirstCountableTopology X] : FrechetUrysohnSpace X - FirstCountableTopology.seq_compact_of_compact 📋 Mathlib.Topology.Sequences
{X : Type u_1} [TopologicalSpace X] [FirstCountableTopology X] [CompactSpace X] : SeqCompactSpace X - IsCompact.isSeqCompact 📋 Mathlib.Topology.Sequences
{X : Type u_1} [TopologicalSpace X] [FirstCountableTopology X] {s : Set X} (hs : IsCompact s) : IsSeqCompact s - CompactSpace.tendsto_subseq 📋 Mathlib.Topology.Sequences
{X : Type u_1} [TopologicalSpace X] [FirstCountableTopology X] [CompactSpace X] (x : ℕ → X) : ∃ a φ, StrictMono φ ∧ Filter.Tendsto (x ∘ φ) Filter.atTop (nhds a) - IsCompact.tendsto_subseq 📋 Mathlib.Topology.Sequences
{X : Type u_1} [TopologicalSpace X] [FirstCountableTopology X] {s : Set X} {x : ℕ → X} (hs : IsCompact s) (hx : ∀ (n : ℕ), x n ∈ s) : ∃ a ∈ s, ∃ φ, StrictMono φ ∧ Filter.Tendsto (x ∘ φ) Filter.atTop (nhds a) - IsCompact.tendsto_subseq' 📋 Mathlib.Topology.Sequences
{X : Type u_1} [TopologicalSpace X] [FirstCountableTopology X] {s : Set X} {x : ℕ → X} (hs : IsCompact s) (hx : ∃ᶠ (n : ℕ) in Filter.atTop, x n ∈ s) : ∃ a ∈ s, ∃ φ, StrictMono φ ∧ Filter.Tendsto (x ∘ φ) Filter.atTop (nhds a) - MeasureTheory.tendsto_measure_biInter_gt 📋 Mathlib.MeasureTheory.Measure.Continuity
{α : Type u_1} {ι : Type u_2} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {s : ι → Set α} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {a : ι} (hs : ∀ r > a, MeasureTheory.NullMeasurableSet (s r) μ) (hm : ∀ (i j : ι), a < i → i ≤ j → s i ⊆ s j) (hf : ∃ r > a, μ (s r) ≠ ⊤) : Filter.Tendsto (⇑μ ∘ s) (nhdsWithin a (Set.Ioi a)) (nhds (μ (⋂ r, ⋂ (_ : r > a), s r))) - Set.Finite.isGδ 📋 Mathlib.Topology.Separation.GDelta
{X : Type u_1} [TopologicalSpace X] [FirstCountableTopology X] {s : Set X} [T1Space X] (hs : s.Finite) : IsGδ s - IsGδ.singleton 📋 Mathlib.Topology.Separation.GDelta
{X : Type u_1} [TopologicalSpace X] [FirstCountableTopology X] [T1Space X] (x : X) : IsGδ {x} - AlexandrovDiscrete.toFirstCountable 📋 Mathlib.Topology.AlexandrovDiscrete
{α : Type u_3} [TopologicalSpace α] [AlexandrovDiscrete α] : FirstCountableTopology α - WithSeminorms.firstCountableTopology 📋 Mathlib.Analysis.LocallyConvex.WithSeminorms
{𝕜 : Type u_2} {E : Type u_6} {ι : Type u_9} [NontriviallyNormedField 𝕜] [AddCommGroup E] [Module 𝕜 E] [Countable ι] {p : SeminormFamily 𝕜 E ι} [TopologicalSpace E] (hp : WithSeminorms p) : FirstCountableTopology E - ae_essInf_le 📋 Mathlib.MeasureTheory.Function.EssSup
{α : Type u_1} {β : Type u_2} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} [ConditionallyCompleteLinearOrder β] {f : α → β} [TopologicalSpace β] [FirstCountableTopology β] [OrderTopology β] (hf : Filter.IsBoundedUnder (fun x1 x2 => x1 ≥ x2) (MeasureTheory.ae μ) f := by isBoundedDefault) : ∀ᵐ (y : α) ∂μ, essInf f μ ≤ f y - ae_le_essSup 📋 Mathlib.MeasureTheory.Function.EssSup
{α : Type u_1} {β : Type u_2} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} [ConditionallyCompleteLinearOrder β] {f : α → β} [TopologicalSpace β] [FirstCountableTopology β] [OrderTopology β] (hf : Filter.IsBoundedUnder (fun x1 x2 => x1 ≤ x2) (MeasureTheory.ae μ) f := by isBoundedDefault) : ∀ᵐ (y : α) ∂μ, f y ≤ essSup f μ - meas_essSup_lt 📋 Mathlib.MeasureTheory.Function.EssSup
{α : Type u_1} {β : Type u_2} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} [ConditionallyCompleteLinearOrder β] {f : α → β} [TopologicalSpace β] [FirstCountableTopology β] [OrderTopology β] (hf : Filter.IsBoundedUnder (fun x1 x2 => x1 ≤ x2) (MeasureTheory.ae μ) f := by isBoundedDefault) : μ {y | essSup f μ < f y} = 0 - meas_lt_essInf 📋 Mathlib.MeasureTheory.Function.EssSup
{α : Type u_1} {β : Type u_2} {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} [ConditionallyCompleteLinearOrder β] {f : α → β} [TopologicalSpace β] [FirstCountableTopology β] [OrderTopology β] (hf : Filter.IsBoundedUnder (fun x1 x2 => x1 ≥ x2) (MeasureTheory.ae μ) f := by isBoundedDefault) : μ {y | f y < essInf f μ} = 0 - MeasureTheory.continuous_setToFun_of_dominated 📋 Mathlib.MeasureTheory.Integral.SetToL1.DominatedConvergence
{α : Type u_1} {E : Type u_2} {F : Type u_3} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {T : Set α → E →L[ℝ] F} {C : ℝ} {X : Type u_4} [TopologicalSpace X] [FirstCountableTopology X] (hT : MeasureTheory.DominatedFinMeasAdditive μ T C) {fs : X → α → E} {bound : α → ℝ} (hfs_meas : ∀ (x : X), MeasureTheory.AEStronglyMeasurable (fs x) μ) (h_bound : ∀ (x : X), ∀ᵐ (a : α) ∂μ, ‖fs x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ) (h_cont : ∀ᵐ (a : α) ∂μ, Continuous fun x => fs x a) : Continuous fun x => MeasureTheory.setToFun μ T hT (fs x) - MeasureTheory.continuousAt_setToFun_of_dominated 📋 Mathlib.MeasureTheory.Integral.SetToL1.DominatedConvergence
{α : Type u_1} {E : Type u_2} {F : Type u_3} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {T : Set α → E →L[ℝ] F} {C : ℝ} {X : Type u_4} [TopologicalSpace X] [FirstCountableTopology X] (hT : MeasureTheory.DominatedFinMeasAdditive μ T C) {fs : X → α → E} {x₀ : X} {bound : α → ℝ} (hfs_meas : ∀ᶠ (x : X) in nhds x₀, MeasureTheory.AEStronglyMeasurable (fs x) μ) (h_bound : ∀ᶠ (x : X) in nhds x₀, ∀ᵐ (a : α) ∂μ, ‖fs x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ) (h_cont : ∀ᵐ (a : α) ∂μ, ContinuousAt (fun x => fs x a) x₀) : ContinuousAt (fun x => MeasureTheory.setToFun μ T hT (fs x)) x₀ - MeasureTheory.continuousOn_setToFun_of_dominated 📋 Mathlib.MeasureTheory.Integral.SetToL1.DominatedConvergence
{α : Type u_1} {E : Type u_2} {F : Type u_3} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {T : Set α → E →L[ℝ] F} {C : ℝ} {X : Type u_4} [TopologicalSpace X] [FirstCountableTopology X] (hT : MeasureTheory.DominatedFinMeasAdditive μ T C) {fs : X → α → E} {bound : α → ℝ} {s : Set X} (hfs_meas : ∀ x ∈ s, MeasureTheory.AEStronglyMeasurable (fs x) μ) (h_bound : ∀ x ∈ s, ∀ᵐ (a : α) ∂μ, ‖fs x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ) (h_cont : ∀ᵐ (a : α) ∂μ, ContinuousOn (fun x => fs x a) s) : ContinuousOn (fun x => MeasureTheory.setToFun μ T hT (fs x)) s - MeasureTheory.continuousWithinAt_setToFun_of_dominated 📋 Mathlib.MeasureTheory.Integral.SetToL1.DominatedConvergence
{α : Type u_1} {E : Type u_2} {F : Type u_3} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {T : Set α → E →L[ℝ] F} {C : ℝ} {X : Type u_4} [TopologicalSpace X] [FirstCountableTopology X] (hT : MeasureTheory.DominatedFinMeasAdditive μ T C) {fs : X → α → E} {x₀ : X} {bound : α → ℝ} {s : Set X} (hfs_meas : ∀ᶠ (x : X) in nhdsWithin x₀ s, MeasureTheory.AEStronglyMeasurable (fs x) μ) (h_bound : ∀ᶠ (x : X) in nhdsWithin x₀ s, ∀ᵐ (a : α) ∂μ, ‖fs x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ) (h_cont : ∀ᵐ (a : α) ∂μ, ContinuousWithinAt (fun x => fs x a) s x₀) : ContinuousWithinAt (fun x => MeasureTheory.setToFun μ T hT (fs x)) s x₀ - MeasureTheory.continuous_of_dominated 📋 Mathlib.MeasureTheory.Integral.Bochner.Basic
{α : Type u_1} {G : Type u_5} [NormedAddCommGroup G] [NormedSpace ℝ G] {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {X : Type u_6} [TopologicalSpace X] [FirstCountableTopology X] {F : X → α → G} {bound : α → ℝ} (hF_meas : ∀ (x : X), MeasureTheory.AEStronglyMeasurable (F x) μ) (h_bound : ∀ (x : X), ∀ᵐ (a : α) ∂μ, ‖F x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ) (h_cont : ∀ᵐ (a : α) ∂μ, Continuous fun x => F x a) : Continuous fun x => ∫ (a : α), F x a ∂μ - MeasureTheory.continuousAt_of_dominated 📋 Mathlib.MeasureTheory.Integral.Bochner.Basic
{α : Type u_1} {G : Type u_5} [NormedAddCommGroup G] [NormedSpace ℝ G] {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {X : Type u_6} [TopologicalSpace X] [FirstCountableTopology X] {F : X → α → G} {x₀ : X} {bound : α → ℝ} (hF_meas : ∀ᶠ (x : X) in nhds x₀, MeasureTheory.AEStronglyMeasurable (F x) μ) (h_bound : ∀ᶠ (x : X) in nhds x₀, ∀ᵐ (a : α) ∂μ, ‖F x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ) (h_cont : ∀ᵐ (a : α) ∂μ, ContinuousAt (fun x => F x a) x₀) : ContinuousAt (fun x => ∫ (a : α), F x a ∂μ) x₀ - MeasureTheory.continuousOn_of_dominated 📋 Mathlib.MeasureTheory.Integral.Bochner.Basic
{α : Type u_1} {G : Type u_5} [NormedAddCommGroup G] [NormedSpace ℝ G] {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {X : Type u_6} [TopologicalSpace X] [FirstCountableTopology X] {F : X → α → G} {bound : α → ℝ} {s : Set X} (hF_meas : ∀ x ∈ s, MeasureTheory.AEStronglyMeasurable (F x) μ) (h_bound : ∀ x ∈ s, ∀ᵐ (a : α) ∂μ, ‖F x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ) (h_cont : ∀ᵐ (a : α) ∂μ, ContinuousOn (fun x => F x a) s) : ContinuousOn (fun x => ∫ (a : α), F x a ∂μ) s - MeasureTheory.continuousWithinAt_of_dominated 📋 Mathlib.MeasureTheory.Integral.Bochner.Basic
{α : Type u_1} {G : Type u_5} [NormedAddCommGroup G] [NormedSpace ℝ G] {m : MeasurableSpace α} {μ : MeasureTheory.Measure α} {X : Type u_6} [TopologicalSpace X] [FirstCountableTopology X] {F : X → α → G} {x₀ : X} {bound : α → ℝ} {s : Set X} (hF_meas : ∀ᶠ (x : X) in nhdsWithin x₀ s, MeasureTheory.AEStronglyMeasurable (F x) μ) (h_bound : ∀ᶠ (x : X) in nhdsWithin x₀ s, ∀ᵐ (a : α) ∂μ, ‖F x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ) (h_cont : ∀ᵐ (a : α) ∂μ, ContinuousWithinAt (fun x => F x a) s x₀) : ContinuousWithinAt (fun x => ∫ (a : α), F x a ∂μ) s x₀ - continuous_parametric_integral_of_continuous 📋 Mathlib.MeasureTheory.Integral.Bochner.Set
{Y : Type u_2} {E : Type u_3} {X : Type u_5} [TopologicalSpace X] [TopologicalSpace Y] [MeasurableSpace Y] [OpensMeasurableSpace Y] {μ : MeasureTheory.Measure Y} [NormedAddCommGroup E] [NormedSpace ℝ E] [FirstCountableTopology X] [LocallyCompactSpace X] [SecondCountableTopologyEither Y E] [MeasureTheory.IsLocallyFiniteMeasure μ] {f : X → Y → E} (hf : Continuous (Function.uncurry f)) {s : Set Y} (hs : IsCompact s) : Continuous fun x => ∫ (y : Y) in s, f x y ∂μ - intervalIntegral.continuous_of_dominated_interval 📋 Mathlib.MeasureTheory.Integral.DominatedConvergence
{E : Type u_2} [NormedAddCommGroup E] [NormedSpace ℝ E] {μ : MeasureTheory.Measure ℝ} {X : Type u_3} [TopologicalSpace X] [FirstCountableTopology X] {F : X → ℝ → E} {bound : ℝ → ℝ} {a b : ℝ} (hF_meas : ∀ (x : X), MeasureTheory.AEStronglyMeasurable (F x) (μ.restrict (Set.uIoc a b))) (h_bound : ∀ (x : X), ∀ᵐ (t : ℝ) ∂μ, t ∈ Set.uIoc a b → ‖F x t‖ ≤ bound t) (bound_integrable : IntervalIntegrable bound μ a b) (h_cont : ∀ᵐ (t : ℝ) ∂μ, t ∈ Set.uIoc a b → Continuous fun x => F x t) : Continuous fun x => ∫ (t : ℝ) in a..b, F x t ∂μ - intervalIntegral.continuousAt_of_dominated_interval 📋 Mathlib.MeasureTheory.Integral.DominatedConvergence
{E : Type u_2} [NormedAddCommGroup E] [NormedSpace ℝ E] {μ : MeasureTheory.Measure ℝ} {X : Type u_3} [TopologicalSpace X] [FirstCountableTopology X] {F : X → ℝ → E} {x₀ : X} {bound : ℝ → ℝ} {a b : ℝ} (hF_meas : ∀ᶠ (x : X) in nhds x₀, MeasureTheory.AEStronglyMeasurable (F x) (μ.restrict (Set.uIoc a b))) (h_bound : ∀ᶠ (x : X) in nhds x₀, ∀ᵐ (t : ℝ) ∂μ, t ∈ Set.uIoc a b → ‖F x t‖ ≤ bound t) (bound_integrable : IntervalIntegrable bound μ a b) (h_cont : ∀ᵐ (t : ℝ) ∂μ, t ∈ Set.uIoc a b → ContinuousAt (fun x => F x t) x₀) : ContinuousAt (fun x => ∫ (t : ℝ) in a..b, F x t ∂μ) x₀ - intervalIntegral.continuousWithinAt_of_dominated_interval 📋 Mathlib.MeasureTheory.Integral.DominatedConvergence
{E : Type u_2} [NormedAddCommGroup E] [NormedSpace ℝ E] {μ : MeasureTheory.Measure ℝ} {X : Type u_3} [TopologicalSpace X] [FirstCountableTopology X] {F : X → ℝ → E} {x₀ : X} {bound : ℝ → ℝ} {a b : ℝ} {s : Set X} (hF_meas : ∀ᶠ (x : X) in nhdsWithin x₀ s, MeasureTheory.AEStronglyMeasurable (F x) (μ.restrict (Set.uIoc a b))) (h_bound : ∀ᶠ (x : X) in nhdsWithin x₀ s, ∀ᵐ (t : ℝ) ∂μ, t ∈ Set.uIoc a b → ‖F x t‖ ≤ bound t) (bound_integrable : IntervalIntegrable bound μ a b) (h_cont : ∀ᵐ (t : ℝ) ∂μ, t ∈ Set.uIoc a b → ContinuousWithinAt (fun x => F x t) s x₀) : ContinuousWithinAt (fun x => ∫ (t : ℝ) in a..b, F x t ∂μ) s x₀ - intervalIntegral.continuousAt_parametric_primitive_of_dominated 📋 Mathlib.MeasureTheory.Integral.DominatedConvergence
{E : Type u_1} {X : Type u_2} [NormedAddCommGroup E] [NormedSpace ℝ E] [TopologicalSpace X] {μ : MeasureTheory.Measure ℝ} [FirstCountableTopology X] {F : X → ℝ → E} (bound : ℝ → ℝ) (a b : ℝ) {a₀ b₀ : ℝ} {x₀ : X} (hF_meas : ∀ (x : X), MeasureTheory.AEStronglyMeasurable (F x) (μ.restrict (Set.uIoc a b))) (h_bound : ∀ᶠ (x : X) in nhds x₀, ∀ᵐ (t : ℝ) ∂μ.restrict (Set.uIoc a b), ‖F x t‖ ≤ bound t) (bound_integrable : IntervalIntegrable bound μ a b) (h_cont : ∀ᵐ (t : ℝ) ∂μ.restrict (Set.uIoc a b), ContinuousAt (fun x => F x t) x₀) (ha₀ : a₀ ∈ Set.Ioo a b) (hb₀ : b₀ ∈ Set.Ioo a b) (hμb₀ : μ {b₀} = 0) : ContinuousAt (fun p => ∫ (t : ℝ) in a₀..p.2, F p.1 t ∂μ) (x₀, b₀) - MeasureTheory.ae_const_le_iff_forall_lt_measure_zero 📋 Mathlib.MeasureTheory.Function.AEEqOfLIntegral
{α : Type u_1} {m0 : MeasurableSpace α} {μ : MeasureTheory.Measure α} {β : Type u_2} [LinearOrder β] [TopologicalSpace β] [OrderTopology β] [FirstCountableTopology β] (f : α → β) (c : β) : (∀ᵐ (x : α) ∂μ, c ≤ f x) ↔ ∀ b < c, μ {x | f x ≤ b} = 0 - MeasureTheory.ae_le_const_iff_forall_gt_measure_zero 📋 Mathlib.MeasureTheory.Function.AEEqOfLIntegral
{α : Type u_1} {m0 : MeasurableSpace α} {β : Type u_2} [LinearOrder β] [TopologicalSpace β] [OrderTopology β] [FirstCountableTopology β] {μ : MeasureTheory.Measure α} (f : α → β) (c : β) : (∀ᵐ (x : α) ∂μ, f x ≤ c) ↔ ∀ (b : β), c < b → μ {x | b ≤ f x} = 0 - exists_nhds_hasAntitoneBasis_absConvex_open_add_closure_subset 📋 Mathlib.Analysis.LocallyConvex.AbsConvex
(𝕜 : Type u_1) (E : Type u_2) [NontriviallyNormedField 𝕜] [PartialOrder 𝕜] [AddCommGroup E] [Module 𝕜 E] [TopologicalSpace E] [LocallyConvexSpace 𝕜 E] [ContinuousSMul 𝕜 E] [IsTopologicalAddGroup E] [ZeroLEOneClass 𝕜] [FirstCountableTopology E] : ∃ x, (nhds 0).HasAntitoneBasis x ∧ ∀ (n : ℕ), IsOpen (x n) ∧ AbsConvex 𝕜 (x n) ∧ x (n + 1) + x (n + 1) ⊆ x n ∧ closure (x (n + 1)) ⊆ x n - BddAbove.continuous_convolution_right_of_integrable 📋 Mathlib.Analysis.Convolution
{𝕜 : Type u𝕜} {G : Type uG} {E : Type uE} {E' : Type uE'} {F : Type uF} [NormedAddCommGroup E] [NormedAddCommGroup E'] [NormedAddCommGroup F] {f : G → E} {g : G → E'} [NontriviallyNormedField 𝕜] [NormedSpace 𝕜 E] [NormedSpace 𝕜 E'] [NormedSpace 𝕜 F] (L : E →L[𝕜] E' →L[𝕜] F) [MeasurableSpace G] {μ : MeasureTheory.Measure G} [NormedSpace ℝ F] [AddGroup G] [TopologicalSpace G] [IsTopologicalAddGroup G] [BorelSpace G] [FirstCountableTopology G] [SecondCountableTopologyEither G E'] (hbg : BddAbove (Set.range fun x => ‖g x‖)) (hf : MeasureTheory.Integrable f μ) (hg : Continuous g) : Continuous (MeasureTheory.convolution f g L μ) - BddAbove.continuous_convolution_left_of_integrable 📋 Mathlib.Analysis.Convolution
{𝕜 : Type u𝕜} {G : Type uG} {E : Type uE} {E' : Type uE'} {F : Type uF} [NormedAddCommGroup E] [NormedAddCommGroup E'] [NormedAddCommGroup F] {f : G → E} {g : G → E'} [NontriviallyNormedField 𝕜] [NormedSpace 𝕜 E] [NormedSpace 𝕜 E'] [NormedSpace 𝕜 F] (L : E →L[𝕜] E' →L[𝕜] F) [MeasurableSpace G] {μ : MeasureTheory.Measure G} [NormedSpace ℝ F] [AddCommGroup G] [μ.IsAddLeftInvariant] [μ.IsNegInvariant] [TopologicalSpace G] [IsTopologicalAddGroup G] [BorelSpace G] [FirstCountableTopology G] [SecondCountableTopologyEither G E] (hbf : BddAbove (Set.range fun x => ‖f x‖)) (hf : Continuous f) (hg : MeasureTheory.Integrable g μ) : Continuous (MeasureTheory.convolution f g L μ) - mem_tangentConeAt_iff_exists_seq 📋 Mathlib.Analysis.Calculus.TangentCone.Seq
{R : Type u_1} {E : Type u_2} [AddCommGroup E] [SMul R E] [TopologicalSpace E] [FirstCountableTopology E] {s : Set E} {x y : E} : y ∈ tangentConeAt R s x ↔ ∃ c d, Filter.Tendsto d Filter.atTop (nhds 0) ∧ (∀ᶠ (n : ℕ) in Filter.atTop, x + d n ∈ s) ∧ Filter.Tendsto (fun n => c n • d n) Filter.atTop (nhds y) - SchwartzMap.instFirstCountableTopology 📋 Mathlib.Analysis.Distribution.SchwartzSpace.Basic
{E : Type u_5} {F : Type u_6} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] : FirstCountableTopology (SchwartzMap E F) - VectorFourier.fourierIntegral_continuous 📋 Mathlib.Analysis.Fourier.FourierTransform
{𝕜 : Type u_1} [CommRing 𝕜] {V : Type u_2} [AddCommGroup V] [Module 𝕜 V] [MeasurableSpace V] {W : Type u_3} [AddCommGroup W] [Module 𝕜 W] {E : Type u_4} [NormedAddCommGroup E] [NormedSpace ℂ E] [TopologicalSpace 𝕜] [IsTopologicalRing 𝕜] [TopologicalSpace V] [BorelSpace V] [TopologicalSpace W] {e : AddChar 𝕜 Circle} {μ : MeasureTheory.Measure V} {L : V →ₗ[𝕜] W →ₗ[𝕜] 𝕜} [FirstCountableTopology W] (he : Continuous ⇑e) (hL : Continuous fun p => (L p.1) p.2) {f : V → E} (hf : MeasureTheory.Integrable f μ) : Continuous (VectorFourier.fourierIntegral e μ L f) - LinearMap.continuous_of_locally_bounded 📋 Mathlib.Analysis.LocallyConvex.ContinuousOfBounded
{𝕜 : Type u_1} {𝕜' : Type u_2} {E : Type u_3} {F : Type u_4} [AddCommGroup E] [TopologicalSpace E] [IsTopologicalAddGroup E] [AddCommGroup F] [TopologicalSpace F] [NontriviallyNormedField 𝕜] [Module 𝕜 E] [ContinuousSMul 𝕜 E] [NormedField 𝕜'] [Module 𝕜' F] {σ : 𝕜 →+* 𝕜'} [RingHomIsometric σ] [FirstCountableTopology E] [IsTopologicalAddGroup F] (f : E →ₛₗ[σ] F) (hf : ∀ (s : Set E), Bornology.IsVonNBounded 𝕜 s → Bornology.IsVonNBounded 𝕜' (⇑f '' s)) : Continuous ⇑f - LinearMap.continuousAt_zero_of_locally_bounded 📋 Mathlib.Analysis.LocallyConvex.ContinuousOfBounded
{𝕜 : Type u_1} {𝕜' : Type u_2} {E : Type u_3} {F : Type u_4} [AddCommGroup E] [TopologicalSpace E] [IsTopologicalAddGroup E] [AddCommGroup F] [TopologicalSpace F] [NontriviallyNormedField 𝕜] [Module 𝕜 E] [ContinuousSMul 𝕜 E] [NormedField 𝕜'] [Module 𝕜' F] {σ : 𝕜 →+* 𝕜'} [RingHomIsometric σ] [FirstCountableTopology E] (f : E →ₛₗ[σ] F) (hf : ∀ (s : Set E), Bornology.IsVonNBounded 𝕜 s → Bornology.IsVonNBounded 𝕜' (⇑f '' s)) : ContinuousAt (⇑f) 0 - MeasureTheory.IsStoppingTime.measurableSet_eq 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.measurableSet_eq' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.measurableSet_ge 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | ↑i ≤ τ ω} - MeasureTheory.IsStoppingTime.measurableSet_lt 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.measurableSet_ge' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | ↑i ≤ τ ω} - MeasureTheory.IsStoppingTime.measurableSet_lt' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.measurableSet_eq_le 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) {i j : ι} (hle : i ≤ j) : MeasurableSet {ω | τ ω = ↑i} - MeasureTheory.IsStoppingTime.measurableSet_lt_le 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) {i j : ι} (hle : i ≤ j) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.IsStoppingTime.measurableSet_lt_of_isLUB 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] (hτ : MeasureTheory.IsStoppingTime f τ) (i : ι) (h_lub : IsLUB (Set.Iio i) i) : MeasurableSet {ω | τ ω < ↑i} - MeasureTheory.integrable_stoppedProcess 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Nonempty ι] {μ : MeasureTheory.Measure Ω} {τ : Ω → WithTop ι} {E : Type u_4} {u : ι → Ω → E} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {ℱ : MeasureTheory.Filtration ι m} [NormedAddCommGroup E] [LocallyFiniteOrderBot ι] (hτ : MeasureTheory.IsStoppingTime ℱ τ) (hu : ∀ (n : ι), MeasureTheory.Integrable (u n) μ) (n : ι) : MeasureTheory.Integrable (MeasureTheory.stoppedProcess u τ n) μ - MeasureTheory.isStoppingTime_of_measurableSet_lt_of_isRightContinuous 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [ConditionallyCompleteLinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {f : MeasureTheory.Filtration ι m} [DenselyOrdered ι] [NoMaxOrder ι] {τ : Ω → WithTop ι} [f.IsRightContinuous] (hτ : ∀ (i : ι), MeasurableSet {ω | τ ω < ↑i}) : MeasureTheory.IsStoppingTime f τ - MeasureTheory.memLp_stoppedProcess 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Nonempty ι] {μ : MeasureTheory.Measure Ω} {τ : Ω → WithTop ι} {E : Type u_4} {p : ENNReal} {u : ι → Ω → E} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {ℱ : MeasureTheory.Filtration ι m} [NormedAddCommGroup E] [LocallyFiniteOrderBot ι] (hτ : MeasureTheory.IsStoppingTime ℱ τ) (hu : ∀ (n : ι), MeasureTheory.MemLp (u n) p μ) (n : ι) : MeasureTheory.MemLp (MeasureTheory.stoppedProcess u τ n) p μ - MeasureTheory.integrable_stoppedProcess_of_mem_finset 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Nonempty ι] {μ : MeasureTheory.Measure Ω} {τ : Ω → WithTop ι} {E : Type u_4} {u : ι → Ω → E} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {ℱ : MeasureTheory.Filtration ι m} [NormedAddCommGroup E] (hτ : MeasureTheory.IsStoppingTime ℱ τ) (hu : ∀ (n : ι), MeasureTheory.Integrable (u n) μ) (n : ι) {s : Finset ι} (hbdd : ∀ (ω : Ω), τ ω < ↑n → τ ω ∈ WithTop.some '' ↑s) : MeasureTheory.Integrable (MeasureTheory.stoppedProcess u τ n) μ - MeasureTheory.IsStoppingTime.iInf 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [ConditionallyCompleteLinearOrderBot ι] [TopologicalSpace ι] [OrderTopology ι] [DenselyOrdered ι] [FirstCountableTopology ι] [NoMaxOrder ι] {κ : Type u_4} [Countable κ] {f : MeasureTheory.Filtration ι m} {τ : κ → Ω → WithTop ι} [f.IsRightContinuous] (hτ : ∀ (n : κ), MeasureTheory.IsStoppingTime f (τ n)) : MeasureTheory.IsStoppingTime f fun ω => ⨅ n, τ n ω - MeasureTheory.isStoppingTime_of_measurableSet_lt_of_isRightContinuous' 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [ConditionallyCompleteLinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {f : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} [hf : f.IsRightContinuous] (hτ1 : ∀ (i : ι), MeasurableSet {ω | τ ω < ↑i}) (hτ2 : ∀ (i : ι), nhdsWithin i (Set.Ioi i) = ⊥ → MeasurableSet {ω | τ ω = ↑i}) : MeasureTheory.IsStoppingTime f τ - MeasureTheory.memLp_stoppedProcess_of_mem_finset 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [Nonempty ι] {μ : MeasureTheory.Measure Ω} {τ : Ω → WithTop ι} {E : Type u_4} {p : ENNReal} {u : ι → Ω → E} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {ℱ : MeasureTheory.Filtration ι m} [NormedAddCommGroup E] (hτ : MeasureTheory.IsStoppingTime ℱ τ) (hu : ∀ (n : ι), MeasureTheory.MemLp (u n) p μ) (n : ι) {s : Finset ι} (hbdd : ∀ (ω : Ω), τ ω < ↑n → τ ω ∈ WithTop.some '' ↑s) : MeasureTheory.MemLp (MeasureTheory.stoppedProcess u τ n) p μ - MeasureTheory.IsStoppingTime.biInf 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [ConditionallyCompleteLinearOrderBot ι] [TopologicalSpace ι] [OrderTopology ι] [DenselyOrdered ι] [FirstCountableTopology ι] [NoMaxOrder ι] {κ : Type u_4} {f : MeasureTheory.Filtration ι m} {τ : κ → Ω → WithTop ι} {s : Set κ} (hs : s.Countable) [f.IsRightContinuous] (hτ : ∀ n ∈ s, MeasureTheory.IsStoppingTime f (τ n)) : MeasureTheory.IsStoppingTime f fun ω => ⨅ n ∈ s, τ n ω - MeasureTheory.condExp_stopping_time_ae_eq_restrict_eq 📋 Mathlib.Probability.Process.Stopping
{Ω : Type u_1} {ι : Type u_3} {m : MeasurableSpace Ω} [LinearOrder ι] {μ : MeasureTheory.Measure Ω} {ℱ : MeasureTheory.Filtration ι m} {τ : Ω → WithTop ι} {E : Type u_4} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {f : Ω → E} [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] [MeasureTheory.SigmaFiniteFiltration μ ℱ] (hτ : MeasureTheory.IsStoppingTime ℱ τ) [MeasureTheory.SigmaFinite (μ.trim ⋯)] (i : ι) : μ[f | hτ.measurableSpace] =ᵐ[μ.restrict {x | τ x = ↑i}] μ[f | ↑ℱ i] - MeasureTheory.Adapted.isStoppingTime_hittingBtwn_isStoppingTime 📋 Mathlib.Probability.Process.HittingTime
{Ω : Type u_1} {β : Type u_2} {ι : Type u_3} {m : MeasurableSpace Ω} [ConditionallyCompleteLinearOrder ι] [WellFoundedLT ι] [Countable ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] [MeasurableSpace β] {f : MeasureTheory.Filtration ι m} {u : ι → Ω → β} {τ : Ω → WithTop ι} (hτ : MeasureTheory.IsStoppingTime f τ) {N : ι} (hτbdd : ∀ (x : Ω), τ x ≤ ↑N) {s : Set β} (hs : MeasurableSet s) (hf : MeasureTheory.Adapted f u) : MeasureTheory.IsStoppingTime f fun x => ↑(MeasureTheory.hittingBtwn u s (τ x).untopA N x) - DomAddAct.instFirstCountableTopology 📋 Mathlib.Topology.Algebra.Constructions.DomMulAct
{M : Type u_1} [TopologicalSpace M] [FirstCountableTopology M] : FirstCountableTopology Mᵈᵃᵃ - DomMulAct.instFirstCountableTopology 📋 Mathlib.Topology.Algebra.Constructions.DomMulAct
{M : Type u_1} [TopologicalSpace M] [FirstCountableTopology M] : FirstCountableTopology Mᵈᵐᵃ - MeasureTheory.VectorMeasure.continuous_of_dominated 📋 Mathlib.MeasureTheory.VectorMeasure.Integral
{X : Type u_2} {E : Type u_4} {F : Type u_5} {G : Type u_6} {mX : MeasurableSpace X} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] [NormedAddCommGroup G] [NormedSpace ℝ G] {μ : MeasureTheory.VectorMeasure X F} {B : E →L[ℝ] F →L[ℝ] G} {Y : Type u_7} [TopologicalSpace Y] [FirstCountableTopology Y] {F✝ : Y → X → E} {bound : X → ℝ} (hF_meas : ∀ (x : Y), MeasureTheory.AEStronglyMeasurable (F✝ x) μ.variation) (h_bound : ∀ (x : Y), ∀ᵐ (a : X) ∂μ.variation, ‖F✝ x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ.variation) (h_cont : ∀ᵐ (a : X) ∂μ.variation, Continuous fun x => F✝ x a) : Continuous fun x => ∫ᵛ (a : X), F✝ x a ∂[B; μ] - MeasureTheory.VectorMeasure.continuousAt_of_dominated 📋 Mathlib.MeasureTheory.VectorMeasure.Integral
{X : Type u_2} {E : Type u_4} {F : Type u_5} {G : Type u_6} {mX : MeasurableSpace X} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] [NormedAddCommGroup G] [NormedSpace ℝ G] {μ : MeasureTheory.VectorMeasure X F} {B : E →L[ℝ] F →L[ℝ] G} {Y : Type u_7} [TopologicalSpace Y] [FirstCountableTopology Y] {F✝ : Y → X → E} {x₀ : Y} {bound : X → ℝ} (hF_meas : ∀ᶠ (x : Y) in nhds x₀, MeasureTheory.AEStronglyMeasurable (F✝ x) μ.variation) (h_bound : ∀ᶠ (x : Y) in nhds x₀, ∀ᵐ (a : X) ∂μ.variation, ‖F✝ x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ.variation) (h_cont : ∀ᵐ (a : X) ∂μ.variation, ContinuousAt (fun x => F✝ x a) x₀) : ContinuousAt (fun x => ∫ᵛ (a : X), F✝ x a ∂[B; μ]) x₀ - MeasureTheory.VectorMeasure.continuousOn_of_dominated 📋 Mathlib.MeasureTheory.VectorMeasure.Integral
{X : Type u_2} {E : Type u_4} {F : Type u_5} {G : Type u_6} {mX : MeasurableSpace X} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] [NormedAddCommGroup G] [NormedSpace ℝ G] {μ : MeasureTheory.VectorMeasure X F} {B : E →L[ℝ] F →L[ℝ] G} {Y : Type u_7} [TopologicalSpace Y] [FirstCountableTopology Y] {F✝ : Y → X → E} {bound : X → ℝ} {s : Set Y} (hF_meas : ∀ x ∈ s, MeasureTheory.AEStronglyMeasurable (F✝ x) μ.variation) (h_bound : ∀ x ∈ s, ∀ᵐ (a : X) ∂μ.variation, ‖F✝ x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ.variation) (h_cont : ∀ᵐ (a : X) ∂μ.variation, ContinuousOn (fun x => F✝ x a) s) : ContinuousOn (fun x => ∫ᵛ (a : X), F✝ x a ∂[B; μ]) s - MeasureTheory.VectorMeasure.continuousWithinAt_of_dominated 📋 Mathlib.MeasureTheory.VectorMeasure.Integral
{X : Type u_2} {E : Type u_4} {F : Type u_5} {G : Type u_6} {mX : MeasurableSpace X} [NormedAddCommGroup E] [NormedSpace ℝ E] [NormedAddCommGroup F] [NormedSpace ℝ F] [NormedAddCommGroup G] [NormedSpace ℝ G] {μ : MeasureTheory.VectorMeasure X F} {B : E →L[ℝ] F →L[ℝ] G} {Y : Type u_7} [TopologicalSpace Y] [FirstCountableTopology Y] {F✝ : Y → X → E} {x₀ : Y} {bound : X → ℝ} {s : Set Y} (hF_meas : ∀ᶠ (x : Y) in nhdsWithin x₀ s, MeasureTheory.AEStronglyMeasurable (F✝ x) μ.variation) (h_bound : ∀ᶠ (x : Y) in nhdsWithin x₀ s, ∀ᵐ (a : X) ∂μ.variation, ‖F✝ x a‖ ≤ bound a) (bound_integrable : MeasureTheory.Integrable bound μ.variation) (h_cont : ∀ᵐ (a : X) ∂μ.variation, ContinuousWithinAt (fun x => F✝ x a) s x₀) : ContinuousWithinAt (fun x => ∫ᵛ (a : X), F✝ x a ∂[B; μ]) s x₀ - MeasureTheory.Martingale.condExp_stopping_time_ae_eq_restrict_eq_const 📋 Mathlib.Probability.Martingale.OptionalSampling
{Ω : Type u_1} {E : Type u_2} {m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {ι : Type u_3} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {ℱ : MeasureTheory.Filtration ι m} [MeasureTheory.SigmaFiniteFiltration μ ℱ] {τ : Ω → WithTop ι} {f : ι → Ω → E} {i n : ι} (h : MeasureTheory.Martingale f ℱ μ) (hτ : MeasureTheory.IsStoppingTime ℱ τ) [MeasureTheory.SigmaFinite (μ.trim ⋯)] (hin : i ≤ n) : μ[f n | hτ.measurableSpace] =ᵐ[μ.restrict {x | τ x = ↑i}] f i - MeasureTheory.Martingale.condExp_stopping_time_ae_eq_restrict_eq_const_of_le_const 📋 Mathlib.Probability.Martingale.OptionalSampling
{Ω : Type u_1} {E : Type u_2} {m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {ι : Type u_3} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {ℱ : MeasureTheory.Filtration ι m} [MeasureTheory.SigmaFiniteFiltration μ ℱ] {τ : Ω → WithTop ι} {f : ι → Ω → E} {n : ι} (h : MeasureTheory.Martingale f ℱ μ) (hτ : MeasureTheory.IsStoppingTime ℱ τ) (hτ_le : ∀ (x : Ω), τ x ≤ ↑n) [MeasureTheory.SigmaFinite (μ.trim ⋯)] (i : ι) : μ[f n | hτ.measurableSpace] =ᵐ[μ.restrict {x | τ x = ↑i}] f i - MeasureTheory.Martingale.stoppedValue_ae_eq_condExp_of_le_const_of_countable_range 📋 Mathlib.Probability.Martingale.OptionalSampling
{Ω : Type u_1} {E : Type u_2} {m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {ι : Type u_3} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {ℱ : MeasureTheory.Filtration ι m} [MeasureTheory.SigmaFiniteFiltration μ ℱ] {τ : Ω → WithTop ι} {f : ι → Ω → E} {n : ι} [Nonempty ι] (h : MeasureTheory.Martingale f ℱ μ) (hτ : MeasureTheory.IsStoppingTime ℱ τ) (hτ_le : ∀ (x : Ω), τ x ≤ ↑n) (h_countable_range : (Set.range τ).Countable) [MeasureTheory.SigmaFinite (μ.trim ⋯)] : MeasureTheory.stoppedValue f τ =ᵐ[μ] μ[f n | hτ.measurableSpace] - MeasureTheory.Martingale.stoppedValue_ae_eq_restrict_eq 📋 Mathlib.Probability.Martingale.OptionalSampling
{Ω : Type u_1} {E : Type u_2} {m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {ι : Type u_3} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {ℱ : MeasureTheory.Filtration ι m} [MeasureTheory.SigmaFiniteFiltration μ ℱ] {τ : Ω → WithTop ι} {f : ι → Ω → E} {n : ι} [Nonempty ι] (h : MeasureTheory.Martingale f ℱ μ) (hτ : MeasureTheory.IsStoppingTime ℱ τ) (hτ_le : ∀ (x : Ω), τ x ≤ ↑n) [MeasureTheory.SigmaFinite (μ.trim ⋯)] (i : ι) : MeasureTheory.stoppedValue f τ =ᵐ[μ.restrict {x | τ x = ↑i}] μ[f n | hτ.measurableSpace] - MeasureTheory.Martingale.stoppedValue_ae_eq_condExp_of_le_of_countable_range 📋 Mathlib.Probability.Martingale.OptionalSampling
{Ω : Type u_1} {E : Type u_2} {m : MeasurableSpace Ω} {μ : MeasureTheory.Measure Ω} [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E] {ι : Type u_3} [LinearOrder ι] [TopologicalSpace ι] [OrderTopology ι] [FirstCountableTopology ι] {ℱ : MeasureTheory.Filtration ι m} [MeasureTheory.SigmaFiniteFiltration μ ℱ] {τ σ : Ω → WithTop ι} {f : ι → Ω → E} {n : ι} [Nonempty ι] (h : MeasureTheory.Martingale f ℱ μ) (hτ : MeasureTheory.IsStoppingTime ℱ τ) (hσ : MeasureTheory.IsStoppingTime ℱ σ) (hσ_le_τ : σ ≤ τ) (hτ_le : ∀ (x : Ω), τ x ≤ ↑n) (hτ_countable_range : (Set.range τ).Countable) (hσ_countable_range : (Set.range σ).Countable) [MeasureTheory.SigmaFinite (μ.trim ⋯)] : MeasureTheory.stoppedValue f σ =ᵐ[μ] μ[MeasureTheory.stoppedValue f τ | hσ.measurableSpace] - ProbabilityTheory.IsPreLocalizingSequence.isLocalizingSequence_biInf 📋 Mathlib.Probability.Process.LocalProperty
{ι : Type u_1} {Ω : Type u_2} {mΩ : MeasurableSpace Ω} {P : MeasureTheory.Measure Ω} [ConditionallyCompleteLinearOrderBot ι] [TopologicalSpace ι] [OrderTopology ι] {𝓕 : MeasureTheory.Filtration ι mΩ} [DenselyOrdered ι] [FirstCountableTopology ι] [NoMaxOrder ι] {τ : ℕ → Ω → WithTop ι} [𝓕.IsRightContinuous] (hτ : ProbabilityTheory.IsPreLocalizingSequence 𝓕 τ P) : ProbabilityTheory.IsLocalizingSequence 𝓕 (fun i ω => ⨅ j, ⨅ (_ : j ≥ i), τ j ω) P - ProbabilityTheory.IsStable.locally_of_isPreLocalizingSequence 📋 Mathlib.Probability.Process.LocalProperty
{ι : Type u_1} {Ω : Type u_2} {E : Type u_3} {mΩ : MeasurableSpace Ω} {P : MeasureTheory.Measure Ω} [ConditionallyCompleteLinearOrderBot ι] [TopologicalSpace ι] [OrderTopology ι] {𝓕 : MeasureTheory.Filtration ι mΩ} {X : ι → Ω → E} {p : (ι → Ω → E) → Prop} [Zero E] [DenselyOrdered ι] [FirstCountableTopology ι] [NoMaxOrder ι] {τ : ℕ → Ω → WithTop ι} (hp : ProbabilityTheory.IsStable 𝓕 p) [𝓕.IsRightContinuous] (hτ : ProbabilityTheory.IsPreLocalizingSequence 𝓕 τ P) (hpτ : ∀ (n : ℕ), p (MeasureTheory.stoppedProcess (fun i => {ω | ⊥ < τ n ω}.indicator (X i)) (τ n))) : ProbabilityTheory.Locally p 𝓕 X P - instCountablyCompactSpaceSeqCompactSpace 📋 Mathlib.Topology.Compactness.CountablyCompact
{X : Type u_4} [TopologicalSpace X] [FirstCountableTopology X] [CountablyCompactSpace X] : SeqCompactSpace X - IsCountablyCompact.isSeqCompact 📋 Mathlib.Topology.Compactness.CountablyCompact
{E : Type u_2} [TopologicalSpace E] {A : Set E} [FirstCountableTopology E] (hA : IsCountablyCompact A) : IsSeqCompact A - isCountablyCompact_iff_isSeqCompact 📋 Mathlib.Topology.Compactness.CountablyCompact
{E : Type u_2} [TopologicalSpace E] {A : Set E} [FirstCountableTopology E] : IsCountablyCompact A ↔ IsSeqCompact A - Rat.not_firstCountableTopology_opc 📋 Mathlib.Topology.Instances.RatLemmas
: ¬FirstCountableTopology (OnePoint ℚ) - LowerHemicontinuous.exists_continuous_selection 📋 Mathlib.Topology.Semicontinuity.Michael
{α : Type u_1} {β : Type u_2} {f : α → Set β} [TopologicalSpace α] [NormalSpace α] [ParacompactSpace α] [AddCommGroup β] [Module ℝ β] [UniformSpace β] [IsUniformAddGroup β] [ContinuousSMul ℝ β] [LocallyConvexSpace ℝ β] [FirstCountableTopology β] [CompleteSpace β] (hf : LowerHemicontinuous f) (hf_nonempty : ∀ (x : α), (f x).Nonempty) (hf_convex : ∀ (x : α), Convex ℝ (f x)) (hf_isClosed : ∀ (x : α), IsClosed (f x)) : ∃ g, Continuous g ∧ ∀ (x : α), g x ∈ f x
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c