neuper@37906
|
1 |
(*. (c) by Richard Lang, 2003 .*)
|
neuper@37906
|
2 |
(* theory collecting all knowledge for LinearEquations
|
neuper@37906
|
3 |
created by: rlang
|
neuper@37906
|
4 |
date: 02.10
|
neuper@37906
|
5 |
changed by: rlang
|
neuper@37906
|
6 |
last change by: rlang
|
neuper@37906
|
7 |
date: 02.10.20
|
neuper@37906
|
8 |
*)
|
neuper@37906
|
9 |
|
neuper@37950
|
10 |
theory LinEq imports Poly Equation begin
|
neuper@37906
|
11 |
|
neuper@37906
|
12 |
consts
|
neuper@37906
|
13 |
Solve'_lineq'_equation
|
neuper@37950
|
14 |
:: "[bool,real,
|
neuper@37950
|
15 |
bool list] => bool list"
|
neuper@37950
|
16 |
("((Script Solve'_lineq'_equation (_ _ =))//
|
neuper@37950
|
17 |
(_))" 9)
|
neuper@37906
|
18 |
|
t@42211
|
19 |
axioms(*axiomatization where*)
|
neuper@37906
|
20 |
(*-- normalize --*)
|
neuper@37906
|
21 |
(*WN0509 compare PolyEq.all_left "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)"*)
|
t@42211
|
22 |
all_left: "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"
|
t@42211
|
23 |
makex1_x: "a^^^1 = a"
|
t@42211
|
24 |
real_assoc_1: "a+(b+c) = a+b+c"
|
t@42211
|
25 |
real_assoc_2: "a*(b*c) = a*b*c"
|
neuper@37906
|
26 |
|
neuper@37906
|
27 |
(*-- solve --*)
|
t@42211
|
28 |
lin_isolate_add1: "(a + b*bdv = 0) = (b*bdv = (-1)*a)"
|
t@42211
|
29 |
lin_isolate_add2: "(a + bdv = 0) = ( bdv = (-1)*a)"
|
neuper@37982
|
30 |
lin_isolate_div: "[|Not(b=0)|] ==> (b*bdv = c) = (bdv = c / b)"
|
neuper@37950
|
31 |
|
neuper@37950
|
32 |
ML {*
|
neuper@37972
|
33 |
val thy = @{theory};
|
neuper@37972
|
34 |
|
neuper@37950
|
35 |
val LinEq_prls = (*3.10.02:just the following order due to subterm evaluation*)
|
neuper@37950
|
36 |
append_rls "LinEq_prls" e_rls
|
neuper@41922
|
37 |
[Calc ("HOL.eq",eval_equal "#equal_"),
|
neuper@37950
|
38 |
Calc ("Tools.matches",eval_matches ""),
|
neuper@37950
|
39 |
Calc ("Tools.lhs" ,eval_lhs ""),
|
neuper@37950
|
40 |
Calc ("Tools.rhs" ,eval_rhs ""),
|
neuper@37950
|
41 |
Calc ("Poly.has'_degree'_in",eval_has_degree_in ""),
|
neuper@37950
|
42 |
Calc ("Poly.is'_polyrat'_in",eval_is_polyrat_in ""),
|
neuper@37950
|
43 |
Calc ("Atools.occurs'_in",eval_occurs_in ""),
|
neuper@37950
|
44 |
Calc ("Atools.ident",eval_ident "#ident_"),
|
neuper@37969
|
45 |
Thm ("not_true",num_str @{thm not_true}),
|
neuper@37969
|
46 |
Thm ("not_false",num_str @{thm not_false}),
|
neuper@37969
|
47 |
Thm ("and_true",num_str @{thm and_true}),
|
neuper@37969
|
48 |
Thm ("and_false",num_str @{thm and_false}),
|
neuper@37969
|
49 |
Thm ("or_true",num_str @{thm or_true}),
|
neuper@37969
|
50 |
Thm ("or_false",num_str @{thm or_false})
|
neuper@37950
|
51 |
];
|
neuper@37950
|
52 |
(* ----- erls ----- *)
|
neuper@37950
|
53 |
val LinEq_crls =
|
neuper@37950
|
54 |
append_rls "LinEq_crls" poly_crls
|
neuper@37969
|
55 |
[Thm ("real_assoc_1",num_str @{thm real_assoc_1})
|
neuper@37950
|
56 |
(*
|
neuper@37950
|
57 |
Don't use
|
neuper@48789
|
58 |
Calc ("Fields.inverse_class.divide", eval_cancel "#divide_e"),
|
neuper@37950
|
59 |
Calc ("Atools.pow" ,eval_binop "#power_"),
|
neuper@37950
|
60 |
*)
|
neuper@37950
|
61 |
];
|
neuper@37950
|
62 |
|
neuper@37950
|
63 |
(* ----- crls ----- *)
|
neuper@37950
|
64 |
val LinEq_erls =
|
neuper@37950
|
65 |
append_rls "LinEq_erls" Poly_erls
|
neuper@37969
|
66 |
[Thm ("real_assoc_1",num_str @{thm real_assoc_1})
|
neuper@37950
|
67 |
(*
|
neuper@37950
|
68 |
Don't use
|
neuper@48789
|
69 |
Calc ("Fields.inverse_class.divide", eval_cancel "#divide_e"),
|
neuper@37950
|
70 |
Calc ("Atools.pow" ,eval_binop "#power_"),
|
neuper@37950
|
71 |
*)
|
neuper@37950
|
72 |
];
|
neuper@37950
|
73 |
|
neuper@37967
|
74 |
ruleset' := overwritelthy @{theory} (!ruleset',
|
neuper@37950
|
75 |
[("LinEq_erls",LinEq_erls)(*FIXXXME:del with rls.rls'*)
|
neuper@37950
|
76 |
]);
|
neuper@52125
|
77 |
*}
|
neuper@52125
|
78 |
setup {* KEStore_Elems.add_rlss
|
neuper@52125
|
79 |
[("LinEq_erls", (Context.theory_name @{theory}, LinEq_erls))] *}
|
neuper@52125
|
80 |
ML {*
|
neuper@37950
|
81 |
|
neuper@37950
|
82 |
val LinPoly_simplify = prep_rls(
|
neuper@37950
|
83 |
Rls {id = "LinPoly_simplify", preconds = [],
|
neuper@37950
|
84 |
rew_ord = ("termlessI",termlessI),
|
neuper@37950
|
85 |
erls = LinEq_erls,
|
neuper@37950
|
86 |
srls = Erls,
|
neuper@42451
|
87 |
calc = [], errpatts = [],
|
neuper@37950
|
88 |
rules = [
|
neuper@37969
|
89 |
Thm ("real_assoc_1",num_str @{thm real_assoc_1}),
|
neuper@38014
|
90 |
Calc ("Groups.plus_class.plus",eval_binop "#add_"),
|
neuper@38014
|
91 |
Calc ("Groups.minus_class.minus",eval_binop "#sub_"),
|
neuper@38034
|
92 |
Calc ("Groups.times_class.times",eval_binop "#mult_"),
|
neuper@37950
|
93 |
(* Dont use
|
neuper@48789
|
94 |
Calc ("Fields.inverse_class.divide", eval_cancel "#divide_e"),
|
neuper@37982
|
95 |
Calc ("NthRoot.sqrt",eval_sqrt "#sqrt_"),
|
neuper@37950
|
96 |
*)
|
neuper@37950
|
97 |
Calc ("Atools.pow" ,eval_binop "#power_")
|
neuper@37950
|
98 |
],
|
neuper@37982
|
99 |
scr = EmptyScr}:rls);
|
neuper@37982
|
100 |
|
neuper@37967
|
101 |
ruleset' := overwritelthy @{theory} (!ruleset',
|
neuper@37950
|
102 |
[("LinPoly_simplify",LinPoly_simplify)]);
|
neuper@52125
|
103 |
*}
|
neuper@52125
|
104 |
setup {* KEStore_Elems.add_rlss
|
neuper@52125
|
105 |
[("LinPoly_simplify", (Context.theory_name @{theory}, LinPoly_simplify))] *}
|
neuper@52125
|
106 |
ML {*
|
neuper@37950
|
107 |
|
neuper@37950
|
108 |
(*isolate the bound variable in an linear equation; 'bdv' is a meta-constant*)
|
neuper@37950
|
109 |
val LinEq_simplify = prep_rls(
|
neuper@37950
|
110 |
Rls {id = "LinEq_simplify", preconds = [],
|
neuper@37950
|
111 |
rew_ord = ("e_rew_ord",e_rew_ord),
|
neuper@37950
|
112 |
erls = LinEq_erls,
|
neuper@37950
|
113 |
srls = Erls,
|
neuper@42451
|
114 |
calc = [], errpatts = [],
|
neuper@37950
|
115 |
rules = [
|
neuper@37969
|
116 |
Thm("lin_isolate_add1",num_str @{thm lin_isolate_add1}),
|
neuper@37950
|
117 |
(* a+bx=0 -> bx=-a *)
|
neuper@37969
|
118 |
Thm("lin_isolate_add2",num_str @{thm lin_isolate_add2}),
|
neuper@37950
|
119 |
(* a+ x=0 -> x=-a *)
|
neuper@37969
|
120 |
Thm("lin_isolate_div",num_str @{thm lin_isolate_div})
|
neuper@37950
|
121 |
(* bx=c -> x=c/b *)
|
neuper@37950
|
122 |
],
|
neuper@37982
|
123 |
scr = EmptyScr}:rls);
|
neuper@37967
|
124 |
ruleset' := overwritelthy @{theory} (!ruleset',
|
neuper@37950
|
125 |
[("LinEq_simplify",LinEq_simplify)]);
|
neuper@52125
|
126 |
*}
|
neuper@52125
|
127 |
setup {* KEStore_Elems.add_rlss
|
neuper@52125
|
128 |
[("LinEq_simplify", (Context.theory_name @{theory}, LinEq_simplify))] *}
|
neuper@52125
|
129 |
ML {*
|
neuper@37950
|
130 |
|
neuper@37950
|
131 |
(*----------------------------- problem types --------------------------------*)
|
neuper@37950
|
132 |
(*
|
neuper@37950
|
133 |
show_ptyps();
|
neuper@37950
|
134 |
(get_pbt ["linear","univariate","equation"]);
|
neuper@37950
|
135 |
*)
|
neuper@37982
|
136 |
|
neuper@37950
|
137 |
(* ---------linear----------- *)
|
neuper@37950
|
138 |
store_pbt
|
neuper@37972
|
139 |
(prep_pbt thy "pbl_equ_univ_lin" [] e_pblID
|
neuper@37950
|
140 |
(["linear","univariate","equation"],
|
neuper@37981
|
141 |
[("#Given" ,["equality e_e","solveFor v_v"]),
|
neuper@41928
|
142 |
("#Where" ,["HOL.False", (*WN0509 just detected: this pbl can never be used?!?*)
|
neuper@37981
|
143 |
"Not( (lhs e_e) is_polyrat_in v_v)",
|
neuper@37981
|
144 |
"Not( (rhs e_e) is_polyrat_in v_v)",
|
neuper@37981
|
145 |
"((lhs e_e) has_degree_in v_v)=1",
|
neuper@37981
|
146 |
"((rhs e_e) has_degree_in v_v)=1"]),
|
neuper@38012
|
147 |
("#Find" ,["solutions v_v'i'"])
|
neuper@37950
|
148 |
],
|
neuper@37981
|
149 |
LinEq_prls, SOME "solve (e_e::bool, v_v)",
|
neuper@37950
|
150 |
[["LinEq","solve_lineq_equation"]]));
|
neuper@37950
|
151 |
|
neuper@37950
|
152 |
(*-------------- methods------------------------------------------------------*)
|
neuper@37950
|
153 |
store_met
|
neuper@37972
|
154 |
(prep_met thy "met_eqlin" [] e_metID
|
neuper@37950
|
155 |
(["LinEq"],
|
neuper@37950
|
156 |
[],
|
neuper@37950
|
157 |
{rew_ord'="tless_true",rls'=Atools_erls,calc = [], srls = e_rls, prls=e_rls,
|
neuper@42425
|
158 |
crls=LinEq_crls, errpats = [], nrls = norm_Poly}, "empty_script"));
|
neuper@37950
|
159 |
|
neuper@37950
|
160 |
(* ansprechen mit ["LinEq","solve_univar_equation"] *)
|
neuper@37950
|
161 |
store_met
|
neuper@37972
|
162 |
(prep_met thy "met_eq_lin" [] e_metID
|
neuper@37950
|
163 |
(["LinEq","solve_lineq_equation"],
|
neuper@37982
|
164 |
[("#Given", ["equality e_e", "solveFor v_v"]),
|
neuper@37982
|
165 |
("#Where", ["Not ((lhs e_e) is_polyrat_in v_v)",
|
neuper@37982
|
166 |
"((lhs e_e) has_degree_in v_v) = 1"]),
|
neuper@38012
|
167 |
("#Find", ["solutions v_v'i'"])
|
neuper@37950
|
168 |
],
|
neuper@37982
|
169 |
{rew_ord'="termlessI", rls'=LinEq_erls, srls=e_rls, prls=LinEq_prls,
|
neuper@42425
|
170 |
calc=[], crls=LinEq_crls, errpats = [], nrls = norm_Poly},
|
neuper@37982
|
171 |
"Script Solve_lineq_equation (e_e::bool) (v_v::real) = " ^
|
neuper@37982
|
172 |
"(let e_e =((Try (Rewrite all_left False)) @@ " ^
|
neuper@37982
|
173 |
" (Try (Repeat (Rewrite makex1_x False))) @@ " ^
|
neuper@37982
|
174 |
" (Try (Rewrite_Set expand_binoms False)) @@ " ^
|
neuper@37982
|
175 |
" (Try (Repeat (Rewrite_Set_Inst [(bdv, v_v::real)] " ^
|
neuper@37982
|
176 |
" make_ratpoly_in False))) @@ " ^
|
neuper@37982
|
177 |
" (Try (Repeat (Rewrite_Set LinPoly_simplify False))))e_e;" ^
|
neuper@37982
|
178 |
" e_e = ((Try (Rewrite_Set_Inst [(bdv, v_v::real)] " ^
|
neuper@37982
|
179 |
" LinEq_simplify True)) @@ " ^
|
neuper@37981
|
180 |
" (Repeat(Try (Rewrite_Set LinPoly_simplify False)))) e_e " ^
|
neuper@37981
|
181 |
" in ((Or_to_List e_e)::bool list))"
|
neuper@37950
|
182 |
));
|
neuper@37950
|
183 |
get_met ["LinEq","solve_lineq_equation"];
|
neuper@37982
|
184 |
|
neuper@37950
|
185 |
*}
|
neuper@37950
|
186 |
|
neuper@37906
|
187 |
end
|
neuper@37906
|
188 |
|