author | haftmann |
Fri, 27 Mar 2009 12:22:02 +0100 | |
changeset 30743 | 2c83f7eaf1a4 |
parent 30661 | 54858c8ad226 |
child 30747 | b8ca7e450de3 |
permissions | -rw-r--r-- |
29687 | 1 |
(* Title: Formal_Power_Series.thy |
2 |
Author: Amine Chaieb, University of Cambridge |
|
3 |
*) |
|
4 |
||
5 |
header{* A formalization of formal power series *} |
|
6 |
||
7 |
theory Formal_Power_Series |
|
30661 | 8 |
imports Main Fact Parity |
29687 | 9 |
begin |
10 |
||
29906 | 11 |
subsection {* The type of formal power series*} |
29687 | 12 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
13 |
typedef (open) 'a fps = "{f :: nat \<Rightarrow> 'a. True}" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
14 |
morphisms fps_nth Abs_fps |
29687 | 15 |
by simp |
16 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
17 |
notation fps_nth (infixl "$" 75) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
18 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
19 |
lemma expand_fps_eq: "p = q \<longleftrightarrow> (\<forall>n. p $ n = q $ n)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
20 |
by (simp add: fps_nth_inject [symmetric] expand_fun_eq) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
21 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
22 |
lemma fps_ext: "(\<And>n. p $ n = q $ n) \<Longrightarrow> p = q" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
23 |
by (simp add: expand_fps_eq) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
24 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
25 |
lemma fps_nth_Abs_fps [simp]: "Abs_fps f $ n = f n" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
26 |
by (simp add: Abs_fps_inverse) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
27 |
|
29687 | 28 |
text{* Definition of the basic elements 0 and 1 and the basic operations of addition, negation and multiplication *} |
29 |
||
30 |
instantiation fps :: (zero) zero |
|
31 |
begin |
|
32 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
33 |
definition fps_zero_def: |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
34 |
"0 = Abs_fps (\<lambda>n. 0)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
35 |
|
29687 | 36 |
instance .. |
37 |
end |
|
38 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
39 |
lemma fps_zero_nth [simp]: "0 $ n = 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
40 |
unfolding fps_zero_def by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
41 |
|
29687 | 42 |
instantiation fps :: ("{one,zero}") one |
43 |
begin |
|
44 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
45 |
definition fps_one_def: |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
46 |
"1 = Abs_fps (\<lambda>n. if n = 0 then 1 else 0)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
47 |
|
29687 | 48 |
instance .. |
49 |
end |
|
50 |
||
30488 | 51 |
lemma fps_one_nth [simp]: "1 $ n = (if n = 0 then 1 else 0)" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
52 |
unfolding fps_one_def by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
53 |
|
29687 | 54 |
instantiation fps :: (plus) plus |
55 |
begin |
|
56 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
57 |
definition fps_plus_def: |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
58 |
"op + = (\<lambda>f g. Abs_fps (\<lambda>n. f $ n + g $ n))" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
59 |
|
29687 | 60 |
instance .. |
61 |
end |
|
62 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
63 |
lemma fps_add_nth [simp]: "(f + g) $ n = f $ n + g $ n" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
64 |
unfolding fps_plus_def by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
65 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
66 |
instantiation fps :: (minus) minus |
29687 | 67 |
begin |
68 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
69 |
definition fps_minus_def: |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
70 |
"op - = (\<lambda>f g. Abs_fps (\<lambda>n. f $ n - g $ n))" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
71 |
|
29687 | 72 |
instance .. |
73 |
end |
|
74 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
75 |
lemma fps_sub_nth [simp]: "(f - g) $ n = f $ n - g $ n" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
76 |
unfolding fps_minus_def by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
77 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
78 |
instantiation fps :: (uminus) uminus |
29687 | 79 |
begin |
80 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
81 |
definition fps_uminus_def: |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
82 |
"uminus = (\<lambda>f. Abs_fps (\<lambda>n. - (f $ n)))" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
83 |
|
29687 | 84 |
instance .. |
85 |
end |
|
86 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
87 |
lemma fps_neg_nth [simp]: "(- f) $ n = - (f $ n)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
88 |
unfolding fps_uminus_def by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
89 |
|
29687 | 90 |
instantiation fps :: ("{comm_monoid_add, times}") times |
91 |
begin |
|
92 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
93 |
definition fps_times_def: |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
94 |
"op * = (\<lambda>f g. Abs_fps (\<lambda>n. \<Sum>i=0..n. f $ i * g $ (n - i)))" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
95 |
|
29687 | 96 |
instance .. |
97 |
end |
|
98 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
99 |
lemma fps_mult_nth: "(f * g) $ n = (\<Sum>i=0..n. f$i * g$(n - i))" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
100 |
unfolding fps_times_def by simp |
29687 | 101 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
102 |
declare atLeastAtMost_iff[presburger] |
29687 | 103 |
declare Bex_def[presburger] |
104 |
declare Ball_def[presburger] |
|
105 |
||
29913 | 106 |
lemma mult_delta_left: |
107 |
fixes x y :: "'a::mult_zero" |
|
108 |
shows "(if b then x else 0) * y = (if b then x * y else 0)" |
|
109 |
by simp |
|
110 |
||
111 |
lemma mult_delta_right: |
|
112 |
fixes x y :: "'a::mult_zero" |
|
113 |
shows "x * (if b then y else 0) = (if b then x * y else 0)" |
|
114 |
by simp |
|
115 |
||
29687 | 116 |
lemma cond_value_iff: "f (if b then x else y) = (if b then f x else f y)" |
117 |
by auto |
|
118 |
lemma cond_application_beta: "(if b then f else g) x = (if b then f x else g x)" |
|
119 |
by auto |
|
120 |
||
30488 | 121 |
subsection{* Formal power series form a commutative ring with unity, if the range of sequences |
29687 | 122 |
they represent is a commutative ring with unity*} |
123 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
124 |
instance fps :: (semigroup_add) semigroup_add |
29687 | 125 |
proof |
126 |
fix a b c :: "'a fps" show "a + b + c = a + (b + c)" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
127 |
by (simp add: fps_ext add_assoc) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
128 |
qed |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
129 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
130 |
instance fps :: (ab_semigroup_add) ab_semigroup_add |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
131 |
proof |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
132 |
fix a b :: "'a fps" show "a + b = b + a" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
133 |
by (simp add: fps_ext add_commute) |
29687 | 134 |
qed |
135 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
136 |
lemma fps_mult_assoc_lemma: |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
137 |
fixes k :: nat and f :: "nat \<Rightarrow> nat \<Rightarrow> nat \<Rightarrow> 'a::comm_monoid_add" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
138 |
shows "(\<Sum>j=0..k. \<Sum>i=0..j. f i (j - i) (n - j)) = |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
139 |
(\<Sum>j=0..k. \<Sum>i=0..k - j. f j i (n - j - i))" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
140 |
proof (induct k) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
141 |
case 0 show ?case by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
142 |
next |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
143 |
case (Suc k) thus ?case |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
144 |
by (simp add: Suc_diff_le setsum_addf add_assoc |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
145 |
cong: strong_setsum_cong) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
146 |
qed |
29687 | 147 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
148 |
instance fps :: (semiring_0) semigroup_mult |
29687 | 149 |
proof |
150 |
fix a b c :: "'a fps" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
151 |
show "(a * b) * c = a * (b * c)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
152 |
proof (rule fps_ext) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
153 |
fix n :: nat |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
154 |
have "(\<Sum>j=0..n. \<Sum>i=0..j. a$i * b$(j - i) * c$(n - j)) = |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
155 |
(\<Sum>j=0..n. \<Sum>i=0..n - j. a$j * b$i * c$(n - j - i))" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
156 |
by (rule fps_mult_assoc_lemma) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
157 |
thus "((a * b) * c) $ n = (a * (b * c)) $ n" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
158 |
by (simp add: fps_mult_nth setsum_right_distrib |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
159 |
setsum_left_distrib mult_assoc) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
160 |
qed |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
161 |
qed |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
162 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
163 |
lemma fps_mult_commute_lemma: |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
164 |
fixes n :: nat and f :: "nat \<Rightarrow> nat \<Rightarrow> 'a::comm_monoid_add" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
165 |
shows "(\<Sum>i=0..n. f i (n - i)) = (\<Sum>i=0..n. f (n - i) i)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
166 |
proof (rule setsum_reindex_cong) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
167 |
show "inj_on (\<lambda>i. n - i) {0..n}" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
168 |
by (rule inj_onI) simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
169 |
show "{0..n} = (\<lambda>i. n - i) ` {0..n}" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
170 |
by (auto, rule_tac x="n - x" in image_eqI, simp_all) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
171 |
next |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
172 |
fix i assume "i \<in> {0..n}" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
173 |
hence "n - (n - i) = i" by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
174 |
thus "f (n - i) i = f (n - i) (n - (n - i))" by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
175 |
qed |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
176 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
177 |
instance fps :: (comm_semiring_0) ab_semigroup_mult |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
178 |
proof |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
179 |
fix a b :: "'a fps" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
180 |
show "a * b = b * a" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
181 |
proof (rule fps_ext) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
182 |
fix n :: nat |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
183 |
have "(\<Sum>i=0..n. a$i * b$(n - i)) = (\<Sum>i=0..n. a$(n - i) * b$i)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
184 |
by (rule fps_mult_commute_lemma) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
185 |
thus "(a * b) $ n = (b * a) $ n" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
186 |
by (simp add: fps_mult_nth mult_commute) |
29687 | 187 |
qed |
188 |
qed |
|
189 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
190 |
instance fps :: (monoid_add) monoid_add |
29687 | 191 |
proof |
192 |
fix a :: "'a fps" show "0 + a = a " |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
193 |
by (simp add: fps_ext) |
29687 | 194 |
next |
195 |
fix a :: "'a fps" show "a + 0 = a " |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
196 |
by (simp add: fps_ext) |
29687 | 197 |
qed |
198 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
199 |
instance fps :: (comm_monoid_add) comm_monoid_add |
29687 | 200 |
proof |
201 |
fix a :: "'a fps" show "0 + a = a " |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
202 |
by (simp add: fps_ext) |
29687 | 203 |
qed |
204 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
205 |
instance fps :: (semiring_1) monoid_mult |
29687 | 206 |
proof |
207 |
fix a :: "'a fps" show "1 * a = a" |
|
29913 | 208 |
by (simp add: fps_ext fps_mult_nth mult_delta_left setsum_delta) |
29687 | 209 |
next |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
210 |
fix a :: "'a fps" show "a * 1 = a" |
29913 | 211 |
by (simp add: fps_ext fps_mult_nth mult_delta_right setsum_delta') |
29687 | 212 |
qed |
213 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
214 |
instance fps :: (cancel_semigroup_add) cancel_semigroup_add |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
215 |
proof |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
216 |
fix a b c :: "'a fps" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
217 |
assume "a + b = a + c" then show "b = c" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
218 |
by (simp add: expand_fps_eq) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
219 |
next |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
220 |
fix a b c :: "'a fps" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
221 |
assume "b + a = c + a" then show "b = c" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
222 |
by (simp add: expand_fps_eq) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
223 |
qed |
29687 | 224 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
225 |
instance fps :: (cancel_ab_semigroup_add) cancel_ab_semigroup_add |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
226 |
proof |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
227 |
fix a b c :: "'a fps" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
228 |
assume "a + b = a + c" then show "b = c" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
229 |
by (simp add: expand_fps_eq) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
230 |
qed |
29687 | 231 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
232 |
instance fps :: (cancel_comm_monoid_add) cancel_comm_monoid_add .. |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
233 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
234 |
instance fps :: (group_add) group_add |
29687 | 235 |
proof |
236 |
fix a :: "'a fps" show "- a + a = 0" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
237 |
by (simp add: fps_ext) |
29687 | 238 |
next |
239 |
fix a b :: "'a fps" show "a - b = a + - b" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
240 |
by (simp add: fps_ext diff_minus) |
29687 | 241 |
qed |
242 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
243 |
instance fps :: (ab_group_add) ab_group_add |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
244 |
proof |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
245 |
fix a :: "'a fps" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
246 |
show "- a + a = 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
247 |
by (simp add: fps_ext) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
248 |
next |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
249 |
fix a b :: "'a fps" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
250 |
show "a - b = a + - b" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
251 |
by (simp add: fps_ext) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
252 |
qed |
29687 | 253 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
254 |
instance fps :: (zero_neq_one) zero_neq_one |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
255 |
by default (simp add: expand_fps_eq) |
29687 | 256 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
257 |
instance fps :: (semiring_0) semiring |
29687 | 258 |
proof |
259 |
fix a b c :: "'a fps" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
260 |
show "(a + b) * c = a * c + b * c" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
261 |
by (simp add: expand_fps_eq fps_mult_nth left_distrib setsum_addf) |
29687 | 262 |
next |
263 |
fix a b c :: "'a fps" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
264 |
show "a * (b + c) = a * b + a * c" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
265 |
by (simp add: expand_fps_eq fps_mult_nth right_distrib setsum_addf) |
29687 | 266 |
qed |
267 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
268 |
instance fps :: (semiring_0) semiring_0 |
29687 | 269 |
proof |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
270 |
fix a:: "'a fps" show "0 * a = 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
271 |
by (simp add: fps_ext fps_mult_nth) |
29687 | 272 |
next |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
273 |
fix a:: "'a fps" show "a * 0 = 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
274 |
by (simp add: fps_ext fps_mult_nth) |
29687 | 275 |
qed |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
276 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
277 |
instance fps :: (semiring_0_cancel) semiring_0_cancel .. |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
278 |
|
29906 | 279 |
subsection {* Selection of the nth power of the implicit variable in the infinite sum*} |
29687 | 280 |
|
281 |
lemma fps_nonzero_nth: "f \<noteq> 0 \<longleftrightarrow> (\<exists> n. f $n \<noteq> 0)" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
282 |
by (simp add: expand_fps_eq) |
29687 | 283 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
284 |
lemma fps_nonzero_nth_minimal: |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
285 |
"f \<noteq> 0 \<longleftrightarrow> (\<exists>n. f $ n \<noteq> 0 \<and> (\<forall>m<n. f $ m = 0))" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
286 |
proof |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
287 |
let ?n = "LEAST n. f $ n \<noteq> 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
288 |
assume "f \<noteq> 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
289 |
then have "\<exists>n. f $ n \<noteq> 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
290 |
by (simp add: fps_nonzero_nth) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
291 |
then have "f $ ?n \<noteq> 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
292 |
by (rule LeastI_ex) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
293 |
moreover have "\<forall>m<?n. f $ m = 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
294 |
by (auto dest: not_less_Least) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
295 |
ultimately have "f $ ?n \<noteq> 0 \<and> (\<forall>m<?n. f $ m = 0)" .. |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
296 |
then show "\<exists>n. f $ n \<noteq> 0 \<and> (\<forall>m<n. f $ m = 0)" .. |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
297 |
next |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
298 |
assume "\<exists>n. f $ n \<noteq> 0 \<and> (\<forall>m<n. f $ m = 0)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
299 |
then show "f \<noteq> 0" by (auto simp add: expand_fps_eq) |
29687 | 300 |
qed |
301 |
||
302 |
lemma fps_eq_iff: "f = g \<longleftrightarrow> (\<forall>n. f $ n = g $n)" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
303 |
by (rule expand_fps_eq) |
29687 | 304 |
|
30488 | 305 |
lemma fps_setsum_nth: "(setsum f S) $ n = setsum (\<lambda>k. (f k) $ n) S" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
306 |
proof (cases "finite S") |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
307 |
assume "\<not> finite S" then show ?thesis by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
308 |
next |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
309 |
assume "finite S" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
310 |
then show ?thesis by (induct set: finite) auto |
29687 | 311 |
qed |
312 |
||
29906 | 313 |
subsection{* Injection of the basic ring elements and multiplication by scalars *} |
29687 | 314 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
315 |
definition |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
316 |
"fps_const c = Abs_fps (\<lambda>n. if n = 0 then c else 0)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
317 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
318 |
lemma fps_nth_fps_const [simp]: "fps_const c $ n = (if n = 0 then c else 0)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
319 |
unfolding fps_const_def by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
320 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
321 |
lemma fps_const_0_eq_0 [simp]: "fps_const 0 = 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
322 |
by (simp add: fps_ext) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
323 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
324 |
lemma fps_const_1_eq_1 [simp]: "fps_const 1 = 1" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
325 |
by (simp add: fps_ext) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
326 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
327 |
lemma fps_const_neg [simp]: "- (fps_const (c::'a::ring)) = fps_const (- c)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
328 |
by (simp add: fps_ext) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
329 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
330 |
lemma fps_const_add [simp]: "fps_const (c::'a\<Colon>monoid_add) + fps_const d = fps_const (c + d)" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
331 |
by (simp add: fps_ext) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
332 |
|
29687 | 333 |
lemma fps_const_mult[simp]: "fps_const (c::'a\<Colon>ring) * fps_const d = fps_const (c * d)" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
334 |
by (simp add: fps_eq_iff fps_mult_nth setsum_0') |
29687 | 335 |
|
336 |
lemma fps_const_add_left: "fps_const (c::'a\<Colon>monoid_add) + f = Abs_fps (\<lambda>n. if n = 0 then c + f$0 else f$n)" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
337 |
by (simp add: fps_ext) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
338 |
|
29687 | 339 |
lemma fps_const_add_right: "f + fps_const (c::'a\<Colon>monoid_add) = Abs_fps (\<lambda>n. if n = 0 then f$0 + c else f$n)" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
340 |
by (simp add: fps_ext) |
29687 | 341 |
|
342 |
lemma fps_const_mult_left: "fps_const (c::'a\<Colon>semiring_0) * f = Abs_fps (\<lambda>n. c * f$n)" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
343 |
unfolding fps_eq_iff fps_mult_nth |
29913 | 344 |
by (simp add: fps_const_def mult_delta_left setsum_delta) |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
345 |
|
29687 | 346 |
lemma fps_const_mult_right: "f * fps_const (c::'a\<Colon>semiring_0) = Abs_fps (\<lambda>n. f$n * c)" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
347 |
unfolding fps_eq_iff fps_mult_nth |
29913 | 348 |
by (simp add: fps_const_def mult_delta_right setsum_delta') |
29687 | 349 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
350 |
lemma fps_mult_left_const_nth [simp]: "(fps_const (c::'a::semiring_1) * f)$n = c* f$n" |
29913 | 351 |
by (simp add: fps_mult_nth mult_delta_left setsum_delta) |
29687 | 352 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
353 |
lemma fps_mult_right_const_nth [simp]: "(f * fps_const (c::'a::semiring_1))$n = f$n * c" |
29913 | 354 |
by (simp add: fps_mult_nth mult_delta_right setsum_delta') |
29687 | 355 |
|
29906 | 356 |
subsection {* Formal power series form an integral domain*} |
29687 | 357 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
358 |
instance fps :: (ring) ring .. |
29687 | 359 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
360 |
instance fps :: (ring_1) ring_1 |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
361 |
by (intro_classes, auto simp add: diff_minus left_distrib) |
29687 | 362 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
363 |
instance fps :: (comm_ring_1) comm_ring_1 |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
364 |
by (intro_classes, auto simp add: diff_minus left_distrib) |
29687 | 365 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
366 |
instance fps :: (ring_no_zero_divisors) ring_no_zero_divisors |
29687 | 367 |
proof |
368 |
fix a b :: "'a fps" |
|
369 |
assume a0: "a \<noteq> 0" and b0: "b \<noteq> 0" |
|
370 |
then obtain i j where i: "a$i\<noteq>0" "\<forall>k<i. a$k=0" |
|
371 |
and j: "b$j \<noteq>0" "\<forall>k<j. b$k =0" unfolding fps_nonzero_nth_minimal |
|
372 |
by blast+ |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
373 |
have "(a * b) $ (i+j) = (\<Sum>k=0..i+j. a$k * b$(i+j-k))" |
29687 | 374 |
by (rule fps_mult_nth) |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
375 |
also have "\<dots> = (a$i * b$(i+j-i)) + (\<Sum>k\<in>{0..i+j}-{i}. a$k * b$(i+j-k))" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
376 |
by (rule setsum_diff1') simp_all |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
377 |
also have "(\<Sum>k\<in>{0..i+j}-{i}. a$k * b$(i+j-k)) = 0" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
378 |
proof (rule setsum_0' [rule_format]) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
379 |
fix k assume "k \<in> {0..i+j} - {i}" |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
380 |
then have "k < i \<or> i+j-k < j" by auto |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
381 |
then show "a$k * b$(i+j-k) = 0" using i j by auto |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
382 |
qed |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
383 |
also have "a$i * b$(i+j-i) + 0 = a$i * b$j" by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
384 |
also have "a$i * b$j \<noteq> 0" using i j by simp |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
385 |
finally have "(a*b) $ (i+j) \<noteq> 0" . |
29687 | 386 |
then show "a*b \<noteq> 0" unfolding fps_nonzero_nth by blast |
387 |
qed |
|
388 |
||
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
389 |
instance fps :: (idom) idom .. |
29687 | 390 |
|
29906 | 391 |
subsection{* Inverses of formal power series *} |
29687 | 392 |
|
393 |
declare setsum_cong[fundef_cong] |
|
394 |
||
395 |
||
396 |
instantiation fps :: ("{comm_monoid_add,inverse, times, uminus}") inverse |
|
397 |
begin |
|
398 |
||
30488 | 399 |
fun natfun_inverse:: "'a fps \<Rightarrow> nat \<Rightarrow> 'a" where |
29687 | 400 |
"natfun_inverse f 0 = inverse (f$0)" |
30488 | 401 |
| "natfun_inverse f n = - inverse (f$0) * setsum (\<lambda>i. f$i * natfun_inverse f (n - i)) {1..n}" |
29687 | 402 |
|
30488 | 403 |
definition fps_inverse_def: |
29687 | 404 |
"inverse f = (if f$0 = 0 then 0 else Abs_fps (natfun_inverse f))" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
405 |
definition fps_divide_def: "divide = (\<lambda>(f::'a fps) g. f * inverse g)" |
29687 | 406 |
instance .. |
407 |
end |
|
408 |
||
30488 | 409 |
lemma fps_inverse_zero[simp]: |
29687 | 410 |
"inverse (0 :: 'a::{comm_monoid_add,inverse, times, uminus} fps) = 0" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
411 |
by (simp add: fps_ext fps_inverse_def) |
29687 | 412 |
|
413 |
lemma fps_inverse_one[simp]: "inverse (1 :: 'a::{division_ring,zero_neq_one} fps) = 1" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
414 |
apply (auto simp add: expand_fps_eq fps_inverse_def) |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
415 |
by (case_tac n, auto) |
29687 | 416 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
417 |
instance fps :: ("{comm_monoid_add,inverse, times, uminus}") division_by_zero |
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
418 |
by default (rule fps_inverse_zero) |
29687 | 419 |
|
420 |
lemma inverse_mult_eq_1[intro]: assumes f0: "f$0 \<noteq> (0::'a::field)" |
|
421 |
shows "inverse f * f = 1" |
|
422 |
proof- |
|
423 |
have c: "inverse f * f = f * inverse f" by (simp add: mult_commute) |
|
30488 | 424 |
from f0 have ifn: "\<And>n. inverse f $ n = natfun_inverse f n" |
29687 | 425 |
by (simp add: fps_inverse_def) |
426 |
from f0 have th0: "(inverse f * f) $ 0 = 1" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
427 |
by (simp add: fps_mult_nth fps_inverse_def) |
29687 | 428 |
{fix n::nat assume np: "n >0 " |
429 |
from np have eq: "{0..n} = {0} \<union> {1 .. n}" by auto |
|
430 |
have d: "{0} \<inter> {1 .. n} = {}" by auto |
|
431 |
have f: "finite {0::nat}" "finite {1..n}" by auto |
|
30488 | 432 |
from f0 np have th0: "- (inverse f$n) = |
29687 | 433 |
(setsum (\<lambda>i. f$i * natfun_inverse f (n - i)) {1..n}) / (f$0)" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
434 |
by (cases n, simp, simp add: divide_inverse fps_inverse_def) |
29687 | 435 |
from th0[symmetric, unfolded nonzero_divide_eq_eq[OF f0]] |
30488 | 436 |
have th1: "setsum (\<lambda>i. f$i * natfun_inverse f (n - i)) {1..n} = |
437 |
- (f$0) * (inverse f)$n" |
|
29687 | 438 |
by (simp add: ring_simps) |
30488 | 439 |
have "(f * inverse f) $ n = (\<Sum>i = 0..n. f $i * natfun_inverse f (n - i))" |
29687 | 440 |
unfolding fps_mult_nth ifn .. |
30488 | 441 |
also have "\<dots> = f$0 * natfun_inverse f n |
29687 | 442 |
+ (\<Sum>i = 1..n. f$i * natfun_inverse f (n-i))" |
443 |
unfolding setsum_Un_disjoint[OF f d, unfolded eq[symmetric]] |
|
444 |
by simp |
|
445 |
also have "\<dots> = 0" unfolding th1 ifn by simp |
|
446 |
finally have "(inverse f * f)$n = 0" unfolding c . } |
|
447 |
with th0 show ?thesis by (simp add: fps_eq_iff) |
|
448 |
qed |
|
449 |
||
450 |
lemma fps_inverse_0_iff[simp]: "(inverse f)$0 = (0::'a::division_ring) \<longleftrightarrow> f$0 = 0" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
451 |
by (simp add: fps_inverse_def nonzero_imp_inverse_nonzero) |
29687 | 452 |
|
453 |
lemma fps_inverse_eq_0_iff[simp]: "inverse f = (0:: ('a::field) fps) \<longleftrightarrow> f $0 = 0" |
|
454 |
proof- |
|
455 |
{assume "f$0 = 0" hence "inverse f = 0" by (simp add: fps_inverse_def)} |
|
456 |
moreover |
|
457 |
{assume h: "inverse f = 0" and c: "f $0 \<noteq> 0" |
|
458 |
from inverse_mult_eq_1[OF c] h have False by simp} |
|
459 |
ultimately show ?thesis by blast |
|
460 |
qed |
|
461 |
||
462 |
lemma fps_inverse_idempotent[intro]: assumes f0: "f$0 \<noteq> (0::'a::field)" |
|
463 |
shows "inverse (inverse f) = f" |
|
464 |
proof- |
|
465 |
from f0 have if0: "inverse f $ 0 \<noteq> 0" by simp |
|
30488 | 466 |
from inverse_mult_eq_1[OF f0] inverse_mult_eq_1[OF if0] |
29687 | 467 |
have th0: "inverse f * f = inverse f * inverse (inverse f)" by (simp add: mult_ac) |
468 |
then show ?thesis using f0 unfolding mult_cancel_left by simp |
|
469 |
qed |
|
470 |
||
30488 | 471 |
lemma fps_inverse_unique: assumes f0: "f$0 \<noteq> (0::'a::field)" and fg: "f*g = 1" |
29687 | 472 |
shows "inverse f = g" |
473 |
proof- |
|
474 |
from inverse_mult_eq_1[OF f0] fg |
|
475 |
have th0: "inverse f * f = g * f" by (simp add: mult_ac) |
|
476 |
then show ?thesis using f0 unfolding mult_cancel_right |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
477 |
by (auto simp add: expand_fps_eq) |
29687 | 478 |
qed |
479 |
||
30488 | 480 |
lemma fps_inverse_gp: "inverse (Abs_fps(\<lambda>n. (1::'a::field))) |
29687 | 481 |
= Abs_fps (\<lambda>n. if n= 0 then 1 else if n=1 then - 1 else 0)" |
482 |
apply (rule fps_inverse_unique) |
|
483 |
apply simp |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
484 |
apply (simp add: fps_eq_iff fps_mult_nth) |
29687 | 485 |
proof(clarsimp) |
486 |
fix n::nat assume n: "n > 0" |
|
487 |
let ?f = "\<lambda>i. if n = i then (1\<Colon>'a) else if n - i = 1 then - 1 else 0" |
|
488 |
let ?g = "\<lambda>i. if i = n then 1 else if i=n - 1 then - 1 else 0" |
|
489 |
let ?h = "\<lambda>i. if i=n - 1 then - 1 else 0" |
|
30488 | 490 |
have th1: "setsum ?f {0..n} = setsum ?g {0..n}" |
29687 | 491 |
by (rule setsum_cong2) auto |
30488 | 492 |
have th2: "setsum ?g {0..n - 1} = setsum ?h {0..n - 1}" |
29687 | 493 |
using n apply - by (rule setsum_cong2) auto |
494 |
have eq: "{0 .. n} = {0.. n - 1} \<union> {n}" by auto |
|
30488 | 495 |
from n have d: "{0.. n - 1} \<inter> {n} = {}" by auto |
29687 | 496 |
have f: "finite {0.. n - 1}" "finite {n}" by auto |
497 |
show "setsum ?f {0..n} = 0" |
|
30488 | 498 |
unfolding th1 |
29687 | 499 |
apply (simp add: setsum_Un_disjoint[OF f d, unfolded eq[symmetric]] del: One_nat_def) |
500 |
unfolding th2 |
|
501 |
by(simp add: setsum_delta) |
|
502 |
qed |
|
503 |
||
29912 | 504 |
subsection{* Formal Derivatives, and the MacLaurin theorem around 0*} |
29687 | 505 |
|
506 |
definition "fps_deriv f = Abs_fps (\<lambda>n. of_nat (n + 1) * f $ (n + 1))" |
|
507 |
||
508 |
lemma fps_deriv_nth[simp]: "fps_deriv f $ n = of_nat (n +1) * f $ (n+1)" by (simp add: fps_deriv_def) |
|
509 |
||
510 |
lemma fps_deriv_linear[simp]: "fps_deriv (fps_const (a::'a::comm_semiring_1) * f + fps_const b * g) = fps_const a * fps_deriv f + fps_const b * fps_deriv g" |
|
511 |
unfolding fps_eq_iff fps_add_nth fps_const_mult_left fps_deriv_nth by (simp add: ring_simps) |
|
512 |
||
30488 | 513 |
lemma fps_deriv_mult[simp]: |
29687 | 514 |
fixes f :: "('a :: comm_ring_1) fps" |
515 |
shows "fps_deriv (f * g) = f * fps_deriv g + fps_deriv f * g" |
|
516 |
proof- |
|
517 |
let ?D = "fps_deriv" |
|
518 |
{fix n::nat |
|
519 |
let ?Zn = "{0 ..n}" |
|
520 |
let ?Zn1 = "{0 .. n + 1}" |
|
521 |
let ?f = "\<lambda>i. i + 1" |
|
522 |
have fi: "inj_on ?f {0..n}" by (simp add: inj_on_def) |
|
523 |
have eq: "{1.. n+1} = ?f ` {0..n}" by auto |
|
524 |
let ?g = "\<lambda>i. of_nat (i+1) * g $ (i+1) * f $ (n - i) + |
|
525 |
of_nat (i+1)* f $ (i+1) * g $ (n - i)" |
|
526 |
let ?h = "\<lambda>i. of_nat i * g $ i * f $ ((n+1) - i) + |
|
527 |
of_nat i* f $ i * g $ ((n + 1) - i)" |
|
528 |
{fix k assume k: "k \<in> {0..n}" |
|
529 |
have "?h (k + 1) = ?g k" using k by auto} |
|
530 |
note th0 = this |
|
531 |
have eq': "{0..n +1}- {1 .. n+1} = {0}" by auto |
|
532 |
have s0: "setsum (\<lambda>i. of_nat i * f $ i * g $ (n + 1 - i)) ?Zn1 = setsum (\<lambda>i. of_nat (n + 1 - i) * f $ (n + 1 - i) * g $ i) ?Zn1" |
|
533 |
apply (rule setsum_reindex_cong[where f="\<lambda>i. n + 1 - i"]) |
|
534 |
apply (simp add: inj_on_def Ball_def) |
|
535 |
apply presburger |
|
536 |
apply (rule set_ext) |
|
537 |
apply (presburger add: image_iff) |
|
538 |
by simp |
|
539 |
have s1: "setsum (\<lambda>i. f $ i * g $ (n + 1 - i)) ?Zn1 = setsum (\<lambda>i. f $ (n + 1 - i) * g $ i) ?Zn1" |
|
540 |
apply (rule setsum_reindex_cong[where f="\<lambda>i. n + 1 - i"]) |
|
541 |
apply (simp add: inj_on_def Ball_def) |
|
542 |
apply presburger |
|
543 |
apply (rule set_ext) |
|
544 |
apply (presburger add: image_iff) |
|
545 |
by simp |
|
546 |
have "(f * ?D g + ?D f * g)$n = (?D g * f + ?D f * g)$n" by (simp only: mult_commute) |
|
547 |
also have "\<dots> = (\<Sum>i = 0..n. ?g i)" |
|
548 |
by (simp add: fps_mult_nth setsum_addf[symmetric]) |
|
549 |
also have "\<dots> = setsum ?h {1..n+1}" |
|
550 |
using th0 setsum_reindex_cong[OF fi eq, of "?g" "?h"] by auto |
|
551 |
also have "\<dots> = setsum ?h {0..n+1}" |
|
552 |
apply (rule setsum_mono_zero_left) |
|
553 |
apply simp |
|
554 |
apply (simp add: subset_eq) |
|
555 |
unfolding eq' |
|
556 |
by simp |
|
557 |
also have "\<dots> = (fps_deriv (f * g)) $ n" |
|
558 |
apply (simp only: fps_deriv_nth fps_mult_nth setsum_addf) |
|
559 |
unfolding s0 s1 |
|
560 |
unfolding setsum_addf[symmetric] setsum_right_distrib |
|
561 |
apply (rule setsum_cong2) |
|
562 |
by (auto simp add: of_nat_diff ring_simps) |
|
563 |
finally have "(f * ?D g + ?D f * g) $ n = ?D (f*g) $ n" .} |
|
30488 | 564 |
then show ?thesis unfolding fps_eq_iff by auto |
29687 | 565 |
qed |
566 |
||
567 |
lemma fps_deriv_neg[simp]: "fps_deriv (- (f:: ('a:: comm_ring_1) fps)) = - (fps_deriv f)" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
568 |
by (simp add: fps_eq_iff fps_deriv_def) |
29687 | 569 |
lemma fps_deriv_add[simp]: "fps_deriv ((f:: ('a::comm_ring_1) fps) + g) = fps_deriv f + fps_deriv g" |
570 |
using fps_deriv_linear[of 1 f 1 g] by simp |
|
571 |
||
572 |
lemma fps_deriv_sub[simp]: "fps_deriv ((f:: ('a::comm_ring_1) fps) - g) = fps_deriv f - fps_deriv g" |
|
30488 | 573 |
unfolding diff_minus by simp |
29687 | 574 |
|
575 |
lemma fps_deriv_const[simp]: "fps_deriv (fps_const c) = 0" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
576 |
by (simp add: fps_ext fps_deriv_def fps_const_def) |
29687 | 577 |
|
578 |
lemma fps_deriv_mult_const_left[simp]: "fps_deriv (fps_const (c::'a::comm_ring_1) * f) = fps_const c * fps_deriv f" |
|
579 |
by simp |
|
580 |
||
581 |
lemma fps_deriv_0[simp]: "fps_deriv 0 = 0" |
|
582 |
by (simp add: fps_deriv_def fps_eq_iff) |
|
583 |
||
584 |
lemma fps_deriv_1[simp]: "fps_deriv 1 = 0" |
|
585 |
by (simp add: fps_deriv_def fps_eq_iff ) |
|
586 |
||
587 |
lemma fps_deriv_mult_const_right[simp]: "fps_deriv (f * fps_const (c::'a::comm_ring_1)) = fps_deriv f * fps_const c" |
|
588 |
by simp |
|
589 |
||
590 |
lemma fps_deriv_setsum: "fps_deriv (setsum f S) = setsum (\<lambda>i. fps_deriv (f i :: ('a::comm_ring_1) fps)) S" |
|
591 |
proof- |
|
592 |
{assume "\<not> finite S" hence ?thesis by simp} |
|
593 |
moreover |
|
594 |
{assume fS: "finite S" |
|
595 |
have ?thesis by (induct rule: finite_induct[OF fS], simp_all)} |
|
596 |
ultimately show ?thesis by blast |
|
597 |
qed |
|
598 |
||
599 |
lemma fps_deriv_eq_0_iff[simp]: "fps_deriv f = 0 \<longleftrightarrow> (f = fps_const (f$0 :: 'a::{idom,semiring_char_0}))" |
|
600 |
proof- |
|
601 |
{assume "f= fps_const (f$0)" hence "fps_deriv f = fps_deriv (fps_const (f$0))" by simp |
|
602 |
hence "fps_deriv f = 0" by simp } |
|
603 |
moreover |
|
604 |
{assume z: "fps_deriv f = 0" |
|
605 |
hence "\<forall>n. (fps_deriv f)$n = 0" by simp |
|
606 |
hence "\<forall>n. f$(n+1) = 0" by (simp del: of_nat_Suc of_nat_add One_nat_def) |
|
607 |
hence "f = fps_const (f$0)" |
|
608 |
apply (clarsimp simp add: fps_eq_iff fps_const_def) |
|
609 |
apply (erule_tac x="n - 1" in allE) |
|
610 |
by simp} |
|
611 |
ultimately show ?thesis by blast |
|
612 |
qed |
|
613 |
||
30488 | 614 |
lemma fps_deriv_eq_iff: |
29687 | 615 |
fixes f:: "('a::{idom,semiring_char_0}) fps" |
616 |
shows "fps_deriv f = fps_deriv g \<longleftrightarrow> (f = fps_const(f$0 - g$0) + g)" |
|
617 |
proof- |
|
618 |
have "fps_deriv f = fps_deriv g \<longleftrightarrow> fps_deriv (f - g) = 0" by simp |
|
619 |
also have "\<dots> \<longleftrightarrow> f - g = fps_const ((f-g)$0)" unfolding fps_deriv_eq_0_iff .. |
|
620 |
finally show ?thesis by (simp add: ring_simps) |
|
621 |
qed |
|
622 |
||
623 |
lemma fps_deriv_eq_iff_ex: "(fps_deriv f = fps_deriv g) \<longleftrightarrow> (\<exists>(c::'a::{idom,semiring_char_0}). f = fps_const c + g)" |
|
624 |
apply auto unfolding fps_deriv_eq_iff by blast |
|
30488 | 625 |
|
29687 | 626 |
|
627 |
fun fps_nth_deriv :: "nat \<Rightarrow> ('a::semiring_1) fps \<Rightarrow> 'a fps" where |
|
628 |
"fps_nth_deriv 0 f = f" |
|
629 |
| "fps_nth_deriv (Suc n) f = fps_nth_deriv n (fps_deriv f)" |
|
630 |
||
631 |
lemma fps_nth_deriv_commute: "fps_nth_deriv (Suc n) f = fps_deriv (fps_nth_deriv n f)" |
|
632 |
by (induct n arbitrary: f, auto) |
|
633 |
||
634 |
lemma fps_nth_deriv_linear[simp]: "fps_nth_deriv n (fps_const (a::'a::comm_semiring_1) * f + fps_const b * g) = fps_const a * fps_nth_deriv n f + fps_const b * fps_nth_deriv n g" |
|
635 |
by (induct n arbitrary: f g, auto simp add: fps_nth_deriv_commute) |
|
636 |
||
637 |
lemma fps_nth_deriv_neg[simp]: "fps_nth_deriv n (- (f:: ('a:: comm_ring_1) fps)) = - (fps_nth_deriv n f)" |
|
638 |
by (induct n arbitrary: f, simp_all) |
|
639 |
||
640 |
lemma fps_nth_deriv_add[simp]: "fps_nth_deriv n ((f:: ('a::comm_ring_1) fps) + g) = fps_nth_deriv n f + fps_nth_deriv n g" |
|
641 |
using fps_nth_deriv_linear[of n 1 f 1 g] by simp |
|
642 |
||
643 |
lemma fps_nth_deriv_sub[simp]: "fps_nth_deriv n ((f:: ('a::comm_ring_1) fps) - g) = fps_nth_deriv n f - fps_nth_deriv n g" |
|
30488 | 644 |
unfolding diff_minus fps_nth_deriv_add by simp |
29687 | 645 |
|
646 |
lemma fps_nth_deriv_0[simp]: "fps_nth_deriv n 0 = 0" |
|
647 |
by (induct n, simp_all ) |
|
648 |
||
649 |
lemma fps_nth_deriv_1[simp]: "fps_nth_deriv n 1 = (if n = 0 then 1 else 0)" |
|
650 |
by (induct n, simp_all ) |
|
651 |
||
652 |
lemma fps_nth_deriv_const[simp]: "fps_nth_deriv n (fps_const c) = (if n = 0 then fps_const c else 0)" |
|
653 |
by (cases n, simp_all) |
|
654 |
||
655 |
lemma fps_nth_deriv_mult_const_left[simp]: "fps_nth_deriv n (fps_const (c::'a::comm_ring_1) * f) = fps_const c * fps_nth_deriv n f" |
|
656 |
using fps_nth_deriv_linear[of n "c" f 0 0 ] by simp |
|
657 |
||
658 |
lemma fps_nth_deriv_mult_const_right[simp]: "fps_nth_deriv n (f * fps_const (c::'a::comm_ring_1)) = fps_nth_deriv n f * fps_const c" |
|
659 |
using fps_nth_deriv_linear[of n "c" f 0 0] by (simp add: mult_commute) |
|
660 |
||
661 |
lemma fps_nth_deriv_setsum: "fps_nth_deriv n (setsum f S) = setsum (\<lambda>i. fps_nth_deriv n (f i :: ('a::comm_ring_1) fps)) S" |
|
662 |
proof- |
|
663 |
{assume "\<not> finite S" hence ?thesis by simp} |
|
664 |
moreover |
|
665 |
{assume fS: "finite S" |
|
666 |
have ?thesis by (induct rule: finite_induct[OF fS], simp_all)} |
|
667 |
ultimately show ?thesis by blast |
|
668 |
qed |
|
669 |
||
670 |
lemma fps_deriv_maclauren_0: "(fps_nth_deriv k (f:: ('a::comm_semiring_1) fps)) $ 0 = of_nat (fact k) * f$(k)" |
|
671 |
by (induct k arbitrary: f) (auto simp add: ring_simps of_nat_mult) |
|
672 |
||
29906 | 673 |
subsection {* Powers*} |
29687 | 674 |
|
675 |
instantiation fps :: (semiring_1) power |
|
676 |
begin |
|
677 |
||
678 |
fun fps_pow :: "nat \<Rightarrow> 'a fps \<Rightarrow> 'a fps" where |
|
679 |
"fps_pow 0 f = 1" |
|
680 |
| "fps_pow (Suc n) f = f * fps_pow n f" |
|
681 |
||
682 |
definition fps_power_def: "power (f::'a fps) n = fps_pow n f" |
|
683 |
instance .. |
|
684 |
end |
|
685 |
||
686 |
instantiation fps :: (comm_ring_1) recpower |
|
687 |
begin |
|
688 |
instance |
|
689 |
apply (intro_classes) |
|
690 |
by (simp_all add: fps_power_def) |
|
691 |
end |
|
692 |
||
693 |
lemma fps_power_zeroth_eq_one: "a$0 =1 \<Longrightarrow> a^n $ 0 = (1::'a::semiring_1)" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
694 |
by (induct n, auto simp add: fps_power_def expand_fps_eq fps_mult_nth) |
29687 | 695 |
|
696 |
lemma fps_power_first_eq: "(a:: 'a::comm_ring_1 fps)$0 =1 \<Longrightarrow> a^n $ 1 = of_nat n * a$1" |
|
697 |
proof(induct n) |
|
698 |
case 0 thus ?case by (simp add: fps_power_def) |
|
699 |
next |
|
700 |
case (Suc n) |
|
701 |
note h = Suc.hyps[OF `a$0 = 1`] |
|
30488 | 702 |
show ?case unfolding power_Suc fps_mult_nth |
29687 | 703 |
using h `a$0 = 1` fps_power_zeroth_eq_one[OF `a$0=1`] by (simp add: ring_simps) |
704 |
qed |
|
705 |
||
706 |
lemma startsby_one_power:"a $ 0 = (1::'a::comm_ring_1) \<Longrightarrow> a^n $ 0 = 1" |
|
707 |
by (induct n, auto simp add: fps_power_def fps_mult_nth) |
|
708 |
||
709 |
lemma startsby_zero_power:"a $0 = (0::'a::comm_ring_1) \<Longrightarrow> n > 0 \<Longrightarrow> a^n $0 = 0" |
|
710 |
by (induct n, auto simp add: fps_power_def fps_mult_nth) |
|
711 |
||
712 |
lemma startsby_power:"a $0 = (v::'a::{comm_ring_1, recpower}) \<Longrightarrow> a^n $0 = v^n" |
|
713 |
by (induct n, auto simp add: fps_power_def fps_mult_nth power_Suc) |
|
714 |
||
715 |
lemma startsby_zero_power_iff[simp]: |
|
716 |
"a^n $0 = (0::'a::{idom, recpower}) \<longleftrightarrow> (n \<noteq> 0 \<and> a$0 = 0)" |
|
717 |
apply (rule iffI) |
|
718 |
apply (induct n, auto simp add: power_Suc fps_mult_nth) |
|
719 |
by (rule startsby_zero_power, simp_all) |
|
720 |
||
30488 | 721 |
lemma startsby_zero_power_prefix: |
29687 | 722 |
assumes a0: "a $0 = (0::'a::idom)" |
723 |
shows "\<forall>n < k. a ^ k $ n = 0" |
|
30488 | 724 |
using a0 |
29687 | 725 |
proof(induct k rule: nat_less_induct) |
726 |
fix k assume H: "\<forall>m<k. a $0 = 0 \<longrightarrow> (\<forall>n<m. a ^ m $ n = 0)" and a0: "a $0 = (0\<Colon>'a)" |
|
727 |
let ?ths = "\<forall>m<k. a ^ k $ m = 0" |
|
728 |
{assume "k = 0" then have ?ths by simp} |
|
729 |
moreover |
|
730 |
{fix l assume k: "k = Suc l" |
|
731 |
{fix m assume mk: "m < k" |
|
30488 | 732 |
{assume "m=0" hence "a^k $ m = 0" using startsby_zero_power[of a k] k a0 |
29687 | 733 |
by simp} |
734 |
moreover |
|
735 |
{assume m0: "m \<noteq> 0" |
|
736 |
have "a ^k $ m = (a^l * a) $m" by (simp add: k power_Suc mult_commute) |
|
737 |
also have "\<dots> = (\<Sum>i = 0..m. a ^ l $ i * a $ (m - i))" by (simp add: fps_mult_nth) |
|
738 |
also have "\<dots> = 0" apply (rule setsum_0') |
|
739 |
apply auto |
|
740 |
apply (case_tac "aa = m") |
|
741 |
using a0 |
|
742 |
apply simp |
|
743 |
apply (rule H[rule_format]) |
|
30488 | 744 |
using a0 k mk by auto |
29687 | 745 |
finally have "a^k $ m = 0" .} |
746 |
ultimately have "a^k $ m = 0" by blast} |
|
747 |
hence ?ths by blast} |
|
748 |
ultimately show ?ths by (cases k, auto) |
|
749 |
qed |
|
750 |
||
30488 | 751 |
lemma startsby_zero_setsum_depends: |
29687 | 752 |
assumes a0: "a $0 = (0::'a::idom)" and kn: "n \<ge> k" |
753 |
shows "setsum (\<lambda>i. (a ^ i)$k) {0 .. n} = setsum (\<lambda>i. (a ^ i)$k) {0 .. k}" |
|
754 |
apply (rule setsum_mono_zero_right) |
|
755 |
using kn apply auto |
|
756 |
apply (rule startsby_zero_power_prefix[rule_format, OF a0]) |
|
757 |
by arith |
|
758 |
||
759 |
lemma startsby_zero_power_nth_same: assumes a0: "a$0 = (0::'a::{recpower, idom})" |
|
760 |
shows "a^n $ n = (a$1) ^ n" |
|
761 |
proof(induct n) |
|
762 |
case 0 thus ?case by (simp add: power_0) |
|
763 |
next |
|
764 |
case (Suc n) |
|
765 |
have "a ^ Suc n $ (Suc n) = (a^n * a)$(Suc n)" by (simp add: ring_simps power_Suc) |
|
766 |
also have "\<dots> = setsum (\<lambda>i. a^n$i * a $ (Suc n - i)) {0.. Suc n}" by (simp add: fps_mult_nth) |
|
767 |
also have "\<dots> = setsum (\<lambda>i. a^n$i * a $ (Suc n - i)) {n .. Suc n}" |
|
768 |
apply (rule setsum_mono_zero_right) |
|
769 |
apply simp |
|
770 |
apply clarsimp |
|
771 |
apply clarsimp |
|
772 |
apply (rule startsby_zero_power_prefix[rule_format, OF a0]) |
|
773 |
apply arith |
|
774 |
done |
|
775 |
also have "\<dots> = a^n $ n * a$1" using a0 by simp |
|
776 |
finally show ?case using Suc.hyps by (simp add: power_Suc) |
|
777 |
qed |
|
778 |
||
779 |
lemma fps_inverse_power: |
|
780 |
fixes a :: "('a::{field, recpower}) fps" |
|
781 |
shows "inverse (a^n) = inverse a ^ n" |
|
782 |
proof- |
|
783 |
{assume a0: "a$0 = 0" |
|
784 |
hence eq: "inverse a = 0" by (simp add: fps_inverse_def) |
|
785 |
{assume "n = 0" hence ?thesis by simp} |
|
786 |
moreover |
|
787 |
{assume n: "n > 0" |
|
30488 | 788 |
from startsby_zero_power[OF a0 n] eq a0 n have ?thesis |
29687 | 789 |
by (simp add: fps_inverse_def)} |
790 |
ultimately have ?thesis by blast} |
|
791 |
moreover |
|
792 |
{assume a0: "a$0 \<noteq> 0" |
|
793 |
have ?thesis |
|
794 |
apply (rule fps_inverse_unique) |
|
795 |
apply (simp add: a0) |
|
796 |
unfolding power_mult_distrib[symmetric] |
|
797 |
apply (rule ssubst[where t = "a * inverse a" and s= 1]) |
|
798 |
apply simp_all |
|
799 |
apply (subst mult_commute) |
|
800 |
by (rule inverse_mult_eq_1[OF a0])} |
|
801 |
ultimately show ?thesis by blast |
|
802 |
qed |
|
803 |
||
804 |
lemma fps_deriv_power: "fps_deriv (a ^ n) = fps_const (of_nat n :: 'a:: comm_ring_1) * fps_deriv a * a ^ (n - 1)" |
|
805 |
apply (induct n, auto simp add: power_Suc ring_simps fps_const_add[symmetric] simp del: fps_const_add) |
|
806 |
by (case_tac n, auto simp add: power_Suc ring_simps) |
|
807 |
||
30488 | 808 |
lemma fps_inverse_deriv: |
29687 | 809 |
fixes a:: "('a :: field) fps" |
810 |
assumes a0: "a$0 \<noteq> 0" |
|
811 |
shows "fps_deriv (inverse a) = - fps_deriv a * inverse a ^ 2" |
|
812 |
proof- |
|
813 |
from inverse_mult_eq_1[OF a0] |
|
814 |
have "fps_deriv (inverse a * a) = 0" by simp |
|
815 |
hence "inverse a * fps_deriv a + fps_deriv (inverse a) * a = 0" by simp |
|
816 |
hence "inverse a * (inverse a * fps_deriv a + fps_deriv (inverse a) * a) = 0" by simp |
|
817 |
with inverse_mult_eq_1[OF a0] |
|
818 |
have "inverse a ^ 2 * fps_deriv a + fps_deriv (inverse a) = 0" |
|
819 |
unfolding power2_eq_square |
|
820 |
apply (simp add: ring_simps) |
|
821 |
by (simp add: mult_assoc[symmetric]) |
|
822 |
hence "inverse a ^ 2 * fps_deriv a + fps_deriv (inverse a) - fps_deriv a * inverse a ^ 2 = 0 - fps_deriv a * inverse a ^ 2" |
|
823 |
by simp |
|
824 |
then show "fps_deriv (inverse a) = - fps_deriv a * inverse a ^ 2" by (simp add: ring_simps) |
|
825 |
qed |
|
826 |
||
30488 | 827 |
lemma fps_inverse_mult: |
29687 | 828 |
fixes a::"('a :: field) fps" |
829 |
shows "inverse (a * b) = inverse a * inverse b" |
|
830 |
proof- |
|
831 |
{assume a0: "a$0 = 0" hence ab0: "(a*b)$0 = 0" by (simp add: fps_mult_nth) |
|
832 |
from a0 ab0 have th: "inverse a = 0" "inverse (a*b) = 0" by simp_all |
|
833 |
have ?thesis unfolding th by simp} |
|
834 |
moreover |
|
835 |
{assume b0: "b$0 = 0" hence ab0: "(a*b)$0 = 0" by (simp add: fps_mult_nth) |
|
836 |
from b0 ab0 have th: "inverse b = 0" "inverse (a*b) = 0" by simp_all |
|
837 |
have ?thesis unfolding th by simp} |
|
838 |
moreover |
|
839 |
{assume a0: "a$0 \<noteq> 0" and b0: "b$0 \<noteq> 0" |
|
840 |
from a0 b0 have ab0:"(a*b) $ 0 \<noteq> 0" by (simp add: fps_mult_nth) |
|
30488 | 841 |
from inverse_mult_eq_1[OF ab0] |
29687 | 842 |
have "inverse (a*b) * (a*b) * inverse a * inverse b = 1 * inverse a * inverse b" by simp |
843 |
then have "inverse (a*b) * (inverse a * a) * (inverse b * b) = inverse a * inverse b" |
|
844 |
by (simp add: ring_simps) |
|
845 |
then have ?thesis using inverse_mult_eq_1[OF a0] inverse_mult_eq_1[OF b0] by simp} |
|
846 |
ultimately show ?thesis by blast |
|
847 |
qed |
|
848 |
||
30488 | 849 |
lemma fps_inverse_deriv': |
29687 | 850 |
fixes a:: "('a :: field) fps" |
851 |
assumes a0: "a$0 \<noteq> 0" |
|
852 |
shows "fps_deriv (inverse a) = - fps_deriv a / a ^ 2" |
|
853 |
using fps_inverse_deriv[OF a0] |
|
854 |
unfolding power2_eq_square fps_divide_def |
|
855 |
fps_inverse_mult by simp |
|
856 |
||
857 |
lemma inverse_mult_eq_1': assumes f0: "f$0 \<noteq> (0::'a::field)" |
|
858 |
shows "f * inverse f= 1" |
|
859 |
by (metis mult_commute inverse_mult_eq_1 f0) |
|
860 |
||
861 |
lemma fps_divide_deriv: fixes a:: "('a :: field) fps" |
|
862 |
assumes a0: "b$0 \<noteq> 0" |
|
863 |
shows "fps_deriv (a / b) = (fps_deriv a * b - a * fps_deriv b) / b ^ 2" |
|
864 |
using fps_inverse_deriv[OF a0] |
|
865 |
by (simp add: fps_divide_def ring_simps power2_eq_square fps_inverse_mult inverse_mult_eq_1'[OF a0]) |
|
30488 | 866 |
|
29906 | 867 |
subsection{* The eXtractor series X*} |
29687 | 868 |
|
869 |
lemma minus_one_power_iff: "(- (1::'a :: {recpower, comm_ring_1})) ^ n = (if even n then 1 else - 1)" |
|
870 |
by (induct n, auto) |
|
871 |
||
872 |
definition "X = Abs_fps (\<lambda>n. if n = 1 then 1 else 0)" |
|
873 |
||
30488 | 874 |
lemma fps_inverse_gp': "inverse (Abs_fps(\<lambda>n. (1::'a::field))) |
29687 | 875 |
= 1 - X" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
876 |
by (simp add: fps_inverse_gp fps_eq_iff X_def) |
29687 | 877 |
|
878 |
lemma X_mult_nth[simp]: "(X * (f :: ('a::semiring_1) fps)) $n = (if n = 0 then 0 else f $ (n - 1))" |
|
879 |
proof- |
|
880 |
{assume n: "n \<noteq> 0" |
|
881 |
have fN: "finite {0 .. n}" by simp |
|
882 |
have "(X * f) $n = (\<Sum>i = 0..n. X $ i * f $ (n - i))" by (simp add: fps_mult_nth) |
|
29913 | 883 |
also have "\<dots> = f $ (n - 1)" |
884 |
using n by (simp add: X_def mult_delta_left setsum_delta [OF fN]) |
|
29687 | 885 |
finally have ?thesis using n by simp } |
886 |
moreover |
|
887 |
{assume n: "n=0" hence ?thesis by (simp add: fps_mult_nth X_def)} |
|
888 |
ultimately show ?thesis by blast |
|
889 |
qed |
|
890 |
||
891 |
lemma X_mult_right_nth[simp]: "((f :: ('a::comm_semiring_1) fps) * X) $n = (if n = 0 then 0 else f $ (n - 1))" |
|
892 |
by (metis X_mult_nth mult_commute) |
|
893 |
||
894 |
lemma X_power_iff: "X^k = Abs_fps (\<lambda>n. if n = k then (1::'a::comm_ring_1) else 0)" |
|
895 |
proof(induct k) |
|
896 |
case 0 thus ?case by (simp add: X_def fps_power_def fps_eq_iff) |
|
897 |
next |
|
898 |
case (Suc k) |
|
30488 | 899 |
{fix m |
29687 | 900 |
have "(X^Suc k) $ m = (if m = 0 then (0::'a) else (X^k) $ (m - 1))" |
901 |
by (simp add: power_Suc del: One_nat_def) |
|
902 |
then have "(X^Suc k) $ m = (if m = Suc k then (1::'a) else 0)" |
|
903 |
using Suc.hyps by (auto cong del: if_weak_cong)} |
|
904 |
then show ?case by (simp add: fps_eq_iff) |
|
905 |
qed |
|
906 |
||
907 |
lemma X_power_mult_nth: "(X^k * (f :: ('a::comm_ring_1) fps)) $n = (if n < k then 0 else f $ (n - k))" |
|
908 |
apply (induct k arbitrary: n) |
|
909 |
apply (simp) |
|
30488 | 910 |
unfolding power_Suc mult_assoc |
29687 | 911 |
by (case_tac n, auto) |
912 |
||
913 |
lemma X_power_mult_right_nth: "((f :: ('a::comm_ring_1) fps) * X^k) $n = (if n < k then 0 else f $ (n - k))" |
|
914 |
by (metis X_power_mult_nth mult_commute) |
|
915 |
lemma fps_deriv_X[simp]: "fps_deriv X = 1" |
|
916 |
by (simp add: fps_deriv_def X_def fps_eq_iff) |
|
917 |
||
918 |
lemma fps_nth_deriv_X[simp]: "fps_nth_deriv n X = (if n = 0 then X else if n=1 then 1 else 0)" |
|
919 |
by (cases "n", simp_all) |
|
920 |
||
921 |
lemma X_nth[simp]: "X$n = (if n = 1 then 1 else 0)" by (simp add: X_def) |
|
922 |
lemma X_power_nth[simp]: "(X^k) $n = (if n = k then 1 else (0::'a::comm_ring_1))" |
|
923 |
by (simp add: X_power_iff) |
|
924 |
||
925 |
lemma fps_inverse_X_plus1: |
|
926 |
"inverse (1 + X) = Abs_fps (\<lambda>n. (- (1::'a::{recpower, field})) ^ n)" (is "_ = ?r") |
|
927 |
proof- |
|
928 |
have eq: "(1 + X) * ?r = 1" |
|
929 |
unfolding minus_one_power_iff |
|
930 |
apply (auto simp add: ring_simps fps_eq_iff) |
|
931 |
by presburger+ |
|
932 |
show ?thesis by (auto simp add: eq intro: fps_inverse_unique) |
|
933 |
qed |
|
934 |
||
30488 | 935 |
|
29906 | 936 |
subsection{* Integration *} |
29687 | 937 |
definition "fps_integral a a0 = Abs_fps (\<lambda>n. if n = 0 then a0 else (a$(n - 1) / of_nat n))" |
938 |
||
939 |
lemma fps_deriv_fps_integral: "fps_deriv (fps_integral a (a0 :: 'a :: {field, ring_char_0})) = a" |
|
940 |
by (simp add: fps_integral_def fps_deriv_def fps_eq_iff field_simps del: of_nat_Suc) |
|
941 |
||
942 |
lemma fps_integral_linear: "fps_integral (fps_const (a::'a::{field, ring_char_0}) * f + fps_const b * g) (a*a0 + b*b0) = fps_const a * fps_integral f a0 + fps_const b * fps_integral g b0" (is "?l = ?r") |
|
943 |
proof- |
|
944 |
have "fps_deriv ?l = fps_deriv ?r" by (simp add: fps_deriv_fps_integral) |
|
945 |
moreover have "?l$0 = ?r$0" by (simp add: fps_integral_def) |
|
946 |
ultimately show ?thesis |
|
947 |
unfolding fps_deriv_eq_iff by auto |
|
948 |
qed |
|
30488 | 949 |
|
29906 | 950 |
subsection {* Composition of FPSs *} |
29687 | 951 |
definition fps_compose :: "('a::semiring_1) fps \<Rightarrow> 'a fps \<Rightarrow> 'a fps" (infixl "oo" 55) where |
952 |
fps_compose_def: "a oo b = Abs_fps (\<lambda>n. setsum (\<lambda>i. a$i * (b^i$n)) {0..n})" |
|
953 |
||
954 |
lemma fps_compose_nth: "(a oo b)$n = setsum (\<lambda>i. a$i * (b^i$n)) {0..n}" by (simp add: fps_compose_def) |
|
955 |
||
956 |
lemma fps_compose_X[simp]: "a oo X = (a :: ('a :: comm_ring_1) fps)" |
|
29913 | 957 |
by (simp add: fps_ext fps_compose_def mult_delta_right setsum_delta') |
30488 | 958 |
|
959 |
lemma fps_const_compose[simp]: |
|
29687 | 960 |
"fps_const (a::'a::{comm_ring_1}) oo b = fps_const (a)" |
29913 | 961 |
by (simp add: fps_eq_iff fps_compose_nth mult_delta_left setsum_delta) |
29687 | 962 |
|
963 |
lemma X_fps_compose_startby0[simp]: "a$0 = 0 \<Longrightarrow> X oo a = (a :: ('a :: comm_ring_1) fps)" |
|
29913 | 964 |
by (simp add: fps_eq_iff fps_compose_def mult_delta_left setsum_delta |
965 |
power_Suc not_le) |
|
29687 | 966 |
|
967 |
||
29906 | 968 |
subsection {* Rules from Herbert Wilf's Generatingfunctionology*} |
29687 | 969 |
|
29906 | 970 |
subsubsection {* Rule 1 *} |
29687 | 971 |
(* {a_{n+k}}_0^infty Corresponds to (f - setsum (\<lambda>i. a_i * x^i))/x^h, for h>0*) |
972 |
||
30488 | 973 |
lemma fps_power_mult_eq_shift: |
29687 | 974 |
"X^Suc k * Abs_fps (\<lambda>n. a (n + Suc k)) = Abs_fps a - setsum (\<lambda>i. fps_const (a i :: 'a:: field) * X^i) {0 .. k}" (is "?lhs = ?rhs") |
975 |
proof- |
|
976 |
{fix n:: nat |
|
30488 | 977 |
have "?lhs $ n = (if n < Suc k then 0 else a n)" |
29687 | 978 |
unfolding X_power_mult_nth by auto |
979 |
also have "\<dots> = ?rhs $ n" |
|
980 |
proof(induct k) |
|
981 |
case 0 thus ?case by (simp add: fps_setsum_nth power_Suc) |
|
982 |
next |
|
983 |
case (Suc k) |
|
984 |
note th = Suc.hyps[symmetric] |
|
985 |
have "(Abs_fps a - setsum (\<lambda>i. fps_const (a i :: 'a:: field) * X^i) {0 .. Suc k})$n = (Abs_fps a - setsum (\<lambda>i. fps_const (a i :: 'a:: field) * X^i) {0 .. k} - fps_const (a (Suc k)) * X^ Suc k) $ n" by (simp add: ring_simps) |
|
986 |
also have "\<dots> = (if n < Suc k then 0 else a n) - (fps_const (a (Suc k)) * X^ Suc k)$n" |
|
30488 | 987 |
using th |
29687 | 988 |
unfolding fps_sub_nth by simp |
989 |
also have "\<dots> = (if n < Suc (Suc k) then 0 else a n)" |
|
990 |
unfolding X_power_mult_right_nth |
|
991 |
apply (auto simp add: not_less fps_const_def) |
|
992 |
apply (rule cong[of a a, OF refl]) |
|
993 |
by arith |
|
994 |
finally show ?case by simp |
|
995 |
qed |
|
996 |
finally have "?lhs $ n = ?rhs $ n" .} |
|
997 |
then show ?thesis by (simp add: fps_eq_iff) |
|
998 |
qed |
|
999 |
||
29906 | 1000 |
subsubsection{* Rule 2*} |
29687 | 1001 |
|
1002 |
(* We can not reach the form of Wilf, but still near to it using rewrite rules*) |
|
30488 | 1003 |
(* If f reprents {a_n} and P is a polynomial, then |
29687 | 1004 |
P(xD) f represents {P(n) a_n}*) |
1005 |
||
1006 |
definition "XD = op * X o fps_deriv" |
|
1007 |
||
1008 |
lemma XD_add[simp]:"XD (a + b) = XD a + XD (b :: ('a::comm_ring_1) fps)" |
|
1009 |
by (simp add: XD_def ring_simps) |
|
1010 |
||
1011 |
lemma XD_mult_const[simp]:"XD (fps_const (c::'a::comm_ring_1) * a) = fps_const c * XD a" |
|
1012 |
by (simp add: XD_def ring_simps) |
|
1013 |
||
1014 |
lemma XD_linear[simp]: "XD (fps_const c * a + fps_const d * b) = fps_const c * XD a + fps_const d * XD (b :: ('a::comm_ring_1) fps)" |
|
1015 |
by simp |
|
1016 |
||
29689
dd086f26ee4f
removed definition of funpow , reusing that of Relation_Power
chaieb
parents:
29687
diff
changeset
|
1017 |
lemma XDN_linear: "(XD^n) (fps_const c * a + fps_const d * b) = fps_const c * (XD^n) a + fps_const d * (XD^n) (b :: ('a::comm_ring_1) fps)" |
29687 | 1018 |
by (induct n, simp_all) |
1019 |
||
1020 |
lemma fps_mult_X_deriv_shift: "X* fps_deriv a = Abs_fps (\<lambda>n. of_nat n* a$n)" by (simp add: fps_eq_iff) |
|
1021 |
||
29689
dd086f26ee4f
removed definition of funpow , reusing that of Relation_Power
chaieb
parents:
29687
diff
changeset
|
1022 |
lemma fps_mult_XD_shift: "(XD ^k) (a:: ('a::{comm_ring_1, recpower, ring_char_0}) fps) = Abs_fps (\<lambda>n. (of_nat n ^ k) * a$n)" |
29687 | 1023 |
by (induct k arbitrary: a) (simp_all add: power_Suc XD_def fps_eq_iff ring_simps del: One_nat_def) |
1024 |
||
29906 | 1025 |
subsubsection{* Rule 3 is trivial and is given by @{text fps_times_def}*} |
1026 |
subsubsection{* Rule 5 --- summation and "division" by (1 - X)*} |
|
29687 | 1027 |
|
1028 |
lemma fps_divide_X_minus1_setsum_lemma: |
|
1029 |
"a = ((1::('a::comm_ring_1) fps) - X) * Abs_fps (\<lambda>n. setsum (\<lambda>i. a $ i) {0..n})" |
|
1030 |
proof- |
|
1031 |
let ?X = "X::('a::comm_ring_1) fps" |
|
1032 |
let ?sa = "Abs_fps (\<lambda>n. setsum (\<lambda>i. a $ i) {0..n})" |
|
1033 |
have th0: "\<And>i. (1 - (X::'a fps)) $ i = (if i = 0 then 1 else if i = 1 then - 1 else 0)" by simp |
|
1034 |
{fix n:: nat |
|
30488 | 1035 |
{assume "n=0" hence "a$n = ((1 - ?X) * ?sa) $ n" |
29687 | 1036 |
by (simp add: fps_mult_nth)} |
1037 |
moreover |
|
1038 |
{assume n0: "n \<noteq> 0" |
|
1039 |
then have u: "{0} \<union> ({1} \<union> {2..n}) = {0..n}" "{1}\<union>{2..n} = {1..n}" |
|
1040 |
"{0..n - 1}\<union>{n} = {0..n}" |
|
1041 |
apply (simp_all add: expand_set_eq) by presburger+ |
|
30488 | 1042 |
have d: "{0} \<inter> ({1} \<union> {2..n}) = {}" "{1} \<inter> {2..n} = {}" |
29687 | 1043 |
"{0..n - 1}\<inter>{n} ={}" using n0 |
1044 |
by (simp_all add: expand_set_eq, presburger+) |
|
30488 | 1045 |
have f: "finite {0}" "finite {1}" "finite {2 .. n}" |
1046 |
"finite {0 .. n - 1}" "finite {n}" by simp_all |
|
29687 | 1047 |
have "((1 - ?X) * ?sa) $ n = setsum (\<lambda>i. (1 - ?X)$ i * ?sa $ (n - i)) {0 .. n}" |
1048 |
by (simp add: fps_mult_nth) |
|
1049 |
also have "\<dots> = a$n" unfolding th0 |
|
1050 |
unfolding setsum_Un_disjoint[OF f(1) finite_UnI[OF f(2,3)] d(1), unfolded u(1)] |
|
1051 |
unfolding setsum_Un_disjoint[OF f(2) f(3) d(2)] |
|
1052 |
apply (simp) |
|
1053 |
unfolding setsum_Un_disjoint[OF f(4,5) d(3), unfolded u(3)] |
|
1054 |
by simp |
|
1055 |
finally have "a$n = ((1 - ?X) * ?sa) $ n" by simp} |
|
1056 |
ultimately have "a$n = ((1 - ?X) * ?sa) $ n" by blast} |
|
30488 | 1057 |
then show ?thesis |
29687 | 1058 |
unfolding fps_eq_iff by blast |
1059 |
qed |
|
1060 |
||
1061 |
lemma fps_divide_X_minus1_setsum: |
|
1062 |
"a /((1::('a::field) fps) - X) = Abs_fps (\<lambda>n. setsum (\<lambda>i. a $ i) {0..n})" |
|
1063 |
proof- |
|
1064 |
let ?X = "1 - (X::('a::field) fps)" |
|
1065 |
have th0: "?X $ 0 \<noteq> 0" by simp |
|
1066 |
have "a /?X = ?X * Abs_fps (\<lambda>n\<Colon>nat. setsum (op $ a) {0..n}) * inverse ?X" |
|
1067 |
using fps_divide_X_minus1_setsum_lemma[of a, symmetric] th0 |
|
1068 |
by (simp add: fps_divide_def mult_assoc) |
|
1069 |
also have "\<dots> = (inverse ?X * ?X) * Abs_fps (\<lambda>n\<Colon>nat. setsum (op $ a) {0..n}) " |
|
1070 |
by (simp add: mult_ac) |
|
1071 |
finally show ?thesis by (simp add: inverse_mult_eq_1[OF th0]) |
|
1072 |
qed |
|
1073 |
||
30488 | 1074 |
subsubsection{* Rule 4 in its more general form: generalizes Rule 3 for an arbitrary |
29687 | 1075 |
finite product of FPS, also the relvant instance of powers of a FPS*} |
1076 |
||
1077 |
definition "natpermute n k = {l:: nat list. length l = k \<and> foldl op + 0 l = n}" |
|
1078 |
||
1079 |
lemma natlist_trivial_1: "natpermute n 1 = {[n]}" |
|
1080 |
apply (auto simp add: natpermute_def) |
|
1081 |
apply (case_tac x, auto) |
|
1082 |
done |
|
1083 |
||
30488 | 1084 |
lemma foldl_add_start0: |
29687 | 1085 |
"foldl op + x xs = x + foldl op + (0::nat) xs" |
1086 |
apply (induct xs arbitrary: x) |
|
1087 |
apply simp |
|
1088 |
unfolding foldl.simps |
|
1089 |
apply atomize |
|
1090 |
apply (subgoal_tac "\<forall>x\<Colon>nat. foldl op + x xs = x + foldl op + (0\<Colon>nat) xs") |
|
1091 |
apply (erule_tac x="x + a" in allE) |
|
1092 |
apply (erule_tac x="a" in allE) |
|
1093 |
apply simp |
|
1094 |
apply assumption |
|
1095 |
done |
|
1096 |
||
1097 |
lemma foldl_add_append: "foldl op + (x::nat) (xs@ys) = foldl op + x xs + foldl op + 0 ys" |
|
1098 |
apply (induct ys arbitrary: x xs) |
|
1099 |
apply auto |
|
1100 |
apply (subst (2) foldl_add_start0) |
|
1101 |
apply simp |
|
1102 |
apply (subst (2) foldl_add_start0) |
|
1103 |
by simp |
|
1104 |
||
1105 |
lemma foldl_add_setsum: "foldl op + (x::nat) xs = x + setsum (nth xs) {0..<length xs}" |
|
1106 |
proof(induct xs arbitrary: x) |
|
1107 |
case Nil thus ?case by simp |
|
1108 |
next |
|
1109 |
case (Cons a as x) |
|
1110 |
have eq: "setsum (op ! (a#as)) {1..<length (a#as)} = setsum (op ! as) {0..<length as}" |
|
1111 |
apply (rule setsum_reindex_cong [where f=Suc]) |
|
1112 |
by (simp_all add: inj_on_def) |
|
1113 |
have f: "finite {0}" "finite {1 ..< length (a#as)}" by simp_all |
|
1114 |
have d: "{0} \<inter> {1..<length (a#as)} = {}" by simp |
|
1115 |
have seq: "{0} \<union> {1..<length(a#as)} = {0 ..<length (a#as)}" by auto |
|
1116 |
have "foldl op + x (a#as) = x + foldl op + a as " |
|
1117 |
apply (subst foldl_add_start0) by simp |
|
1118 |
also have "\<dots> = x + a + setsum (op ! as) {0..<length as}" unfolding Cons.hyps by simp |
|
1119 |
also have "\<dots> = x + setsum (op ! (a#as)) {0..<length (a#as)}" |
|
30488 | 1120 |
unfolding eq[symmetric] |
29687 | 1121 |
unfolding setsum_Un_disjoint[OF f d, unfolded seq] |
1122 |
by simp |
|
1123 |
finally show ?case . |
|
1124 |
qed |
|
1125 |
||
1126 |
||
1127 |
lemma append_natpermute_less_eq: |
|
1128 |
assumes h: "xs@ys \<in> natpermute n k" shows "foldl op + 0 xs \<le> n" and "foldl op + 0 ys \<le> n" |
|
1129 |
proof- |
|
1130 |
{from h have "foldl op + 0 (xs@ ys) = n" by (simp add: natpermute_def) |
|
1131 |
hence "foldl op + 0 xs + foldl op + 0 ys = n" unfolding foldl_add_append .} |
|
1132 |
note th = this |
|
1133 |
{from th show "foldl op + 0 xs \<le> n" by simp} |
|
1134 |
{from th show "foldl op + 0 ys \<le> n" by simp} |
|
1135 |
qed |
|
1136 |
||
1137 |
lemma natpermute_split: |
|
1138 |
assumes mn: "h \<le> k" |
|
1139 |
shows "natpermute n k = (\<Union>m \<in>{0..n}. {l1 @ l2 |l1 l2. l1 \<in> natpermute m h \<and> l2 \<in> natpermute (n - m) (k - h)})" (is "?L = ?R" is "?L = (\<Union>m \<in>{0..n}. ?S m)") |
|
1140 |
proof- |
|
30488 | 1141 |
{fix l assume l: "l \<in> ?R" |
29687 | 1142 |
from l obtain m xs ys where h: "m \<in> {0..n}" and xs: "xs \<in> natpermute m h" and ys: "ys \<in> natpermute (n - m) (k - h)" and leq: "l = xs@ys" by blast |
1143 |
from xs have xs': "foldl op + 0 xs = m" by (simp add: natpermute_def) |
|
1144 |
from ys have ys': "foldl op + 0 ys = n - m" by (simp add: natpermute_def) |
|
30488 | 1145 |
have "l \<in> ?L" using leq xs ys h |
29687 | 1146 |
apply simp |
1147 |
apply (clarsimp simp add: natpermute_def simp del: foldl_append) |
|
1148 |
apply (simp add: foldl_add_append[unfolded foldl_append]) |
|
1149 |
unfolding xs' ys' |
|
30488 | 1150 |
using mn xs ys |
29687 | 1151 |
unfolding natpermute_def by simp} |
1152 |
moreover |
|
1153 |
{fix l assume l: "l \<in> natpermute n k" |
|
1154 |
let ?xs = "take h l" |
|
1155 |
let ?ys = "drop h l" |
|
1156 |
let ?m = "foldl op + 0 ?xs" |
|
1157 |
from l have ls: "foldl op + 0 (?xs @ ?ys) = n" by (simp add: natpermute_def) |
|
30488 | 1158 |
have xs: "?xs \<in> natpermute ?m h" using l mn by (simp add: natpermute_def) |
29687 | 1159 |
have ys: "?ys \<in> natpermute (n - ?m) (k - h)" using l mn ls[unfolded foldl_add_append] |
1160 |
by (simp add: natpermute_def) |
|
1161 |
from ls have m: "?m \<in> {0..n}" unfolding foldl_add_append by simp |
|
30488 | 1162 |
from xs ys ls have "l \<in> ?R" |
29687 | 1163 |
apply auto |
1164 |
apply (rule bexI[where x = "?m"]) |
|
1165 |
apply (rule exI[where x = "?xs"]) |
|
1166 |
apply (rule exI[where x = "?ys"]) |
|
30488 | 1167 |
using ls l unfolding foldl_add_append |
29687 | 1168 |
by (auto simp add: natpermute_def)} |
1169 |
ultimately show ?thesis by blast |
|
1170 |
qed |
|
1171 |
||
1172 |
lemma natpermute_0: "natpermute n 0 = (if n = 0 then {[]} else {})" |
|
1173 |
by (auto simp add: natpermute_def) |
|
1174 |
lemma natpermute_0'[simp]: "natpermute 0 k = (if k = 0 then {[]} else {replicate k 0})" |
|
1175 |
apply (auto simp add: set_replicate_conv_if natpermute_def) |
|
1176 |
apply (rule nth_equalityI) |
|
1177 |
by simp_all |
|
1178 |
||
1179 |
lemma natpermute_finite: "finite (natpermute n k)" |
|
1180 |
proof(induct k arbitrary: n) |
|
30488 | 1181 |
case 0 thus ?case |
29687 | 1182 |
apply (subst natpermute_split[of 0 0, simplified]) |
1183 |
by (simp add: natpermute_0) |
|
1184 |
next |
|
1185 |
case (Suc k) |
|
1186 |
then show ?case unfolding natpermute_split[of k "Suc k", simplified] |
|
1187 |
apply - |
|
1188 |
apply (rule finite_UN_I) |
|
1189 |
apply simp |
|
1190 |
unfolding One_nat_def[symmetric] natlist_trivial_1 |
|
1191 |
apply simp |
|
1192 |
unfolding image_Collect[symmetric] |
|
1193 |
unfolding Collect_def mem_def |
|
1194 |
apply (rule finite_imageI) |
|
1195 |
apply blast |
|
1196 |
done |
|
1197 |
qed |
|
1198 |
||
1199 |
lemma natpermute_contain_maximal: |
|
1200 |
"{xs \<in> natpermute n (k+1). n \<in> set xs} = UNION {0 .. k} (\<lambda>i. {(replicate (k+1) 0) [i:=n]})" |
|
1201 |
(is "?A = ?B") |
|
1202 |
proof- |
|
1203 |
{fix xs assume H: "xs \<in> natpermute n (k+1)" and n: "n \<in> set xs" |
|
1204 |
from n obtain i where i: "i \<in> {0.. k}" "xs!i = n" using H |
|
30488 | 1205 |
unfolding in_set_conv_nth by (auto simp add: less_Suc_eq_le natpermute_def) |
29687 | 1206 |
have eqs: "({0..k} - {i}) \<union> {i} = {0..k}" using i by auto |
1207 |
have f: "finite({0..k} - {i})" "finite {i}" by auto |
|
1208 |
have d: "({0..k} - {i}) \<inter> {i} = {}" using i by auto |
|
1209 |
from H have "n = setsum (nth xs) {0..k}" apply (simp add: natpermute_def) |
|
1210 |
unfolding foldl_add_setsum by (auto simp add: atLeastLessThanSuc_atLeastAtMost) |
|
1211 |
also have "\<dots> = n + setsum (nth xs) ({0..k} - {i})" |
|
1212 |
unfolding setsum_Un_disjoint[OF f d, unfolded eqs] using i by simp |
|
1213 |
finally have zxs: "\<forall> j\<in> {0..k} - {i}. xs!j = 0" by auto |
|
1214 |
from H have xsl: "length xs = k+1" by (simp add: natpermute_def) |
|
1215 |
from i have i': "i < length (replicate (k+1) 0)" "i < k+1" |
|
1216 |
unfolding length_replicate by arith+ |
|
1217 |
have "xs = replicate (k+1) 0 [i := n]" |
|
1218 |
apply (rule nth_equalityI) |
|
1219 |
unfolding xsl length_list_update length_replicate |
|
1220 |
apply simp |
|
1221 |
apply clarify |
|
1222 |
unfolding nth_list_update[OF i'(1)] |
|
1223 |
using i zxs |
|
1224 |
by (case_tac "ia=i", auto simp del: replicate.simps) |
|
1225 |
then have "xs \<in> ?B" using i by blast} |
|
1226 |
moreover |
|
1227 |
{fix i assume i: "i \<in> {0..k}" |
|
1228 |
let ?xs = "replicate (k+1) 0 [i:=n]" |
|
1229 |
have nxs: "n \<in> set ?xs" |
|
1230 |
apply (rule set_update_memI) using i by simp |
|
1231 |
have xsl: "length ?xs = k+1" by (simp only: length_replicate length_list_update) |
|
1232 |
have "foldl op + 0 ?xs = setsum (nth ?xs) {0..<k+1}" |
|
1233 |
unfolding foldl_add_setsum add_0 length_replicate length_list_update .. |
|
1234 |
also have "\<dots> = setsum (\<lambda>j. if j = i then n else 0) {0..< k+1}" |
|
1235 |
apply (rule setsum_cong2) by (simp del: replicate.simps) |
|
1236 |
also have "\<dots> = n" using i by (simp add: setsum_delta) |
|
30488 | 1237 |
finally |
29687 | 1238 |
have "?xs \<in> natpermute n (k+1)" using xsl unfolding natpermute_def Collect_def mem_def |
1239 |
by blast |
|
1240 |
then have "?xs \<in> ?A" using nxs by blast} |
|
1241 |
ultimately show ?thesis by auto |
|
1242 |
qed |
|
1243 |
||
30488 | 1244 |
(* The general form *) |
29687 | 1245 |
lemma fps_setprod_nth: |
1246 |
fixes m :: nat and a :: "nat \<Rightarrow> ('a::comm_ring_1) fps" |
|
1247 |
shows "(setprod a {0 .. m})$n = setsum (\<lambda>v. setprod (\<lambda>j. (a j) $ (v!j)) {0..m}) (natpermute n (m+1))" |
|
1248 |
(is "?P m n") |
|
1249 |
proof(induct m arbitrary: n rule: nat_less_induct) |
|
1250 |
fix m n assume H: "\<forall>m' < m. \<forall>n. ?P m' n" |
|
1251 |
{assume m0: "m = 0" |
|
1252 |
hence "?P m n" apply simp |
|
1253 |
unfolding natlist_trivial_1[where n = n, unfolded One_nat_def] by simp} |
|
1254 |
moreover |
|
1255 |
{fix k assume k: "m = Suc k" |
|
1256 |
have km: "k < m" using k by arith |
|
1257 |
have u0: "{0 .. k} \<union> {m} = {0..m}" using k apply (simp add: expand_set_eq) by presburger |
|
1258 |
have f0: "finite {0 .. k}" "finite {m}" by auto |
|
1259 |
have d0: "{0 .. k} \<inter> {m} = {}" using k by auto |
|
1260 |
have "(setprod a {0 .. m}) $ n = (setprod a {0 .. k} * a m) $ n" |
|
1261 |
unfolding setprod_Un_disjoint[OF f0 d0, unfolded u0] by simp |
|
1262 |
also have "\<dots> = (\<Sum>i = 0..n. (\<Sum>v\<in>natpermute i (k + 1). \<Prod>j\<in>{0..k}. a j $ v ! j) * a m $ (n - i))" |
|
1263 |
unfolding fps_mult_nth H[rule_format, OF km] .. |
|
1264 |
also have "\<dots> = (\<Sum>v\<in>natpermute n (m + 1). \<Prod>j\<in>{0..m}. a j $ v ! j)" |
|
1265 |
apply (simp add: k) |
|
1266 |
unfolding natpermute_split[of m "m + 1", simplified, of n, unfolded natlist_trivial_1[unfolded One_nat_def] k] |
|
1267 |
apply (subst setsum_UN_disjoint) |
|
30488 | 1268 |
apply simp |
29687 | 1269 |
apply simp |
1270 |
unfolding image_Collect[symmetric] |
|
1271 |
apply clarsimp |
|
1272 |
apply (rule finite_imageI) |
|
1273 |
apply (rule natpermute_finite) |
|
1274 |
apply (clarsimp simp add: expand_set_eq) |
|
1275 |
apply auto |
|
1276 |
apply (rule setsum_cong2) |
|
1277 |
unfolding setsum_left_distrib |
|
1278 |
apply (rule sym) |
|
1279 |
apply (rule_tac f="\<lambda>xs. xs @[n - x]" in setsum_reindex_cong) |
|
1280 |
apply (simp add: inj_on_def) |
|
1281 |
apply auto |
|
1282 |
unfolding setprod_Un_disjoint[OF f0 d0, unfolded u0, unfolded k] |
|
1283 |
apply (clarsimp simp add: natpermute_def nth_append) |
|
1284 |
apply (rule_tac f="\<lambda>x. x * a (Suc k) $ (n - foldl op + 0 aa)" in cong[OF refl]) |
|
1285 |
apply (rule setprod_cong) |
|
1286 |
apply simp |
|
1287 |
apply simp |
|
1288 |
done |
|
1289 |
finally have "?P m n" .} |
|
1290 |
ultimately show "?P m n " by (cases m, auto) |
|
1291 |
qed |
|
1292 |
||
1293 |
text{* The special form for powers *} |
|
1294 |
lemma fps_power_nth_Suc: |
|
1295 |
fixes m :: nat and a :: "('a::comm_ring_1) fps" |
|
1296 |
shows "(a ^ Suc m)$n = setsum (\<lambda>v. setprod (\<lambda>j. a $ (v!j)) {0..m}) (natpermute n (m+1))" |
|
1297 |
proof- |
|
1298 |
have f: "finite {0 ..m}" by simp |
|
1299 |
have th0: "a^Suc m = setprod (\<lambda>i. a) {0..m}" unfolding setprod_constant[OF f, of a] by simp |
|
1300 |
show ?thesis unfolding th0 fps_setprod_nth .. |
|
1301 |
qed |
|
1302 |
lemma fps_power_nth: |
|
1303 |
fixes m :: nat and a :: "('a::comm_ring_1) fps" |
|
1304 |
shows "(a ^m)$n = (if m=0 then 1$n else setsum (\<lambda>v. setprod (\<lambda>j. a $ (v!j)) {0..m - 1}) (natpermute n m))" |
|
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1305 |
by (cases m, simp_all add: fps_power_nth_Suc del: power_Suc) |
29687 | 1306 |
|
30488 | 1307 |
lemma fps_nth_power_0: |
29687 | 1308 |
fixes m :: nat and a :: "('a::{comm_ring_1, recpower}) fps" |
1309 |
shows "(a ^m)$0 = (a$0) ^ m" |
|
1310 |
proof- |
|
1311 |
{assume "m=0" hence ?thesis by simp} |
|
1312 |
moreover |
|
1313 |
{fix n assume m: "m = Suc n" |
|
1314 |
have c: "m = card {0..n}" using m by simp |
|
1315 |
have "(a ^m)$0 = setprod (\<lambda>i. a$0) {0..n}" |
|
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1316 |
apply (simp add: m fps_power_nth del: replicate.simps power_Suc) |
29687 | 1317 |
apply (rule setprod_cong) |
1318 |
by (simp_all del: replicate.simps) |
|
1319 |
also have "\<dots> = (a$0) ^ m" |
|
1320 |
unfolding c by (rule setprod_constant, simp) |
|
1321 |
finally have ?thesis .} |
|
1322 |
ultimately show ?thesis by (cases m, auto) |
|
1323 |
qed |
|
1324 |
||
30488 | 1325 |
lemma fps_compose_inj_right: |
29687 | 1326 |
assumes a0: "a$0 = (0::'a::{recpower,idom})" |
1327 |
and a1: "a$1 \<noteq> 0" |
|
1328 |
shows "(b oo a = c oo a) \<longleftrightarrow> b = c" (is "?lhs \<longleftrightarrow>?rhs") |
|
1329 |
proof- |
|
1330 |
{assume ?rhs then have "?lhs" by simp} |
|
1331 |
moreover |
|
1332 |
{assume h: ?lhs |
|
30488 | 1333 |
{fix n have "b$n = c$n" |
29687 | 1334 |
proof(induct n rule: nat_less_induct) |
1335 |
fix n assume H: "\<forall>m<n. b$m = c$m" |
|
1336 |
{assume n0: "n=0" |
|
1337 |
from h have "(b oo a)$n = (c oo a)$n" by simp |
|
1338 |
hence "b$n = c$n" using n0 by (simp add: fps_compose_nth)} |
|
1339 |
moreover |
|
1340 |
{fix n1 assume n1: "n = Suc n1" |
|
1341 |
have f: "finite {0 .. n1}" "finite {n}" by simp_all |
|
1342 |
have eq: "{0 .. n1} \<union> {n} = {0 .. n}" using n1 by auto |
|
1343 |
have d: "{0 .. n1} \<inter> {n} = {}" using n1 by auto |
|
1344 |
have seq: "(\<Sum>i = 0..n1. b $ i * a ^ i $ n) = (\<Sum>i = 0..n1. c $ i * a ^ i $ n)" |
|
1345 |
apply (rule setsum_cong2) |
|
1346 |
using H n1 by auto |
|
1347 |
have th0: "(b oo a) $n = (\<Sum>i = 0..n1. c $ i * a ^ i $ n) + b$n * (a$1)^n" |
|
1348 |
unfolding fps_compose_nth setsum_Un_disjoint[OF f d, unfolded eq] seq |
|
1349 |
using startsby_zero_power_nth_same[OF a0] |
|
1350 |
by simp |
|
1351 |
have th1: "(c oo a) $n = (\<Sum>i = 0..n1. c $ i * a ^ i $ n) + c$n * (a$1)^n" |
|
1352 |
unfolding fps_compose_nth setsum_Un_disjoint[OF f d, unfolded eq] |
|
1353 |
using startsby_zero_power_nth_same[OF a0] |
|
1354 |
by simp |
|
1355 |
from h[unfolded fps_eq_iff, rule_format, of n] th0 th1 a1 |
|
1356 |
have "b$n = c$n" by auto} |
|
1357 |
ultimately show "b$n = c$n" by (cases n, auto) |
|
1358 |
qed} |
|
1359 |
then have ?rhs by (simp add: fps_eq_iff)} |
|
1360 |
ultimately show ?thesis by blast |
|
1361 |
qed |
|
1362 |
||
1363 |
||
29906 | 1364 |
subsection {* Radicals *} |
29687 | 1365 |
|
1366 |
declare setprod_cong[fundef_cong] |
|
1367 |
function radical :: "(nat \<Rightarrow> 'a \<Rightarrow> 'a) \<Rightarrow> nat \<Rightarrow> ('a::{field, recpower}) fps \<Rightarrow> nat \<Rightarrow> 'a" where |
|
1368 |
"radical r 0 a 0 = 1" |
|
1369 |
| "radical r 0 a (Suc n) = 0" |
|
1370 |
| "radical r (Suc k) a 0 = r (Suc k) (a$0)" |
|
1371 |
| "radical r (Suc k) a (Suc n) = (a$ Suc n - setsum (\<lambda>xs. setprod (\<lambda>j. radical r (Suc k) a (xs ! j)) {0..k}) {xs. xs \<in> natpermute (Suc n) (Suc k) \<and> Suc n \<notin> set xs}) / (of_nat (Suc k) * (radical r (Suc k) a 0)^k)" |
|
1372 |
by pat_completeness auto |
|
1373 |
||
1374 |
termination radical |
|
1375 |
proof |
|
1376 |
let ?R = "measure (\<lambda>(r, k, a, n). n)" |
|
1377 |
{ |
|
1378 |
show "wf ?R" by auto} |
|
1379 |
{fix r k a n xs i |
|
1380 |
assume xs: "xs \<in> {xs \<in> natpermute (Suc n) (Suc k). Suc n \<notin> set xs}" and i: "i \<in> {0..k}" |
|
1381 |
{assume c: "Suc n \<le> xs ! i" |
|
1382 |
from xs i have "xs !i \<noteq> Suc n" by (auto simp add: in_set_conv_nth natpermute_def) |
|
1383 |
with c have c': "Suc n < xs!i" by arith |
|
1384 |
have fths: "finite {0 ..< i}" "finite {i}" "finite {i+1..<Suc k}" by simp_all |
|
1385 |
have d: "{0 ..< i} \<inter> ({i} \<union> {i+1 ..< Suc k}) = {}" "{i} \<inter> {i+1..< Suc k} = {}" by auto |
|
1386 |
have eqs: "{0..<Suc k} = {0 ..< i} \<union> ({i} \<union> {i+1 ..< Suc k})" using i by auto |
|
1387 |
from xs have "Suc n = foldl op + 0 xs" by (simp add: natpermute_def) |
|
1388 |
also have "\<dots> = setsum (nth xs) {0..<Suc k}" unfolding foldl_add_setsum using xs |
|
1389 |
by (simp add: natpermute_def) |
|
1390 |
also have "\<dots> = xs!i + setsum (nth xs) {0..<i} + setsum (nth xs) {i+1..<Suc k}" |
|
1391 |
unfolding eqs setsum_Un_disjoint[OF fths(1) finite_UnI[OF fths(2,3)] d(1)] |
|
1392 |
unfolding setsum_Un_disjoint[OF fths(2) fths(3) d(2)] |
|
1393 |
by simp |
|
1394 |
finally have False using c' by simp} |
|
30488 | 1395 |
then show "((r,Suc k,a,xs!i), r, Suc k, a, Suc n) \<in> ?R" |
29687 | 1396 |
apply auto by (metis not_less)} |
30488 | 1397 |
{fix r k a n |
29687 | 1398 |
show "((r,Suc k, a, 0),r, Suc k, a, Suc n) \<in> ?R" by simp} |
1399 |
qed |
|
1400 |
||
1401 |
definition "fps_radical r n a = Abs_fps (radical r n a)" |
|
1402 |
||
1403 |
lemma fps_radical0[simp]: "fps_radical r 0 a = 1" |
|
1404 |
apply (auto simp add: fps_eq_iff fps_radical_def) by (case_tac n, auto) |
|
1405 |
||
1406 |
lemma fps_radical_nth_0[simp]: "fps_radical r n a $ 0 = (if n=0 then 1 else r n (a$0))" |
|
1407 |
by (cases n, simp_all add: fps_radical_def) |
|
1408 |
||
30488 | 1409 |
lemma fps_radical_power_nth[simp]: |
29687 | 1410 |
assumes r: "(r k (a$0)) ^ k = a$0" |
1411 |
shows "fps_radical r k a ^ k $ 0 = (if k = 0 then 1 else a$0)" |
|
1412 |
proof- |
|
1413 |
{assume "k=0" hence ?thesis by simp } |
|
1414 |
moreover |
|
30488 | 1415 |
{fix h assume h: "k = Suc h" |
29687 | 1416 |
have fh: "finite {0..h}" by simp |
1417 |
have eq1: "fps_radical r k a ^ k $ 0 = (\<Prod>j\<in>{0..h}. fps_radical r k a $ (replicate k 0) ! j)" |
|
1418 |
unfolding fps_power_nth h by simp |
|
1419 |
also have "\<dots> = (\<Prod>j\<in>{0..h}. r k (a$0))" |
|
1420 |
apply (rule setprod_cong) |
|
1421 |
apply simp |
|
1422 |
using h |
|
1423 |
apply (subgoal_tac "replicate k (0::nat) ! x = 0") |
|
1424 |
by (auto intro: nth_replicate simp del: replicate.simps) |
|
1425 |
also have "\<dots> = a$0" |
|
1426 |
unfolding setprod_constant[OF fh] using r by (simp add: h) |
|
1427 |
finally have ?thesis using h by simp} |
|
1428 |
ultimately show ?thesis by (cases k, auto) |
|
30488 | 1429 |
qed |
29687 | 1430 |
|
30488 | 1431 |
lemma natpermute_max_card: assumes n0: "n\<noteq>0" |
29687 | 1432 |
shows "card {xs \<in> natpermute n (k+1). n \<in> set xs} = k+1" |
1433 |
unfolding natpermute_contain_maximal |
|
1434 |
proof- |
|
1435 |
let ?A= "\<lambda>i. {replicate (k + 1) 0[i := n]}" |
|
1436 |
let ?K = "{0 ..k}" |
|
1437 |
have fK: "finite ?K" by simp |
|
1438 |
have fAK: "\<forall>i\<in>?K. finite (?A i)" by auto |
|
1439 |
have d: "\<forall>i\<in> ?K. \<forall>j\<in> ?K. i \<noteq> j \<longrightarrow> {replicate (k + 1) 0[i := n]} \<inter> {replicate (k + 1) 0[j := n]} = {}" |
|
1440 |
proof(clarify) |
|
1441 |
fix i j assume i: "i \<in> ?K" and j: "j\<in> ?K" and ij: "i\<noteq>j" |
|
1442 |
{assume eq: "replicate (k+1) 0 [i:=n] = replicate (k+1) 0 [j:= n]" |
|
1443 |
have "(replicate (k+1) 0 [i:=n] ! i) = n" using i by (simp del: replicate.simps) |
|
1444 |
moreover |
|
1445 |
have "(replicate (k+1) 0 [j:=n] ! i) = 0" using i ij by (simp del: replicate.simps) |
|
1446 |
ultimately have False using eq n0 by (simp del: replicate.simps)} |
|
1447 |
then show "{replicate (k + 1) 0[i := n]} \<inter> {replicate (k + 1) 0[j := n]} = {}" |
|
1448 |
by auto |
|
1449 |
qed |
|
30488 | 1450 |
from card_UN_disjoint[OF fK fAK d] |
29687 | 1451 |
show "card (\<Union>i\<in>{0..k}. {replicate (k + 1) 0[i := n]}) = k+1" by simp |
1452 |
qed |
|
30488 | 1453 |
|
1454 |
lemma power_radical: |
|
29687 | 1455 |
fixes a:: "'a ::{field, ring_char_0, recpower} fps" |
1456 |
assumes r0: "(r (Suc k) (a$0)) ^ Suc k = a$0" and a0: "a$0 \<noteq> 0" |
|
30488 | 1457 |
shows "(fps_radical r (Suc k) a) ^ (Suc k) = a" |
29687 | 1458 |
proof- |
1459 |
let ?r = "fps_radical r (Suc k) a" |
|
1460 |
from a0 r0 have r00: "r (Suc k) (a$0) \<noteq> 0" by auto |
|
1461 |
{fix z have "?r ^ Suc k $ z = a$z" |
|
1462 |
proof(induct z rule: nat_less_induct) |
|
1463 |
fix n assume H: "\<forall>m<n. ?r ^ Suc k $ m = a$m" |
|
1464 |
{assume "n = 0" hence "?r ^ Suc k $ n = a $n" |
|
1465 |
using fps_radical_power_nth[of r "Suc k" a, OF r0] by simp} |
|
1466 |
moreover |
|
1467 |
{fix n1 assume n1: "n = Suc n1" |
|
1468 |
have fK: "finite {0..k}" by simp |
|
1469 |
have nz: "n \<noteq> 0" using n1 by arith |
|
1470 |
let ?Pnk = "natpermute n (k + 1)" |
|
1471 |
let ?Pnkn = "{xs \<in> ?Pnk. n \<in> set xs}" |
|
1472 |
let ?Pnknn = "{xs \<in> ?Pnk. n \<notin> set xs}" |
|
1473 |
have eq: "?Pnkn \<union> ?Pnknn = ?Pnk" by blast |
|
1474 |
have d: "?Pnkn \<inter> ?Pnknn = {}" by blast |
|
30488 | 1475 |
have f: "finite ?Pnkn" "finite ?Pnknn" |
29687 | 1476 |
using finite_Un[of ?Pnkn ?Pnknn, unfolded eq] |
1477 |
by (metis natpermute_finite)+ |
|
1478 |
let ?f = "\<lambda>v. \<Prod>j\<in>{0..k}. ?r $ v ! j" |
|
30488 | 1479 |
have "setsum ?f ?Pnkn = setsum (\<lambda>v. ?r $ n * r (Suc k) (a $ 0) ^ k) ?Pnkn" |
29687 | 1480 |
proof(rule setsum_cong2) |
1481 |
fix v assume v: "v \<in> {xs \<in> natpermute n (k + 1). n \<in> set xs}" |
|
1482 |
let ?ths = "(\<Prod>j\<in>{0..k}. fps_radical r (Suc k) a $ v ! j) = fps_radical r (Suc k) a $ n * r (Suc k) (a $ 0) ^ k" |
|
1483 |
from v obtain i where i: "i \<in> {0..k}" "v = replicate (k+1) 0 [i:= n]" |
|
1484 |
unfolding natpermute_contain_maximal by auto |
|
1485 |
have "(\<Prod>j\<in>{0..k}. fps_radical r (Suc k) a $ v ! j) = (\<Prod>j\<in>{0..k}. if j = i then fps_radical r (Suc k) a $ n else r (Suc k) (a$0))" |
|
1486 |
apply (rule setprod_cong, simp) |
|
1487 |
using i r0 by (simp del: replicate.simps) |
|
1488 |
also have "\<dots> = (fps_radical r (Suc k) a $ n) * r (Suc k) (a$0) ^ k" |
|
1489 |
unfolding setprod_gen_delta[OF fK] using i r0 by simp |
|
1490 |
finally show ?ths . |
|
1491 |
qed |
|
30488 | 1492 |
then have "setsum ?f ?Pnkn = of_nat (k+1) * ?r $ n * r (Suc k) (a $ 0) ^ k" |
1493 |
by (simp add: natpermute_max_card[OF nz, simplified]) |
|
29687 | 1494 |
also have "\<dots> = a$n - setsum ?f ?Pnknn" |
1495 |
unfolding n1 using r00 a0 by (simp add: field_simps fps_radical_def del: of_nat_Suc ) |
|
1496 |
finally have fn: "setsum ?f ?Pnkn = a$n - setsum ?f ?Pnknn" . |
|
30488 | 1497 |
have "(?r ^ Suc k)$n = setsum ?f ?Pnkn + setsum ?f ?Pnknn" |
29687 | 1498 |
unfolding fps_power_nth_Suc setsum_Un_disjoint[OF f d, unfolded eq] .. |
1499 |
also have "\<dots> = a$n" unfolding fn by simp |
|
1500 |
finally have "?r ^ Suc k $ n = a $n" .} |
|
1501 |
ultimately show "?r ^ Suc k $ n = a $n" by (cases n, auto) |
|
1502 |
qed } |
|
1503 |
then show ?thesis by (simp add: fps_eq_iff) |
|
1504 |
qed |
|
1505 |
||
1506 |
lemma eq_divide_imp': assumes c0: "(c::'a::field) ~= 0" and eq: "a * c = b" |
|
30488 | 1507 |
shows "a = b / c" |
29687 | 1508 |
proof- |
1509 |
from eq have "a * c * inverse c = b * inverse c" by simp |
|
1510 |
hence "a * (inverse c * c) = b/c" by (simp only: field_simps divide_inverse) |
|
1511 |
then show "a = b/c" unfolding field_inverse[OF c0] by simp |
|
1512 |
qed |
|
1513 |
||
30488 | 1514 |
lemma radical_unique: |
1515 |
assumes r0: "(r (Suc k) (b$0)) ^ Suc k = b$0" |
|
29687 | 1516 |
and a0: "r (Suc k) (b$0 ::'a::{field, ring_char_0, recpower}) = a$0" and b0: "b$0 \<noteq> 0" |
1517 |
shows "a^(Suc k) = b \<longleftrightarrow> a = fps_radical r (Suc k) b" |
|
1518 |
proof- |
|
1519 |
let ?r = "fps_radical r (Suc k) b" |
|
1520 |
have r00: "r (Suc k) (b$0) \<noteq> 0" using b0 r0 by auto |
|
1521 |
{assume H: "a = ?r" |
|
1522 |
from H have "a^Suc k = b" using power_radical[of r k, OF r0 b0] by simp} |
|
1523 |
moreover |
|
1524 |
{assume H: "a^Suc k = b" |
|
1525 |
(* Generally a$0 would need to be the k+1 st root of b$0 *) |
|
1526 |
have ceq: "card {0..k} = Suc k" by simp |
|
1527 |
have fk: "finite {0..k}" by simp |
|
1528 |
from a0 have a0r0: "a$0 = ?r$0" by simp |
|
1529 |
{fix n have "a $ n = ?r $ n" |
|
1530 |
proof(induct n rule: nat_less_induct) |
|
1531 |
fix n assume h: "\<forall>m<n. a$m = ?r $m" |
|
1532 |
{assume "n = 0" hence "a$n = ?r $n" using a0 by simp } |
|
1533 |
moreover |
|
1534 |
{fix n1 assume n1: "n = Suc n1" |
|
1535 |
have fK: "finite {0..k}" by simp |
|
1536 |
have nz: "n \<noteq> 0" using n1 by arith |
|
1537 |
let ?Pnk = "natpermute n (Suc k)" |
|
1538 |
let ?Pnkn = "{xs \<in> ?Pnk. n \<in> set xs}" |
|
1539 |
let ?Pnknn = "{xs \<in> ?Pnk. n \<notin> set xs}" |
|
1540 |
have eq: "?Pnkn \<union> ?Pnknn = ?Pnk" by blast |
|
1541 |
have d: "?Pnkn \<inter> ?Pnknn = {}" by blast |
|
30488 | 1542 |
have f: "finite ?Pnkn" "finite ?Pnknn" |
29687 | 1543 |
using finite_Un[of ?Pnkn ?Pnknn, unfolded eq] |
1544 |
by (metis natpermute_finite)+ |
|
1545 |
let ?f = "\<lambda>v. \<Prod>j\<in>{0..k}. ?r $ v ! j" |
|
1546 |
let ?g = "\<lambda>v. \<Prod>j\<in>{0..k}. a $ v ! j" |
|
30488 | 1547 |
have "setsum ?g ?Pnkn = setsum (\<lambda>v. a $ n * (?r$0)^k) ?Pnkn" |
29687 | 1548 |
proof(rule setsum_cong2) |
1549 |
fix v assume v: "v \<in> {xs \<in> natpermute n (Suc k). n \<in> set xs}" |
|
1550 |
let ?ths = "(\<Prod>j\<in>{0..k}. a $ v ! j) = a $ n * (?r$0)^k" |
|
1551 |
from v obtain i where i: "i \<in> {0..k}" "v = replicate (k+1) 0 [i:= n]" |
|
1552 |
unfolding Suc_plus1 natpermute_contain_maximal by (auto simp del: replicate.simps) |
|
1553 |
have "(\<Prod>j\<in>{0..k}. a $ v ! j) = (\<Prod>j\<in>{0..k}. if j = i then a $ n else r (Suc k) (b$0))" |
|
1554 |
apply (rule setprod_cong, simp) |
|
1555 |
using i a0 by (simp del: replicate.simps) |
|
1556 |
also have "\<dots> = a $ n * (?r $ 0)^k" |
|
1557 |
unfolding setprod_gen_delta[OF fK] using i by simp |
|
1558 |
finally show ?ths . |
|
1559 |
qed |
|
30488 | 1560 |
then have th0: "setsum ?g ?Pnkn = of_nat (k+1) * a $ n * (?r $ 0)^k" |
29687 | 1561 |
by (simp add: natpermute_max_card[OF nz, simplified]) |
1562 |
have th1: "setsum ?g ?Pnknn = setsum ?f ?Pnknn" |
|
1563 |
proof (rule setsum_cong2, rule setprod_cong, simp) |
|
1564 |
fix xs i assume xs: "xs \<in> ?Pnknn" and i: "i \<in> {0..k}" |
|
1565 |
{assume c: "n \<le> xs ! i" |
|
1566 |
from xs i have "xs !i \<noteq> n" by (auto simp add: in_set_conv_nth natpermute_def) |
|
1567 |
with c have c': "n < xs!i" by arith |
|
1568 |
have fths: "finite {0 ..< i}" "finite {i}" "finite {i+1..<Suc k}" by simp_all |
|
1569 |
have d: "{0 ..< i} \<inter> ({i} \<union> {i+1 ..< Suc k}) = {}" "{i} \<inter> {i+1..< Suc k} = {}" by auto |
|
1570 |
have eqs: "{0..<Suc k} = {0 ..< i} \<union> ({i} \<union> {i+1 ..< Suc k})" using i by auto |
|
1571 |
from xs have "n = foldl op + 0 xs" by (simp add: natpermute_def) |
|
1572 |
also have "\<dots> = setsum (nth xs) {0..<Suc k}" unfolding foldl_add_setsum using xs |
|
1573 |
by (simp add: natpermute_def) |
|
1574 |
also have "\<dots> = xs!i + setsum (nth xs) {0..<i} + setsum (nth xs) {i+1..<Suc k}" |
|
1575 |
unfolding eqs setsum_Un_disjoint[OF fths(1) finite_UnI[OF fths(2,3)] d(1)] |
|
1576 |
unfolding setsum_Un_disjoint[OF fths(2) fths(3) d(2)] |
|
1577 |
by simp |
|
1578 |
finally have False using c' by simp} |
|
1579 |
then have thn: "xs!i < n" by arith |
|
30488 | 1580 |
from h[rule_format, OF thn] |
29687 | 1581 |
show "a$(xs !i) = ?r$(xs!i)" . |
1582 |
qed |
|
1583 |
have th00: "\<And>(x::'a). of_nat (Suc k) * (x * inverse (of_nat (Suc k))) = x" |
|
1584 |
by (simp add: field_simps del: of_nat_Suc) |
|
1585 |
from H have "b$n = a^Suc k $ n" by (simp add: fps_eq_iff) |
|
1586 |
also have "a ^ Suc k$n = setsum ?g ?Pnkn + setsum ?g ?Pnknn" |
|
30488 | 1587 |
unfolding fps_power_nth_Suc |
1588 |
using setsum_Un_disjoint[OF f d, unfolded Suc_plus1[symmetric], |
|
29687 | 1589 |
unfolded eq, of ?g] by simp |
1590 |
also have "\<dots> = of_nat (k+1) * a $ n * (?r $ 0)^k + setsum ?f ?Pnknn" unfolding th0 th1 .. |
|
1591 |
finally have "of_nat (k+1) * a $ n * (?r $ 0)^k = b$n - setsum ?f ?Pnknn" by simp |
|
1592 |
then have "a$n = (b$n - setsum ?f ?Pnknn) / (of_nat (k+1) * (?r $ 0)^k)" |
|
30488 | 1593 |
apply - |
29687 | 1594 |
apply (rule eq_divide_imp') |
1595 |
using r00 |
|
1596 |
apply (simp del: of_nat_Suc) |
|
1597 |
by (simp add: mult_ac) |
|
1598 |
then have "a$n = ?r $n" |
|
1599 |
apply (simp del: of_nat_Suc) |
|
1600 |
unfolding fps_radical_def n1 |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
1601 |
by (simp add: field_simps n1 th00 del: of_nat_Suc)} |
29687 | 1602 |
ultimately show "a$n = ?r $ n" by (cases n, auto) |
1603 |
qed} |
|
1604 |
then have "a = ?r" by (simp add: fps_eq_iff)} |
|
1605 |
ultimately show ?thesis by blast |
|
1606 |
qed |
|
1607 |
||
1608 |
||
30488 | 1609 |
lemma radical_power: |
1610 |
assumes r0: "r (Suc k) ((a$0) ^ Suc k) = a$0" |
|
29687 | 1611 |
and a0: "(a$0 ::'a::{field, ring_char_0, recpower}) \<noteq> 0" |
1612 |
shows "(fps_radical r (Suc k) (a ^ Suc k)) = a" |
|
1613 |
proof- |
|
1614 |
let ?ak = "a^ Suc k" |
|
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1615 |
have ak0: "?ak $ 0 = (a$0) ^ Suc k" by (simp add: fps_nth_power_0 del: power_Suc) |
29687 | 1616 |
from r0 have th0: "r (Suc k) (a ^ Suc k $ 0) ^ Suc k = a ^ Suc k $ 0" using ak0 by auto |
1617 |
from r0 ak0 have th1: "r (Suc k) (a ^ Suc k $ 0) = a $ 0" by auto |
|
1618 |
from ak0 a0 have ak00: "?ak $ 0 \<noteq>0 " by auto |
|
1619 |
from radical_unique[of r k ?ak a, OF th0 th1 ak00] show ?thesis by metis |
|
1620 |
qed |
|
1621 |
||
30488 | 1622 |
lemma fps_deriv_radical: |
29687 | 1623 |
fixes a:: "'a ::{field, ring_char_0, recpower} fps" |
1624 |
assumes r0: "(r (Suc k) (a$0)) ^ Suc k = a$0" and a0: "a$0 \<noteq> 0" |
|
1625 |
shows "fps_deriv (fps_radical r (Suc k) a) = fps_deriv a / (fps_const (of_nat (Suc k)) * (fps_radical r (Suc k) a) ^ k)" |
|
1626 |
proof- |
|
1627 |
let ?r= "fps_radical r (Suc k) a" |
|
1628 |
let ?w = "(fps_const (of_nat (Suc k)) * ?r ^ k)" |
|
1629 |
from a0 r0 have r0': "r (Suc k) (a$0) \<noteq> 0" by auto |
|
1630 |
from r0' have w0: "?w $ 0 \<noteq> 0" by (simp del: of_nat_Suc) |
|
1631 |
note th0 = inverse_mult_eq_1[OF w0] |
|
1632 |
let ?iw = "inverse ?w" |
|
1633 |
from power_radical[of r, OF r0 a0] |
|
1634 |
have "fps_deriv (?r ^ Suc k) = fps_deriv a" by simp |
|
1635 |
hence "fps_deriv ?r * ?w = fps_deriv a" |
|
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1636 |
by (simp add: fps_deriv_power mult_ac del: power_Suc) |
29687 | 1637 |
hence "?iw * fps_deriv ?r * ?w = ?iw * fps_deriv a" by simp |
1638 |
hence "fps_deriv ?r * (?iw * ?w) = fps_deriv a / ?w" |
|
1639 |
by (simp add: fps_divide_def) |
|
30488 | 1640 |
then show ?thesis unfolding th0 by simp |
29687 | 1641 |
qed |
1642 |
||
30488 | 1643 |
lemma radical_mult_distrib: |
29687 | 1644 |
fixes a:: "'a ::{field, ring_char_0, recpower} fps" |
30488 | 1645 |
assumes |
1646 |
ra0: "r (k) (a $ 0) ^ k = a $ 0" |
|
29687 | 1647 |
and rb0: "r (k) (b $ 0) ^ k = b $ 0" |
1648 |
and r0': "r (k) ((a * b) $ 0) = r (k) (a $ 0) * r (k) (b $ 0)" |
|
1649 |
and a0: "a$0 \<noteq> 0" |
|
1650 |
and b0: "b$0 \<noteq> 0" |
|
1651 |
shows "fps_radical r (k) (a*b) = fps_radical r (k) a * fps_radical r (k) (b)" |
|
1652 |
proof- |
|
1653 |
from r0' have r0: "(r (k) ((a*b)$0)) ^ k = (a*b)$0" |
|
1654 |
by (simp add: fps_mult_nth ra0 rb0 power_mult_distrib) |
|
1655 |
{assume "k=0" hence ?thesis by simp} |
|
1656 |
moreover |
|
1657 |
{fix h assume k: "k = Suc h" |
|
1658 |
let ?ra = "fps_radical r (Suc h) a" |
|
1659 |
let ?rb = "fps_radical r (Suc h) b" |
|
30488 | 1660 |
have th0: "r (Suc h) ((a * b) $ 0) = (fps_radical r (Suc h) a * fps_radical r (Suc h) b) $ 0" |
29687 | 1661 |
using r0' k by (simp add: fps_mult_nth) |
1662 |
have ab0: "(a*b) $ 0 \<noteq> 0" using a0 b0 by (simp add: fps_mult_nth) |
|
30488 | 1663 |
from radical_unique[of r h "a*b" "fps_radical r (Suc h) a * fps_radical r (Suc h) b", OF r0[unfolded k] th0 ab0, symmetric] |
29687 | 1664 |
power_radical[of r, OF ra0[unfolded k] a0] power_radical[of r, OF rb0[unfolded k] b0] k |
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1665 |
have ?thesis by (auto simp add: power_mult_distrib simp del: power_Suc)} |
29687 | 1666 |
ultimately show ?thesis by (cases k, auto) |
1667 |
qed |
|
1668 |
||
1669 |
lemma radical_inverse: |
|
1670 |
fixes a:: "'a ::{field, ring_char_0, recpower} fps" |
|
30488 | 1671 |
assumes |
1672 |
ra0: "r (k) (a $ 0) ^ k = a $ 0" |
|
29687 | 1673 |
and ria0: "r (k) (inverse (a $ 0)) = inverse (r (k) (a $ 0))" |
30488 | 1674 |
and r1: "(r (k) 1) = 1" |
29687 | 1675 |
and a0: "a$0 \<noteq> 0" |
1676 |
shows "fps_radical r (k) (inverse a) = inverse (fps_radical r (k) a)" |
|
1677 |
proof- |
|
1678 |
{assume "k=0" then have ?thesis by simp} |
|
1679 |
moreover |
|
1680 |
{fix h assume k[simp]: "k = Suc h" |
|
1681 |
let ?ra = "fps_radical r (Suc h) a" |
|
1682 |
let ?ria = "fps_radical r (Suc h) (inverse a)" |
|
1683 |
from ra0 a0 have th00: "r (Suc h) (a$0) \<noteq> 0" by auto |
|
1684 |
have ria0': "r (Suc h) (inverse a $ 0) ^ Suc h = inverse a$0" |
|
1685 |
using ria0 ra0 a0 |
|
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1686 |
by (simp add: fps_inverse_def nonzero_power_inverse[OF th00, symmetric] |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1687 |
del: power_Suc) |
30488 | 1688 |
from inverse_mult_eq_1[OF a0] have th0: "a * inverse a = 1" |
29687 | 1689 |
by (simp add: mult_commute) |
1690 |
from radical_unique[where a=1 and b=1 and r=r and k=h, simplified, OF r1[unfolded k]] |
|
1691 |
have th01: "fps_radical r (Suc h) 1 = 1" . |
|
1692 |
have th1: "r (Suc h) ((a * inverse a) $ 0) ^ Suc h = (a * inverse a) $ 0" |
|
1693 |
"r (Suc h) ((a * inverse a) $ 0) = |
|
1694 |
r (Suc h) (a $ 0) * r (Suc h) (inverse a $ 0)" |
|
1695 |
using r1 unfolding th0 apply (simp_all add: ria0[symmetric]) |
|
1696 |
apply (simp add: fps_inverse_def a0) |
|
1697 |
unfolding ria0[unfolded k] |
|
1698 |
using th00 by simp |
|
1699 |
from nonzero_imp_inverse_nonzero[OF a0] a0 |
|
1700 |
have th2: "inverse a $ 0 \<noteq> 0" by (simp add: fps_inverse_def) |
|
1701 |
from radical_mult_distrib[of r "Suc h" a "inverse a", OF ra0[unfolded k] ria0' th1(2) a0 th2] |
|
1702 |
have th3: "?ra * ?ria = 1" unfolding th0 th01 by simp |
|
1703 |
from th00 have ra0: "?ra $ 0 \<noteq> 0" by simp |
|
1704 |
from fps_inverse_unique[OF ra0 th3] have ?thesis by simp} |
|
1705 |
ultimately show ?thesis by (cases k, auto) |
|
1706 |
qed |
|
1707 |
||
1708 |
lemma fps_divide_inverse: "(a::('a::field) fps) / b = a * inverse b" |
|
1709 |
by (simp add: fps_divide_def) |
|
1710 |
||
1711 |
lemma radical_divide: |
|
1712 |
fixes a:: "'a ::{field, ring_char_0, recpower} fps" |
|
30488 | 1713 |
assumes |
1714 |
ra0: "r k (a $ 0) ^ k = a $ 0" |
|
29687 | 1715 |
and rb0: "r k (b $ 0) ^ k = b $ 0" |
1716 |
and r1: "r k 1 = 1" |
|
30488 | 1717 |
and rb0': "r k (inverse (b $ 0)) = inverse (r k (b $ 0))" |
29687 | 1718 |
and raib': "r k (a$0 / (b$0)) = r k (a$0) / r k (b$0)" |
30488 | 1719 |
and a0: "a$0 \<noteq> 0" |
29687 | 1720 |
and b0: "b$0 \<noteq> 0" |
1721 |
shows "fps_radical r k (a/b) = fps_radical r k a / fps_radical r k b" |
|
1722 |
proof- |
|
1723 |
from raib' |
|
1724 |
have raib: "r k (a$0 / (b$0)) = r k (a$0) * r k (inverse (b$0))" |
|
1725 |
by (simp add: divide_inverse rb0'[symmetric]) |
|
1726 |
||
1727 |
{assume "k=0" hence ?thesis by (simp add: fps_divide_def)} |
|
1728 |
moreover |
|
1729 |
{assume k0: "k\<noteq> 0" |
|
1730 |
from b0 k0 rb0 have rbn0: "r k (b $0) \<noteq> 0" |
|
1731 |
by (auto simp add: power_0_left) |
|
30488 | 1732 |
|
29687 | 1733 |
from rb0 rb0' have rib0: "(r k (inverse (b $ 0)))^k = inverse (b$0)" |
1734 |
by (simp add: nonzero_power_inverse[OF rbn0, symmetric]) |
|
1735 |
from rib0 have th0: "r k (inverse b $ 0) ^ k = inverse b $ 0" |
|
1736 |
by (simp add:fps_inverse_def b0) |
|
30488 | 1737 |
from raib |
29687 | 1738 |
have th1: "r k ((a * inverse b) $ 0) = r k (a $ 0) * r k (inverse b $ 0)" |
1739 |
by (simp add: divide_inverse fps_inverse_def b0 fps_mult_nth) |
|
1740 |
from nonzero_imp_inverse_nonzero[OF b0] b0 have th2: "inverse b $ 0 \<noteq> 0" |
|
1741 |
by (simp add: fps_inverse_def) |
|
1742 |
from radical_mult_distrib[of r k a "inverse b", OF ra0 th0 th1 a0 th2] |
|
1743 |
have th: "fps_radical r k (a/b) = fps_radical r k a * fps_radical r k (inverse b)" |
|
1744 |
by (simp add: fps_divide_def) |
|
1745 |
with radical_inverse[of r k b, OF rb0 rb0' r1 b0] |
|
1746 |
have ?thesis by (simp add: fps_divide_def)} |
|
1747 |
ultimately show ?thesis by blast |
|
1748 |
qed |
|
1749 |
||
29906 | 1750 |
subsection{* Derivative of composition *} |
29687 | 1751 |
|
30488 | 1752 |
lemma fps_compose_deriv: |
29687 | 1753 |
fixes a:: "('a::idom) fps" |
1754 |
assumes b0: "b$0 = 0" |
|
1755 |
shows "fps_deriv (a oo b) = ((fps_deriv a) oo b) * (fps_deriv b)" |
|
1756 |
proof- |
|
1757 |
{fix n |
|
1758 |
have "(fps_deriv (a oo b))$n = setsum (\<lambda>i. a $ i * (fps_deriv (b^i))$n) {0.. Suc n}" |
|
1759 |
by (simp add: fps_compose_def ring_simps setsum_right_distrib del: of_nat_Suc) |
|
1760 |
also have "\<dots> = setsum (\<lambda>i. a$i * ((fps_const (of_nat i)) * (fps_deriv b * (b^(i - 1))))$n) {0.. Suc n}" |
|
1761 |
by (simp add: ring_simps fps_deriv_power del: fps_mult_left_const_nth of_nat_Suc) |
|
1762 |
also have "\<dots> = setsum (\<lambda>i. of_nat i * a$i * (((b^(i - 1)) * fps_deriv b))$n) {0.. Suc n}" |
|
1763 |
unfolding fps_mult_left_const_nth by (simp add: ring_simps) |
|
1764 |
also have "\<dots> = setsum (\<lambda>i. of_nat i * a$i * (setsum (\<lambda>j. (b^ (i - 1))$j * (fps_deriv b)$(n - j)) {0..n})) {0.. Suc n}" |
|
1765 |
unfolding fps_mult_nth .. |
|
1766 |
also have "\<dots> = setsum (\<lambda>i. of_nat i * a$i * (setsum (\<lambda>j. (b^ (i - 1))$j * (fps_deriv b)$(n - j)) {0..n})) {1.. Suc n}" |
|
1767 |
apply (rule setsum_mono_zero_right) |
|
29913 | 1768 |
apply (auto simp add: mult_delta_left setsum_delta not_le) |
1769 |
done |
|
29687 | 1770 |
also have "\<dots> = setsum (\<lambda>i. of_nat (i + 1) * a$(i+1) * (setsum (\<lambda>j. (b^ i)$j * of_nat (n - j + 1) * b$(n - j + 1)) {0..n})) {0.. n}" |
1771 |
unfolding fps_deriv_nth |
|
1772 |
apply (rule setsum_reindex_cong[where f="Suc"]) |
|
1773 |
by (auto simp add: mult_assoc) |
|
1774 |
finally have th0: "(fps_deriv (a oo b))$n = setsum (\<lambda>i. of_nat (i + 1) * a$(i+1) * (setsum (\<lambda>j. (b^ i)$j * of_nat (n - j + 1) * b$(n - j + 1)) {0..n})) {0.. n}" . |
|
30488 | 1775 |
|
29687 | 1776 |
have "(((fps_deriv a) oo b) * (fps_deriv b))$n = setsum (\<lambda>i. (fps_deriv b)$ (n - i) * ((fps_deriv a) oo b)$i) {0..n}" |
1777 |
unfolding fps_mult_nth by (simp add: mult_ac) |
|
1778 |
also have "\<dots> = setsum (\<lambda>i. setsum (\<lambda>j. of_nat (n - i +1) * b$(n - i + 1) * of_nat (j + 1) * a$(j+1) * (b^j)$i) {0..n}) {0..n}" |
|
1779 |
unfolding fps_deriv_nth fps_compose_nth setsum_right_distrib mult_assoc |
|
1780 |
apply (rule setsum_cong2) |
|
1781 |
apply (rule setsum_mono_zero_left) |
|
1782 |
apply (simp_all add: subset_eq) |
|
1783 |
apply clarify |
|
1784 |
apply (subgoal_tac "b^i$x = 0") |
|
1785 |
apply simp |
|
1786 |
apply (rule startsby_zero_power_prefix[OF b0, rule_format]) |
|
1787 |
by simp |
|
1788 |
also have "\<dots> = setsum (\<lambda>i. of_nat (i + 1) * a$(i+1) * (setsum (\<lambda>j. (b^ i)$j * of_nat (n - j + 1) * b$(n - j + 1)) {0..n})) {0.. n}" |
|
1789 |
unfolding setsum_right_distrib |
|
1790 |
apply (subst setsum_commute) |
|
1791 |
by ((rule setsum_cong2)+) simp |
|
1792 |
finally have "(fps_deriv (a oo b))$n = (((fps_deriv a) oo b) * (fps_deriv b)) $n" |
|
1793 |
unfolding th0 by simp} |
|
1794 |
then show ?thesis by (simp add: fps_eq_iff) |
|
1795 |
qed |
|
1796 |
||
1797 |
lemma fps_mult_X_plus_1_nth: |
|
1798 |
"((1+X)*a) $n = (if n = 0 then (a$n :: 'a::comm_ring_1) else a$n + a$(n - 1))" |
|
1799 |
proof- |
|
1800 |
{assume "n = 0" hence ?thesis by (simp add: fps_mult_nth )} |
|
1801 |
moreover |
|
1802 |
{fix m assume m: "n = Suc m" |
|
1803 |
have "((1+X)*a) $n = setsum (\<lambda>i. (1+X)$i * a$(n-i)) {0..n}" |
|
1804 |
by (simp add: fps_mult_nth) |
|
1805 |
also have "\<dots> = setsum (\<lambda>i. (1+X)$i * a$(n-i)) {0.. 1}" |
|
1806 |
unfolding m |
|
1807 |
apply (rule setsum_mono_zero_right) |
|
1808 |
by (auto simp add: ) |
|
1809 |
also have "\<dots> = (if n = 0 then (a$n :: 'a::comm_ring_1) else a$n + a$(n - 1))" |
|
1810 |
unfolding m |
|
1811 |
by (simp add: ) |
|
1812 |
finally have ?thesis .} |
|
1813 |
ultimately show ?thesis by (cases n, auto) |
|
1814 |
qed |
|
1815 |
||
29906 | 1816 |
subsection{* Finite FPS (i.e. polynomials) and X *} |
29687 | 1817 |
lemma fps_poly_sum_X: |
30488 | 1818 |
assumes z: "\<forall>i > n. a$i = (0::'a::comm_ring_1)" |
29687 | 1819 |
shows "a = setsum (\<lambda>i. fps_const (a$i) * X^i) {0..n}" (is "a = ?r") |
1820 |
proof- |
|
1821 |
{fix i |
|
30488 | 1822 |
have "a$i = ?r$i" |
29687 | 1823 |
unfolding fps_setsum_nth fps_mult_left_const_nth X_power_nth |
29913 | 1824 |
by (simp add: mult_delta_right setsum_delta' z) |
1825 |
} |
|
29687 | 1826 |
then show ?thesis unfolding fps_eq_iff by blast |
1827 |
qed |
|
1828 |
||
29906 | 1829 |
subsection{* Compositional inverses *} |
29687 | 1830 |
|
1831 |
||
1832 |
fun compinv :: "'a fps \<Rightarrow> nat \<Rightarrow> 'a::{recpower,field}" where |
|
1833 |
"compinv a 0 = X$0" |
|
1834 |
| "compinv a (Suc n) = (X$ Suc n - setsum (\<lambda>i. (compinv a i) * (a^i)$Suc n) {0 .. n}) / (a$1) ^ Suc n" |
|
1835 |
||
1836 |
definition "fps_inv a = Abs_fps (compinv a)" |
|
1837 |
||
1838 |
lemma fps_inv: assumes a0: "a$0 = 0" and a1: "a$1 \<noteq> 0" |
|
1839 |
shows "fps_inv a oo a = X" |
|
1840 |
proof- |
|
1841 |
let ?i = "fps_inv a oo a" |
|
1842 |
{fix n |
|
30488 | 1843 |
have "?i $n = X$n" |
29687 | 1844 |
proof(induct n rule: nat_less_induct) |
1845 |
fix n assume h: "\<forall>m<n. ?i$m = X$m" |
|
30488 | 1846 |
{assume "n=0" hence "?i $n = X$n" using a0 |
29687 | 1847 |
by (simp add: fps_compose_nth fps_inv_def)} |
1848 |
moreover |
|
1849 |
{fix n1 assume n1: "n = Suc n1" |
|
1850 |
have "?i $ n = setsum (\<lambda>i. (fps_inv a $ i) * (a^i)$n) {0 .. n1} + fps_inv a $ Suc n1 * (a $ 1)^ Suc n1" |
|
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1851 |
by (simp add: fps_compose_nth n1 startsby_zero_power_nth_same[OF a0] |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1852 |
del: power_Suc) |
29687 | 1853 |
also have "\<dots> = setsum (\<lambda>i. (fps_inv a $ i) * (a^i)$n) {0 .. n1} + (X$ Suc n1 - setsum (\<lambda>i. (fps_inv a $ i) * (a^i)$n) {0 .. n1})" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
1854 |
using a0 a1 n1 by (simp add: fps_inv_def) |
30488 | 1855 |
also have "\<dots> = X$n" using n1 by simp |
29687 | 1856 |
finally have "?i $ n = X$n" .} |
1857 |
ultimately show "?i $ n = X$n" by (cases n, auto) |
|
1858 |
qed} |
|
1859 |
then show ?thesis by (simp add: fps_eq_iff) |
|
1860 |
qed |
|
1861 |
||
1862 |
||
1863 |
fun gcompinv :: "'a fps \<Rightarrow> 'a fps \<Rightarrow> nat \<Rightarrow> 'a::{recpower,field}" where |
|
1864 |
"gcompinv b a 0 = b$0" |
|
1865 |
| "gcompinv b a (Suc n) = (b$ Suc n - setsum (\<lambda>i. (gcompinv b a i) * (a^i)$Suc n) {0 .. n}) / (a$1) ^ Suc n" |
|
1866 |
||
1867 |
definition "fps_ginv b a = Abs_fps (gcompinv b a)" |
|
1868 |
||
1869 |
lemma fps_ginv: assumes a0: "a$0 = 0" and a1: "a$1 \<noteq> 0" |
|
1870 |
shows "fps_ginv b a oo a = b" |
|
1871 |
proof- |
|
1872 |
let ?i = "fps_ginv b a oo a" |
|
1873 |
{fix n |
|
30488 | 1874 |
have "?i $n = b$n" |
29687 | 1875 |
proof(induct n rule: nat_less_induct) |
1876 |
fix n assume h: "\<forall>m<n. ?i$m = b$m" |
|
30488 | 1877 |
{assume "n=0" hence "?i $n = b$n" using a0 |
29687 | 1878 |
by (simp add: fps_compose_nth fps_ginv_def)} |
1879 |
moreover |
|
1880 |
{fix n1 assume n1: "n = Suc n1" |
|
1881 |
have "?i $ n = setsum (\<lambda>i. (fps_ginv b a $ i) * (a^i)$n) {0 .. n1} + fps_ginv b a $ Suc n1 * (a $ 1)^ Suc n1" |
|
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1882 |
by (simp add: fps_compose_nth n1 startsby_zero_power_nth_same[OF a0] |
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
1883 |
del: power_Suc) |
29687 | 1884 |
also have "\<dots> = setsum (\<lambda>i. (fps_ginv b a $ i) * (a^i)$n) {0 .. n1} + (b$ Suc n1 - setsum (\<lambda>i. (fps_ginv b a $ i) * (a^i)$n) {0 .. n1})" |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
1885 |
using a0 a1 n1 by (simp add: fps_ginv_def) |
30488 | 1886 |
also have "\<dots> = b$n" using n1 by simp |
29687 | 1887 |
finally have "?i $ n = b$n" .} |
1888 |
ultimately show "?i $ n = b$n" by (cases n, auto) |
|
1889 |
qed} |
|
1890 |
then show ?thesis by (simp add: fps_eq_iff) |
|
1891 |
qed |
|
1892 |
||
1893 |
lemma fps_inv_ginv: "fps_inv = fps_ginv X" |
|
1894 |
apply (auto simp add: expand_fun_eq fps_eq_iff fps_inv_def fps_ginv_def) |
|
1895 |
apply (induct_tac n rule: nat_less_induct, auto) |
|
1896 |
apply (case_tac na) |
|
1897 |
apply simp |
|
1898 |
apply simp |
|
1899 |
done |
|
1900 |
||
1901 |
lemma fps_compose_1[simp]: "1 oo a = 1" |
|
29913 | 1902 |
by (simp add: fps_eq_iff fps_compose_nth fps_power_def mult_delta_left setsum_delta) |
29687 | 1903 |
|
1904 |
lemma fps_compose_0[simp]: "0 oo a = 0" |
|
29913 | 1905 |
by (simp add: fps_eq_iff fps_compose_nth) |
29687 | 1906 |
|
1907 |
lemma fps_pow_0: "fps_pow n 0 = (if n = 0 then 1 else 0)" |
|
1908 |
by (induct n, simp_all) |
|
1909 |
||
1910 |
lemma fps_compose_0_right[simp]: "a oo 0 = fps_const (a$0)" |
|
29913 | 1911 |
by (auto simp add: fps_eq_iff fps_compose_nth fps_power_def fps_pow_0 setsum_0') |
29687 | 1912 |
|
1913 |
lemma fps_compose_add_distrib: "(a + b) oo c = (a oo c) + (b oo c)" |
|
1914 |
by (simp add: fps_eq_iff fps_compose_nth ring_simps setsum_addf) |
|
1915 |
||
1916 |
lemma fps_compose_setsum_distrib: "(setsum f S) oo a = setsum (\<lambda>i. f i oo a) S" |
|
1917 |
proof- |
|
1918 |
{assume "\<not> finite S" hence ?thesis by simp} |
|
1919 |
moreover |
|
1920 |
{assume fS: "finite S" |
|
1921 |
have ?thesis |
|
1922 |
proof(rule finite_induct[OF fS]) |
|
1923 |
show "setsum f {} oo a = (\<Sum>i\<in>{}. f i oo a)" by simp |
|
1924 |
next |
|
1925 |
fix x F assume fF: "finite F" and xF: "x \<notin> F" and h: "setsum f F oo a = setsum (\<lambda>i. f i oo a) F" |
|
1926 |
show "setsum f (insert x F) oo a = setsum (\<lambda>i. f i oo a) (insert x F)" |
|
1927 |
using fF xF h by (simp add: fps_compose_add_distrib) |
|
1928 |
qed} |
|
30488 | 1929 |
ultimately show ?thesis by blast |
29687 | 1930 |
qed |
1931 |
||
30488 | 1932 |
lemma convolution_eq: |
29687 | 1933 |
"setsum (%i. a (i :: nat) * b (n - i)) {0 .. n} = setsum (%(i,j). a i * b j) {(i,j). i <= n \<and> j \<le> n \<and> i + j = n}" |
1934 |
apply (rule setsum_reindex_cong[where f=fst]) |
|
1935 |
apply (clarsimp simp add: inj_on_def) |
|
1936 |
apply (auto simp add: expand_set_eq image_iff) |
|
1937 |
apply (rule_tac x= "x" in exI) |
|
1938 |
apply clarsimp |
|
1939 |
apply (rule_tac x="n - x" in exI) |
|
1940 |
apply arith |
|
1941 |
done |
|
1942 |
||
1943 |
lemma product_composition_lemma: |
|
1944 |
assumes c0: "c$0 = (0::'a::idom)" and d0: "d$0 = 0" |
|
1945 |
shows "((a oo c) * (b oo d))$n = setsum (%(k,m). a$k * b$m * (c^k * d^m) $ n) {(k,m). k + m \<le> n}" (is "?l = ?r") |
|
1946 |
proof- |
|
1947 |
let ?S = "{(k\<Colon>nat, m\<Colon>nat). k + m \<le> n}" |
|
30488 | 1948 |
have s: "?S \<subseteq> {0..n} <*> {0..n}" by (auto simp add: subset_eq) |
1949 |
have f: "finite {(k\<Colon>nat, m\<Colon>nat). k + m \<le> n}" |
|
29687 | 1950 |
apply (rule finite_subset[OF s]) |
1951 |
by auto |
|
1952 |
have "?r = setsum (%i. setsum (%(k,m). a$k * (c^k)$i * b$m * (d^m) $ (n - i)) {(k,m). k + m \<le> n}) {0..n}" |
|
1953 |
apply (simp add: fps_mult_nth setsum_right_distrib) |
|
1954 |
apply (subst setsum_commute) |
|
1955 |
apply (rule setsum_cong2) |
|
1956 |
by (auto simp add: ring_simps) |
|
30488 | 1957 |
also have "\<dots> = ?l" |
29687 | 1958 |
apply (simp add: fps_mult_nth fps_compose_nth setsum_product) |
1959 |
apply (rule setsum_cong2) |
|
1960 |
apply (simp add: setsum_cartesian_product mult_assoc) |
|
1961 |
apply (rule setsum_mono_zero_right[OF f]) |
|
1962 |
apply (simp add: subset_eq) apply presburger |
|
1963 |
apply clarsimp |
|
1964 |
apply (rule ccontr) |
|
1965 |
apply (clarsimp simp add: not_le) |
|
1966 |
apply (case_tac "x < aa") |
|
1967 |
apply simp |
|
1968 |
apply (frule_tac startsby_zero_power_prefix[rule_format, OF c0]) |
|
1969 |
apply blast |
|
1970 |
apply simp |
|
1971 |
apply (frule_tac startsby_zero_power_prefix[rule_format, OF d0]) |
|
1972 |
apply blast |
|
1973 |
done |
|
1974 |
finally show ?thesis by simp |
|
1975 |
qed |
|
1976 |
||
1977 |
lemma product_composition_lemma': |
|
1978 |
assumes c0: "c$0 = (0::'a::idom)" and d0: "d$0 = 0" |
|
1979 |
shows "((a oo c) * (b oo d))$n = setsum (%k. setsum (%m. a$k * b$m * (c^k * d^m) $ n) {0..n}) {0..n}" (is "?l = ?r") |
|
1980 |
unfolding product_composition_lemma[OF c0 d0] |
|
1981 |
unfolding setsum_cartesian_product |
|
1982 |
apply (rule setsum_mono_zero_left) |
|
1983 |
apply simp |
|
1984 |
apply (clarsimp simp add: subset_eq) |
|
1985 |
apply clarsimp |
|
1986 |
apply (rule ccontr) |
|
1987 |
apply (subgoal_tac "(c^aa * d^ba) $ n = 0") |
|
1988 |
apply simp |
|
1989 |
unfolding fps_mult_nth |
|
1990 |
apply (rule setsum_0') |
|
1991 |
apply (clarsimp simp add: not_le) |
|
1992 |
apply (case_tac "aaa < aa") |
|
1993 |
apply (rule startsby_zero_power_prefix[OF c0, rule_format]) |
|
1994 |
apply simp |
|
1995 |
apply (subgoal_tac "n - aaa < ba") |
|
1996 |
apply (frule_tac k = "ba" in startsby_zero_power_prefix[OF d0, rule_format]) |
|
1997 |
apply simp |
|
1998 |
apply arith |
|
1999 |
done |
|
30488 | 2000 |
|
29687 | 2001 |
|
30488 | 2002 |
lemma setsum_pair_less_iff: |
29687 | 2003 |
"setsum (%((k::nat),m). a k * b m * c (k + m)) {(k,m). k + m \<le> n} = setsum (%s. setsum (%i. a i * b (s - i) * c s) {0..s}) {0..n}" (is "?l = ?r") |
2004 |
proof- |
|
2005 |
let ?KM= "{(k,m). k + m \<le> n}" |
|
2006 |
let ?f = "%s. UNION {(0::nat)..s} (%i. {(i,s - i)})" |
|
2007 |
have th0: "?KM = UNION {0..n} ?f" |
|
2008 |
apply (simp add: expand_set_eq) |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
2009 |
apply arith (* FIXME: VERY slow! *) |
29687 | 2010 |
done |
2011 |
show "?l = ?r " |
|
2012 |
unfolding th0 |
|
2013 |
apply (subst setsum_UN_disjoint) |
|
2014 |
apply auto |
|
2015 |
apply (subst setsum_UN_disjoint) |
|
2016 |
apply auto |
|
2017 |
done |
|
2018 |
qed |
|
2019 |
||
2020 |
lemma fps_compose_mult_distrib_lemma: |
|
2021 |
assumes c0: "c$0 = (0::'a::idom)" |
|
2022 |
shows "((a oo c) * (b oo c))$n = setsum (%s. setsum (%i. a$i * b$(s - i) * (c^s) $ n) {0..s}) {0..n}" (is "?l = ?r") |
|
2023 |
unfolding product_composition_lemma[OF c0 c0] power_add[symmetric] |
|
2024 |
unfolding setsum_pair_less_iff[where a = "%k. a$k" and b="%m. b$m" and c="%s. (c ^ s)$n" and n = n] .. |
|
2025 |
||
2026 |
||
30488 | 2027 |
lemma fps_compose_mult_distrib: |
29687 | 2028 |
assumes c0: "c$0 = (0::'a::idom)" |
2029 |
shows "(a * b) oo c = (a oo c) * (b oo c)" (is "?l = ?r") |
|
2030 |
apply (simp add: fps_eq_iff fps_compose_mult_distrib_lemma[OF c0]) |
|
2031 |
by (simp add: fps_compose_nth fps_mult_nth setsum_left_distrib) |
|
30488 | 2032 |
lemma fps_compose_setprod_distrib: |
29687 | 2033 |
assumes c0: "c$0 = (0::'a::idom)" |
2034 |
shows "(setprod a S) oo c = setprod (%k. a k oo c) S" (is "?l = ?r") |
|
2035 |
apply (cases "finite S") |
|
2036 |
apply simp_all |
|
2037 |
apply (induct S rule: finite_induct) |
|
2038 |
apply simp |
|
2039 |
apply (simp add: fps_compose_mult_distrib[OF c0]) |
|
2040 |
done |
|
2041 |
||
2042 |
lemma fps_compose_power: assumes c0: "c$0 = (0::'a::idom)" |
|
2043 |
shows "(a oo c)^n = a^n oo c" (is "?l = ?r") |
|
2044 |
proof- |
|
2045 |
{assume "n=0" then have ?thesis by simp} |
|
2046 |
moreover |
|
2047 |
{fix m assume m: "n = Suc m" |
|
2048 |
have th0: "a^n = setprod (%k. a) {0..m}" "(a oo c) ^ n = setprod (%k. a oo c) {0..m}" |
|
2049 |
by (simp_all add: setprod_constant m) |
|
2050 |
then have ?thesis |
|
2051 |
by (simp add: fps_compose_setprod_distrib[OF c0])} |
|
2052 |
ultimately show ?thesis by (cases n, auto) |
|
2053 |
qed |
|
2054 |
||
2055 |
lemma fps_const_mult_apply_left: |
|
2056 |
"fps_const c * (a oo b) = (fps_const c * a) oo b" |
|
2057 |
by (simp add: fps_eq_iff fps_compose_nth setsum_right_distrib mult_assoc) |
|
2058 |
||
2059 |
lemma fps_const_mult_apply_right: |
|
2060 |
"(a oo b) * fps_const (c::'a::comm_semiring_1) = (fps_const c * a) oo b" |
|
2061 |
by (auto simp add: fps_const_mult_apply_left mult_commute) |
|
2062 |
||
30488 | 2063 |
lemma fps_compose_assoc: |
29687 | 2064 |
assumes c0: "c$0 = (0::'a::idom)" and b0: "b$0 = 0" |
2065 |
shows "a oo (b oo c) = a oo b oo c" (is "?l = ?r") |
|
2066 |
proof- |
|
2067 |
{fix n |
|
2068 |
have "?l$n = (setsum (\<lambda>i. (fps_const (a$i) * b^i) oo c) {0..n})$n" |
|
2069 |
by (simp add: fps_compose_nth fps_compose_power[OF c0] fps_const_mult_apply_left setsum_right_distrib mult_assoc fps_setsum_nth) |
|
2070 |
also have "\<dots> = ((setsum (\<lambda>i. fps_const (a$i) * b^i) {0..n}) oo c)$n" |
|
2071 |
by (simp add: fps_compose_setsum_distrib) |
|
2072 |
also have "\<dots> = ?r$n" |
|
2073 |
apply (simp add: fps_compose_nth fps_setsum_nth setsum_left_distrib mult_assoc) |
|
2074 |
apply (rule setsum_cong2) |
|
2075 |
apply (rule setsum_mono_zero_right) |
|
2076 |
apply (auto simp add: not_le) |
|
2077 |
by (erule startsby_zero_power_prefix[OF b0, rule_format]) |
|
2078 |
finally have "?l$n = ?r$n" .} |
|
2079 |
then show ?thesis by (simp add: fps_eq_iff) |
|
2080 |
qed |
|
2081 |
||
2082 |
||
2083 |
lemma fps_X_power_compose: |
|
2084 |
assumes a0: "a$0=0" shows "X^k oo a = (a::('a::idom fps))^k" (is "?l = ?r") |
|
2085 |
proof- |
|
2086 |
{assume "k=0" hence ?thesis by simp} |
|
2087 |
moreover |
|
2088 |
{fix h assume h: "k = Suc h" |
|
2089 |
{fix n |
|
30488 | 2090 |
{assume kn: "k>n" hence "?l $ n = ?r $n" using a0 startsby_zero_power_prefix[OF a0] h |
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
2091 |
by (simp add: fps_compose_nth del: power_Suc)} |
29687 | 2092 |
moreover |
2093 |
{assume kn: "k \<le> n" |
|
29913 | 2094 |
hence "?l$n = ?r$n" |
2095 |
by (simp add: fps_compose_nth mult_delta_left setsum_delta)} |
|
29687 | 2096 |
moreover have "k >n \<or> k\<le> n" by arith |
2097 |
ultimately have "?l$n = ?r$n" by blast} |
|
2098 |
then have ?thesis unfolding fps_eq_iff by blast} |
|
2099 |
ultimately show ?thesis by (cases k, auto) |
|
2100 |
qed |
|
2101 |
||
2102 |
lemma fps_inv_right: assumes a0: "a$0 = 0" and a1: "a$1 \<noteq> 0" |
|
2103 |
shows "a oo fps_inv a = X" |
|
2104 |
proof- |
|
2105 |
let ?ia = "fps_inv a" |
|
2106 |
let ?iaa = "a oo fps_inv a" |
|
2107 |
have th0: "?ia $ 0 = 0" by (simp add: fps_inv_def) |
|
30488 | 2108 |
have th1: "?iaa $ 0 = 0" using a0 a1 |
29687 | 2109 |
by (simp add: fps_inv_def fps_compose_nth) |
2110 |
have th2: "X$0 = 0" by simp |
|
2111 |
from fps_inv[OF a0 a1] have "a oo (fps_inv a oo a) = a oo X" by simp |
|
2112 |
then have "(a oo fps_inv a) oo a = X oo a" |
|
2113 |
by (simp add: fps_compose_assoc[OF a0 th0] X_fps_compose_startby0[OF a0]) |
|
2114 |
with fps_compose_inj_right[OF a0 a1] |
|
30488 | 2115 |
show ?thesis by simp |
29687 | 2116 |
qed |
2117 |
||
2118 |
lemma fps_inv_deriv: |
|
2119 |
assumes a0:"a$0 = (0::'a::{recpower,field})" and a1: "a$1 \<noteq> 0" |
|
2120 |
shows "fps_deriv (fps_inv a) = inverse (fps_deriv a oo fps_inv a)" |
|
2121 |
proof- |
|
2122 |
let ?ia = "fps_inv a" |
|
2123 |
let ?d = "fps_deriv a oo ?ia" |
|
2124 |
let ?dia = "fps_deriv ?ia" |
|
2125 |
have ia0: "?ia$0 = 0" by (simp add: fps_inv_def) |
|
2126 |
have th0: "?d$0 \<noteq> 0" using a1 by (simp add: fps_compose_nth fps_deriv_nth) |
|
2127 |
from fps_inv_right[OF a0 a1] have "?d * ?dia = 1" |
|
2128 |
by (simp add: fps_compose_deriv[OF ia0, of a, symmetric] ) |
|
2129 |
hence "inverse ?d * ?d * ?dia = inverse ?d * 1" by simp |
|
2130 |
with inverse_mult_eq_1[OF th0] |
|
2131 |
show "?dia = inverse ?d" by simp |
|
2132 |
qed |
|
2133 |
||
29906 | 2134 |
subsection{* Elementary series *} |
29687 | 2135 |
|
29906 | 2136 |
subsubsection{* Exponential series *} |
30488 | 2137 |
definition "E x = Abs_fps (\<lambda>n. x^n / of_nat (fact n))" |
29687 | 2138 |
|
2139 |
lemma E_deriv[simp]: "fps_deriv (E a) = fps_const (a::'a::{field, recpower, ring_char_0}) * E a" (is "?l = ?r") |
|
2140 |
proof- |
|
2141 |
{fix n |
|
2142 |
have "?l$n = ?r $ n" |
|
30273
ecd6f0ca62ea
declare power_Suc [simp]; remove redundant type-specific versions of power_Suc
huffman
parents:
29915
diff
changeset
|
2143 |
apply (auto simp add: E_def field_simps power_Suc[symmetric]simp del: fact_Suc of_nat_Suc power_Suc) |
29687 | 2144 |
by (simp add: of_nat_mult ring_simps)} |
2145 |
then show ?thesis by (simp add: fps_eq_iff) |
|
2146 |
qed |
|
2147 |
||
30488 | 2148 |
lemma E_unique_ODE: |
29687 | 2149 |
"fps_deriv a = fps_const c * a \<longleftrightarrow> a = fps_const (a$0) * E (c :: 'a::{field, ring_char_0, recpower})" |
2150 |
(is "?lhs \<longleftrightarrow> ?rhs") |
|
2151 |
proof- |
|
2152 |
{assume d: ?lhs |
|
30488 | 2153 |
from d have th: "\<And>n. a $ Suc n = c * a$n / of_nat (Suc n)" |
29687 | 2154 |
by (simp add: fps_deriv_def fps_eq_iff field_simps del: of_nat_Suc) |
2155 |
{fix n have "a$n = a$0 * c ^ n/ (of_nat (fact n))" |
|
2156 |
apply (induct n) |
|
2157 |
apply simp |
|
30488 | 2158 |
unfolding th |
29687 | 2159 |
using fact_gt_zero |
2160 |
apply (simp add: field_simps del: of_nat_Suc fact.simps) |
|
2161 |
apply (drule sym) |
|
2162 |
by (simp add: ring_simps of_nat_mult power_Suc)} |
|
2163 |
note th' = this |
|
30488 | 2164 |
have ?rhs |
29687 | 2165 |
by (auto simp add: fps_eq_iff fps_const_mult_left E_def intro : th')} |
2166 |
moreover |
|
2167 |
{assume h: ?rhs |
|
30488 | 2168 |
have ?lhs |
29687 | 2169 |
apply (subst h) |
2170 |
apply simp |
|
2171 |
apply (simp only: h[symmetric]) |
|
2172 |
by simp} |
|
2173 |
ultimately show ?thesis by blast |
|
2174 |
qed |
|
2175 |
||
2176 |
lemma E_add_mult: "E (a + b) = E (a::'a::{ring_char_0, field, recpower}) * E b" (is "?l = ?r") |
|
2177 |
proof- |
|
2178 |
have "fps_deriv (?r) = fps_const (a+b) * ?r" |
|
2179 |
by (simp add: fps_const_add[symmetric] ring_simps del: fps_const_add) |
|
2180 |
then have "?r = ?l" apply (simp only: E_unique_ODE) |
|
2181 |
by (simp add: fps_mult_nth E_def) |
|
2182 |
then show ?thesis .. |
|
2183 |
qed |
|
2184 |
||
2185 |
lemma E_nth[simp]: "E a $ n = a^n / of_nat (fact n)" |
|
2186 |
by (simp add: E_def) |
|
2187 |
||
2188 |
lemma E0[simp]: "E (0::'a::{field, recpower}) = 1" |
|
2189 |
by (simp add: fps_eq_iff power_0_left) |
|
2190 |
||
2191 |
lemma E_neg: "E (- a) = inverse (E (a::'a::{ring_char_0, field, recpower}))" |
|
2192 |
proof- |
|
2193 |
from E_add_mult[of a "- a"] have th0: "E a * E (- a) = 1" |
|
2194 |
by (simp ) |
|
2195 |
have th1: "E a $ 0 \<noteq> 0" by simp |
|
2196 |
from fps_inverse_unique[OF th1 th0] show ?thesis by simp |
|
2197 |
qed |
|
2198 |
||
30488 | 2199 |
lemma E_nth_deriv[simp]: "fps_nth_deriv n (E (a::'a::{field, recpower, ring_char_0})) = (fps_const a)^n * (E a)" |
29687 | 2200 |
by (induct n, auto simp add: power_Suc) |
2201 |
||
2202 |
lemma fps_compose_uminus: "- (a::'a::ring_1 fps) oo c = - (a oo c)" |
|
2203 |
by (simp add: fps_eq_iff fps_compose_nth ring_simps setsum_negf[symmetric]) |
|
2204 |
||
30488 | 2205 |
lemma fps_compose_sub_distrib: |
29687 | 2206 |
shows "(a - b) oo (c::'a::ring_1 fps) = (a oo c) - (b oo c)" |
2207 |
unfolding diff_minus fps_compose_uminus fps_compose_add_distrib .. |
|
2208 |
||
2209 |
lemma X_fps_compose:"X oo a = Abs_fps (\<lambda>n. if n = 0 then (0::'a::comm_ring_1) else a$n)" |
|
29913 | 2210 |
by (simp add: fps_eq_iff fps_compose_nth mult_delta_left setsum_delta power_Suc) |
29687 | 2211 |
|
2212 |
lemma X_compose_E[simp]: "X oo E (a::'a::{field, recpower}) = E a - 1" |
|
2213 |
by (simp add: fps_eq_iff X_fps_compose) |
|
2214 |
||
30488 | 2215 |
lemma LE_compose: |
2216 |
assumes a: "a\<noteq>0" |
|
29687 | 2217 |
shows "fps_inv (E a - 1) oo (E a - 1) = X" |
2218 |
and "(E a - 1) oo fps_inv (E a - 1) = X" |
|
2219 |
proof- |
|
2220 |
let ?b = "E a - 1" |
|
2221 |
have b0: "?b $ 0 = 0" by simp |
|
2222 |
have b1: "?b $ 1 \<noteq> 0" by (simp add: a) |
|
2223 |
from fps_inv[OF b0 b1] show "fps_inv (E a - 1) oo (E a - 1) = X" . |
|
2224 |
from fps_inv_right[OF b0 b1] show "(E a - 1) oo fps_inv (E a - 1) = X" . |
|
2225 |
qed |
|
2226 |
||
2227 |
||
30488 | 2228 |
lemma fps_const_inverse: |
29687 | 2229 |
"inverse (fps_const (a::'a::{field, division_by_zero})) = fps_const (inverse a)" |
2230 |
apply (auto simp add: fps_eq_iff fps_inverse_def) by (case_tac "n", auto) |
|
2231 |
||
2232 |
||
30488 | 2233 |
lemma inverse_one_plus_X: |
29687 | 2234 |
"inverse (1 + X) = Abs_fps (\<lambda>n. (- 1 ::'a::{field, recpower})^n)" |
2235 |
(is "inverse ?l = ?r") |
|
2236 |
proof- |
|
2237 |
have th: "?l * ?r = 1" |
|
2238 |
apply (auto simp add: ring_simps fps_eq_iff X_mult_nth minus_one_power_iff) |
|
2239 |
apply presburger+ |
|
2240 |
done |
|
2241 |
have th': "?l $ 0 \<noteq> 0" by (simp add: ) |
|
2242 |
from fps_inverse_unique[OF th' th] show ?thesis . |
|
2243 |
qed |
|
2244 |
||
2245 |
lemma E_power_mult: "(E (c::'a::{field,recpower,ring_char_0}))^n = E (of_nat n * c)" |
|
2246 |
by (induct n, auto simp add: ring_simps E_add_mult power_Suc) |
|
2247 |
||
30488 | 2248 |
subsubsection{* Logarithmic series *} |
2249 |
definition "(L::'a::{field, ring_char_0,recpower} fps) |
|
29687 | 2250 |
= Abs_fps (\<lambda>n. (- 1) ^ Suc n / of_nat n)" |
2251 |
||
2252 |
lemma fps_deriv_L: "fps_deriv L = inverse (1 + X)" |
|
2253 |
unfolding inverse_one_plus_X |
|
2254 |
by (simp add: L_def fps_eq_iff power_Suc del: of_nat_Suc) |
|
2255 |
||
2256 |
lemma L_nth: "L $ n = (- 1) ^ Suc n / of_nat n" |
|
2257 |
by (simp add: L_def) |
|
2258 |
||
2259 |
lemma L_E_inv: |
|
30488 | 2260 |
assumes a: "a\<noteq> (0::'a::{field,division_by_zero,ring_char_0,recpower})" |
29687 | 2261 |
shows "L = fps_const a * fps_inv (E a - 1)" (is "?l = ?r") |
2262 |
proof- |
|
2263 |
let ?b = "E a - 1" |
|
2264 |
have b0: "?b $ 0 = 0" by simp |
|
2265 |
have b1: "?b $ 1 \<noteq> 0" by (simp add: a) |
|
2266 |
have "fps_deriv (E a - 1) oo fps_inv (E a - 1) = (fps_const a * (E a - 1) + fps_const a) oo fps_inv (E a - 1)" |
|
2267 |
by (simp add: ring_simps) |
|
2268 |
also have "\<dots> = fps_const a * (X + 1)" apply (simp add: fps_compose_add_distrib fps_const_mult_apply_left[symmetric] fps_inv_right[OF b0 b1]) |
|
2269 |
by (simp add: ring_simps) |
|
2270 |
finally have eq: "fps_deriv (E a - 1) oo fps_inv (E a - 1) = fps_const a * (X + 1)" . |
|
2271 |
from fps_inv_deriv[OF b0 b1, unfolded eq] |
|
2272 |
have "fps_deriv (fps_inv ?b) = fps_const (inverse a) / (X + 1)" |
|
2273 |
by (simp add: fps_const_inverse eq fps_divide_def fps_inverse_mult) |
|
2274 |
hence "fps_deriv (fps_const a * fps_inv ?b) = inverse (X + 1)" |
|
2275 |
using a by (simp add: fps_divide_def field_simps) |
|
30488 | 2276 |
hence "fps_deriv ?l = fps_deriv ?r" |
29687 | 2277 |
by (simp add: fps_deriv_L add_commute) |
2278 |
then show ?thesis unfolding fps_deriv_eq_iff |
|
2279 |
by (simp add: L_nth fps_inv_def) |
|
2280 |
qed |
|
2281 |
||
29906 | 2282 |
subsubsection{* Formal trigonometric functions *} |
29687 | 2283 |
|
30488 | 2284 |
definition "fps_sin (c::'a::{field, recpower, ring_char_0}) = |
29687 | 2285 |
Abs_fps (\<lambda>n. if even n then 0 else (- 1) ^((n - 1) div 2) * c^n /(of_nat (fact n)))" |
2286 |
||
2287 |
definition "fps_cos (c::'a::{field, recpower, ring_char_0}) = Abs_fps (\<lambda>n. if even n then (- 1) ^ (n div 2) * c^n / (of_nat (fact n)) else 0)" |
|
2288 |
||
30488 | 2289 |
lemma fps_sin_deriv: |
29687 | 2290 |
"fps_deriv (fps_sin c) = fps_const c * fps_cos c" |
2291 |
(is "?lhs = ?rhs") |
|
2292 |
proof- |
|
2293 |
{fix n::nat |
|
2294 |
{assume en: "even n" |
|
2295 |
have "?lhs$n = of_nat (n+1) * (fps_sin c $ (n+1))" by simp |
|
30488 | 2296 |
also have "\<dots> = of_nat (n+1) * ((- 1)^(n div 2) * c^Suc n / of_nat (fact (Suc n)))" |
29687 | 2297 |
using en by (simp add: fps_sin_def) |
2298 |
also have "\<dots> = (- 1)^(n div 2) * c^Suc n * (of_nat (n+1) / (of_nat (Suc n) * of_nat (fact n)))" |
|
2299 |
unfolding fact_Suc of_nat_mult |
|
2300 |
by (simp add: field_simps del: of_nat_add of_nat_Suc) |
|
2301 |
also have "\<dots> = (- 1)^(n div 2) *c^Suc n / of_nat (fact n)" |
|
2302 |
by (simp add: field_simps del: of_nat_add of_nat_Suc) |
|
30488 | 2303 |
finally have "?lhs $n = ?rhs$n" using en |
29687 | 2304 |
by (simp add: fps_cos_def ring_simps power_Suc )} |
30488 | 2305 |
then have "?lhs $ n = ?rhs $ n" |
29687 | 2306 |
by (cases "even n", simp_all add: fps_deriv_def fps_sin_def fps_cos_def) } |
2307 |
then show ?thesis by (auto simp add: fps_eq_iff) |
|
2308 |
qed |
|
2309 |
||
30488 | 2310 |
lemma fps_cos_deriv: |
29687 | 2311 |
"fps_deriv (fps_cos c) = fps_const (- c)* (fps_sin c)" |
2312 |
(is "?lhs = ?rhs") |
|
2313 |
proof- |
|
2314 |
have th0: "\<And>n. - ((- 1::'a) ^ n) = (- 1)^Suc n" by (simp add: power_Suc) |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
2315 |
have th1: "\<And>n. odd n\<Longrightarrow> Suc ((n - 1) div 2) = Suc n div 2" by presburger (* FIXME: VERY slow! *) |
29687 | 2316 |
{fix n::nat |
2317 |
{assume en: "odd n" |
|
2318 |
from en have n0: "n \<noteq>0 " by presburger |
|
2319 |
have "?lhs$n = of_nat (n+1) * (fps_cos c $ (n+1))" by simp |
|
30488 | 2320 |
also have "\<dots> = of_nat (n+1) * ((- 1)^((n + 1) div 2) * c^Suc n / of_nat (fact (Suc n)))" |
29687 | 2321 |
using en by (simp add: fps_cos_def) |
2322 |
also have "\<dots> = (- 1)^((n + 1) div 2)*c^Suc n * (of_nat (n+1) / (of_nat (Suc n) * of_nat (fact n)))" |
|
2323 |
unfolding fact_Suc of_nat_mult |
|
2324 |
by (simp add: field_simps del: of_nat_add of_nat_Suc) |
|
2325 |
also have "\<dots> = (- 1)^((n + 1) div 2) * c^Suc n / of_nat (fact n)" |
|
2326 |
by (simp add: field_simps del: of_nat_add of_nat_Suc) |
|
2327 |
also have "\<dots> = (- ((- 1)^((n - 1) div 2))) * c^Suc n / of_nat (fact n)" |
|
2328 |
unfolding th0 unfolding th1[OF en] by simp |
|
30488 | 2329 |
finally have "?lhs $n = ?rhs$n" using en |
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
2330 |
by (simp add: fps_sin_def ring_simps power_Suc)} |
30488 | 2331 |
then have "?lhs $ n = ?rhs $ n" |
2332 |
by (cases "even n", simp_all add: fps_deriv_def fps_sin_def |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
2333 |
fps_cos_def) } |
29687 | 2334 |
then show ?thesis by (auto simp add: fps_eq_iff) |
2335 |
qed |
|
2336 |
||
2337 |
lemma fps_sin_cos_sum_of_squares: |
|
2338 |
"fps_cos c ^ 2 + fps_sin c ^ 2 = 1" (is "?lhs = 1") |
|
2339 |
proof- |
|
2340 |
have "fps_deriv ?lhs = 0" |
|
2341 |
apply (simp add: fps_deriv_power fps_sin_deriv fps_cos_deriv power_Suc) |
|
2342 |
by (simp add: fps_power_def ring_simps fps_const_neg[symmetric] del: fps_const_neg) |
|
2343 |
then have "?lhs = fps_const (?lhs $ 0)" |
|
2344 |
unfolding fps_deriv_eq_0_iff . |
|
2345 |
also have "\<dots> = 1" |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
2346 |
by (auto simp add: fps_eq_iff fps_power_def numeral_2_eq_2 fps_mult_nth fps_cos_def fps_sin_def) |
29687 | 2347 |
finally show ?thesis . |
2348 |
qed |
|
2349 |
||
2350 |
definition "fps_tan c = fps_sin c / fps_cos c" |
|
2351 |
||
2352 |
lemma fps_tan_deriv: "fps_deriv(fps_tan c) = fps_const c/ (fps_cos c ^ 2)" |
|
2353 |
proof- |
|
2354 |
have th0: "fps_cos c $ 0 \<noteq> 0" by (simp add: fps_cos_def) |
|
30488 | 2355 |
show ?thesis |
29687 | 2356 |
using fps_sin_cos_sum_of_squares[of c] |
2357 |
apply (simp add: fps_tan_def fps_divide_deriv[OF th0] fps_sin_deriv fps_cos_deriv add: fps_const_neg[symmetric] ring_simps power2_eq_square del: fps_const_neg) |
|
2358 |
unfolding right_distrib[symmetric] |
|
2359 |
by simp |
|
2360 |
qed |
|
29911
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
2361 |
|
c790a70a3d19
declare fps_nth as a typedef morphism; clean up instance proofs
huffman
parents:
29906
diff
changeset
|
2362 |
end |