HomeHome Metamath Proof Explorer
Theorem List (p. 239 of 425)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-26947)
  Hilbert Space Explorer  Hilbert Space Explorer
(26948-28472)
  Users' Mathboxes  Users' Mathboxes
(28473-42426)
 

Theorem List for Metamath Proof Explorer - 23801-23900   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Definitiondf-ana 23801* Define the set of analytic functions, which are functions such that the Taylor series of the function at each point converges to the function in some neighborhood of the point. (Contributed by Mario Carneiro, 31-Dec-2016.)
Ana = (𝑠 ∈ {ℝ, ℂ} ↦ {𝑓 ∈ (ℂ ↑pm 𝑠) ∣ ∀𝑥 ∈ dom 𝑓 𝑥 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑠))‘dom (𝑓 ∩ (+∞(𝑠 Tayl 𝑓)𝑥)))})
 
Theoremtaylfvallem1 23802* Lemma for taylfval 23804. (Contributed by Mario Carneiro, 30-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑 → (𝑁 ∈ ℕ0𝑁 = +∞))    &   ((𝜑𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘))       (((𝜑𝑋 ∈ ℂ) ∧ 𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑋𝐵)↑𝑘)) ∈ ℂ)
 
Theoremtaylfvallem 23803* Lemma for taylfval 23804. (Contributed by Mario Carneiro, 30-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑 → (𝑁 ∈ ℕ0𝑁 = +∞))    &   ((𝜑𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘))       ((𝜑𝑋 ∈ ℂ) → (ℂfld tsums (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑋𝐵)↑𝑘)))) ⊆ ℂ)
 
Theoremtaylfval 23804* Define the Taylor polynomial of a function. The constant Tayl is a function of five arguments: 𝑆 is the base set with respect to evaluate the derivatives (generally or ), 𝐹 is the function we are approximating, at point 𝐵, to order 𝑁. The result is a polynomial function of 𝑥.

This "extended" version of taylpfval 23810 additionally handles the case 𝑁 = +∞, in which case this is not a polynomial but an infinite series, the Taylor series of the function. (Contributed by Mario Carneiro, 30-Dec-2016.)

(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑 → (𝑁 ∈ ℕ0𝑁 = +∞))    &   ((𝜑𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)       (𝜑𝑇 = 𝑥 ∈ ℂ ({𝑥} × (ℂfld tsums (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥𝐵)↑𝑘))))))
 
Theoremeltayl 23805* Value of the Taylor series as a relation (elementhood in the domain here expresses that the series is convergent). (Contributed by Mario Carneiro, 30-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑 → (𝑁 ∈ ℕ0𝑁 = +∞))    &   ((𝜑𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)       (𝜑 → (𝑋𝑇𝑌 ↔ (𝑋 ∈ ℂ ∧ 𝑌 ∈ (ℂfld tsums (𝑘 ∈ ((0[,]𝑁) ∩ ℤ) ↦ (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑋𝐵)↑𝑘)))))))
 
Theoremtaylf 23806* The Taylor series defines a function on a subset of the complex numbers. (Contributed by Mario Carneiro, 30-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑 → (𝑁 ∈ ℕ0𝑁 = +∞))    &   ((𝜑𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)       (𝜑𝑇:dom 𝑇⟶ℂ)
 
Theoremtayl0 23807* The Taylor series is always defined at the basepoint, with value equal to the value of the function. (Contributed by Mario Carneiro, 30-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑 → (𝑁 ∈ ℕ0𝑁 = +∞))    &   ((𝜑𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)       (𝜑 → (𝐵 ∈ dom 𝑇 ∧ (𝑇𝐵) = (𝐹𝐵)))
 
Theoremtaylplem1 23808* Lemma for taylpfval 23810 and similar theorems. (Contributed by Mario Carneiro, 31-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁))       ((𝜑𝑘 ∈ ((0[,]𝑁) ∩ ℤ)) → 𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑘))
 
Theoremtaylplem2 23809* Lemma for taylpfval 23810 and similar theorems. (Contributed by Mario Carneiro, 31-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁))       (((𝜑𝑋 ∈ ℂ) ∧ 𝑘 ∈ (0...𝑁)) → (((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑋𝐵)↑𝑘)) ∈ ℂ)
 
Theoremtaylpfval 23810* Define the Taylor polynomial of a function. The constant Tayl is a function of five arguments: 𝑆 is the base set with respect to evaluate the derivatives (generally or ), 𝐹 is the function we are approximating, at point 𝐵, to order 𝑁. The result is a polynomial function of 𝑥. (Contributed by Mario Carneiro, 31-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)       (𝜑𝑇 = (𝑥 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑥𝐵)↑𝑘))))
 
Theoremtaylpf 23811 The Taylor polynomial is a function on the complex numbers (even if the base set of the original function is the reals). (Contributed by Mario Carneiro, 31-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)       (𝜑𝑇:ℂ⟶ℂ)
 
Theoremtaylpval 23812* Value of the Taylor polynomial. (Contributed by Mario Carneiro, 31-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)    &   (𝜑𝑋 ∈ ℂ)       (𝜑 → (𝑇𝑋) = Σ𝑘 ∈ (0...𝑁)(((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) · ((𝑋𝐵)↑𝑘)))
 
Theoremtaylply2 23813* The Taylor polynomial is a polynomial of degree (at most) 𝑁. This version of taylply 23814 shows that the coefficients of 𝑇 are in a subring of the complex numbers. (Contributed by Mario Carneiro, 1-Jan-2017.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)    &   (𝜑𝐷 ∈ (SubRing‘ℂfld))    &   (𝜑𝐵𝐷)    &   ((𝜑𝑘 ∈ (0...𝑁)) → ((((𝑆 D𝑛 𝐹)‘𝑘)‘𝐵) / (!‘𝑘)) ∈ 𝐷)       (𝜑 → (𝑇 ∈ (Poly‘𝐷) ∧ (deg‘𝑇) ≤ 𝑁))
 
Theoremtaylply 23814 The Taylor polynomial is a polynomial of degree (at most) 𝑁. (Contributed by Mario Carneiro, 31-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)       (𝜑 → (𝑇 ∈ (Poly‘ℂ) ∧ (deg‘𝑇) ≤ 𝑁))
 
Theoremdvtaylp 23815 The derivative of the Taylor polynomial is the Taylor polynomial of the derivative of the function. (Contributed by Mario Carneiro, 31-Dec-2016.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘(𝑁 + 1)))       (𝜑 → (ℂ D ((𝑁 + 1)(𝑆 Tayl 𝐹)𝐵)) = (𝑁(𝑆 Tayl (𝑆 D 𝐹))𝐵))
 
Theoremdvntaylp 23816 The 𝑀-th derivative of the Taylor polynomial is the Taylor polynomial of the 𝑀-th derivative of the function. (Contributed by Mario Carneiro, 1-Jan-2017.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑀 ∈ ℕ0)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘(𝑁 + 𝑀)))       (𝜑 → ((ℂ D𝑛 ((𝑁 + 𝑀)(𝑆 Tayl 𝐹)𝐵))‘𝑀) = (𝑁(𝑆 Tayl ((𝑆 D𝑛 𝐹)‘𝑀))𝐵))
 
Theoremdvntaylp0 23817 The first 𝑁 derivatives of the Taylor polynomial at 𝐵 match the derivatives of the function from which it is derived. (Contributed by Mario Carneiro, 1-Jan-2017.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑𝑀 ∈ (0...𝑁))    &   (𝜑𝐵 ∈ dom ((𝑆 D𝑛 𝐹)‘𝑁))    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)       (𝜑 → (((ℂ D𝑛 𝑇)‘𝑀)‘𝐵) = (((𝑆 D𝑛 𝐹)‘𝑀)‘𝐵))
 
Theoremtaylthlem1 23818* Lemma for taylth 23820. This is the main part of Taylor's theorem, except for the induction step, which is supposed to be proven using L'Hôpital's rule. However, since our proof of L'Hôpital assumes that 𝑆 = ℝ, we can only do this part generically, and for taylth 23820 itself we must restrict to . (Contributed by Mario Carneiro, 1-Jan-2017.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴𝑆)    &   (𝜑 → dom ((𝑆 D𝑛 𝐹)‘𝑁) = 𝐴)    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝐵𝐴)    &   𝑇 = (𝑁(𝑆 Tayl 𝐹)𝐵)    &   𝑅 = (𝑥 ∈ (𝐴 ∖ {𝐵}) ↦ (((𝐹𝑥) − (𝑇𝑥)) / ((𝑥𝐵)↑𝑁)))    &   ((𝜑 ∧ (𝑛 ∈ (1..^𝑁) ∧ 0 ∈ ((𝑦 ∈ (𝐴 ∖ {𝐵}) ↦ (((((𝑆 D𝑛 𝐹)‘(𝑁𝑛))‘𝑦) − (((ℂ D𝑛 𝑇)‘(𝑁𝑛))‘𝑦)) / ((𝑦𝐵)↑𝑛))) lim 𝐵))) → 0 ∈ ((𝑥 ∈ (𝐴 ∖ {𝐵}) ↦ (((((𝑆 D𝑛 𝐹)‘(𝑁 − (𝑛 + 1)))‘𝑥) − (((ℂ D𝑛 𝑇)‘(𝑁 − (𝑛 + 1)))‘𝑥)) / ((𝑥𝐵)↑(𝑛 + 1)))) lim 𝐵))       (𝜑 → 0 ∈ (𝑅 lim 𝐵))
 
Theoremtaylthlem2 23819* Lemma for taylth 23820. (Contributed by Mario Carneiro, 1-Jan-2017.)
(𝜑𝐹:𝐴⟶ℝ)    &   (𝜑𝐴 ⊆ ℝ)    &   (𝜑 → dom ((ℝ D𝑛 𝐹)‘𝑁) = 𝐴)    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝐵𝐴)    &   𝑇 = (𝑁(ℝ Tayl 𝐹)𝐵)    &   (𝜑𝑀 ∈ (1..^𝑁))    &   (𝜑 → 0 ∈ ((𝑥 ∈ (𝐴 ∖ {𝐵}) ↦ (((((ℝ D𝑛 𝐹)‘(𝑁𝑀))‘𝑥) − (((ℂ D𝑛 𝑇)‘(𝑁𝑀))‘𝑥)) / ((𝑥𝐵)↑𝑀))) lim 𝐵))       (𝜑 → 0 ∈ ((𝑥 ∈ (𝐴 ∖ {𝐵}) ↦ (((((ℝ D𝑛 𝐹)‘(𝑁 − (𝑀 + 1)))‘𝑥) − (((ℂ D𝑛 𝑇)‘(𝑁 − (𝑀 + 1)))‘𝑥)) / ((𝑥𝐵)↑(𝑀 + 1)))) lim 𝐵))
 
Theoremtaylth 23820* Taylor's theorem. The Taylor polynomial of a 𝑁-times differentiable function is such that the error term goes to zero faster than (𝑥𝐵)↑𝑁. This is Metamath 100 proof #35. (Contributed by Mario Carneiro, 1-Jan-2017.)
(𝜑𝐹:𝐴⟶ℝ)    &   (𝜑𝐴 ⊆ ℝ)    &   (𝜑 → dom ((ℝ D𝑛 𝐹)‘𝑁) = 𝐴)    &   (𝜑𝑁 ∈ ℕ)    &   (𝜑𝐵𝐴)    &   𝑇 = (𝑁(ℝ Tayl 𝐹)𝐵)    &   𝑅 = (𝑥 ∈ (𝐴 ∖ {𝐵}) ↦ (((𝐹𝑥) − (𝑇𝑥)) / ((𝑥𝐵)↑𝑁)))       (𝜑 → 0 ∈ (𝑅 lim 𝐵))
 
14.2.2  Uniform convergence
 
Syntaxculm 23821 Extend class notation to include the uniform convergence predicate.
class 𝑢
 
Definitiondf-ulm 23822* Define the uniform convergence of a sequence of functions. Here 𝐹(⇝𝑢𝑆)𝐺 if 𝐹 is a sequence of functions 𝐹(𝑛), 𝑛 ∈ ℕ defined on 𝑆 and 𝐺 is a function on 𝑆, and for every 0 < 𝑥 there is a 𝑗 such that the functions 𝐹(𝑘) for 𝑗𝑘 are all uniformly within 𝑥 of 𝐺 on the domain 𝑆. Compare with df-clim 13933. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝑢 = (𝑠 ∈ V ↦ {⟨𝑓, 𝑦⟩ ∣ ∃𝑛 ∈ ℤ (𝑓:(ℤ𝑛)⟶(ℂ ↑𝑚 𝑠) ∧ 𝑦:𝑠⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑠 (abs‘(((𝑓𝑘)‘𝑧) − (𝑦𝑧))) < 𝑥)})
 
Theoremulmrel 23823 The uniform limit relation is a relation. (Contributed by Mario Carneiro, 26-Feb-2015.)
Rel (⇝𝑢𝑆)
 
Theoremulmscl 23824 Closure of the base set in a uniform limit. (Contributed by Mario Carneiro, 26-Feb-2015.)
(𝐹(⇝𝑢𝑆)𝐺𝑆 ∈ V)
 
Theoremulmval 23825* Express the predicate: The sequence of functions 𝐹 converges uniformly to 𝐺 on 𝑆. (Contributed by Mario Carneiro, 26-Feb-2015.)
(𝑆𝑉 → (𝐹(⇝𝑢𝑆)𝐺 ↔ ∃𝑛 ∈ ℤ (𝐹:(ℤ𝑛)⟶(ℂ ↑𝑚 𝑆) ∧ 𝐺:𝑆⟶ℂ ∧ ∀𝑥 ∈ ℝ+𝑗 ∈ (ℤ𝑛)∀𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − (𝐺𝑧))) < 𝑥)))
 
Theoremulmcl 23826 Closure of a uniform limit of functions. (Contributed by Mario Carneiro, 26-Feb-2015.)
(𝐹(⇝𝑢𝑆)𝐺𝐺:𝑆⟶ℂ)
 
Theoremulmf 23827* Closure of a uniform limit of functions. (Contributed by Mario Carneiro, 26-Feb-2015.)
(𝐹(⇝𝑢𝑆)𝐺 → ∃𝑛 ∈ ℤ 𝐹:(ℤ𝑛)⟶(ℂ ↑𝑚 𝑆))
 
Theoremulmpm 23828 Closure of a uniform limit of functions. (Contributed by Mario Carneiro, 26-Feb-2015.)
(𝐹(⇝𝑢𝑆)𝐺𝐹 ∈ ((ℂ ↑𝑚 𝑆) ↑pm ℤ))
 
Theoremulmf2 23829 Closure of a uniform limit of functions. (Contributed by Mario Carneiro, 18-Mar-2015.)
((𝐹 Fn 𝑍𝐹(⇝𝑢𝑆)𝐺) → 𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))
 
Theoremulm2 23830* Simplify ulmval 23825 when 𝐹 and 𝐺 are known to be functions. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))    &   ((𝜑 ∧ (𝑘𝑍𝑧𝑆)) → ((𝐹𝑘)‘𝑧) = 𝐵)    &   ((𝜑𝑧𝑆) → (𝐺𝑧) = 𝐴)    &   (𝜑𝐺:𝑆⟶ℂ)    &   (𝜑𝑆𝑉)       (𝜑 → (𝐹(⇝𝑢𝑆)𝐺 ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝑥))
 
Theoremulmi 23831* The uniform limit property. (Contributed by Mario Carneiro, 27-Feb-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))    &   ((𝜑 ∧ (𝑘𝑍𝑧𝑆)) → ((𝐹𝑘)‘𝑧) = 𝐵)    &   ((𝜑𝑧𝑆) → (𝐺𝑧) = 𝐴)    &   (𝜑𝐹(⇝𝑢𝑆)𝐺)    &   (𝜑𝐶 ∈ ℝ+)       (𝜑 → ∃𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(𝐵𝐴)) < 𝐶)
 
Theoremulmclm 23832* A uniform limit of functions converges pointwise. (Contributed by Mario Carneiro, 27-Feb-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))    &   (𝜑𝐴𝑆)    &   (𝜑𝐻𝑊)    &   ((𝜑𝑘𝑍) → ((𝐹𝑘)‘𝐴) = (𝐻𝑘))    &   (𝜑𝐹(⇝𝑢𝑆)𝐺)       (𝜑𝐻 ⇝ (𝐺𝐴))
 
Theoremulmres 23833 A sequence of functions converges iff the tail of the sequence converges (for any finite cutoff). (Contributed by Mario Carneiro, 24-Mar-2015.)
𝑍 = (ℤ𝑀)    &   𝑊 = (ℤ𝑁)    &   (𝜑𝑁𝑍)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))       (𝜑 → (𝐹(⇝𝑢𝑆)𝐺 ↔ (𝐹𝑊)(⇝𝑢𝑆)𝐺))
 
Theoremulmshftlem 23834* Lemma for ulmshft 23835. (Contributed by Mario Carneiro, 24-Mar-2015.)
𝑍 = (ℤ𝑀)    &   𝑊 = (ℤ‘(𝑀 + 𝐾))    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐾 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))    &   (𝜑𝐻 = (𝑛𝑊 ↦ (𝐹‘(𝑛𝐾))))       (𝜑 → (𝐹(⇝𝑢𝑆)𝐺𝐻(⇝𝑢𝑆)𝐺))
 
Theoremulmshft 23835* A sequence of functions converges iff the shifted sequence converges. (Contributed by Mario Carneiro, 24-Mar-2015.)
𝑍 = (ℤ𝑀)    &   𝑊 = (ℤ‘(𝑀 + 𝐾))    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐾 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))    &   (𝜑𝐻 = (𝑛𝑊 ↦ (𝐹‘(𝑛𝐾))))       (𝜑 → (𝐹(⇝𝑢𝑆)𝐺𝐻(⇝𝑢𝑆)𝐺))
 
Theoremulm0 23836 Every function converges uniformly on the empty set. (Contributed by Mario Carneiro, 3-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))    &   (𝜑𝐺:𝑆⟶ℂ)       ((𝜑𝑆 = ∅) → 𝐹(⇝𝑢𝑆)𝐺)
 
Theoremulmuni 23837 An sequence of functions uniformly converges to at most one limit. (Contributed by Mario Carneiro, 5-Jul-2017.)
((𝐹(⇝𝑢𝑆)𝐺𝐹(⇝𝑢𝑆)𝐻) → 𝐺 = 𝐻)
 
Theoremulmdm 23838 Two ways to express that a function has a limit. (The expression ((⇝𝑢𝑆)‘𝐹) is sometimes useful as a shorthand for "the unique limit of the function 𝐹"). (Contributed by Mario Carneiro, 5-Jul-2017.)
(𝐹 ∈ dom (⇝𝑢𝑆) ↔ 𝐹(⇝𝑢𝑆)((⇝𝑢𝑆)‘𝐹))
 
Theoremulmcaulem 23839* Lemma for ulmcau 23840 and ulmcau2 23841: show the equivalence of the four- and five-quantifier forms of the Cauchy convergence condition. Compare cau3 13802. (Contributed by Mario Carneiro, 1-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝑆𝑉)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))       (𝜑 → (∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − ((𝐹𝑗)‘𝑧))) < 𝑥 ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑚 ∈ (ℤ𝑘)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − ((𝐹𝑚)‘𝑧))) < 𝑥))
 
Theoremulmcau 23840* A sequence of functions converges uniformly iff it is uniformly Cauchy, which is to say that for every 0 < 𝑥 there is a 𝑗 such that for all 𝑗𝑘 the functions 𝐹(𝑘) and 𝐹(𝑗) are uniformly within 𝑥 of each other on 𝑆. This is the four-quantifier version, see ulmcau2 23841 for the more conventional five-quantifier version. (Contributed by Mario Carneiro, 1-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝑆𝑉)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))       (𝜑 → (𝐹 ∈ dom (⇝𝑢𝑆) ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − ((𝐹𝑗)‘𝑧))) < 𝑥))
 
Theoremulmcau2 23841* A sequence of functions converges uniformly iff it is uniformly Cauchy, which is to say that for every 0 < 𝑥 there is a 𝑗 such that for all 𝑗𝑘, 𝑚 the functions 𝐹(𝑘) and 𝐹(𝑚) are uniformly within 𝑥 of each other on 𝑆. (Contributed by Mario Carneiro, 1-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝑆𝑉)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))       (𝜑 → (𝐹 ∈ dom (⇝𝑢𝑆) ↔ ∀𝑥 ∈ ℝ+𝑗𝑍𝑘 ∈ (ℤ𝑗)∀𝑚 ∈ (ℤ𝑘)∀𝑧𝑆 (abs‘(((𝐹𝑘)‘𝑧) − ((𝐹𝑚)‘𝑧))) < 𝑥))
 
Theoremulmss 23842* A uniform limit of functions is still a uniform limit if restricted to a subset. (Contributed by Mario Carneiro, 3-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑇𝑆)    &   ((𝜑𝑥𝑍) → 𝐴𝑊)    &   (𝜑 → (𝑥𝑍𝐴)(⇝𝑢𝑆)𝐺)       (𝜑 → (𝑥𝑍 ↦ (𝐴𝑇))(⇝𝑢𝑇)(𝐺𝑇))
 
Theoremulmbdd 23843* A uniform limit of bounded functions is bounded. (Contributed by Mario Carneiro, 27-Feb-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))    &   ((𝜑𝑘𝑍) → ∃𝑥 ∈ ℝ ∀𝑧𝑆 (abs‘((𝐹𝑘)‘𝑧)) ≤ 𝑥)    &   (𝜑𝐹(⇝𝑢𝑆)𝐺)       (𝜑 → ∃𝑥 ∈ ℝ ∀𝑧𝑆 (abs‘(𝐺𝑧)) ≤ 𝑥)
 
Theoremulmcn 23844 A uniform limit of continuous functions is continuous. (Contributed by Mario Carneiro, 27-Feb-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(𝑆cn→ℂ))    &   (𝜑𝐹(⇝𝑢𝑆)𝐺)       (𝜑𝐺 ∈ (𝑆cn→ℂ))
 
Theoremulmdvlem1 23845* Lemma for ulmdv 23848. (Contributed by Mario Carneiro, 3-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑋))    &   (𝜑𝐺:𝑋⟶ℂ)    &   ((𝜑𝑧𝑋) → (𝑘𝑍 ↦ ((𝐹𝑘)‘𝑧)) ⇝ (𝐺𝑧))    &   (𝜑 → (𝑘𝑍 ↦ (𝑆 D (𝐹𝑘)))(⇝𝑢𝑋)𝐻)    &   ((𝜑𝜓) → 𝐶𝑋)    &   ((𝜑𝜓) → 𝑅 ∈ ℝ+)    &   ((𝜑𝜓) → 𝑈 ∈ ℝ+)    &   ((𝜑𝜓) → 𝑊 ∈ ℝ+)    &   ((𝜑𝜓) → 𝑈 < 𝑊)    &   ((𝜑𝜓) → (𝐶(ball‘((abs ∘ − ) ↾ (𝑆 × 𝑆)))𝑈) ⊆ 𝑋)    &   ((𝜑𝜓) → (abs‘(𝑌𝐶)) < 𝑈)    &   ((𝜑𝜓) → 𝑁𝑍)    &   ((𝜑𝜓) → ∀𝑚 ∈ (ℤ𝑁)∀𝑥𝑋 (abs‘(((𝑆 D (𝐹𝑁))‘𝑥) − ((𝑆 D (𝐹𝑚))‘𝑥))) < ((𝑅 / 2) / 2))    &   ((𝜑𝜓) → (abs‘(((𝑆 D (𝐹𝑁))‘𝐶) − (𝐻𝐶))) < (𝑅 / 2))    &   ((𝜑𝜓) → 𝑌𝑋)    &   ((𝜑𝜓) → 𝑌𝐶)    &   ((𝜑𝜓) → ((abs‘(𝑌𝐶)) < 𝑊 → (abs‘(((((𝐹𝑁)‘𝑌) − ((𝐹𝑁)‘𝐶)) / (𝑌𝐶)) − ((𝑆 D (𝐹𝑁))‘𝐶))) < ((𝑅 / 2) / 2)))       ((𝜑𝜓) → (abs‘((((𝐺𝑌) − (𝐺𝐶)) / (𝑌𝐶)) − (𝐻𝐶))) < 𝑅)
 
Theoremulmdvlem2 23846* Lemma for ulmdv 23848. (Contributed by Mario Carneiro, 8-May-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑋))    &   (𝜑𝐺:𝑋⟶ℂ)    &   ((𝜑𝑧𝑋) → (𝑘𝑍 ↦ ((𝐹𝑘)‘𝑧)) ⇝ (𝐺𝑧))    &   (𝜑 → (𝑘𝑍 ↦ (𝑆 D (𝐹𝑘)))(⇝𝑢𝑋)𝐻)       ((𝜑𝑘𝑍) → dom (𝑆 D (𝐹𝑘)) = 𝑋)
 
Theoremulmdvlem3 23847* Lemma for ulmdv 23848. (Contributed by Mario Carneiro, 8-May-2015.) (Proof shortened by Mario Carneiro, 28-Dec-2016.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑋))    &   (𝜑𝐺:𝑋⟶ℂ)    &   ((𝜑𝑧𝑋) → (𝑘𝑍 ↦ ((𝐹𝑘)‘𝑧)) ⇝ (𝐺𝑧))    &   (𝜑 → (𝑘𝑍 ↦ (𝑆 D (𝐹𝑘)))(⇝𝑢𝑋)𝐻)       ((𝜑𝑧𝑋) → 𝑧(𝑆 D 𝐺)(𝐻𝑧))
 
Theoremulmdv 23848* If 𝐹 is a sequence of differentiable functions on 𝑋 which converge pointwise to 𝐺, and the derivatives of 𝐹(𝑛) converge uniformly to 𝐻, then 𝐺 is differentiable with derivative 𝐻. (Contributed by Mario Carneiro, 27-Feb-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑋))    &   (𝜑𝐺:𝑋⟶ℂ)    &   ((𝜑𝑧𝑋) → (𝑘𝑍 ↦ ((𝐹𝑘)‘𝑧)) ⇝ (𝐺𝑧))    &   (𝜑 → (𝑘𝑍 ↦ (𝑆 D (𝐹𝑘)))(⇝𝑢𝑋)𝐻)       (𝜑 → (𝑆 D 𝐺) = 𝐻)
 
Theoremmtest 23849* The Weierstrass M-test. If 𝐹 is a sequence of functions which are uniformly bounded by the convergent sequence 𝑀(𝑘), then the series generated by the sequence 𝐹 converges uniformly. (Contributed by Mario Carneiro, 3-Mar-2015.)
𝑍 = (ℤ𝑁)    &   (𝜑𝑁 ∈ ℤ)    &   (𝜑𝑆𝑉)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))    &   (𝜑𝑀𝑊)    &   ((𝜑𝑘𝑍) → (𝑀𝑘) ∈ ℝ)    &   ((𝜑 ∧ (𝑘𝑍𝑧𝑆)) → (abs‘((𝐹𝑘)‘𝑧)) ≤ (𝑀𝑘))    &   (𝜑 → seq𝑁( + , 𝑀) ∈ dom ⇝ )       (𝜑 → seq𝑁( ∘𝑓 + , 𝐹) ∈ dom (⇝𝑢𝑆))
 
Theoremmtestbdd 23850* Given the hypotheses of the Weierstrass M-test, the convergent function of the sequence is uniformly bounded. (Contributed by Mario Carneiro, 9-Jul-2017.)
𝑍 = (ℤ𝑁)    &   (𝜑𝑁 ∈ ℤ)    &   (𝜑𝑆𝑉)    &   (𝜑𝐹:𝑍⟶(ℂ ↑𝑚 𝑆))    &   (𝜑𝑀𝑊)    &   ((𝜑𝑘𝑍) → (𝑀𝑘) ∈ ℝ)    &   ((𝜑 ∧ (𝑘𝑍𝑧𝑆)) → (abs‘((𝐹𝑘)‘𝑧)) ≤ (𝑀𝑘))    &   (𝜑 → seq𝑁( + , 𝑀) ∈ dom ⇝ )    &   (𝜑 → seq𝑁( ∘𝑓 + , 𝐹)(⇝𝑢𝑆)𝑇)       (𝜑 → ∃𝑥 ∈ ℝ ∀𝑧𝑆 (abs‘(𝑇𝑧)) ≤ 𝑥)
 
Theoremmbfulm 23851 A uniform limit of measurable functions is measurable. (This is just a corollary of the fact that a pointwise limit of measurable functions is measurable, see mbflim 23116.) (Contributed by Mario Carneiro, 18-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶MblFn)    &   (𝜑𝐹(⇝𝑢𝑆)𝐺)       (𝜑𝐺 ∈ MblFn)
 
Theoremiblulm 23852 A uniform limit of integrable functions is integrable. (Contributed by Mario Carneiro, 3-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶𝐿1)    &   (𝜑𝐹(⇝𝑢𝑆)𝐺)    &   (𝜑 → (vol‘𝑆) ∈ ℝ)       (𝜑𝐺 ∈ 𝐿1)
 
Theoremitgulm 23853* A uniform limit of integrals of integrable functions converges to the integral of the limit function. (Contributed by Mario Carneiro, 18-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   (𝜑𝐹:𝑍⟶𝐿1)    &   (𝜑𝐹(⇝𝑢𝑆)𝐺)    &   (𝜑 → (vol‘𝑆) ∈ ℝ)       (𝜑 → (𝑘𝑍 ↦ ∫𝑆((𝐹𝑘)‘𝑥) d𝑥) ⇝ ∫𝑆(𝐺𝑥) d𝑥)
 
Theoremitgulm2 23854* A uniform limit of integrals of integrable functions converges to the integral of the limit function. (Contributed by Mario Carneiro, 18-Mar-2015.)
𝑍 = (ℤ𝑀)    &   (𝜑𝑀 ∈ ℤ)    &   ((𝜑𝑘𝑍) → (𝑥𝑆𝐴) ∈ (𝑆cn→ℂ))    &   ((𝜑𝑘𝑍) → (𝑥𝑆𝐴) ∈ 𝐿1)    &   (𝜑 → (𝑘𝑍 ↦ (𝑥𝑆𝐴))(⇝𝑢𝑆)(𝑥𝑆𝐵))    &   (𝜑 → (vol‘𝑆) ∈ ℝ)       (𝜑 → ((𝑥𝑆𝐵) ∈ 𝐿1 ∧ (𝑘𝑍 ↦ ∫𝑆𝐴 d𝑥) ⇝ ∫𝑆𝐵 d𝑥))
 
14.2.3  Power series
 
Theorempserval 23855* Value of the function 𝐺 that gives the sequence of monomials of a power series. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))       (𝑋 ∈ ℂ → (𝐺𝑋) = (𝑚 ∈ ℕ0 ↦ ((𝐴𝑚) · (𝑋𝑚))))
 
Theorempserval2 23856* Value of the function 𝐺 that gives the sequence of monomials of a power series. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))       ((𝑋 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((𝐺𝑋)‘𝑁) = ((𝐴𝑁) · (𝑋𝑁)))
 
Theorempsergf 23857* The sequence of terms in the infinite sequence defining a power series for fixed 𝑋. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑𝑋 ∈ ℂ)       (𝜑 → (𝐺𝑋):ℕ0⟶ℂ)
 
Theoremradcnvlem1 23858* Lemma for radcnvlt1 23863, radcnvle 23865. If 𝑋 is a point closer to zero than 𝑌 and the power series converges at 𝑌, then it converges absolutely at 𝑋, even if the terms in the sequence are multiplied by 𝑛. (Contributed by Mario Carneiro, 31-Mar-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑𝑋 ∈ ℂ)    &   (𝜑𝑌 ∈ ℂ)    &   (𝜑 → (abs‘𝑋) < (abs‘𝑌))    &   (𝜑 → seq0( + , (𝐺𝑌)) ∈ dom ⇝ )    &   𝐻 = (𝑚 ∈ ℕ0 ↦ (𝑚 · (abs‘((𝐺𝑋)‘𝑚))))       (𝜑 → seq0( + , 𝐻) ∈ dom ⇝ )
 
Theoremradcnvlem2 23859* Lemma for radcnvlt1 23863, radcnvle 23865. If 𝑋 is a point closer to zero than 𝑌 and the power series converges at 𝑌, then it converges absolutely at 𝑋. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑𝑋 ∈ ℂ)    &   (𝜑𝑌 ∈ ℂ)    &   (𝜑 → (abs‘𝑋) < (abs‘𝑌))    &   (𝜑 → seq0( + , (𝐺𝑌)) ∈ dom ⇝ )       (𝜑 → seq0( + , (abs ∘ (𝐺𝑋))) ∈ dom ⇝ )
 
Theoremradcnvlem3 23860* Lemma for radcnvlt1 23863, radcnvle 23865. If 𝑋 is a point closer to zero than 𝑌 and the power series converges at 𝑌, then it converges at 𝑋. (Contributed by Mario Carneiro, 31-Mar-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑𝑋 ∈ ℂ)    &   (𝜑𝑌 ∈ ℂ)    &   (𝜑 → (abs‘𝑋) < (abs‘𝑌))    &   (𝜑 → seq0( + , (𝐺𝑌)) ∈ dom ⇝ )       (𝜑 → seq0( + , (𝐺𝑋)) ∈ dom ⇝ )
 
Theoremradcnv0 23861* Zero is always a convergent point for any power series. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   (𝜑𝐴:ℕ0⟶ℂ)       (𝜑 → 0 ∈ {𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ })
 
Theoremradcnvcl 23862* The radius of convergence 𝑅 of an infinite series is a nonnegative extended real number. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )       (𝜑𝑅 ∈ (0[,]+∞))
 
Theoremradcnvlt1 23863* If 𝑋 is within the open disk of radius 𝑅 centered at zero, then the infinite series converges absolutely at 𝑋, and also converges when the series is multiplied by 𝑛. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   (𝜑𝑋 ∈ ℂ)    &   (𝜑 → (abs‘𝑋) < 𝑅)    &   𝐻 = (𝑚 ∈ ℕ0 ↦ (𝑚 · (abs‘((𝐺𝑋)‘𝑚))))       (𝜑 → (seq0( + , 𝐻) ∈ dom ⇝ ∧ seq0( + , (abs ∘ (𝐺𝑋))) ∈ dom ⇝ ))
 
Theoremradcnvlt2 23864* If 𝑋 is within the open disk of radius 𝑅 centered at zero, then the infinite series converges at 𝑋. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   (𝜑𝑋 ∈ ℂ)    &   (𝜑 → (abs‘𝑋) < 𝑅)       (𝜑 → seq0( + , (𝐺𝑋)) ∈ dom ⇝ )
 
Theoremradcnvle 23865* If 𝑋 is a convergent point of the infinite series, then 𝑋 is within the closed disk of radius 𝑅 centered at zero. Or, by contraposition, the series diverges at any point strictly more than 𝑅 from the origin. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   (𝜑𝑋 ∈ ℂ)    &   (𝜑 → seq0( + , (𝐺𝑋)) ∈ dom ⇝ )       (𝜑 → (abs‘𝑋) ≤ 𝑅)
 
Theoremdvradcnv 23866* The radius of convergence of the (formal) derivative 𝐻 of the power series 𝐺 is at least as large as the radius of convergence of 𝐺. (In fact they are equal, but we don't have as much use for the negative side of this claim.) (Contributed by Mario Carneiro, 31-Mar-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝐻 = (𝑛 ∈ ℕ0 ↦ (((𝑛 + 1) · (𝐴‘(𝑛 + 1))) · (𝑋𝑛)))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑𝑋 ∈ ℂ)    &   (𝜑 → (abs‘𝑋) < 𝑅)       (𝜑 → seq0( + , 𝐻) ∈ dom ⇝ )
 
Theorempserulm 23867* If 𝑆 is a region contained in a circle of radius 𝑀 < 𝑅, then the sequence of partial sums of the infinite series converges uniformly on 𝑆. (Contributed by Mario Carneiro, 26-Feb-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝐹 = (𝑦𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺𝑦)‘𝑗))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝐻 = (𝑖 ∈ ℕ0 ↦ (𝑦𝑆 ↦ (seq0( + , (𝐺𝑦))‘𝑖)))    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑𝑀 < 𝑅)    &   (𝜑𝑆 ⊆ (abs “ (0[,]𝑀)))       (𝜑𝐻(⇝𝑢𝑆)𝐹)
 
Theorempsercn2 23868* Since by pserulm 23867 the series converges uniformly, it is also continuous by ulmcn 23844. (Contributed by Mario Carneiro, 3-Mar-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝐹 = (𝑦𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺𝑦)‘𝑗))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝐻 = (𝑖 ∈ ℕ0 ↦ (𝑦𝑆 ↦ (seq0( + , (𝐺𝑦))‘𝑖)))    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑𝑀 < 𝑅)    &   (𝜑𝑆 ⊆ (abs “ (0[,]𝑀)))       (𝜑𝐹 ∈ (𝑆cn→ℂ))
 
Theorempsercnlem2 23869* Lemma for psercn 23871. (Contributed by Mario Carneiro, 18-Mar-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝐹 = (𝑦𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺𝑦)‘𝑗))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝑆 = (abs “ (0[,)𝑅))    &   ((𝜑𝑎𝑆) → (𝑀 ∈ ℝ+ ∧ (abs‘𝑎) < 𝑀𝑀 < 𝑅))       ((𝜑𝑎𝑆) → (𝑎 ∈ (0(ball‘(abs ∘ − ))𝑀) ∧ (0(ball‘(abs ∘ − ))𝑀) ⊆ (abs “ (0[,]𝑀)) ∧ (abs “ (0[,]𝑀)) ⊆ 𝑆))
 
Theorempsercnlem1 23870* Lemma for psercn 23871. (Contributed by Mario Carneiro, 18-Mar-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝐹 = (𝑦𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺𝑦)‘𝑗))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝑆 = (abs “ (0[,)𝑅))    &   𝑀 = if(𝑅 ∈ ℝ, (((abs‘𝑎) + 𝑅) / 2), ((abs‘𝑎) + 1))       ((𝜑𝑎𝑆) → (𝑀 ∈ ℝ+ ∧ (abs‘𝑎) < 𝑀𝑀 < 𝑅))
 
Theorempsercn 23871* An infinite series converges to a continuous function on the open disk of radius 𝑅, where 𝑅 is the radius of convergence of the series. (Contributed by Mario Carneiro, 4-Mar-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝐹 = (𝑦𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺𝑦)‘𝑗))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝑆 = (abs “ (0[,)𝑅))    &   𝑀 = if(𝑅 ∈ ℝ, (((abs‘𝑎) + 𝑅) / 2), ((abs‘𝑎) + 1))       (𝜑𝐹 ∈ (𝑆cn→ℂ))
 
Theorempserdvlem1 23872* Lemma for pserdv 23874. (Contributed by Mario Carneiro, 7-May-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝐹 = (𝑦𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺𝑦)‘𝑗))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝑆 = (abs “ (0[,)𝑅))    &   𝑀 = if(𝑅 ∈ ℝ, (((abs‘𝑎) + 𝑅) / 2), ((abs‘𝑎) + 1))       ((𝜑𝑎𝑆) → ((((abs‘𝑎) + 𝑀) / 2) ∈ ℝ+ ∧ (abs‘𝑎) < (((abs‘𝑎) + 𝑀) / 2) ∧ (((abs‘𝑎) + 𝑀) / 2) < 𝑅))
 
Theorempserdvlem2 23873* Lemma for pserdv 23874. (Contributed by Mario Carneiro, 7-May-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝐹 = (𝑦𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺𝑦)‘𝑗))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝑆 = (abs “ (0[,)𝑅))    &   𝑀 = if(𝑅 ∈ ℝ, (((abs‘𝑎) + 𝑅) / 2), ((abs‘𝑎) + 1))    &   𝐵 = (0(ball‘(abs ∘ − ))(((abs‘𝑎) + 𝑀) / 2))       ((𝜑𝑎𝑆) → (ℂ D (𝐹𝐵)) = (𝑦𝐵 ↦ Σ𝑘 ∈ ℕ0 (((𝑘 + 1) · (𝐴‘(𝑘 + 1))) · (𝑦𝑘))))
 
Theorempserdv 23874* The derivative of a power series on its region of convergence. (Contributed by Mario Carneiro, 31-Mar-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝐹 = (𝑦𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺𝑦)‘𝑗))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝑆 = (abs “ (0[,)𝑅))    &   𝑀 = if(𝑅 ∈ ℝ, (((abs‘𝑎) + 𝑅) / 2), ((abs‘𝑎) + 1))    &   𝐵 = (0(ball‘(abs ∘ − ))(((abs‘𝑎) + 𝑀) / 2))       (𝜑 → (ℂ D 𝐹) = (𝑦𝑆 ↦ Σ𝑘 ∈ ℕ0 (((𝑘 + 1) · (𝐴‘(𝑘 + 1))) · (𝑦𝑘))))
 
Theorempserdv2 23875* The derivative of a power series on its region of convergence. (Contributed by Mario Carneiro, 31-Mar-2015.)
𝐺 = (𝑥 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑥𝑛))))    &   𝐹 = (𝑦𝑆 ↦ Σ𝑗 ∈ ℕ0 ((𝐺𝑦)‘𝑗))    &   (𝜑𝐴:ℕ0⟶ℂ)    &   𝑅 = sup({𝑟 ∈ ℝ ∣ seq0( + , (𝐺𝑟)) ∈ dom ⇝ }, ℝ*, < )    &   𝑆 = (abs “ (0[,)𝑅))    &   𝑀 = if(𝑅 ∈ ℝ, (((abs‘𝑎) + 𝑅) / 2), ((abs‘𝑎) + 1))    &   𝐵 = (0(ball‘(abs ∘ − ))(((abs‘𝑎) + 𝑀) / 2))       (𝜑 → (ℂ D 𝐹) = (𝑦𝑆 ↦ Σ𝑘 ∈ ℕ ((𝑘 · (𝐴𝑘)) · (𝑦↑(𝑘 − 1)))))
 
Theoremabelthlem1 23876* Lemma for abelth 23886. (Contributed by Mario Carneiro, 1-Apr-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )       (𝜑 → 1 ≤ sup({𝑟 ∈ ℝ ∣ seq0( + , ((𝑧 ∈ ℂ ↦ (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑧𝑛))))‘𝑟)) ∈ dom ⇝ }, ℝ*, < ))
 
Theoremabelthlem2 23877* Lemma for abelth 23886. The peculiar region 𝑆, known as a Stolz angle , is a teardrop-shaped subset of the closed unit ball containing 1. Indeed, except for 1 itself, the rest of the Stolz angle is enclosed in the open unit ball. (Contributed by Mario Carneiro, 31-Mar-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}       (𝜑 → (1 ∈ 𝑆 ∧ (𝑆 ∖ {1}) ⊆ (0(ball‘(abs ∘ − ))1)))
 
Theoremabelthlem3 23878* Lemma for abelth 23886. (Contributed by Mario Carneiro, 31-Mar-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}       ((𝜑𝑋𝑆) → seq0( + , (𝑛 ∈ ℕ0 ↦ ((𝐴𝑛) · (𝑋𝑛)))) ∈ dom ⇝ )
 
Theoremabelthlem4 23879* Lemma for abelth 23886. (Contributed by Mario Carneiro, 31-Mar-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}    &   𝐹 = (𝑥𝑆 ↦ Σ𝑛 ∈ ℕ0 ((𝐴𝑛) · (𝑥𝑛)))       (𝜑𝐹:𝑆⟶ℂ)
 
Theoremabelthlem5 23880* Lemma for abelth 23886. (Contributed by Mario Carneiro, 1-Apr-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}    &   𝐹 = (𝑥𝑆 ↦ Σ𝑛 ∈ ℕ0 ((𝐴𝑛) · (𝑥𝑛)))    &   (𝜑 → seq0( + , 𝐴) ⇝ 0)       ((𝜑𝑋 ∈ (0(ball‘(abs ∘ − ))1)) → seq0( + , (𝑘 ∈ ℕ0 ↦ ((seq0( + , 𝐴)‘𝑘) · (𝑋𝑘)))) ∈ dom ⇝ )
 
Theoremabelthlem6 23881* Lemma for abelth 23886. (Contributed by Mario Carneiro, 2-Apr-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}    &   𝐹 = (𝑥𝑆 ↦ Σ𝑛 ∈ ℕ0 ((𝐴𝑛) · (𝑥𝑛)))    &   (𝜑 → seq0( + , 𝐴) ⇝ 0)    &   (𝜑𝑋 ∈ (𝑆 ∖ {1}))       (𝜑 → (𝐹𝑋) = ((1 − 𝑋) · Σ𝑛 ∈ ℕ0 ((seq0( + , 𝐴)‘𝑛) · (𝑋𝑛))))
 
Theoremabelthlem7a 23882* Lemma for abelth 23886. (Contributed by Mario Carneiro, 8-May-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}    &   𝐹 = (𝑥𝑆 ↦ Σ𝑛 ∈ ℕ0 ((𝐴𝑛) · (𝑥𝑛)))    &   (𝜑 → seq0( + , 𝐴) ⇝ 0)    &   (𝜑𝑋 ∈ (𝑆 ∖ {1}))       (𝜑 → (𝑋 ∈ ℂ ∧ (abs‘(1 − 𝑋)) ≤ (𝑀 · (1 − (abs‘𝑋)))))
 
Theoremabelthlem7 23883* Lemma for abelth 23886. (Contributed by Mario Carneiro, 2-Apr-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}    &   𝐹 = (𝑥𝑆 ↦ Σ𝑛 ∈ ℕ0 ((𝐴𝑛) · (𝑥𝑛)))    &   (𝜑 → seq0( + , 𝐴) ⇝ 0)    &   (𝜑𝑋 ∈ (𝑆 ∖ {1}))    &   (𝜑𝑅 ∈ ℝ+)    &   (𝜑𝑁 ∈ ℕ0)    &   (𝜑 → ∀𝑘 ∈ (ℤ𝑁)(abs‘(seq0( + , 𝐴)‘𝑘)) < 𝑅)    &   (𝜑 → (abs‘(1 − 𝑋)) < (𝑅 / (Σ𝑛 ∈ (0...(𝑁 − 1))(abs‘(seq0( + , 𝐴)‘𝑛)) + 1)))       (𝜑 → (abs‘(𝐹𝑋)) < ((𝑀 + 1) · 𝑅))
 
Theoremabelthlem8 23884* Lemma for abelth 23886. (Contributed by Mario Carneiro, 2-Apr-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}    &   𝐹 = (𝑥𝑆 ↦ Σ𝑛 ∈ ℕ0 ((𝐴𝑛) · (𝑥𝑛)))    &   (𝜑 → seq0( + , 𝐴) ⇝ 0)       ((𝜑𝑅 ∈ ℝ+) → ∃𝑤 ∈ ℝ+𝑦𝑆 ((abs‘(1 − 𝑦)) < 𝑤 → (abs‘((𝐹‘1) − (𝐹𝑦))) < 𝑅))
 
Theoremabelthlem9 23885* Lemma for abelth 23886. By adjusting the constant term, we can assume that the entire series converges to 0. (Contributed by Mario Carneiro, 1-Apr-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}    &   𝐹 = (𝑥𝑆 ↦ Σ𝑛 ∈ ℕ0 ((𝐴𝑛) · (𝑥𝑛)))       ((𝜑𝑅 ∈ ℝ+) → ∃𝑤 ∈ ℝ+𝑦𝑆 ((abs‘(1 − 𝑦)) < 𝑤 → (abs‘((𝐹‘1) − (𝐹𝑦))) < 𝑅))
 
Theoremabelth 23886* Abel's theorem. If the power series Σ𝑛 ∈ ℕ0𝐴(𝑛)(𝑥𝑛) is convergent at 1, then it is equal to the limit from "below", along a Stolz angle 𝑆 (note that the 𝑀 = 1 case of a Stolz angle is the real line [0, 1]). (Continuity on 𝑆 ∖ {1} follows more generally from psercn 23871.) (Contributed by Mario Carneiro, 2-Apr-2015.) (Revised by Mario Carneiro, 8-Sep-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   (𝜑𝑀 ∈ ℝ)    &   (𝜑 → 0 ≤ 𝑀)    &   𝑆 = {𝑧 ∈ ℂ ∣ (abs‘(1 − 𝑧)) ≤ (𝑀 · (1 − (abs‘𝑧)))}    &   𝐹 = (𝑥𝑆 ↦ Σ𝑛 ∈ ℕ0 ((𝐴𝑛) · (𝑥𝑛)))       (𝜑𝐹 ∈ (𝑆cn→ℂ))
 
Theoremabelth2 23887* Abel's theorem, restricted to the [0, 1] interval. (Contributed by Mario Carneiro, 2-Apr-2015.)
(𝜑𝐴:ℕ0⟶ℂ)    &   (𝜑 → seq0( + , 𝐴) ∈ dom ⇝ )    &   𝐹 = (𝑥 ∈ (0[,]1) ↦ Σ𝑛 ∈ ℕ0 ((𝐴𝑛) · (𝑥𝑛)))       (𝜑𝐹 ∈ ((0[,]1)–cn→ℂ))
 
14.3  Basic trigonometry
 
14.3.1  The exponential, sine, and cosine functions (cont.)
 
Theoremefcn 23888 The exponential function is continuous. (Contributed by Paul Chapman, 15-Sep-2007.) (Revised by Mario Carneiro, 20-Jun-2015.)
exp ∈ (ℂ–cn→ℂ)
 
Theoremsincn 23889 Sine is continuous. (Contributed by Paul Chapman, 28-Nov-2007.) (Revised by Mario Carneiro, 3-Sep-2014.)
sin ∈ (ℂ–cn→ℂ)
 
Theoremcoscn 23890 Cosine is continuous. (Contributed by Paul Chapman, 28-Nov-2007.) (Revised by Mario Carneiro, 3-Sep-2014.)
cos ∈ (ℂ–cn→ℂ)
 
Theoremreeff1olem 23891* Lemma for reeff1o 23892. (Contributed by Paul Chapman, 18-Oct-2007.) (Revised by Mario Carneiro, 30-Apr-2014.)
((𝑈 ∈ ℝ ∧ 1 < 𝑈) → ∃𝑥 ∈ ℝ (exp‘𝑥) = 𝑈)
 
Theoremreeff1o 23892 The real exponential function is one-to-one onto. (Contributed by Paul Chapman, 18-Oct-2007.) (Revised by Mario Carneiro, 10-Nov-2013.)
(exp ↾ ℝ):ℝ–1-1-onto→ℝ+
 
Theoremreefiso 23893 The exponential function on the reals determines an isomorphism from reals onto positive reals. (Contributed by Steve Rodriguez, 25-Nov-2007.) (Revised by Mario Carneiro, 11-Mar-2014.)
(exp ↾ ℝ) Isom < , < (ℝ, ℝ+)
 
Theoremefcvx 23894 The exponential function on the reals is a strictly convex function. (Contributed by Mario Carneiro, 20-Jun-2015.)
(((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐴 < 𝐵) ∧ 𝑇 ∈ (0(,)1)) → (exp‘((𝑇 · 𝐴) + ((1 − 𝑇) · 𝐵))) < ((𝑇 · (exp‘𝐴)) + ((1 − 𝑇) · (exp‘𝐵))))
 
Theoremreefgim 23895 The exponential function is a group isomorphism from the group of reals under addition to the group of positive reals under multiplication. (Contributed by Mario Carneiro, 21-Jun-2015.) (Revised by Thierry Arnoux, 30-Jun-2019.)
𝑃 = ((mulGrp‘ℂfld) ↾s+)       (exp ↾ ℝ) ∈ (ℝfld GrpIso 𝑃)
 
14.3.2  Properties of pi = 3.14159...
 
Theorempilem1 23896 Lemma for pire 23901, pigt2lt4 23899 and sinpi 23900. (Contributed by Mario Carneiro, 9-May-2014.)
(𝐴 ∈ (ℝ+ ∩ (sin “ {0})) ↔ (𝐴 ∈ ℝ+ ∧ (sin‘𝐴) = 0))
 
Theorempilem2 23897 Lemma for pire 23901, pigt2lt4 23899 and sinpi 23900. (Contributed by Mario Carneiro, 12-Jun-2014.) (Revised by AV, 14-Sep-2020.)
(𝜑𝐴 ∈ (2(,)4))    &   (𝜑𝐵 ∈ ℝ+)    &   (𝜑 → (sin‘𝐴) = 0)    &   (𝜑 → (sin‘𝐵) = 0)    &   (𝜑 → π < 𝐴)       (𝜑 → ((π + 𝐴) / 2) ≤ 𝐵)
 
Theorempilem3 23898 Lemma for pire 23901, pigt2lt4 23899 and sinpi 23900. Existence part. (Contributed by Paul Chapman, 23-Jan-2008.) (Proof shortened by Mario Carneiro, 18-Jun-2014.) (Revised by AV, 14-Sep-2020.)
(π ∈ (2(,)4) ∧ (sin‘π) = 0)
 
Theorempigt2lt4 23899 π is between 2 and 4. (Contributed by Paul Chapman, 23-Jan-2008.) (Revised by Mario Carneiro, 9-May-2014.)
(2 < π ∧ π < 4)
 
Theoremsinpi 23900 The sine of π is 0. (Contributed by Paul Chapman, 23-Jan-2008.)
(sin‘π) = 0
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42400 425 42401-42426
  Copyright terms: Public domain < Previous  Next >