neuper@42376
|
1 |
(* Partial_Fractions
|
jan@42344
|
2 |
author: Jan Rocnik, isac team
|
jan@42344
|
3 |
Copyright (c) isac team 2011
|
jan@42344
|
4 |
Use is subject to license terms.
|
jan@42344
|
5 |
|
jan@42344
|
6 |
1234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890
|
jan@42344
|
7 |
10 20 30 40 50 60 70 80 90 100
|
jan@42344
|
8 |
*)
|
neuper@42376
|
9 |
header {* Partial Fraction Decomposition *}
|
jan@42344
|
10 |
|
neuper@42289
|
11 |
|
neuper@42376
|
12 |
theory Partial_Fractions imports RootRatEq begin
|
jan@42353
|
13 |
|
jan@42353
|
14 |
ML{*
|
neuper@42376
|
15 |
(*
|
jan@42353
|
16 |
signature PARTFRAC =
|
jan@42353
|
17 |
sig
|
jan@42353
|
18 |
val ansatz_rls : rls
|
jan@42353
|
19 |
val ansatz_rls_ : theory -> term -> (term * term list) option
|
jan@42353
|
20 |
end
|
neuper@42376
|
21 |
*)
|
jan@42353
|
22 |
*}
|
jan@42353
|
23 |
|
neuper@42376
|
24 |
subsection {* eval_ functions *}
|
jan@42344
|
25 |
consts
|
neuper@42359
|
26 |
factors_from_solution :: "bool list => real"
|
neuper@42359
|
27 |
drop_questionmarks :: "'a => 'a"
|
jan@42344
|
28 |
|
neuper@42376
|
29 |
text {* these might be used for variants of fac_from_sol *}
|
neuper@42289
|
30 |
ML {*
|
jan@42344
|
31 |
fun mk_minus_1 T = Free("-1", T); (*TODO DELETE WITH numbers_to_string*)
|
jan@42344
|
32 |
fun flip_sign t = (*TODO improve for use in factors_from_solution: -(-1) etc*)
|
jan@42344
|
33 |
let val minus_1 = t |> type_of |> mk_minus_1
|
jan@42344
|
34 |
in HOLogic.mk_binop "Groups.times_class.times" (minus_1, t) end;
|
neuper@42376
|
35 |
*}
|
neuper@42376
|
36 |
|
neuper@42376
|
37 |
text {* from solutions (e.g. [z = 1, z = -2]) make linear factors (e.g. (z - 1)*(z - -2)) *}
|
neuper@42376
|
38 |
ML {*
|
jan@42344
|
39 |
fun fac_from_sol s =
|
jan@42344
|
40 |
let val (lhs, rhs) = HOLogic.dest_eq s
|
jan@42367
|
41 |
in HOLogic.mk_binop "Groups.minus_class.minus" (lhs, rhs) end;
|
jan@42344
|
42 |
|
jan@42344
|
43 |
fun mk_prod prod [] =
|
jan@42344
|
44 |
if prod = e_term then error "mk_prod called with []" else prod
|
jan@42344
|
45 |
| mk_prod prod (t :: []) =
|
jan@42344
|
46 |
if prod = e_term then t else HOLogic.mk_binop "Groups.times_class.times" (prod, t)
|
jan@42344
|
47 |
| mk_prod prod (t1 :: t2 :: ts) =
|
jan@42344
|
48 |
if prod = e_term
|
jan@42344
|
49 |
then
|
jan@42344
|
50 |
let val p = HOLogic.mk_binop "Groups.times_class.times" (t1, t2)
|
jan@42344
|
51 |
in mk_prod p ts end
|
jan@42344
|
52 |
else
|
jan@42344
|
53 |
let val p = HOLogic.mk_binop "Groups.times_class.times" (prod, t1)
|
jan@42344
|
54 |
in mk_prod p (t2 :: ts) end
|
jan@42344
|
55 |
|
jan@42344
|
56 |
fun factors_from_solution sol =
|
jan@42344
|
57 |
let val ts = HOLogic.dest_list sol
|
jan@42344
|
58 |
in mk_prod e_term (map fac_from_sol ts) end;
|
jan@42344
|
59 |
|
neuper@42376
|
60 |
(*("factors_from_solution", ("Partial_Fractions.factors_from_solution",
|
neuper@42376
|
61 |
eval_factors_from_solution ""))*)
|
jan@42352
|
62 |
fun eval_factors_from_solution (thmid:string) _
|
jan@42352
|
63 |
(t as Const ("Partial_Fractions.factors_from_solution", _) $ sol) thy =
|
jan@42352
|
64 |
((let val prod = factors_from_solution sol
|
jan@42352
|
65 |
in SOME (mk_thmid thmid ""
|
jan@42352
|
66 |
(Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) prod) "",
|
jan@42352
|
67 |
Trueprop $ (mk_equality (t, prod)))
|
jan@42352
|
68 |
end)
|
jan@42352
|
69 |
handle _ => NONE)
|
jan@42352
|
70 |
| eval_factors_from_solution _ _ _ _ = NONE;
|
jan@42344
|
71 |
*}
|
jan@42344
|
72 |
|
neuper@42376
|
73 |
text {* 'ansatz' introduces '?Vars' (questionable design); drop these again *}
|
neuper@42359
|
74 |
ML {*
|
neuper@42359
|
75 |
(*("drop_questionmarks", ("Partial_Fractions.drop_questionmarks", eval_drop_questionmarks ""))*)
|
neuper@42359
|
76 |
fun eval_drop_questionmarks (thmid:string) _
|
neuper@42359
|
77 |
(t as Const ("Partial_Fractions.drop_questionmarks", _) $ tm) thy =
|
neuper@42359
|
78 |
if contains_Var tm
|
neuper@42359
|
79 |
then
|
neuper@42359
|
80 |
let
|
neuper@42359
|
81 |
val tm' = var2free tm
|
neuper@42359
|
82 |
in SOME (mk_thmid thmid ""
|
neuper@42359
|
83 |
(Print_Mode.setmp [] (Syntax.string_of_term (thy2ctxt thy)) tm') "",
|
neuper@42359
|
84 |
Trueprop $ (mk_equality (t, tm')))
|
neuper@42359
|
85 |
end
|
neuper@42359
|
86 |
else NONE
|
neuper@42359
|
87 |
| eval_drop_questionmarks _ _ _ _ = NONE;
|
neuper@42376
|
88 |
*}
|
neuper@42359
|
89 |
|
neuper@42376
|
90 |
text {* store eval_ functions for calls from Scripts *}
|
neuper@42376
|
91 |
ML {*
|
neuper@42359
|
92 |
calclist':= overwritel (!calclist',
|
neuper@42359
|
93 |
[("drop_questionmarks", ("Partial_Fractions.drop'_questionmarks", eval_drop_questionmarks ""))
|
neuper@42359
|
94 |
]);
|
neuper@42359
|
95 |
*}
|
neuper@42359
|
96 |
|
neuper@42376
|
97 |
subsection {* 'ansatz' for partial fractions *}
|
jan@42353
|
98 |
axiomatization where
|
jan@42358
|
99 |
ansatz_2nd_order: "n / (a*b) = A/a + B/b" and
|
neuper@42376
|
100 |
ansatz_3rd_order: "n / (a*b*c) = A/a + B/b + C/c" and
|
neuper@42376
|
101 |
ansatz_4th_order: "n / (a*b*c*d) = A/a + B/b + C/c + D/d" and
|
neuper@42386
|
102 |
(*version 1*)
|
neuper@42376
|
103 |
equival_trans_2nd_order: "(n/(a*b) = A/a + B/b) = (n = A*b + B*a)" and
|
neuper@42376
|
104 |
equival_trans_3rd_order: "(n/(a*b*c) = A/a + B/b + C/c) = (n = A*b*c + B*a*c + C*a*b)" and
|
neuper@42376
|
105 |
equival_trans_4th_order: "(n/(a*b*c*d) = A/a + B/b + C/c + D/d) =
|
neuper@42386
|
106 |
(n = A*b*c*d + B*a*c*d + C*a*b*d + D*a*b*c)" and
|
neuper@42386
|
107 |
(*version 2: not yet used, see partial_fractions.sml*)
|
neuper@42386
|
108 |
multiply_2nd_order: "x = a*b ==> (n/x = A/a + B/b) = (a*b*n/x = A*b + B*a)" and
|
neuper@42386
|
109 |
multiply_3rd_order: "x = a*b*c ==>
|
neuper@42386
|
110 |
(n/x = A/a + B/b + C/c) = (a*b*c*n/x = A*b*c + B*a*c + C*a*b)" and
|
neuper@42386
|
111 |
multiply_4th_order: "x = a*b*c*d ==>
|
neuper@42386
|
112 |
(n/x = A/a + B/b + C/c + D/d) = (a*b*c*d*n/x = A*b*c*d + B*a*c*d + C*a*b*d + D*a*b*c)"
|
jan@42353
|
113 |
|
jan@42353
|
114 |
ML {*
|
jan@42353
|
115 |
val ansatz_rls = prep_rls(
|
jan@42353
|
116 |
Rls {id = "ansatz_rls", preconds = [], rew_ord = ("dummy_ord",dummy_ord),
|
jan@42353
|
117 |
erls = Erls, srls = Erls, calc = [],
|
jan@42353
|
118 |
rules =
|
neuper@42376
|
119 |
[Thm ("ansatz_2nd_order",num_str @{thm ansatz_2nd_order}),
|
neuper@42376
|
120 |
Thm ("ansatz_3rd_order",num_str @{thm ansatz_3rd_order})
|
jan@42353
|
121 |
],
|
jan@42353
|
122 |
scr = EmptyScr}:rls);
|
jan@42353
|
123 |
|
jan@42354
|
124 |
val equival_trans = prep_rls(
|
jan@42354
|
125 |
Rls {id = "equival_trans", preconds = [], rew_ord = ("dummy_ord",dummy_ord),
|
jan@42354
|
126 |
erls = Erls, srls = Erls, calc = [],
|
jan@42354
|
127 |
rules =
|
neuper@42376
|
128 |
[Thm ("equival_trans_2nd_order",num_str @{thm equival_trans_2nd_order}),
|
neuper@42376
|
129 |
Thm ("equival_trans_3rd_order",num_str @{thm equival_trans_3rd_order})
|
jan@42354
|
130 |
],
|
jan@42354
|
131 |
scr = EmptyScr}:rls);
|
neuper@42386
|
132 |
|
neuper@42386
|
133 |
val multiply_ansatz = prep_rls(
|
neuper@42386
|
134 |
Rls {id = "multiply_ansatz", preconds = [], rew_ord = ("dummy_ord",dummy_ord),
|
neuper@42386
|
135 |
erls = Erls,
|
neuper@42386
|
136 |
srls = Erls, calc = [],
|
neuper@42386
|
137 |
rules =
|
neuper@42386
|
138 |
[Thm ("multiply_2nd_order",num_str @{thm multiply_2nd_order})
|
neuper@42386
|
139 |
],
|
neuper@42386
|
140 |
scr = EmptyScr}:rls);
|
jan@42354
|
141 |
*}
|
jan@42354
|
142 |
|
jan@42354
|
143 |
text {*store the rule set for math engine*}
|
jan@42354
|
144 |
ML {*
|
jan@42353
|
145 |
ruleset' := overwritelthy @{theory} (!ruleset',
|
jan@42354
|
146 |
[("ansatz_rls", ansatz_rls),
|
neuper@42386
|
147 |
("multiply_ansatz", multiply_ansatz),
|
jan@42354
|
148 |
("equival_trans", equival_trans)
|
jan@42353
|
149 |
]);
|
jan@42353
|
150 |
*}
|
jan@42344
|
151 |
|
neuper@42376
|
152 |
subsection {* Specification *}
|
jan@42344
|
153 |
|
neuper@42376
|
154 |
consts
|
neuper@42376
|
155 |
decomposedFunction :: "real => una"
|
neuper@42376
|
156 |
|
neuper@42289
|
157 |
ML {*
|
neuper@42386
|
158 |
check_guhs_unique := false; (*WN120307 REMOVE after editing*)
|
neuper@42376
|
159 |
store_pbt
|
neuper@42376
|
160 |
(prep_pbt @{theory} "pbl_simp_rat_partfrac" [] e_pblID
|
neuper@42376
|
161 |
(["partial_fraction", "rational", "simplification"],
|
neuper@42376
|
162 |
[("#Given" ,["functionTerm t_t", "solveFor v_v"]),
|
neuper@42376
|
163 |
(* TODO: call this sub-problem with appropriate functionTerm:
|
neuper@42376
|
164 |
leading coefficient of the denominator is 1: to be checked here! and..
|
neuper@42376
|
165 |
("#Where" ,["((get_numerator t_t) has_degree_in v_v) <
|
neuper@42376
|
166 |
((get_denominator t_t) has_degree_in v_v)"]), TODO*)
|
neuper@42376
|
167 |
("#Find" ,["decomposedFunction p_p"])
|
neuper@42376
|
168 |
],
|
neuper@42376
|
169 |
append_rls "e_rls" e_rls [(*for preds in where_ TODO*)],
|
neuper@42376
|
170 |
NONE,
|
neuper@42376
|
171 |
[["simplification","of_rationals","to_partial_fraction"]]));
|
neuper@42289
|
172 |
*}
|
jan@42354
|
173 |
|
neuper@42376
|
174 |
subsection {* Method *}
|
neuper@42376
|
175 |
consts
|
neuper@42376
|
176 |
PartFracScript :: "[real,real, real] => real"
|
neuper@42376
|
177 |
("((Script PartFracScript (_ _ =))// (_))" 9)
|
jan@42353
|
178 |
|
neuper@42376
|
179 |
text {* rule set for functions called in the Script *}
|
neuper@42376
|
180 |
ML {*
|
neuper@42376
|
181 |
val srls = Rls {id="srls_partial_fraction",
|
neuper@42376
|
182 |
preconds = [],
|
neuper@42376
|
183 |
rew_ord = ("termlessI",termlessI),
|
neuper@42376
|
184 |
erls = append_rls "erls_in_srls_partial_fraction" e_rls
|
neuper@42376
|
185 |
[(*for asm in NTH_CONS ...*)
|
neuper@42376
|
186 |
Calc ("Orderings.ord_class.less",eval_equ "#less_"),
|
neuper@42376
|
187 |
(*2nd NTH_CONS pushes n+-1 into asms*)
|
neuper@42376
|
188 |
Calc("Groups.plus_class.plus", eval_binop "#add_")],
|
neuper@42376
|
189 |
srls = Erls, calc = [],
|
neuper@42376
|
190 |
rules = [
|
neuper@42376
|
191 |
Thm ("NTH_CONS",num_str @{thm NTH_CONS}),
|
neuper@42376
|
192 |
Calc("Groups.plus_class.plus", eval_binop "#add_"),
|
neuper@42376
|
193 |
Thm ("NTH_NIL",num_str @{thm NTH_NIL}),
|
neuper@42376
|
194 |
Calc("Tools.lhs", eval_lhs "eval_lhs_"),
|
neuper@42376
|
195 |
Calc("Tools.rhs", eval_rhs"eval_rhs_"),
|
neuper@42376
|
196 |
Calc("Atools.argument'_in", eval_argument_in "Atools.argument'_in"),
|
neuper@42376
|
197 |
Calc("Rational.get_denominator", eval_get_denominator "#get_denominator"),
|
neuper@42376
|
198 |
Calc("Rational.get_numerator", eval_get_numerator "#get_numerator"),
|
neuper@42376
|
199 |
Calc("Partial_Fractions.factors_from_solution",
|
neuper@42376
|
200 |
eval_factors_from_solution "#factors_from_solution"),
|
neuper@42376
|
201 |
Calc("Partial_Fractions.drop_questionmarks", eval_drop_questionmarks "#drop_?")],
|
neuper@42376
|
202 |
scr = EmptyScr};
|
neuper@42376
|
203 |
*}
|
neuper@42376
|
204 |
ML {*
|
neuper@42376
|
205 |
eval_drop_questionmarks;
|
neuper@42376
|
206 |
*}
|
neuper@42376
|
207 |
ML {*
|
neuper@42376
|
208 |
val ctxt = ProofContext.init_global @{theory};
|
neuper@42376
|
209 |
val SOME t = parseNEW ctxt "eqr = drop_questionmarks eqr";
|
neuper@42376
|
210 |
*}
|
neuper@42376
|
211 |
ML {*
|
neuper@42376
|
212 |
parseNEW ctxt "decomposedFunction p_p";
|
neuper@42376
|
213 |
parseNEW ctxt "decomposedFunction";
|
neuper@42376
|
214 |
*}
|
neuper@42376
|
215 |
ML {*
|
neuper@42376
|
216 |
*}
|
neuper@42376
|
217 |
ML {* (* current version, error outcommented *)
|
neuper@42376
|
218 |
store_met
|
neuper@42376
|
219 |
(prep_met @{theory} "met_partial_fraction" [] e_metID
|
neuper@42376
|
220 |
(["simplification","of_rationals","to_partial_fraction"],
|
neuper@42376
|
221 |
[("#Given" ,["functionTerm t_t", "solveFor v_v"]),
|
neuper@42376
|
222 |
(*("#Where" ,["((get_numerator t_t) has_degree_in v_v) <
|
neuper@42376
|
223 |
((get_denominator t_t) has_degree_in v_v)"]), TODO*)
|
neuper@42376
|
224 |
("#Find" ,["decomposedFunction p_p"])],
|
neuper@42376
|
225 |
{rew_ord'="tless_true", rls'= e_rls, calc = [], srls = srls, prls = e_rls,
|
neuper@42376
|
226 |
crls = e_rls, nrls = e_rls},
|
neuper@42376
|
227 |
"Script PartFracScript (f_f::real) (zzz::real) = " ^(*f_f: 3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z)), zzz: z*)
|
neuper@42376
|
228 |
" (let f_f = Take f_f; " ^
|
neuper@42376
|
229 |
" (num_orig::real) = get_numerator f_f; " ^(*num_orig: 3*)
|
neuper@42376
|
230 |
" f_f = (Rewrite_Set norm_Rational False) f_f; " ^(*f_f: 24 / (-1 + -2 * z + 8 * z ^^^ 2)*)
|
neuper@42376
|
231 |
" (denom::real) = get_denominator f_f; " ^(*denom: -1 + -2 * z + 8 * z ^^^ 2*)
|
neuper@42376
|
232 |
" (equ::bool) = (denom = (0::real)); " ^(*equ: -1 + -2 * z + 8 * z ^^^ 2 = 0*)
|
neuper@42376
|
233 |
" (L_L::bool list) = (SubProblem (PolyEq', " ^
|
neuper@42376
|
234 |
" [abcFormula, degree_2, polynomial, univariate, equation], " ^
|
neuper@42376
|
235 |
" [no_met]) [BOOL equ, REAL zzz]); " ^(*L_L: [z = 1 / 2, z = -1 / 4]*)
|
neuper@42376
|
236 |
" (facs::real) = factors_from_solution L_L; " ^(*facs: (z - 1 / 2) * (z - -1 / 4)*)
|
neuper@42376
|
237 |
" (eql::real) = Take (num_orig / facs); " ^(*eql: 3 / ((z - 1 / 2) * (z - -1 / 4)) *)
|
neuper@42376
|
238 |
" (eqr::real) = (Try (Rewrite_Set ansatz_rls False)) eql; " ^(*eqr: ?A / (z - 1 / 2) + ?B / (z - -1 / 4)*)
|
neuper@42376
|
239 |
" (eq::bool) = Take (eql = eqr); " ^(*eq: 3 / ((z - 1 / 2) * (z - -1 / 4)) = ?A / (z - 1 / 2) + ?B / (z - -1 / 4)*)
|
neuper@42376
|
240 |
" eq = (Try (Rewrite_Set equival_trans False)) eq; " ^(*eq: 3 = ?A * (z - -1 / 4) + ?B * (z - 1 / 2)*)
|
neuper@42376
|
241 |
" eq = drop_questionmarks eq; " ^(*eq: 3 = A * (z - -1 / 4) + B * (z - 1 / 2)*)
|
neuper@42376
|
242 |
" (z1::real) = (rhs (NTH 1 L_L)); " ^(*z1: 1 / 2*)
|
neuper@42376
|
243 |
" (z2::real) = (rhs (NTH 2 L_L)); " ^(*z2: -1 / 4*)
|
neuper@42376
|
244 |
" (eq_a::bool) = Take eq; " ^(*eq_a: 3 = A * (z - -1 / 4) + B * (z - 1 / 2)*)
|
neuper@42376
|
245 |
" eq_a = (Substitute [zzz = z1]) eq; " ^(*eq_a: 3 = A * (1 / 2 - -1 / 4) + B * (1 / 2 - 1 / 2)*)
|
neuper@42376
|
246 |
" eq_a = (Rewrite_Set norm_Rational False) eq_a; " ^(*eq_a: 3 = 3 * A / 4*)
|
neuper@42376
|
247 |
" (sol_a::bool list) = " ^
|
neuper@42376
|
248 |
" (SubProblem (Isac', [univariate,equation], [no_met]) " ^
|
neuper@42376
|
249 |
" [BOOL eq_a, REAL (A::real)]); " ^(*sol_a: [A = 4]*)
|
neuper@42376
|
250 |
" (a::real) = (rhs (NTH 1 sol_a)); " ^(*a: 4*)
|
neuper@42376
|
251 |
" (eq_b::bool) = Take eq; " ^(*eq_b: 3 = A * (z - -1 / 4) + B * (z - 1 / 2)*)
|
neuper@42376
|
252 |
" eq_b = (Substitute [zzz = z2]) eq_b; " ^(*eq_b: *)
|
neuper@42376
|
253 |
" eq_b = (Rewrite_Set norm_Rational False) eq_b; " ^(*eq_b: *)
|
neuper@42376
|
254 |
" (sol_b::bool list) = " ^
|
neuper@42376
|
255 |
" (SubProblem (Isac', [univariate,equation], [no_met]) " ^
|
neuper@42376
|
256 |
" [BOOL eq_b, REAL (B::real)]); " ^(*sol_b: [B = -4]*)
|
neuper@42376
|
257 |
" (b::real) = (rhs (NTH 1 sol_b)); " ^(*b: -4*)
|
neuper@42376
|
258 |
" eqr = drop_questionmarks eqr; " ^(*eqr: A / (z - 1 / 2) + B / (z - -1 / 4)*)
|
neuper@42376
|
259 |
" (pbz::real) = Take eqr; " ^(*pbz: A / (z - 1 / 2) + B / (z - -1 / 4)*)
|
neuper@42376
|
260 |
" pbz = ((Substitute [A = a, B = b]) pbz) " ^(*pbz: 4 / (z - 1 / 2) + -4 / (z - -1 / 4)*)
|
neuper@42376
|
261 |
" in pbz)"
|
neuper@42376
|
262 |
));
|
neuper@42376
|
263 |
*}
|
neuper@42376
|
264 |
ML {*
|
neuper@42376
|
265 |
(*
|
neuper@42376
|
266 |
val fmz =
|
neuper@42376
|
267 |
["functionTerm (3 / (z * (z - 1 / 4 + -1 / 8 * (1 / z))))",
|
neuper@42376
|
268 |
"solveFor z", "functionTerm p_p"];
|
neuper@42376
|
269 |
val (dI',pI',mI') =
|
neuper@42376
|
270 |
("Partial_Fractions",
|
neuper@42376
|
271 |
["partial_fraction", "rational", "simplification"],
|
neuper@42376
|
272 |
["simplification","of_rationals","to_partial_fraction"]);
|
neuper@42376
|
273 |
val (p,_,f,nxt,_,pt) = CalcTreeTEST [(fmz, (dI',pI',mI'))];
|
neuper@42376
|
274 |
*)
|
neuper@42376
|
275 |
*}
|
neuper@42289
|
276 |
|
jan@42295
|
277 |
|
neuper@42376
|
278 |
|
neuper@42376
|
279 |
subsection {**}
|
neuper@42376
|
280 |
|
neuper@42289
|
281 |
end |