equal
deleted
inserted
replaced
494 apply (simp add: setsum_Un_disjoint[OF f d, unfolded eq[symmetric]] del: One_nat_def) |
494 apply (simp add: setsum_Un_disjoint[OF f d, unfolded eq[symmetric]] del: One_nat_def) |
495 unfolding th2 |
495 unfolding th2 |
496 by(simp add: setsum_delta) |
496 by(simp add: setsum_delta) |
497 qed |
497 qed |
498 |
498 |
499 subsection{* Formal Derivatives, and the McLaurin theorem around 0*} |
499 subsection{* Formal Derivatives, and the MacLaurin theorem around 0*} |
500 |
500 |
501 definition "fps_deriv f = Abs_fps (\<lambda>n. of_nat (n + 1) * f $ (n + 1))" |
501 definition "fps_deriv f = Abs_fps (\<lambda>n. of_nat (n + 1) * f $ (n + 1))" |
502 |
502 |
503 lemma fps_deriv_nth[simp]: "fps_deriv f $ n = of_nat (n +1) * f $ (n+1)" by (simp add: fps_deriv_def) |
503 lemma fps_deriv_nth[simp]: "fps_deriv f $ n = of_nat (n +1) * f $ (n+1)" by (simp add: fps_deriv_def) |
504 |
504 |
693 {assume "a + b = 0" hence "a + b - b = -b" by simp |
693 {assume "a + b = 0" hence "a + b - b = -b" by simp |
694 hence "a = -b" by simp} |
694 hence "a = -b" by simp} |
695 ultimately show ?thesis by blast |
695 ultimately show ?thesis by blast |
696 qed |
696 qed |
697 |
697 |
698 lemma fps_sqrare_eq_iff: "(a:: 'a::idom fps)^ 2 = b^2 \<longleftrightarrow> (a = b \<or> a = -b)" |
698 lemma fps_square_eq_iff: "(a:: 'a::idom fps)^ 2 = b^2 \<longleftrightarrow> (a = b \<or> a = -b)" |
699 proof- |
699 proof- |
700 {assume "a = b \<or> a = -b" hence "a^2 = b^2" by auto} |
700 {assume "a = b \<or> a = -b" hence "a^2 = b^2" by auto} |
701 moreover |
701 moreover |
702 {assume "a^2 = b^2 " |
702 {assume "a^2 = b^2 " |
703 hence "a^2 - b^2 = 0" by simp |
703 hence "a^2 - b^2 = 0" by simp |