Sequences and series of functions
TheoremPointwise convergence#
Mathlib states this as tendsto_pi_nhds.
tendsto_pi_nhds.{v, u_2, u_3} {Y : Type v} {ι : Type u_2} {A : ι → Type u_3}
[T : (i : ι) → TopologicalSpace (A i)] {f : Y → (i : ι) → A i} {g : (i : ι) → A i}
{u : Filter Y} :
Filter.Tendsto f u (nhds g) ↔ ∀ (x : ι), Filter.Tendsto (fun i => f i x) u (nhds (g x))
Sources
Uses 3 · Used by 11
TheoremContinuity of the limit of a sequence of functions#
A function which can be uniformly approximated by continuous functions is continuous.
continuous_of_uniform_approx_of_continuous.{u_1, u_2} {α : Type u_1} {β : Type u_2}
[TopologicalSpace α] [UniformSpace β] {f : α → β}
(L : ∀ u ∈ uniformity β, ∃ F, Continuous F ∧ ∀ (y : α), (f y, F y) ∈ u) : Continuous f
Sources
Uses 2
TheoremContinuity of the sum of a series of functions#
An infinite sum of functions with summable sup norm is continuous if each individual function is.
continuous_tsum.{u_1, u_2, u_3} {α : Type u_1} {β : Type u_2} {F : Type u_3} [NormedAddCommGroup F]
[CompleteSpace F] {u : α → ℝ} [TopologicalSpace β] {f : α → β → F}
(hf : ∀ (i : α), Continuous (f i)) (hu : Summable u) (hfu : ∀ (n : α) (x : β), ‖f n x‖ ≤ u n) :
Continuous fun x => ∑' (n : α), f n x
Sources
Uses 8
TheoremDifferentiability of the limit of a sequence of functions#
(d/dx) lim_{n → ∞} f n x = lim_{n → ∞} f' n x when the f' n converge
uniformly to their limit.
hasFDerivAt_of_tendstoUniformly.{u_1, u_2, u_3, u_4} {ι : Type u_1} {l : Filter ι} {E : Type u_2}
[NormedAddCommGroup E] {𝕜 : Type u_3} [NontriviallyNormedField 𝕜] [IsRCLikeNormedField 𝕜]
[NormedSpace 𝕜 E] {G : Type u_4} [NormedAddCommGroup G] [NormedSpace 𝕜 G] {f : ι → E → G}
{g : E → G} {f' : ι → E → E →L[𝕜] G} {g' : E → E →L[𝕜] G} [l.NeBot]
(hf' : TendstoUniformly f' g' l) (hf : ∀ (n : ι) (x : E), HasFDerivAt (f n) (f' n x) x)
(hfg : ∀ (x : E), Filter.Tendsto (fun n => f n x) l (nhds (g x))) (x : E) : HasFDerivAt g (g' x) x
Sources
TheoremDifferentiability of the sum of a series of functions#
Consider a series of functions ∑' n, f n x. If all functions in the series are differentiable
with a summable bound on the derivatives, then the series is differentiable.
Note that our assumptions do not ensure the pointwise convergence, but if there is no pointwise
convergence then the series is zero everywhere so the result still holds.
differentiable_tsum.{u_1, u_2, u_3, u_4} {α : Type u_1} {𝕜 : Type u_2} {E : Type u_3} {F : Type u_4}
[NontriviallyNormedField 𝕜] [IsRCLikeNormedField 𝕜] [NormedAddCommGroup E] [NormedSpace 𝕜 E]
[NormedAddCommGroup F] [CompleteSpace F] {u : α → ℝ} [NormedSpace 𝕜 F] {f : α → E → F}
{f' : α → E → E →L[𝕜] F} (hu : Summable u) (hf : ∀ (n : α) (x : E), HasFDerivAt (f n) (f' n x) x)
(hf' : ∀ (n : α) (x : E), ‖f' n x‖ ≤ u n) : Differentiable 𝕜 fun y => ∑' (n : α), f n y
Sources
Uses 11
TheoremWeierstrass polynomial approximation theorem#
The Weierstrass Approximation Theorem:
polynomials functions on [a, b] ⊆ ℝ are dense in C([a,b],ℝ)
(While we could deduce this as an application of the Stone-Weierstrass theorem,
our proof of that relies on the fact that abs is in the closure of polynomials on [-M, M],
so we may as well get this done first.)
polynomialFunctions_closure_eq_top (a b : ℝ) :
(polynomialFunctions (Set.Icc a b)).topologicalClosure = ⊤
Sources
Uses 16 · Used by 1
TheoremWeierstrass trigonometric approximation theorem#
The linear span of the monomials fourier n is dense in C(AddCircle T, ℂ).
span_fourier_closure_eq_top {T : ℝ} [hT : Fact (0 < T)] :
(Submodule.span ℂ (Set.range fourier)).topologicalClosure = ⊤
Sources
Uses 9 · Used by 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.