Zero and Bounded at filter #
Given a filter l we define the notion of a function being ZeroAtFilter as well as being
BoundedAtFilter. Alongside this we construct the Submodule, AddSubmonoid of functions
that are ZeroAtFilter. Similarly, we construct the Submodule and Subalgebra of functions
that are BoundedAtFilter.
If l is a filter on α, then a function f : α → β is ZeroAtFilter l
if it tends to zero along l.
Equations
- l.ZeroAtFilter f = Filter.Tendsto f l (nhds 0)
Instances For
zeroAtFilterSubmodule l is the submodule of f : α → β which
tend to zero along l.
Equations
- Filter.zeroAtFilterSubmodule 𝕜 l = { carrier := l.ZeroAtFilter, add_mem' := ⋯, zero_mem' := ⋯, smul_mem' := ⋯ }
Instances For
zeroAtFilterAddSubmonoid l is the additive submonoid of f : α → β
which tend to zero along l.
Equations
- l.zeroAtFilterAddSubmonoid = { carrier := l.ZeroAtFilter, add_mem' := ⋯, zero_mem' := ⋯ }
Instances For
If l is a filter on α, then a function f: α → β is BoundedAtFilter l
if f =O[l] 1.
Equations
- l.BoundedAtFilter f = f =O[l] 1
Instances For
The submodule of functions that are bounded along a filter l.
Equations
- Filter.boundedFilterSubmodule 𝕜 l = { carrier := l.BoundedAtFilter, add_mem' := ⋯, zero_mem' := ⋯, smul_mem' := ⋯ }
Instances For
The subalgebra of functions that are bounded along a filter l.