Step
*
1
of Lemma
Taylor-theorem-case1
1. I : Interval
2. iproper(I)
3. n : ℕ
4. F : ℕn + 2 ⟶ I ⟶ℝ
5. ∀b:{a:ℝ| a ∈ I}
((∀k:ℕn + 2. ∀x,y:{a:ℝ| a ∈ I} . ((x = y)
⇒ (F[k;x] = F[k;y])))
⇒ finite-deriv-seq(I;n + 1;i,x.F[i;x])
⇒ d(Taylor-approx(n;a;b;i,x.F[i;x]))/da = λx.b - x^n * (F[n + 1;x]/r((n)!)) on I)
6. a : {a:ℝ| a ∈ I}
7. b : {a:ℝ| a ∈ I}
8. ∀k:ℕn + 2. ∀x,y:{a:ℝ| a ∈ I} . ((x = y)
⇒ (F[k;x] = F[k;y]))
9. finite-deriv-seq(I;n + 1;i,x.F[i;x])
10. d(Taylor-approx(n;a;b;i,x.F[i;x]))/da = λx.b - x^n * (F[n + 1;x]/r((n)!)) on I
11. b - a ≠ r0
12. e : ℝ
13. r0 < e
14. R : ℝ
15. Taylor-remainder(I;n;b;a;k,x.F[k;x]) = R ∈ ℝ
⊢ ∃c:ℝ. ((rmin(a;b) ≤ c) ∧ (c ≤ rmax(a;b)) ∧ (|R - (b - c^n * (F[n + 1;c]/r((n)!))) * (b - a)| ≤ e))
BY
{ Thin 2 }
1
1. I : Interval
2. n : ℕ
3. F : ℕn + 2 ⟶ I ⟶ℝ
4. ∀b:{a:ℝ| a ∈ I}
((∀k:ℕn + 2. ∀x,y:{a:ℝ| a ∈ I} . ((x = y)
⇒ (F[k;x] = F[k;y])))
⇒ finite-deriv-seq(I;n + 1;i,x.F[i;x])
⇒ d(Taylor-approx(n;a;b;i,x.F[i;x]))/da = λx.b - x^n * (F[n + 1;x]/r((n)!)) on I)
5. a : {a:ℝ| a ∈ I}
6. b : {a:ℝ| a ∈ I}
7. ∀k:ℕn + 2. ∀x,y:{a:ℝ| a ∈ I} . ((x = y)
⇒ (F[k;x] = F[k;y]))
8. finite-deriv-seq(I;n + 1;i,x.F[i;x])
9. d(Taylor-approx(n;a;b;i,x.F[i;x]))/da = λx.b - x^n * (F[n + 1;x]/r((n)!)) on I
10. b - a ≠ r0
11. e : ℝ
12. r0 < e
13. R : ℝ
14. Taylor-remainder(I;n;b;a;k,x.F[k;x]) = R ∈ ℝ
⊢ ∃c:ℝ. ((rmin(a;b) ≤ c) ∧ (c ≤ rmax(a;b)) ∧ (|R - (b - c^n * (F[n + 1;c]/r((n)!))) * (b - a)| ≤ e))
Latex:
Latex:
1. I : Interval
2. iproper(I)
3. n : \mBbbN{}
4. F : \mBbbN{}n + 2 {}\mrightarrow{} I {}\mrightarrow{}\mBbbR{}
5. \mforall{}b:\{a:\mBbbR{}| a \mmember{} I\}
((\mforall{}k:\mBbbN{}n + 2. \mforall{}x,y:\{a:\mBbbR{}| a \mmember{} I\} . ((x = y) {}\mRightarrow{} (F[k;x] = F[k;y])))
{}\mRightarrow{} finite-deriv-seq(I;n + 1;i,x.F[i;x])
{}\mRightarrow{} d(Taylor-approx(n;a;b;i,x.F[i;x]))/da = \mlambda{}x.b - x\^{}n * (F[n + 1;x]/r((n)!)) on I)
6. a : \{a:\mBbbR{}| a \mmember{} I\}
7. b : \{a:\mBbbR{}| a \mmember{} I\}
8. \mforall{}k:\mBbbN{}n + 2. \mforall{}x,y:\{a:\mBbbR{}| a \mmember{} I\} . ((x = y) {}\mRightarrow{} (F[k;x] = F[k;y]))
9. finite-deriv-seq(I;n + 1;i,x.F[i;x])
10. d(Taylor-approx(n;a;b;i,x.F[i;x]))/da = \mlambda{}x.b - x\^{}n * (F[n + 1;x]/r((n)!)) on I
11. b - a \mneq{} r0
12. e : \mBbbR{}
13. r0 < e
14. R : \mBbbR{}
15. Taylor-remainder(I;n;b;a;k,x.F[k;x]) = R
\mvdash{} \mexists{}c:\mBbbR{}. ((rmin(a;b) \mleq{} c) \mwedge{} (c \mleq{} rmax(a;b)) \mwedge{} (|R - (b - c\^{}n * (F[n + 1;c]/r((n)!))) * (b - a)| \mleq{} e))
By
Latex:
Thin 2
Home
Index