Step
*
1
3
1
1
of Lemma
log-contraction-Taylor
.....assertion.....
1. a : ℝ
2. x : ℝ
3. r0 < a
4. |x - rlog(a)| ≤ r1
5. ∀x:ℝ. (r0 < (a + e^x))
6. ∀x:ℝ. ∀n:ℕ+. (r0 < a + e^x^n)
7. e : {e:ℝ| r0 < e}
8. c : ℝ
9. rmin(rlog(a);x) ≤ c
10. c ≤ rmax(rlog(a);x)
11. |Taylor-remainder((-∞, ∞);2;x;rlog(a);k,x.if (k =z 0) then log-contraction(a;x)
if (k =z 1) then (a - e^x/a + e^x)^2
if (k =z 2) then (((r(-4) * a) * e^x) * (a - e^x)/a + e^x^3)
else (((r(16) * a^2) * e^x^2) + ((r(-4) * a^3) * e^x) + ((r(-4) * a) * e^x^3)/a + e^x^4)
fi ) - (x - c^2 * ((((r(16) * a^2) * e^c^2) + ((r(-4) * a^3) * e^c) + ((r(-4) * a) * e^c^3)/a + e^c^4)/r((2)!)))
* (x - rlog(a))| ≤ e
⊢ Taylor-remainder((-∞, ∞);2;x;rlog(a);k,x.if (k =z 0) then log-contraction(a;x)
if (k =z 1) then (a - e^x/a + e^x)^2
if (k =z 2) then (((r(-4) * a) * e^x) * (a - e^x)/a + e^x^3)
else (((r(16) * a^2) * e^x^2) + ((r(-4) * a^3) * e^x) + ((r(-4) * a) * e^x^3)/a + e^x^4)
fi )
= (log-contraction(a;x) - rlog(a))
BY
{ (RepUR ``Taylor-remainder Taylor-approx`` 0
THEN (Assert ⌜(a - e^rlog(a)) = r0⌝⋅ THENA ((RWO "rexp-rlog" 0 THENM nRNorm 0) THEN Auto))
) }
1
1. a : ℝ
2. x : ℝ
3. r0 < a
4. |x - rlog(a)| ≤ r1
5. ∀x:ℝ. (r0 < (a + e^x))
6. ∀x:ℝ. ∀n:ℕ+. (r0 < a + e^x^n)
7. e : {e:ℝ| r0 < e}
8. c : ℝ
9. rmin(rlog(a);x) ≤ c
10. c ≤ rmax(rlog(a);x)
11. |Taylor-remainder((-∞, ∞);2;x;rlog(a);k,x.if (k =z 0) then log-contraction(a;x)
if (k =z 1) then (a - e^x/a + e^x)^2
if (k =z 2) then (((r(-4) * a) * e^x) * (a - e^x)/a + e^x^3)
else (((r(16) * a^2) * e^x^2) + ((r(-4) * a^3) * e^x) + ((r(-4) * a) * e^x^3)/a + e^x^4)
fi ) - (x - c^2 * ((((r(16) * a^2) * e^c^2) + ((r(-4) * a^3) * e^c) + ((r(-4) * a) * e^c^3)/a + e^c^4)/r((2)!)))
* (x - rlog(a))| ≤ e
12. (a - e^rlog(a)) = r0
⊢ (log-contraction(a;x) - Σ{(if (k =z 0) then log-contraction(a;rlog(a))
if (k =z 1) then (a - e^rlog(a)/a + e^rlog(a))^2
if (k =z 2) then (((r(-4) * a) * e^rlog(a)) * (a - e^rlog(a))/a + e^rlog(a)^3)
else (((r(16) * a^2) * e^rlog(a)^2) + ((r(-4) * a^3) * e^rlog(a)) + ((r(-4) * a) * e^rlog(a)^3)/a + e^rlog(a)^4)
fi /r((k)!))
* x - rlog(a)^k | 0≤k≤2})
= (log-contraction(a;x) - rlog(a))
Latex:
Latex:
.....assertion.....
1. a : \mBbbR{}
2. x : \mBbbR{}
3. r0 < a
4. |x - rlog(a)| \mleq{} r1
5. \mforall{}x:\mBbbR{}. (r0 < (a + e\^{}x))
6. \mforall{}x:\mBbbR{}. \mforall{}n:\mBbbN{}\msupplus{}. (r0 < a + e\^{}x\^{}n)
7. e : \{e:\mBbbR{}| r0 < e\}
8. c : \mBbbR{}
9. rmin(rlog(a);x) \mleq{} c
10. c \mleq{} rmax(rlog(a);x)
11. |Taylor-remainder((-\minfty{}, \minfty{});2;x;rlog(a);k,x.if (k =\msubz{} 0) then log-contraction(a;x)
if (k =\msubz{} 1) then (a - e\^{}x/a + e\^{}x)\^{}2
if (k =\msubz{} 2) then (((r(-4) * a) * e\^{}x) * (a - e\^{}x)/a + e\^{}x\^{}3)
else (((r(16) * a\^{}2) * e\^{}x\^{}2) + ((r(-4) * a\^{}3) * e\^{}x) + ((r(-4) * a) * e\^{}x\^{}3)/a + e\^{}x\^{}4)
fi ) - (x - c\^{}2
* ((((r(16) * a\^{}2) * e\^{}c\^{}2) + ((r(-4) * a\^{}3) * e\^{}c) + ((r(-4) * a) * e\^{}c\^{}3)/a + e\^{}c\^{}4)/r((2)!)))
* (x - rlog(a))| \mleq{} e
\mvdash{} Taylor-remainder((-\minfty{}, \minfty{});2;x;rlog(a);k,x.if (k =\msubz{} 0) then log-contraction(a;x)
if (k =\msubz{} 1) then (a - e\^{}x/a + e\^{}x)\^{}2
if (k =\msubz{} 2) then (((r(-4) * a) * e\^{}x) * (a - e\^{}x)/a + e\^{}x\^{}3)
else (((r(16) * a\^{}2) * e\^{}x\^{}2) + ((r(-4) * a\^{}3) * e\^{}x) + ((r(-4) * a) * e\^{}x\^{}3)/a + e\^{}x\^{}4)
fi )
= (log-contraction(a;x) - rlog(a))
By
Latex:
(RepUR ``Taylor-remainder Taylor-approx`` 0
THEN (Assert \mkleeneopen{}(a - e\^{}rlog(a)) = r0\mkleeneclose{}\mcdot{} THENA ((RWO "rexp-rlog" 0 THENM nRNorm 0) THEN Auto))
)
Home
Index