author | wenzelm |
Thu, 30 Apr 2015 15:58:15 +0200 | |
changeset 60159 | 879918f4ee0f |
parent 60155 | 91477b3a2d6b |
child 60162 | 645058aa9d6f |
permissions | -rw-r--r-- |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1 |
(* Title: HOL/Transcendental.thy |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
2 |
Author: Jacques D. Fleuriot, University of Cambridge, University of Edinburgh |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
3 |
Author: Lawrence C Paulson |
51527 | 4 |
Author: Jeremy Avigad |
12196 | 5 |
*) |
6 |
||
58889 | 7 |
section{*Power Series, Transcendental Functions etc.*} |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
8 |
|
15131 | 9 |
theory Transcendental |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
10 |
imports Binomial Series Deriv NthRoot |
15131 | 11 |
begin |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
12 |
|
60155
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
13 |
lemma reals_Archimedean4: |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
14 |
assumes "0 < y" "0 \<le> x" |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
15 |
obtains n where "real n * y \<le> x" "x < real (Suc n) * y" |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
16 |
using floor_correct [of "x/y"] assms |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
17 |
by (auto simp: Real.real_of_nat_Suc field_simps intro: that [of "nat (floor (x/y))"]) |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
18 |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
19 |
lemma of_real_fact [simp]: "of_real (fact n) = fact n" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
20 |
by (metis of_nat_fact of_real_of_nat_eq) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
21 |
|
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
22 |
lemma real_fact_nat [simp]: "real (fact n :: nat) = fact n" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
23 |
by (simp add: real_of_nat_def) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
24 |
|
59731 | 25 |
lemma real_fact_int [simp]: "real (fact n :: int) = fact n" |
26 |
by (metis of_int_of_nat_eq of_nat_fact real_of_int_def) |
|
27 |
||
57025 | 28 |
lemma root_test_convergence: |
29 |
fixes f :: "nat \<Rightarrow> 'a::banach" |
|
30 |
assumes f: "(\<lambda>n. root n (norm (f n))) ----> x" -- "could be weakened to lim sup" |
|
31 |
assumes "x < 1" |
|
32 |
shows "summable f" |
|
33 |
proof - |
|
34 |
have "0 \<le> x" |
|
35 |
by (rule LIMSEQ_le[OF tendsto_const f]) (auto intro!: exI[of _ 1]) |
|
36 |
from `x < 1` obtain z where z: "x < z" "z < 1" |
|
37 |
by (metis dense) |
|
38 |
from f `x < z` |
|
39 |
have "eventually (\<lambda>n. root n (norm (f n)) < z) sequentially" |
|
40 |
by (rule order_tendstoD) |
|
41 |
then have "eventually (\<lambda>n. norm (f n) \<le> z^n) sequentially" |
|
42 |
using eventually_ge_at_top |
|
43 |
proof eventually_elim |
|
44 |
fix n assume less: "root n (norm (f n)) < z" and n: "1 \<le> n" |
|
45 |
from power_strict_mono[OF less, of n] n |
|
46 |
show "norm (f n) \<le> z ^ n" |
|
47 |
by simp |
|
48 |
qed |
|
49 |
then show "summable f" |
|
50 |
unfolding eventually_sequentially |
|
51 |
using z `0 \<le> x` by (auto intro!: summable_comparison_test[OF _ summable_geometric]) |
|
52 |
qed |
|
53 |
||
29164 | 54 |
subsection {* Properties of Power Series *} |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
55 |
|
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
56 |
lemma lemma_realpow_diff: |
31017 | 57 |
fixes y :: "'a::monoid_mult" |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
58 |
shows "p \<le> n \<Longrightarrow> y ^ (Suc n - p) = (y ^ (n - p)) * y" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
59 |
proof - |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
60 |
assume "p \<le> n" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
61 |
hence "Suc n - p = Suc (n - p)" by (rule Suc_diff_le) |
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30082
diff
changeset
|
62 |
thus ?thesis by (simp add: power_commutes) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
63 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
64 |
|
15229 | 65 |
lemma lemma_realpow_diff_sumr2: |
53079 | 66 |
fixes y :: "'a::{comm_ring,monoid_mult}" |
67 |
shows |
|
68 |
"x ^ (Suc n) - y ^ (Suc n) = |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
69 |
(x - y) * (\<Sum>p<Suc n. (x ^ p) * y ^ (n - p))" |
54573 | 70 |
proof (induct n) |
71 |
case (Suc n) |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
72 |
have "x ^ Suc (Suc n) - y ^ Suc (Suc n) = x * (x * x^n) - y * (y * y ^ n)" |
54573 | 73 |
by simp |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
74 |
also have "... = y * (x ^ (Suc n) - y ^ (Suc n)) + (x - y) * (x * x^n)" |
54573 | 75 |
by (simp add: algebra_simps) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
76 |
also have "... = y * ((x - y) * (\<Sum>p<Suc n. (x ^ p) * y ^ (n - p))) + (x - y) * (x * x^n)" |
54573 | 77 |
by (simp only: Suc) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
78 |
also have "... = (x - y) * (y * (\<Sum>p<Suc n. (x ^ p) * y ^ (n - p))) + (x - y) * (x * x^n)" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
79 |
by (simp only: mult.left_commute) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
80 |
also have "... = (x - y) * (\<Sum>p<Suc (Suc n). x ^ p * y ^ (Suc n - p))" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
81 |
by (simp add: field_simps Suc_diff_le setsum_left_distrib setsum_right_distrib) |
54573 | 82 |
finally show ?case . |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
83 |
qed simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
84 |
|
55832 | 85 |
corollary power_diff_sumr2: --{* @{text COMPLEX_POLYFUN} in HOL Light *} |
55734 | 86 |
fixes x :: "'a::{comm_ring,monoid_mult}" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
87 |
shows "x^n - y^n = (x - y) * (\<Sum>i<n. y^(n - Suc i) * x^i)" |
55734 | 88 |
using lemma_realpow_diff_sumr2[of x "n - 1" y] |
89 |
by (cases "n = 0") (simp_all add: field_simps) |
|
90 |
||
15229 | 91 |
lemma lemma_realpow_rev_sumr: |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
92 |
"(\<Sum>p<Suc n. (x ^ p) * (y ^ (n - p))) = |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
93 |
(\<Sum>p<Suc n. (x ^ (n - p)) * (y ^ p))" |
57129
7edb7550663e
introduce more powerful reindexing rules for big operators
hoelzl
parents:
57025
diff
changeset
|
94 |
by (subst nat_diff_setsum_reindex[symmetric]) simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
95 |
|
55719
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
96 |
lemma power_diff_1_eq: |
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
97 |
fixes x :: "'a::{comm_ring,monoid_mult}" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
98 |
shows "n \<noteq> 0 \<Longrightarrow> x^n - 1 = (x - 1) * (\<Sum>i<n. (x^i))" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
99 |
using lemma_realpow_diff_sumr2 [of x _ 1] |
55719
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
100 |
by (cases n) auto |
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
101 |
|
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
102 |
lemma one_diff_power_eq': |
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
103 |
fixes x :: "'a::{comm_ring,monoid_mult}" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
104 |
shows "n \<noteq> 0 \<Longrightarrow> 1 - x^n = (1 - x) * (\<Sum>i<n. x^(n - Suc i))" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
105 |
using lemma_realpow_diff_sumr2 [of 1 _ x] |
55719
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
106 |
by (cases n) auto |
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
107 |
|
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
108 |
lemma one_diff_power_eq: |
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
109 |
fixes x :: "'a::{comm_ring,monoid_mult}" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
110 |
shows "n \<noteq> 0 \<Longrightarrow> 1 - x^n = (1 - x) * (\<Sum>i<n. x^i)" |
55719
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
111 |
by (metis one_diff_power_eq' [of n x] nat_diff_setsum_reindex) |
cdddd073bff8
Lemmas about Reals, norm, etc., and cleaner variants of existing ones
paulson <lp15@cam.ac.uk>
parents:
55417
diff
changeset
|
112 |
|
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
113 |
lemma powser_zero: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
114 |
fixes f :: "nat \<Rightarrow> 'a::real_normed_algebra_1" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
115 |
shows "(\<Sum>n. f n * 0 ^ n) = f 0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
116 |
proof - |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
117 |
have "(\<Sum>n<1. f n * 0 ^ n) = (\<Sum>n. f n * 0 ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
118 |
by (subst suminf_finite[where N="{0}"]) (auto simp: power_0_left) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
119 |
thus ?thesis unfolding One_nat_def by simp |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
120 |
qed |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
121 |
|
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
122 |
lemma powser_sums_zero: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
123 |
fixes a :: "nat \<Rightarrow> 'a::real_normed_div_algebra" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
124 |
shows "(\<lambda>n. a n * 0^n) sums a 0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
125 |
using sums_finite [of "{0}" "\<lambda>n. a n * 0 ^ n"] |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
126 |
by simp |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
127 |
|
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
128 |
text{*Power series has a circle or radius of convergence: if it sums for @{term |
53079 | 129 |
x}, then it sums absolutely for @{term z} with @{term "\<bar>z\<bar> < \<bar>x\<bar>"}.*} |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
130 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
131 |
lemma powser_insidea: |
53599 | 132 |
fixes x z :: "'a::real_normed_div_algebra" |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
133 |
assumes 1: "summable (\<lambda>n. f n * x^n)" |
53079 | 134 |
and 2: "norm z < norm x" |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
135 |
shows "summable (\<lambda>n. norm (f n * z ^ n))" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
136 |
proof - |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
137 |
from 2 have x_neq_0: "x \<noteq> 0" by clarsimp |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
138 |
from 1 have "(\<lambda>n. f n * x^n) ----> 0" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
139 |
by (rule summable_LIMSEQ_zero) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
140 |
hence "convergent (\<lambda>n. f n * x^n)" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
141 |
by (rule convergentI) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
142 |
hence "Cauchy (\<lambda>n. f n * x^n)" |
44726 | 143 |
by (rule convergent_Cauchy) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
144 |
hence "Bseq (\<lambda>n. f n * x^n)" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
145 |
by (rule Cauchy_Bseq) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
146 |
then obtain K where 3: "0 < K" and 4: "\<forall>n. norm (f n * x^n) \<le> K" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
147 |
by (simp add: Bseq_def, safe) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
148 |
have "\<exists>N. \<forall>n\<ge>N. norm (norm (f n * z ^ n)) \<le> |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
149 |
K * norm (z ^ n) * inverse (norm (x^n))" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
150 |
proof (intro exI allI impI) |
53079 | 151 |
fix n::nat |
152 |
assume "0 \<le> n" |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
153 |
have "norm (norm (f n * z ^ n)) * norm (x^n) = |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
154 |
norm (f n * x^n) * norm (z ^ n)" |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
155 |
by (simp add: norm_mult abs_mult) |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
156 |
also have "\<dots> \<le> K * norm (z ^ n)" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
157 |
by (simp only: mult_right_mono 4 norm_ge_zero) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
158 |
also have "\<dots> = K * norm (z ^ n) * (inverse (norm (x^n)) * norm (x^n))" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
159 |
by (simp add: x_neq_0) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
160 |
also have "\<dots> = K * norm (z ^ n) * inverse (norm (x^n)) * norm (x^n)" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
161 |
by (simp only: mult.assoc) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
162 |
finally show "norm (norm (f n * z ^ n)) \<le> |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
163 |
K * norm (z ^ n) * inverse (norm (x^n))" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
164 |
by (simp add: mult_le_cancel_right x_neq_0) |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
165 |
qed |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
166 |
moreover have "summable (\<lambda>n. K * norm (z ^ n) * inverse (norm (x^n)))" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
167 |
proof - |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
168 |
from 2 have "norm (norm (z * inverse x)) < 1" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
169 |
using x_neq_0 |
53599 | 170 |
by (simp add: norm_mult nonzero_norm_inverse divide_inverse [where 'a=real, symmetric]) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
171 |
hence "summable (\<lambda>n. norm (z * inverse x) ^ n)" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
172 |
by (rule summable_geometric) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
173 |
hence "summable (\<lambda>n. K * norm (z * inverse x) ^ n)" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
174 |
by (rule summable_mult) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
175 |
thus "summable (\<lambda>n. K * norm (z ^ n) * inverse (norm (x^n)))" |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
176 |
using x_neq_0 |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
177 |
by (simp add: norm_mult nonzero_norm_inverse power_mult_distrib |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
178 |
power_inverse norm_power mult.assoc) |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
179 |
qed |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
180 |
ultimately show "summable (\<lambda>n. norm (f n * z ^ n))" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
181 |
by (rule summable_comparison_test) |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
182 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
183 |
|
15229 | 184 |
lemma powser_inside: |
53599 | 185 |
fixes f :: "nat \<Rightarrow> 'a::{real_normed_div_algebra,banach}" |
53079 | 186 |
shows |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
187 |
"summable (\<lambda>n. f n * (x^n)) \<Longrightarrow> norm z < norm x \<Longrightarrow> |
53079 | 188 |
summable (\<lambda>n. f n * (z ^ n))" |
189 |
by (rule powser_insidea [THEN summable_norm_cancel]) |
|
190 |
||
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
191 |
lemma powser_times_n_limit_0: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
192 |
fixes x :: "'a::{real_normed_div_algebra,banach}" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
193 |
assumes "norm x < 1" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
194 |
shows "(\<lambda>n. of_nat n * x ^ n) ----> 0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
195 |
proof - |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
196 |
have "norm x / (1 - norm x) \<ge> 0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
197 |
using assms |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
198 |
by (auto simp: divide_simps) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
199 |
moreover obtain N where N: "norm x / (1 - norm x) < of_int N" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
200 |
using ex_le_of_int |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
201 |
by (meson ex_less_of_int) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
202 |
ultimately have N0: "N>0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
203 |
by auto |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
204 |
then have *: "real (N + 1) * norm x / real N < 1" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
205 |
using N assms |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
206 |
by (auto simp: field_simps) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
207 |
{ fix n::nat |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
208 |
assume "N \<le> int n" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
209 |
then have "real N * real_of_nat (Suc n) \<le> real_of_nat n * real (1 + N)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
210 |
by (simp add: algebra_simps) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
211 |
then have "(real N * real_of_nat (Suc n)) * (norm x * norm (x ^ n)) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
212 |
\<le> (real_of_nat n * real (1 + N)) * (norm x * norm (x ^ n))" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
213 |
using N0 mult_mono by fastforce |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
214 |
then have "real N * (norm x * (real_of_nat (Suc n) * norm (x ^ n))) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
215 |
\<le> real_of_nat n * (norm x * (real (1 + N) * norm (x ^ n)))" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
216 |
by (simp add: algebra_simps) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
217 |
} note ** = this |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
218 |
show ?thesis using * |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
219 |
apply (rule summable_LIMSEQ_zero [OF summable_ratio_test, where N1="nat N"]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
220 |
apply (simp add: N0 norm_mult nat_le_iff field_simps power_Suc ** |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
221 |
del: of_nat_Suc real_of_int_add) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
222 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
223 |
qed |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
224 |
|
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
225 |
corollary lim_n_over_pown: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
226 |
fixes x :: "'a::{real_normed_field,banach}" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
227 |
shows "1 < norm x \<Longrightarrow> ((\<lambda>n. of_nat n / x^n) ---> 0) sequentially" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
228 |
using powser_times_n_limit_0 [of "inverse x"] |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
229 |
by (simp add: norm_divide divide_simps) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
230 |
|
60155
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
231 |
lemma lim_1_over_n: "((\<lambda>n. 1 / of_nat n) ---> (0::'a\<Colon>real_normed_field)) sequentially" |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
232 |
apply (clarsimp simp: lim_sequentially norm_divide dist_norm divide_simps) |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
233 |
apply (auto simp: mult_ac dest!: ex_less_of_nat_mult [of _ 1]) |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
234 |
by (metis le_eq_less_or_eq less_trans linordered_comm_semiring_strict_class.comm_mult_strict_left_mono |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
235 |
of_nat_less_0_iff of_nat_less_iff zero_less_mult_iff zero_less_one) |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
236 |
|
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
237 |
lemma lim_inverse_n: "((\<lambda>n. inverse(of_nat n)) ---> (0::'a\<Colon>real_normed_field)) sequentially" |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
238 |
using lim_1_over_n |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
239 |
by (simp add: inverse_eq_divide) |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
240 |
|
53079 | 241 |
lemma sum_split_even_odd: |
242 |
fixes f :: "nat \<Rightarrow> real" |
|
243 |
shows |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
244 |
"(\<Sum>i<2 * n. if even i then f i else g i) = |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
245 |
(\<Sum>i<n. f (2 * i)) + (\<Sum>i<n. g (2 * i + 1))" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
246 |
proof (induct n) |
53079 | 247 |
case 0 |
248 |
then show ?case by simp |
|
249 |
next |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
250 |
case (Suc n) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
251 |
have "(\<Sum>i<2 * Suc n. if even i then f i else g i) = |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
252 |
(\<Sum>i<n. f (2 * i)) + (\<Sum>i<n. g (2 * i + 1)) + (f (2 * n) + g (2 * n + 1))" |
30082
43c5b7bfc791
make more proofs work whether or not One_nat_def is a simp rule
huffman
parents:
29803
diff
changeset
|
253 |
using Suc.hyps unfolding One_nat_def by auto |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
254 |
also have "\<dots> = (\<Sum>i<Suc n. f (2 * i)) + (\<Sum>i<Suc n. g (2 * i + 1))" |
53079 | 255 |
by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
256 |
finally show ?case . |
53079 | 257 |
qed |
258 |
||
259 |
lemma sums_if': |
|
260 |
fixes g :: "nat \<Rightarrow> real" |
|
261 |
assumes "g sums x" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
262 |
shows "(\<lambda> n. if even n then 0 else g ((n - 1) div 2)) sums x" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
263 |
unfolding sums_def |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
264 |
proof (rule LIMSEQ_I) |
53079 | 265 |
fix r :: real |
266 |
assume "0 < r" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
267 |
from `g sums x`[unfolded sums_def, THEN LIMSEQ_D, OF this] |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
268 |
obtain no where no_eq: "\<And> n. n \<ge> no \<Longrightarrow> (norm (setsum g {..<n} - x) < r)" by blast |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
269 |
|
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
270 |
let ?SUM = "\<lambda> m. \<Sum>i<m. if even i then 0 else g ((i - 1) div 2)" |
53079 | 271 |
{ |
272 |
fix m |
|
273 |
assume "m \<ge> 2 * no" |
|
274 |
hence "m div 2 \<ge> no" by auto |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
275 |
have sum_eq: "?SUM (2 * (m div 2)) = setsum g {..< m div 2}" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
276 |
using sum_split_even_odd by auto |
53079 | 277 |
hence "(norm (?SUM (2 * (m div 2)) - x) < r)" |
278 |
using no_eq unfolding sum_eq using `m div 2 \<ge> no` by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
279 |
moreover |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
280 |
have "?SUM (2 * (m div 2)) = ?SUM m" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
281 |
proof (cases "even m") |
53079 | 282 |
case True |
58710
7216a10d69ba
augmented and tuned facts on even/odd and division
haftmann
parents:
58709
diff
changeset
|
283 |
then show ?thesis by (auto simp add: even_two_times_div_two) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
284 |
next |
53079 | 285 |
case False |
58834 | 286 |
then have eq: "Suc (2 * (m div 2)) = m" by simp |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
287 |
hence "even (2 * (m div 2))" using `odd m` by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
288 |
have "?SUM m = ?SUM (Suc (2 * (m div 2)))" unfolding eq .. |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
289 |
also have "\<dots> = ?SUM (2 * (m div 2))" using `even (2 * (m div 2))` by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
290 |
finally show ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
291 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
292 |
ultimately have "(norm (?SUM m - x) < r)" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
293 |
} |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
294 |
thus "\<exists> no. \<forall> m \<ge> no. norm (?SUM m - x) < r" by blast |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
295 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
296 |
|
53079 | 297 |
lemma sums_if: |
298 |
fixes g :: "nat \<Rightarrow> real" |
|
299 |
assumes "g sums x" and "f sums y" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
300 |
shows "(\<lambda> n. if even n then f (n div 2) else g ((n - 1) div 2)) sums (x + y)" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
301 |
proof - |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
302 |
let ?s = "\<lambda> n. if even n then 0 else f ((n - 1) div 2)" |
53079 | 303 |
{ |
304 |
fix B T E |
|
305 |
have "(if B then (0 :: real) else E) + (if B then T else 0) = (if B then T else E)" |
|
306 |
by (cases B) auto |
|
307 |
} note if_sum = this |
|
308 |
have g_sums: "(\<lambda> n. if even n then 0 else g ((n - 1) div 2)) sums x" |
|
309 |
using sums_if'[OF `g sums x`] . |
|
41970 | 310 |
{ |
41550 | 311 |
have if_eq: "\<And>B T E. (if \<not> B then T else E) = (if B then E else T)" by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
312 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
313 |
have "?s sums y" using sums_if'[OF `f sums y`] . |
41970 | 314 |
from this[unfolded sums_def, THEN LIMSEQ_Suc] |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
315 |
have "(\<lambda> n. if even n then f (n div 2) else 0) sums y" |
57418 | 316 |
by (simp add: lessThan_Suc_eq_insert_0 image_iff setsum.reindex if_eq sums_def cong del: if_cong) |
53079 | 317 |
} |
318 |
from sums_add[OF g_sums this] show ?thesis unfolding if_sum . |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
319 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
320 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
321 |
subsection {* Alternating series test / Leibniz formula *} |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
322 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
323 |
lemma sums_alternating_upper_lower: |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
324 |
fixes a :: "nat \<Rightarrow> real" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
325 |
assumes mono: "\<And>n. a (Suc n) \<le> a n" and a_pos: "\<And>n. 0 \<le> a n" and "a ----> 0" |
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
326 |
shows "\<exists>l. ((\<forall>n. (\<Sum>i<2*n. (- 1)^i*a i) \<le> l) \<and> (\<lambda> n. \<Sum>i<2*n. (- 1)^i*a i) ----> l) \<and> |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
327 |
((\<forall>n. l \<le> (\<Sum>i<2*n + 1. (- 1)^i*a i)) \<and> (\<lambda> n. \<Sum>i<2*n + 1. (- 1)^i*a i) ----> l)" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
328 |
(is "\<exists>l. ((\<forall>n. ?f n \<le> l) \<and> _) \<and> ((\<forall>n. l \<le> ?g n) \<and> _)") |
53079 | 329 |
proof (rule nested_sequence_unique) |
30082
43c5b7bfc791
make more proofs work whether or not One_nat_def is a simp rule
huffman
parents:
29803
diff
changeset
|
330 |
have fg_diff: "\<And>n. ?f n - ?g n = - a (2 * n)" unfolding One_nat_def by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
331 |
|
53079 | 332 |
show "\<forall>n. ?f n \<le> ?f (Suc n)" |
333 |
proof |
|
334 |
fix n |
|
335 |
show "?f n \<le> ?f (Suc n)" using mono[of "2*n"] by auto |
|
336 |
qed |
|
337 |
show "\<forall>n. ?g (Suc n) \<le> ?g n" |
|
338 |
proof |
|
339 |
fix n |
|
340 |
show "?g (Suc n) \<le> ?g n" using mono[of "Suc (2*n)"] |
|
341 |
unfolding One_nat_def by auto |
|
342 |
qed |
|
343 |
show "\<forall>n. ?f n \<le> ?g n" |
|
344 |
proof |
|
345 |
fix n |
|
346 |
show "?f n \<le> ?g n" using fg_diff a_pos |
|
347 |
unfolding One_nat_def by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
348 |
qed |
53079 | 349 |
show "(\<lambda>n. ?f n - ?g n) ----> 0" unfolding fg_diff |
350 |
proof (rule LIMSEQ_I) |
|
351 |
fix r :: real |
|
352 |
assume "0 < r" |
|
353 |
with `a ----> 0`[THEN LIMSEQ_D] obtain N where "\<And> n. n \<ge> N \<Longrightarrow> norm (a n - 0) < r" |
|
354 |
by auto |
|
355 |
hence "\<forall>n \<ge> N. norm (- a (2 * n) - 0) < r" by auto |
|
356 |
thus "\<exists>N. \<forall>n \<ge> N. norm (- a (2 * n) - 0) < r" by auto |
|
357 |
qed |
|
41970 | 358 |
qed |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
359 |
|
53079 | 360 |
lemma summable_Leibniz': |
361 |
fixes a :: "nat \<Rightarrow> real" |
|
362 |
assumes a_zero: "a ----> 0" |
|
363 |
and a_pos: "\<And> n. 0 \<le> a n" |
|
364 |
and a_monotone: "\<And> n. a (Suc n) \<le> a n" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
365 |
shows summable: "summable (\<lambda> n. (-1)^n * a n)" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
366 |
and "\<And>n. (\<Sum>i<2*n. (-1)^i*a i) \<le> (\<Sum>i. (-1)^i*a i)" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
367 |
and "(\<lambda>n. \<Sum>i<2*n. (-1)^i*a i) ----> (\<Sum>i. (-1)^i*a i)" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
368 |
and "\<And>n. (\<Sum>i. (-1)^i*a i) \<le> (\<Sum>i<2*n+1. (-1)^i*a i)" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
369 |
and "(\<lambda>n. \<Sum>i<2*n+1. (-1)^i*a i) ----> (\<Sum>i. (-1)^i*a i)" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
370 |
proof - |
53079 | 371 |
let ?S = "\<lambda>n. (-1)^n * a n" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
372 |
let ?P = "\<lambda>n. \<Sum>i<n. ?S i" |
53079 | 373 |
let ?f = "\<lambda>n. ?P (2 * n)" |
374 |
let ?g = "\<lambda>n. ?P (2 * n + 1)" |
|
375 |
obtain l :: real |
|
376 |
where below_l: "\<forall> n. ?f n \<le> l" |
|
377 |
and "?f ----> l" |
|
378 |
and above_l: "\<forall> n. l \<le> ?g n" |
|
379 |
and "?g ----> l" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
380 |
using sums_alternating_upper_lower[OF a_monotone a_pos a_zero] by blast |
41970 | 381 |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
382 |
let ?Sa = "\<lambda>m. \<Sum>n<m. ?S n" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
383 |
have "?Sa ----> l" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
384 |
proof (rule LIMSEQ_I) |
53079 | 385 |
fix r :: real |
386 |
assume "0 < r" |
|
41970 | 387 |
with `?f ----> l`[THEN LIMSEQ_D] |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
388 |
obtain f_no where f: "\<And> n. n \<ge> f_no \<Longrightarrow> norm (?f n - l) < r" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
389 |
|
41970 | 390 |
from `0 < r` `?g ----> l`[THEN LIMSEQ_D] |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
391 |
obtain g_no where g: "\<And> n. n \<ge> g_no \<Longrightarrow> norm (?g n - l) < r" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
392 |
|
53079 | 393 |
{ |
394 |
fix n :: nat |
|
395 |
assume "n \<ge> (max (2 * f_no) (2 * g_no))" |
|
396 |
hence "n \<ge> 2 * f_no" and "n \<ge> 2 * g_no" by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
397 |
have "norm (?Sa n - l) < r" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
398 |
proof (cases "even n") |
53079 | 399 |
case True |
58710
7216a10d69ba
augmented and tuned facts on even/odd and division
haftmann
parents:
58709
diff
changeset
|
400 |
then have n_eq: "2 * (n div 2) = n" by (simp add: even_two_times_div_two) |
53079 | 401 |
with `n \<ge> 2 * f_no` have "n div 2 \<ge> f_no" |
402 |
by auto |
|
403 |
from f[OF this] show ?thesis |
|
404 |
unfolding n_eq atLeastLessThanSuc_atLeastAtMost . |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
405 |
next |
53079 | 406 |
case False |
407 |
hence "even (n - 1)" by simp |
|
58710
7216a10d69ba
augmented and tuned facts on even/odd and division
haftmann
parents:
58709
diff
changeset
|
408 |
then have n_eq: "2 * ((n - 1) div 2) = n - 1" |
7216a10d69ba
augmented and tuned facts on even/odd and division
haftmann
parents:
58709
diff
changeset
|
409 |
by (simp add: even_two_times_div_two) |
53079 | 410 |
hence range_eq: "n - 1 + 1 = n" |
411 |
using odd_pos[OF False] by auto |
|
412 |
||
413 |
from n_eq `n \<ge> 2 * g_no` have "(n - 1) div 2 \<ge> g_no" |
|
414 |
by auto |
|
415 |
from g[OF this] show ?thesis |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
416 |
unfolding n_eq range_eq . |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
417 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
418 |
} |
53079 | 419 |
thus "\<exists>no. \<forall>n \<ge> no. norm (?Sa n - l) < r" by blast |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
420 |
qed |
53079 | 421 |
hence sums_l: "(\<lambda>i. (-1)^i * a i) sums l" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
422 |
unfolding sums_def . |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
423 |
thus "summable ?S" using summable_def by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
424 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
425 |
have "l = suminf ?S" using sums_unique[OF sums_l] . |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
426 |
|
53079 | 427 |
fix n |
428 |
show "suminf ?S \<le> ?g n" |
|
429 |
unfolding sums_unique[OF sums_l, symmetric] using above_l by auto |
|
430 |
show "?f n \<le> suminf ?S" |
|
431 |
unfolding sums_unique[OF sums_l, symmetric] using below_l by auto |
|
432 |
show "?g ----> suminf ?S" |
|
433 |
using `?g ----> l` `l = suminf ?S` by auto |
|
434 |
show "?f ----> suminf ?S" |
|
435 |
using `?f ----> l` `l = suminf ?S` by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
436 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
437 |
|
53079 | 438 |
theorem summable_Leibniz: |
439 |
fixes a :: "nat \<Rightarrow> real" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
440 |
assumes a_zero: "a ----> 0" and "monoseq a" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
441 |
shows "summable (\<lambda> n. (-1)^n * a n)" (is "?summable") |
53079 | 442 |
and "0 < a 0 \<longrightarrow> |
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
443 |
(\<forall>n. (\<Sum>i. (- 1)^i*a i) \<in> { \<Sum>i<2*n. (- 1)^i * a i .. \<Sum>i<2*n+1. (- 1)^i * a i})" (is "?pos") |
53079 | 444 |
and "a 0 < 0 \<longrightarrow> |
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
445 |
(\<forall>n. (\<Sum>i. (- 1)^i*a i) \<in> { \<Sum>i<2*n+1. (- 1)^i * a i .. \<Sum>i<2*n. (- 1)^i * a i})" (is "?neg") |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
446 |
and "(\<lambda>n. \<Sum>i<2*n. (- 1)^i*a i) ----> (\<Sum>i. (- 1)^i*a i)" (is "?f") |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
447 |
and "(\<lambda>n. \<Sum>i<2*n+1. (- 1)^i*a i) ----> (\<Sum>i. (- 1)^i*a i)" (is "?g") |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
448 |
proof - |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
449 |
have "?summable \<and> ?pos \<and> ?neg \<and> ?f \<and> ?g" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
450 |
proof (cases "(\<forall> n. 0 \<le> a n) \<and> (\<forall>m. \<forall>n\<ge>m. a n \<le> a m)") |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
451 |
case True |
53079 | 452 |
hence ord: "\<And>n m. m \<le> n \<Longrightarrow> a n \<le> a m" and ge0: "\<And> n. 0 \<le> a n" |
453 |
by auto |
|
454 |
{ |
|
455 |
fix n |
|
456 |
have "a (Suc n) \<le> a n" |
|
457 |
using ord[where n="Suc n" and m=n] by auto |
|
458 |
} note mono = this |
|
459 |
note leibniz = summable_Leibniz'[OF `a ----> 0` ge0] |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
460 |
from leibniz[OF mono] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
461 |
show ?thesis using `0 \<le> a 0` by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
462 |
next |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
463 |
let ?a = "\<lambda> n. - a n" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
464 |
case False |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
465 |
with monoseq_le[OF `monoseq a` `a ----> 0`] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
466 |
have "(\<forall> n. a n \<le> 0) \<and> (\<forall>m. \<forall>n\<ge>m. a m \<le> a n)" by auto |
53079 | 467 |
hence ord: "\<And>n m. m \<le> n \<Longrightarrow> ?a n \<le> ?a m" and ge0: "\<And> n. 0 \<le> ?a n" |
468 |
by auto |
|
469 |
{ |
|
470 |
fix n |
|
471 |
have "?a (Suc n) \<le> ?a n" using ord[where n="Suc n" and m=n] |
|
472 |
by auto |
|
473 |
} note monotone = this |
|
474 |
note leibniz = |
|
475 |
summable_Leibniz'[OF _ ge0, of "\<lambda>x. x", |
|
476 |
OF tendsto_minus[OF `a ----> 0`, unfolded minus_zero] monotone] |
|
477 |
have "summable (\<lambda> n. (-1)^n * ?a n)" |
|
478 |
using leibniz(1) by auto |
|
479 |
then obtain l where "(\<lambda> n. (-1)^n * ?a n) sums l" |
|
480 |
unfolding summable_def by auto |
|
481 |
from this[THEN sums_minus] have "(\<lambda> n. (-1)^n * a n) sums -l" |
|
482 |
by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
483 |
hence ?summable unfolding summable_def by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
484 |
moreover |
53079 | 485 |
have "\<And>a b :: real. \<bar>- a - - b\<bar> = \<bar>a - b\<bar>" |
486 |
unfolding minus_diff_minus by auto |
|
41970 | 487 |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
488 |
from suminf_minus[OF leibniz(1), unfolded mult_minus_right minus_minus] |
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
489 |
have move_minus: "(\<Sum>n. - ((- 1) ^ n * a n)) = - (\<Sum>n. (- 1) ^ n * a n)" |
53079 | 490 |
by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
491 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
492 |
have ?pos using `0 \<le> ?a 0` by auto |
53079 | 493 |
moreover have ?neg |
494 |
using leibniz(2,4) |
|
495 |
unfolding mult_minus_right setsum_negf move_minus neg_le_iff_le |
|
496 |
by auto |
|
497 |
moreover have ?f and ?g |
|
498 |
using leibniz(3,5)[unfolded mult_minus_right setsum_negf move_minus, THEN tendsto_minus_cancel] |
|
499 |
by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
500 |
ultimately show ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
501 |
qed |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
502 |
then show ?summable and ?pos and ?neg and ?f and ?g |
54573 | 503 |
by safe |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
504 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
505 |
|
29164 | 506 |
subsection {* Term-by-Term Differentiability of Power Series *} |
23043 | 507 |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
508 |
definition diffs :: "(nat \<Rightarrow> 'a::ring_1) \<Rightarrow> nat \<Rightarrow> 'a" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
509 |
where "diffs c = (\<lambda>n. of_nat (Suc n) * c (Suc n))" |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
510 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
511 |
text{*Lemma about distributing negation over it*} |
53079 | 512 |
lemma diffs_minus: "diffs (\<lambda>n. - c n) = (\<lambda>n. - diffs c n)" |
513 |
by (simp add: diffs_def) |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
514 |
|
29163 | 515 |
lemma sums_Suc_imp: |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
516 |
"(f::nat \<Rightarrow> 'a::real_normed_vector) 0 = 0 \<Longrightarrow> (\<lambda>n. f (Suc n)) sums s \<Longrightarrow> (\<lambda>n. f n) sums s" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
517 |
using sums_Suc_iff[of f] by simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
518 |
|
15229 | 519 |
lemma diffs_equiv: |
41970 | 520 |
fixes x :: "'a::{real_normed_vector, ring_1}" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
521 |
shows "summable (\<lambda>n. diffs c n * x^n) \<Longrightarrow> |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
522 |
(\<lambda>n. of_nat n * c n * x^(n - Suc 0)) sums (\<Sum>n. diffs c n * x^n)" |
53079 | 523 |
unfolding diffs_def |
54573 | 524 |
by (simp add: summable_sums sums_Suc_imp) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
525 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
526 |
lemma lemma_termdiff1: |
31017 | 527 |
fixes z :: "'a :: {monoid_mult,comm_ring}" shows |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
528 |
"(\<Sum>p<m. (((z + h) ^ (m - p)) * (z ^ p)) - (z ^ m)) = |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
529 |
(\<Sum>p<m. (z ^ p) * (((z + h) ^ (m - p)) - (z ^ (m - p))))" |
53079 | 530 |
by (auto simp add: algebra_simps power_add [symmetric]) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
531 |
|
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
532 |
lemma sumr_diff_mult_const2: |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
533 |
"setsum f {..<n} - of_nat n * (r::'a::ring_1) = (\<Sum>i<n. f i - r)" |
53079 | 534 |
by (simp add: setsum_subtractf) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
535 |
|
15229 | 536 |
lemma lemma_termdiff2: |
31017 | 537 |
fixes h :: "'a :: {field}" |
53079 | 538 |
assumes h: "h \<noteq> 0" |
539 |
shows |
|
540 |
"((z + h) ^ n - z ^ n) / h - of_nat n * z ^ (n - Suc 0) = |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
541 |
h * (\<Sum>p< n - Suc 0. \<Sum>q< n - Suc 0 - p. |
53079 | 542 |
(z + h) ^ q * z ^ (n - 2 - q))" (is "?lhs = ?rhs") |
543 |
apply (subgoal_tac "h * ?lhs = h * ?rhs", simp add: h) |
|
544 |
apply (simp add: right_diff_distrib diff_divide_distrib h) |
|
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
545 |
apply (simp add: mult.assoc [symmetric]) |
53079 | 546 |
apply (cases "n", simp) |
547 |
apply (simp add: lemma_realpow_diff_sumr2 h |
|
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
548 |
right_diff_distrib [symmetric] mult.assoc |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
549 |
del: power_Suc setsum_lessThan_Suc of_nat_Suc) |
53079 | 550 |
apply (subst lemma_realpow_rev_sumr) |
551 |
apply (subst sumr_diff_mult_const2) |
|
552 |
apply simp |
|
553 |
apply (simp only: lemma_termdiff1 setsum_right_distrib) |
|
57418 | 554 |
apply (rule setsum.cong [OF refl]) |
54230
b1d955791529
more simplification rules on unary and binary minus
haftmann
parents:
53602
diff
changeset
|
555 |
apply (simp add: less_iff_Suc_add) |
53079 | 556 |
apply (clarify) |
57514
bdc2c6b40bf2
prefer ac_simps collections over separate name bindings for add and mult
haftmann
parents:
57512
diff
changeset
|
557 |
apply (simp add: setsum_right_distrib lemma_realpow_diff_sumr2 ac_simps |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
558 |
del: setsum_lessThan_Suc power_Suc) |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
559 |
apply (subst mult.assoc [symmetric], subst power_add [symmetric]) |
57514
bdc2c6b40bf2
prefer ac_simps collections over separate name bindings for add and mult
haftmann
parents:
57512
diff
changeset
|
560 |
apply (simp add: ac_simps) |
53079 | 561 |
done |
20860 | 562 |
|
563 |
lemma real_setsum_nat_ivl_bounded2: |
|
35028
108662d50512
more consistent naming of type classes involving orderings (and lattices) -- c.f. NEWS
haftmann
parents:
34974
diff
changeset
|
564 |
fixes K :: "'a::linordered_semidom" |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
565 |
assumes f: "\<And>p::nat. p < n \<Longrightarrow> f p \<le> K" |
53079 | 566 |
and K: "0 \<le> K" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
567 |
shows "setsum f {..<n-k} \<le> of_nat n * K" |
53079 | 568 |
apply (rule order_trans [OF setsum_mono]) |
569 |
apply (rule f, simp) |
|
570 |
apply (simp add: mult_right_mono K) |
|
571 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
572 |
|
15229 | 573 |
lemma lemma_termdiff3: |
31017 | 574 |
fixes h z :: "'a::{real_normed_field}" |
20860 | 575 |
assumes 1: "h \<noteq> 0" |
53079 | 576 |
and 2: "norm z \<le> K" |
577 |
and 3: "norm (z + h) \<le> K" |
|
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
578 |
shows "norm (((z + h) ^ n - z ^ n) / h - of_nat n * z ^ (n - Suc 0)) |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
579 |
\<le> of_nat n * of_nat (n - Suc 0) * K ^ (n - 2) * norm h" |
20860 | 580 |
proof - |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
581 |
have "norm (((z + h) ^ n - z ^ n) / h - of_nat n * z ^ (n - Suc 0)) = |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
582 |
norm (\<Sum>p<n - Suc 0. \<Sum>q<n - Suc 0 - p. |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
583 |
(z + h) ^ q * z ^ (n - 2 - q)) * norm h" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
584 |
by (metis (lifting, no_types) lemma_termdiff2 [OF 1] mult.commute norm_mult) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
585 |
also have "\<dots> \<le> of_nat n * (of_nat (n - Suc 0) * K ^ (n - 2)) * norm h" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
586 |
proof (rule mult_right_mono [OF _ norm_ge_zero]) |
53079 | 587 |
from norm_ge_zero 2 have K: "0 \<le> K" |
588 |
by (rule order_trans) |
|
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
589 |
have le_Kn: "\<And>i j n. i + j = n \<Longrightarrow> norm ((z + h) ^ i * z ^ j) \<le> K ^ n" |
20860 | 590 |
apply (erule subst) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
591 |
apply (simp only: norm_mult norm_power power_add) |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
592 |
apply (intro mult_mono power_mono 2 3 norm_ge_zero zero_le_power K) |
20860 | 593 |
done |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
594 |
show "norm (\<Sum>p<n - Suc 0. \<Sum>q<n - Suc 0 - p. (z + h) ^ q * z ^ (n - 2 - q)) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
595 |
\<le> of_nat n * (of_nat (n - Suc 0) * K ^ (n - 2))" |
20860 | 596 |
apply (intro |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
597 |
order_trans [OF norm_setsum] |
20860 | 598 |
real_setsum_nat_ivl_bounded2 |
599 |
mult_nonneg_nonneg |
|
47489 | 600 |
of_nat_0_le_iff |
20860 | 601 |
zero_le_power K) |
602 |
apply (rule le_Kn, simp) |
|
603 |
done |
|
604 |
qed |
|
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
605 |
also have "\<dots> = of_nat n * of_nat (n - Suc 0) * K ^ (n - 2) * norm h" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
606 |
by (simp only: mult.assoc) |
20860 | 607 |
finally show ?thesis . |
608 |
qed |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
609 |
|
20860 | 610 |
lemma lemma_termdiff4: |
56167 | 611 |
fixes f :: "'a::real_normed_vector \<Rightarrow> 'b::real_normed_vector" |
20860 | 612 |
assumes k: "0 < (k::real)" |
53079 | 613 |
and le: "\<And>h. \<lbrakk>h \<noteq> 0; norm h < k\<rbrakk> \<Longrightarrow> norm (f h) \<le> K * norm h" |
20860 | 614 |
shows "f -- 0 --> 0" |
56167 | 615 |
proof (rule tendsto_norm_zero_cancel) |
616 |
show "(\<lambda>h. norm (f h)) -- 0 --> 0" |
|
617 |
proof (rule real_tendsto_sandwich) |
|
618 |
show "eventually (\<lambda>h. 0 \<le> norm (f h)) (at 0)" |
|
20860 | 619 |
by simp |
56167 | 620 |
show "eventually (\<lambda>h. norm (f h) \<le> K * norm h) (at 0)" |
621 |
using k by (auto simp add: eventually_at dist_norm le) |
|
622 |
show "(\<lambda>h. 0) -- (0::'a) --> (0::real)" |
|
623 |
by (rule tendsto_const) |
|
624 |
have "(\<lambda>h. K * norm h) -- (0::'a) --> K * norm (0::'a)" |
|
625 |
by (intro tendsto_intros) |
|
626 |
then show "(\<lambda>h. K * norm h) -- (0::'a) --> 0" |
|
627 |
by simp |
|
20860 | 628 |
qed |
629 |
qed |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
630 |
|
15229 | 631 |
lemma lemma_termdiff5: |
56167 | 632 |
fixes g :: "'a::real_normed_vector \<Rightarrow> nat \<Rightarrow> 'b::banach" |
20860 | 633 |
assumes k: "0 < (k::real)" |
634 |
assumes f: "summable f" |
|
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
635 |
assumes le: "\<And>h n. \<lbrakk>h \<noteq> 0; norm h < k\<rbrakk> \<Longrightarrow> norm (g h n) \<le> f n * norm h" |
20860 | 636 |
shows "(\<lambda>h. suminf (g h)) -- 0 --> 0" |
637 |
proof (rule lemma_termdiff4 [OF k]) |
|
53079 | 638 |
fix h::'a |
639 |
assume "h \<noteq> 0" and "norm h < k" |
|
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
640 |
hence A: "\<forall>n. norm (g h n) \<le> f n * norm h" |
20860 | 641 |
by (simp add: le) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
642 |
hence "\<exists>N. \<forall>n\<ge>N. norm (norm (g h n)) \<le> f n * norm h" |
20860 | 643 |
by simp |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
644 |
moreover from f have B: "summable (\<lambda>n. f n * norm h)" |
20860 | 645 |
by (rule summable_mult2) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
646 |
ultimately have C: "summable (\<lambda>n. norm (g h n))" |
20860 | 647 |
by (rule summable_comparison_test) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
648 |
hence "norm (suminf (g h)) \<le> (\<Sum>n. norm (g h n))" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
649 |
by (rule summable_norm) |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
650 |
also from A C B have "(\<Sum>n. norm (g h n)) \<le> (\<Sum>n. f n * norm h)" |
56213 | 651 |
by (rule suminf_le) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
652 |
also from f have "(\<Sum>n. f n * norm h) = suminf f * norm h" |
20860 | 653 |
by (rule suminf_mult2 [symmetric]) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
654 |
finally show "norm (suminf (g h)) \<le> suminf f * norm h" . |
20860 | 655 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
656 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
657 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
658 |
text{* FIXME: Long proofs*} |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
659 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
660 |
lemma termdiffs_aux: |
31017 | 661 |
fixes x :: "'a::{real_normed_field,banach}" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
662 |
assumes 1: "summable (\<lambda>n. diffs (diffs c) n * K ^ n)" |
53079 | 663 |
and 2: "norm x < norm K" |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
664 |
shows "(\<lambda>h. \<Sum>n. c n * (((x + h) ^ n - x^n) / h |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
665 |
- of_nat n * x ^ (n - Suc 0))) -- 0 --> 0" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
666 |
proof - |
20860 | 667 |
from dense [OF 2] |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
668 |
obtain r where r1: "norm x < r" and r2: "r < norm K" by fast |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
669 |
from norm_ge_zero r1 have r: "0 < r" |
20860 | 670 |
by (rule order_le_less_trans) |
671 |
hence r_neq_0: "r \<noteq> 0" by simp |
|
672 |
show ?thesis |
|
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
673 |
proof (rule lemma_termdiff5) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
674 |
show "0 < r - norm x" using r1 by simp |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
675 |
from r r2 have "norm (of_real r::'a) < norm K" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
676 |
by simp |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
677 |
with 1 have "summable (\<lambda>n. norm (diffs (diffs c) n * (of_real r ^ n)))" |
20860 | 678 |
by (rule powser_insidea) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
679 |
hence "summable (\<lambda>n. diffs (diffs (\<lambda>n. norm (c n))) n * r ^ n)" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
680 |
using r |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
681 |
by (simp add: diffs_def norm_mult norm_power del: of_nat_Suc) |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
682 |
hence "summable (\<lambda>n. of_nat n * diffs (\<lambda>n. norm (c n)) n * r ^ (n - Suc 0))" |
20860 | 683 |
by (rule diffs_equiv [THEN sums_summable]) |
53079 | 684 |
also have "(\<lambda>n. of_nat n * diffs (\<lambda>n. norm (c n)) n * r ^ (n - Suc 0)) = |
685 |
(\<lambda>n. diffs (\<lambda>m. of_nat (m - Suc 0) * norm (c m) * inverse r) n * (r ^ n))" |
|
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
686 |
apply (rule ext) |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
687 |
apply (simp add: diffs_def) |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
688 |
apply (case_tac n, simp_all add: r_neq_0) |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
689 |
done |
41970 | 690 |
finally have "summable |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
691 |
(\<lambda>n. of_nat n * (of_nat (n - Suc 0) * norm (c n) * inverse r) * r ^ (n - Suc 0))" |
20860 | 692 |
by (rule diffs_equiv [THEN sums_summable]) |
693 |
also have |
|
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
694 |
"(\<lambda>n. of_nat n * (of_nat (n - Suc 0) * norm (c n) * inverse r) * |
20860 | 695 |
r ^ (n - Suc 0)) = |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
696 |
(\<lambda>n. norm (c n) * of_nat n * of_nat (n - Suc 0) * r ^ (n - 2))" |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
697 |
apply (rule ext) |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
698 |
apply (case_tac "n", simp) |
55417
01fbfb60c33e
adapted to 'xxx_{case,rec}' renaming, to new theorem names, and to new variable names in theorems
blanchet
parents:
54576
diff
changeset
|
699 |
apply (rename_tac nat) |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
700 |
apply (case_tac "nat", simp) |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
701 |
apply (simp add: r_neq_0) |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
702 |
done |
53079 | 703 |
finally |
704 |
show "summable (\<lambda>n. norm (c n) * of_nat n * of_nat (n - Suc 0) * r ^ (n - 2))" . |
|
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
705 |
next |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
706 |
fix h::'a and n::nat |
20860 | 707 |
assume h: "h \<noteq> 0" |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
708 |
assume "norm h < r - norm x" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
709 |
hence "norm x + norm h < r" by simp |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
710 |
with norm_triangle_ineq have xh: "norm (x + h) < r" |
20860 | 711 |
by (rule order_le_less_trans) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
712 |
show "norm (c n * (((x + h) ^ n - x^n) / h - of_nat n * x ^ (n - Suc 0))) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
713 |
\<le> norm (c n) * of_nat n * of_nat (n - Suc 0) * r ^ (n - 2) * norm h" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
714 |
apply (simp only: norm_mult mult.assoc) |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
715 |
apply (rule mult_left_mono [OF _ norm_ge_zero]) |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
716 |
apply (simp add: mult.assoc [symmetric]) |
54575 | 717 |
apply (metis h lemma_termdiff3 less_eq_real_def r1 xh) |
20860 | 718 |
done |
20849
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
719 |
qed |
389cd9c8cfe1
rewrite proofs of powser_insidea and termdiffs_aux
huffman
parents:
20692
diff
changeset
|
720 |
qed |
20217
25b068a99d2b
linear arithmetic splits certain operators (e.g. min, max, abs)
webertj
parents:
19765
diff
changeset
|
721 |
|
20860 | 722 |
lemma termdiffs: |
31017 | 723 |
fixes K x :: "'a::{real_normed_field,banach}" |
20860 | 724 |
assumes 1: "summable (\<lambda>n. c n * K ^ n)" |
54575 | 725 |
and 2: "summable (\<lambda>n. (diffs c) n * K ^ n)" |
726 |
and 3: "summable (\<lambda>n. (diffs (diffs c)) n * K ^ n)" |
|
727 |
and 4: "norm x < norm K" |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
728 |
shows "DERIV (\<lambda>x. \<Sum>n. c n * x^n) x :> (\<Sum>n. (diffs c) n * x^n)" |
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
729 |
unfolding DERIV_def |
29163 | 730 |
proof (rule LIM_zero_cancel) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
731 |
show "(\<lambda>h. (suminf (\<lambda>n. c n * (x + h) ^ n) - suminf (\<lambda>n. c n * x^n)) / h |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
732 |
- suminf (\<lambda>n. diffs c n * x^n)) -- 0 --> 0" |
20860 | 733 |
proof (rule LIM_equal2) |
29163 | 734 |
show "0 < norm K - norm x" using 4 by (simp add: less_diff_eq) |
20860 | 735 |
next |
23082
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
736 |
fix h :: 'a |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
737 |
assume "norm (h - 0) < norm K - norm x" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
738 |
hence "norm x + norm h < norm K" by simp |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
739 |
hence 5: "norm (x + h) < norm K" |
ffef77eed382
generalize powerseries and termdiffs lemmas using axclasses
huffman
parents:
23069
diff
changeset
|
740 |
by (rule norm_triangle_ineq [THEN order_le_less_trans]) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
741 |
have "summable (\<lambda>n. c n * x^n)" |
56167 | 742 |
and "summable (\<lambda>n. c n * (x + h) ^ n)" |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
743 |
and "summable (\<lambda>n. diffs c n * x^n)" |
56167 | 744 |
using 1 2 4 5 by (auto elim: powser_inside) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
745 |
then have "((\<Sum>n. c n * (x + h) ^ n) - (\<Sum>n. c n * x^n)) / h - (\<Sum>n. diffs c n * x^n) = |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
746 |
(\<Sum>n. (c n * (x + h) ^ n - c n * x^n) / h - of_nat n * c n * x ^ (n - Suc 0))" |
56167 | 747 |
by (intro sums_unique sums_diff sums_divide diffs_equiv summable_sums) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
748 |
then show "((\<Sum>n. c n * (x + h) ^ n) - (\<Sum>n. c n * x^n)) / h - (\<Sum>n. diffs c n * x^n) = |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
749 |
(\<Sum>n. c n * (((x + h) ^ n - x^n) / h - of_nat n * x ^ (n - Suc 0)))" |
54575 | 750 |
by (simp add: algebra_simps) |
20860 | 751 |
next |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
752 |
show "(\<lambda>h. \<Sum>n. c n * (((x + h) ^ n - x^n) / h - of_nat n * x ^ (n - Suc 0))) -- 0 --> 0" |
53079 | 753 |
by (rule termdiffs_aux [OF 3 4]) |
20860 | 754 |
qed |
755 |
qed |
|
756 |
||
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
757 |
subsection {* The Derivative of a Power Series Has the Same Radius of Convergence *} |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
758 |
|
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
759 |
lemma termdiff_converges: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
760 |
fixes x :: "'a::{real_normed_field,banach}" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
761 |
assumes K: "norm x < K" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
762 |
and sm: "\<And>x. norm x < K \<Longrightarrow> summable(\<lambda>n. c n * x ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
763 |
shows "summable (\<lambda>n. diffs c n * x ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
764 |
proof (cases "x = 0") |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
765 |
case True then show ?thesis |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
766 |
using powser_sums_zero sums_summable by auto |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
767 |
next |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
768 |
case False |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
769 |
then have "K>0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
770 |
using K less_trans zero_less_norm_iff by blast |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
771 |
then obtain r::real where r: "norm x < norm r" "norm r < K" "r>0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
772 |
using K False |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
773 |
by (auto simp: abs_less_iff add_pos_pos intro: that [of "(norm x + K) / 2"]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
774 |
have "(\<lambda>n. of_nat n * (x / of_real r) ^ n) ----> 0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
775 |
using r by (simp add: norm_divide powser_times_n_limit_0 [of "x / of_real r"]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
776 |
then obtain N where N: "\<And>n. n\<ge>N \<Longrightarrow> real_of_nat n * norm x ^ n < r ^ n" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
777 |
using r unfolding LIMSEQ_iff |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
778 |
apply (drule_tac x=1 in spec) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
779 |
apply (auto simp: norm_divide norm_mult norm_power field_simps) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
780 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
781 |
have "summable (\<lambda>n. (of_nat n * c n) * x ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
782 |
apply (rule summable_comparison_test' [of "\<lambda>n. norm(c n * (of_real r) ^ n)" N]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
783 |
apply (rule powser_insidea [OF sm [of "of_real ((r+K)/2)"]]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
784 |
using N r norm_of_real [of "r+K", where 'a = 'a] |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
785 |
apply (auto simp add: norm_divide norm_mult norm_power ) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
786 |
using less_eq_real_def by fastforce |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
787 |
then have "summable (\<lambda>n. (of_nat (Suc n) * c(Suc n)) * x ^ Suc n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
788 |
using summable_iff_shift [of "\<lambda>n. of_nat n * c n * x ^ n" 1] |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
789 |
by simp |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
790 |
then have "summable (\<lambda>n. (of_nat (Suc n) * c(Suc n)) * x ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
791 |
using False summable_mult2 [of "\<lambda>n. (of_nat (Suc n) * c(Suc n) * x ^ n) * x" "inverse x"] |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
792 |
by (simp add: mult.assoc) (auto simp: power_Suc mult_ac) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
793 |
then show ?thesis |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
794 |
by (simp add: diffs_def) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
795 |
qed |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
796 |
|
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
797 |
lemma termdiff_converges_all: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
798 |
fixes x :: "'a::{real_normed_field,banach}" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
799 |
assumes "\<And>x. summable (\<lambda>n. c n * x^n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
800 |
shows "summable (\<lambda>n. diffs c n * x^n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
801 |
apply (rule termdiff_converges [where K = "1 + norm x"]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
802 |
using assms |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
803 |
apply (auto simp: ) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
804 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
805 |
|
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
806 |
lemma termdiffs_strong: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
807 |
fixes K x :: "'a::{real_normed_field,banach}" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
808 |
assumes sm: "summable (\<lambda>n. c n * K ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
809 |
and K: "norm x < norm K" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
810 |
shows "DERIV (\<lambda>x. \<Sum>n. c n * x^n) x :> (\<Sum>n. diffs c n * x^n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
811 |
proof - |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
812 |
have [simp]: "norm ((of_real (norm K) + of_real (norm x)) / 2 :: 'a) < norm K" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
813 |
using K |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
814 |
apply (auto simp: norm_divide) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
815 |
apply (rule le_less_trans [of _ "of_real (norm K) + of_real (norm x)"]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
816 |
apply (auto simp: mult_2_right norm_triangle_mono) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
817 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
818 |
have "summable (\<lambda>n. c n * (of_real (norm x + norm K) / 2) ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
819 |
apply (rule summable_norm_cancel [OF powser_insidea [OF sm]]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
820 |
using K |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
821 |
apply (auto simp: algebra_simps) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
822 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
823 |
moreover have "\<And>x. norm x < norm K \<Longrightarrow> summable (\<lambda>n. diffs c n * x ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
824 |
by (blast intro: sm termdiff_converges powser_inside) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
825 |
moreover have "\<And>x. norm x < norm K \<Longrightarrow> summable (\<lambda>n. diffs(diffs c) n * x ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
826 |
by (blast intro: sm termdiff_converges powser_inside) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
827 |
ultimately show ?thesis |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
828 |
apply (rule termdiffs [where K = "of_real (norm x + norm K) / 2"]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
829 |
apply (auto simp: algebra_simps) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
830 |
using K |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
831 |
apply (simp add: norm_divide) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
832 |
apply (rule less_le_trans [of _ "of_real (norm K) + of_real (norm x)"]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
833 |
apply (simp_all add: of_real_add [symmetric] del: of_real_add) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
834 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
835 |
qed |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
836 |
|
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
837 |
lemma powser_limit_0: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
838 |
fixes a :: "nat \<Rightarrow> 'a::{real_normed_field,banach}" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
839 |
assumes s: "0 < s" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
840 |
and sm: "\<And>x. norm x < s \<Longrightarrow> (\<lambda>n. a n * x ^ n) sums (f x)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
841 |
shows "(f ---> a 0) (at 0)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
842 |
proof - |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
843 |
have "summable (\<lambda>n. a n * (of_real s / 2) ^ n)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
844 |
apply (rule sums_summable [where l = "f (of_real s / 2)", OF sm]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
845 |
using s |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
846 |
apply (auto simp: norm_divide) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
847 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
848 |
then have "((\<lambda>x. \<Sum>n. a n * x ^ n) has_field_derivative (\<Sum>n. diffs a n * 0 ^ n)) (at 0)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
849 |
apply (rule termdiffs_strong) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
850 |
using s |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
851 |
apply (auto simp: norm_divide) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
852 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
853 |
then have "isCont (\<lambda>x. \<Sum>n. a n * x ^ n) 0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
854 |
by (blast intro: DERIV_continuous) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
855 |
then have "((\<lambda>x. \<Sum>n. a n * x ^ n) ---> a 0) (at 0)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
856 |
by (simp add: continuous_within powser_zero) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
857 |
then show ?thesis |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
858 |
apply (rule Lim_transform) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
859 |
apply (auto simp add: LIM_eq) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
860 |
apply (rule_tac x="s" in exI) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
861 |
using s |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
862 |
apply (auto simp: sm [THEN sums_unique]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
863 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
864 |
qed |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
865 |
|
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
866 |
lemma powser_limit_0_strong: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
867 |
fixes a :: "nat \<Rightarrow> 'a::{real_normed_field,banach}" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
868 |
assumes s: "0 < s" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
869 |
and sm: "\<And>x. x \<noteq> 0 \<Longrightarrow> norm x < s \<Longrightarrow> (\<lambda>n. a n * x ^ n) sums (f x)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
870 |
shows "(f ---> a 0) (at 0)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
871 |
proof - |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
872 |
have *: "((\<lambda>x. if x = 0 then a 0 else f x) ---> a 0) (at 0)" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
873 |
apply (rule powser_limit_0 [OF s]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
874 |
apply (case_tac "x=0") |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
875 |
apply (auto simp add: powser_sums_zero sm) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
876 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
877 |
show ?thesis |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
878 |
apply (subst LIM_equal [where g = "(\<lambda>x. if x = 0 then a 0 else f x)"]) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
879 |
apply (simp_all add: *) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
880 |
done |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
881 |
qed |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
882 |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
883 |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
884 |
subsection {* Derivability of power series *} |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
885 |
|
53079 | 886 |
lemma DERIV_series': |
887 |
fixes f :: "real \<Rightarrow> nat \<Rightarrow> real" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
888 |
assumes DERIV_f: "\<And> n. DERIV (\<lambda> x. f x n) x0 :> (f' x0 n)" |
53079 | 889 |
and allf_summable: "\<And> x. x \<in> {a <..< b} \<Longrightarrow> summable (f x)" and x0_in_I: "x0 \<in> {a <..< b}" |
890 |
and "summable (f' x0)" |
|
891 |
and "summable L" |
|
892 |
and L_def: "\<And>n x y. \<lbrakk> x \<in> { a <..< b} ; y \<in> { a <..< b} \<rbrakk> \<Longrightarrow> \<bar>f x n - f y n\<bar> \<le> L n * \<bar>x - y\<bar>" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
893 |
shows "DERIV (\<lambda> x. suminf (f x)) x0 :> (suminf (f' x0))" |
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
894 |
unfolding DERIV_def |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
895 |
proof (rule LIM_I) |
53079 | 896 |
fix r :: real |
897 |
assume "0 < r" hence "0 < r/3" by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
898 |
|
41970 | 899 |
obtain N_L where N_L: "\<And> n. N_L \<le> n \<Longrightarrow> \<bar> \<Sum> i. L (i + n) \<bar> < r/3" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
900 |
using suminf_exist_split[OF `0 < r/3` `summable L`] by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
901 |
|
41970 | 902 |
obtain N_f' where N_f': "\<And> n. N_f' \<le> n \<Longrightarrow> \<bar> \<Sum> i. f' x0 (i + n) \<bar> < r/3" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
903 |
using suminf_exist_split[OF `0 < r/3` `summable (f' x0)`] by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
904 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
905 |
let ?N = "Suc (max N_L N_f')" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
906 |
have "\<bar> \<Sum> i. f' x0 (i + ?N) \<bar> < r/3" (is "?f'_part < r/3") and |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
907 |
L_estimate: "\<bar> \<Sum> i. L (i + ?N) \<bar> < r/3" using N_L[of "?N"] and N_f' [of "?N"] by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
908 |
|
53079 | 909 |
let ?diff = "\<lambda>i x. (f (x0 + x) i - f x0 i) / x" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
910 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
911 |
let ?r = "r / (3 * real ?N)" |
56541 | 912 |
from `0 < r` have "0 < ?r" by simp |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
913 |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
914 |
let ?s = "\<lambda>n. SOME s. 0 < s \<and> (\<forall> x. x \<noteq> 0 \<and> \<bar> x \<bar> < s \<longrightarrow> \<bar> ?diff n x - f' x0 n \<bar> < ?r)" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
915 |
def S' \<equiv> "Min (?s ` {..< ?N })" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
916 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
917 |
have "0 < S'" unfolding S'_def |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
918 |
proof (rule iffD2[OF Min_gr_iff]) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
919 |
show "\<forall>x \<in> (?s ` {..< ?N }). 0 < x" |
53079 | 920 |
proof |
921 |
fix x |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
922 |
assume "x \<in> ?s ` {..<?N}" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
923 |
then obtain n where "x = ?s n" and "n \<in> {..<?N}" |
53079 | 924 |
using image_iff[THEN iffD1] by blast |
41970 | 925 |
from DERIV_D[OF DERIV_f[where n=n], THEN LIM_D, OF `0 < ?r`, unfolded real_norm_def] |
53079 | 926 |
obtain s where s_bound: "0 < s \<and> (\<forall>x. x \<noteq> 0 \<and> \<bar>x\<bar> < s \<longrightarrow> \<bar>?diff n x - f' x0 n\<bar> < ?r)" |
927 |
by auto |
|
928 |
have "0 < ?s n" by (rule someI2[where a=s]) (auto simp add: s_bound) |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
929 |
thus "0 < x" unfolding `x = ?s n` . |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
930 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
931 |
qed auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
932 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
933 |
def S \<equiv> "min (min (x0 - a) (b - x0)) S'" |
53079 | 934 |
hence "0 < S" and S_a: "S \<le> x0 - a" and S_b: "S \<le> b - x0" |
935 |
and "S \<le> S'" using x0_in_I and `0 < S'` |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
936 |
by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
937 |
|
53079 | 938 |
{ |
939 |
fix x |
|
940 |
assume "x \<noteq> 0" and "\<bar> x \<bar> < S" |
|
941 |
hence x_in_I: "x0 + x \<in> { a <..< b }" |
|
942 |
using S_a S_b by auto |
|
41970 | 943 |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
944 |
note diff_smbl = summable_diff[OF allf_summable[OF x_in_I] allf_summable[OF x0_in_I]] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
945 |
note div_smbl = summable_divide[OF diff_smbl] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
946 |
note all_smbl = summable_diff[OF div_smbl `summable (f' x0)`] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
947 |
note ign = summable_ignore_initial_segment[where k="?N"] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
948 |
note diff_shft_smbl = summable_diff[OF ign[OF allf_summable[OF x_in_I]] ign[OF allf_summable[OF x0_in_I]]] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
949 |
note div_shft_smbl = summable_divide[OF diff_shft_smbl] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
950 |
note all_shft_smbl = summable_diff[OF div_smbl ign[OF `summable (f' x0)`]] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
951 |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
952 |
{ fix n |
41970 | 953 |
have "\<bar> ?diff (n + ?N) x \<bar> \<le> L (n + ?N) * \<bar> (x0 + x) - x0 \<bar> / \<bar> x \<bar>" |
53079 | 954 |
using divide_right_mono[OF L_def[OF x_in_I x0_in_I] abs_ge_zero] |
955 |
unfolding abs_divide . |
|
956 |
hence "\<bar> (\<bar>?diff (n + ?N) x \<bar>) \<bar> \<le> L (n + ?N)" |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
957 |
using `x \<noteq> 0` by auto } |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
958 |
note 1 = this and 2 = summable_rabs_comparison_test[OF _ ign[OF `summable L`]] |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
959 |
then have "\<bar> \<Sum> i. ?diff (i + ?N) x \<bar> \<le> (\<Sum> i. L (i + ?N))" |
56213 | 960 |
by (metis (lifting) abs_idempotent order_trans[OF summable_rabs[OF 2] suminf_le[OF _ 2 ign[OF `summable L`]]]) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
961 |
then have "\<bar> \<Sum> i. ?diff (i + ?N) x \<bar> \<le> r / 3" (is "?L_part \<le> r/3") |
53079 | 962 |
using L_estimate by auto |
963 |
||
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
964 |
have "\<bar>\<Sum>n<?N. ?diff n x - f' x0 n \<bar> \<le> (\<Sum>n<?N. \<bar>?diff n x - f' x0 n \<bar>)" .. |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
965 |
also have "\<dots> < (\<Sum>n<?N. ?r)" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
966 |
proof (rule setsum_strict_mono) |
53079 | 967 |
fix n |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
968 |
assume "n \<in> {..< ?N}" |
53079 | 969 |
have "\<bar>x\<bar> < S" using `\<bar>x\<bar> < S` . |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
970 |
also have "S \<le> S'" using `S \<le> S'` . |
41970 | 971 |
also have "S' \<le> ?s n" unfolding S'_def |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
972 |
proof (rule Min_le_iff[THEN iffD2]) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
973 |
have "?s n \<in> (?s ` {..<?N}) \<and> ?s n \<le> ?s n" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
974 |
using `n \<in> {..< ?N}` by auto |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
975 |
thus "\<exists> a \<in> (?s ` {..<?N}). a \<le> ?s n" by blast |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
976 |
qed auto |
53079 | 977 |
finally have "\<bar>x\<bar> < ?s n" . |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
978 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
979 |
from DERIV_D[OF DERIV_f[where n=n], THEN LIM_D, OF `0 < ?r`, unfolded real_norm_def diff_0_right, unfolded some_eq_ex[symmetric], THEN conjunct2] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
980 |
have "\<forall>x. x \<noteq> 0 \<and> \<bar>x\<bar> < ?s n \<longrightarrow> \<bar>?diff n x - f' x0 n\<bar> < ?r" . |
53079 | 981 |
with `x \<noteq> 0` and `\<bar>x\<bar> < ?s n` show "\<bar>?diff n x - f' x0 n\<bar> < ?r" |
982 |
by blast |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
983 |
qed auto |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
984 |
also have "\<dots> = of_nat (card {..<?N}) * ?r" |
53079 | 985 |
by (rule setsum_constant) |
986 |
also have "\<dots> = real ?N * ?r" |
|
987 |
unfolding real_eq_of_nat by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
988 |
also have "\<dots> = r/3" by auto |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
989 |
finally have "\<bar>\<Sum>n<?N. ?diff n x - f' x0 n \<bar> < r / 3" (is "?diff_part < r / 3") . |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
990 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
991 |
from suminf_diff[OF allf_summable[OF x_in_I] allf_summable[OF x0_in_I]] |
53079 | 992 |
have "\<bar>(suminf (f (x0 + x)) - (suminf (f x0))) / x - suminf (f' x0)\<bar> = |
993 |
\<bar>\<Sum>n. ?diff n x - f' x0 n\<bar>" |
|
994 |
unfolding suminf_diff[OF div_smbl `summable (f' x0)`, symmetric] |
|
995 |
using suminf_divide[OF diff_smbl, symmetric] by auto |
|
996 |
also have "\<dots> \<le> ?diff_part + \<bar> (\<Sum>n. ?diff (n + ?N) x) - (\<Sum> n. f' x0 (n + ?N)) \<bar>" |
|
997 |
unfolding suminf_split_initial_segment[OF all_smbl, where k="?N"] |
|
998 |
unfolding suminf_diff[OF div_shft_smbl ign[OF `summable (f' x0)`]] |
|
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
999 |
apply (subst (5) add.commute) |
53079 | 1000 |
by (rule abs_triangle_ineq) |
1001 |
also have "\<dots> \<le> ?diff_part + ?L_part + ?f'_part" |
|
1002 |
using abs_triangle_ineq4 by auto |
|
41970 | 1003 |
also have "\<dots> < r /3 + r/3 + r/3" |
36842 | 1004 |
using `?diff_part < r/3` `?L_part \<le> r/3` and `?f'_part < r/3` |
1005 |
by (rule add_strict_mono [OF add_less_le_mono]) |
|
53079 | 1006 |
finally have "\<bar>(suminf (f (x0 + x)) - suminf (f x0)) / x - suminf (f' x0)\<bar> < r" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1007 |
by auto |
53079 | 1008 |
} |
1009 |
thus "\<exists> s > 0. \<forall> x. x \<noteq> 0 \<and> norm (x - 0) < s \<longrightarrow> |
|
1010 |
norm (((\<Sum>n. f (x0 + x) n) - (\<Sum>n. f x0 n)) / x - (\<Sum>n. f' x0 n)) < r" |
|
1011 |
using `0 < S` unfolding real_norm_def diff_0_right by blast |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1012 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1013 |
|
53079 | 1014 |
lemma DERIV_power_series': |
1015 |
fixes f :: "nat \<Rightarrow> real" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1016 |
assumes converges: "\<And> x. x \<in> {-R <..< R} \<Longrightarrow> summable (\<lambda> n. f n * real (Suc n) * x^n)" |
53079 | 1017 |
and x0_in_I: "x0 \<in> {-R <..< R}" and "0 < R" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1018 |
shows "DERIV (\<lambda> x. (\<Sum> n. f n * x^(Suc n))) x0 :> (\<Sum> n. f n * real (Suc n) * x0^n)" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1019 |
(is "DERIV (\<lambda> x. (suminf (?f x))) x0 :> (suminf (?f' x0))") |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1020 |
proof - |
53079 | 1021 |
{ |
1022 |
fix R' |
|
1023 |
assume "0 < R'" and "R' < R" and "-R' < x0" and "x0 < R'" |
|
1024 |
hence "x0 \<in> {-R' <..< R'}" and "R' \<in> {-R <..< R}" and "x0 \<in> {-R <..< R}" |
|
1025 |
by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1026 |
have "DERIV (\<lambda> x. (suminf (?f x))) x0 :> (suminf (?f' x0))" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1027 |
proof (rule DERIV_series') |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1028 |
show "summable (\<lambda> n. \<bar>f n * real (Suc n) * R'^n\<bar>)" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1029 |
proof - |
53079 | 1030 |
have "(R' + R) / 2 < R" and "0 < (R' + R) / 2" |
1031 |
using `0 < R'` `0 < R` `R' < R` by auto |
|
1032 |
hence in_Rball: "(R' + R) / 2 \<in> {-R <..< R}" |
|
1033 |
using `R' < R` by auto |
|
1034 |
have "norm R' < norm ((R' + R) / 2)" |
|
1035 |
using `0 < R'` `0 < R` `R' < R` by auto |
|
1036 |
from powser_insidea[OF converges[OF in_Rball] this] show ?thesis |
|
1037 |
by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1038 |
qed |
53079 | 1039 |
{ |
1040 |
fix n x y |
|
1041 |
assume "x \<in> {-R' <..< R'}" and "y \<in> {-R' <..< R'}" |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1042 |
show "\<bar>?f x n - ?f y n\<bar> \<le> \<bar>f n * real (Suc n) * R'^n\<bar> * \<bar>x-y\<bar>" |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1043 |
proof - |
53079 | 1044 |
have "\<bar>f n * x ^ (Suc n) - f n * y ^ (Suc n)\<bar> = |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1045 |
(\<bar>f n\<bar> * \<bar>x-y\<bar>) * \<bar>\<Sum>p<Suc n. x ^ p * y ^ (n - p)\<bar>" |
53079 | 1046 |
unfolding right_diff_distrib[symmetric] lemma_realpow_diff_sumr2 abs_mult |
1047 |
by auto |
|
41970 | 1048 |
also have "\<dots> \<le> (\<bar>f n\<bar> * \<bar>x-y\<bar>) * (\<bar>real (Suc n)\<bar> * \<bar>R' ^ n\<bar>)" |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1049 |
proof (rule mult_left_mono) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1050 |
have "\<bar>\<Sum>p<Suc n. x ^ p * y ^ (n - p)\<bar> \<le> (\<Sum>p<Suc n. \<bar>x ^ p * y ^ (n - p)\<bar>)" |
53079 | 1051 |
by (rule setsum_abs) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1052 |
also have "\<dots> \<le> (\<Sum>p<Suc n. R' ^ n)" |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1053 |
proof (rule setsum_mono) |
53079 | 1054 |
fix p |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1055 |
assume "p \<in> {..<Suc n}" |
53079 | 1056 |
hence "p \<le> n" by auto |
1057 |
{ |
|
1058 |
fix n |
|
1059 |
fix x :: real |
|
1060 |
assume "x \<in> {-R'<..<R'}" |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1061 |
hence "\<bar>x\<bar> \<le> R'" by auto |
53079 | 1062 |
hence "\<bar>x^n\<bar> \<le> R'^n" |
1063 |
unfolding power_abs by (rule power_mono, auto) |
|
1064 |
} |
|
1065 |
from mult_mono[OF this[OF `x \<in> {-R'<..<R'}`, of p] this[OF `y \<in> {-R'<..<R'}`, of "n-p"]] `0 < R'` |
|
1066 |
have "\<bar>x^p * y^(n-p)\<bar> \<le> R'^p * R'^(n-p)" |
|
1067 |
unfolding abs_mult by auto |
|
1068 |
thus "\<bar>x^p * y^(n-p)\<bar> \<le> R'^n" |
|
1069 |
unfolding power_add[symmetric] using `p \<le> n` by auto |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1070 |
qed |
53079 | 1071 |
also have "\<dots> = real (Suc n) * R' ^ n" |
1072 |
unfolding setsum_constant card_atLeastLessThan real_of_nat_def by auto |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1073 |
finally show "\<bar>\<Sum>p<Suc n. x ^ p * y ^ (n - p)\<bar> \<le> \<bar>real (Suc n)\<bar> * \<bar>R' ^ n\<bar>" |
53079 | 1074 |
unfolding abs_real_of_nat_cancel abs_of_nonneg[OF zero_le_power[OF less_imp_le[OF `0 < R'`]]] . |
1075 |
show "0 \<le> \<bar>f n\<bar> * \<bar>x - y\<bar>" |
|
1076 |
unfolding abs_mult[symmetric] by auto |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1077 |
qed |
53079 | 1078 |
also have "\<dots> = \<bar>f n * real (Suc n) * R' ^ n\<bar> * \<bar>x - y\<bar>" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
1079 |
unfolding abs_mult mult.assoc[symmetric] by algebra |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1080 |
finally show ?thesis . |
53079 | 1081 |
qed |
1082 |
} |
|
1083 |
{ |
|
1084 |
fix n |
|
1085 |
show "DERIV (\<lambda> x. ?f x n) x0 :> (?f' x0 n)" |
|
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
1086 |
by (auto intro!: derivative_eq_intros simp del: power_Suc simp: real_of_nat_def) |
53079 | 1087 |
} |
1088 |
{ |
|
1089 |
fix x |
|
1090 |
assume "x \<in> {-R' <..< R'}" |
|
1091 |
hence "R' \<in> {-R <..< R}" and "norm x < norm R'" |
|
1092 |
using assms `R' < R` by auto |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1093 |
have "summable (\<lambda> n. f n * x^n)" |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1094 |
proof (rule summable_comparison_test, intro exI allI impI) |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
1095 |
fix n |
53079 | 1096 |
have le: "\<bar>f n\<bar> * 1 \<le> \<bar>f n\<bar> * real (Suc n)" |
1097 |
by (rule mult_left_mono) auto |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1098 |
show "norm (f n * x^n) \<le> norm (f n * real (Suc n) * x^n)" |
53079 | 1099 |
unfolding real_norm_def abs_mult |
1100 |
by (rule mult_right_mono) (auto simp add: le[unfolded mult_1_right]) |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1101 |
qed (rule powser_insidea[OF converges[OF `R' \<in> {-R <..< R}`] `norm x < norm R'`]) |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
1102 |
from this[THEN summable_mult2[where c=x], unfolded mult.assoc, unfolded mult.commute] |
53079 | 1103 |
show "summable (?f x)" by auto |
1104 |
} |
|
1105 |
show "summable (?f' x0)" |
|
1106 |
using converges[OF `x0 \<in> {-R <..< R}`] . |
|
1107 |
show "x0 \<in> {-R' <..< R'}" |
|
1108 |
using `x0 \<in> {-R' <..< R'}` . |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1109 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1110 |
} note for_subinterval = this |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1111 |
let ?R = "(R + \<bar>x0\<bar>) / 2" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1112 |
have "\<bar>x0\<bar> < ?R" using assms by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1113 |
hence "- ?R < x0" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1114 |
proof (cases "x0 < 0") |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1115 |
case True |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1116 |
hence "- x0 < ?R" using `\<bar>x0\<bar> < ?R` by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1117 |
thus ?thesis unfolding neg_less_iff_less[symmetric, of "- x0"] by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1118 |
next |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1119 |
case False |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1120 |
have "- ?R < 0" using assms by auto |
41970 | 1121 |
also have "\<dots> \<le> x0" using False by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1122 |
finally show ?thesis . |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1123 |
qed |
53079 | 1124 |
hence "0 < ?R" "?R < R" "- ?R < x0" and "x0 < ?R" |
1125 |
using assms by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1126 |
from for_subinterval[OF this] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1127 |
show ?thesis . |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1128 |
qed |
29695 | 1129 |
|
53079 | 1130 |
|
29164 | 1131 |
subsection {* Exponential Function *} |
23043 | 1132 |
|
58656 | 1133 |
definition exp :: "'a \<Rightarrow> 'a::{real_normed_algebra_1,banach}" |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1134 |
where "exp = (\<lambda>x. \<Sum>n. x^n /\<^sub>R fact n)" |
23043 | 1135 |
|
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1136 |
lemma summable_exp_generic: |
31017 | 1137 |
fixes x :: "'a::{real_normed_algebra_1,banach}" |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1138 |
defines S_def: "S \<equiv> \<lambda>n. x^n /\<^sub>R fact n" |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1139 |
shows "summable S" |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1140 |
proof - |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1141 |
have S_Suc: "\<And>n. S (Suc n) = (x * S n) /\<^sub>R (Suc n)" |
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30082
diff
changeset
|
1142 |
unfolding S_def by (simp del: mult_Suc) |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1143 |
obtain r :: real where r0: "0 < r" and r1: "r < 1" |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1144 |
using dense [OF zero_less_one] by fast |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1145 |
obtain N :: nat where N: "norm x < real N * r" |
60155
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
1146 |
using ex_less_of_nat_mult r0 real_of_nat_def by auto |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1147 |
from r1 show ?thesis |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1148 |
proof (rule summable_ratio_test [rule_format]) |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1149 |
fix n :: nat |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1150 |
assume n: "N \<le> n" |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1151 |
have "norm x \<le> real N * r" |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1152 |
using N by (rule order_less_imp_le) |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1153 |
also have "real N * r \<le> real (Suc n) * r" |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1154 |
using r0 n by (simp add: mult_right_mono) |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1155 |
finally have "norm x * norm (S n) \<le> real (Suc n) * r * norm (S n)" |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1156 |
using norm_ge_zero by (rule mult_right_mono) |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1157 |
hence "norm (x * S n) \<le> real (Suc n) * r * norm (S n)" |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1158 |
by (rule order_trans [OF norm_mult_ineq]) |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1159 |
hence "norm (x * S n) / real (Suc n) \<le> r * norm (S n)" |
57514
bdc2c6b40bf2
prefer ac_simps collections over separate name bindings for add and mult
haftmann
parents:
57512
diff
changeset
|
1160 |
by (simp add: pos_divide_le_eq ac_simps) |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1161 |
thus "norm (S (Suc n)) \<le> r * norm (S n)" |
35216 | 1162 |
by (simp add: S_Suc inverse_eq_divide) |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1163 |
qed |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1164 |
qed |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1165 |
|
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1166 |
lemma summable_norm_exp: |
31017 | 1167 |
fixes x :: "'a::{real_normed_algebra_1,banach}" |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1168 |
shows "summable (\<lambda>n. norm (x^n /\<^sub>R fact n))" |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1169 |
proof (rule summable_norm_comparison_test [OF exI, rule_format]) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1170 |
show "summable (\<lambda>n. norm x^n /\<^sub>R fact n)" |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1171 |
by (rule summable_exp_generic) |
53079 | 1172 |
fix n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1173 |
show "norm (x^n /\<^sub>R fact n) \<le> norm x^n /\<^sub>R fact n" |
35216 | 1174 |
by (simp add: norm_power_ineq) |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1175 |
qed |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1176 |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1177 |
lemma summable_exp: |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1178 |
fixes x :: "'a::{real_normed_field,banach}" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1179 |
shows "summable (\<lambda>n. inverse (fact n) * x^n)" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1180 |
using summable_exp_generic [where x=x] |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1181 |
by (simp add: scaleR_conv_of_real nonzero_of_real_inverse) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1182 |
|
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1183 |
lemma exp_converges: "(\<lambda>n. x^n /\<^sub>R fact n) sums exp x" |
53079 | 1184 |
unfolding exp_def by (rule summable_exp_generic [THEN summable_sums]) |
23043 | 1185 |
|
41970 | 1186 |
lemma exp_fdiffs: |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1187 |
fixes XXX :: "'a::{real_normed_field,banach}" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1188 |
shows "diffs (\<lambda>n. inverse (fact n)) = (\<lambda>n. inverse (fact n :: 'a))" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1189 |
by (simp add: diffs_def mult_ac nonzero_inverse_mult_distrib nonzero_of_real_inverse |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1190 |
del: mult_Suc of_nat_Suc) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1191 |
|
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1192 |
lemma diffs_of_real: "diffs (\<lambda>n. of_real (f n)) = (\<lambda>n. of_real (diffs f n))" |
53079 | 1193 |
by (simp add: diffs_def) |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1194 |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1195 |
lemma DERIV_exp [simp]: "DERIV exp x :> exp(x)" |
53079 | 1196 |
unfolding exp_def scaleR_conv_of_real |
1197 |
apply (rule DERIV_cong) |
|
1198 |
apply (rule termdiffs [where K="of_real (1 + norm x)"]) |
|
1199 |
apply (simp_all only: diffs_of_real scaleR_conv_of_real exp_fdiffs) |
|
1200 |
apply (rule exp_converges [THEN sums_summable, unfolded scaleR_conv_of_real])+ |
|
1201 |
apply (simp del: of_real_add) |
|
1202 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1203 |
|
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
1204 |
declare DERIV_exp[THEN DERIV_chain2, derivative_intros] |
51527 | 1205 |
|
58656 | 1206 |
lemma norm_exp: "norm (exp x) \<le> exp (norm x)" |
1207 |
proof - |
|
1208 |
from summable_norm[OF summable_norm_exp, of x] |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1209 |
have "norm (exp x) \<le> (\<Sum>n. inverse (fact n) * norm (x^n))" |
58656 | 1210 |
by (simp add: exp_def) |
1211 |
also have "\<dots> \<le> exp (norm x)" |
|
1212 |
using summable_exp_generic[of "norm x"] summable_norm_exp[of x] |
|
1213 |
by (auto simp: exp_def intro!: suminf_le norm_power_ineq) |
|
1214 |
finally show ?thesis . |
|
1215 |
qed |
|
1216 |
||
1217 |
lemma isCont_exp: |
|
1218 |
fixes x::"'a::{real_normed_field,banach}" |
|
1219 |
shows "isCont exp x" |
|
44311 | 1220 |
by (rule DERIV_exp [THEN DERIV_isCont]) |
1221 |
||
58656 | 1222 |
lemma isCont_exp' [simp]: |
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1223 |
fixes f:: "_ \<Rightarrow>'a::{real_normed_field,banach}" |
58656 | 1224 |
shows "isCont f a \<Longrightarrow> isCont (\<lambda>x. exp (f x)) a" |
44311 | 1225 |
by (rule isCont_o2 [OF _ isCont_exp]) |
1226 |
||
1227 |
lemma tendsto_exp [tendsto_intros]: |
|
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1228 |
fixes f:: "_ \<Rightarrow>'a::{real_normed_field,banach}" |
58656 | 1229 |
shows "(f ---> a) F \<Longrightarrow> ((\<lambda>x. exp (f x)) ---> exp a) F" |
44311 | 1230 |
by (rule isCont_tendsto_compose [OF isCont_exp]) |
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
1231 |
|
53079 | 1232 |
lemma continuous_exp [continuous_intros]: |
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1233 |
fixes f:: "_ \<Rightarrow>'a::{real_normed_field,banach}" |
58656 | 1234 |
shows "continuous F f \<Longrightarrow> continuous F (\<lambda>x. exp (f x))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1235 |
unfolding continuous_def by (rule tendsto_exp) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1236 |
|
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
1237 |
lemma continuous_on_exp [continuous_intros]: |
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1238 |
fixes f:: "_ \<Rightarrow>'a::{real_normed_field,banach}" |
58656 | 1239 |
shows "continuous_on s f \<Longrightarrow> continuous_on s (\<lambda>x. exp (f x))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1240 |
unfolding continuous_on_def by (auto intro: tendsto_exp) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1241 |
|
53079 | 1242 |
|
29167 | 1243 |
subsubsection {* Properties of the Exponential Function *} |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1244 |
|
23278 | 1245 |
lemma exp_zero [simp]: "exp 0 = 1" |
53079 | 1246 |
unfolding exp_def by (simp add: scaleR_conv_of_real powser_zero) |
23278 | 1247 |
|
58656 | 1248 |
lemma exp_series_add_commuting: |
1249 |
fixes x y :: "'a::{real_normed_algebra_1, banach}" |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1250 |
defines S_def: "S \<equiv> \<lambda>x n. x^n /\<^sub>R fact n" |
58656 | 1251 |
assumes comm: "x * y = y * x" |
56213 | 1252 |
shows "S (x + y) n = (\<Sum>i\<le>n. S x i * S y (n - i))" |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1253 |
proof (induct n) |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1254 |
case 0 |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1255 |
show ?case |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1256 |
unfolding S_def by simp |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1257 |
next |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1258 |
case (Suc n) |
25062 | 1259 |
have S_Suc: "\<And>x n. S x (Suc n) = (x * S x n) /\<^sub>R real (Suc n)" |
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
30082
diff
changeset
|
1260 |
unfolding S_def by (simp del: mult_Suc) |
25062 | 1261 |
hence times_S: "\<And>x n. x * S x n = real (Suc n) *\<^sub>R S x (Suc n)" |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1262 |
by simp |
58656 | 1263 |
have S_comm: "\<And>n. S x n * y = y * S x n" |
1264 |
by (simp add: power_commuting_commutes comm S_def) |
|
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1265 |
|
25062 | 1266 |
have "real (Suc n) *\<^sub>R S (x + y) (Suc n) = (x + y) * S (x + y) n" |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1267 |
by (simp only: times_S) |
56213 | 1268 |
also have "\<dots> = (x + y) * (\<Sum>i\<le>n. S x i * S y (n-i))" |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1269 |
by (simp only: Suc) |
56213 | 1270 |
also have "\<dots> = x * (\<Sum>i\<le>n. S x i * S y (n-i)) |
1271 |
+ y * (\<Sum>i\<le>n. S x i * S y (n-i))" |
|
49962
a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
47489
diff
changeset
|
1272 |
by (rule distrib_right) |
58656 | 1273 |
also have "\<dots> = (\<Sum>i\<le>n. x * S x i * S y (n-i)) |
1274 |
+ (\<Sum>i\<le>n. S x i * y * S y (n-i))" |
|
1275 |
by (simp add: setsum_right_distrib ac_simps S_comm) |
|
1276 |
also have "\<dots> = (\<Sum>i\<le>n. x * S x i * S y (n-i)) |
|
56213 | 1277 |
+ (\<Sum>i\<le>n. S x i * (y * S y (n-i)))" |
58656 | 1278 |
by (simp add: ac_simps) |
56213 | 1279 |
also have "\<dots> = (\<Sum>i\<le>n. real (Suc i) *\<^sub>R (S x (Suc i) * S y (n-i))) |
1280 |
+ (\<Sum>i\<le>n. real (Suc n-i) *\<^sub>R (S x i * S y (Suc n-i)))" |
|
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1281 |
by (simp add: times_S Suc_diff_le) |
56213 | 1282 |
also have "(\<Sum>i\<le>n. real (Suc i) *\<^sub>R (S x (Suc i) * S y (n-i))) = |
1283 |
(\<Sum>i\<le>Suc n. real i *\<^sub>R (S x i * S y (Suc n-i)))" |
|
1284 |
by (subst setsum_atMost_Suc_shift) simp |
|
1285 |
also have "(\<Sum>i\<le>n. real (Suc n-i) *\<^sub>R (S x i * S y (Suc n-i))) = |
|
1286 |
(\<Sum>i\<le>Suc n. real (Suc n-i) *\<^sub>R (S x i * S y (Suc n-i)))" |
|
1287 |
by simp |
|
1288 |
also have "(\<Sum>i\<le>Suc n. real i *\<^sub>R (S x i * S y (Suc n-i))) + |
|
1289 |
(\<Sum>i\<le>Suc n. real (Suc n-i) *\<^sub>R (S x i * S y (Suc n-i))) = |
|
1290 |
(\<Sum>i\<le>Suc n. real (Suc n) *\<^sub>R (S x i * S y (Suc n-i)))" |
|
57418 | 1291 |
by (simp only: setsum.distrib [symmetric] scaleR_left_distrib [symmetric] |
56213 | 1292 |
real_of_nat_add [symmetric]) simp |
1293 |
also have "\<dots> = real (Suc n) *\<^sub>R (\<Sum>i\<le>Suc n. S x i * S y (Suc n-i))" |
|
23127 | 1294 |
by (simp only: scaleR_right.setsum) |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1295 |
finally show |
56213 | 1296 |
"S (x + y) (Suc n) = (\<Sum>i\<le>Suc n. S x i * S y (Suc n - i))" |
35216 | 1297 |
by (simp del: setsum_cl_ivl_Suc) |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1298 |
qed |
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1299 |
|
58656 | 1300 |
lemma exp_add_commuting: "x * y = y * x \<Longrightarrow> exp (x + y) = exp x * exp y" |
53079 | 1301 |
unfolding exp_def |
58656 | 1302 |
by (simp only: Cauchy_product summable_norm_exp exp_series_add_commuting) |
1303 |
||
1304 |
lemma exp_add: |
|
1305 |
fixes x y::"'a::{real_normed_field,banach}" |
|
1306 |
shows "exp (x + y) = exp x * exp y" |
|
1307 |
by (rule exp_add_commuting) (simp add: ac_simps) |
|
1308 |
||
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1309 |
lemma exp_double: "exp(2 * z) = exp z ^ 2" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1310 |
by (simp add: exp_add_commuting mult_2 power2_eq_square) |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1311 |
|
58656 | 1312 |
lemmas mult_exp_exp = exp_add [symmetric] |
29170 | 1313 |
|
23241 | 1314 |
lemma exp_of_real: "exp (of_real x) = of_real (exp x)" |
53079 | 1315 |
unfolding exp_def |
1316 |
apply (subst suminf_of_real) |
|
1317 |
apply (rule summable_exp_generic) |
|
1318 |
apply (simp add: scaleR_conv_of_real) |
|
1319 |
done |
|
23241 | 1320 |
|
59862 | 1321 |
corollary exp_in_Reals [simp]: "z \<in> \<real> \<Longrightarrow> exp z \<in> \<real>" |
1322 |
by (metis Reals_cases Reals_of_real exp_of_real) |
|
1323 |
||
29170 | 1324 |
lemma exp_not_eq_zero [simp]: "exp x \<noteq> 0" |
1325 |
proof |
|
58656 | 1326 |
have "exp x * exp (- x) = 1" by (simp add: exp_add_commuting[symmetric]) |
29170 | 1327 |
also assume "exp x = 0" |
1328 |
finally show "False" by simp |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1329 |
qed |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1330 |
|
58656 | 1331 |
lemma exp_minus_inverse: |
1332 |
shows "exp x * exp (- x) = 1" |
|
1333 |
by (simp add: exp_add_commuting[symmetric]) |
|
1334 |
||
1335 |
lemma exp_minus: |
|
1336 |
fixes x :: "'a::{real_normed_field, banach}" |
|
1337 |
shows "exp (- x) = inverse (exp x)" |
|
1338 |
by (intro inverse_unique [symmetric] exp_minus_inverse) |
|
1339 |
||
1340 |
lemma exp_diff: |
|
1341 |
fixes x :: "'a::{real_normed_field, banach}" |
|
1342 |
shows "exp (x - y) = exp x / exp y" |
|
54230
b1d955791529
more simplification rules on unary and binary minus
haftmann
parents:
53602
diff
changeset
|
1343 |
using exp_add [of x "- y"] by (simp add: exp_minus divide_inverse) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1344 |
|
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1345 |
lemma exp_of_nat_mult: |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1346 |
fixes x :: "'a::{real_normed_field,banach}" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1347 |
shows "exp(of_nat n * x) = exp(x) ^ n" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1348 |
by (induct n) (auto simp add: distrib_left exp_add mult.commute) |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1349 |
|
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1350 |
lemma exp_setsum: "finite I \<Longrightarrow> exp(setsum f I) = setprod (\<lambda>x. exp(f x)) I" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1351 |
by (induction I rule: finite_induct) (auto simp: exp_add_commuting mult.commute) |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1352 |
|
29167 | 1353 |
|
1354 |
subsubsection {* Properties of the Exponential Function on Reals *} |
|
1355 |
||
29170 | 1356 |
text {* Comparisons of @{term "exp x"} with zero. *} |
29167 | 1357 |
|
1358 |
text{*Proof: because every exponential can be seen as a square.*} |
|
1359 |
lemma exp_ge_zero [simp]: "0 \<le> exp (x::real)" |
|
1360 |
proof - |
|
1361 |
have "0 \<le> exp (x/2) * exp (x/2)" by simp |
|
1362 |
thus ?thesis by (simp add: exp_add [symmetric]) |
|
1363 |
qed |
|
1364 |
||
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1365 |
lemma exp_gt_zero [simp]: "0 < exp (x::real)" |
53079 | 1366 |
by (simp add: order_less_le) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1367 |
|
29170 | 1368 |
lemma not_exp_less_zero [simp]: "\<not> exp (x::real) < 0" |
53079 | 1369 |
by (simp add: not_less) |
29170 | 1370 |
|
1371 |
lemma not_exp_le_zero [simp]: "\<not> exp (x::real) \<le> 0" |
|
53079 | 1372 |
by (simp add: not_le) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1373 |
|
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1374 |
lemma abs_exp_cancel [simp]: "\<bar>exp x::real\<bar> = exp x" |
53079 | 1375 |
by simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1376 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1377 |
(*FIXME: superseded by exp_of_nat_mult*) |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1378 |
lemma exp_real_of_nat_mult: "exp(real n * x) = exp(x) ^ n" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
1379 |
by (induct n) (auto simp add: real_of_nat_Suc distrib_left exp_add mult.commute) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1380 |
|
29170 | 1381 |
text {* Strict monotonicity of exponential. *} |
1382 |
||
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1383 |
lemma exp_ge_add_one_self_aux: |
54575 | 1384 |
assumes "0 \<le> (x::real)" shows "1+x \<le> exp(x)" |
1385 |
using order_le_imp_less_or_eq [OF assms] |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1386 |
proof |
54575 | 1387 |
assume "0 < x" |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1388 |
have "1+x \<le> (\<Sum>n<2. inverse (fact n) * x^n)" |
54575 | 1389 |
by (auto simp add: numeral_2_eq_2) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1390 |
also have "... \<le> (\<Sum>n. inverse (fact n) * x^n)" |
56213 | 1391 |
apply (rule setsum_le_suminf [OF summable_exp]) |
54575 | 1392 |
using `0 < x` |
1393 |
apply (auto simp add: zero_le_mult_iff) |
|
1394 |
done |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1395 |
finally show "1+x \<le> exp x" |
54575 | 1396 |
by (simp add: exp_def) |
1397 |
next |
|
1398 |
assume "0 = x" |
|
1399 |
then show "1 + x \<le> exp x" |
|
1400 |
by auto |
|
1401 |
qed |
|
29170 | 1402 |
|
1403 |
lemma exp_gt_one: "0 < (x::real) \<Longrightarrow> 1 < exp x" |
|
1404 |
proof - |
|
1405 |
assume x: "0 < x" |
|
1406 |
hence "1 < 1 + x" by simp |
|
1407 |
also from x have "1 + x \<le> exp x" |
|
1408 |
by (simp add: exp_ge_add_one_self_aux) |
|
1409 |
finally show ?thesis . |
|
1410 |
qed |
|
1411 |
||
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1412 |
lemma exp_less_mono: |
23115
4615b2078592
generalized exp to work over any complete field; new proof of exp_add
huffman
parents:
23112
diff
changeset
|
1413 |
fixes x y :: real |
53079 | 1414 |
assumes "x < y" |
1415 |
shows "exp x < exp y" |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1416 |
proof - |
29165
562f95f06244
cleaned up some proofs; removed redundant simp rules
huffman
parents:
29164
diff
changeset
|
1417 |
from `x < y` have "0 < y - x" by simp |
562f95f06244
cleaned up some proofs; removed redundant simp rules
huffman
parents:
29164
diff
changeset
|
1418 |
hence "1 < exp (y - x)" by (rule exp_gt_one) |
562f95f06244
cleaned up some proofs; removed redundant simp rules
huffman
parents:
29164
diff
changeset
|
1419 |
hence "1 < exp y / exp x" by (simp only: exp_diff) |
562f95f06244
cleaned up some proofs; removed redundant simp rules
huffman
parents:
29164
diff
changeset
|
1420 |
thus "exp x < exp y" by simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1421 |
qed |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1422 |
|
53079 | 1423 |
lemma exp_less_cancel: "exp (x::real) < exp y \<Longrightarrow> x < y" |
54575 | 1424 |
unfolding linorder_not_le [symmetric] |
1425 |
by (auto simp add: order_le_less exp_less_mono) |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1426 |
|
29170 | 1427 |
lemma exp_less_cancel_iff [iff]: "exp (x::real) < exp y \<longleftrightarrow> x < y" |
53079 | 1428 |
by (auto intro: exp_less_mono exp_less_cancel) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1429 |
|
29170 | 1430 |
lemma exp_le_cancel_iff [iff]: "exp (x::real) \<le> exp y \<longleftrightarrow> x \<le> y" |
53079 | 1431 |
by (auto simp add: linorder_not_less [symmetric]) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1432 |
|
29170 | 1433 |
lemma exp_inj_iff [iff]: "exp (x::real) = exp y \<longleftrightarrow> x = y" |
53079 | 1434 |
by (simp add: order_eq_iff) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1435 |
|
29170 | 1436 |
text {* Comparisons of @{term "exp x"} with one. *} |
1437 |
||
1438 |
lemma one_less_exp_iff [simp]: "1 < exp (x::real) \<longleftrightarrow> 0 < x" |
|
1439 |
using exp_less_cancel_iff [where x=0 and y=x] by simp |
|
1440 |
||
1441 |
lemma exp_less_one_iff [simp]: "exp (x::real) < 1 \<longleftrightarrow> x < 0" |
|
1442 |
using exp_less_cancel_iff [where x=x and y=0] by simp |
|
1443 |
||
1444 |
lemma one_le_exp_iff [simp]: "1 \<le> exp (x::real) \<longleftrightarrow> 0 \<le> x" |
|
1445 |
using exp_le_cancel_iff [where x=0 and y=x] by simp |
|
1446 |
||
1447 |
lemma exp_le_one_iff [simp]: "exp (x::real) \<le> 1 \<longleftrightarrow> x \<le> 0" |
|
1448 |
using exp_le_cancel_iff [where x=x and y=0] by simp |
|
1449 |
||
1450 |
lemma exp_eq_one_iff [simp]: "exp (x::real) = 1 \<longleftrightarrow> x = 0" |
|
1451 |
using exp_inj_iff [where x=x and y=0] by simp |
|
1452 |
||
53079 | 1453 |
lemma lemma_exp_total: "1 \<le> y \<Longrightarrow> \<exists>x. 0 \<le> x & x \<le> y - 1 & exp(x::real) = y" |
44755 | 1454 |
proof (rule IVT) |
1455 |
assume "1 \<le> y" |
|
1456 |
hence "0 \<le> y - 1" by simp |
|
1457 |
hence "1 + (y - 1) \<le> exp (y - 1)" by (rule exp_ge_add_one_self_aux) |
|
1458 |
thus "y \<le> exp (y - 1)" by simp |
|
1459 |
qed (simp_all add: le_diff_eq) |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1460 |
|
53079 | 1461 |
lemma exp_total: "0 < (y::real) \<Longrightarrow> \<exists>x. exp x = y" |
44755 | 1462 |
proof (rule linorder_le_cases [of 1 y]) |
53079 | 1463 |
assume "1 \<le> y" |
1464 |
thus "\<exists>x. exp x = y" by (fast dest: lemma_exp_total) |
|
44755 | 1465 |
next |
1466 |
assume "0 < y" and "y \<le> 1" |
|
1467 |
hence "1 \<le> inverse y" by (simp add: one_le_inverse_iff) |
|
1468 |
then obtain x where "exp x = inverse y" by (fast dest: lemma_exp_total) |
|
1469 |
hence "exp (- x) = y" by (simp add: exp_minus) |
|
1470 |
thus "\<exists>x. exp x = y" .. |
|
1471 |
qed |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1472 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1473 |
|
29164 | 1474 |
subsection {* Natural Logarithm *} |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1475 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1476 |
class ln = real_normed_algebra_1 + banach + |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1477 |
fixes ln :: "'a \<Rightarrow> 'a" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1478 |
assumes ln_one [simp]: "ln 1 = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1479 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1480 |
definition powr :: "['a,'a] => 'a::ln" (infixr "powr" 80) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1481 |
-- {*exponentation via ln and exp*} |
60020
065ecea354d0
Complex roots of unity. Better definition of ln for complex numbers. Used [code del] to stop code generation for powr.
paulson <lp15@cam.ac.uk>
parents:
60017
diff
changeset
|
1482 |
where [code del]: "x powr a \<equiv> if x = 0 then 0 else exp(a * ln x)" |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1483 |
|
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
1484 |
lemma powr_0 [simp]: "0 powr z = 0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
1485 |
by (simp add: powr_def) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
1486 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1487 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1488 |
instantiation real :: ln |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1489 |
begin |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1490 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1491 |
definition ln_real :: "real \<Rightarrow> real" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1492 |
where "ln_real x = (THE u. exp u = x)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1493 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1494 |
instance |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1495 |
by intro_classes (simp add: ln_real_def) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1496 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1497 |
end |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1498 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1499 |
lemma powr_eq_0_iff [simp]: "w powr z = 0 \<longleftrightarrow> w = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1500 |
by (simp add: powr_def) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1501 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1502 |
lemma ln_exp [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1503 |
fixes x::real shows "ln (exp x) = x" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1504 |
by (simp add: ln_real_def) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1505 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1506 |
lemma exp_ln [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1507 |
fixes x::real shows "0 < x \<Longrightarrow> exp (ln x) = x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1508 |
by (auto dest: exp_total) |
22654
c2b6b5a9e136
new simp rule exp_ln; new standard proof of DERIV_exp_ln_one; changed imports
huffman
parents:
22653
diff
changeset
|
1509 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1510 |
lemma exp_ln_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1511 |
fixes x::real shows "exp (ln x) = x \<longleftrightarrow> 0 < x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1512 |
by (metis exp_gt_zero exp_ln) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1513 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1514 |
lemma ln_unique: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1515 |
fixes x::real shows "exp y = x \<Longrightarrow> ln x = y" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1516 |
by (erule subst, rule ln_exp) |
29171 | 1517 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1518 |
lemma ln_mult: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1519 |
fixes x::real shows "0 < x \<Longrightarrow> 0 < y \<Longrightarrow> ln (x * y) = ln x + ln y" |
53079 | 1520 |
by (rule ln_unique) (simp add: exp_add) |
29171 | 1521 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1522 |
lemma ln_setprod: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1523 |
fixes f:: "'a => real" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1524 |
shows |
59746
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
1525 |
"\<lbrakk>finite I; \<And>i. i \<in> I \<Longrightarrow> f i > 0\<rbrakk> \<Longrightarrow> ln(setprod f I) = setsum (\<lambda>x. ln(f x)) I" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
1526 |
by (induction I rule: finite_induct) (auto simp: ln_mult setprod_pos) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
1527 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1528 |
lemma ln_inverse: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1529 |
fixes x::real shows "0 < x \<Longrightarrow> ln (inverse x) = - ln x" |
53079 | 1530 |
by (rule ln_unique) (simp add: exp_minus) |
1531 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1532 |
lemma ln_div: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1533 |
fixes x::real shows "0 < x \<Longrightarrow> 0 < y \<Longrightarrow> ln (x / y) = ln x - ln y" |
53079 | 1534 |
by (rule ln_unique) (simp add: exp_diff) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1535 |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1536 |
lemma ln_realpow: "0 < x \<Longrightarrow> ln (x^n) = real n * ln x" |
53079 | 1537 |
by (rule ln_unique) (simp add: exp_real_of_nat_mult) |
1538 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1539 |
lemma ln_less_cancel_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1540 |
fixes x::real shows "0 < x \<Longrightarrow> 0 < y \<Longrightarrow> ln x < ln y \<longleftrightarrow> x < y" |
53079 | 1541 |
by (subst exp_less_cancel_iff [symmetric]) simp |
1542 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1543 |
lemma ln_le_cancel_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1544 |
fixes x::real shows "0 < x \<Longrightarrow> 0 < y \<Longrightarrow> ln x \<le> ln y \<longleftrightarrow> x \<le> y" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1545 |
by (simp add: linorder_not_less [symmetric]) |
29171 | 1546 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1547 |
lemma ln_inj_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1548 |
fixes x::real shows "0 < x \<Longrightarrow> 0 < y \<Longrightarrow> ln x = ln y \<longleftrightarrow> x = y" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1549 |
by (simp add: order_eq_iff) |
29171 | 1550 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1551 |
lemma ln_add_one_self_le_self [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1552 |
fixes x::real shows "0 \<le> x \<Longrightarrow> ln (1 + x) \<le> x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1553 |
apply (rule exp_le_cancel_iff [THEN iffD1]) |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1554 |
apply (simp add: exp_ge_add_one_self_aux) |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1555 |
done |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1556 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1557 |
lemma ln_less_self [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1558 |
fixes x::real shows "0 < x \<Longrightarrow> ln x < x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1559 |
by (rule order_less_le_trans [where y="ln (1 + x)"]) simp_all |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1560 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1561 |
lemma ln_ge_zero [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1562 |
fixes x::real shows "1 \<le> x \<Longrightarrow> 0 \<le> ln x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1563 |
using ln_le_cancel_iff [of 1 x] by simp |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1564 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1565 |
lemma ln_ge_zero_imp_ge_one: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1566 |
fixes x::real shows "0 \<le> ln x \<Longrightarrow> 0 < x \<Longrightarrow> 1 \<le> x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1567 |
using ln_le_cancel_iff [of 1 x] by simp |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1568 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1569 |
lemma ln_ge_zero_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1570 |
fixes x::real shows "0 < x \<Longrightarrow> 0 \<le> ln x \<longleftrightarrow> 1 \<le> x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1571 |
using ln_le_cancel_iff [of 1 x] by simp |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1572 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1573 |
lemma ln_less_zero_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1574 |
fixes x::real shows "0 < x \<Longrightarrow> ln x < 0 \<longleftrightarrow> x < 1" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1575 |
using ln_less_cancel_iff [of x 1] by simp |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1576 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1577 |
lemma ln_gt_zero: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1578 |
fixes x::real shows "1 < x \<Longrightarrow> 0 < ln x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1579 |
using ln_less_cancel_iff [of 1 x] by simp |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1580 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1581 |
lemma ln_gt_zero_imp_gt_one: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1582 |
fixes x::real shows "0 < ln x \<Longrightarrow> 0 < x \<Longrightarrow> 1 < x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1583 |
using ln_less_cancel_iff [of 1 x] by simp |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1584 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1585 |
lemma ln_gt_zero_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1586 |
fixes x::real shows "0 < x \<Longrightarrow> 0 < ln x \<longleftrightarrow> 1 < x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1587 |
using ln_less_cancel_iff [of 1 x] by simp |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1588 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1589 |
lemma ln_eq_zero_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1590 |
fixes x::real shows "0 < x \<Longrightarrow> ln x = 0 \<longleftrightarrow> x = 1" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1591 |
using ln_inj_iff [of x 1] by simp |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1592 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1593 |
lemma ln_less_zero: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1594 |
fixes x::real shows "0 < x \<Longrightarrow> x < 1 \<Longrightarrow> ln x < 0" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1595 |
by simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1596 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1597 |
lemma ln_neg_is_const: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1598 |
fixes x::real shows "x \<le> 0 \<Longrightarrow> ln x = (THE x. False)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1599 |
by (auto simp add: ln_real_def intro!: arg_cong[where f=The]) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1600 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1601 |
lemma isCont_ln: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1602 |
fixes x::real assumes "x \<noteq> 0" shows "isCont ln x" |
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1603 |
proof cases |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1604 |
assume "0 < x" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1605 |
moreover then have "isCont ln (exp (ln x))" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1606 |
by (intro isCont_inv_fun[where d="\<bar>x\<bar>" and f=exp]) auto |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1607 |
ultimately show ?thesis |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1608 |
by simp |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1609 |
next |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1610 |
assume "\<not> 0 < x" with `x \<noteq> 0` show "isCont ln x" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1611 |
unfolding isCont_def |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1612 |
by (subst filterlim_cong[OF _ refl, of _ "nhds (ln 0)" _ "\<lambda>_. ln 0"]) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1613 |
(auto simp: ln_neg_is_const not_less eventually_at dist_real_def |
58729
e8ecc79aee43
add tendsto_const and tendsto_ident_at as simp and intro rules
hoelzl
parents:
58710
diff
changeset
|
1614 |
intro!: exI[of _ "\<bar>x\<bar>"]) |
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1615 |
qed |
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
1616 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1617 |
lemma tendsto_ln [tendsto_intros]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1618 |
fixes a::real shows |
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
1619 |
"(f ---> a) F \<Longrightarrow> a \<noteq> 0 \<Longrightarrow> ((\<lambda>x. ln (f x)) ---> ln a) F" |
45915 | 1620 |
by (rule isCont_tendsto_compose [OF isCont_ln]) |
1621 |
||
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1622 |
lemma continuous_ln: |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1623 |
"continuous F f \<Longrightarrow> f (Lim F (\<lambda>x. x)) \<noteq> 0 \<Longrightarrow> continuous F (\<lambda>x. ln (f x :: real))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1624 |
unfolding continuous_def by (rule tendsto_ln) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1625 |
|
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1626 |
lemma isCont_ln' [continuous_intros]: |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1627 |
"continuous (at x) f \<Longrightarrow> f x \<noteq> 0 \<Longrightarrow> continuous (at x) (\<lambda>x. ln (f x :: real))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1628 |
unfolding continuous_at by (rule tendsto_ln) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1629 |
|
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1630 |
lemma continuous_within_ln [continuous_intros]: |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1631 |
"continuous (at x within s) f \<Longrightarrow> f x \<noteq> 0 \<Longrightarrow> continuous (at x within s) (\<lambda>x. ln (f x :: real))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1632 |
unfolding continuous_within by (rule tendsto_ln) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1633 |
|
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
1634 |
lemma continuous_on_ln [continuous_intros]: |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1635 |
"continuous_on s f \<Longrightarrow> (\<forall>x\<in>s. f x \<noteq> 0) \<Longrightarrow> continuous_on s (\<lambda>x. ln (f x :: real))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1636 |
unfolding continuous_on_def by (auto intro: tendsto_ln) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
1637 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1638 |
lemma DERIV_ln: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1639 |
fixes x::real shows "0 < x \<Longrightarrow> DERIV ln x :> inverse x" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1640 |
apply (rule DERIV_inverse_function [where f=exp and a=0 and b="x+1"]) |
54576 | 1641 |
apply (auto intro: DERIV_cong [OF DERIV_exp exp_ln] isCont_ln) |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
1642 |
done |
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
1643 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1644 |
lemma DERIV_ln_divide: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1645 |
fixes x::real shows "0 < x \<Longrightarrow> DERIV ln x :> 1 / x" |
33667 | 1646 |
by (rule DERIV_ln[THEN DERIV_cong], simp, simp add: divide_inverse) |
1647 |
||
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
1648 |
declare DERIV_ln_divide[THEN DERIV_chain2, derivative_intros] |
51527 | 1649 |
|
53079 | 1650 |
lemma ln_series: |
1651 |
assumes "0 < x" and "x < 2" |
|
1652 |
shows "ln x = (\<Sum> n. (-1)^n * (1 / real (n + 1)) * (x - 1)^(Suc n))" |
|
1653 |
(is "ln x = suminf (?f (x - 1))") |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1654 |
proof - |
53079 | 1655 |
let ?f' = "\<lambda>x n. (-1)^n * (x - 1)^n" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1656 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1657 |
have "ln x - suminf (?f (x - 1)) = ln 1 - suminf (?f (1 - 1))" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1658 |
proof (rule DERIV_isconst3[where x=x]) |
53079 | 1659 |
fix x :: real |
1660 |
assume "x \<in> {0 <..< 2}" |
|
1661 |
hence "0 < x" and "x < 2" by auto |
|
1662 |
have "norm (1 - x) < 1" |
|
1663 |
using `0 < x` and `x < 2` by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1664 |
have "1 / x = 1 / (1 - (1 - x))" by auto |
53079 | 1665 |
also have "\<dots> = (\<Sum> n. (1 - x)^n)" |
1666 |
using geometric_sums[OF `norm (1 - x) < 1`] by (rule sums_unique) |
|
1667 |
also have "\<dots> = suminf (?f' x)" |
|
1668 |
unfolding power_mult_distrib[symmetric] |
|
1669 |
by (rule arg_cong[where f=suminf], rule arg_cong[where f="op ^"], auto) |
|
1670 |
finally have "DERIV ln x :> suminf (?f' x)" |
|
1671 |
using DERIV_ln[OF `0 < x`] unfolding divide_inverse by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1672 |
moreover |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1673 |
have repos: "\<And> h x :: real. h - 1 + x = h + x - 1" by auto |
53079 | 1674 |
have "DERIV (\<lambda>x. suminf (?f x)) (x - 1) :> |
1675 |
(\<Sum>n. (-1)^n * (1 / real (n + 1)) * real (Suc n) * (x - 1) ^ n)" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1676 |
proof (rule DERIV_power_series') |
53079 | 1677 |
show "x - 1 \<in> {- 1<..<1}" and "(0 :: real) < 1" |
1678 |
using `0 < x` `x < 2` by auto |
|
1679 |
fix x :: real |
|
1680 |
assume "x \<in> {- 1<..<1}" |
|
1681 |
hence "norm (-x) < 1" by auto |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1682 |
show "summable (\<lambda>n. (- 1) ^ n * (1 / real (n + 1)) * real (Suc n) * x^n)" |
53079 | 1683 |
unfolding One_nat_def |
1684 |
by (auto simp add: power_mult_distrib[symmetric] summable_geometric[OF `norm (-x) < 1`]) |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1685 |
qed |
53079 | 1686 |
hence "DERIV (\<lambda>x. suminf (?f x)) (x - 1) :> suminf (?f' x)" |
1687 |
unfolding One_nat_def by auto |
|
1688 |
hence "DERIV (\<lambda>x. suminf (?f (x - 1))) x :> suminf (?f' x)" |
|
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
1689 |
unfolding DERIV_def repos . |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1690 |
ultimately have "DERIV (\<lambda>x. ln x - suminf (?f (x - 1))) x :> (suminf (?f' x) - suminf (?f' x))" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1691 |
by (rule DERIV_diff) |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1692 |
thus "DERIV (\<lambda>x. ln x - suminf (?f (x - 1))) x :> 0" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1693 |
qed (auto simp add: assms) |
44289 | 1694 |
thus ?thesis by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
1695 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
1696 |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1697 |
lemma exp_first_two_terms: |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1698 |
fixes x :: "'a::{real_normed_field,banach}" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1699 |
shows "exp x = 1 + x + (\<Sum> n. inverse(fact (n+2)) * (x ^ (n+2)))" |
50326 | 1700 |
proof - |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1701 |
have "exp x = suminf (\<lambda>n. inverse(fact n) * (x^n))" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1702 |
by (simp add: exp_def scaleR_conv_of_real nonzero_of_real_inverse) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1703 |
also from summable_exp have "... = (\<Sum> n. inverse(fact(n+2)) * (x ^ (n+2))) + |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1704 |
(\<Sum> n::nat<2. inverse(fact n) * (x^n))" (is "_ = _ + ?a") |
50326 | 1705 |
by (rule suminf_split_initial_segment) |
1706 |
also have "?a = 1 + x" |
|
1707 |
by (simp add: numeral_2_eq_2) |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1708 |
finally show ?thesis |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
1709 |
by simp |
50326 | 1710 |
qed |
1711 |
||
53079 | 1712 |
lemma exp_bound: "0 <= (x::real) \<Longrightarrow> x <= 1 \<Longrightarrow> exp x <= 1 + x + x\<^sup>2" |
50326 | 1713 |
proof - |
1714 |
assume a: "0 <= x" |
|
1715 |
assume b: "x <= 1" |
|
53079 | 1716 |
{ |
1717 |
fix n :: nat |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1718 |
have "(2::nat) * 2 ^ n \<le> fact (n + 2)" |
53079 | 1719 |
by (induct n) simp_all |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1720 |
hence "real ((2::nat) * 2 ^ n) \<le> real_of_nat (fact (n + 2))" |
50326 | 1721 |
by (simp only: real_of_nat_le_iff) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1722 |
hence "((2::real) * 2 ^ n) \<le> fact (n + 2)" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1723 |
unfolding of_nat_fact real_of_nat_def |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1724 |
by (simp add: of_nat_mult of_nat_power) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1725 |
hence "inverse (fact (n + 2)) \<le> inverse ((2::real) * 2 ^ n)" |
50326 | 1726 |
by (rule le_imp_inverse_le) simp |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1727 |
hence "inverse (fact (n + 2)) \<le> 1/(2::real) * (1/2)^n" |
53079 | 1728 |
by (simp add: power_inverse) |
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
1729 |
hence "inverse (fact (n + 2)) * (x^n * x\<^sup>2) \<le> 1/2 * (1/2)^n * (1 * x\<^sup>2)" |
50326 | 1730 |
by (rule mult_mono) |
56536 | 1731 |
(rule mult_mono, simp_all add: power_le_one a b) |
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
1732 |
hence "inverse (fact (n + 2)) * x ^ (n + 2) \<le> (x\<^sup>2/2) * ((1/2)^n)" |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
1733 |
unfolding power_add by (simp add: ac_simps del: fact.simps) } |
50326 | 1734 |
note aux1 = this |
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
1735 |
have "(\<lambda>n. x\<^sup>2 / 2 * (1 / 2) ^ n) sums (x\<^sup>2 / 2 * (1 / (1 - 1 / 2)))" |
50326 | 1736 |
by (intro sums_mult geometric_sums, simp) |
53076 | 1737 |
hence aux2: "(\<lambda>n. x\<^sup>2 / 2 * (1 / 2) ^ n) sums x\<^sup>2" |
50326 | 1738 |
by simp |
53079 | 1739 |
have "suminf (\<lambda>n. inverse(fact (n+2)) * (x ^ (n+2))) <= x\<^sup>2" |
50326 | 1740 |
proof - |
53079 | 1741 |
have "suminf (\<lambda>n. inverse(fact (n+2)) * (x ^ (n+2))) <= |
1742 |
suminf (\<lambda>n. (x\<^sup>2/2) * ((1/2)^n))" |
|
56213 | 1743 |
apply (rule suminf_le) |
50326 | 1744 |
apply (rule allI, rule aux1) |
1745 |
apply (rule summable_exp [THEN summable_ignore_initial_segment]) |
|
1746 |
by (rule sums_summable, rule aux2) |
|
53076 | 1747 |
also have "... = x\<^sup>2" |
50326 | 1748 |
by (rule sums_unique [THEN sym], rule aux2) |
1749 |
finally show ?thesis . |
|
1750 |
qed |
|
1751 |
thus ?thesis unfolding exp_first_two_terms by auto |
|
1752 |
qed |
|
1753 |
||
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1754 |
corollary exp_half_le2: "exp(1/2) \<le> (2::real)" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1755 |
using exp_bound [of "1/2"] |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1756 |
by (simp add: field_simps) |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1757 |
|
59741
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
1758 |
corollary exp_le: "exp 1 \<le> (3::real)" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
1759 |
using exp_bound [of 1] |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
1760 |
by (simp add: field_simps) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
1761 |
|
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1762 |
lemma exp_bound_half: "norm(z) \<le> 1/2 \<Longrightarrow> norm(exp z) \<le> 2" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1763 |
by (blast intro: order_trans intro!: exp_half_le2 norm_exp) |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1764 |
|
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1765 |
lemma exp_bound_lemma: |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1766 |
assumes "norm(z) \<le> 1/2" shows "norm(exp z) \<le> 1 + 2 * norm(z)" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1767 |
proof - |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1768 |
have n: "(norm z)\<^sup>2 \<le> norm z * 1" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1769 |
unfolding power2_eq_square |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1770 |
apply (rule mult_left_mono) |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1771 |
using assms |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1772 |
apply auto |
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1773 |
done |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1774 |
show ?thesis |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1775 |
apply (rule order_trans [OF norm_exp]) |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1776 |
apply (rule order_trans [OF exp_bound]) |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1777 |
using assms n |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1778 |
apply auto |
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1779 |
done |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1780 |
qed |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1781 |
|
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1782 |
lemma real_exp_bound_lemma: |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1783 |
fixes x :: real |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1784 |
shows "0 \<le> x \<Longrightarrow> x \<le> 1/2 \<Longrightarrow> exp(x) \<le> 1 + 2 * x" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1785 |
using exp_bound_lemma [of x] |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1786 |
by simp |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
1787 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1788 |
lemma ln_one_minus_pos_upper_bound: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1789 |
fixes x::real shows "0 <= x \<Longrightarrow> x < 1 \<Longrightarrow> ln (1 - x) <= - x" |
50326 | 1790 |
proof - |
1791 |
assume a: "0 <= (x::real)" and b: "x < 1" |
|
53076 | 1792 |
have "(1 - x) * (1 + x + x\<^sup>2) = (1 - x^3)" |
50326 | 1793 |
by (simp add: algebra_simps power2_eq_square power3_eq_cube) |
1794 |
also have "... <= 1" |
|
1795 |
by (auto simp add: a) |
|
53076 | 1796 |
finally have "(1 - x) * (1 + x + x\<^sup>2) <= 1" . |
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
1797 |
moreover have c: "0 < 1 + x + x\<^sup>2" |
50326 | 1798 |
by (simp add: add_pos_nonneg a) |
53076 | 1799 |
ultimately have "1 - x <= 1 / (1 + x + x\<^sup>2)" |
50326 | 1800 |
by (elim mult_imp_le_div_pos) |
1801 |
also have "... <= 1 / exp x" |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1802 |
by (metis a abs_one b exp_bound exp_gt_zero frac_le less_eq_real_def real_sqrt_abs |
54576 | 1803 |
real_sqrt_pow2_iff real_sqrt_power) |
50326 | 1804 |
also have "... = exp (-x)" |
1805 |
by (auto simp add: exp_minus divide_inverse) |
|
1806 |
finally have "1 - x <= exp (- x)" . |
|
1807 |
also have "1 - x = exp (ln (1 - x))" |
|
54576 | 1808 |
by (metis b diff_0 exp_ln_iff less_iff_diff_less_0 minus_diff_eq) |
50326 | 1809 |
finally have "exp (ln (1 - x)) <= exp (- x)" . |
1810 |
thus ?thesis by (auto simp only: exp_le_cancel_iff) |
|
1811 |
qed |
|
1812 |
||
1813 |
lemma exp_ge_add_one_self [simp]: "1 + (x::real) <= exp x" |
|
1814 |
apply (case_tac "0 <= x") |
|
1815 |
apply (erule exp_ge_add_one_self_aux) |
|
1816 |
apply (case_tac "x <= -1") |
|
1817 |
apply (subgoal_tac "1 + x <= 0") |
|
1818 |
apply (erule order_trans) |
|
1819 |
apply simp |
|
1820 |
apply simp |
|
1821 |
apply (subgoal_tac "1 + x = exp(ln (1 + x))") |
|
1822 |
apply (erule ssubst) |
|
1823 |
apply (subst exp_le_cancel_iff) |
|
1824 |
apply (subgoal_tac "ln (1 - (- x)) <= - (- x)") |
|
1825 |
apply simp |
|
1826 |
apply (rule ln_one_minus_pos_upper_bound) |
|
1827 |
apply auto |
|
1828 |
done |
|
1829 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1830 |
lemma ln_one_plus_pos_lower_bound: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1831 |
fixes x::real shows "0 <= x \<Longrightarrow> x <= 1 \<Longrightarrow> x - x\<^sup>2 <= ln (1 + x)" |
51527 | 1832 |
proof - |
1833 |
assume a: "0 <= x" and b: "x <= 1" |
|
53076 | 1834 |
have "exp (x - x\<^sup>2) = exp x / exp (x\<^sup>2)" |
51527 | 1835 |
by (rule exp_diff) |
53076 | 1836 |
also have "... <= (1 + x + x\<^sup>2) / exp (x \<^sup>2)" |
54576 | 1837 |
by (metis a b divide_right_mono exp_bound exp_ge_zero) |
53076 | 1838 |
also have "... <= (1 + x + x\<^sup>2) / (1 + x\<^sup>2)" |
56544 | 1839 |
by (simp add: a divide_left_mono add_pos_nonneg) |
51527 | 1840 |
also from a have "... <= 1 + x" |
1841 |
by (simp add: field_simps add_strict_increasing zero_le_mult_iff) |
|
53076 | 1842 |
finally have "exp (x - x\<^sup>2) <= 1 + x" . |
51527 | 1843 |
also have "... = exp (ln (1 + x))" |
1844 |
proof - |
|
1845 |
from a have "0 < 1 + x" by auto |
|
1846 |
thus ?thesis |
|
1847 |
by (auto simp only: exp_ln_iff [THEN sym]) |
|
1848 |
qed |
|
53076 | 1849 |
finally have "exp (x - x\<^sup>2) <= exp (ln (1 + x))" . |
54576 | 1850 |
thus ?thesis |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1851 |
by (metis exp_le_cancel_iff) |
51527 | 1852 |
qed |
1853 |
||
53079 | 1854 |
lemma ln_one_minus_pos_lower_bound: |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1855 |
fixes x::real |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1856 |
shows "0 <= x \<Longrightarrow> x <= (1 / 2) \<Longrightarrow> - x - 2 * x\<^sup>2 <= ln (1 - x)" |
51527 | 1857 |
proof - |
1858 |
assume a: "0 <= x" and b: "x <= (1 / 2)" |
|
53079 | 1859 |
from b have c: "x < 1" by auto |
51527 | 1860 |
then have "ln (1 - x) = - ln (1 + x / (1 - x))" |
54576 | 1861 |
apply (subst ln_inverse [symmetric]) |
1862 |
apply (simp add: field_simps) |
|
1863 |
apply (rule arg_cong [where f=ln]) |
|
1864 |
apply (simp add: field_simps) |
|
1865 |
done |
|
51527 | 1866 |
also have "- (x / (1 - x)) <= ..." |
53079 | 1867 |
proof - |
51527 | 1868 |
have "ln (1 + x / (1 - x)) <= x / (1 - x)" |
56571
f4635657d66f
added divide_nonneg_nonneg and co; made it a simp rule
hoelzl
parents:
56544
diff
changeset
|
1869 |
using a c by (intro ln_add_one_self_le_self) auto |
51527 | 1870 |
thus ?thesis |
1871 |
by auto |
|
1872 |
qed |
|
1873 |
also have "- (x / (1 - x)) = -x / (1 - x)" |
|
1874 |
by auto |
|
1875 |
finally have d: "- x / (1 - x) <= ln (1 - x)" . |
|
1876 |
have "0 < 1 - x" using a b by simp |
|
53076 | 1877 |
hence e: "-x - 2 * x\<^sup>2 <= - x / (1 - x)" |
51527 | 1878 |
using mult_right_le_one_le[of "x*x" "2*x"] a b |
53079 | 1879 |
by (simp add: field_simps power2_eq_square) |
53076 | 1880 |
from e d show "- x - 2 * x\<^sup>2 <= ln (1 - x)" |
51527 | 1881 |
by (rule order_trans) |
1882 |
qed |
|
1883 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1884 |
lemma ln_add_one_self_le_self2: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1885 |
fixes x::real shows "-1 < x \<Longrightarrow> ln(1 + x) <= x" |
51527 | 1886 |
apply (subgoal_tac "ln (1 + x) \<le> ln (exp x)", simp) |
1887 |
apply (subst ln_le_cancel_iff) |
|
1888 |
apply auto |
|
53079 | 1889 |
done |
51527 | 1890 |
|
1891 |
lemma abs_ln_one_plus_x_minus_x_bound_nonneg: |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1892 |
fixes x::real shows "0 <= x \<Longrightarrow> x <= 1 \<Longrightarrow> abs(ln (1 + x) - x) <= x\<^sup>2" |
51527 | 1893 |
proof - |
1894 |
assume x: "0 <= x" |
|
1895 |
assume x1: "x <= 1" |
|
1896 |
from x have "ln (1 + x) <= x" |
|
1897 |
by (rule ln_add_one_self_le_self) |
|
53079 | 1898 |
then have "ln (1 + x) - x <= 0" |
51527 | 1899 |
by simp |
1900 |
then have "abs(ln(1 + x) - x) = - (ln(1 + x) - x)" |
|
1901 |
by (rule abs_of_nonpos) |
|
53079 | 1902 |
also have "... = x - ln (1 + x)" |
51527 | 1903 |
by simp |
53076 | 1904 |
also have "... <= x\<^sup>2" |
51527 | 1905 |
proof - |
53076 | 1906 |
from x x1 have "x - x\<^sup>2 <= ln (1 + x)" |
51527 | 1907 |
by (intro ln_one_plus_pos_lower_bound) |
1908 |
thus ?thesis |
|
1909 |
by simp |
|
1910 |
qed |
|
1911 |
finally show ?thesis . |
|
1912 |
qed |
|
1913 |
||
1914 |
lemma abs_ln_one_plus_x_minus_x_bound_nonpos: |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1915 |
fixes x::real shows "-(1 / 2) <= x \<Longrightarrow> x <= 0 \<Longrightarrow> abs(ln (1 + x) - x) <= 2 * x\<^sup>2" |
51527 | 1916 |
proof - |
1917 |
assume a: "-(1 / 2) <= x" |
|
1918 |
assume b: "x <= 0" |
|
53079 | 1919 |
have "abs(ln (1 + x) - x) = x - ln(1 - (-x))" |
51527 | 1920 |
apply (subst abs_of_nonpos) |
1921 |
apply simp |
|
1922 |
apply (rule ln_add_one_self_le_self2) |
|
1923 |
using a apply auto |
|
1924 |
done |
|
53076 | 1925 |
also have "... <= 2 * x\<^sup>2" |
1926 |
apply (subgoal_tac "- (-x) - 2 * (-x)\<^sup>2 <= ln (1 - (-x))") |
|
51527 | 1927 |
apply (simp add: algebra_simps) |
1928 |
apply (rule ln_one_minus_pos_lower_bound) |
|
1929 |
using a b apply auto |
|
1930 |
done |
|
1931 |
finally show ?thesis . |
|
1932 |
qed |
|
1933 |
||
1934 |
lemma abs_ln_one_plus_x_minus_x_bound: |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1935 |
fixes x::real shows "abs x <= 1 / 2 \<Longrightarrow> abs(ln (1 + x) - x) <= 2 * x\<^sup>2" |
51527 | 1936 |
apply (case_tac "0 <= x") |
1937 |
apply (rule order_trans) |
|
1938 |
apply (rule abs_ln_one_plus_x_minus_x_bound_nonneg) |
|
1939 |
apply auto |
|
1940 |
apply (rule abs_ln_one_plus_x_minus_x_bound_nonpos) |
|
1941 |
apply auto |
|
53079 | 1942 |
done |
1943 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1944 |
lemma ln_x_over_x_mono: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1945 |
fixes x::real shows "exp 1 <= x \<Longrightarrow> x <= y \<Longrightarrow> (ln y / y) <= (ln x / x)" |
51527 | 1946 |
proof - |
1947 |
assume x: "exp 1 <= x" "x <= y" |
|
1948 |
moreover have "0 < exp (1::real)" by simp |
|
1949 |
ultimately have a: "0 < x" and b: "0 < y" |
|
1950 |
by (fast intro: less_le_trans order_trans)+ |
|
1951 |
have "x * ln y - x * ln x = x * (ln y - ln x)" |
|
1952 |
by (simp add: algebra_simps) |
|
1953 |
also have "... = x * ln(y / x)" |
|
1954 |
by (simp only: ln_div a b) |
|
1955 |
also have "y / x = (x + (y - x)) / x" |
|
1956 |
by simp |
|
1957 |
also have "... = 1 + (y - x) / x" |
|
1958 |
using x a by (simp add: field_simps) |
|
1959 |
also have "x * ln(1 + (y - x) / x) <= x * ((y - x) / x)" |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
1960 |
using x a |
56571
f4635657d66f
added divide_nonneg_nonneg and co; made it a simp rule
hoelzl
parents:
56544
diff
changeset
|
1961 |
by (intro mult_left_mono ln_add_one_self_le_self) simp_all |
51527 | 1962 |
also have "... = y - x" using a by simp |
1963 |
also have "... = (y - x) * ln (exp 1)" by simp |
|
1964 |
also have "... <= (y - x) * ln x" |
|
1965 |
apply (rule mult_left_mono) |
|
1966 |
apply (subst ln_le_cancel_iff) |
|
1967 |
apply fact |
|
1968 |
apply (rule a) |
|
1969 |
apply (rule x) |
|
1970 |
using x apply simp |
|
1971 |
done |
|
1972 |
also have "... = y * ln x - x * ln x" |
|
1973 |
by (rule left_diff_distrib) |
|
1974 |
finally have "x * ln y <= y * ln x" |
|
1975 |
by arith |
|
1976 |
then have "ln y <= (y * ln x) / x" using a by (simp add: field_simps) |
|
1977 |
also have "... = y * (ln x / x)" by simp |
|
1978 |
finally show ?thesis using b by (simp add: field_simps) |
|
1979 |
qed |
|
1980 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1981 |
lemma ln_le_minus_one: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1982 |
fixes x::real shows "0 < x \<Longrightarrow> ln x \<le> x - 1" |
51527 | 1983 |
using exp_ge_add_one_self[of "ln x"] by simp |
1984 |
||
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
1985 |
corollary ln_diff_le: |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
1986 |
fixes x::real |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
1987 |
shows "0 < x \<Longrightarrow> 0 < y \<Longrightarrow> ln x - ln y \<le> (x - y) / y" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
1988 |
by (simp add: ln_div [symmetric] diff_divide_distrib ln_le_minus_one) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
1989 |
|
51527 | 1990 |
lemma ln_eq_minus_one: |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1991 |
fixes x::real |
53079 | 1992 |
assumes "0 < x" "ln x = x - 1" |
1993 |
shows "x = 1" |
|
51527 | 1994 |
proof - |
53079 | 1995 |
let ?l = "\<lambda>y. ln y - y + 1" |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
1996 |
have D: "\<And>x::real. 0 < x \<Longrightarrow> DERIV ?l x :> (1 / x - 1)" |
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
1997 |
by (auto intro!: derivative_eq_intros) |
51527 | 1998 |
|
1999 |
show ?thesis |
|
2000 |
proof (cases rule: linorder_cases) |
|
2001 |
assume "x < 1" |
|
2002 |
from dense[OF `x < 1`] obtain a where "x < a" "a < 1" by blast |
|
2003 |
from `x < a` have "?l x < ?l a" |
|
2004 |
proof (rule DERIV_pos_imp_increasing, safe) |
|
53079 | 2005 |
fix y |
2006 |
assume "x \<le> y" "y \<le> a" |
|
51527 | 2007 |
with `0 < x` `a < 1` have "0 < 1 / y - 1" "0 < y" |
2008 |
by (auto simp: field_simps) |
|
2009 |
with D show "\<exists>z. DERIV ?l y :> z \<and> 0 < z" |
|
2010 |
by auto |
|
2011 |
qed |
|
2012 |
also have "\<dots> \<le> 0" |
|
2013 |
using ln_le_minus_one `0 < x` `x < a` by (auto simp: field_simps) |
|
2014 |
finally show "x = 1" using assms by auto |
|
2015 |
next |
|
2016 |
assume "1 < x" |
|
53079 | 2017 |
from dense[OF this] obtain a where "1 < a" "a < x" by blast |
51527 | 2018 |
from `a < x` have "?l x < ?l a" |
2019 |
proof (rule DERIV_neg_imp_decreasing, safe) |
|
53079 | 2020 |
fix y |
2021 |
assume "a \<le> y" "y \<le> x" |
|
51527 | 2022 |
with `1 < a` have "1 / y - 1 < 0" "0 < y" |
2023 |
by (auto simp: field_simps) |
|
2024 |
with D show "\<exists>z. DERIV ?l y :> z \<and> z < 0" |
|
2025 |
by blast |
|
2026 |
qed |
|
2027 |
also have "\<dots> \<le> 0" |
|
2028 |
using ln_le_minus_one `1 < a` by (auto simp: field_simps) |
|
2029 |
finally show "x = 1" using assms by auto |
|
53079 | 2030 |
next |
2031 |
assume "x = 1" |
|
2032 |
then show ?thesis by simp |
|
2033 |
qed |
|
51527 | 2034 |
qed |
2035 |
||
50326 | 2036 |
lemma exp_at_bot: "(exp ---> (0::real)) at_bot" |
2037 |
unfolding tendsto_Zfun_iff |
|
2038 |
proof (rule ZfunI, simp add: eventually_at_bot_dense) |
|
2039 |
fix r :: real assume "0 < r" |
|
53079 | 2040 |
{ |
2041 |
fix x |
|
2042 |
assume "x < ln r" |
|
50326 | 2043 |
then have "exp x < exp (ln r)" |
2044 |
by simp |
|
2045 |
with `0 < r` have "exp x < r" |
|
53079 | 2046 |
by simp |
2047 |
} |
|
50326 | 2048 |
then show "\<exists>k. \<forall>n<k. exp n < r" by auto |
2049 |
qed |
|
2050 |
||
2051 |
lemma exp_at_top: "LIM x at_top. exp x :: real :> at_top" |
|
50346
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
2052 |
by (rule filterlim_at_top_at_top[where Q="\<lambda>x. True" and P="\<lambda>x. 0 < x" and g="ln"]) |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
2053 |
(auto intro: eventually_gt_at_top) |
50326 | 2054 |
|
59613
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2055 |
lemma lim_exp_minus_1: |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2056 |
fixes x :: "'a::{real_normed_field,banach}" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2057 |
shows "((\<lambda>z::'a. (exp(z) - 1) / z) ---> 1) (at 0)" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2058 |
proof - |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2059 |
have "((\<lambda>z::'a. exp(z) - 1) has_field_derivative 1) (at 0)" |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2060 |
by (intro derivative_eq_intros | simp)+ |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2061 |
then show ?thesis |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2062 |
by (simp add: Deriv.DERIV_iff2) |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2063 |
qed |
7103019278f0
The function frac. Various lemmas about limits, series, the exp function, etc.
paulson <lp15@cam.ac.uk>
parents:
59587
diff
changeset
|
2064 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2065 |
lemma ln_at_0: "LIM x at_right 0. ln (x::real) :> at_bot" |
50346
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
2066 |
by (rule filterlim_at_bot_at_right[where Q="\<lambda>x. 0 < x" and P="\<lambda>x. True" and g="exp"]) |
51641
cd05e9fcc63d
remove the within-filter, replace "at" by "at _ within UNIV" (This allows to remove a couple of redundant lemmas)
hoelzl
parents:
51527
diff
changeset
|
2067 |
(auto simp: eventually_at_filter) |
50326 | 2068 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2069 |
lemma ln_at_top: "LIM x at_top. ln (x::real) :> at_top" |
50346
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
2070 |
by (rule filterlim_at_top_at_top[where Q="\<lambda>x. 0 < x" and P="\<lambda>x. True" and g="exp"]) |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
2071 |
(auto intro: eventually_gt_at_top) |
50326 | 2072 |
|
50347 | 2073 |
lemma tendsto_power_div_exp_0: "((\<lambda>x. x ^ k / exp x) ---> (0::real)) at_top" |
2074 |
proof (induct k) |
|
53079 | 2075 |
case 0 |
50347 | 2076 |
show "((\<lambda>x. x ^ 0 / exp x) ---> (0::real)) at_top" |
2077 |
by (simp add: inverse_eq_divide[symmetric]) |
|
2078 |
(metis filterlim_compose[OF tendsto_inverse_0] exp_at_top filterlim_mono |
|
2079 |
at_top_le_at_infinity order_refl) |
|
2080 |
next |
|
2081 |
case (Suc k) |
|
2082 |
show ?case |
|
2083 |
proof (rule lhospital_at_top_at_top) |
|
2084 |
show "eventually (\<lambda>x. DERIV (\<lambda>x. x ^ Suc k) x :> (real (Suc k) * x^k)) at_top" |
|
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
2085 |
by eventually_elim (intro derivative_eq_intros, auto) |
50347 | 2086 |
show "eventually (\<lambda>x. DERIV exp x :> exp x) at_top" |
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
2087 |
by eventually_elim auto |
50347 | 2088 |
show "eventually (\<lambda>x. exp x \<noteq> 0) at_top" |
2089 |
by auto |
|
2090 |
from tendsto_mult[OF tendsto_const Suc, of "real (Suc k)"] |
|
2091 |
show "((\<lambda>x. real (Suc k) * x ^ k / exp x) ---> 0) at_top" |
|
2092 |
by simp |
|
2093 |
qed (rule exp_at_top) |
|
2094 |
qed |
|
2095 |
||
51527 | 2096 |
|
53079 | 2097 |
definition log :: "[real,real] => real" |
2098 |
-- {*logarithm of @{term x} to base @{term a}*} |
|
2099 |
where "log a x = ln x / ln a" |
|
51527 | 2100 |
|
2101 |
||
2102 |
lemma tendsto_log [tendsto_intros]: |
|
2103 |
"\<lbrakk>(f ---> a) F; (g ---> b) F; 0 < a; a \<noteq> 1; 0 < b\<rbrakk> \<Longrightarrow> ((\<lambda>x. log (f x) (g x)) ---> log a b) F" |
|
2104 |
unfolding log_def by (intro tendsto_intros) auto |
|
2105 |
||
2106 |
lemma continuous_log: |
|
53079 | 2107 |
assumes "continuous F f" |
2108 |
and "continuous F g" |
|
2109 |
and "0 < f (Lim F (\<lambda>x. x))" |
|
2110 |
and "f (Lim F (\<lambda>x. x)) \<noteq> 1" |
|
2111 |
and "0 < g (Lim F (\<lambda>x. x))" |
|
51527 | 2112 |
shows "continuous F (\<lambda>x. log (f x) (g x))" |
2113 |
using assms unfolding continuous_def by (rule tendsto_log) |
|
2114 |
||
2115 |
lemma continuous_at_within_log[continuous_intros]: |
|
53079 | 2116 |
assumes "continuous (at a within s) f" |
2117 |
and "continuous (at a within s) g" |
|
2118 |
and "0 < f a" |
|
2119 |
and "f a \<noteq> 1" |
|
2120 |
and "0 < g a" |
|
51527 | 2121 |
shows "continuous (at a within s) (\<lambda>x. log (f x) (g x))" |
2122 |
using assms unfolding continuous_within by (rule tendsto_log) |
|
2123 |
||
2124 |
lemma isCont_log[continuous_intros, simp]: |
|
2125 |
assumes "isCont f a" "isCont g a" "0 < f a" "f a \<noteq> 1" "0 < g a" |
|
2126 |
shows "isCont (\<lambda>x. log (f x) (g x)) a" |
|
2127 |
using assms unfolding continuous_at by (rule tendsto_log) |
|
2128 |
||
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
2129 |
lemma continuous_on_log[continuous_intros]: |
53079 | 2130 |
assumes "continuous_on s f" "continuous_on s g" |
2131 |
and "\<forall>x\<in>s. 0 < f x" "\<forall>x\<in>s. f x \<noteq> 1" "\<forall>x\<in>s. 0 < g x" |
|
51527 | 2132 |
shows "continuous_on s (\<lambda>x. log (f x) (g x))" |
2133 |
using assms unfolding continuous_on_def by (fast intro: tendsto_log) |
|
2134 |
||
2135 |
lemma powr_one_eq_one [simp]: "1 powr a = 1" |
|
53079 | 2136 |
by (simp add: powr_def) |
51527 | 2137 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2138 |
lemma powr_zero_eq_one [simp]: "x powr 0 = (if x=0 then 0 else 1)" |
53079 | 2139 |
by (simp add: powr_def) |
51527 | 2140 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2141 |
lemma powr_one_gt_zero_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2142 |
fixes x::real shows "(x powr 1 = x) = (0 \<le> x)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2143 |
by (auto simp: powr_def) |
51527 | 2144 |
declare powr_one_gt_zero_iff [THEN iffD2, simp] |
2145 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2146 |
lemma powr_mult: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2147 |
fixes x::real shows "0 \<le> x \<Longrightarrow> 0 \<le> y \<Longrightarrow> (x * y) powr a = (x powr a) * (y powr a)" |
53079 | 2148 |
by (simp add: powr_def exp_add [symmetric] ln_mult distrib_left) |
51527 | 2149 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2150 |
lemma powr_ge_pzero [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2151 |
fixes x::real shows "0 <= x powr y" |
53079 | 2152 |
by (simp add: powr_def) |
51527 | 2153 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2154 |
lemma powr_divide: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2155 |
fixes x::real shows "0 < x \<Longrightarrow> 0 < y \<Longrightarrow> (x / y) powr a = (x powr a) / (y powr a)" |
53079 | 2156 |
apply (simp add: divide_inverse positive_imp_inverse_positive powr_mult) |
2157 |
apply (simp add: powr_def exp_minus [symmetric] exp_add [symmetric] ln_inverse) |
|
2158 |
done |
|
51527 | 2159 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2160 |
lemma powr_divide2: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2161 |
fixes x::real shows "x powr a / x powr b = x powr (a - b)" |
51527 | 2162 |
apply (simp add: powr_def) |
2163 |
apply (subst exp_diff [THEN sym]) |
|
2164 |
apply (simp add: left_diff_distrib) |
|
53079 | 2165 |
done |
51527 | 2166 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2167 |
lemma powr_add: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2168 |
fixes x::real shows "x powr (a + b) = (x powr a) * (x powr b)" |
53079 | 2169 |
by (simp add: powr_def exp_add [symmetric] distrib_right) |
2170 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2171 |
lemma powr_mult_base: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2172 |
fixes x::real shows "0 < x \<Longrightarrow>x * x powr y = x powr (1 + y)" |
53079 | 2173 |
using assms by (auto simp: powr_add) |
51527 | 2174 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2175 |
lemma powr_powr: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2176 |
fixes x::real shows "(x powr a) powr b = x powr (a * b)" |
53079 | 2177 |
by (simp add: powr_def) |
51527 | 2178 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2179 |
lemma powr_powr_swap: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2180 |
fixes x::real shows "(x powr a) powr b = (x powr b) powr a" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
2181 |
by (simp add: powr_powr mult.commute) |
51527 | 2182 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2183 |
lemma powr_minus: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2184 |
fixes x::real shows "x powr (-a) = inverse (x powr a)" |
53079 | 2185 |
by (simp add: powr_def exp_minus [symmetric]) |
51527 | 2186 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2187 |
lemma powr_minus_divide: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2188 |
fixes x::real shows "x powr (-a) = 1/(x powr a)" |
53079 | 2189 |
by (simp add: divide_inverse powr_minus) |
2190 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2191 |
lemma divide_powr_uminus: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2192 |
fixes a::real shows "a / b powr c = a * b powr (- c)" |
58984
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2193 |
by (simp add: powr_minus_divide) |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2194 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2195 |
lemma powr_less_mono: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2196 |
fixes x::real shows "a < b \<Longrightarrow> 1 < x \<Longrightarrow> x powr a < x powr b" |
53079 | 2197 |
by (simp add: powr_def) |
2198 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2199 |
lemma powr_less_cancel: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2200 |
fixes x::real shows "x powr a < x powr b \<Longrightarrow> 1 < x \<Longrightarrow> a < b" |
53079 | 2201 |
by (simp add: powr_def) |
2202 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2203 |
lemma powr_less_cancel_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2204 |
fixes x::real shows "1 < x \<Longrightarrow> (x powr a < x powr b) = (a < b)" |
53079 | 2205 |
by (blast intro: powr_less_cancel powr_less_mono) |
2206 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2207 |
lemma powr_le_cancel_iff [simp]: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2208 |
fixes x::real shows "1 < x \<Longrightarrow> (x powr a \<le> x powr b) = (a \<le> b)" |
53079 | 2209 |
by (simp add: linorder_not_less [symmetric]) |
51527 | 2210 |
|
2211 |
lemma log_ln: "ln x = log (exp(1)) x" |
|
53079 | 2212 |
by (simp add: log_def) |
2213 |
||
2214 |
lemma DERIV_log: |
|
2215 |
assumes "x > 0" |
|
2216 |
shows "DERIV (\<lambda>y. log b y) x :> 1 / (ln b * x)" |
|
51527 | 2217 |
proof - |
2218 |
def lb \<equiv> "1 / ln b" |
|
2219 |
moreover have "DERIV (\<lambda>y. lb * ln y) x :> lb / x" |
|
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
2220 |
using `x > 0` by (auto intro!: derivative_eq_intros) |
51527 | 2221 |
ultimately show ?thesis |
2222 |
by (simp add: log_def) |
|
2223 |
qed |
|
2224 |
||
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
2225 |
lemmas DERIV_log[THEN DERIV_chain2, derivative_intros] |
51527 | 2226 |
|
53079 | 2227 |
lemma powr_log_cancel [simp]: "0 < a \<Longrightarrow> a \<noteq> 1 \<Longrightarrow> 0 < x \<Longrightarrow> a powr (log a x) = x" |
2228 |
by (simp add: powr_def log_def) |
|
2229 |
||
2230 |
lemma log_powr_cancel [simp]: "0 < a \<Longrightarrow> a \<noteq> 1 \<Longrightarrow> log a (a powr y) = y" |
|
2231 |
by (simp add: log_def powr_def) |
|
2232 |
||
2233 |
lemma log_mult: |
|
2234 |
"0 < a \<Longrightarrow> a \<noteq> 1 \<Longrightarrow> 0 < x \<Longrightarrow> 0 < y \<Longrightarrow> |
|
2235 |
log a (x * y) = log a x + log a y" |
|
2236 |
by (simp add: log_def ln_mult divide_inverse distrib_right) |
|
2237 |
||
2238 |
lemma log_eq_div_ln_mult_log: |
|
2239 |
"0 < a \<Longrightarrow> a \<noteq> 1 \<Longrightarrow> 0 < b \<Longrightarrow> b \<noteq> 1 \<Longrightarrow> 0 < x \<Longrightarrow> |
|
2240 |
log a x = (ln b/ln a) * log b x" |
|
2241 |
by (simp add: log_def divide_inverse) |
|
51527 | 2242 |
|
2243 |
text{*Base 10 logarithms*} |
|
53079 | 2244 |
lemma log_base_10_eq1: "0 < x \<Longrightarrow> log 10 x = (ln (exp 1) / ln 10) * ln x" |
2245 |
by (simp add: log_def) |
|
2246 |
||
2247 |
lemma log_base_10_eq2: "0 < x \<Longrightarrow> log 10 x = (log 10 (exp 1)) * ln x" |
|
2248 |
by (simp add: log_def) |
|
51527 | 2249 |
|
2250 |
lemma log_one [simp]: "log a 1 = 0" |
|
53079 | 2251 |
by (simp add: log_def) |
51527 | 2252 |
|
2253 |
lemma log_eq_one [simp]: "[| 0 < a; a \<noteq> 1 |] ==> log a a = 1" |
|
53079 | 2254 |
by (simp add: log_def) |
2255 |
||
2256 |
lemma log_inverse: "0 < a \<Longrightarrow> a \<noteq> 1 \<Longrightarrow> 0 < x \<Longrightarrow> log a (inverse x) = - log a x" |
|
2257 |
apply (rule_tac a1 = "log a x" in add_left_cancel [THEN iffD1]) |
|
2258 |
apply (simp add: log_mult [symmetric]) |
|
2259 |
done |
|
2260 |
||
2261 |
lemma log_divide: "0 < a \<Longrightarrow> a \<noteq> 1 \<Longrightarrow> 0 < x \<Longrightarrow> 0 < y \<Longrightarrow> log a (x/y) = log a x - log a y" |
|
2262 |
by (simp add: log_mult divide_inverse log_inverse) |
|
51527 | 2263 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2264 |
lemma powr_gt_zero [simp]: "0 < x powr a \<longleftrightarrow> (x::real) \<noteq> 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2265 |
by (simp add: powr_def) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2266 |
|
58984
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2267 |
lemma log_add_eq_powr: "0 < b \<Longrightarrow> b \<noteq> 1 \<Longrightarrow> 0 < x \<Longrightarrow> log b x + y = log b (x * b powr y)" |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2268 |
and add_log_eq_powr: "0 < b \<Longrightarrow> b \<noteq> 1 \<Longrightarrow> 0 < x \<Longrightarrow> y + log b x = log b (b powr y * x)" |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2269 |
and log_minus_eq_powr: "0 < b \<Longrightarrow> b \<noteq> 1 \<Longrightarrow> 0 < x \<Longrightarrow> log b x - y = log b (x * b powr -y)" |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2270 |
and minus_log_eq_powr: "0 < b \<Longrightarrow> b \<noteq> 1 \<Longrightarrow> 0 < x \<Longrightarrow> y - log b x = log b (b powr y / x)" |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2271 |
by (simp_all add: log_mult log_divide) |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2272 |
|
51527 | 2273 |
lemma log_less_cancel_iff [simp]: |
53079 | 2274 |
"1 < a \<Longrightarrow> 0 < x \<Longrightarrow> 0 < y \<Longrightarrow> log a x < log a y \<longleftrightarrow> x < y" |
2275 |
apply safe |
|
2276 |
apply (rule_tac [2] powr_less_cancel) |
|
2277 |
apply (drule_tac a = "log a x" in powr_less_mono, auto) |
|
2278 |
done |
|
2279 |
||
2280 |
lemma log_inj: |
|
2281 |
assumes "1 < b" |
|
2282 |
shows "inj_on (log b) {0 <..}" |
|
51527 | 2283 |
proof (rule inj_onI, simp) |
53079 | 2284 |
fix x y |
2285 |
assume pos: "0 < x" "0 < y" and *: "log b x = log b y" |
|
51527 | 2286 |
show "x = y" |
2287 |
proof (cases rule: linorder_cases) |
|
53079 | 2288 |
assume "x = y" |
2289 |
then show ?thesis by simp |
|
2290 |
next |
|
51527 | 2291 |
assume "x < y" hence "log b x < log b y" |
2292 |
using log_less_cancel_iff[OF `1 < b`] pos by simp |
|
53079 | 2293 |
then show ?thesis using * by simp |
51527 | 2294 |
next |
2295 |
assume "y < x" hence "log b y < log b x" |
|
2296 |
using log_less_cancel_iff[OF `1 < b`] pos by simp |
|
53079 | 2297 |
then show ?thesis using * by simp |
2298 |
qed |
|
51527 | 2299 |
qed |
2300 |
||
2301 |
lemma log_le_cancel_iff [simp]: |
|
53079 | 2302 |
"1 < a \<Longrightarrow> 0 < x \<Longrightarrow> 0 < y \<Longrightarrow> (log a x \<le> log a y) = (x \<le> y)" |
2303 |
by (simp add: linorder_not_less [symmetric]) |
|
51527 | 2304 |
|
2305 |
lemma zero_less_log_cancel_iff[simp]: "1 < a \<Longrightarrow> 0 < x \<Longrightarrow> 0 < log a x \<longleftrightarrow> 1 < x" |
|
2306 |
using log_less_cancel_iff[of a 1 x] by simp |
|
2307 |
||
2308 |
lemma zero_le_log_cancel_iff[simp]: "1 < a \<Longrightarrow> 0 < x \<Longrightarrow> 0 \<le> log a x \<longleftrightarrow> 1 \<le> x" |
|
2309 |
using log_le_cancel_iff[of a 1 x] by simp |
|
2310 |
||
2311 |
lemma log_less_zero_cancel_iff[simp]: "1 < a \<Longrightarrow> 0 < x \<Longrightarrow> log a x < 0 \<longleftrightarrow> x < 1" |
|
2312 |
using log_less_cancel_iff[of a x 1] by simp |
|
2313 |
||
2314 |
lemma log_le_zero_cancel_iff[simp]: "1 < a \<Longrightarrow> 0 < x \<Longrightarrow> log a x \<le> 0 \<longleftrightarrow> x \<le> 1" |
|
2315 |
using log_le_cancel_iff[of a x 1] by simp |
|
2316 |
||
2317 |
lemma one_less_log_cancel_iff[simp]: "1 < a \<Longrightarrow> 0 < x \<Longrightarrow> 1 < log a x \<longleftrightarrow> a < x" |
|
2318 |
using log_less_cancel_iff[of a a x] by simp |
|
2319 |
||
2320 |
lemma one_le_log_cancel_iff[simp]: "1 < a \<Longrightarrow> 0 < x \<Longrightarrow> 1 \<le> log a x \<longleftrightarrow> a \<le> x" |
|
2321 |
using log_le_cancel_iff[of a a x] by simp |
|
2322 |
||
2323 |
lemma log_less_one_cancel_iff[simp]: "1 < a \<Longrightarrow> 0 < x \<Longrightarrow> log a x < 1 \<longleftrightarrow> x < a" |
|
2324 |
using log_less_cancel_iff[of a x a] by simp |
|
2325 |
||
2326 |
lemma log_le_one_cancel_iff[simp]: "1 < a \<Longrightarrow> 0 < x \<Longrightarrow> log a x \<le> 1 \<longleftrightarrow> x \<le> a" |
|
2327 |
using log_le_cancel_iff[of a x a] by simp |
|
2328 |
||
58984
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2329 |
lemma le_log_iff: |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2330 |
assumes "1 < b" "x > 0" |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2331 |
shows "y \<le> log b x \<longleftrightarrow> b powr y \<le> (x::real)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2332 |
using assms |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2333 |
apply auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2334 |
apply (metis (no_types, hide_lams) less_irrefl less_le_trans linear powr_le_cancel_iff |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2335 |
powr_log_cancel zero_less_one) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2336 |
apply (metis not_less order.trans order_refl powr_le_cancel_iff powr_log_cancel zero_le_one) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2337 |
done |
58984
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2338 |
|
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2339 |
lemma less_log_iff: |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2340 |
assumes "1 < b" "x > 0" |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2341 |
shows "y < log b x \<longleftrightarrow> b powr y < x" |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2342 |
by (metis assms dual_order.strict_trans less_irrefl powr_less_cancel_iff |
58984
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2343 |
powr_log_cancel zero_less_one) |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2344 |
|
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2345 |
lemma |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2346 |
assumes "1 < b" "x > 0" |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2347 |
shows log_less_iff: "log b x < y \<longleftrightarrow> x < b powr y" |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2348 |
and log_le_iff: "log b x \<le> y \<longleftrightarrow> x \<le> b powr y" |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2349 |
using le_log_iff[OF assms, of y] less_log_iff[OF assms, of y] |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2350 |
by auto |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2351 |
|
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2352 |
lemmas powr_le_iff = le_log_iff[symmetric] |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2353 |
and powr_less_iff = le_log_iff[symmetric] |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2354 |
and less_powr_iff = log_less_iff[symmetric] |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2355 |
and le_powr_iff = log_le_iff[symmetric] |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2356 |
|
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2357 |
lemma |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2358 |
floor_log_eq_powr_iff: "x > 0 \<Longrightarrow> b > 1 \<Longrightarrow> \<lfloor>log b x\<rfloor> = k \<longleftrightarrow> b powr k \<le> x \<and> x < b powr (k + 1)" |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2359 |
by (auto simp add: floor_eq_iff powr_le_iff less_powr_iff) |
ae0c56c485ae
added lemmas: convert between powr and log in comparisons, pull log out of addition/subtraction
immler
parents:
58981
diff
changeset
|
2360 |
|
51527 | 2361 |
lemma powr_realpow: "0 < x ==> x powr (real n) = x^n" |
53079 | 2362 |
apply (induct n) |
2363 |
apply simp |
|
51527 | 2364 |
apply (subgoal_tac "real(Suc n) = real n + 1") |
2365 |
apply (erule ssubst) |
|
2366 |
apply (subst powr_add, simp, simp) |
|
53079 | 2367 |
done |
51527 | 2368 |
|
54489
03ff4d1e6784
eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents:
54230
diff
changeset
|
2369 |
lemma powr_realpow_numeral: "0 < x \<Longrightarrow> x powr (numeral n :: real) = x ^ (numeral n)" |
03ff4d1e6784
eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents:
54230
diff
changeset
|
2370 |
unfolding real_of_nat_numeral [symmetric] by (rule powr_realpow) |
52139 | 2371 |
|
57180 | 2372 |
lemma powr2_sqrt[simp]: "0 < x \<Longrightarrow> sqrt x powr 2 = x" |
2373 |
by(simp add: powr_realpow_numeral) |
|
2374 |
||
51527 | 2375 |
lemma powr_realpow2: "0 <= x ==> 0 < n ==> x^n = (if (x = 0) then 0 else x powr (real n))" |
2376 |
apply (case_tac "x = 0", simp, simp) |
|
2377 |
apply (rule powr_realpow [THEN sym], simp) |
|
53079 | 2378 |
done |
51527 | 2379 |
|
2380 |
lemma powr_int: |
|
2381 |
assumes "x > 0" |
|
2382 |
shows "x powr i = (if i \<ge> 0 then x ^ nat i else 1 / x ^ nat (-i))" |
|
53079 | 2383 |
proof (cases "i < 0") |
2384 |
case True |
|
51527 | 2385 |
have r: "x powr i = 1 / x powr (-i)" by (simp add: powr_minus field_simps) |
2386 |
show ?thesis using `i < 0` `x > 0` by (simp add: r field_simps powr_realpow[symmetric]) |
|
53079 | 2387 |
next |
2388 |
case False |
|
2389 |
then show ?thesis by (simp add: assms powr_realpow[symmetric]) |
|
2390 |
qed |
|
51527 | 2391 |
|
58981 | 2392 |
lemma compute_powr[code]: |
2393 |
fixes i::real |
|
2394 |
shows "b powr i = |
|
2395 |
(if b \<le> 0 then Code.abort (STR ''op powr with nonpositive base'') (\<lambda>_. b powr i) |
|
59587
8ea7b22525cb
Removed the obsolete functions "natfloor" and "natceiling"
nipkow
parents:
58984
diff
changeset
|
2396 |
else if floor i = i then (if 0 \<le> i then b ^ nat(floor i) else 1 / b ^ nat(floor (- i))) |
58981 | 2397 |
else Code.abort (STR ''op powr with non-integer exponent'') (\<lambda>_. b powr i))" |
59587
8ea7b22525cb
Removed the obsolete functions "natfloor" and "natceiling"
nipkow
parents:
58984
diff
changeset
|
2398 |
by (auto simp: powr_int) |
58981 | 2399 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2400 |
lemma powr_one: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2401 |
fixes x::real shows "0 \<le> x \<Longrightarrow> x powr 1 = x" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2402 |
using powr_realpow [of x 1] |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2403 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2404 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2405 |
lemma powr_numeral: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2406 |
fixes x::real shows "0 < x \<Longrightarrow> x powr numeral n = x ^ numeral n" |
54489
03ff4d1e6784
eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents:
54230
diff
changeset
|
2407 |
by (fact powr_realpow_numeral) |
03ff4d1e6784
eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents:
54230
diff
changeset
|
2408 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2409 |
lemma powr_neg_one: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2410 |
fixes x::real shows "0 < x \<Longrightarrow> x powr - 1 = 1 / x" |
54489
03ff4d1e6784
eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents:
54230
diff
changeset
|
2411 |
using powr_int [of x "- 1"] by simp |
03ff4d1e6784
eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents:
54230
diff
changeset
|
2412 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2413 |
lemma powr_neg_numeral: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2414 |
fixes x::real shows "0 < x \<Longrightarrow> x powr - numeral n = 1 / x ^ numeral n" |
54489
03ff4d1e6784
eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents:
54230
diff
changeset
|
2415 |
using powr_int [of x "- numeral n"] by simp |
51527 | 2416 |
|
53079 | 2417 |
lemma root_powr_inverse: "0 < n \<Longrightarrow> 0 < x \<Longrightarrow> root n x = x powr (1/n)" |
51527 | 2418 |
by (rule real_root_pos_unique) (auto simp: powr_realpow[symmetric] powr_powr) |
2419 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2420 |
lemma ln_powr: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2421 |
fixes x::real shows "x \<noteq> 0 \<Longrightarrow> ln (x powr y) = y * ln x" |
56483 | 2422 |
by (simp add: powr_def) |
2423 |
||
56952 | 2424 |
lemma ln_root: "\<lbrakk> n > 0; b > 0 \<rbrakk> \<Longrightarrow> ln (root n b) = ln b / n" |
2425 |
by(simp add: root_powr_inverse ln_powr) |
|
2426 |
||
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2427 |
lemma ln_sqrt: "0 < x \<Longrightarrow> ln (sqrt x) = ln x / 2" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
2428 |
by (simp add: ln_powr powr_numeral ln_powr[symmetric] mult.commute) |
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2429 |
|
56952 | 2430 |
lemma log_root: "\<lbrakk> n > 0; a > 0 \<rbrakk> \<Longrightarrow> log b (root n a) = log b a / n" |
2431 |
by(simp add: log_def ln_root) |
|
2432 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2433 |
lemma log_powr: "x \<noteq> 0 \<Longrightarrow> log b (x powr y) = y * log b x" |
56483 | 2434 |
by (simp add: log_def ln_powr) |
2435 |
||
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2436 |
lemma log_nat_power: "0 < x \<Longrightarrow> log b (x^n) = real n * log b x" |
56483 | 2437 |
by (simp add: log_powr powr_realpow [symmetric]) |
2438 |
||
2439 |
lemma log_base_change: "0 < a \<Longrightarrow> a \<noteq> 1 \<Longrightarrow> log b x = log a x / log a b" |
|
2440 |
by (simp add: log_def) |
|
2441 |
||
2442 |
lemma log_base_pow: "0 < a \<Longrightarrow> log (a ^ n) x = log a x / n" |
|
2443 |
by (simp add: log_def ln_realpow) |
|
2444 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2445 |
lemma log_base_powr: "a \<noteq> 0 \<Longrightarrow> log (a powr b) x = log a x / b" |
56483 | 2446 |
by (simp add: log_def ln_powr) |
51527 | 2447 |
|
56952 | 2448 |
lemma log_base_root: "\<lbrakk> n > 0; b > 0 \<rbrakk> \<Longrightarrow> log (root n b) x = n * (log b x)" |
2449 |
by(simp add: log_def ln_root) |
|
2450 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2451 |
lemma ln_bound: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2452 |
fixes x::real shows "1 <= x ==> ln x <= x" |
51527 | 2453 |
apply (subgoal_tac "ln(1 + (x - 1)) <= x - 1") |
2454 |
apply simp |
|
2455 |
apply (rule ln_add_one_self_le_self, simp) |
|
53079 | 2456 |
done |
51527 | 2457 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2458 |
lemma powr_mono: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2459 |
fixes x::real shows "a <= b ==> 1 <= x ==> x powr a <= x powr b" |
53079 | 2460 |
apply (cases "x = 1", simp) |
2461 |
apply (cases "a = b", simp) |
|
51527 | 2462 |
apply (rule order_less_imp_le) |
2463 |
apply (rule powr_less_mono, auto) |
|
53079 | 2464 |
done |
51527 | 2465 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2466 |
lemma ge_one_powr_ge_zero: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2467 |
fixes x::real shows "1 <= x ==> 0 <= a ==> 1 <= x powr a" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2468 |
using powr_mono by fastforce |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2469 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2470 |
lemma powr_less_mono2: |
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2471 |
fixes x::real shows "0 < a ==> 0 \<le> x ==> x < y ==> x powr a < y powr a" |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2472 |
by (simp add: powr_def) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2473 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2474 |
lemma powr_less_mono2_neg: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2475 |
fixes x::real shows "a < 0 ==> 0 < x ==> x < y ==> y powr a < x powr a" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2476 |
by (simp add: powr_def) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2477 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2478 |
lemma powr_mono2: |
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2479 |
fixes x::real shows "0 <= a ==> 0 \<le> x ==> x <= y ==> x powr a <= y powr a" |
51527 | 2480 |
apply (case_tac "a = 0", simp) |
2481 |
apply (case_tac "x = y", simp) |
|
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2482 |
apply (metis dual_order.strict_iff_order powr_less_mono2) |
53079 | 2483 |
done |
2484 |
||
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2485 |
lemma powr_inj: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2486 |
fixes x::real shows "0 < a \<Longrightarrow> a \<noteq> 1 \<Longrightarrow> a powr x = a powr y \<longleftrightarrow> x = y" |
51527 | 2487 |
unfolding powr_def exp_inj_iff by simp |
2488 |
||
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2489 |
lemma powr_half_sqrt: "0 \<le> x \<Longrightarrow> x powr (1/2) = sqrt x" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2490 |
by (simp add: powr_def root_powr_inverse sqrt_def) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2491 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2492 |
lemma ln_powr_bound: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2493 |
fixes x::real shows "1 <= x ==> 0 < a ==> ln x <= (x powr a) / a" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2494 |
by (metis exp_gt_zero linear ln_eq_zero_iff ln_exp ln_less_self ln_powr mult.commute mult_imp_le_div_pos not_less powr_gt_zero) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2495 |
|
51527 | 2496 |
|
2497 |
lemma ln_powr_bound2: |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2498 |
fixes x::real |
51527 | 2499 |
assumes "1 < x" and "0 < a" |
2500 |
shows "(ln x) powr a <= (a powr a) * x" |
|
2501 |
proof - |
|
2502 |
from assms have "ln x <= (x powr (1 / a)) / (1 / a)" |
|
54575 | 2503 |
by (metis less_eq_real_def ln_powr_bound zero_less_divide_1_iff) |
51527 | 2504 |
also have "... = a * (x powr (1 / a))" |
2505 |
by simp |
|
2506 |
finally have "(ln x) powr a <= (a * (x powr (1 / a))) powr a" |
|
54575 | 2507 |
by (metis assms less_imp_le ln_gt_zero powr_mono2) |
51527 | 2508 |
also have "... = (a powr a) * ((x powr (1 / a)) powr a)" |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2509 |
using assms powr_mult by auto |
51527 | 2510 |
also have "(x powr (1 / a)) powr a = x powr ((1 / a) * a)" |
2511 |
by (rule powr_powr) |
|
54575 | 2512 |
also have "... = x" using assms |
2513 |
by auto |
|
51527 | 2514 |
finally show ?thesis . |
2515 |
qed |
|
2516 |
||
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2517 |
lemma tendsto_powr [tendsto_intros]: |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2518 |
fixes a::real |
60141
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2519 |
assumes f: "(f ---> a) F" and g: "(g ---> b) F" and a: "a \<noteq> 0" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2520 |
shows "((\<lambda>x. f x powr g x) ---> a powr b) F" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2521 |
proof - |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2522 |
{ fix S :: "real set" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2523 |
obtain T where "open T" "a \<in> T" "0 \<notin> T" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2524 |
using t1_space a by blast |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2525 |
then have "eventually (\<lambda>x. f x = 0 \<longrightarrow> 0 \<in> S) F" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2526 |
using f |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2527 |
by (simp add: tendsto_def) (metis (mono_tags, lifting) eventually_mono) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2528 |
} |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2529 |
moreover |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2530 |
{ fix S :: "real set" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2531 |
assume S: "open S" "exp (b * ln a) \<in> S" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2532 |
then have "((\<lambda>x. exp (g x * ln (f x))) ---> exp (b * ln a)) F" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2533 |
using f g a |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2534 |
by (intro tendsto_intros) auto |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2535 |
then have "eventually (\<lambda>x. f x \<noteq> 0 \<longrightarrow> exp (g x * ln (f x)) \<in> S) F" |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2536 |
using f S |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2537 |
by (simp add: tendsto_def) (metis (mono_tags, lifting) eventually_mono) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2538 |
} |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2539 |
ultimately show ?thesis using assms |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2540 |
by (simp add: powr_def tendsto_def eventually_conj_iff) |
833adf7db7d8
New material, mostly about limits. Consolidation.
paulson <lp15@cam.ac.uk>
parents:
60036
diff
changeset
|
2541 |
qed |
51527 | 2542 |
|
2543 |
lemma continuous_powr: |
|
53079 | 2544 |
assumes "continuous F f" |
2545 |
and "continuous F g" |
|
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2546 |
and "f (Lim F (\<lambda>x. x)) \<noteq> 0" |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2547 |
shows "continuous F (\<lambda>x. (f x) powr (g x :: real))" |
51527 | 2548 |
using assms unfolding continuous_def by (rule tendsto_powr) |
2549 |
||
2550 |
lemma continuous_at_within_powr[continuous_intros]: |
|
53079 | 2551 |
assumes "continuous (at a within s) f" |
2552 |
and "continuous (at a within s) g" |
|
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2553 |
and "f a \<noteq> 0" |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2554 |
shows "continuous (at a within s) (\<lambda>x. (f x) powr (g x :: real))" |
51527 | 2555 |
using assms unfolding continuous_within by (rule tendsto_powr) |
2556 |
||
2557 |
lemma isCont_powr[continuous_intros, simp]: |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2558 |
assumes "isCont f a" "isCont g a" "f a \<noteq> (0::real)" |
51527 | 2559 |
shows "isCont (\<lambda>x. (f x) powr g x) a" |
2560 |
using assms unfolding continuous_at by (rule tendsto_powr) |
|
2561 |
||
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
2562 |
lemma continuous_on_powr[continuous_intros]: |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2563 |
assumes "continuous_on s f" "continuous_on s g" and "\<forall>x\<in>s. f x \<noteq> (0::real)" |
51527 | 2564 |
shows "continuous_on s (\<lambda>x. (f x) powr (g x))" |
2565 |
using assms unfolding continuous_on_def by (fast intro: tendsto_powr) |
|
2566 |
||
2567 |
(* FIXME: generalize by replacing d by with g x and g ---> d? *) |
|
2568 |
lemma tendsto_zero_powrI: |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2569 |
assumes "eventually (\<lambda>x. 0 < f x ) F" and "(f ---> (0::real)) F" |
53079 | 2570 |
and "0 < d" |
51527 | 2571 |
shows "((\<lambda>x. f x powr d) ---> 0) F" |
2572 |
proof (rule tendstoI) |
|
2573 |
fix e :: real assume "0 < e" |
|
2574 |
def Z \<equiv> "e powr (1 / d)" |
|
2575 |
with `0 < e` have "0 < Z" by simp |
|
2576 |
with assms have "eventually (\<lambda>x. 0 < f x \<and> dist (f x) 0 < Z) F" |
|
2577 |
by (intro eventually_conj tendstoD) |
|
2578 |
moreover |
|
2579 |
from assms have "\<And>x. 0 < x \<and> dist x 0 < Z \<Longrightarrow> x powr d < Z powr d" |
|
2580 |
by (intro powr_less_mono2) (auto simp: dist_real_def) |
|
2581 |
with assms `0 < e` have "\<And>x. 0 < x \<and> dist x 0 < Z \<Longrightarrow> dist (x powr d) 0 < e" |
|
2582 |
unfolding dist_real_def Z_def by (auto simp: powr_powr) |
|
2583 |
ultimately |
|
2584 |
show "eventually (\<lambda>x. dist (f x powr d) 0 < e) F" by (rule eventually_elim1) |
|
2585 |
qed |
|
2586 |
||
2587 |
lemma tendsto_neg_powr: |
|
53079 | 2588 |
assumes "s < 0" |
2589 |
and "LIM x F. f x :> at_top" |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2590 |
shows "((\<lambda>x. f x powr s) ---> (0::real)) F" |
51527 | 2591 |
proof (rule tendstoI) |
2592 |
fix e :: real assume "0 < e" |
|
2593 |
def Z \<equiv> "e powr (1 / s)" |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2594 |
have "Z > 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2595 |
using Z_def `0 < e` by auto |
51527 | 2596 |
from assms have "eventually (\<lambda>x. Z < f x) F" |
2597 |
by (simp add: filterlim_at_top_dense) |
|
2598 |
moreover |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2599 |
from assms have "\<And>x::real. Z < x \<Longrightarrow> x powr s < Z powr s" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2600 |
using `Z > 0` |
51527 | 2601 |
by (auto simp: Z_def intro!: powr_less_mono2_neg) |
2602 |
with assms `0 < e` have "\<And>x. Z < x \<Longrightarrow> dist (x powr s) 0 < e" |
|
2603 |
by (simp add: powr_powr Z_def dist_real_def) |
|
2604 |
ultimately |
|
2605 |
show "eventually (\<lambda>x. dist (f x powr s) 0 < e) F" by (rule eventually_elim1) |
|
2606 |
qed |
|
2607 |
||
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2608 |
lemma tendsto_exp_limit_at_right: |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2609 |
fixes x :: real |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2610 |
shows "((\<lambda>y. (1 + x * y) powr (1 / y)) ---> exp x) (at_right 0)" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2611 |
proof cases |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2612 |
assume "x \<noteq> 0" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2613 |
have "((\<lambda>y. ln (1 + x * y)::real) has_real_derivative 1 * x) (at 0)" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2614 |
by (auto intro!: derivative_eq_intros) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2615 |
then have "((\<lambda>y. ln (1 + x * y) / y) ---> x) (at 0)" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2616 |
by (auto simp add: has_field_derivative_def field_has_derivative_at) |
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2617 |
then have *: "((\<lambda>y. exp (ln (1 + x * y) / y)) ---> exp x) (at 0)" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2618 |
by (rule tendsto_intros) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2619 |
then show ?thesis |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2620 |
proof (rule filterlim_mono_eventually) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2621 |
show "eventually (\<lambda>xa. exp (ln (1 + x * xa) / xa) = (1 + x * xa) powr (1 / xa)) (at_right 0)" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2622 |
unfolding eventually_at_right[OF zero_less_one] |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2623 |
using `x \<noteq> 0` |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2624 |
apply (intro exI[of _ "1 / \<bar>x\<bar>"]) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2625 |
apply (auto simp: field_simps powr_def abs_if) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
2626 |
by (metis add_less_same_cancel1 mult_less_0_iff not_less_iff_gr_or_eq zero_less_one) |
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2627 |
qed (simp_all add: at_eq_sup_left_right) |
58729
e8ecc79aee43
add tendsto_const and tendsto_ident_at as simp and intro rules
hoelzl
parents:
58710
diff
changeset
|
2628 |
qed simp |
57275
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2629 |
|
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2630 |
lemma tendsto_exp_limit_at_top: |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2631 |
fixes x :: real |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2632 |
shows "((\<lambda>y. (1 + x / y) powr y) ---> exp x) at_top" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2633 |
apply (subst filterlim_at_top_to_right) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2634 |
apply (simp add: inverse_eq_divide) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2635 |
apply (rule tendsto_exp_limit_at_right) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2636 |
done |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2637 |
|
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2638 |
lemma tendsto_exp_limit_sequentially: |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2639 |
fixes x :: real |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2640 |
shows "(\<lambda>n. (1 + x / n) ^ n) ----> exp x" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2641 |
proof (rule filterlim_mono_eventually) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2642 |
from reals_Archimedean2 [of "abs x"] obtain n :: nat where *: "real n > abs x" .. |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2643 |
hence "eventually (\<lambda>n :: nat. 0 < 1 + x / real n) at_top" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2644 |
apply (intro eventually_sequentiallyI [of n]) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2645 |
apply (case_tac "x \<ge> 0") |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2646 |
apply (rule add_pos_nonneg, auto intro: divide_nonneg_nonneg) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2647 |
apply (subgoal_tac "x / real xa > -1") |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2648 |
apply (auto simp add: field_simps) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2649 |
done |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2650 |
then show "eventually (\<lambda>n. (1 + x / n) powr n = (1 + x / n) ^ n) at_top" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2651 |
by (rule eventually_elim1) (erule powr_realpow) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2652 |
show "(\<lambda>n. (1 + x / real n) powr real n) ----> exp x" |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2653 |
by (rule filterlim_compose [OF tendsto_exp_limit_at_top filterlim_real_sequentially]) |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2654 |
qed auto |
0ddb5b755cdc
moved lemmas from the proof of the Central Limit Theorem by Jeremy Avigad and Luke Serafin
hoelzl
parents:
57180
diff
changeset
|
2655 |
|
29164 | 2656 |
subsection {* Sine and Cosine *} |
2657 |
||
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
2658 |
definition sin_coeff :: "nat \<Rightarrow> real" where |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2659 |
"sin_coeff = (\<lambda>n. if even n then 0 else (- 1) ^ ((n - Suc 0) div 2) / (fact n))" |
31271 | 2660 |
|
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
2661 |
definition cos_coeff :: "nat \<Rightarrow> real" where |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2662 |
"cos_coeff = (\<lambda>n. if even n then ((- 1) ^ (n div 2)) / (fact n) else 0)" |
31271 | 2663 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2664 |
definition sin :: "'a \<Rightarrow> 'a::{real_normed_algebra_1,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2665 |
where "sin = (\<lambda>x. \<Sum>n. sin_coeff n *\<^sub>R x^n)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2666 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2667 |
definition cos :: "'a \<Rightarrow> 'a::{real_normed_algebra_1,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2668 |
where "cos = (\<lambda>x. \<Sum>n. cos_coeff n *\<^sub>R x^n)" |
31271 | 2669 |
|
44319
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2670 |
lemma sin_coeff_0 [simp]: "sin_coeff 0 = 0" |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2671 |
unfolding sin_coeff_def by simp |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2672 |
|
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2673 |
lemma cos_coeff_0 [simp]: "cos_coeff 0 = 1" |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2674 |
unfolding cos_coeff_def by simp |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2675 |
|
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2676 |
lemma sin_coeff_Suc: "sin_coeff (Suc n) = cos_coeff n / real (Suc n)" |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2677 |
unfolding cos_coeff_def sin_coeff_def |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2678 |
by (simp del: mult_Suc) |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2679 |
|
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2680 |
lemma cos_coeff_Suc: "cos_coeff (Suc n) = - sin_coeff n / real (Suc n)" |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2681 |
unfolding cos_coeff_def sin_coeff_def |
58709
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
2682 |
by (simp del: mult_Suc) (auto elim: oddE) |
44319
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2683 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2684 |
lemma summable_norm_sin: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2685 |
fixes x :: "'a::{real_normed_algebra_1,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2686 |
shows "summable (\<lambda>n. norm (sin_coeff n *\<^sub>R x^n))" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2687 |
unfolding sin_coeff_def |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2688 |
apply (rule summable_comparison_test [OF _ summable_norm_exp [where x=x]]) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2689 |
apply (auto simp: divide_inverse abs_mult power_abs [symmetric] zero_le_mult_iff) |
53079 | 2690 |
done |
29164 | 2691 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2692 |
lemma summable_norm_cos: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2693 |
fixes x :: "'a::{real_normed_algebra_1,banach}" |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2694 |
shows "summable (\<lambda>n. norm (cos_coeff n *\<^sub>R x^n))" |
53079 | 2695 |
unfolding cos_coeff_def |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2696 |
apply (rule summable_comparison_test [OF _ summable_norm_exp [where x=x]]) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2697 |
apply (auto simp: divide_inverse abs_mult power_abs [symmetric] zero_le_mult_iff) |
53079 | 2698 |
done |
29164 | 2699 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2700 |
lemma sin_converges: "(\<lambda>n. sin_coeff n *\<^sub>R x^n) sums sin(x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2701 |
unfolding sin_def |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2702 |
by (metis (full_types) summable_norm_cancel summable_norm_sin summable_sums) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2703 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2704 |
lemma cos_converges: "(\<lambda>n. cos_coeff n *\<^sub>R x^n) sums cos(x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2705 |
unfolding cos_def |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2706 |
by (metis (full_types) summable_norm_cancel summable_norm_cos summable_sums) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2707 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2708 |
lemma sin_of_real: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2709 |
fixes x::real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2710 |
shows "sin (of_real x) = of_real (sin x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2711 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2712 |
have "(\<lambda>n. of_real (sin_coeff n *\<^sub>R x^n)) = (\<lambda>n. sin_coeff n *\<^sub>R (of_real x)^n)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2713 |
proof |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2714 |
fix n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2715 |
show "of_real (sin_coeff n *\<^sub>R x^n) = sin_coeff n *\<^sub>R of_real x^n" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2716 |
by (simp add: scaleR_conv_of_real) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2717 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2718 |
also have "... sums (sin (of_real x))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2719 |
by (rule sin_converges) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2720 |
finally have "(\<lambda>n. of_real (sin_coeff n *\<^sub>R x^n)) sums (sin (of_real x))" . |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2721 |
then show ?thesis |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2722 |
using sums_unique2 sums_of_real [OF sin_converges] |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2723 |
by blast |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2724 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2725 |
|
59862 | 2726 |
corollary sin_in_Reals [simp]: "z \<in> \<real> \<Longrightarrow> sin z \<in> \<real>" |
2727 |
by (metis Reals_cases Reals_of_real sin_of_real) |
|
2728 |
||
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2729 |
lemma cos_of_real: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2730 |
fixes x::real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2731 |
shows "cos (of_real x) = of_real (cos x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2732 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2733 |
have "(\<lambda>n. of_real (cos_coeff n *\<^sub>R x^n)) = (\<lambda>n. cos_coeff n *\<^sub>R (of_real x)^n)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2734 |
proof |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2735 |
fix n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2736 |
show "of_real (cos_coeff n *\<^sub>R x^n) = cos_coeff n *\<^sub>R of_real x^n" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2737 |
by (simp add: scaleR_conv_of_real) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2738 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2739 |
also have "... sums (cos (of_real x))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2740 |
by (rule cos_converges) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2741 |
finally have "(\<lambda>n. of_real (cos_coeff n *\<^sub>R x^n)) sums (cos (of_real x))" . |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2742 |
then show ?thesis |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2743 |
using sums_unique2 sums_of_real [OF cos_converges] |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2744 |
by blast |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2745 |
qed |
29164 | 2746 |
|
59862 | 2747 |
corollary cos_in_Reals [simp]: "z \<in> \<real> \<Longrightarrow> cos z \<in> \<real>" |
2748 |
by (metis Reals_cases Reals_of_real cos_of_real) |
|
2749 |
||
44319
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2750 |
lemma diffs_sin_coeff: "diffs sin_coeff = cos_coeff" |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2751 |
by (simp add: diffs_def sin_coeff_Suc real_of_nat_def del: of_nat_Suc) |
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2752 |
|
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2753 |
lemma diffs_cos_coeff: "diffs cos_coeff = (\<lambda>n. - sin_coeff n)" |
56479
91958d4b30f7
revert c1bbd3e22226, a14831ac3023, and 36489d77c484: divide_minus_left/right are again simp rules
hoelzl
parents:
56409
diff
changeset
|
2754 |
by (simp add: diffs_def cos_coeff_Suc real_of_nat_def del: of_nat_Suc) |
29164 | 2755 |
|
2756 |
text{*Now at last we can get the derivatives of exp, sin and cos*} |
|
2757 |
||
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2758 |
lemma DERIV_sin [simp]: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2759 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2760 |
shows "DERIV sin x :> cos(x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2761 |
unfolding sin_def cos_def scaleR_conv_of_real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2762 |
apply (rule DERIV_cong) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2763 |
apply (rule termdiffs [where K="of_real (norm x) + 1 :: 'a"]) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2764 |
apply (simp_all add: norm_less_p1 diffs_of_real diffs_sin_coeff diffs_cos_coeff |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2765 |
summable_minus_iff scaleR_conv_of_real [symmetric] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2766 |
summable_norm_sin [THEN summable_norm_cancel] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2767 |
summable_norm_cos [THEN summable_norm_cancel]) |
44319
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2768 |
done |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2769 |
|
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
2770 |
declare DERIV_sin[THEN DERIV_chain2, derivative_intros] |
51527 | 2771 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2772 |
lemma DERIV_cos [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2773 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2774 |
shows "DERIV cos x :> -sin(x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2775 |
unfolding sin_def cos_def scaleR_conv_of_real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2776 |
apply (rule DERIV_cong) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2777 |
apply (rule termdiffs [where K="of_real (norm x) + 1 :: 'a"]) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2778 |
apply (simp_all add: norm_less_p1 diffs_of_real diffs_minus suminf_minus |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2779 |
diffs_sin_coeff diffs_cos_coeff |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2780 |
summable_minus_iff scaleR_conv_of_real [symmetric] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2781 |
summable_norm_sin [THEN summable_norm_cancel] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2782 |
summable_norm_cos [THEN summable_norm_cancel]) |
44319
806e0390de53
move sin_coeff and cos_coeff lemmas to Transcendental.thy; simplify some proofs
huffman
parents:
44318
diff
changeset
|
2783 |
done |
29164 | 2784 |
|
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
2785 |
declare DERIV_cos[THEN DERIV_chain2, derivative_intros] |
51527 | 2786 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2787 |
lemma isCont_sin: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2788 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2789 |
shows "isCont sin x" |
44311 | 2790 |
by (rule DERIV_sin [THEN DERIV_isCont]) |
2791 |
||
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2792 |
lemma isCont_cos: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2793 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2794 |
shows "isCont cos x" |
44311 | 2795 |
by (rule DERIV_cos [THEN DERIV_isCont]) |
2796 |
||
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2797 |
lemma isCont_sin' [simp]: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2798 |
fixes f:: "_ \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2799 |
shows "isCont f a \<Longrightarrow> isCont (\<lambda>x. sin (f x)) a" |
44311 | 2800 |
by (rule isCont_o2 [OF _ isCont_sin]) |
2801 |
||
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2802 |
(*FIXME A CONTEXT FOR F WOULD BE BETTER*) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2803 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2804 |
lemma isCont_cos' [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2805 |
fixes f:: "_ \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2806 |
shows "isCont f a \<Longrightarrow> isCont (\<lambda>x. cos (f x)) a" |
44311 | 2807 |
by (rule isCont_o2 [OF _ isCont_cos]) |
2808 |
||
2809 |
lemma tendsto_sin [tendsto_intros]: |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2810 |
fixes f:: "_ \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2811 |
shows "(f ---> a) F \<Longrightarrow> ((\<lambda>x. sin (f x)) ---> sin a) F" |
44311 | 2812 |
by (rule isCont_tendsto_compose [OF isCont_sin]) |
2813 |
||
2814 |
lemma tendsto_cos [tendsto_intros]: |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2815 |
fixes f:: "_ \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2816 |
shows "(f ---> a) F \<Longrightarrow> ((\<lambda>x. cos (f x)) ---> cos a) F" |
44311 | 2817 |
by (rule isCont_tendsto_compose [OF isCont_cos]) |
29164 | 2818 |
|
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2819 |
lemma continuous_sin [continuous_intros]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2820 |
fixes f:: "_ \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2821 |
shows "continuous F f \<Longrightarrow> continuous F (\<lambda>x. sin (f x))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2822 |
unfolding continuous_def by (rule tendsto_sin) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2823 |
|
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
2824 |
lemma continuous_on_sin [continuous_intros]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2825 |
fixes f:: "_ \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2826 |
shows "continuous_on s f \<Longrightarrow> continuous_on s (\<lambda>x. sin (f x))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2827 |
unfolding continuous_on_def by (auto intro: tendsto_sin) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2828 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2829 |
lemma continuous_within_sin: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2830 |
fixes z :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2831 |
shows "continuous (at z within s) sin" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2832 |
by (simp add: continuous_within tendsto_sin) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2833 |
|
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2834 |
lemma continuous_cos [continuous_intros]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2835 |
fixes f:: "_ \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2836 |
shows "continuous F f \<Longrightarrow> continuous F (\<lambda>x. cos (f x))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2837 |
unfolding continuous_def by (rule tendsto_cos) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2838 |
|
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
2839 |
lemma continuous_on_cos [continuous_intros]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2840 |
fixes f:: "_ \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2841 |
shows "continuous_on s f \<Longrightarrow> continuous_on s (\<lambda>x. cos (f x))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2842 |
unfolding continuous_on_def by (auto intro: tendsto_cos) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
2843 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2844 |
lemma continuous_within_cos: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2845 |
fixes z :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2846 |
shows "continuous (at z within s) cos" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2847 |
by (simp add: continuous_within tendsto_cos) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2848 |
|
29164 | 2849 |
subsection {* Properties of Sine and Cosine *} |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
2850 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
2851 |
lemma sin_zero [simp]: "sin 0 = 0" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2852 |
unfolding sin_def sin_coeff_def by (simp add: scaleR_conv_of_real powser_zero) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
2853 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
2854 |
lemma cos_zero [simp]: "cos 0 = 1" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2855 |
unfolding cos_def cos_coeff_def by (simp add: scaleR_conv_of_real powser_zero) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2856 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2857 |
lemma DERIV_fun_sin: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2858 |
"DERIV g x :> m \<Longrightarrow> DERIV (\<lambda>x. sin(g x)) x :> cos(g x) * m" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2859 |
by (auto intro!: derivative_intros) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2860 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2861 |
lemma DERIV_fun_cos: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2862 |
"DERIV g x :> m \<Longrightarrow> DERIV (\<lambda>x. cos(g x)) x :> -sin(g x) * m" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2863 |
by (auto intro!: derivative_eq_intros simp: real_of_nat_def) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2864 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2865 |
subsection {*Deriving the Addition Formulas*} |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2866 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2867 |
text{*The the product of two cosine series*} |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2868 |
lemma cos_x_cos_y: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2869 |
fixes x :: "'a::{real_normed_field,banach}" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2870 |
shows "(\<lambda>p. \<Sum>n\<le>p. |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2871 |
if even p \<and> even n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2872 |
then ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2873 |
sums (cos x * cos y)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2874 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2875 |
{ fix n p::nat |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2876 |
assume "n\<le>p" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2877 |
then have *: "even n \<Longrightarrow> even p \<Longrightarrow> (-1) ^ (n div 2) * (-1) ^ ((p - n) div 2) = (-1 :: real) ^ (p div 2)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2878 |
by (metis div_add power_add le_add_diff_inverse odd_add) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2879 |
have "(cos_coeff n * cos_coeff (p - n)) *\<^sub>R (x^n * y^(p-n)) = |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2880 |
(if even p \<and> even n then ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0)" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2881 |
using `n\<le>p` |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2882 |
by (auto simp: * algebra_simps cos_coeff_def binomial_fact real_of_nat_def) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2883 |
} |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2884 |
then have "(\<lambda>p. \<Sum>n\<le>p. if even p \<and> even n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2885 |
then ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0) = |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2886 |
(\<lambda>p. \<Sum>n\<le>p. (cos_coeff n * cos_coeff (p - n)) *\<^sub>R (x^n * y^(p-n)))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2887 |
by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2888 |
also have "... = (\<lambda>p. \<Sum>n\<le>p. (cos_coeff n *\<^sub>R x^n) * (cos_coeff (p - n) *\<^sub>R y^(p-n)))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2889 |
by (simp add: algebra_simps) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2890 |
also have "... sums (cos x * cos y)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2891 |
using summable_norm_cos |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2892 |
by (auto simp: cos_def scaleR_conv_of_real intro!: Cauchy_product_sums) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2893 |
finally show ?thesis . |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2894 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2895 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2896 |
text{*The product of two sine series*} |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2897 |
lemma sin_x_sin_y: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2898 |
fixes x :: "'a::{real_normed_field,banach}" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2899 |
shows "(\<lambda>p. \<Sum>n\<le>p. |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2900 |
if even p \<and> odd n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2901 |
then - ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2902 |
sums (sin x * sin y)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2903 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2904 |
{ fix n p::nat |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2905 |
assume "n\<le>p" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2906 |
{ assume np: "odd n" "even p" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2907 |
with `n\<le>p` have "n - Suc 0 + (p - Suc n) = p - Suc (Suc 0)" "Suc (Suc 0) \<le> p" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2908 |
by arith+ |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2909 |
moreover have "(p - Suc (Suc 0)) div 2 = p div 2 - Suc 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2910 |
by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2911 |
ultimately have *: "(-1) ^ ((n - Suc 0) div 2) * (-1) ^ ((p - Suc n) div 2) = - ((-1 :: real) ^ (p div 2))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2912 |
using np `n\<le>p` |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2913 |
apply (simp add: power_add [symmetric] div_add [symmetric] del: div_add) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2914 |
apply (metis (no_types) One_nat_def Suc_1 le_div_geq minus_minus mult.left_neutral mult_minus_left power.simps(2) zero_less_Suc) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2915 |
done |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2916 |
} then |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2917 |
have "(sin_coeff n * sin_coeff (p - n)) *\<^sub>R (x^n * y^(p-n)) = |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2918 |
(if even p \<and> odd n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2919 |
then -((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0)" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2920 |
using `n\<le>p` |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2921 |
by (auto simp: algebra_simps sin_coeff_def binomial_fact real_of_nat_def) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2922 |
} |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2923 |
then have "(\<lambda>p. \<Sum>n\<le>p. if even p \<and> odd n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2924 |
then - ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0) = |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2925 |
(\<lambda>p. \<Sum>n\<le>p. (sin_coeff n * sin_coeff (p - n)) *\<^sub>R (x^n * y^(p-n)))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2926 |
by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2927 |
also have "... = (\<lambda>p. \<Sum>n\<le>p. (sin_coeff n *\<^sub>R x^n) * (sin_coeff (p - n) *\<^sub>R y^(p-n)))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2928 |
by (simp add: algebra_simps) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2929 |
also have "... sums (sin x * sin y)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2930 |
using summable_norm_sin |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2931 |
by (auto simp: sin_def scaleR_conv_of_real intro!: Cauchy_product_sums) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2932 |
finally show ?thesis . |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2933 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2934 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2935 |
lemma sums_cos_x_plus_y: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2936 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2937 |
shows |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2938 |
"(\<lambda>p. \<Sum>n\<le>p. if even p |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2939 |
then ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2940 |
else 0) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2941 |
sums cos (x + y)" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
2942 |
proof - |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2943 |
{ fix p::nat |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2944 |
have "(\<Sum>n\<le>p. if even p |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2945 |
then ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2946 |
else 0) = |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2947 |
(if even p |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2948 |
then \<Sum>n\<le>p. ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2949 |
else 0)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2950 |
by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2951 |
also have "... = (if even p |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2952 |
then of_real ((-1) ^ (p div 2) / (fact p)) * (\<Sum>n\<le>p. (p choose n) *\<^sub>R (x^n) * y^(p-n)) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2953 |
else 0)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2954 |
by (auto simp: setsum_right_distrib field_simps scaleR_conv_of_real nonzero_of_real_divide) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2955 |
also have "... = cos_coeff p *\<^sub>R ((x + y) ^ p)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2956 |
by (simp add: cos_coeff_def binomial_ring [of x y] scaleR_conv_of_real real_of_nat_def atLeast0AtMost) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2957 |
finally have "(\<Sum>n\<le>p. if even p |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2958 |
then ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2959 |
else 0) = cos_coeff p *\<^sub>R ((x + y) ^ p)" . |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2960 |
} |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2961 |
then have "(\<lambda>p. \<Sum>n\<le>p. |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2962 |
if even p |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2963 |
then ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2964 |
else 0) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2965 |
= (\<lambda>p. cos_coeff p *\<^sub>R ((x+y)^p))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2966 |
by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2967 |
also have "... sums cos (x + y)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2968 |
by (rule cos_converges) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2969 |
finally show ?thesis . |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2970 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2971 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2972 |
theorem cos_add: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2973 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2974 |
shows "cos (x + y) = cos x * cos y - sin x * sin y" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2975 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2976 |
{ fix n p::nat |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2977 |
assume "n\<le>p" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2978 |
then have "(if even p \<and> even n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2979 |
then ((- 1) ^ (p div 2) * int (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0) - |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2980 |
(if even p \<and> odd n |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2981 |
then - ((- 1) ^ (p div 2) * int (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2982 |
= (if even p |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2983 |
then ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0)" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2984 |
by simp |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2985 |
} |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
2986 |
then have "(\<lambda>p. \<Sum>n\<le>p. (if even p |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
2987 |
then ((-1) ^ (p div 2) * (p choose n) / (fact p)) *\<^sub>R (x^n) * y^(p-n) else 0)) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2988 |
sums (cos x * cos y - sin x * sin y)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2989 |
using sums_diff [OF cos_x_cos_y [of x y] sin_x_sin_y [of x y]] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2990 |
by (simp add: setsum_subtractf [symmetric]) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2991 |
then show ?thesis |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2992 |
by (blast intro: sums_cos_x_plus_y sums_unique2) |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
2993 |
qed |
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
2994 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2995 |
lemma sin_minus_converges: "(\<lambda>n. - (sin_coeff n *\<^sub>R (-x)^n)) sums sin(x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2996 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2997 |
have [simp]: "\<And>n. - (sin_coeff n *\<^sub>R (-x)^n) = (sin_coeff n *\<^sub>R x^n)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2998 |
by (auto simp: sin_coeff_def elim!: oddE) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
2999 |
show ?thesis |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3000 |
by (simp add: sin_def summable_norm_sin [THEN summable_norm_cancel, THEN summable_sums]) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3001 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3002 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3003 |
lemma sin_minus [simp]: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3004 |
fixes x :: "'a::{real_normed_algebra_1,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3005 |
shows "sin (-x) = -sin(x)" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3006 |
using sin_minus_converges [of x] |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3007 |
by (auto simp: sin_def summable_norm_sin [THEN summable_norm_cancel] suminf_minus sums_iff equation_minus_iff) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3008 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3009 |
lemma cos_minus_converges: "(\<lambda>n. (cos_coeff n *\<^sub>R (-x)^n)) sums cos(x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3010 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3011 |
have [simp]: "\<And>n. (cos_coeff n *\<^sub>R (-x)^n) = (cos_coeff n *\<^sub>R x^n)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3012 |
by (auto simp: Transcendental.cos_coeff_def elim!: evenE) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3013 |
show ?thesis |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3014 |
by (simp add: cos_def summable_norm_cos [THEN summable_norm_cancel, THEN summable_sums]) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3015 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3016 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3017 |
lemma cos_minus [simp]: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3018 |
fixes x :: "'a::{real_normed_algebra_1,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3019 |
shows "cos (-x) = cos(x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3020 |
using cos_minus_converges [of x] |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3021 |
by (simp add: cos_def summable_norm_cos [THEN summable_norm_cancel] |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3022 |
suminf_minus sums_iff equation_minus_iff) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3023 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3024 |
lemma sin_cos_squared_add [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3025 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3026 |
shows "(sin x)\<^sup>2 + (cos x)\<^sup>2 = 1" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3027 |
using cos_add [of x "-x"] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3028 |
by (simp add: power2_eq_square algebra_simps) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3029 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3030 |
lemma sin_cos_squared_add2 [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3031 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3032 |
shows "(cos x)\<^sup>2 + (sin x)\<^sup>2 = 1" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
3033 |
by (subst add.commute, rule sin_cos_squared_add) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3034 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3035 |
lemma sin_cos_squared_add3 [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3036 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3037 |
shows "cos x * cos x + sin x * sin x = 1" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
3038 |
using sin_cos_squared_add2 [unfolded power2_eq_square] . |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3039 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3040 |
lemma sin_squared_eq: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3041 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3042 |
shows "(sin x)\<^sup>2 = 1 - (cos x)\<^sup>2" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
3043 |
unfolding eq_diff_eq by (rule sin_cos_squared_add) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3044 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3045 |
lemma cos_squared_eq: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3046 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3047 |
shows "(cos x)\<^sup>2 = 1 - (sin x)\<^sup>2" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
3048 |
unfolding eq_diff_eq by (rule sin_cos_squared_add2) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3049 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3050 |
lemma abs_sin_le_one [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3051 |
fixes x :: real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3052 |
shows "\<bar>sin x\<bar> \<le> 1" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
3053 |
by (rule power2_le_imp_le, simp_all add: sin_squared_eq) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3054 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3055 |
lemma sin_ge_minus_one [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3056 |
fixes x :: real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3057 |
shows "-1 \<le> sin x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3058 |
using abs_sin_le_one [of x] unfolding abs_le_iff by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3059 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3060 |
lemma sin_le_one [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3061 |
fixes x :: real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3062 |
shows "sin x \<le> 1" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
3063 |
using abs_sin_le_one [of x] unfolding abs_le_iff by simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3064 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3065 |
lemma abs_cos_le_one [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3066 |
fixes x :: real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3067 |
shows "\<bar>cos x\<bar> \<le> 1" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
3068 |
by (rule power2_le_imp_le, simp_all add: cos_squared_eq) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3069 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3070 |
lemma cos_ge_minus_one [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3071 |
fixes x :: real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3072 |
shows "-1 \<le> cos x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3073 |
using abs_cos_le_one [of x] unfolding abs_le_iff by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3074 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3075 |
lemma cos_le_one [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3076 |
fixes x :: real |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3077 |
shows "cos x \<le> 1" |
44308
d2a6f9af02f4
Transcendental.thy: remove several unused lemmas and simplify some proofs
huffman
parents:
44307
diff
changeset
|
3078 |
using abs_cos_le_one [of x] unfolding abs_le_iff by simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3079 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3080 |
lemma cos_diff: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3081 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3082 |
shows "cos (x - y) = cos x * cos y + sin x * sin y" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3083 |
using cos_add [of x "- y"] by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3084 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3085 |
lemma cos_double: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3086 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3087 |
shows "cos(2*x) = (cos x)\<^sup>2 - (sin x)\<^sup>2" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3088 |
using cos_add [where x=x and y=x] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3089 |
by (simp add: power2_eq_square) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3090 |
|
41970 | 3091 |
lemma DERIV_fun_pow: "DERIV g x :> m ==> |
53079 | 3092 |
DERIV (\<lambda>x. (g x) ^ n) x :> real n * (g x) ^ (n - 1) * m" |
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
3093 |
by (auto intro!: derivative_eq_intros simp: real_of_nat_def) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3094 |
|
15229 | 3095 |
lemma DERIV_fun_exp: |
53079 | 3096 |
"DERIV g x :> m ==> DERIV (\<lambda>x. exp(g x)) x :> exp(g x) * m" |
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
3097 |
by (auto intro!: derivative_intros) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3098 |
|
29164 | 3099 |
subsection {* The Constant Pi *} |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3100 |
|
53079 | 3101 |
definition pi :: real |
3102 |
where "pi = 2 * (THE x. 0 \<le> (x::real) & x \<le> 2 & cos x = 0)" |
|
23043 | 3103 |
|
41970 | 3104 |
text{*Show that there's a least positive @{term x} with @{term "cos(x) = 0"}; |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3105 |
hence define pi.*} |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3106 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3107 |
lemma sin_paired: |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3108 |
fixes x :: real |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3109 |
shows "(\<lambda>n. (- 1) ^ n / (fact (2 * n + 1)) * x ^ (2 * n + 1)) sums sin x" |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3110 |
proof - |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3111 |
have "(\<lambda>n. \<Sum>k = n*2..<n * 2 + 2. sin_coeff k * x ^ k) sums sin x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3112 |
apply (rule sums_group) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3113 |
using sin_converges [of x, unfolded scaleR_conv_of_real] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3114 |
by auto |
57514
bdc2c6b40bf2
prefer ac_simps collections over separate name bindings for add and mult
haftmann
parents:
57512
diff
changeset
|
3115 |
thus ?thesis unfolding One_nat_def sin_coeff_def by (simp add: ac_simps) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3116 |
qed |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3117 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3118 |
lemma sin_gt_zero_02: |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3119 |
fixes x :: real |
53079 | 3120 |
assumes "0 < x" and "x < 2" |
3121 |
shows "0 < sin x" |
|
44728 | 3122 |
proof - |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3123 |
let ?f = "\<lambda>n::nat. \<Sum>k = n*2..<n*2+2. (- 1) ^ k / (fact (2*k+1)) * x^(2*k+1)" |
44728 | 3124 |
have pos: "\<forall>n. 0 < ?f n" |
3125 |
proof |
|
3126 |
fix n :: nat |
|
3127 |
let ?k2 = "real (Suc (Suc (4 * n)))" |
|
3128 |
let ?k3 = "real (Suc (Suc (Suc (4 * n))))" |
|
3129 |
have "x * x < ?k2 * ?k3" |
|
3130 |
using assms by (intro mult_strict_mono', simp_all) |
|
3131 |
hence "x * x * x * x ^ (n * 4) < ?k2 * ?k3 * x * x ^ (n * 4)" |
|
3132 |
by (intro mult_strict_right_mono zero_less_power `0 < x`) |
|
3133 |
thus "0 < ?f n" |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3134 |
by (simp add: real_of_nat_def divide_simps mult_ac del: mult_Suc) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3135 |
qed |
44728 | 3136 |
have sums: "?f sums sin x" |
3137 |
by (rule sin_paired [THEN sums_group], simp) |
|
3138 |
show "0 < sin x" |
|
3139 |
unfolding sums_unique [OF sums] |
|
3140 |
using sums_summable [OF sums] pos |
|
56213 | 3141 |
by (rule suminf_pos) |
44728 | 3142 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3143 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3144 |
lemma cos_double_less_one: |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3145 |
fixes x :: real |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3146 |
shows "0 < x \<Longrightarrow> x < 2 \<Longrightarrow> cos (2 * x) < 1" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3147 |
using sin_gt_zero_02 [where x = x] by (auto simp: cos_squared_eq cos_double) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3148 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3149 |
lemma cos_paired: |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3150 |
fixes x :: real |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3151 |
shows "(\<lambda>n. (- 1) ^ n / (fact (2 * n)) * x ^ (2 * n)) sums cos x" |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3152 |
proof - |
31271 | 3153 |
have "(\<lambda>n. \<Sum>k = n * 2..<n * 2 + 2. cos_coeff k * x ^ k) sums cos x" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3154 |
apply (rule sums_group) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3155 |
using cos_converges [of x, unfolded scaleR_conv_of_real] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3156 |
by auto |
57514
bdc2c6b40bf2
prefer ac_simps collections over separate name bindings for add and mult
haftmann
parents:
57512
diff
changeset
|
3157 |
thus ?thesis unfolding cos_coeff_def by (simp add: ac_simps) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3158 |
qed |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3159 |
|
53602 | 3160 |
lemmas realpow_num_eq_if = power_eq_if |
3161 |
||
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3162 |
lemma sumr_pos_lt_pair: (*FIXME A MESS, BUT THE REAL MESS IS THE NEXT THEOREM*) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3163 |
fixes f :: "nat \<Rightarrow> real" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3164 |
shows "\<lbrakk>summable f; |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3165 |
\<And>d. 0 < f (k + (Suc(Suc 0) * d)) + f (k + ((Suc(Suc 0) * d) + 1))\<rbrakk> |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3166 |
\<Longrightarrow> setsum f {..<k} < suminf f" |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3167 |
unfolding One_nat_def |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3168 |
apply (subst suminf_split_initial_segment [where k=k], assumption, simp) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3169 |
apply (drule_tac k=k in summable_ignore_initial_segment) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3170 |
apply (drule_tac k="Suc (Suc 0)" in sums_group [OF summable_sums], simp) |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3171 |
apply simp |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3172 |
apply (frule sums_unique) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3173 |
apply (drule sums_summable, simp) |
56213 | 3174 |
apply (erule suminf_pos) |
57514
bdc2c6b40bf2
prefer ac_simps collections over separate name bindings for add and mult
haftmann
parents:
57512
diff
changeset
|
3175 |
apply (simp add: ac_simps) |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3176 |
done |
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
3177 |
|
53602 | 3178 |
lemma cos_two_less_zero [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3179 |
"cos 2 < (0::real)" |
53602 | 3180 |
proof - |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3181 |
note fact.simps(2) [simp del] |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3182 |
from sums_minus [OF cos_paired] |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3183 |
have *: "(\<lambda>n. - ((- 1) ^ n * 2 ^ (2 * n) / fact (2 * n))) sums - cos (2::real)" |
53602 | 3184 |
by simp |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3185 |
then have **: "summable (\<lambda>n. - ((- 1::real) ^ n * 2 ^ (2 * n) / (fact (2 * n))))" |
53602 | 3186 |
by (rule sums_summable) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3187 |
have "0 < (\<Sum>n<Suc (Suc (Suc 0)). - ((- 1::real) ^ n * 2 ^ (2 * n) / (fact (2 * n))))" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3188 |
by (simp add: fact_num_eq_if realpow_num_eq_if) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3189 |
moreover have "(\<Sum>n<Suc (Suc (Suc 0)). - ((- 1::real) ^ n * 2 ^ (2 * n) / (fact (2 * n)))) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3190 |
< (\<Sum>n. - ((- 1) ^ n * 2 ^ (2 * n) / (fact (2 * n))))" |
53602 | 3191 |
proof - |
3192 |
{ fix d |
|
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3193 |
have "(4::real) * (fact (Suc (Suc (Suc (Suc (Suc (Suc (4 * d)))))))) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3194 |
< (Suc (Suc (Suc (Suc (Suc (Suc (Suc (Suc (4 * d)))))))) * |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3195 |
fact (Suc (Suc (Suc (Suc (Suc (Suc (Suc (4 * d)))))))))" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3196 |
unfolding real_of_nat_mult |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3197 |
by (rule mult_strict_mono) (simp_all add: fact_less_mono) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3198 |
then have "(4::real) * (fact (Suc (Suc (Suc (Suc (Suc (Suc (4 * d)))))))) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3199 |
< (fact (Suc (Suc (Suc (Suc (Suc (Suc (Suc (Suc (4 * d))))))))))" |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3200 |
by (simp only: fact.simps(2) [of "Suc (Suc (Suc (Suc (Suc (Suc (Suc (4 * d)))))))"] real_of_nat_def of_nat_mult of_nat_fact) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3201 |
then have "(4::real) * inverse (fact (Suc (Suc (Suc (Suc (Suc (Suc (Suc (Suc (4 * d)))))))))) |
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3202 |
< inverse (fact (Suc (Suc (Suc (Suc (Suc (Suc (4 * d))))))))" |
53602 | 3203 |
by (simp add: inverse_eq_divide less_divide_eq) |
3204 |
} |
|
3205 |
note *** = this |
|
54230
b1d955791529
more simplification rules on unary and binary minus
haftmann
parents:
53602
diff
changeset
|
3206 |
have [simp]: "\<And>x y::real. 0 < x - y \<longleftrightarrow> y < x" by arith |
53602 | 3207 |
from ** show ?thesis by (rule sumr_pos_lt_pair) |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
3208 |
(simp add: divide_inverse mult.assoc [symmetric] ***) |
53602 | 3209 |
qed |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3210 |
ultimately have "0 < (\<Sum>n. - ((- 1::real) ^ n * 2 ^ (2 * n) / (fact (2 * n))))" |
53602 | 3211 |
by (rule order_less_trans) |
59730
b7c394c7a619
The factorial function, "fact", now has type "nat => 'a"
paulson <lp15@cam.ac.uk>
parents:
59669
diff
changeset
|
3212 |
moreover from * have "- cos 2 = (\<Sum>n. - ((- 1::real) ^ n * 2 ^ (2 * n) / (fact (2 * n))))" |
53602 | 3213 |
by (rule sums_unique) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3214 |
ultimately have "(0::real) < - cos 2" by simp |
53602 | 3215 |
then show ?thesis by simp |
3216 |
qed |
|
23053 | 3217 |
|
3218 |
lemmas cos_two_neq_zero [simp] = cos_two_less_zero [THEN less_imp_neq] |
|
3219 |
lemmas cos_two_le_zero [simp] = cos_two_less_zero [THEN order_less_imp_le] |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3220 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3221 |
lemma cos_is_zero: "EX! x::real. 0 \<le> x & x \<le> 2 \<and> cos x = 0" |
44730 | 3222 |
proof (rule ex_ex1I) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3223 |
show "\<exists>x::real. 0 \<le> x & x \<le> 2 & cos x = 0" |
44730 | 3224 |
by (rule IVT2, simp_all) |
3225 |
next |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3226 |
fix x::real and y::real |
44730 | 3227 |
assume x: "0 \<le> x \<and> x \<le> 2 \<and> cos x = 0" |
3228 |
assume y: "0 \<le> y \<and> y \<le> 2 \<and> cos y = 0" |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3229 |
have [simp]: "\<forall>x::real. cos differentiable (at x)" |
56181
2aa0b19e74f3
unify syntax for has_derivative and differentiable
hoelzl
parents:
56167
diff
changeset
|
3230 |
unfolding real_differentiable_def by (auto intro: DERIV_cos) |
44730 | 3231 |
from x y show "x = y" |
3232 |
apply (cut_tac less_linear [of x y], auto) |
|
3233 |
apply (drule_tac f = cos in Rolle) |
|
3234 |
apply (drule_tac [5] f = cos in Rolle) |
|
3235 |
apply (auto dest!: DERIV_cos [THEN DERIV_unique]) |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3236 |
apply (metis order_less_le_trans less_le sin_gt_zero_02) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3237 |
apply (metis order_less_le_trans less_le sin_gt_zero_02) |
44730 | 3238 |
done |
3239 |
qed |
|
31880 | 3240 |
|
23053 | 3241 |
lemma pi_half: "pi/2 = (THE x. 0 \<le> x & x \<le> 2 & cos x = 0)" |
53079 | 3242 |
by (simp add: pi_def) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3243 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3244 |
lemma cos_pi_half [simp]: "cos (pi / 2) = 0" |
53079 | 3245 |
by (simp add: pi_half cos_is_zero [THEN theI']) |
23053 | 3246 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3247 |
lemma cos_of_real_pi_half [simp]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3248 |
fixes x :: "'a :: {real_field,banach,real_normed_algebra_1}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3249 |
shows "cos ((of_real pi / 2) :: 'a) = 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3250 |
by (metis cos_pi_half cos_of_real eq_numeral_simps(4) nonzero_of_real_divide of_real_0 of_real_numeral) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3251 |
|
23053 | 3252 |
lemma pi_half_gt_zero [simp]: "0 < pi / 2" |
53079 | 3253 |
apply (rule order_le_neq_trans) |
3254 |
apply (simp add: pi_half cos_is_zero [THEN theI']) |
|
54575 | 3255 |
apply (metis cos_pi_half cos_zero zero_neq_one) |
53079 | 3256 |
done |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3257 |
|
23053 | 3258 |
lemmas pi_half_neq_zero [simp] = pi_half_gt_zero [THEN less_imp_neq, symmetric] |
3259 |
lemmas pi_half_ge_zero [simp] = pi_half_gt_zero [THEN order_less_imp_le] |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3260 |
|
23053 | 3261 |
lemma pi_half_less_two [simp]: "pi / 2 < 2" |
53079 | 3262 |
apply (rule order_le_neq_trans) |
3263 |
apply (simp add: pi_half cos_is_zero [THEN theI']) |
|
54575 | 3264 |
apply (metis cos_pi_half cos_two_neq_zero) |
53079 | 3265 |
done |
23053 | 3266 |
|
3267 |
lemmas pi_half_neq_two [simp] = pi_half_less_two [THEN less_imp_neq] |
|
3268 |
lemmas pi_half_le_two [simp] = pi_half_less_two [THEN order_less_imp_le] |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3269 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3270 |
lemma pi_gt_zero [simp]: "0 < pi" |
53079 | 3271 |
using pi_half_gt_zero by simp |
23053 | 3272 |
|
3273 |
lemma pi_ge_zero [simp]: "0 \<le> pi" |
|
53079 | 3274 |
by (rule pi_gt_zero [THEN order_less_imp_le]) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3275 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3276 |
lemma pi_neq_zero [simp]: "pi \<noteq> 0" |
53079 | 3277 |
by (rule pi_gt_zero [THEN less_imp_neq, symmetric]) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3278 |
|
23053 | 3279 |
lemma pi_not_less_zero [simp]: "\<not> pi < 0" |
53079 | 3280 |
by (simp add: linorder_not_less) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3281 |
|
29165
562f95f06244
cleaned up some proofs; removed redundant simp rules
huffman
parents:
29164
diff
changeset
|
3282 |
lemma minus_pi_half_less_zero: "-(pi/2) < 0" |
53079 | 3283 |
by simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3284 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3285 |
lemma m2pi_less_pi: "- (2*pi) < pi" |
53079 | 3286 |
by simp |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3287 |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3288 |
lemma sin_pi_half [simp]: "sin(pi/2) = 1" |
53079 | 3289 |
using sin_cos_squared_add2 [where x = "pi/2"] |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3290 |
using sin_gt_zero_02 [OF pi_half_gt_zero pi_half_less_two] |
53079 | 3291 |
by (simp add: power2_eq_1_iff) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3292 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3293 |
lemma sin_of_real_pi_half [simp]: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3294 |
fixes x :: "'a :: {real_field,banach,real_normed_algebra_1}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3295 |
shows "sin ((of_real pi / 2) :: 'a) = 1" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3296 |
using sin_pi_half |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3297 |
by (metis sin_pi_half eq_numeral_simps(4) nonzero_of_real_divide of_real_1 of_real_numeral sin_of_real) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3298 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3299 |
lemma sin_cos_eq: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3300 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3301 |
shows "sin x = cos (of_real pi / 2 - x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3302 |
by (simp add: cos_diff) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3303 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3304 |
lemma minus_sin_cos_eq: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3305 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3306 |
shows "-sin x = cos (x + of_real pi / 2)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3307 |
by (simp add: cos_add nonzero_of_real_divide) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3308 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3309 |
lemma cos_sin_eq: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3310 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3311 |
shows "cos x = sin (of_real pi / 2 - x)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3312 |
using sin_cos_eq [of "of_real pi / 2 - x"] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3313 |
by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3314 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3315 |
lemma sin_add: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3316 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3317 |
shows "sin (x + y) = sin x * cos y + cos x * sin y" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3318 |
using cos_add [of "of_real pi / 2 - x" "-y"] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3319 |
by (simp add: cos_sin_eq) (simp add: sin_cos_eq) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3320 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3321 |
lemma sin_diff: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3322 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3323 |
shows "sin (x - y) = sin x * cos y - cos x * sin y" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3324 |
using sin_add [of x "- y"] by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3325 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3326 |
lemma sin_double: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3327 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3328 |
shows "sin(2 * x) = 2 * sin x * cos x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3329 |
using sin_add [where x=x and y=x] by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3330 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3331 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3332 |
lemma cos_of_real_pi [simp]: "cos (of_real pi) = -1" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3333 |
using cos_add [where x = "pi/2" and y = "pi/2"] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3334 |
by (simp add: cos_of_real) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3335 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3336 |
lemma sin_of_real_pi [simp]: "sin (of_real pi) = 0" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3337 |
using sin_add [where x = "pi/2" and y = "pi/2"] |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3338 |
by (simp add: sin_of_real) |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3339 |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3340 |
lemma cos_pi [simp]: "cos pi = -1" |
53079 | 3341 |
using cos_add [where x = "pi/2" and y = "pi/2"] by simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3342 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3343 |
lemma sin_pi [simp]: "sin pi = 0" |
53079 | 3344 |
using sin_add [where x = "pi/2" and y = "pi/2"] by simp |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3345 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3346 |
lemma sin_periodic_pi [simp]: "sin (x + pi) = - sin x" |
53079 | 3347 |
by (simp add: sin_add) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3348 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3349 |
lemma sin_periodic_pi2 [simp]: "sin (pi + x) = - sin x" |
53079 | 3350 |
by (simp add: sin_add) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3351 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3352 |
lemma cos_periodic_pi [simp]: "cos (x + pi) = - cos x" |
53079 | 3353 |
by (simp add: cos_add) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3354 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3355 |
lemma sin_periodic [simp]: "sin (x + 2*pi) = sin x" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3356 |
by (simp add: sin_add sin_double cos_double) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3357 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3358 |
lemma cos_periodic [simp]: "cos (x + 2*pi) = cos x" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3359 |
by (simp add: cos_add sin_double cos_double) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3360 |
|
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
3361 |
lemma cos_npi [simp]: "cos (real n * pi) = (- 1) ^ n" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3362 |
by (induct n) (auto simp: real_of_nat_Suc distrib_right) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3363 |
|
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
3364 |
lemma cos_npi2 [simp]: "cos (pi * real n) = (- 1) ^ n" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
3365 |
by (metis cos_npi mult.commute) |
15383 | 3366 |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3367 |
lemma sin_npi [simp]: "sin (real (n::nat) * pi) = 0" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3368 |
by (induct n) (auto simp: real_of_nat_Suc distrib_right) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3369 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3370 |
lemma sin_npi2 [simp]: "sin (pi * real (n::nat)) = 0" |
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
3371 |
by (simp add: mult.commute [of pi]) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3372 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3373 |
lemma cos_two_pi [simp]: "cos (2*pi) = 1" |
53079 | 3374 |
by (simp add: cos_double) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3375 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3376 |
lemma sin_two_pi [simp]: "sin (2*pi) = 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3377 |
by (simp add: sin_double) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3378 |
|
59741
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3379 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3380 |
lemma sin_times_sin: |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3381 |
fixes w :: "'a::{real_normed_field,banach}" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3382 |
shows "sin(w) * sin(z) = (cos(w - z) - cos(w + z)) / 2" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3383 |
by (simp add: cos_diff cos_add) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3384 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3385 |
lemma sin_times_cos: |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3386 |
fixes w :: "'a::{real_normed_field,banach}" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3387 |
shows "sin(w) * cos(z) = (sin(w + z) + sin(w - z)) / 2" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3388 |
by (simp add: sin_diff sin_add) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3389 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3390 |
lemma cos_times_sin: |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3391 |
fixes w :: "'a::{real_normed_field,banach}" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3392 |
shows "cos(w) * sin(z) = (sin(w + z) - sin(w - z)) / 2" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3393 |
by (simp add: sin_diff sin_add) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3394 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3395 |
lemma cos_times_cos: |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3396 |
fixes w :: "'a::{real_normed_field,banach}" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3397 |
shows "cos(w) * cos(z) = (cos(w - z) + cos(w + z)) / 2" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3398 |
by (simp add: cos_diff cos_add) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3399 |
|
59867
58043346ca64
given up separate type classes demanding `inverse 0 = 0`
haftmann
parents:
59865
diff
changeset
|
3400 |
lemma sin_plus_sin: (*FIXME field should not be necessary*) |
58043346ca64
given up separate type classes demanding `inverse 0 = 0`
haftmann
parents:
59865
diff
changeset
|
3401 |
fixes w :: "'a::{real_normed_field,banach,field}" |
59741
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3402 |
shows "sin(w) + sin(z) = 2 * sin((w + z) / 2) * cos((w - z) / 2)" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3403 |
apply (simp add: mult.assoc sin_times_cos) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3404 |
apply (simp add: field_simps) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3405 |
done |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3406 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3407 |
lemma sin_diff_sin: |
59867
58043346ca64
given up separate type classes demanding `inverse 0 = 0`
haftmann
parents:
59865
diff
changeset
|
3408 |
fixes w :: "'a::{real_normed_field,banach,field}" |
59741
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3409 |
shows "sin(w) - sin(z) = 2 * sin((w - z) / 2) * cos((w + z) / 2)" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3410 |
apply (simp add: mult.assoc sin_times_cos) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3411 |
apply (simp add: field_simps) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3412 |
done |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3413 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3414 |
lemma cos_plus_cos: |
59867
58043346ca64
given up separate type classes demanding `inverse 0 = 0`
haftmann
parents:
59865
diff
changeset
|
3415 |
fixes w :: "'a::{real_normed_field,banach,field}" |
59741
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3416 |
shows "cos(w) + cos(z) = 2 * cos((w + z) / 2) * cos((w - z) / 2)" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3417 |
apply (simp add: mult.assoc cos_times_cos) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3418 |
apply (simp add: field_simps) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3419 |
done |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3420 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3421 |
lemma cos_diff_cos: |
59867
58043346ca64
given up separate type classes demanding `inverse 0 = 0`
haftmann
parents:
59865
diff
changeset
|
3422 |
fixes w :: "'a::{real_normed_field,banach,field}" |
59741
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3423 |
shows "cos(w) - cos(z) = 2 * sin((w + z) / 2) * sin((z - w) / 2)" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3424 |
apply (simp add: mult.assoc sin_times_sin) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3425 |
apply (simp add: field_simps) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3426 |
done |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3427 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3428 |
lemma cos_double_cos: |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3429 |
fixes z :: "'a::{real_normed_field,banach}" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3430 |
shows "cos(2 * z) = 2 * cos z ^ 2 - 1" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3431 |
by (simp add: cos_double sin_squared_eq) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3432 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3433 |
lemma cos_double_sin: |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3434 |
fixes z :: "'a::{real_normed_field,banach}" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3435 |
shows "cos(2 * z) = 1 - 2 * sin z ^ 2" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3436 |
by (simp add: cos_double sin_squared_eq) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3437 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3438 |
lemma sin_pi_minus [simp]: "sin (pi - x) = sin x" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3439 |
by (metis sin_minus sin_periodic_pi minus_minus uminus_add_conv_diff) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3440 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3441 |
lemma cos_pi_minus [simp]: "cos (pi - x) = -(cos x)" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3442 |
by (metis cos_minus cos_periodic_pi uminus_add_conv_diff) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3443 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3444 |
lemma sin_minus_pi [simp]: "sin (x - pi) = - (sin x)" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3445 |
by (simp add: sin_diff) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3446 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3447 |
lemma cos_minus_pi [simp]: "cos (x - pi) = -(cos x)" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3448 |
by (simp add: cos_diff) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3449 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3450 |
lemma sin_2pi_minus [simp]: "sin (2*pi - x) = -(sin x)" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3451 |
by (metis sin_periodic_pi2 add_diff_eq mult_2 sin_pi_minus) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3452 |
|
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3453 |
lemma cos_2pi_minus [simp]: "cos (2*pi - x) = cos x" |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3454 |
by (metis (no_types, hide_lams) cos_add cos_minus cos_two_pi sin_minus sin_two_pi |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3455 |
diff_0_right minus_diff_eq mult_1 mult_zero_left uminus_add_conv_diff) |
5b762cd73a8e
Lots of new material on complex-valued functions. Modified simplification of (x/n)^k
paulson <lp15@cam.ac.uk>
parents:
59731
diff
changeset
|
3456 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3457 |
lemma sin_gt_zero2: "\<lbrakk>0 < x; x < pi/2\<rbrakk> \<Longrightarrow> 0 < sin x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3458 |
by (metis sin_gt_zero_02 order_less_trans pi_half_less_two) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3459 |
|
41970 | 3460 |
lemma sin_less_zero: |
53079 | 3461 |
assumes "- pi/2 < x" and "x < 0" |
3462 |
shows "sin x < 0" |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3463 |
proof - |
41970 | 3464 |
have "0 < sin (- x)" using assms by (simp only: sin_gt_zero2) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3465 |
thus ?thesis by simp |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3466 |
qed |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3467 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3468 |
lemma pi_less_4: "pi < 4" |
53079 | 3469 |
using pi_half_less_two by auto |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3470 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3471 |
lemma cos_gt_zero: "\<lbrakk>0 < x; x < pi/2\<rbrakk> \<Longrightarrow> 0 < cos x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3472 |
by (simp add: cos_sin_eq sin_gt_zero2) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3473 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3474 |
lemma cos_gt_zero_pi: "\<lbrakk>-(pi/2) < x; x < pi/2\<rbrakk> \<Longrightarrow> 0 < cos x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3475 |
using cos_gt_zero [of x] cos_gt_zero [of "-x"] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3476 |
by (cases rule: linorder_cases [of x 0]) auto |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3477 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3478 |
lemma cos_ge_zero: "\<lbrakk>-(pi/2) \<le> x; x \<le> pi/2\<rbrakk> \<Longrightarrow> 0 \<le> cos x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3479 |
apply (auto simp: order_le_less cos_gt_zero_pi) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3480 |
by (metis cos_pi_half eq_divide_eq eq_numeral_simps(4)) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3481 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3482 |
lemma sin_gt_zero: "\<lbrakk>0 < x; x < pi \<rbrakk> \<Longrightarrow> 0 < sin x" |
53079 | 3483 |
by (simp add: sin_cos_eq cos_gt_zero_pi) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3484 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3485 |
lemma sin_lt_zero: "pi < x \<Longrightarrow> x < 2*pi \<Longrightarrow> sin x < 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3486 |
using sin_gt_zero [of "x-pi"] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3487 |
by (simp add: sin_diff) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3488 |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3489 |
lemma pi_ge_two: "2 \<le> pi" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3490 |
proof (rule ccontr) |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3491 |
assume "\<not> 2 \<le> pi" hence "pi < 2" by auto |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3492 |
have "\<exists>y > pi. y < 2 \<and> y < 2*pi" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3493 |
proof (cases "2 < 2*pi") |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3494 |
case True with dense[OF `pi < 2`] show ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3495 |
next |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3496 |
case False have "pi < 2*pi" by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3497 |
from dense[OF this] and False show ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3498 |
qed |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3499 |
then obtain y where "pi < y" and "y < 2" and "y < 2*pi" by blast |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3500 |
hence "0 < sin y" using sin_gt_zero_02 by auto |
41970 | 3501 |
moreover |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3502 |
have "sin y < 0" using sin_gt_zero[of "y - pi"] `pi < y` and `y < 2*pi` sin_periodic_pi[of "y - pi"] by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3503 |
ultimately show False by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3504 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3505 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3506 |
lemma sin_ge_zero: "\<lbrakk>0 \<le> x; x \<le> pi\<rbrakk> \<Longrightarrow> 0 \<le> sin x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3507 |
by (auto simp: order_le_less sin_gt_zero) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3508 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3509 |
lemma sin_le_zero: "pi \<le> x \<Longrightarrow> x < 2*pi \<Longrightarrow> sin x \<le> 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3510 |
using sin_ge_zero [of "x-pi"] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3511 |
by (simp add: sin_diff) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3512 |
|
44745 | 3513 |
text {* FIXME: This proof is almost identical to lemma @{text cos_is_zero}. |
3514 |
It should be possible to factor out some of the common parts. *} |
|
3515 |
||
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3516 |
lemma cos_total: "\<lbrakk>-1 \<le> y; y \<le> 1\<rbrakk> \<Longrightarrow> EX! x. 0 \<le> x & x \<le> pi & (cos x = y)" |
44745 | 3517 |
proof (rule ex_ex1I) |
3518 |
assume y: "-1 \<le> y" "y \<le> 1" |
|
3519 |
show "\<exists>x. 0 \<le> x & x \<le> pi & cos x = y" |
|
3520 |
by (rule IVT2, simp_all add: y) |
|
3521 |
next |
|
3522 |
fix a b |
|
3523 |
assume a: "0 \<le> a \<and> a \<le> pi \<and> cos a = y" |
|
3524 |
assume b: "0 \<le> b \<and> b \<le> pi \<and> cos b = y" |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3525 |
have [simp]: "\<forall>x::real. cos differentiable (at x)" |
56181
2aa0b19e74f3
unify syntax for has_derivative and differentiable
hoelzl
parents:
56167
diff
changeset
|
3526 |
unfolding real_differentiable_def by (auto intro: DERIV_cos) |
44745 | 3527 |
from a b show "a = b" |
3528 |
apply (cut_tac less_linear [of a b], auto) |
|
3529 |
apply (drule_tac f = cos in Rolle) |
|
3530 |
apply (drule_tac [5] f = cos in Rolle) |
|
3531 |
apply (auto dest!: DERIV_cos [THEN DERIV_unique]) |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3532 |
apply (metis order_less_le_trans less_le sin_gt_zero) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3533 |
apply (metis order_less_le_trans less_le sin_gt_zero) |
44745 | 3534 |
done |
3535 |
qed |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3536 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3537 |
lemma sin_total: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3538 |
assumes y: "-1 \<le> y" "y \<le> 1" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3539 |
shows "\<exists>! x. -(pi/2) \<le> x & x \<le> pi/2 & (sin x = y)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3540 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3541 |
from cos_total [OF y] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3542 |
obtain x where x: "0 \<le> x" "x \<le> pi" "cos x = y" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3543 |
and uniq: "\<And>x'. 0 \<le> x' \<Longrightarrow> x' \<le> pi \<Longrightarrow> cos x' = y \<Longrightarrow> x' = x " |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3544 |
by blast |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3545 |
show ?thesis |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3546 |
apply (simp add: sin_cos_eq) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3547 |
apply (rule ex1I [where a="pi/2 - x"]) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3548 |
apply (cut_tac [2] x'="pi/2 - xa" in uniq) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3549 |
using x |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3550 |
apply auto |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3551 |
done |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3552 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3553 |
|
60155
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
3554 |
lemma reals_Archimedean4': |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
3555 |
"\<lbrakk>0 < y; 0 \<le> x\<rbrakk> \<Longrightarrow> \<exists>n. real n * y \<le> x \<and> x < real (Suc n) * y" |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
3556 |
apply (rule_tac x="nat (floor (x/y))" in exI) |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
3557 |
using floor_correct [of "x/y"] |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
3558 |
apply (auto simp: Real.real_of_nat_Suc field_simps) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3559 |
done |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3560 |
|
15229 | 3561 |
lemma cos_zero_lemma: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3562 |
"\<lbrakk>0 \<le> x; cos x = 0\<rbrakk> \<Longrightarrow> |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3563 |
\<exists>n::nat. odd n & x = real n * (pi/2)" |
60155
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
3564 |
apply (erule reals_Archimedean4 [OF pi_gt_zero]) |
91477b3a2d6b
Tidying. Improved simplification for numerals, esp in exponents.
paulson <lp15@cam.ac.uk>
parents:
60150
diff
changeset
|
3565 |
apply (auto simp: ) |
41970 | 3566 |
apply (subgoal_tac "0 \<le> x - real n * pi & |
15086 | 3567 |
(x - real n * pi) \<le> pi & (cos (x - real n * pi) = 0) ") |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3568 |
apply (auto simp: algebra_simps real_of_nat_Suc) |
29667 | 3569 |
prefer 2 apply (simp add: cos_diff) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3570 |
apply (simp add: cos_diff) |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3571 |
apply (subgoal_tac "EX! x. 0 \<le> x & x \<le> pi & cos x = 0") |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3572 |
apply (rule_tac [2] cos_total, safe) |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3573 |
apply (drule_tac x = "x - real n * pi" in spec) |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3574 |
apply (drule_tac x = "pi/2" in spec) |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3575 |
apply (simp add: cos_diff) |
15229 | 3576 |
apply (rule_tac x = "Suc (2 * n)" in exI) |
29667 | 3577 |
apply (simp add: real_of_nat_Suc algebra_simps, auto) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3578 |
done |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3579 |
|
15229 | 3580 |
lemma sin_zero_lemma: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3581 |
"\<lbrakk>0 \<le> x; sin x = 0\<rbrakk> \<Longrightarrow> |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3582 |
\<exists>n::nat. even n & x = real n * (pi/2)" |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3583 |
apply (subgoal_tac "\<exists>n::nat. ~ even n & x + pi/2 = real n * (pi/2) ") |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3584 |
apply (clarify, rule_tac x = "n - 1" in exI) |
58709
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3585 |
apply (auto elim!: oddE simp add: real_of_nat_Suc field_simps)[1] |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3586 |
apply (rule cos_zero_lemma) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3587 |
apply (auto simp: cos_add) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3588 |
done |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3589 |
|
15229 | 3590 |
lemma cos_zero_iff: |
41970 | 3591 |
"(cos x = 0) = |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3592 |
((\<exists>n::nat. odd n & (x = real n * (pi/2))) | |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3593 |
(\<exists>n::nat. odd n & (x = -(real n * (pi/2)))))" |
58709
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3594 |
proof - |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3595 |
{ fix n :: nat |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3596 |
assume "odd n" |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3597 |
then obtain m where "n = 2 * m + 1" .. |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3598 |
then have "cos (real n * pi / 2) = 0" |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3599 |
by (simp add: field_simps real_of_nat_Suc) (simp add: cos_add add_divide_distrib) |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3600 |
} note * = this |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3601 |
show ?thesis |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3602 |
apply (rule iffI) |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3603 |
apply (cut_tac linorder_linear [of 0 x], safe) |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3604 |
apply (drule cos_zero_lemma, assumption+) |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3605 |
apply (cut_tac x="-x" in cos_zero_lemma, simp, simp) |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3606 |
apply (auto dest: *) |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3607 |
done |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3608 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3609 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3610 |
(* ditto: but to a lesser extent *) |
15229 | 3611 |
lemma sin_zero_iff: |
41970 | 3612 |
"(sin x = 0) = |
3613 |
((\<exists>n::nat. even n & (x = real n * (pi/2))) | |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3614 |
(\<exists>n::nat. even n & (x = -(real n * (pi/2)))))" |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3615 |
apply (rule iffI) |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3616 |
apply (cut_tac linorder_linear [of 0 x], safe) |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3617 |
apply (drule sin_zero_lemma, assumption+) |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3618 |
apply (cut_tac x="-x" in sin_zero_lemma, simp, simp, safe) |
41970 | 3619 |
apply (force simp add: minus_equation_iff [of x]) |
58709
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
3620 |
apply (auto elim: evenE) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3621 |
done |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3622 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3623 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3624 |
lemma cos_zero_iff_int: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3625 |
"cos x = 0 \<longleftrightarrow> (\<exists>n::int. odd n & x = real n * (pi/2))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3626 |
proof safe |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3627 |
assume "cos x = 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3628 |
then show "\<exists>n::int. odd n & x = real n * (pi/2)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3629 |
apply (simp add: cos_zero_iff, safe) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3630 |
apply (metis even_int_iff real_of_int_of_nat_eq) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3631 |
apply (rule_tac x="- (int n)" in exI, simp) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3632 |
done |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3633 |
next |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3634 |
fix n::int |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3635 |
assume "odd n" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3636 |
then show "cos (real n * (pi / 2)) = 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3637 |
apply (simp add: cos_zero_iff) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3638 |
apply (case_tac n rule: int_cases2, simp) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3639 |
apply (rule disjI2) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3640 |
apply (rule_tac x="nat (-n)" in exI, simp) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3641 |
done |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3642 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3643 |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3644 |
lemma sin_zero_iff_int: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3645 |
"sin x = 0 \<longleftrightarrow> (\<exists>n::int. even n & (x = real n * (pi/2)))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3646 |
proof safe |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3647 |
assume "sin x = 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3648 |
then show "\<exists>n::int. even n \<and> x = real n * (pi / 2)" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3649 |
apply (simp add: sin_zero_iff, safe) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3650 |
apply (metis even_int_iff real_of_int_of_nat_eq) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3651 |
apply (rule_tac x="- (int n)" in exI, simp) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3652 |
done |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3653 |
next |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3654 |
fix n::int |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3655 |
assume "even n" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3656 |
then show "sin (real n * (pi / 2)) = 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3657 |
apply (simp add: sin_zero_iff) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3658 |
apply (case_tac n rule: int_cases2, simp) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3659 |
apply (rule disjI2) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3660 |
apply (rule_tac x="nat (-n)" in exI, simp) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3661 |
done |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3662 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3663 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3664 |
lemma sin_zero_iff_int2: "sin x = 0 \<longleftrightarrow> (\<exists>n::int. x = real n * pi)" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3665 |
apply (simp only: sin_zero_iff_int) |
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3666 |
apply (safe elim!: evenE) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3667 |
apply (simp_all add: field_simps) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3668 |
using dvd_triv_left by fastforce |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3669 |
|
53079 | 3670 |
lemma cos_monotone_0_pi: |
3671 |
assumes "0 \<le> y" and "y < x" and "x \<le> pi" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3672 |
shows "cos x < cos y" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3673 |
proof - |
33549 | 3674 |
have "- (x - y) < 0" using assms by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3675 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3676 |
from MVT2[OF `y < x` DERIV_cos[THEN impI, THEN allI]] |
53079 | 3677 |
obtain z where "y < z" and "z < x" and cos_diff: "cos x - cos y = (x - y) * - sin z" |
3678 |
by auto |
|
33549 | 3679 |
hence "0 < z" and "z < pi" using assms by auto |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3680 |
hence "0 < sin z" using sin_gt_zero by auto |
53079 | 3681 |
hence "cos x - cos y < 0" |
3682 |
unfolding cos_diff minus_mult_commute[symmetric] |
|
3683 |
using `- (x - y) < 0` by (rule mult_pos_neg2) |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3684 |
thus ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3685 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3686 |
|
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3687 |
lemma cos_monotone_0_pi_le: |
53079 | 3688 |
assumes "0 \<le> y" and "y \<le> x" and "x \<le> pi" |
3689 |
shows "cos x \<le> cos y" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3690 |
proof (cases "y < x") |
53079 | 3691 |
case True |
3692 |
show ?thesis |
|
3693 |
using cos_monotone_0_pi[OF `0 \<le> y` True `x \<le> pi`] by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3694 |
next |
53079 | 3695 |
case False |
3696 |
hence "y = x" using `y \<le> x` by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3697 |
thus ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3698 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3699 |
|
53079 | 3700 |
lemma cos_monotone_minus_pi_0: |
3701 |
assumes "-pi \<le> y" and "y < x" and "x \<le> 0" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3702 |
shows "cos y < cos x" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3703 |
proof - |
53079 | 3704 |
have "0 \<le> -x" and "-x < -y" and "-y \<le> pi" |
3705 |
using assms by auto |
|
3706 |
from cos_monotone_0_pi[OF this] show ?thesis |
|
3707 |
unfolding cos_minus . |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3708 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3709 |
|
53079 | 3710 |
lemma cos_monotone_minus_pi_0': |
3711 |
assumes "-pi \<le> y" and "y \<le> x" and "x \<le> 0" |
|
3712 |
shows "cos y \<le> cos x" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3713 |
proof (cases "y < x") |
53079 | 3714 |
case True |
3715 |
show ?thesis using cos_monotone_minus_pi_0[OF `-pi \<le> y` True `x \<le> 0`] |
|
3716 |
by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3717 |
next |
53079 | 3718 |
case False |
3719 |
hence "y = x" using `y \<le> x` by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3720 |
thus ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3721 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3722 |
|
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3723 |
lemma sin_monotone_2pi: |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3724 |
assumes "- (pi/2) \<le> y" and "y < x" and "x \<le> pi/2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3725 |
shows "sin y < sin x" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3726 |
apply (simp add: sin_cos_eq) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3727 |
apply (rule cos_monotone_0_pi) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3728 |
using assms |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3729 |
apply auto |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3730 |
done |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3731 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3732 |
lemma sin_monotone_2pi_le: |
53079 | 3733 |
assumes "- (pi / 2) \<le> y" and "y \<le> x" and "x \<le> pi / 2" |
3734 |
shows "sin y \<le> sin x" |
|
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3735 |
by (metis assms le_less sin_monotone_2pi) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3736 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3737 |
lemma sin_x_le_x: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3738 |
fixes x::real assumes x: "x \<ge> 0" shows "sin x \<le> x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3739 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3740 |
let ?f = "\<lambda>x. x - sin x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3741 |
from x have "?f x \<ge> ?f 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3742 |
apply (rule DERIV_nonneg_imp_nondecreasing) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3743 |
apply (intro allI impI exI[of _ "1 - cos x" for x]) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3744 |
apply (auto intro!: derivative_eq_intros simp: field_simps) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3745 |
done |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3746 |
thus "sin x \<le> x" by simp |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
3747 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3748 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3749 |
lemma sin_x_ge_neg_x: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3750 |
fixes x::real assumes x: "x \<ge> 0" shows "sin x \<ge> - x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3751 |
proof - |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3752 |
let ?f = "\<lambda>x. x + sin x" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3753 |
from x have "?f x \<ge> ?f 0" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3754 |
apply (rule DERIV_nonneg_imp_nondecreasing) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3755 |
apply (intro allI impI exI[of _ "1 + cos x" for x]) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3756 |
apply (auto intro!: derivative_eq_intros simp: field_simps real_0_le_add_iff) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3757 |
done |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3758 |
thus "sin x \<ge> -x" by simp |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3759 |
qed |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3760 |
|
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3761 |
lemma abs_sin_x_le_abs_x: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3762 |
fixes x::real shows "\<bar>sin x\<bar> \<le> \<bar>x\<bar>" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3763 |
using sin_x_ge_neg_x [of x] sin_x_le_x [of x] sin_x_ge_neg_x [of "-x"] sin_x_le_x [of "-x"] |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3764 |
by (auto simp: abs_real_def) |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3765 |
|
53079 | 3766 |
|
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3767 |
subsection {* More Corollaries about Sine and Cosine *} |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3768 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3769 |
lemma sin_cos_npi [simp]: "sin (real (Suc (2 * n)) * pi / 2) = (-1) ^ n" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3770 |
proof - |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3771 |
have "sin ((real n + 1/2) * pi) = cos (real n * pi)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3772 |
by (auto simp: algebra_simps sin_add) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3773 |
thus ?thesis |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3774 |
by (simp add: real_of_nat_Suc distrib_right add_divide_distrib |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3775 |
mult.commute [of pi]) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3776 |
qed |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3777 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3778 |
lemma cos_2npi [simp]: "cos (2 * real (n::nat) * pi) = 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3779 |
by (cases "even n") (simp_all add: cos_double mult.assoc) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3780 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3781 |
lemma cos_3over2_pi [simp]: "cos (3/2*pi) = 0" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3782 |
apply (subgoal_tac "cos (pi + pi/2) = 0", simp) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3783 |
apply (subst cos_add, simp) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3784 |
done |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3785 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3786 |
lemma sin_2npi [simp]: "sin (2 * real (n::nat) * pi) = 0" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3787 |
by (auto simp: mult.assoc sin_double) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3788 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3789 |
lemma sin_3over2_pi [simp]: "sin (3/2*pi) = - 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3790 |
apply (subgoal_tac "sin (pi + pi/2) = - 1", simp) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3791 |
apply (subst sin_add, simp) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3792 |
done |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3793 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3794 |
lemma cos_pi_eq_zero [simp]: "cos (pi * real (Suc (2 * m)) / 2) = 0" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3795 |
by (simp only: cos_add sin_add real_of_nat_Suc distrib_right distrib_left add_divide_distrib, auto) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3796 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3797 |
lemma DERIV_cos_add [simp]: "DERIV (\<lambda>x. cos (x + k)) xa :> - sin (xa + k)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3798 |
by (auto intro!: derivative_eq_intros) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3799 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3800 |
lemma sin_zero_norm_cos_one: |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3801 |
fixes x :: "'a::{real_normed_field,banach}" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3802 |
assumes "sin x = 0" shows "norm (cos x) = 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3803 |
using sin_cos_squared_add [of x, unfolded assms] |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3804 |
by (simp add: square_norm_one) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3805 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3806 |
lemma sin_zero_abs_cos_one: "sin x = 0 \<Longrightarrow> \<bar>cos x\<bar> = (1::real)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3807 |
using sin_zero_norm_cos_one by fastforce |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3808 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3809 |
lemma cos_one_sin_zero: |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3810 |
fixes x :: "'a::{real_normed_field,banach}" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3811 |
assumes "cos x = 1" shows "sin x = 0" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3812 |
using sin_cos_squared_add [of x, unfolded assms] |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3813 |
by simp |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3814 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3815 |
lemma sin_times_pi_eq_0: "sin(x * pi) = 0 \<longleftrightarrow> x \<in> Ints" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3816 |
by (simp add: sin_zero_iff_int2) (metis Ints_cases Ints_real_of_int real_of_int_def) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3817 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3818 |
lemma cos_one_2pi: |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3819 |
"cos(x) = 1 \<longleftrightarrow> (\<exists>n::nat. x = n * 2*pi) | (\<exists>n::nat. x = -(n * 2*pi))" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3820 |
(is "?lhs = ?rhs") |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3821 |
proof |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3822 |
assume "cos(x) = 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3823 |
then have "sin x = 0" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3824 |
by (simp add: cos_one_sin_zero) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3825 |
then show ?rhs |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3826 |
proof (simp only: sin_zero_iff, elim exE disjE conjE) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3827 |
fix n::nat |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3828 |
assume n: "even n" "x = real n * (pi/2)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3829 |
then obtain m where m: "n = 2 * m" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3830 |
using dvdE by blast |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3831 |
then have me: "even m" using `?lhs` n |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3832 |
by (auto simp: field_simps) (metis one_neq_neg_one power_minus_odd power_one) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3833 |
show ?rhs |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3834 |
using m me n |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3835 |
by (auto simp: field_simps elim!: evenE) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3836 |
next |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3837 |
fix n::nat |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3838 |
assume n: "even n" "x = - (real n * (pi/2))" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3839 |
then obtain m where m: "n = 2 * m" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3840 |
using dvdE by blast |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3841 |
then have me: "even m" using `?lhs` n |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3842 |
by (auto simp: field_simps) (metis one_neq_neg_one power_minus_odd power_one) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3843 |
show ?rhs |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3844 |
using m me n |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3845 |
by (auto simp: field_simps elim!: evenE) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3846 |
qed |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3847 |
next |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3848 |
assume "?rhs" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3849 |
then show "cos x = 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3850 |
by (metis cos_2npi cos_minus mult.assoc mult.left_commute) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3851 |
qed |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3852 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3853 |
lemma cos_one_2pi_int: "cos(x) = 1 \<longleftrightarrow> (\<exists>n::int. x = n * 2*pi)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3854 |
apply auto --{*FIXME simproc bug*} |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3855 |
apply (auto simp: cos_one_2pi) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3856 |
apply (metis real_of_int_of_nat_eq) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3857 |
apply (metis mult_minus_right real_of_int_minus real_of_int_of_nat_eq) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3858 |
by (metis mult_minus_right of_int_of_nat real_of_int_def real_of_nat_def) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3859 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3860 |
lemma sin_cos_sqrt: "0 \<le> sin(x) \<Longrightarrow> (sin(x) = sqrt(1 - (cos(x) ^ 2)))" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3861 |
using sin_squared_eq real_sqrt_unique by fastforce |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3862 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3863 |
lemma sin_eq_0_pi: "-pi < x \<Longrightarrow> x < pi \<Longrightarrow> sin(x) = 0 \<Longrightarrow> x = 0" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3864 |
by (metis sin_gt_zero sin_minus minus_less_iff neg_0_less_iff_less not_less_iff_gr_or_eq) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3865 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3866 |
lemma cos_treble_cos: |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3867 |
fixes x :: "'a::{real_normed_field,banach}" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3868 |
shows "cos(3 * x) = 4 * cos(x) ^ 3 - 3 * cos x" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3869 |
proof - |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3870 |
have *: "(sin x * (sin x * 3)) = 3 - (cos x * (cos x * 3))" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3871 |
by (simp add: mult.assoc [symmetric] sin_squared_eq [unfolded power2_eq_square]) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3872 |
have "cos(3 * x) = cos(2*x + x)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3873 |
by simp |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3874 |
also have "... = 4 * cos(x) ^ 3 - 3 * cos x" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3875 |
apply (simp only: cos_add cos_double sin_double) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3876 |
apply (simp add: * field_simps power2_eq_square power3_eq_cube) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3877 |
done |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3878 |
finally show ?thesis . |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3879 |
qed |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3880 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3881 |
lemma cos_45: "cos (pi / 4) = sqrt 2 / 2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3882 |
proof - |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3883 |
let ?c = "cos (pi / 4)" and ?s = "sin (pi / 4)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3884 |
have nonneg: "0 \<le> ?c" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3885 |
by (simp add: cos_ge_zero) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3886 |
have "0 = cos (pi / 4 + pi / 4)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3887 |
by simp |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3888 |
also have "cos (pi / 4 + pi / 4) = ?c\<^sup>2 - ?s\<^sup>2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3889 |
by (simp only: cos_add power2_eq_square) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3890 |
also have "\<dots> = 2 * ?c\<^sup>2 - 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3891 |
by (simp add: sin_squared_eq) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3892 |
finally have "?c\<^sup>2 = (sqrt 2 / 2)\<^sup>2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3893 |
by (simp add: power_divide) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3894 |
thus ?thesis |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3895 |
using nonneg by (rule power2_eq_imp_eq) simp |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3896 |
qed |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3897 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3898 |
lemma cos_30: "cos (pi / 6) = sqrt 3/2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3899 |
proof - |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3900 |
let ?c = "cos (pi / 6)" and ?s = "sin (pi / 6)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3901 |
have pos_c: "0 < ?c" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3902 |
by (rule cos_gt_zero, simp, simp) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3903 |
have "0 = cos (pi / 6 + pi / 6 + pi / 6)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3904 |
by simp |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3905 |
also have "\<dots> = (?c * ?c - ?s * ?s) * ?c - (?s * ?c + ?c * ?s) * ?s" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3906 |
by (simp only: cos_add sin_add) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3907 |
also have "\<dots> = ?c * (?c\<^sup>2 - 3 * ?s\<^sup>2)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3908 |
by (simp add: algebra_simps power2_eq_square) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3909 |
finally have "?c\<^sup>2 = (sqrt 3/2)\<^sup>2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3910 |
using pos_c by (simp add: sin_squared_eq power_divide) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3911 |
thus ?thesis |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3912 |
using pos_c [THEN order_less_imp_le] |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3913 |
by (rule power2_eq_imp_eq) simp |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3914 |
qed |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3915 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3916 |
lemma sin_45: "sin (pi / 4) = sqrt 2 / 2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3917 |
by (simp add: sin_cos_eq cos_45) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3918 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3919 |
lemma sin_60: "sin (pi / 3) = sqrt 3/2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3920 |
by (simp add: sin_cos_eq cos_30) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3921 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3922 |
lemma cos_60: "cos (pi / 3) = 1 / 2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3923 |
apply (rule power2_eq_imp_eq) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3924 |
apply (simp add: cos_squared_eq sin_60 power_divide) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3925 |
apply (rule cos_ge_zero, rule order_trans [where y=0], simp_all) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3926 |
done |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3927 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3928 |
lemma sin_30: "sin (pi / 6) = 1 / 2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3929 |
by (simp add: sin_cos_eq cos_60) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3930 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3931 |
lemma cos_integer_2pi: "n \<in> Ints \<Longrightarrow> cos(2*pi * n) = 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3932 |
by (metis Ints_cases cos_one_2pi_int mult.assoc mult.commute real_of_int_def) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3933 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3934 |
lemma sin_integer_2pi: "n \<in> Ints \<Longrightarrow> sin(2*pi * n) = 0" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3935 |
by (metis sin_two_pi Ints_mult mult.assoc mult.commute sin_times_pi_eq_0) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3936 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3937 |
lemma cos_int_2npi [simp]: "cos (2 * real (n::int) * pi) = 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3938 |
by (simp add: cos_one_2pi_int) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3939 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3940 |
lemma sin_int_2npi [simp]: "sin (2 * real (n::int) * pi) = 0" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3941 |
by (metis Ints_real_of_int mult.assoc mult.commute sin_integer_2pi) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3942 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3943 |
lemma sincos_principal_value: "\<exists>y. (-pi < y \<and> y \<le> pi) \<and> (sin(y) = sin(x) \<and> cos(y) = cos(x))" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3944 |
apply (rule exI [where x="pi - (2*pi) * frac((pi - x) / (2*pi))"]) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3945 |
apply (auto simp: field_simps frac_lt_1) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3946 |
apply (simp_all add: frac_def divide_simps) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3947 |
apply (simp_all add: add_divide_distrib diff_divide_distrib) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3948 |
apply (simp_all add: sin_diff cos_diff mult.assoc [symmetric] cos_integer_2pi sin_integer_2pi) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3949 |
done |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3950 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
3951 |
|
29164 | 3952 |
subsection {* Tangent *} |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3953 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3954 |
definition tan :: "'a \<Rightarrow> 'a::{real_normed_field,banach}" |
53079 | 3955 |
where "tan = (\<lambda>x. sin x / cos x)" |
23043 | 3956 |
|
59862 | 3957 |
lemma tan_of_real: |
59867
58043346ca64
given up separate type classes demanding `inverse 0 = 0`
haftmann
parents:
59865
diff
changeset
|
3958 |
fixes XXX :: "'a::{real_normed_field,banach}" |
59862 | 3959 |
shows "of_real(tan x) = (tan(of_real x) :: 'a)" |
3960 |
by (simp add: tan_def sin_of_real cos_of_real) |
|
3961 |
||
3962 |
lemma tan_in_Reals [simp]: |
|
59867
58043346ca64
given up separate type classes demanding `inverse 0 = 0`
haftmann
parents:
59865
diff
changeset
|
3963 |
fixes z :: "'a::{real_normed_field,banach}" |
59862 | 3964 |
shows "z \<in> \<real> \<Longrightarrow> tan z \<in> \<real>" |
3965 |
by (simp add: tan_def) |
|
3966 |
||
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3967 |
lemma tan_zero [simp]: "tan 0 = 0" |
44311 | 3968 |
by (simp add: tan_def) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3969 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3970 |
lemma tan_pi [simp]: "tan pi = 0" |
44311 | 3971 |
by (simp add: tan_def) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3972 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3973 |
lemma tan_npi [simp]: "tan (real (n::nat) * pi) = 0" |
44311 | 3974 |
by (simp add: tan_def) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3975 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3976 |
lemma tan_minus [simp]: "tan (-x) = - tan x" |
44311 | 3977 |
by (simp add: tan_def) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3978 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3979 |
lemma tan_periodic [simp]: "tan (x + 2*pi) = tan x" |
44311 | 3980 |
by (simp add: tan_def) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3981 |
|
41970 | 3982 |
lemma lemma_tan_add1: |
44311 | 3983 |
"\<lbrakk>cos x \<noteq> 0; cos y \<noteq> 0\<rbrakk> \<Longrightarrow> 1 - tan x * tan y = cos (x + y)/(cos x * cos y)" |
3984 |
by (simp add: tan_def cos_add field_simps) |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3985 |
|
41970 | 3986 |
lemma add_tan_eq: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3987 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3988 |
shows "\<lbrakk>cos x \<noteq> 0; cos y \<noteq> 0\<rbrakk> \<Longrightarrow> tan x + tan y = sin(x + y)/(cos x * cos y)" |
44311 | 3989 |
by (simp add: tan_def sin_add field_simps) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3990 |
|
15229 | 3991 |
lemma tan_add: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3992 |
fixes x :: "'a::{real_normed_field,banach}" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
3993 |
shows |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3994 |
"\<lbrakk>cos x \<noteq> 0; cos y \<noteq> 0; cos (x + y) \<noteq> 0\<rbrakk> |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3995 |
\<Longrightarrow> tan(x + y) = (tan(x) + tan(y))/(1 - tan(x) * tan(y))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3996 |
by (simp add: add_tan_eq lemma_tan_add1 field_simps) (simp add: tan_def) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
3997 |
|
15229 | 3998 |
lemma tan_double: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
3999 |
fixes x :: "'a::{real_normed_field,banach}" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
4000 |
shows |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4001 |
"\<lbrakk>cos x \<noteq> 0; cos (2 * x) \<noteq> 0\<rbrakk> |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4002 |
\<Longrightarrow> tan (2 * x) = (2 * tan x) / (1 - (tan x)\<^sup>2)" |
44311 | 4003 |
using tan_add [of x x] by (simp add: power2_eq_square) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4004 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4005 |
lemma tan_gt_zero: "\<lbrakk>0 < x; x < pi/2\<rbrakk> \<Longrightarrow> 0 < tan x" |
53079 | 4006 |
by (simp add: tan_def zero_less_divide_iff sin_gt_zero2 cos_gt_zero_pi) |
41970 | 4007 |
|
4008 |
lemma tan_less_zero: |
|
53079 | 4009 |
assumes lb: "- pi/2 < x" and "x < 0" |
4010 |
shows "tan x < 0" |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4011 |
proof - |
41970 | 4012 |
have "0 < tan (- x)" using assms by (simp only: tan_gt_zero) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4013 |
thus ?thesis by simp |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4014 |
qed |
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4015 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4016 |
lemma tan_half: |
59867
58043346ca64
given up separate type classes demanding `inverse 0 = 0`
haftmann
parents:
59865
diff
changeset
|
4017 |
fixes x :: "'a::{real_normed_field,banach,field}" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4018 |
shows "tan x = sin (2 * x) / (cos (2 * x) + 1)" |
44756
efcd71fbaeec
simplify proof of tan_half, removing unused assumptions
huffman
parents:
44755
diff
changeset
|
4019 |
unfolding tan_def sin_double cos_double sin_squared_eq |
efcd71fbaeec
simplify proof of tan_half, removing unused assumptions
huffman
parents:
44755
diff
changeset
|
4020 |
by (simp add: power2_eq_square) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4021 |
|
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4022 |
lemma tan_30: "tan (pi / 6) = 1 / sqrt 3" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4023 |
unfolding tan_def by (simp add: sin_30 cos_30) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4024 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4025 |
lemma tan_45: "tan (pi / 4) = 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4026 |
unfolding tan_def by (simp add: sin_45 cos_45) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4027 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4028 |
lemma tan_60: "tan (pi / 3) = sqrt 3" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4029 |
unfolding tan_def by (simp add: sin_60 cos_60) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4030 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4031 |
lemma DERIV_tan [simp]: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4032 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4033 |
shows "cos x \<noteq> 0 \<Longrightarrow> DERIV tan x :> inverse ((cos x)\<^sup>2)" |
44311 | 4034 |
unfolding tan_def |
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
4035 |
by (auto intro!: derivative_eq_intros, simp add: divide_inverse power2_eq_square) |
44311 | 4036 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4037 |
lemma isCont_tan: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4038 |
fixes x :: "'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4039 |
shows "cos x \<noteq> 0 \<Longrightarrow> isCont tan x" |
44311 | 4040 |
by (rule DERIV_tan [THEN DERIV_isCont]) |
4041 |
||
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4042 |
lemma isCont_tan' [simp,continuous_intros]: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4043 |
fixes a :: "'a::{real_normed_field,banach}" and f :: "'a \<Rightarrow> 'a" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4044 |
shows "\<lbrakk>isCont f a; cos (f a) \<noteq> 0\<rbrakk> \<Longrightarrow> isCont (\<lambda>x. tan (f x)) a" |
44311 | 4045 |
by (rule isCont_o2 [OF _ isCont_tan]) |
4046 |
||
4047 |
lemma tendsto_tan [tendsto_intros]: |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4048 |
fixes f :: "'a \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4049 |
shows "\<lbrakk>(f ---> a) F; cos a \<noteq> 0\<rbrakk> \<Longrightarrow> ((\<lambda>x. tan (f x)) ---> tan a) F" |
44311 | 4050 |
by (rule isCont_tendsto_compose [OF isCont_tan]) |
4051 |
||
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4052 |
lemma continuous_tan: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4053 |
fixes f :: "'a \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4054 |
shows "continuous F f \<Longrightarrow> cos (f (Lim F (\<lambda>x. x))) \<noteq> 0 \<Longrightarrow> continuous F (\<lambda>x. tan (f x))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4055 |
unfolding continuous_def by (rule tendsto_tan) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4056 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4057 |
lemma continuous_on_tan [continuous_intros]: |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4058 |
fixes f :: "'a \<Rightarrow> 'a::{real_normed_field,banach}" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4059 |
shows "continuous_on s f \<Longrightarrow> (\<forall>x\<in>s. cos (f x) \<noteq> 0) \<Longrightarrow> continuous_on s (\<lambda>x. tan (f x))" |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4060 |
unfolding continuous_on_def by (auto intro: tendsto_tan) |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4061 |
|
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4062 |
lemma continuous_within_tan [continuous_intros]: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4063 |
fixes f :: "'a \<Rightarrow> 'a::{real_normed_field,banach}" |
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
4064 |
shows |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4065 |
"continuous (at x within s) f \<Longrightarrow> cos (f x) \<noteq> 0 \<Longrightarrow> continuous (at x within s) (\<lambda>x. tan (f x))" |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4066 |
unfolding continuous_within by (rule tendsto_tan) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4067 |
|
53079 | 4068 |
lemma LIM_cos_div_sin: "(\<lambda>x. cos(x)/sin(x)) -- pi/2 --> 0" |
44311 | 4069 |
by (rule LIM_cong_limit, (rule tendsto_intros)+, simp_all) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4070 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4071 |
lemma lemma_tan_total: "0 < y ==> \<exists>x. 0 < x & x < pi/2 & y < tan x" |
53079 | 4072 |
apply (cut_tac LIM_cos_div_sin) |
4073 |
apply (simp only: LIM_eq) |
|
4074 |
apply (drule_tac x = "inverse y" in spec, safe, force) |
|
4075 |
apply (drule_tac ?d1.0 = s in pi_half_gt_zero [THEN [2] real_lbound_gt_zero], safe) |
|
4076 |
apply (rule_tac x = "(pi/2) - e" in exI) |
|
4077 |
apply (simp (no_asm_simp)) |
|
4078 |
apply (drule_tac x = "(pi/2) - e" in spec) |
|
4079 |
apply (auto simp add: tan_def sin_diff cos_diff) |
|
4080 |
apply (rule inverse_less_iff_less [THEN iffD1]) |
|
4081 |
apply (auto simp add: divide_inverse) |
|
4082 |
apply (rule mult_pos_pos) |
|
4083 |
apply (subgoal_tac [3] "0 < sin e & 0 < cos e") |
|
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
4084 |
apply (auto intro: cos_gt_zero sin_gt_zero2 simp add: mult.commute) |
53079 | 4085 |
done |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4086 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4087 |
lemma tan_total_pos: "0 \<le> y ==> \<exists>x. 0 \<le> x & x < pi/2 & tan x = y" |
53079 | 4088 |
apply (frule order_le_imp_less_or_eq, safe) |
4089 |
prefer 2 apply force |
|
4090 |
apply (drule lemma_tan_total, safe) |
|
4091 |
apply (cut_tac f = tan and a = 0 and b = x and y = y in IVT_objl) |
|
4092 |
apply (auto intro!: DERIV_tan [THEN DERIV_isCont]) |
|
4093 |
apply (drule_tac y = xa in order_le_imp_less_or_eq) |
|
4094 |
apply (auto dest: cos_gt_zero) |
|
4095 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4096 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4097 |
lemma lemma_tan_total1: "\<exists>x. -(pi/2) < x & x < (pi/2) & tan x = y" |
53079 | 4098 |
apply (cut_tac linorder_linear [of 0 y], safe) |
4099 |
apply (drule tan_total_pos) |
|
4100 |
apply (cut_tac [2] y="-y" in tan_total_pos, safe) |
|
4101 |
apply (rule_tac [3] x = "-x" in exI) |
|
4102 |
apply (auto del: exI intro!: exI) |
|
4103 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4104 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4105 |
lemma tan_total: "EX! x. -(pi/2) < x & x < (pi/2) & tan x = y" |
53079 | 4106 |
apply (cut_tac y = y in lemma_tan_total1, auto) |
57492
74bf65a1910a
Hypsubst preserves equality hypotheses
Thomas Sewell <thomas.sewell@nicta.com.au>
parents:
57418
diff
changeset
|
4107 |
apply hypsubst_thin |
53079 | 4108 |
apply (cut_tac x = xa and y = y in linorder_less_linear, auto) |
4109 |
apply (subgoal_tac [2] "\<exists>z. y < z & z < xa & DERIV tan z :> 0") |
|
4110 |
apply (subgoal_tac "\<exists>z. xa < z & z < y & DERIV tan z :> 0") |
|
4111 |
apply (rule_tac [4] Rolle) |
|
4112 |
apply (rule_tac [2] Rolle) |
|
4113 |
apply (auto del: exI intro!: DERIV_tan DERIV_isCont exI |
|
56181
2aa0b19e74f3
unify syntax for has_derivative and differentiable
hoelzl
parents:
56167
diff
changeset
|
4114 |
simp add: real_differentiable_def) |
53079 | 4115 |
txt{*Now, simulate TRYALL*} |
4116 |
apply (rule_tac [!] DERIV_tan asm_rl) |
|
4117 |
apply (auto dest!: DERIV_unique [OF _ DERIV_tan] |
|
4118 |
simp add: cos_gt_zero_pi [THEN less_imp_neq, THEN not_sym]) |
|
4119 |
done |
|
4120 |
||
4121 |
lemma tan_monotone: |
|
4122 |
assumes "- (pi / 2) < y" and "y < x" and "x < pi / 2" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4123 |
shows "tan y < tan x" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4124 |
proof - |
53079 | 4125 |
have "\<forall>x'. y \<le> x' \<and> x' \<le> x \<longrightarrow> DERIV tan x' :> inverse ((cos x')\<^sup>2)" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4126 |
proof (rule allI, rule impI) |
53079 | 4127 |
fix x' :: real |
4128 |
assume "y \<le> x' \<and> x' \<le> x" |
|
33549 | 4129 |
hence "-(pi/2) < x'" and "x' < pi/2" using assms by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4130 |
from cos_gt_zero_pi[OF this] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4131 |
have "cos x' \<noteq> 0" by auto |
53076 | 4132 |
thus "DERIV tan x' :> inverse ((cos x')\<^sup>2)" by (rule DERIV_tan) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4133 |
qed |
41970 | 4134 |
from MVT2[OF `y < x` this] |
53079 | 4135 |
obtain z where "y < z" and "z < x" |
4136 |
and tan_diff: "tan x - tan y = (x - y) * inverse ((cos z)\<^sup>2)" by auto |
|
33549 | 4137 |
hence "- (pi / 2) < z" and "z < pi / 2" using assms by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4138 |
hence "0 < cos z" using cos_gt_zero_pi by auto |
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4139 |
hence inv_pos: "0 < inverse ((cos z)\<^sup>2)" by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4140 |
have "0 < x - y" using `y < x` by auto |
56544 | 4141 |
with inv_pos have "0 < tan x - tan y" unfolding tan_diff by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4142 |
thus ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4143 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4144 |
|
53079 | 4145 |
lemma tan_monotone': |
4146 |
assumes "- (pi / 2) < y" |
|
4147 |
and "y < pi / 2" |
|
4148 |
and "- (pi / 2) < x" |
|
4149 |
and "x < pi / 2" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4150 |
shows "(y < x) = (tan y < tan x)" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4151 |
proof |
53079 | 4152 |
assume "y < x" |
4153 |
thus "tan y < tan x" |
|
4154 |
using tan_monotone and `- (pi / 2) < y` and `x < pi / 2` by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4155 |
next |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4156 |
assume "tan y < tan x" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4157 |
show "y < x" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4158 |
proof (rule ccontr) |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4159 |
assume "\<not> y < x" hence "x \<le> y" by auto |
41970 | 4160 |
hence "tan x \<le> tan y" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4161 |
proof (cases "x = y") |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4162 |
case True thus ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4163 |
next |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4164 |
case False hence "x < y" using `x \<le> y` by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4165 |
from tan_monotone[OF `- (pi/2) < x` this `y < pi / 2`] show ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4166 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4167 |
thus False using `tan y < tan x` by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4168 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4169 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4170 |
|
53079 | 4171 |
lemma tan_inverse: "1 / (tan y) = tan (pi / 2 - y)" |
4172 |
unfolding tan_def sin_cos_eq[of y] cos_sin_eq[of y] by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4173 |
|
41970 | 4174 |
lemma tan_periodic_pi[simp]: "tan (x + pi) = tan x" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4175 |
by (simp add: tan_def) |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4176 |
|
53079 | 4177 |
lemma tan_periodic_nat[simp]: |
4178 |
fixes n :: nat |
|
4179 |
shows "tan (x + real n * pi) = tan x" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4180 |
proof (induct n arbitrary: x) |
53079 | 4181 |
case 0 |
4182 |
then show ?case by simp |
|
4183 |
next |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4184 |
case (Suc n) |
53079 | 4185 |
have split_pi_off: "x + real (Suc n) * pi = (x + real n * pi) + pi" |
4186 |
unfolding Suc_eq_plus1 real_of_nat_add real_of_one distrib_right by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4187 |
show ?case unfolding split_pi_off using Suc by auto |
53079 | 4188 |
qed |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4189 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4190 |
lemma tan_periodic_int[simp]: fixes i :: int shows "tan (x + real i * pi) = tan x" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4191 |
proof (cases "0 \<le> i") |
53079 | 4192 |
case True |
4193 |
hence i_nat: "real i = real (nat i)" by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4194 |
show ?thesis unfolding i_nat by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4195 |
next |
53079 | 4196 |
case False |
4197 |
hence i_nat: "real i = - real (nat (-i))" by auto |
|
4198 |
have "tan x = tan (x + real i * pi - real i * pi)" |
|
4199 |
by auto |
|
4200 |
also have "\<dots> = tan (x + real i * pi)" |
|
4201 |
unfolding i_nat mult_minus_left diff_minus_eq_add by (rule tan_periodic_nat) |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4202 |
finally show ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4203 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4204 |
|
47108
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
46240
diff
changeset
|
4205 |
lemma tan_periodic_n[simp]: "tan (x + numeral n * pi) = tan x" |
2a1953f0d20d
merged fork with new numeral representation (see NEWS)
huffman
parents:
46240
diff
changeset
|
4206 |
using tan_periodic_int[of _ "numeral n" ] unfolding real_numeral . |
23043 | 4207 |
|
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4208 |
lemma tan_minus_45: "tan (-(pi/4)) = -1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4209 |
unfolding tan_def by (simp add: sin_45 cos_45) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4210 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4211 |
lemma tan_diff: |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4212 |
fixes x :: "'a::{real_normed_field,banach}" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4213 |
shows |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4214 |
"\<lbrakk>cos x \<noteq> 0; cos y \<noteq> 0; cos (x - y) \<noteq> 0\<rbrakk> |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4215 |
\<Longrightarrow> tan(x - y) = (tan(x) - tan(y))/(1 + tan(x) * tan(y))" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4216 |
using tan_add [of x "-y"] |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4217 |
by simp |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4218 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4219 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4220 |
lemma tan_pos_pi2_le: "0 \<le> x ==> x < pi/2 \<Longrightarrow> 0 \<le> tan x" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4221 |
using less_eq_real_def tan_gt_zero by auto |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4222 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4223 |
lemma cos_tan: "abs(x) < pi/2 \<Longrightarrow> cos(x) = 1 / sqrt(1 + tan(x) ^ 2)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4224 |
using cos_gt_zero_pi [of x] |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4225 |
by (simp add: divide_simps tan_def real_sqrt_divide abs_if split: split_if_asm) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4226 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4227 |
lemma sin_tan: "abs(x) < pi/2 \<Longrightarrow> sin(x) = tan(x) / sqrt(1 + tan(x) ^ 2)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4228 |
using cos_gt_zero [of "x"] cos_gt_zero [of "-x"] |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4229 |
by (force simp add: divide_simps tan_def real_sqrt_divide abs_if split: split_if_asm) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4230 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4231 |
lemma tan_mono_le: "-(pi/2) < x ==> x \<le> y ==> y < pi/2 \<Longrightarrow> tan(x) \<le> tan(y)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4232 |
using less_eq_real_def tan_monotone by auto |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4233 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4234 |
lemma tan_mono_lt_eq: "-(pi/2) < x ==> x < pi/2 ==> -(pi/2) < y ==> y < pi/2 |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4235 |
\<Longrightarrow> (tan(x) < tan(y) \<longleftrightarrow> x < y)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4236 |
using tan_monotone' by blast |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4237 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4238 |
lemma tan_mono_le_eq: "-(pi/2) < x ==> x < pi/2 ==> -(pi/2) < y ==> y < pi/2 |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4239 |
\<Longrightarrow> (tan(x) \<le> tan(y) \<longleftrightarrow> x \<le> y)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4240 |
by (meson tan_mono_le not_le tan_monotone) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4241 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4242 |
lemma tan_bound_pi2: "abs(x) < pi/4 \<Longrightarrow> abs(tan x) < 1" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4243 |
using tan_45 tan_monotone [of x "pi/4"] tan_monotone [of "-x" "pi/4"] |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4244 |
by (auto simp: abs_if split: split_if_asm) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4245 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4246 |
lemma tan_cot: "tan(pi/2 - x) = inverse(tan x)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4247 |
by (simp add: tan_def sin_diff cos_diff) |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4248 |
|
23043 | 4249 |
subsection {* Inverse Trigonometric Functions *} |
4250 |
||
53079 | 4251 |
definition arcsin :: "real => real" |
4252 |
where "arcsin y = (THE x. -(pi/2) \<le> x & x \<le> pi/2 & sin x = y)" |
|
4253 |
||
4254 |
definition arccos :: "real => real" |
|
4255 |
where "arccos y = (THE x. 0 \<le> x & x \<le> pi & cos x = y)" |
|
4256 |
||
4257 |
definition arctan :: "real => real" |
|
4258 |
where "arctan y = (THE x. -(pi/2) < x & x < pi/2 & tan x = y)" |
|
23043 | 4259 |
|
15229 | 4260 |
lemma arcsin: |
53079 | 4261 |
"-1 \<le> y \<Longrightarrow> y \<le> 1 \<Longrightarrow> |
4262 |
-(pi/2) \<le> arcsin y & arcsin y \<le> pi/2 & sin(arcsin y) = y" |
|
4263 |
unfolding arcsin_def by (rule theI' [OF sin_total]) |
|
23011 | 4264 |
|
4265 |
lemma arcsin_pi: |
|
53079 | 4266 |
"-1 \<le> y \<Longrightarrow> y \<le> 1 \<Longrightarrow> -(pi/2) \<le> arcsin y & arcsin y \<le> pi & sin(arcsin y) = y" |
4267 |
apply (drule (1) arcsin) |
|
4268 |
apply (force intro: order_trans) |
|
4269 |
done |
|
4270 |
||
4271 |
lemma sin_arcsin [simp]: "-1 \<le> y \<Longrightarrow> y \<le> 1 \<Longrightarrow> sin(arcsin y) = y" |
|
4272 |
by (blast dest: arcsin) |
|
4273 |
||
4274 |
lemma arcsin_bounded: "-1 \<le> y \<Longrightarrow> y \<le> 1 \<Longrightarrow> -(pi/2) \<le> arcsin y & arcsin y \<le> pi/2" |
|
4275 |
by (blast dest: arcsin) |
|
4276 |
||
4277 |
lemma arcsin_lbound: "-1 \<le> y \<Longrightarrow> y \<le> 1 \<Longrightarrow> -(pi/2) \<le> arcsin y" |
|
4278 |
by (blast dest: arcsin) |
|
4279 |
||
4280 |
lemma arcsin_ubound: "-1 \<le> y \<Longrightarrow> y \<le> 1 \<Longrightarrow> arcsin y \<le> pi/2" |
|
4281 |
by (blast dest: arcsin) |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4282 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4283 |
lemma arcsin_lt_bounded: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4284 |
"\<lbrakk>-1 < y; y < 1\<rbrakk> \<Longrightarrow> -(pi/2) < arcsin y & arcsin y < pi/2" |
53079 | 4285 |
apply (frule order_less_imp_le) |
4286 |
apply (frule_tac y = y in order_less_imp_le) |
|
4287 |
apply (frule arcsin_bounded) |
|
4288 |
apply (safe, simp) |
|
4289 |
apply (drule_tac y = "arcsin y" in order_le_imp_less_or_eq) |
|
4290 |
apply (drule_tac [2] y = "pi/2" in order_le_imp_less_or_eq, safe) |
|
4291 |
apply (drule_tac [!] f = sin in arg_cong, auto) |
|
4292 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4293 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4294 |
lemma arcsin_sin: "\<lbrakk>-(pi/2) \<le> x; x \<le> pi/2\<rbrakk> \<Longrightarrow> arcsin(sin x) = x" |
53079 | 4295 |
apply (unfold arcsin_def) |
4296 |
apply (rule the1_equality) |
|
4297 |
apply (rule sin_total, auto) |
|
4298 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4299 |
|
59869 | 4300 |
lemma arcsin_0 [simp]: "arcsin 0 = 0" |
4301 |
using arcsin_sin [of 0] |
|
4302 |
by simp |
|
4303 |
||
4304 |
lemma arcsin_1 [simp]: "arcsin 1 = pi/2" |
|
4305 |
using arcsin_sin [of "pi/2"] |
|
4306 |
by simp |
|
4307 |
||
4308 |
lemma arcsin_minus_1 [simp]: "arcsin (-1) = - (pi/2)" |
|
4309 |
using arcsin_sin [of "-pi/2"] |
|
4310 |
by simp |
|
4311 |
||
4312 |
lemma arcsin_minus: "-1 \<le> x \<Longrightarrow> x \<le> 1 \<Longrightarrow> arcsin(-x) = -arcsin x" |
|
4313 |
by (metis (no_types, hide_lams) arcsin arcsin_sin minus_minus neg_le_iff_le sin_minus) |
|
4314 |
||
4315 |
lemma arcsin_eq_iff: "abs x \<le> 1 \<Longrightarrow> abs y \<le> 1 \<Longrightarrow> (arcsin x = arcsin y \<longleftrightarrow> x = y)" |
|
4316 |
by (metis abs_le_interval_iff arcsin) |
|
4317 |
||
4318 |
lemma cos_arcsin_nonzero: "-1 < x \<Longrightarrow> x < 1 \<Longrightarrow> cos(arcsin x) \<noteq> 0" |
|
4319 |
using arcsin_lt_bounded cos_gt_zero_pi by force |
|
4320 |
||
22975 | 4321 |
lemma arccos: |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4322 |
"\<lbrakk>-1 \<le> y; y \<le> 1\<rbrakk> |
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4323 |
\<Longrightarrow> 0 \<le> arccos y & arccos y \<le> pi & cos(arccos y) = y" |
53079 | 4324 |
unfolding arccos_def by (rule theI' [OF cos_total]) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4325 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4326 |
lemma cos_arccos [simp]: "\<lbrakk>-1 \<le> y; y \<le> 1\<rbrakk> \<Longrightarrow> cos(arccos y) = y" |
53079 | 4327 |
by (blast dest: arccos) |
41970 | 4328 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4329 |
lemma arccos_bounded: "\<lbrakk>-1 \<le> y; y \<le> 1\<rbrakk> \<Longrightarrow> 0 \<le> arccos y & arccos y \<le> pi" |
53079 | 4330 |
by (blast dest: arccos) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4331 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4332 |
lemma arccos_lbound: "\<lbrakk>-1 \<le> y; y \<le> 1\<rbrakk> \<Longrightarrow> 0 \<le> arccos y" |
53079 | 4333 |
by (blast dest: arccos) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4334 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4335 |
lemma arccos_ubound: "\<lbrakk>-1 \<le> y; y \<le> 1\<rbrakk> \<Longrightarrow> arccos y \<le> pi" |
53079 | 4336 |
by (blast dest: arccos) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4337 |
|
22975 | 4338 |
lemma arccos_lt_bounded: |
59869 | 4339 |
"\<lbrakk>-1 < y; y < 1\<rbrakk> \<Longrightarrow> 0 < arccos y & arccos y < pi" |
53079 | 4340 |
apply (frule order_less_imp_le) |
4341 |
apply (frule_tac y = y in order_less_imp_le) |
|
4342 |
apply (frule arccos_bounded, auto) |
|
4343 |
apply (drule_tac y = "arccos y" in order_le_imp_less_or_eq) |
|
4344 |
apply (drule_tac [2] y = pi in order_le_imp_less_or_eq, auto) |
|
4345 |
apply (drule_tac [!] f = cos in arg_cong, auto) |
|
4346 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4347 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4348 |
lemma arccos_cos: "\<lbrakk>0 \<le> x; x \<le> pi\<rbrakk> \<Longrightarrow> arccos(cos x) = x" |
53079 | 4349 |
apply (simp add: arccos_def) |
4350 |
apply (auto intro!: the1_equality cos_total) |
|
4351 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4352 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4353 |
lemma arccos_cos2: "\<lbrakk>x \<le> 0; -pi \<le> x\<rbrakk> \<Longrightarrow> arccos(cos x) = -x" |
53079 | 4354 |
apply (simp add: arccos_def) |
4355 |
apply (auto intro!: the1_equality cos_total) |
|
4356 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4357 |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4358 |
lemma cos_arcsin: "\<lbrakk>-1 \<le> x; x \<le> 1\<rbrakk> \<Longrightarrow> cos (arcsin x) = sqrt (1 - x\<^sup>2)" |
53079 | 4359 |
apply (subgoal_tac "x\<^sup>2 \<le> 1") |
4360 |
apply (rule power2_eq_imp_eq) |
|
4361 |
apply (simp add: cos_squared_eq) |
|
4362 |
apply (rule cos_ge_zero) |
|
4363 |
apply (erule (1) arcsin_lbound) |
|
4364 |
apply (erule (1) arcsin_ubound) |
|
4365 |
apply simp |
|
4366 |
apply (subgoal_tac "\<bar>x\<bar>\<^sup>2 \<le> 1\<^sup>2", simp) |
|
4367 |
apply (rule power_mono, simp, simp) |
|
4368 |
done |
|
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
4369 |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4370 |
lemma sin_arccos: "\<lbrakk>-1 \<le> x; x \<le> 1\<rbrakk> \<Longrightarrow> sin (arccos x) = sqrt (1 - x\<^sup>2)" |
53079 | 4371 |
apply (subgoal_tac "x\<^sup>2 \<le> 1") |
4372 |
apply (rule power2_eq_imp_eq) |
|
4373 |
apply (simp add: sin_squared_eq) |
|
4374 |
apply (rule sin_ge_zero) |
|
4375 |
apply (erule (1) arccos_lbound) |
|
4376 |
apply (erule (1) arccos_ubound) |
|
4377 |
apply simp |
|
4378 |
apply (subgoal_tac "\<bar>x\<bar>\<^sup>2 \<le> 1\<^sup>2", simp) |
|
4379 |
apply (rule power_mono, simp, simp) |
|
4380 |
done |
|
4381 |
||
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4382 |
lemma arccos_0 [simp]: "arccos 0 = pi/2" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4383 |
by (metis arccos_cos cos_gt_zero cos_pi cos_pi_half pi_gt_zero pi_half_ge_zero not_le not_zero_less_neg_numeral numeral_One) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4384 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4385 |
lemma arccos_1 [simp]: "arccos 1 = 0" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4386 |
using arccos_cos by force |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4387 |
|
59869 | 4388 |
lemma arccos_minus_1 [simp]: "arccos(-1) = pi" |
4389 |
by (metis arccos_cos cos_pi order_refl pi_ge_zero) |
|
4390 |
||
4391 |
lemma arccos_minus: "-1 \<le> x \<Longrightarrow> x \<le> 1 \<Longrightarrow> arccos(-x) = pi - arccos x" |
|
4392 |
by (metis arccos_cos arccos_cos2 cos_minus_pi cos_total diff_le_0_iff_le le_add_same_cancel1 |
|
4393 |
minus_diff_eq uminus_add_conv_diff) |
|
4394 |
||
4395 |
lemma sin_arccos_nonzero: "-1 < x \<Longrightarrow> x < 1 \<Longrightarrow> ~(sin(arccos x) = 0)" |
|
4396 |
using arccos_lt_bounded sin_gt_zero by force |
|
4397 |
||
4398 |
lemma arctan: "- (pi/2) < arctan y & arctan y < pi/2 & tan (arctan y) = y" |
|
53079 | 4399 |
unfolding arctan_def by (rule theI' [OF tan_total]) |
4400 |
||
4401 |
lemma tan_arctan: "tan (arctan y) = y" |
|
59869 | 4402 |
by (simp add: arctan) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4403 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4404 |
lemma arctan_bounded: "- (pi/2) < arctan y & arctan y < pi/2" |
53079 | 4405 |
by (auto simp only: arctan) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4406 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4407 |
lemma arctan_lbound: "- (pi/2) < arctan y" |
59869 | 4408 |
by (simp add: arctan) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4409 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4410 |
lemma arctan_ubound: "arctan y < pi/2" |
53079 | 4411 |
by (auto simp only: arctan) |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4412 |
|
44746 | 4413 |
lemma arctan_unique: |
53079 | 4414 |
assumes "-(pi/2) < x" |
4415 |
and "x < pi/2" |
|
4416 |
and "tan x = y" |
|
44746 | 4417 |
shows "arctan y = x" |
4418 |
using assms arctan [of y] tan_total [of y] by (fast elim: ex1E) |
|
4419 |
||
53079 | 4420 |
lemma arctan_tan: "-(pi/2) < x \<Longrightarrow> x < pi/2 \<Longrightarrow> arctan (tan x) = x" |
4421 |
by (rule arctan_unique) simp_all |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4422 |
|
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4423 |
lemma arctan_zero_zero [simp]: "arctan 0 = 0" |
53079 | 4424 |
by (rule arctan_unique) simp_all |
44746 | 4425 |
|
4426 |
lemma arctan_minus: "arctan (- x) = - arctan x" |
|
4427 |
apply (rule arctan_unique) |
|
4428 |
apply (simp only: neg_less_iff_less arctan_ubound) |
|
59869 | 4429 |
apply (metis minus_less_iff arctan_lbound, simp add: arctan) |
44746 | 4430 |
done |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4431 |
|
44725 | 4432 |
lemma cos_arctan_not_zero [simp]: "cos (arctan x) \<noteq> 0" |
4433 |
by (intro less_imp_neq [symmetric] cos_gt_zero_pi |
|
4434 |
arctan_lbound arctan_ubound) |
|
4435 |
||
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4436 |
lemma cos_arctan: "cos (arctan x) = 1 / sqrt (1 + x\<^sup>2)" |
44725 | 4437 |
proof (rule power2_eq_imp_eq) |
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4438 |
have "0 < 1 + x\<^sup>2" by (simp add: add_pos_nonneg) |
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4439 |
show "0 \<le> 1 / sqrt (1 + x\<^sup>2)" by simp |
44725 | 4440 |
show "0 \<le> cos (arctan x)" |
4441 |
by (intro less_imp_le cos_gt_zero_pi arctan_lbound arctan_ubound) |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4442 |
have "(cos (arctan x))\<^sup>2 * (1 + (tan (arctan x))\<^sup>2) = 1" |
49962
a8cc904a6820
Renamed {left,right}_distrib to distrib_{right,left}.
webertj
parents:
47489
diff
changeset
|
4443 |
unfolding tan_def by (simp add: distrib_left power_divide) |
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4444 |
thus "(cos (arctan x))\<^sup>2 = (1 / sqrt (1 + x\<^sup>2))\<^sup>2" |
59869 | 4445 |
using `0 < 1 + x\<^sup>2` by (simp add: arctan power_divide eq_divide_eq) |
44725 | 4446 |
qed |
4447 |
||
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4448 |
lemma sin_arctan: "sin (arctan x) = x / sqrt (1 + x\<^sup>2)" |
44725 | 4449 |
using add_pos_nonneg [OF zero_less_one zero_le_power2 [of x]] |
4450 |
using tan_arctan [of x] unfolding tan_def cos_arctan |
|
4451 |
by (simp add: eq_divide_eq) |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4452 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4453 |
lemma tan_sec: |
59867
58043346ca64
given up separate type classes demanding `inverse 0 = 0`
haftmann
parents:
59865
diff
changeset
|
4454 |
fixes x :: "'a::{real_normed_field,banach,field}" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4455 |
shows "cos x \<noteq> 0 \<Longrightarrow> 1 + (tan x)\<^sup>2 = (inverse (cos x))\<^sup>2" |
53079 | 4456 |
apply (rule power_inverse [THEN subst]) |
56217
dc429a5b13c4
Some rationalisation of basic lemmas
paulson <lp15@cam.ac.uk>
parents:
56213
diff
changeset
|
4457 |
apply (rule_tac c1 = "(cos x)\<^sup>2" in mult_right_cancel [THEN iffD1]) |
53079 | 4458 |
apply (auto dest: field_power_not_zero |
4459 |
simp add: power_mult_distrib distrib_right power_divide tan_def |
|
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
4460 |
mult.assoc power_inverse [symmetric]) |
53079 | 4461 |
done |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
4462 |
|
44746 | 4463 |
lemma arctan_less_iff: "arctan x < arctan y \<longleftrightarrow> x < y" |
4464 |
by (metis tan_monotone' arctan_lbound arctan_ubound tan_arctan) |
|
4465 |
||
4466 |
lemma arctan_le_iff: "arctan x \<le> arctan y \<longleftrightarrow> x \<le> y" |
|
4467 |
by (simp only: not_less [symmetric] arctan_less_iff) |
|
4468 |
||
4469 |
lemma arctan_eq_iff: "arctan x = arctan y \<longleftrightarrow> x = y" |
|
4470 |
by (simp only: eq_iff [where 'a=real] arctan_le_iff) |
|
4471 |
||
4472 |
lemma zero_less_arctan_iff [simp]: "0 < arctan x \<longleftrightarrow> 0 < x" |
|
4473 |
using arctan_less_iff [of 0 x] by simp |
|
4474 |
||
4475 |
lemma arctan_less_zero_iff [simp]: "arctan x < 0 \<longleftrightarrow> x < 0" |
|
4476 |
using arctan_less_iff [of x 0] by simp |
|
4477 |
||
4478 |
lemma zero_le_arctan_iff [simp]: "0 \<le> arctan x \<longleftrightarrow> 0 \<le> x" |
|
4479 |
using arctan_le_iff [of 0 x] by simp |
|
4480 |
||
4481 |
lemma arctan_le_zero_iff [simp]: "arctan x \<le> 0 \<longleftrightarrow> x \<le> 0" |
|
4482 |
using arctan_le_iff [of x 0] by simp |
|
4483 |
||
4484 |
lemma arctan_eq_zero_iff [simp]: "arctan x = 0 \<longleftrightarrow> x = 0" |
|
4485 |
using arctan_eq_iff [of x 0] by simp |
|
4486 |
||
51482
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4487 |
lemma continuous_on_arcsin': "continuous_on {-1 .. 1} arcsin" |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4488 |
proof - |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4489 |
have "continuous_on (sin ` {- pi / 2 .. pi / 2}) arcsin" |
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
4490 |
by (rule continuous_on_inv) (auto intro: continuous_intros simp: arcsin_sin) |
51482
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4491 |
also have "sin ` {- pi / 2 .. pi / 2} = {-1 .. 1}" |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4492 |
proof safe |
53079 | 4493 |
fix x :: real |
4494 |
assume "x \<in> {-1..1}" |
|
4495 |
then show "x \<in> sin ` {- pi / 2..pi / 2}" |
|
4496 |
using arcsin_lbound arcsin_ubound |
|
56479
91958d4b30f7
revert c1bbd3e22226, a14831ac3023, and 36489d77c484: divide_minus_left/right are again simp rules
hoelzl
parents:
56409
diff
changeset
|
4497 |
by (intro image_eqI[where x="arcsin x"]) auto |
51482
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4498 |
qed simp |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4499 |
finally show ?thesis . |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4500 |
qed |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4501 |
|
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
4502 |
lemma continuous_on_arcsin [continuous_intros]: |
51482
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4503 |
"continuous_on s f \<Longrightarrow> (\<forall>x\<in>s. -1 \<le> f x \<and> f x \<le> 1) \<Longrightarrow> continuous_on s (\<lambda>x. arcsin (f x))" |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4504 |
using continuous_on_compose[of s f, OF _ continuous_on_subset[OF continuous_on_arcsin']] |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4505 |
by (auto simp: comp_def subset_eq) |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4506 |
|
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4507 |
lemma isCont_arcsin: "-1 < x \<Longrightarrow> x < 1 \<Longrightarrow> isCont arcsin x" |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4508 |
using continuous_on_arcsin'[THEN continuous_on_subset, of "{ -1 <..< 1 }"] |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4509 |
by (auto simp: continuous_on_eq_continuous_at subset_eq) |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4510 |
|
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4511 |
lemma continuous_on_arccos': "continuous_on {-1 .. 1} arccos" |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4512 |
proof - |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4513 |
have "continuous_on (cos ` {0 .. pi}) arccos" |
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
4514 |
by (rule continuous_on_inv) (auto intro: continuous_intros simp: arccos_cos) |
51482
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4515 |
also have "cos ` {0 .. pi} = {-1 .. 1}" |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4516 |
proof safe |
53079 | 4517 |
fix x :: real |
4518 |
assume "x \<in> {-1..1}" |
|
4519 |
then show "x \<in> cos ` {0..pi}" |
|
4520 |
using arccos_lbound arccos_ubound |
|
4521 |
by (intro image_eqI[where x="arccos x"]) auto |
|
51482
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4522 |
qed simp |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4523 |
finally show ?thesis . |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4524 |
qed |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4525 |
|
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
4526 |
lemma continuous_on_arccos [continuous_intros]: |
51482
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4527 |
"continuous_on s f \<Longrightarrow> (\<forall>x\<in>s. -1 \<le> f x \<and> f x \<le> 1) \<Longrightarrow> continuous_on s (\<lambda>x. arccos (f x))" |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4528 |
using continuous_on_compose[of s f, OF _ continuous_on_subset[OF continuous_on_arccos']] |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4529 |
by (auto simp: comp_def subset_eq) |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4530 |
|
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4531 |
lemma isCont_arccos: "-1 < x \<Longrightarrow> x < 1 \<Longrightarrow> isCont arccos x" |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4532 |
using continuous_on_arccos'[THEN continuous_on_subset, of "{ -1 <..< 1 }"] |
80efd8c49f52
arcsin and arccos are continuous on {0 .. 1} (including the endpoints)
hoelzl
parents:
51481
diff
changeset
|
4533 |
by (auto simp: continuous_on_eq_continuous_at subset_eq) |
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
4534 |
|
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
4535 |
lemma isCont_arctan: "isCont arctan x" |
53079 | 4536 |
apply (rule arctan_lbound [of x, THEN dense, THEN exE], clarify) |
4537 |
apply (rule arctan_ubound [of x, THEN dense, THEN exE], clarify) |
|
59869 | 4538 |
apply (subgoal_tac "isCont arctan (tan (arctan x))", simp add: arctan) |
53079 | 4539 |
apply (erule (1) isCont_inverse_function2 [where f=tan]) |
4540 |
apply (metis arctan_tan order_le_less_trans order_less_le_trans) |
|
4541 |
apply (metis cos_gt_zero_pi isCont_tan order_less_le_trans less_le) |
|
4542 |
done |
|
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
4543 |
|
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4544 |
lemma tendsto_arctan [tendsto_intros]: "(f ---> x) F \<Longrightarrow> ((\<lambda>x. arctan (f x)) ---> arctan x) F" |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4545 |
by (rule isCont_tendsto_compose [OF isCont_arctan]) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4546 |
|
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4547 |
lemma continuous_arctan [continuous_intros]: "continuous F f \<Longrightarrow> continuous F (\<lambda>x. arctan (f x))" |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4548 |
unfolding continuous_def by (rule tendsto_arctan) |
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4549 |
|
56371
fb9ae0727548
extend continuous_intros; remove continuous_on_intros and isCont_intros
hoelzl
parents:
56261
diff
changeset
|
4550 |
lemma continuous_on_arctan [continuous_intros]: "continuous_on s f \<Longrightarrow> continuous_on s (\<lambda>x. arctan (f x))" |
51478
270b21f3ae0a
move continuous and continuous_on to the HOL image; isCont is an abbreviation for continuous (at x) (isCont is now restricted to a T2 space)
hoelzl
parents:
51477
diff
changeset
|
4551 |
unfolding continuous_on_def by (auto intro: tendsto_arctan) |
53079 | 4552 |
|
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
4553 |
lemma DERIV_arcsin: |
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4554 |
"\<lbrakk>-1 < x; x < 1\<rbrakk> \<Longrightarrow> DERIV arcsin x :> inverse (sqrt (1 - x\<^sup>2))" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4555 |
apply (rule DERIV_inverse_function [where f=sin and a="-1" and b=1]) |
53079 | 4556 |
apply (rule DERIV_cong [OF DERIV_sin]) |
4557 |
apply (simp add: cos_arcsin) |
|
4558 |
apply (subgoal_tac "\<bar>x\<bar>\<^sup>2 < 1\<^sup>2", simp) |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4559 |
apply (rule power_strict_mono, simp, simp, simp, assumption, assumption) |
53079 | 4560 |
apply simp |
4561 |
apply (erule (1) isCont_arcsin) |
|
4562 |
done |
|
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
4563 |
|
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
4564 |
lemma DERIV_arccos: |
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4565 |
"\<lbrakk>-1 < x; x < 1\<rbrakk> \<Longrightarrow> DERIV arccos x :> inverse (- sqrt (1 - x\<^sup>2))" |
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4566 |
apply (rule DERIV_inverse_function [where f=cos and a="-1" and b=1]) |
53079 | 4567 |
apply (rule DERIV_cong [OF DERIV_cos]) |
4568 |
apply (simp add: sin_arccos) |
|
4569 |
apply (subgoal_tac "\<bar>x\<bar>\<^sup>2 < 1\<^sup>2", simp) |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4570 |
apply (rule power_strict_mono, simp, simp, simp, assumption, assumption) |
53079 | 4571 |
apply simp |
4572 |
apply (erule (1) isCont_arccos) |
|
4573 |
done |
|
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
4574 |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
4575 |
lemma DERIV_arctan: "DERIV arctan x :> inverse (1 + x\<^sup>2)" |
53079 | 4576 |
apply (rule DERIV_inverse_function [where f=tan and a="x - 1" and b="x + 1"]) |
4577 |
apply (rule DERIV_cong [OF DERIV_tan]) |
|
4578 |
apply (rule cos_arctan_not_zero) |
|
59869 | 4579 |
apply (simp add: arctan power_inverse tan_sec [symmetric]) |
53079 | 4580 |
apply (subgoal_tac "0 < 1 + x\<^sup>2", simp) |
59869 | 4581 |
apply (simp_all add: add_pos_nonneg arctan isCont_arctan) |
53079 | 4582 |
done |
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
4583 |
|
31880 | 4584 |
declare |
56381
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
4585 |
DERIV_arcsin[THEN DERIV_chain2, derivative_intros] |
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
4586 |
DERIV_arccos[THEN DERIV_chain2, derivative_intros] |
0556204bc230
merged DERIV_intros, has_derivative_intros into derivative_intros
hoelzl
parents:
56371
diff
changeset
|
4587 |
DERIV_arctan[THEN DERIV_chain2, derivative_intros] |
31880 | 4588 |
|
50346
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4589 |
lemma filterlim_tan_at_right: "filterlim tan at_bot (at_right (- pi/2))" |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4590 |
by (rule filterlim_at_bot_at_right[where Q="\<lambda>x. - pi/2 < x \<and> x < pi/2" and P="\<lambda>x. True" and g=arctan]) |
59869 | 4591 |
(auto simp: arctan le_less eventually_at dist_real_def simp del: less_divide_eq_numeral1 |
50346
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4592 |
intro!: tan_monotone exI[of _ "pi/2"]) |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4593 |
|
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4594 |
lemma filterlim_tan_at_left: "filterlim tan at_top (at_left (pi/2))" |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4595 |
by (rule filterlim_at_top_at_left[where Q="\<lambda>x. - pi/2 < x \<and> x < pi/2" and P="\<lambda>x. True" and g=arctan]) |
59869 | 4596 |
(auto simp: arctan le_less eventually_at dist_real_def simp del: less_divide_eq_numeral1 |
50346
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4597 |
intro!: tan_monotone exI[of _ "pi/2"]) |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4598 |
|
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4599 |
lemma tendsto_arctan_at_top: "(arctan ---> (pi/2)) at_top" |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4600 |
proof (rule tendstoI) |
53079 | 4601 |
fix e :: real |
4602 |
assume "0 < e" |
|
50346
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4603 |
def y \<equiv> "pi/2 - min (pi/2) e" |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4604 |
then have y: "0 \<le> y" "y < pi/2" "pi/2 \<le> e + y" |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4605 |
using `0 < e` by auto |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4606 |
|
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4607 |
show "eventually (\<lambda>x. dist (arctan x) (pi / 2) < e) at_top" |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4608 |
proof (intro eventually_at_top_dense[THEN iffD2] exI allI impI) |
53079 | 4609 |
fix x |
4610 |
assume "tan y < x" |
|
50346
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4611 |
then have "arctan (tan y) < arctan x" |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4612 |
by (simp add: arctan_less_iff) |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4613 |
with y have "y < arctan x" |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4614 |
by (subst (asm) arctan_tan) simp_all |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4615 |
with arctan_ubound[of x, arith] y `0 < e` |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4616 |
show "dist (arctan x) (pi / 2) < e" |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4617 |
by (simp add: dist_real_def) |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4618 |
qed |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4619 |
qed |
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4620 |
|
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4621 |
lemma tendsto_arctan_at_bot: "(arctan ---> - (pi/2)) at_bot" |
53079 | 4622 |
unfolding filterlim_at_bot_mirror arctan_minus |
4623 |
by (intro tendsto_minus tendsto_arctan_at_top) |
|
4624 |
||
50346
a75c6429c3c3
add filterlim rules for eventually monotone bijective functions; mirror rules for at_top, at_bot; apply them to prove convergence of arctan at infinity and tan at pi/2
hoelzl
parents:
50326
diff
changeset
|
4625 |
|
59746
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4626 |
subsection{* Prove Totality of the Trigonometric Functions *} |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4627 |
|
59869 | 4628 |
lemma cos_arccos_abs: "\<bar>y\<bar> \<le> 1 \<Longrightarrow> cos (arccos y) = y" |
4629 |
by (simp add: abs_le_iff) |
|
4630 |
||
4631 |
lemma sin_arccos_abs: "\<bar>y\<bar> \<le> 1 \<Longrightarrow> sin (arccos y) = sqrt (1 - y\<^sup>2)" |
|
4632 |
by (simp add: sin_arccos abs_le_iff) |
|
4633 |
||
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4634 |
lemma sin_mono_less_eq: "\<lbrakk>-(pi/2) \<le> x; x \<le> pi/2; -(pi/2) \<le> y; y \<le> pi/2\<rbrakk> |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4635 |
\<Longrightarrow> (sin(x) < sin(y) \<longleftrightarrow> x < y)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4636 |
by (metis not_less_iff_gr_or_eq sin_monotone_2pi) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4637 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4638 |
lemma sin_mono_le_eq: "\<lbrakk>-(pi/2) \<le> x; x \<le> pi/2; -(pi/2) \<le> y; y \<le> pi/2\<rbrakk> |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4639 |
\<Longrightarrow> (sin(x) \<le> sin(y) \<longleftrightarrow> x \<le> y)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4640 |
by (meson leD le_less_linear sin_monotone_2pi sin_monotone_2pi_le) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4641 |
|
59869 | 4642 |
lemma sin_inj_pi: |
4643 |
"\<lbrakk>-(pi/2) \<le> x; x \<le> pi/2;-(pi/2) \<le> y; y \<le> pi/2; sin(x) = sin(y)\<rbrakk> \<Longrightarrow> x = y" |
|
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4644 |
by (metis arcsin_sin) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4645 |
|
59869 | 4646 |
lemma cos_mono_less_eq: |
4647 |
"0 \<le> x ==> x \<le> pi ==> 0 \<le> y ==> y \<le> pi \<Longrightarrow> (cos(x) < cos(y) \<longleftrightarrow> y < x)" |
|
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4648 |
by (meson cos_monotone_0_pi cos_monotone_0_pi_le leD le_less_linear) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4649 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4650 |
lemma cos_mono_le_eq: "0 \<le> x ==> x \<le> pi ==> 0 \<le> y ==> y \<le> pi |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4651 |
\<Longrightarrow> (cos(x) \<le> cos(y) \<longleftrightarrow> y \<le> x)" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4652 |
by (metis arccos_cos cos_monotone_0_pi_le eq_iff linear) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4653 |
|
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4654 |
lemma cos_inj_pi: "0 \<le> x ==> x \<le> pi ==> 0 \<le> y ==> y \<le> pi ==> cos(x) = cos(y) |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4655 |
\<Longrightarrow> x = y" |
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4656 |
by (metis arccos_cos) |
59746
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4657 |
|
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4658 |
lemma arccos_le_pi2: "\<lbrakk>0 \<le> y; y \<le> 1\<rbrakk> \<Longrightarrow> arccos y \<le> pi/2" |
59751
916c0f6c83e3
New material for complex sin, cos, tan, Ln, also some reorganisation
paulson <lp15@cam.ac.uk>
parents:
59746
diff
changeset
|
4659 |
by (metis (mono_tags) arccos_0 arccos cos_le_one cos_monotone_0_pi_le |
59746
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4660 |
cos_pi cos_pi_half pi_half_ge_zero antisym_conv less_eq_neg_nonpos linear minus_minus order.trans order_refl) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4661 |
|
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4662 |
lemma sincos_total_pi_half: |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4663 |
assumes "0 \<le> x" "0 \<le> y" "x\<^sup>2 + y\<^sup>2 = 1" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4664 |
shows "\<exists>t. 0 \<le> t \<and> t \<le> pi/2 \<and> x = cos t \<and> y = sin t" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4665 |
proof - |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4666 |
have x1: "x \<le> 1" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4667 |
using assms |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4668 |
by (metis le_add_same_cancel1 power2_le_imp_le power_one zero_le_power2) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4669 |
moreover with assms have ax: "0 \<le> arccos x" "cos(arccos x) = x" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4670 |
by (auto simp: arccos) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4671 |
moreover have "y = sqrt (1 - x\<^sup>2)" using assms |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4672 |
by (metis abs_of_nonneg add.commute add_diff_cancel real_sqrt_abs) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4673 |
ultimately show ?thesis using assms arccos_le_pi2 [of x] |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4674 |
by (rule_tac x="arccos x" in exI) (auto simp: sin_arccos) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4675 |
qed |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4676 |
|
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4677 |
lemma sincos_total_pi: |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4678 |
assumes "0 \<le> y" and "x\<^sup>2 + y\<^sup>2 = 1" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4679 |
shows "\<exists>t. 0 \<le> t \<and> t \<le> pi \<and> x = cos t \<and> y = sin t" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4680 |
proof (cases rule: le_cases [of 0 x]) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4681 |
case le from sincos_total_pi_half [OF le] |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4682 |
show ?thesis |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4683 |
by (metis pi_ge_two pi_half_le_two add.commute add_le_cancel_left add_mono assms) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4684 |
next |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4685 |
case ge |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4686 |
then have "0 \<le> -x" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4687 |
by simp |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4688 |
then obtain t where "t\<ge>0" "t \<le> pi/2" "-x = cos t" "y = sin t" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4689 |
using sincos_total_pi_half assms |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4690 |
apply auto |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4691 |
by (metis `0 \<le> - x` power2_minus) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4692 |
then show ?thesis |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4693 |
by (rule_tac x="pi-t" in exI, auto) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4694 |
qed |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4695 |
|
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4696 |
lemma sincos_total_2pi_le: |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4697 |
assumes "x\<^sup>2 + y\<^sup>2 = 1" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4698 |
shows "\<exists>t. 0 \<le> t \<and> t \<le> 2*pi \<and> x = cos t \<and> y = sin t" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4699 |
proof (cases rule: le_cases [of 0 y]) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4700 |
case le from sincos_total_pi [OF le] |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4701 |
show ?thesis |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4702 |
by (metis assms le_add_same_cancel1 mult.commute mult_2_right order.trans) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4703 |
next |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4704 |
case ge |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4705 |
then have "0 \<le> -y" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4706 |
by simp |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4707 |
then obtain t where "t\<ge>0" "t \<le> pi" "x = cos t" "-y = sin t" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4708 |
using sincos_total_pi assms |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4709 |
apply auto |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4710 |
by (metis `0 \<le> - y` power2_minus) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4711 |
then show ?thesis |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4712 |
by (rule_tac x="2*pi-t" in exI, auto) |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4713 |
qed |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4714 |
|
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4715 |
lemma sincos_total_2pi: |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4716 |
assumes "x\<^sup>2 + y\<^sup>2 = 1" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4717 |
obtains t where "0 \<le> t" "t < 2*pi" "x = cos t" "y = sin t" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4718 |
proof - |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4719 |
from sincos_total_2pi_le [OF assms] |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4720 |
obtain t where t: "0 \<le> t" "t \<le> 2*pi" "x = cos t" "y = sin t" |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4721 |
by blast |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4722 |
show ?thesis |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4723 |
apply (cases "t = 2*pi") |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4724 |
using t that |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4725 |
apply force+ |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4726 |
done |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4727 |
qed |
ddae5727c5a9
new HOL Light material about exp, sin, cos
paulson <lp15@cam.ac.uk>
parents:
59741
diff
changeset
|
4728 |
|
59869 | 4729 |
lemma arcsin_less_mono: "abs x \<le> 1 \<Longrightarrow> abs y \<le> 1 \<Longrightarrow> arcsin x < arcsin y \<longleftrightarrow> x < y" |
4730 |
apply (rule trans [OF sin_mono_less_eq [symmetric]]) |
|
4731 |
using arcsin_ubound arcsin_lbound |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
4732 |
apply auto |
59869 | 4733 |
done |
4734 |
||
4735 |
lemma arcsin_le_mono: "abs x \<le> 1 \<Longrightarrow> abs y \<le> 1 \<Longrightarrow> arcsin x \<le> arcsin y \<longleftrightarrow> x \<le> y" |
|
4736 |
using arcsin_less_mono not_le by blast |
|
4737 |
||
4738 |
lemma arcsin_less_arcsin: "-1 \<le> x \<Longrightarrow> x < y \<Longrightarrow> y \<le> 1 \<Longrightarrow> arcsin x < arcsin y" |
|
4739 |
using arcsin_less_mono by auto |
|
4740 |
||
4741 |
lemma arcsin_le_arcsin: "-1 \<le> x \<Longrightarrow> x \<le> y \<Longrightarrow> y \<le> 1 \<Longrightarrow> arcsin x \<le> arcsin y" |
|
4742 |
using arcsin_le_mono by auto |
|
4743 |
||
4744 |
lemma arccos_less_mono: "abs x \<le> 1 \<Longrightarrow> abs y \<le> 1 \<Longrightarrow> (arccos x < arccos y \<longleftrightarrow> y < x)" |
|
4745 |
apply (rule trans [OF cos_mono_less_eq [symmetric]]) |
|
4746 |
using arccos_ubound arccos_lbound |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
4747 |
apply auto |
59869 | 4748 |
done |
4749 |
||
4750 |
lemma arccos_le_mono: "abs x \<le> 1 \<Longrightarrow> abs y \<le> 1 \<Longrightarrow> arccos x \<le> arccos y \<longleftrightarrow> y \<le> x" |
|
4751 |
using arccos_less_mono [of y x] |
|
4752 |
by (simp add: not_le [symmetric]) |
|
4753 |
||
4754 |
lemma arccos_less_arccos: "-1 \<le> x \<Longrightarrow> x < y \<Longrightarrow> y \<le> 1 \<Longrightarrow> arccos y < arccos x" |
|
4755 |
using arccos_less_mono by auto |
|
4756 |
||
4757 |
lemma arccos_le_arccos: "-1 \<le> x \<Longrightarrow> x \<le> y \<Longrightarrow> y \<le> 1 \<Longrightarrow> arccos y \<le> arccos x" |
|
4758 |
using arccos_le_mono by auto |
|
4759 |
||
4760 |
lemma arccos_eq_iff: "abs x \<le> 1 & abs y \<le> 1 \<Longrightarrow> (arccos x = arccos y \<longleftrightarrow> x = y)" |
|
4761 |
using cos_arccos_abs by fastforce |
|
4762 |
||
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4763 |
subsection {* Machins formula *} |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4764 |
|
44746 | 4765 |
lemma arctan_one: "arctan 1 = pi / 4" |
4766 |
by (rule arctan_unique, simp_all add: tan_45 m2pi_less_pi) |
|
4767 |
||
53079 | 4768 |
lemma tan_total_pi4: |
4769 |
assumes "\<bar>x\<bar> < 1" |
|
4770 |
shows "\<exists>z. - (pi / 4) < z \<and> z < pi / 4 \<and> tan z = x" |
|
44746 | 4771 |
proof |
4772 |
show "- (pi / 4) < arctan x \<and> arctan x < pi / 4 \<and> tan (arctan x) = x" |
|
4773 |
unfolding arctan_one [symmetric] arctan_minus [symmetric] |
|
59869 | 4774 |
unfolding arctan_less_iff using assms by (auto simp add: arctan) |
4775 |
||
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4776 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4777 |
|
53079 | 4778 |
lemma arctan_add: |
4779 |
assumes "\<bar>x\<bar> \<le> 1" and "\<bar>y\<bar> < 1" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4780 |
shows "arctan x + arctan y = arctan ((x + y) / (1 - x * y))" |
44746 | 4781 |
proof (rule arctan_unique [symmetric]) |
4782 |
have "- (pi / 4) \<le> arctan x" and "- (pi / 4) < arctan y" |
|
4783 |
unfolding arctan_one [symmetric] arctan_minus [symmetric] |
|
4784 |
unfolding arctan_le_iff arctan_less_iff using assms by auto |
|
4785 |
from add_le_less_mono [OF this] |
|
4786 |
show 1: "- (pi / 2) < arctan x + arctan y" by simp |
|
4787 |
have "arctan x \<le> pi / 4" and "arctan y < pi / 4" |
|
4788 |
unfolding arctan_one [symmetric] |
|
4789 |
unfolding arctan_le_iff arctan_less_iff using assms by auto |
|
4790 |
from add_le_less_mono [OF this] |
|
4791 |
show 2: "arctan x + arctan y < pi / 2" by simp |
|
4792 |
show "tan (arctan x + arctan y) = (x + y) / (1 - x * y)" |
|
59869 | 4793 |
using cos_gt_zero_pi [OF 1 2] by (simp add: arctan tan_add) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4794 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4795 |
|
60150
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4796 |
lemma arctan_double: |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4797 |
assumes "\<bar>x\<bar> < 1" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4798 |
shows "2 * arctan x = arctan ((2*x) / (1 - x\<^sup>2))" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4799 |
by (metis assms arctan_add linear mult_2 not_less power2_eq_square) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4800 |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4801 |
theorem machin: "pi / 4 = 4 * arctan (1/5) - arctan (1 / 239)" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4802 |
proof - |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4803 |
have "\<bar>1 / 5\<bar> < (1 :: real)" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4804 |
from arctan_add[OF less_imp_le[OF this] this] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4805 |
have "2 * arctan (1 / 5) = arctan (5 / 12)" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4806 |
moreover |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4807 |
have "\<bar>5 / 12\<bar> < (1 :: real)" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4808 |
from arctan_add[OF less_imp_le[OF this] this] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4809 |
have "2 * arctan (5 / 12) = arctan (120 / 119)" by auto |
41970 | 4810 |
moreover |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4811 |
have "\<bar>1\<bar> \<le> (1::real)" and "\<bar>1 / 239\<bar> < (1::real)" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4812 |
from arctan_add[OF this] |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4813 |
have "arctan 1 + arctan (1 / 239) = arctan (120 / 119)" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4814 |
ultimately have "arctan 1 + arctan (1 / 239) = 4 * arctan (1 / 5)" by auto |
44746 | 4815 |
thus ?thesis unfolding arctan_one by algebra |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4816 |
qed |
44746 | 4817 |
|
60150
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4818 |
lemma machin_Euler: "5 * arctan(1/7) + 2 * arctan(3/79) = pi/4" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4819 |
proof - |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4820 |
have 17: "\<bar>1/7\<bar> < (1 :: real)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4821 |
with arctan_double |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4822 |
have "2 * arctan (1/7) = arctan (7/24)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4823 |
moreover |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4824 |
have "\<bar>7/24\<bar> < (1 :: real)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4825 |
with arctan_double |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4826 |
have "2 * arctan (7/24) = arctan (336/527)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4827 |
moreover |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4828 |
have "\<bar>336/527\<bar> < (1 :: real)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4829 |
from arctan_add[OF less_imp_le[OF 17] this] |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4830 |
have "arctan(1/7) + arctan (336/527) = arctan (2879/3353)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4831 |
ultimately have I: "5 * arctan(1/7) = arctan (2879/3353)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4832 |
have 379: "\<bar>3/79\<bar> < (1 :: real)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4833 |
with arctan_double |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4834 |
have II: "2 * arctan (3/79) = arctan (237/3116)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4835 |
have *: "\<bar>2879/3353\<bar> < (1 :: real)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4836 |
have "\<bar>237/3116\<bar> < (1 :: real)" by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4837 |
from arctan_add[OF less_imp_le[OF *] this] |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4838 |
have "arctan (2879/3353) + arctan (237/3116) = pi/4" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4839 |
by (simp add: arctan_one) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4840 |
then show ?thesis using I II |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4841 |
by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4842 |
qed |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4843 |
|
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4844 |
(*But could also prove MACHIN_GAUSS: |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4845 |
12 * arctan(1/18) + 8 * arctan(1/57) - 5 * arctan(1/239) = pi/4*) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
4846 |
|
53079 | 4847 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4848 |
subsection {* Introducing the inverse tangent power series *} |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4849 |
|
53079 | 4850 |
lemma monoseq_arctan_series: |
4851 |
fixes x :: real |
|
4852 |
assumes "\<bar>x\<bar> \<le> 1" |
|
4853 |
shows "monoseq (\<lambda> n. 1 / real (n*2+1) * x^(n*2+1))" (is "monoseq ?a") |
|
4854 |
proof (cases "x = 0") |
|
4855 |
case True |
|
4856 |
thus ?thesis unfolding monoseq_def One_nat_def by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4857 |
next |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4858 |
case False |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4859 |
have "norm x \<le> 1" and "x \<le> 1" and "-1 \<le> x" using assms by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4860 |
show "monoseq ?a" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4861 |
proof - |
53079 | 4862 |
{ |
4863 |
fix n |
|
4864 |
fix x :: real |
|
4865 |
assume "0 \<le> x" and "x \<le> 1" |
|
4866 |
have "1 / real (Suc (Suc n * 2)) * x ^ Suc (Suc n * 2) \<le> |
|
4867 |
1 / real (Suc (n * 2)) * x ^ Suc (n * 2)" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4868 |
proof (rule mult_mono) |
53079 | 4869 |
show "1 / real (Suc (Suc n * 2)) \<le> 1 / real (Suc (n * 2))" |
4870 |
by (rule frac_le) simp_all |
|
4871 |
show "0 \<le> 1 / real (Suc (n * 2))" |
|
4872 |
by auto |
|
4873 |
show "x ^ Suc (Suc n * 2) \<le> x ^ Suc (n * 2)" |
|
4874 |
by (rule power_decreasing) (simp_all add: `0 \<le> x` `x \<le> 1`) |
|
4875 |
show "0 \<le> x ^ Suc (Suc n * 2)" |
|
4876 |
by (rule zero_le_power) (simp add: `0 \<le> x`) |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4877 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4878 |
} note mono = this |
41970 | 4879 |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4880 |
show ?thesis |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4881 |
proof (cases "0 \<le> x") |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4882 |
case True from mono[OF this `x \<le> 1`, THEN allI] |
53079 | 4883 |
show ?thesis unfolding Suc_eq_plus1[symmetric] |
4884 |
by (rule mono_SucI2) |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4885 |
next |
53079 | 4886 |
case False |
4887 |
hence "0 \<le> -x" and "-x \<le> 1" using `-1 \<le> x` by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4888 |
from mono[OF this] |
53079 | 4889 |
have "\<And>n. 1 / real (Suc (Suc n * 2)) * x ^ Suc (Suc n * 2) \<ge> |
4890 |
1 / real (Suc (n * 2)) * x ^ Suc (n * 2)" using `0 \<le> -x` by auto |
|
31790 | 4891 |
thus ?thesis unfolding Suc_eq_plus1[symmetric] by (rule mono_SucI1[OF allI]) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4892 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4893 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4894 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4895 |
|
53079 | 4896 |
lemma zeroseq_arctan_series: |
4897 |
fixes x :: real |
|
4898 |
assumes "\<bar>x\<bar> \<le> 1" |
|
4899 |
shows "(\<lambda> n. 1 / real (n*2+1) * x^(n*2+1)) ----> 0" (is "?a ----> 0") |
|
4900 |
proof (cases "x = 0") |
|
4901 |
case True |
|
4902 |
thus ?thesis |
|
58729
e8ecc79aee43
add tendsto_const and tendsto_ident_at as simp and intro rules
hoelzl
parents:
58710
diff
changeset
|
4903 |
unfolding One_nat_def by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4904 |
next |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4905 |
case False |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4906 |
have "norm x \<le> 1" and "x \<le> 1" and "-1 \<le> x" using assms by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4907 |
show "?a ----> 0" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4908 |
proof (cases "\<bar>x\<bar> < 1") |
53079 | 4909 |
case True |
4910 |
hence "norm x < 1" by auto |
|
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44319
diff
changeset
|
4911 |
from tendsto_mult[OF LIMSEQ_inverse_real_of_nat LIMSEQ_power_zero[OF `norm x < 1`, THEN LIMSEQ_Suc]] |
30082
43c5b7bfc791
make more proofs work whether or not One_nat_def is a simp rule
huffman
parents:
29803
diff
changeset
|
4912 |
have "(\<lambda>n. 1 / real (n + 1) * x ^ (n + 1)) ----> 0" |
31790 | 4913 |
unfolding inverse_eq_divide Suc_eq_plus1 by simp |
30082
43c5b7bfc791
make more proofs work whether or not One_nat_def is a simp rule
huffman
parents:
29803
diff
changeset
|
4914 |
then show ?thesis using pos2 by (rule LIMSEQ_linear) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4915 |
next |
53079 | 4916 |
case False |
4917 |
hence "x = -1 \<or> x = 1" using `\<bar>x\<bar> \<le> 1` by auto |
|
4918 |
hence n_eq: "\<And> n. x ^ (n * 2 + 1) = x" |
|
4919 |
unfolding One_nat_def by auto |
|
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44319
diff
changeset
|
4920 |
from tendsto_mult[OF LIMSEQ_inverse_real_of_nat[THEN LIMSEQ_linear, OF pos2, unfolded inverse_eq_divide] tendsto_const[of x]] |
31790 | 4921 |
show ?thesis unfolding n_eq Suc_eq_plus1 by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4922 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4923 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4924 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
4925 |
text{*FIXME: generalise from the reals via type classes?*} |
53079 | 4926 |
lemma summable_arctan_series: |
4927 |
fixes x :: real and n :: nat |
|
4928 |
assumes "\<bar>x\<bar> \<le> 1" |
|
4929 |
shows "summable (\<lambda> k. (-1)^k * (1 / real (k*2+1) * x ^ (k*2+1)))" |
|
4930 |
(is "summable (?c x)") |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4931 |
by (rule summable_Leibniz(1), rule zeroseq_arctan_series[OF assms], rule monoseq_arctan_series[OF assms]) |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4932 |
|
53079 | 4933 |
lemma DERIV_arctan_series: |
4934 |
assumes "\<bar> x \<bar> < 1" |
|
4935 |
shows "DERIV (\<lambda> x'. \<Sum> k. (-1)^k * (1 / real (k*2+1) * x' ^ (k*2+1))) x :> (\<Sum> k. (-1)^k * x^(k*2))" |
|
4936 |
(is "DERIV ?arctan _ :> ?Int") |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4937 |
proof - |
53079 | 4938 |
let ?f = "\<lambda>n. if even n then (-1)^(n div 2) * 1 / real (Suc n) else 0" |
4939 |
||
4940 |
have n_even: "\<And>n :: nat. even n \<Longrightarrow> 2 * (n div 2) = n" |
|
4941 |
by presburger |
|
4942 |
then have if_eq: "\<And>n x'. ?f n * real (Suc n) * x'^n = |
|
4943 |
(if even n then (-1)^(n div 2) * x'^(2 * (n div 2)) else 0)" |
|
4944 |
by auto |
|
4945 |
||
4946 |
{ |
|
4947 |
fix x :: real |
|
4948 |
assume "\<bar>x\<bar> < 1" |
|
59865
8a20dd967385
rationalised and generalised some theorems concerning abs and x^2.
paulson <lp15@cam.ac.uk>
parents:
59862
diff
changeset
|
4949 |
hence "x\<^sup>2 < 1" by (simp add: abs_square_less_1) |
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4950 |
have "summable (\<lambda> n. (- 1) ^ n * (x\<^sup>2) ^n)" |
53076 | 4951 |
by (rule summable_Leibniz(1), auto intro!: LIMSEQ_realpow_zero monoseq_realpow `x\<^sup>2 < 1` order_less_imp_le[OF `x\<^sup>2 < 1`]) |
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4952 |
hence "summable (\<lambda> n. (- 1) ^ n * x^(2*n))" unfolding power_mult . |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4953 |
} note summable_Integral = this |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4954 |
|
53079 | 4955 |
{ |
4956 |
fix f :: "nat \<Rightarrow> real" |
|
4957 |
have "\<And>x. f sums x = (\<lambda> n. if even n then f (n div 2) else 0) sums x" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4958 |
proof |
53079 | 4959 |
fix x :: real |
4960 |
assume "f sums x" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4961 |
from sums_if[OF sums_zero this] |
53079 | 4962 |
show "(\<lambda>n. if even n then f (n div 2) else 0) sums x" |
4963 |
by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4964 |
next |
53079 | 4965 |
fix x :: real |
4966 |
assume "(\<lambda> n. if even n then f (n div 2) else 0) sums x" |
|
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
4967 |
from LIMSEQ_linear[OF this[unfolded sums_def] pos2, unfolded sum_split_even_odd[unfolded mult.commute]] |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4968 |
show "f sums x" unfolding sums_def by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4969 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4970 |
hence "op sums f = op sums (\<lambda> n. if even n then f (n div 2) else 0)" .. |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4971 |
} note sums_even = this |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4972 |
|
53079 | 4973 |
have Int_eq: "(\<Sum>n. ?f n * real (Suc n) * x^n) = ?Int" |
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4974 |
unfolding if_eq mult.commute[of _ 2] suminf_def sums_even[of "\<lambda> n. (- 1) ^ n * x ^ (2 * n)", symmetric] |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4975 |
by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4976 |
|
53079 | 4977 |
{ |
4978 |
fix x :: real |
|
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4979 |
have if_eq': "\<And>n. (if even n then (- 1) ^ (n div 2) * 1 / real (Suc n) else 0) * x ^ Suc n = |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4980 |
(if even n then (- 1) ^ (n div 2) * (1 / real (Suc (2 * (n div 2))) * x ^ Suc (2 * (n div 2))) else 0)" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4981 |
using n_even by auto |
53079 | 4982 |
have idx_eq: "\<And>n. n * 2 + 1 = Suc (2 * n)" by auto |
4983 |
have "(\<Sum>n. ?f n * x^(Suc n)) = ?arctan x" |
|
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4984 |
unfolding if_eq' idx_eq suminf_def sums_even[of "\<lambda> n. (- 1) ^ n * (1 / real (Suc (2 * n)) * x ^ Suc (2 * n))", symmetric] |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4985 |
by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4986 |
} note arctan_eq = this |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4987 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4988 |
have "DERIV (\<lambda> x. \<Sum> n. ?f n * x^(Suc n)) x :> (\<Sum> n. ?f n * real (Suc n) * x^n)" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4989 |
proof (rule DERIV_power_series') |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4990 |
show "x \<in> {- 1 <..< 1}" using `\<bar> x \<bar> < 1` by auto |
53079 | 4991 |
{ |
4992 |
fix x' :: real |
|
4993 |
assume x'_bounds: "x' \<in> {- 1 <..< 1}" |
|
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4994 |
then have "\<bar>x'\<bar> < 1" by auto |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4995 |
then |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4996 |
have *: "summable (\<lambda>n. (- 1) ^ n * x' ^ (2 * n))" |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
4997 |
by (rule summable_Integral) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4998 |
let ?S = "\<Sum> n. (-1)^n * x'^(2 * n)" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
4999 |
show "summable (\<lambda> n. ?f n * real (Suc n) * x'^n)" unfolding if_eq |
58410
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
5000 |
apply (rule sums_summable [where l="0 + ?S"]) |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
5001 |
apply (rule sums_if) |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
5002 |
apply (rule sums_zero) |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
5003 |
apply (rule summable_sums) |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
5004 |
apply (rule *) |
6d46ad54a2ab
explicit separation of signed and unsigned numerals using existing lexical categories num and xnum
haftmann
parents:
57514
diff
changeset
|
5005 |
done |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5006 |
} |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5007 |
qed auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5008 |
thus ?thesis unfolding Int_eq arctan_eq . |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5009 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5010 |
|
53079 | 5011 |
lemma arctan_series: |
5012 |
assumes "\<bar> x \<bar> \<le> 1" |
|
5013 |
shows "arctan x = (\<Sum>k. (-1)^k * (1 / real (k*2+1) * x ^ (k*2+1)))" |
|
5014 |
(is "_ = suminf (\<lambda> n. ?c x n)") |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5015 |
proof - |
53079 | 5016 |
let ?c' = "\<lambda>x n. (-1)^n * x^(n*2)" |
5017 |
||
5018 |
{ |
|
5019 |
fix r x :: real |
|
5020 |
assume "0 < r" and "r < 1" and "\<bar> x \<bar> < r" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5021 |
have "\<bar>x\<bar> < 1" using `r < 1` and `\<bar>x\<bar> < r` by auto |
53079 | 5022 |
from DERIV_arctan_series[OF this] have "DERIV (\<lambda> x. suminf (?c x)) x :> (suminf (?c' x))" . |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5023 |
} note DERIV_arctan_suminf = this |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5024 |
|
53079 | 5025 |
{ |
5026 |
fix x :: real |
|
5027 |
assume "\<bar>x\<bar> \<le> 1" |
|
5028 |
note summable_Leibniz[OF zeroseq_arctan_series[OF this] monoseq_arctan_series[OF this]] |
|
5029 |
} note arctan_series_borders = this |
|
5030 |
||
5031 |
{ |
|
5032 |
fix x :: real |
|
5033 |
assume "\<bar>x\<bar> < 1" |
|
5034 |
have "arctan x = (\<Sum>k. ?c x k)" |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5035 |
proof - |
53079 | 5036 |
obtain r where "\<bar>x\<bar> < r" and "r < 1" |
5037 |
using dense[OF `\<bar>x\<bar> < 1`] by blast |
|
5038 |
hence "0 < r" and "-r < x" and "x < r" by auto |
|
5039 |
||
5040 |
have suminf_eq_arctan_bounded: "\<And>x a b. \<lbrakk> -r < a ; b < r ; a < b ; a \<le> x ; x \<le> b \<rbrakk> \<Longrightarrow> |
|
5041 |
suminf (?c x) - arctan x = suminf (?c a) - arctan a" |
|
5042 |
proof - |
|
5043 |
fix x a b |
|
5044 |
assume "-r < a" and "b < r" and "a < b" and "a \<le> x" and "x \<le> b" |
|
5045 |
hence "\<bar>x\<bar> < r" by auto |
|
5046 |
show "suminf (?c x) - arctan x = suminf (?c a) - arctan a" |
|
5047 |
proof (rule DERIV_isconst2[of "a" "b"]) |
|
5048 |
show "a < b" and "a \<le> x" and "x \<le> b" |
|
5049 |
using `a < b` `a \<le> x` `x \<le> b` by auto |
|
5050 |
have "\<forall>x. -r < x \<and> x < r \<longrightarrow> DERIV (\<lambda> x. suminf (?c x) - arctan x) x :> 0" |
|
5051 |
proof (rule allI, rule impI) |
|
5052 |
fix x |
|
5053 |
assume "-r < x \<and> x < r" |
|
5054 |
hence "\<bar>x\<bar> < r" by auto |
|
5055 |
hence "\<bar>x\<bar> < 1" using `r < 1` by auto |
|
5056 |
have "\<bar> - (x\<^sup>2) \<bar> < 1" |
|
59865
8a20dd967385
rationalised and generalised some theorems concerning abs and x^2.
paulson <lp15@cam.ac.uk>
parents:
59862
diff
changeset
|
5057 |
using abs_square_less_1 `\<bar>x\<bar> < 1` by auto |
53079 | 5058 |
hence "(\<lambda> n. (- (x\<^sup>2)) ^ n) sums (1 / (1 - (- (x\<^sup>2))))" |
5059 |
unfolding real_norm_def[symmetric] by (rule geometric_sums) |
|
5060 |
hence "(?c' x) sums (1 / (1 - (- (x\<^sup>2))))" |
|
57512
cc97b347b301
reduced name variants for assoc and commute on plus and mult
haftmann
parents:
57492
diff
changeset
|
5061 |
unfolding power_mult_distrib[symmetric] power_mult mult.commute[of _ 2] by auto |
53079 | 5062 |
hence suminf_c'_eq_geom: "inverse (1 + x\<^sup>2) = suminf (?c' x)" |
5063 |
using sums_unique unfolding inverse_eq_divide by auto |
|
5064 |
have "DERIV (\<lambda> x. suminf (?c x)) x :> (inverse (1 + x\<^sup>2))" |
|
5065 |
unfolding suminf_c'_eq_geom |
|
5066 |
by (rule DERIV_arctan_suminf[OF `0 < r` `r < 1` `\<bar>x\<bar> < r`]) |
|
56261 | 5067 |
from DERIV_diff [OF this DERIV_arctan] |
53079 | 5068 |
show "DERIV (\<lambda> x. suminf (?c x) - arctan x) x :> 0" |
54230
b1d955791529
more simplification rules on unary and binary minus
haftmann
parents:
53602
diff
changeset
|
5069 |
by auto |
53079 | 5070 |
qed |
5071 |
hence DERIV_in_rball: "\<forall> y. a \<le> y \<and> y \<le> b \<longrightarrow> DERIV (\<lambda> x. suminf (?c x) - arctan x) y :> 0" |
|
5072 |
using `-r < a` `b < r` by auto |
|
5073 |
thus "\<forall> y. a < y \<and> y < b \<longrightarrow> DERIV (\<lambda> x. suminf (?c x) - arctan x) y :> 0" |
|
5074 |
using `\<bar>x\<bar> < r` by auto |
|
5075 |
show "\<forall> y. a \<le> y \<and> y \<le> b \<longrightarrow> isCont (\<lambda> x. suminf (?c x) - arctan x) y" |
|
5076 |
using DERIV_in_rball DERIV_isCont by auto |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5077 |
qed |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5078 |
qed |
53079 | 5079 |
|
5080 |
have suminf_arctan_zero: "suminf (?c 0) - arctan 0 = 0" |
|
5081 |
unfolding Suc_eq_plus1[symmetric] power_Suc2 mult_zero_right arctan_zero_zero suminf_zero |
|
5082 |
by auto |
|
5083 |
||
5084 |
have "suminf (?c x) - arctan x = 0" |
|
5085 |
proof (cases "x = 0") |
|
5086 |
case True |
|
5087 |
thus ?thesis using suminf_arctan_zero by auto |
|
5088 |
next |
|
5089 |
case False |
|
5090 |
hence "0 < \<bar>x\<bar>" and "- \<bar>x\<bar> < \<bar>x\<bar>" by auto |
|
5091 |
have "suminf (?c (-\<bar>x\<bar>)) - arctan (-\<bar>x\<bar>) = suminf (?c 0) - arctan 0" |
|
59647
c6f413b660cf
clarified Drule.gen_all: observe context more carefully;
wenzelm
parents:
59613
diff
changeset
|
5092 |
by (rule suminf_eq_arctan_bounded[where x1="0" and a1="-\<bar>x\<bar>" and b1="\<bar>x\<bar>", symmetric]) |
53079 | 5093 |
(simp_all only: `\<bar>x\<bar> < r` `-\<bar>x\<bar> < \<bar>x\<bar>` neg_less_iff_less) |
5094 |
moreover |
|
5095 |
have "suminf (?c x) - arctan x = suminf (?c (-\<bar>x\<bar>)) - arctan (-\<bar>x\<bar>)" |
|
59647
c6f413b660cf
clarified Drule.gen_all: observe context more carefully;
wenzelm
parents:
59613
diff
changeset
|
5096 |
by (rule suminf_eq_arctan_bounded[where x1="x" and a1="-\<bar>x\<bar>" and b1="\<bar>x\<bar>"]) |
54573 | 5097 |
(simp_all only: `\<bar>x\<bar> < r` `-\<bar>x\<bar> < \<bar>x\<bar>` neg_less_iff_less) |
53079 | 5098 |
ultimately |
5099 |
show ?thesis using suminf_arctan_zero by auto |
|
5100 |
qed |
|
5101 |
thus ?thesis by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5102 |
qed |
53079 | 5103 |
} note when_less_one = this |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5104 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5105 |
show "arctan x = suminf (\<lambda> n. ?c x n)" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5106 |
proof (cases "\<bar>x\<bar> < 1") |
53079 | 5107 |
case True |
5108 |
thus ?thesis by (rule when_less_one) |
|
5109 |
next |
|
5110 |
case False |
|
5111 |
hence "\<bar>x\<bar> = 1" using `\<bar>x\<bar> \<le> 1` by auto |
|
5112 |
let ?a = "\<lambda>x n. \<bar>1 / real (n*2+1) * x^(n*2+1)\<bar>" |
|
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
5113 |
let ?diff = "\<lambda> x n. \<bar> arctan x - (\<Sum> i<n. ?c x i)\<bar>" |
53079 | 5114 |
{ |
5115 |
fix n :: nat |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5116 |
have "0 < (1 :: real)" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5117 |
moreover |
53079 | 5118 |
{ |
5119 |
fix x :: real |
|
5120 |
assume "0 < x" and "x < 1" |
|
5121 |
hence "\<bar>x\<bar> \<le> 1" and "\<bar>x\<bar> < 1" by auto |
|
5122 |
from `0 < x` have "0 < 1 / real (0 * 2 + (1::nat)) * x ^ (0 * 2 + 1)" |
|
5123 |
by auto |
|
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5124 |
note bounds = mp[OF arctan_series_borders(2)[OF `\<bar>x\<bar> \<le> 1`] this, unfolded when_less_one[OF `\<bar>x\<bar> < 1`, symmetric], THEN spec] |
53079 | 5125 |
have "0 < 1 / real (n*2+1) * x^(n*2+1)" |
5126 |
by (rule mult_pos_pos, auto simp only: zero_less_power[OF `0 < x`], auto) |
|
5127 |
hence a_pos: "?a x n = 1 / real (n*2+1) * x^(n*2+1)" |
|
5128 |
by (rule abs_of_pos) |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5129 |
have "?diff x n \<le> ?a x n" |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5130 |
proof (cases "even n") |
53079 | 5131 |
case True |
5132 |
hence sgn_pos: "(-1)^n = (1::real)" by auto |
|
58709
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
5133 |
from `even n` obtain m where "n = 2 * m" .. |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
5134 |
then have "2 * m = n" .. |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5135 |
from bounds[of m, unfolded this atLeastAtMost_iff] |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
5136 |
have "\<bar>arctan x - (\<Sum>i<n. (?c x i))\<bar> \<le> (\<Sum>i<n + 1. (?c x i)) - (\<Sum>i<n. (?c x i))" |
53079 | 5137 |
by auto |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5138 |
also have "\<dots> = ?c x n" unfolding One_nat_def by auto |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5139 |
also have "\<dots> = ?a x n" unfolding sgn_pos a_pos by auto |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5140 |
finally show ?thesis . |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5141 |
next |
53079 | 5142 |
case False |
5143 |
hence sgn_neg: "(-1)^n = (-1::real)" by auto |
|
58709
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
5144 |
from `odd n` obtain m where "n = 2 * m + 1" .. |
efdc6c533bd3
prefer generic elimination rules for even/odd over specialized unfold rules for nat
haftmann
parents:
58656
diff
changeset
|
5145 |
then have m_def: "2 * m + 1 = n" .. |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5146 |
hence m_plus: "2 * (m + 1) = n + 1" by auto |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5147 |
from bounds[of "m + 1", unfolded this atLeastAtMost_iff, THEN conjunct1] bounds[of m, unfolded m_def atLeastAtMost_iff, THEN conjunct2] |
56193
c726ecfb22b6
cleanup Series: sorted according to typeclass hierarchy, use {..<_} instead of {0..<_}
hoelzl
parents:
56181
diff
changeset
|
5148 |
have "\<bar>arctan x - (\<Sum>i<n. (?c x i))\<bar> \<le> (\<Sum>i<n. (?c x i)) - (\<Sum>i<n+1. (?c x i))" |
53079 | 5149 |
by auto |
32960
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5150 |
also have "\<dots> = - ?c x n" unfolding One_nat_def by auto |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5151 |
also have "\<dots> = ?a x n" unfolding sgn_neg a_pos by auto |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5152 |
finally show ?thesis . |
69916a850301
eliminated hard tabulators, guessing at each author's individual tab-width;
wenzelm
parents:
32047
diff
changeset
|
5153 |
qed |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5154 |
hence "0 \<le> ?a x n - ?diff x n" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5155 |
} |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5156 |
hence "\<forall> x \<in> { 0 <..< 1 }. 0 \<le> ?a x n - ?diff x n" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5157 |
moreover have "\<And>x. isCont (\<lambda> x. ?a x n - ?diff x n) x" |
54230
b1d955791529
more simplification rules on unary and binary minus
haftmann
parents:
53602
diff
changeset
|
5158 |
unfolding diff_conv_add_uminus divide_inverse |
60150
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5159 |
by (auto intro!: isCont_add isCont_rabs continuous_ident isCont_minus isCont_arctan |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5160 |
isCont_inverse isCont_mult isCont_power continuous_const isCont_setsum |
54230
b1d955791529
more simplification rules on unary and binary minus
haftmann
parents:
53602
diff
changeset
|
5161 |
simp del: add_uminus_conv_diff) |
53079 | 5162 |
ultimately have "0 \<le> ?a 1 n - ?diff 1 n" |
5163 |
by (rule LIM_less_bound) |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5164 |
hence "?diff 1 n \<le> ?a 1 n" by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5165 |
} |
30082
43c5b7bfc791
make more proofs work whether or not One_nat_def is a simp rule
huffman
parents:
29803
diff
changeset
|
5166 |
have "?a 1 ----> 0" |
44568
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44319
diff
changeset
|
5167 |
unfolding tendsto_rabs_zero_iff power_one divide_inverse One_nat_def |
e6f291cb5810
discontinue many legacy theorems about LIM and LIMSEQ, in favor of tendsto theorems
huffman
parents:
44319
diff
changeset
|
5168 |
by (auto intro!: tendsto_mult LIMSEQ_linear LIMSEQ_inverse_real_of_nat) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5169 |
have "?diff 1 ----> 0" |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5170 |
proof (rule LIMSEQ_I) |
53079 | 5171 |
fix r :: real |
5172 |
assume "0 < r" |
|
5173 |
obtain N :: nat where N_I: "\<And>n. N \<le> n \<Longrightarrow> ?a 1 n < r" |
|
5174 |
using LIMSEQ_D[OF `?a 1 ----> 0` `0 < r`] by auto |
|
5175 |
{ |
|
5176 |
fix n |
|
5177 |
assume "N \<le> n" from `?diff 1 n \<le> ?a 1 n` N_I[OF this] |
|
5178 |
have "norm (?diff 1 n - 0) < r" by auto |
|
5179 |
} |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5180 |
thus "\<exists> N. \<forall> n \<ge> N. norm (?diff 1 n - 0) < r" by blast |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5181 |
qed |
44710 | 5182 |
from this [unfolded tendsto_rabs_zero_iff, THEN tendsto_add [OF _ tendsto_const], of "- arctan 1", THEN tendsto_minus] |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5183 |
have "(?c 1) sums (arctan 1)" unfolding sums_def by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5184 |
hence "arctan 1 = (\<Sum> i. ?c 1 i)" by (rule sums_unique) |
41970 | 5185 |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5186 |
show ?thesis |
53079 | 5187 |
proof (cases "x = 1") |
5188 |
case True |
|
5189 |
then show ?thesis by (simp add: `arctan 1 = (\<Sum> i. ?c 1 i)`) |
|
5190 |
next |
|
5191 |
case False |
|
5192 |
hence "x = -1" using `\<bar>x\<bar> = 1` by auto |
|
41970 | 5193 |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5194 |
have "- (pi / 2) < 0" using pi_gt_zero by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5195 |
have "- (2 * pi) < 0" using pi_gt_zero by auto |
41970 | 5196 |
|
53079 | 5197 |
have c_minus_minus: "\<And>i. ?c (- 1) i = - ?c 1 i" |
5198 |
unfolding One_nat_def by auto |
|
5199 |
||
5200 |
have "arctan (- 1) = arctan (tan (-(pi / 4)))" |
|
5201 |
unfolding tan_45 tan_minus .. |
|
5202 |
also have "\<dots> = - (pi / 4)" |
|
5203 |
by (rule arctan_tan, auto simp add: order_less_trans[OF `- (pi / 2) < 0` pi_gt_zero]) |
|
5204 |
also have "\<dots> = - (arctan (tan (pi / 4)))" |
|
5205 |
unfolding neg_equal_iff_equal by (rule arctan_tan[symmetric], auto simp add: order_less_trans[OF `- (2 * pi) < 0` pi_gt_zero]) |
|
5206 |
also have "\<dots> = - (arctan 1)" |
|
5207 |
unfolding tan_45 .. |
|
5208 |
also have "\<dots> = - (\<Sum> i. ?c 1 i)" |
|
5209 |
using `arctan 1 = (\<Sum> i. ?c 1 i)` by auto |
|
5210 |
also have "\<dots> = (\<Sum> i. ?c (- 1) i)" |
|
5211 |
using suminf_minus[OF sums_summable[OF `(?c 1) sums (arctan 1)`]] |
|
5212 |
unfolding c_minus_minus by auto |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5213 |
finally show ?thesis using `x = -1` by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5214 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5215 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5216 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5217 |
|
53079 | 5218 |
lemma arctan_half: |
5219 |
fixes x :: real |
|
53076 | 5220 |
shows "arctan x = 2 * arctan (x / (1 + sqrt(1 + x\<^sup>2)))" |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5221 |
proof - |
53079 | 5222 |
obtain y where low: "- (pi / 2) < y" and high: "y < pi / 2" and y_eq: "tan y = x" |
5223 |
using tan_total by blast |
|
5224 |
hence low2: "- (pi / 2) < y / 2" and high2: "y / 2 < pi / 2" |
|
5225 |
by auto |
|
5226 |
||
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5227 |
have "0 < cos y" using cos_gt_zero_pi[OF low high] . |
53079 | 5228 |
hence "cos y \<noteq> 0" and cos_sqrt: "sqrt ((cos y)\<^sup>2) = cos y" |
5229 |
by auto |
|
5230 |
||
5231 |
have "1 + (tan y)\<^sup>2 = 1 + (sin y)\<^sup>2 / (cos y)\<^sup>2" |
|
5232 |
unfolding tan_def power_divide .. |
|
5233 |
also have "\<dots> = (cos y)\<^sup>2 / (cos y)\<^sup>2 + (sin y)\<^sup>2 / (cos y)\<^sup>2" |
|
5234 |
using `cos y \<noteq> 0` by auto |
|
5235 |
also have "\<dots> = 1 / (cos y)\<^sup>2" |
|
5236 |
unfolding add_divide_distrib[symmetric] sin_cos_squared_add2 .. |
|
53076 | 5237 |
finally have "1 + (tan y)\<^sup>2 = 1 / (cos y)\<^sup>2" . |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5238 |
|
53079 | 5239 |
have "sin y / (cos y + 1) = tan y / ((cos y + 1) / cos y)" |
56571
f4635657d66f
added divide_nonneg_nonneg and co; made it a simp rule
hoelzl
parents:
56544
diff
changeset
|
5240 |
unfolding tan_def using `cos y \<noteq> 0` by (simp add: field_simps) |
53079 | 5241 |
also have "\<dots> = tan y / (1 + 1 / cos y)" |
5242 |
using `cos y \<noteq> 0` unfolding add_divide_distrib by auto |
|
5243 |
also have "\<dots> = tan y / (1 + 1 / sqrt ((cos y)\<^sup>2))" |
|
5244 |
unfolding cos_sqrt .. |
|
5245 |
also have "\<dots> = tan y / (1 + sqrt (1 / (cos y)\<^sup>2))" |
|
5246 |
unfolding real_sqrt_divide by auto |
|
5247 |
finally have eq: "sin y / (cos y + 1) = tan y / (1 + sqrt(1 + (tan y)\<^sup>2))" |
|
5248 |
unfolding `1 + (tan y)\<^sup>2 = 1 / (cos y)\<^sup>2` . |
|
5249 |
||
5250 |
have "arctan x = y" |
|
5251 |
using arctan_tan low high y_eq by auto |
|
5252 |
also have "\<dots> = 2 * (arctan (tan (y/2)))" |
|
5253 |
using arctan_tan[OF low2 high2] by auto |
|
5254 |
also have "\<dots> = 2 * (arctan (sin y / (cos y + 1)))" |
|
5255 |
unfolding tan_half by auto |
|
5256 |
finally show ?thesis |
|
5257 |
unfolding eq `tan y = x` . |
|
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5258 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5259 |
|
53079 | 5260 |
lemma arctan_monotone: "x < y \<Longrightarrow> arctan x < arctan y" |
5261 |
by (simp only: arctan_less_iff) |
|
5262 |
||
5263 |
lemma arctan_monotone': "x \<le> y \<Longrightarrow> arctan x \<le> arctan y" |
|
5264 |
by (simp only: arctan_le_iff) |
|
44746 | 5265 |
|
5266 |
lemma arctan_inverse: |
|
53079 | 5267 |
assumes "x \<noteq> 0" |
5268 |
shows "arctan (1 / x) = sgn x * pi / 2 - arctan x" |
|
44746 | 5269 |
proof (rule arctan_unique) |
5270 |
show "- (pi / 2) < sgn x * pi / 2 - arctan x" |
|
5271 |
using arctan_bounded [of x] assms |
|
5272 |
unfolding sgn_real_def |
|
59869 | 5273 |
apply (auto simp add: arctan algebra_simps) |
44746 | 5274 |
apply (drule zero_less_arctan_iff [THEN iffD2]) |
5275 |
apply arith |
|
5276 |
done |
|
5277 |
show "sgn x * pi / 2 - arctan x < pi / 2" |
|
5278 |
using arctan_bounded [of "- x"] assms |
|
5279 |
unfolding sgn_real_def arctan_minus |
|
54489
03ff4d1e6784
eliminiated neg_numeral in favour of - (numeral _)
haftmann
parents:
54230
diff
changeset
|
5280 |
by (auto simp add: algebra_simps) |
44746 | 5281 |
show "tan (sgn x * pi / 2 - arctan x) = 1 / x" |
5282 |
unfolding tan_inverse [of "arctan x", unfolded tan_arctan] |
|
5283 |
unfolding sgn_real_def |
|
56479
91958d4b30f7
revert c1bbd3e22226, a14831ac3023, and 36489d77c484: divide_minus_left/right are again simp rules
hoelzl
parents:
56409
diff
changeset
|
5284 |
by (simp add: tan_def cos_arctan sin_arctan sin_diff cos_diff) |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5285 |
qed |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5286 |
|
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5287 |
theorem pi_series: "pi / 4 = (\<Sum> k. (-1)^k * 1 / real (k*2+1))" (is "_ = ?SUM") |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5288 |
proof - |
44746 | 5289 |
have "pi / 4 = arctan 1" using arctan_one by auto |
29803
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5290 |
also have "\<dots> = ?SUM" using arctan_series[of 1] by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5291 |
finally show ?thesis by auto |
c56a5571f60a
Added derivation lemmas for power series and theorems for the pi, arcus tangens and logarithm series
hoelzl
parents:
29695
diff
changeset
|
5292 |
qed |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
5293 |
|
53079 | 5294 |
|
22978
1cd8cc21a7c3
clean up polar_Ex proofs; remove unnecessary lemmas
huffman
parents:
22977
diff
changeset
|
5295 |
subsection {* Existence of Polar Coordinates *} |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
5296 |
|
53015
a1119cf551e8
standardized symbols via "isabelle update_sub_sup", excluding src/Pure and src/Tools/WWW_Find;
wenzelm
parents:
52139
diff
changeset
|
5297 |
lemma cos_x_y_le_one: "\<bar>x / sqrt (x\<^sup>2 + y\<^sup>2)\<bar> \<le> 1" |
53079 | 5298 |
apply (rule power2_le_imp_le [OF _ zero_le_one]) |
5299 |
apply (simp add: power_divide divide_le_eq not_sum_power2_lt_zero) |
|
5300 |
done |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
5301 |
|
22978
1cd8cc21a7c3
clean up polar_Ex proofs; remove unnecessary lemmas
huffman
parents:
22977
diff
changeset
|
5302 |
lemmas cos_arccos_lemma1 = cos_arccos_abs [OF cos_x_y_le_one] |
15228 | 5303 |
|
23045
95e04f335940
add lemmas about inverse functions; cleaned up proof of polar_ex
huffman
parents:
23043
diff
changeset
|
5304 |
lemmas sin_arccos_lemma1 = sin_arccos_abs [OF cos_x_y_le_one] |
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
5305 |
|
59658
0cc388370041
sin, cos generalised from type real to any "'a::{real_normed_field,banach}", including complex
paulson <lp15@cam.ac.uk>
parents:
59647
diff
changeset
|
5306 |
lemma polar_Ex: "\<exists>r::real. \<exists>a. x = r * cos a & y = r * sin a" |
54573 | 5307 |
proof - |
5308 |
have polar_ex1: "\<And>y. 0 < y \<Longrightarrow> \<exists>r a. x = r * cos a & y = r * sin a" |
|
5309 |
apply (rule_tac x = "sqrt (x\<^sup>2 + y\<^sup>2)" in exI) |
|
5310 |
apply (rule_tac x = "arccos (x / sqrt (x\<^sup>2 + y\<^sup>2))" in exI) |
|
5311 |
apply (simp add: cos_arccos_lemma1 sin_arccos_lemma1 power_divide |
|
5312 |
real_sqrt_mult [symmetric] right_diff_distrib) |
|
5313 |
done |
|
5314 |
show ?thesis |
|
5315 |
proof (cases "0::real" y rule: linorder_cases) |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
5316 |
case less |
54573 | 5317 |
then show ?thesis by (rule polar_ex1) |
5318 |
next |
|
5319 |
case equal |
|
5320 |
then show ?thesis |
|
5321 |
by (force simp add: intro!: cos_zero sin_zero) |
|
5322 |
next |
|
5323 |
case greater |
|
59669
de7792ea4090
renaming HOL/Fact.thy -> Binomial.thy
paulson <lp15@cam.ac.uk>
parents:
59658
diff
changeset
|
5324 |
then show ?thesis |
54573 | 5325 |
using polar_ex1 [where y="-y"] |
5326 |
by auto (metis cos_minus minus_minus minus_mult_right sin_minus) |
|
5327 |
qed |
|
5328 |
qed |
|
15077
89840837108e
converting Hyperreal/Transcendental to Isar script
paulson
parents:
15013
diff
changeset
|
5329 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5330 |
|
60150
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5331 |
subsection{*Basics about polynomial functions: products, extremal behaviour and root counts*} |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5332 |
|
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5333 |
lemma pairs_le_eq_Sigma: |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5334 |
fixes m::nat |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5335 |
shows "{(i,j). i+j \<le> m} = Sigma (atMost m) (\<lambda>r. atMost (m-r))" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5336 |
by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5337 |
|
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5338 |
lemma setsum_up_index_split: |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5339 |
"(\<Sum>k\<le>m + n. f k) = (\<Sum>k\<le>m. f k) + (\<Sum>k = Suc m..m + n. f k)" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5340 |
by (metis atLeast0AtMost Suc_eq_plus1 le0 setsum_ub_add_nat) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5341 |
|
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5342 |
lemma Sigma_interval_disjoint: |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5343 |
fixes w :: "'a::order" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5344 |
shows "(SIGMA i:A. {..v i}) \<inter> (SIGMA i:A.{v i<..w}) = {}" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5345 |
by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5346 |
|
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5347 |
lemma product_atMost_eq_Un: |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5348 |
fixes m :: nat |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5349 |
shows "A \<times> {..m} = (SIGMA i:A.{..m - i}) \<union> (SIGMA i:A.{m - i<..m})" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5350 |
by auto |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5351 |
|
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5352 |
lemma polynomial_product: (*with thanks to Chaitanya Mangla*) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5353 |
fixes x:: "'a :: idom" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5354 |
assumes m: "\<And>i. i>m \<Longrightarrow> (a i) = 0" and n: "\<And>j. j>n \<Longrightarrow> (b j) = 0" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5355 |
shows "(\<Sum>i\<le>m. (a i) * x ^ i) * (\<Sum>j\<le>n. (b j) * x ^ j) = |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5356 |
(\<Sum>r\<le>m + n. (\<Sum>k\<le>r. (a k) * (b (r - k))) * x ^ r)" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5357 |
proof - |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5358 |
have "(\<Sum>i\<le>m. (a i) * x ^ i) * (\<Sum>j\<le>n. (b j) * x ^ j) = (\<Sum>i\<le>m. \<Sum>j\<le>n. (a i * x ^ i) * (b j * x ^ j))" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5359 |
by (rule setsum_product) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5360 |
also have "... = (\<Sum>i\<le>m + n. \<Sum>j\<le>n + m. a i * x ^ i * (b j * x ^ j))" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5361 |
using assms by (auto simp: setsum_up_index_split) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5362 |
also have "... = (\<Sum>r\<le>m + n. \<Sum>j\<le>m + n - r. a r * x ^ r * (b j * x ^ j))" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5363 |
apply (simp add: add_ac setsum.Sigma product_atMost_eq_Un) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5364 |
apply (clarsimp simp add: setsum_Un Sigma_interval_disjoint intro!: setsum.neutral) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5365 |
by (metis add_diff_assoc2 add.commute add_lessD1 leD m n nat_le_linear neqE) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5366 |
also have "... = (\<Sum>(i,j)\<in>{(i,j). i+j \<le> m+n}. (a i * x ^ i) * (b j * x ^ j))" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5367 |
by (auto simp: pairs_le_eq_Sigma setsum.Sigma) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5368 |
also have "... = (\<Sum>r\<le>m + n. (\<Sum>k\<le>r. (a k) * (b (r - k))) * x ^ r)" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5369 |
apply (subst setsum_triangle_reindex_eq) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5370 |
apply (auto simp: algebra_simps setsum_right_distrib intro!: setsum.cong) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5371 |
by (metis le_add_diff_inverse power_add) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5372 |
finally show ?thesis . |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5373 |
qed |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5374 |
|
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5375 |
lemma polynomial_product_nat: |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5376 |
fixes x:: nat |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5377 |
assumes m: "\<And>i. i>m \<Longrightarrow> (a i) = 0" and n: "\<And>j. j>n \<Longrightarrow> (b j) = 0" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5378 |
shows "(\<Sum>i\<le>m. (a i) * x ^ i) * (\<Sum>j\<le>n. (b j) * x ^ j) = |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5379 |
(\<Sum>r\<le>m + n. (\<Sum>k\<le>r. (a k) * (b (r - k))) * x ^ r)" |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5380 |
using polynomial_product [of m a n b x] assms |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5381 |
by (simp add: Int.zpower_int Int.zmult_int Int.int_setsum [symmetric]) |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5382 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5383 |
lemma polyfun_diff: (*COMPLEX_SUB_POLYFUN in HOL Light*) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5384 |
fixes x :: "'a::idom" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5385 |
assumes "1 \<le> n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5386 |
shows "(\<Sum>i\<le>n. a i * x^i) - (\<Sum>i\<le>n. a i * y^i) = |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5387 |
(x - y) * (\<Sum>j<n. (\<Sum>i=Suc j..n. a i * y^(i - j - 1)) * x^j)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5388 |
proof - |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5389 |
have h: "bij_betw (\<lambda>(i,j). (j,i)) ((SIGMA i : atMost n. lessThan i)) (SIGMA j : lessThan n. {Suc j..n})" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5390 |
by (auto simp: bij_betw_def inj_on_def) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5391 |
have "(\<Sum>i\<le>n. a i * x^i) - (\<Sum>i\<le>n. a i * y^i) = |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5392 |
(\<Sum>i\<le>n. a i * (x^i - y^i))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5393 |
by (simp add: right_diff_distrib setsum_subtractf) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5394 |
also have "... = (\<Sum>i\<le>n. a i * (x - y) * (\<Sum>j<i. y^(i - Suc j) * x^j))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5395 |
by (simp add: power_diff_sumr2 mult.assoc) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5396 |
also have "... = (\<Sum>i\<le>n. \<Sum>j<i. a i * (x - y) * (y^(i - Suc j) * x^j))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5397 |
by (simp add: setsum_right_distrib) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5398 |
also have "... = (\<Sum>(i,j) \<in> (SIGMA i : atMost n. lessThan i). a i * (x - y) * (y^(i - Suc j) * x^j))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5399 |
by (simp add: setsum.Sigma) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5400 |
also have "... = (\<Sum>(j,i) \<in> (SIGMA j : lessThan n. {Suc j..n}). a i * (x - y) * (y^(i - Suc j) * x^j))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5401 |
by (auto simp add: setsum.reindex_bij_betw [OF h, symmetric] intro: setsum.strong_cong) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5402 |
also have "... = (\<Sum>j<n. \<Sum>i=Suc j..n. a i * (x - y) * (y^(i - Suc j) * x^j))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5403 |
by (simp add: setsum.Sigma) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5404 |
also have "... = (x - y) * (\<Sum>j<n. (\<Sum>i=Suc j..n. a i * y^(i - j - 1)) * x^j)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5405 |
by (simp add: setsum_right_distrib mult_ac) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5406 |
finally show ?thesis . |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5407 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5408 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5409 |
lemma polyfun_diff_alt: (*COMPLEX_SUB_POLYFUN_ALT in HOL Light*) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5410 |
fixes x :: "'a::idom" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5411 |
assumes "1 \<le> n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5412 |
shows "(\<Sum>i\<le>n. a i * x^i) - (\<Sum>i\<le>n. a i * y^i) = |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5413 |
(x - y) * ((\<Sum>j<n. \<Sum>k<n-j. a(j+k+1) * y^k * x^j))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5414 |
proof - |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5415 |
{ fix j::nat |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5416 |
assume "j<n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5417 |
have h: "bij_betw (\<lambda>i. i - (j + 1)) {Suc j..n} (lessThan (n-j))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5418 |
apply (auto simp: bij_betw_def inj_on_def) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5419 |
apply (rule_tac x="x + Suc j" in image_eqI) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5420 |
apply (auto simp: ) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5421 |
done |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5422 |
have "(\<Sum>i=Suc j..n. a i * y^(i - j - 1)) = (\<Sum>k<n-j. a(j+k+1) * y^k)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5423 |
by (auto simp add: setsum.reindex_bij_betw [OF h, symmetric] intro: setsum.strong_cong) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5424 |
} |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5425 |
then show ?thesis |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5426 |
by (simp add: polyfun_diff [OF assms] setsum_left_distrib) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5427 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5428 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5429 |
lemma polyfun_linear_factor: (*COMPLEX_POLYFUN_LINEAR_FACTOR in HOL Light*) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5430 |
fixes a :: "'a::idom" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5431 |
shows "\<exists>b. \<forall>z. (\<Sum>i\<le>n. c(i) * z^i) = (z - a) * (\<Sum>i<n. b(i) * z^i) + (\<Sum>i\<le>n. c(i) * a^i)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5432 |
proof (cases "n=0") |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5433 |
case True then show ?thesis |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5434 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5435 |
next |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5436 |
case False |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5437 |
have "(\<exists>b. \<forall>z. (\<Sum>i\<le>n. c(i) * z^i) = (z - a) * (\<Sum>i<n. b(i) * z^i) + (\<Sum>i\<le>n. c(i) * a^i)) = |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5438 |
(\<exists>b. \<forall>z. (\<Sum>i\<le>n. c(i) * z^i) - (\<Sum>i\<le>n. c(i) * a^i) = (z - a) * (\<Sum>i<n. b(i) * z^i))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5439 |
by (simp add: algebra_simps) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5440 |
also have "... = (\<exists>b. \<forall>z. (z - a) * (\<Sum>j<n. (\<Sum>i = Suc j..n. c i * a^(i - Suc j)) * z^j) = (z - a) * (\<Sum>i<n. b(i) * z^i))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5441 |
using False by (simp add: polyfun_diff) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5442 |
also have "... = True" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5443 |
by auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5444 |
finally show ?thesis |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5445 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5446 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5447 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5448 |
lemma polyfun_linear_factor_root: (*COMPLEX_POLYFUN_LINEAR_FACTOR_ROOT in HOL Light*) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5449 |
fixes a :: "'a::idom" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5450 |
assumes "(\<Sum>i\<le>n. c(i) * a^i) = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5451 |
obtains b where "\<And>z. (\<Sum>i\<le>n. c(i) * z^i) = (z - a) * (\<Sum>i<n. b(i) * z^i)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5452 |
using polyfun_linear_factor [of c n a] assms |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5453 |
by auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5454 |
|
60150
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5455 |
(*The material of this section, up until this point, could go into a new theory of polynomials |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5456 |
based on Main alone. The remaining material involves limits, continuity, series, etc.*) |
bd773c47ad0b
New material about complex transcendental functions (especially Ln, Arg) and polynomials
paulson <lp15@cam.ac.uk>
parents:
60141
diff
changeset
|
5457 |
|
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5458 |
lemma isCont_polynom: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5459 |
fixes c :: "nat \<Rightarrow> 'a::real_normed_div_algebra" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5460 |
shows "isCont (\<lambda>w. \<Sum>i\<le>n. c i * w^i) a" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5461 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5462 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5463 |
lemma zero_polynom_imp_zero_coeffs: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5464 |
fixes c :: "nat \<Rightarrow> 'a::{ab_semigroup_mult,real_normed_div_algebra}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5465 |
assumes "\<And>w. (\<Sum>i\<le>n. c i * w^i) = 0" "k \<le> n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5466 |
shows "c k = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5467 |
using assms |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5468 |
proof (induction n arbitrary: c k) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5469 |
case 0 |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5470 |
then show ?case |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5471 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5472 |
next |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5473 |
case (Suc n c k) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5474 |
have [simp]: "c 0 = 0" using Suc.prems(1) [of 0] |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5475 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5476 |
{ fix w |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5477 |
have "(\<Sum>i\<le>Suc n. c i * w^i) = (\<Sum>i\<le>n. c (Suc i) * w ^ Suc i)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5478 |
unfolding Set_Interval.setsum_atMost_Suc_shift |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5479 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5480 |
also have "... = w * (\<Sum>i\<le>n. c (Suc i) * w^i)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5481 |
by (simp add: power_Suc mult_ac setsum_right_distrib del: setsum_atMost_Suc) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5482 |
finally have "(\<Sum>i\<le>Suc n. c i * w^i) = w * (\<Sum>i\<le>n. c (Suc i) * w^i)" . |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5483 |
} |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5484 |
then have wnz: "\<And>w. w \<noteq> 0 \<Longrightarrow> (\<Sum>i\<le>n. c (Suc i) * w^i) = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5485 |
using Suc by auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5486 |
then have "(\<lambda>h. \<Sum>i\<le>n. c (Suc i) * h^i) -- 0 --> 0" |
60035 | 5487 |
by (simp cong: LIM_cong) --{*the case @{term"w=0"} by continuity*} |
60017
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5488 |
then have "(\<Sum>i\<le>n. c (Suc i) * 0^i) = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5489 |
using isCont_polynom [of 0 "\<lambda>i. c (Suc i)" n] LIM_unique |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5490 |
by (force simp add: Limits.isCont_iff) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5491 |
then have "\<And>w. (\<Sum>i\<le>n. c (Suc i) * w^i) = 0" using wnz |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5492 |
by metis |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5493 |
then have "\<And>i. i\<le>n \<Longrightarrow> c (Suc i) = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5494 |
using Suc.IH [of "\<lambda>i. c (Suc i)"] |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5495 |
by blast |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5496 |
then show ?case using `k \<le> Suc n` |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5497 |
by (cases k) auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5498 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5499 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5500 |
lemma polyfun_rootbound: (*COMPLEX_POLYFUN_ROOTBOUND in HOL Light*) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5501 |
fixes c :: "nat \<Rightarrow> 'a::{idom,real_normed_div_algebra}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5502 |
assumes "c k \<noteq> 0" "k\<le>n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5503 |
shows "finite {z. (\<Sum>i\<le>n. c(i) * z^i) = 0} \<and> |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5504 |
card {z. (\<Sum>i\<le>n. c(i) * z^i) = 0} \<le> n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5505 |
using assms |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5506 |
proof (induction n arbitrary: c k) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5507 |
case 0 |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5508 |
then show ?case |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5509 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5510 |
next |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5511 |
case (Suc m c k) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5512 |
let ?succase = ?case |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5513 |
show ?case |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5514 |
proof (cases "{z. (\<Sum>i\<le>Suc m. c(i) * z^i) = 0} = {}") |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5515 |
case True |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5516 |
then show ?succase |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5517 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5518 |
next |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5519 |
case False |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5520 |
then obtain z0 where z0: "(\<Sum>i\<le>Suc m. c(i) * z0^i) = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5521 |
by blast |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5522 |
then obtain b where b: "\<And>w. (\<Sum>i\<le>Suc m. c i * w^i) = (w - z0) * (\<Sum>i\<le>m. b i * w^i)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5523 |
using polyfun_linear_factor_root [OF z0, unfolded lessThan_Suc_atMost] |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5524 |
by blast |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5525 |
then have eq: "{z. (\<Sum>i\<le>Suc m. c(i) * z^i) = 0} = insert z0 {z. (\<Sum>i\<le>m. b(i) * z^i) = 0}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5526 |
by auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5527 |
have "~(\<forall>k\<le>m. b k = 0)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5528 |
proof |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5529 |
assume [simp]: "\<forall>k\<le>m. b k = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5530 |
then have "\<And>w. (\<Sum>i\<le>m. b i * w^i) = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5531 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5532 |
then have "\<And>w. (\<Sum>i\<le>Suc m. c i * w^i) = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5533 |
using b by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5534 |
then have "\<And>k. k \<le> Suc m \<Longrightarrow> c k = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5535 |
using zero_polynom_imp_zero_coeffs |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5536 |
by blast |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5537 |
then show False using Suc.prems |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5538 |
by blast |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5539 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5540 |
then obtain k' where bk': "b k' \<noteq> 0" "k' \<le> m" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5541 |
by blast |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5542 |
show ?succase |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5543 |
using Suc.IH [of b k'] bk' |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5544 |
by (simp add: eq card_insert_if del: setsum_atMost_Suc) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5545 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5546 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5547 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5548 |
lemma |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5549 |
fixes c :: "nat \<Rightarrow> 'a::{idom,real_normed_div_algebra}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5550 |
assumes "c k \<noteq> 0" "k\<le>n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5551 |
shows polyfun_roots_finite: "finite {z. (\<Sum>i\<le>n. c(i) * z^i) = 0}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5552 |
and polyfun_roots_card: "card {z. (\<Sum>i\<le>n. c(i) * z^i) = 0} \<le> n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5553 |
using polyfun_rootbound assms |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5554 |
by auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5555 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5556 |
lemma polyfun_finite_roots: (*COMPLEX_POLYFUN_FINITE_ROOTS in HOL Light*) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5557 |
fixes c :: "nat \<Rightarrow> 'a::{idom,real_normed_div_algebra}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5558 |
shows "finite {x. (\<Sum>i\<le>n. c i * x^i) = 0} \<longleftrightarrow> (\<exists>i\<le>n. c i \<noteq> 0)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5559 |
(is "?lhs = ?rhs") |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5560 |
proof |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5561 |
assume ?lhs |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5562 |
moreover |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5563 |
{ assume "\<forall>i\<le>n. c i = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5564 |
then have "\<And>x. (\<Sum>i\<le>n. c i * x^i) = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5565 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5566 |
then have "\<not> finite {x. (\<Sum>i\<le>n. c i * x^i) = 0}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5567 |
using ex_new_if_finite [OF infinite_UNIV_char_0 [where 'a='a]] |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5568 |
by auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5569 |
} |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5570 |
ultimately show ?rhs |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5571 |
by metis |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5572 |
next |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5573 |
assume ?rhs |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5574 |
then show ?lhs |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5575 |
using polyfun_rootbound |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5576 |
by blast |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5577 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5578 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5579 |
lemma polyfun_eq_0: (*COMPLEX_POLYFUN_EQ_0 in HOL Light*) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5580 |
fixes c :: "nat \<Rightarrow> 'a::{idom,real_normed_div_algebra}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5581 |
shows "(\<forall>x. (\<Sum>i\<le>n. c i * x^i) = 0) \<longleftrightarrow> (\<forall>i\<le>n. c i = 0)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5582 |
using zero_polynom_imp_zero_coeffs by auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5583 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5584 |
lemma polyfun_eq_coeffs: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5585 |
fixes c :: "nat \<Rightarrow> 'a::{idom,real_normed_div_algebra}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5586 |
shows "(\<forall>x. (\<Sum>i\<le>n. c i * x^i) = (\<Sum>i\<le>n. d i * x^i)) \<longleftrightarrow> (\<forall>i\<le>n. c i = d i)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5587 |
proof - |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5588 |
have "(\<forall>x. (\<Sum>i\<le>n. c i * x^i) = (\<Sum>i\<le>n. d i * x^i)) \<longleftrightarrow> (\<forall>x. (\<Sum>i\<le>n. (c i - d i) * x^i) = 0)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5589 |
by (simp add: left_diff_distrib Groups_Big.setsum_subtractf) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5590 |
also have "... \<longleftrightarrow> (\<forall>i\<le>n. c i - d i = 0)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5591 |
by (rule polyfun_eq_0) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5592 |
finally show ?thesis |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5593 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5594 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5595 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5596 |
lemma polyfun_eq_const: (*COMPLEX_POLYFUN_EQ_CONST in HOL Light*) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5597 |
fixes c :: "nat \<Rightarrow> 'a::{idom,real_normed_div_algebra}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5598 |
shows "(\<forall>x. (\<Sum>i\<le>n. c i * x^i) = k) \<longleftrightarrow> c 0 = k \<and> (\<forall>i \<in> {1..n}. c i = 0)" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5599 |
(is "?lhs = ?rhs") |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5600 |
proof - |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5601 |
have *: "\<forall>x. (\<Sum>i\<le>n. (if i=0 then k else 0) * x^i) = k" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5602 |
by (induct n) auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5603 |
show ?thesis |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5604 |
proof |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5605 |
assume ?lhs |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5606 |
with * have "(\<forall>i\<le>n. c i = (if i=0 then k else 0))" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5607 |
by (simp add: polyfun_eq_coeffs [symmetric]) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5608 |
then show ?rhs |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5609 |
by simp |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5610 |
next |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5611 |
assume ?rhs then show ?lhs |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5612 |
by (induct n) auto |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5613 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5614 |
qed |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5615 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5616 |
lemma root_polyfun: |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5617 |
fixes z:: "'a::idom" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5618 |
assumes "1 \<le> n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5619 |
shows "z^n = a \<longleftrightarrow> (\<Sum>i\<le>n. (if i = 0 then -a else if i=n then 1 else 0) * z^i) = 0" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5620 |
using assms |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5621 |
by (cases n; simp add: setsum_head_Suc atLeast0AtMost [symmetric]) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5622 |
|
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5623 |
lemma |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5624 |
fixes zz :: "'a::{idom,real_normed_div_algebra}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5625 |
assumes "1 \<le> n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5626 |
shows finite_roots_unity: "finite {z::'a. z^n = 1}" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5627 |
and card_roots_unity: "card {z::'a. z^n = 1} \<le> n" |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5628 |
using polyfun_rootbound [of "\<lambda>i. if i = 0 then -1 else if i=n then 1 else 0" n n] assms |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5629 |
by (auto simp add: root_polyfun [OF assms]) |
b785d6d06430
Overloading of ln and powr, but "approximation" no longer works for powr. Code generation also fails due to type ambiguity in scala.
paulson <lp15@cam.ac.uk>
parents:
59869
diff
changeset
|
5630 |
|
30082
43c5b7bfc791
make more proofs work whether or not One_nat_def is a simp rule
huffman
parents:
29803
diff
changeset
|
5631 |
end |