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