1 (* theory collecting all knowledge
2 (predicates 'is_rootEq_in', 'is_sqrt_in', 'is_ratEq_in')
3 for PolynomialEquations.
4 alternative dependencies see @{theory "Isac_Knowledge"}
10 (c) by Richard Lang, 2003
13 theory PolyEq imports LinEq RootRatEq begin
15 (*-------------------- rules -------------------------------------------------*)
16 (* type real enforced by op " \<up> " *)
18 cancel_leading_coeff1: "Not (c =!= 0) ==> (a + b*bdv + c*bdv \<up> 2 = 0) =
19 (a/c + b/c*bdv + bdv \<up> 2 = 0)" and
20 cancel_leading_coeff2: "Not (c =!= 0) ==> (a - b*bdv + c*bdv \<up> 2 = 0) =
21 (a/c - b/c*bdv + bdv \<up> 2 = 0)" and
22 cancel_leading_coeff3: "Not (c =!= 0) ==> (a + b*bdv - c*bdv \<up> 2 = 0) =
23 (a/c + b/c*bdv - bdv \<up> 2 = 0)" and
25 cancel_leading_coeff4: "Not (c =!= 0) ==> (a + bdv + c*bdv \<up> 2 = 0) =
26 (a/c + 1/c*bdv + bdv \<up> 2 = 0)" and
27 cancel_leading_coeff5: "Not (c =!= 0) ==> (a - bdv + c*bdv \<up> 2 = 0) =
28 (a/c - 1/c*bdv + bdv \<up> 2 = 0)" and
29 cancel_leading_coeff6: "Not (c =!= 0) ==> (a + bdv - c*bdv \<up> 2 = 0) =
30 (a/c + 1/c*bdv - bdv \<up> 2 = 0)" and
32 cancel_leading_coeff7: "Not (c =!= 0) ==> ( b*bdv + c*bdv \<up> 2 = 0) =
33 ( b/c*bdv + bdv \<up> 2 = 0)" and
34 cancel_leading_coeff8: "Not (c =!= 0) ==> ( b*bdv - c*bdv \<up> 2 = 0) =
35 ( b/c*bdv - bdv \<up> 2 = 0)" and
37 cancel_leading_coeff9: "Not (c =!= 0) ==> ( bdv + c*bdv \<up> 2 = 0) =
38 ( 1/c*bdv + bdv \<up> 2 = 0)" and
39 cancel_leading_coeff10:"Not (c =!= 0) ==> ( bdv - c*bdv \<up> 2 = 0) =
40 ( 1/c*bdv - bdv \<up> 2 = 0)" and
42 cancel_leading_coeff11:"Not (c =!= 0) ==> (a + b*bdv \<up> 2 = 0) =
43 (a/b + bdv \<up> 2 = 0)" and
44 cancel_leading_coeff12:"Not (c =!= 0) ==> (a - b*bdv \<up> 2 = 0) =
45 (a/b - bdv \<up> 2 = 0)" and
46 cancel_leading_coeff13:"Not (c =!= 0) ==> ( b*bdv \<up> 2 = 0) =
47 ( bdv \<up> 2 = 0/b)" and
49 complete_square1: "(q + p*bdv + bdv \<up> 2 = 0) =
50 (q + (p/2 + bdv) \<up> 2 = (p/2) \<up> 2)" and
51 complete_square2: "( p*bdv + bdv \<up> 2 = 0) =
52 ( (p/2 + bdv) \<up> 2 = (p/2) \<up> 2)" and
53 complete_square3: "( bdv + bdv \<up> 2 = 0) =
54 ( (1/2 + bdv) \<up> 2 = (1/2) \<up> 2)" and
56 complete_square4: "(q - p*bdv + bdv \<up> 2 = 0) =
57 (q + (p/2 - bdv) \<up> 2 = (p/2) \<up> 2)" and
58 complete_square5: "(q + p*bdv - bdv \<up> 2 = 0) =
59 (q + (p/2 - bdv) \<up> 2 = (p/2) \<up> 2)" and
61 square_explicit1: "(a + b \<up> 2 = c) = ( b \<up> 2 = c - a)" and
62 square_explicit2: "(a - b \<up> 2 = c) = (-(b \<up> 2) = c - a)" and
64 (*bdv_explicit* required type constrain to real in --- (-8 - 2*x + x \<up> 2 = 0), by rewriting ---*)
65 bdv_explicit1: "(a + bdv = b) = (bdv = - a + (b::real))" and
66 bdv_explicit2: "(a - bdv = b) = ((-1)*bdv = - a + (b::real))" and
67 bdv_explicit3: "((-1)*bdv = b) = (bdv = (-1)*(b::real))" and
69 plus_leq: "(0 <= a + b) = ((-1)*b <= a)"(*Isa?*) and
70 minus_leq: "(0 <= a - b) = ( b <= a)"(*Isa?*) and
73 (*WN0509 compare LinEq.all_left "[|Not(b=!=0)|] ==> (a=b) = (a+(-1)*b=0)"*)
74 all_left: "[|Not(b=!=0)|] ==> (a = b) = (a - b = 0)" and
75 makex1_x: "a\<up>1 = a" and
76 real_assoc_1: "a+(b+c) = a+b+c" and
77 real_assoc_2: "a*(b*c) = a*b*c" and
79 (* ---- degree 0 ----*)
80 d0_true: "(0=0) = True" and
81 d0_false: "[|Not(bdv occurs_in a);Not(a=0)|] ==> (a=0) = False" and
82 (* ---- degree 1 ----*)
84 "[|Not(bdv occurs_in a)|] ==> (a + b*bdv = 0) = (b*bdv = (-1)*a)" and
86 "[|Not(bdv occurs_in a)|] ==> (a + bdv = 0) = ( bdv = (-1)*a)" and
88 "[|Not(b=0);Not(bdv occurs_in c)|] ==> (b*bdv = c) = (bdv = c/b)" and
89 (* ---- degree 2 ----*)
91 "[|Not(bdv occurs_in a)|] ==> (a + b*bdv \<up> 2=0) = (b*bdv \<up> 2= (-1)*a)" and
93 "[|Not(bdv occurs_in a)|] ==> (a + bdv \<up> 2=0) = ( bdv \<up> 2= (-1)*a)" and
95 "[|Not(b=0);Not(bdv occurs_in c)|] ==> (b*bdv \<up> 2=c) = (bdv \<up> 2=c/b)" and
97 d2_prescind1: "(a*bdv + b*bdv \<up> 2 = 0) = (bdv*(a +b*bdv)=0)" and
98 d2_prescind2: "(a*bdv + bdv \<up> 2 = 0) = (bdv*(a + bdv)=0)" and
99 d2_prescind3: "( bdv + b*bdv \<up> 2 = 0) = (bdv*(1+b*bdv)=0)" and
100 d2_prescind4: "( bdv + bdv \<up> 2 = 0) = (bdv*(1+ bdv)=0)" and
101 (* eliminate degree 2 *)
102 (* thm for neg arguments in sqroot have postfix _neg *)
103 d2_sqrt_equation1: "[|(0<=c);Not(bdv occurs_in c)|] ==>
104 (bdv \<up> 2=c) = ((bdv=sqrt c) | (bdv=(-1)*sqrt c ))" and
105 d2_sqrt_equation1_neg:
106 "[|(c<0);Not(bdv occurs_in c)|] ==> (bdv \<up> 2=c) = False" and
107 d2_sqrt_equation2: "(bdv \<up> 2=0) = (bdv=0)" and
108 d2_sqrt_equation3: "(b*bdv \<up> 2=0) = (bdv=0)"
109 axiomatization where (*AK..if replaced by "and" we get errors:
110 exception PTREE "nth _ []" raised
111 (line 783 of "/usr/local/isabisac/src/Tools/isac/Interpret/ctree.sml"):
112 'fun nth _ [] = raise PTREE "nth _ []"'
114 exception Bind raised
115 (line 1097 of "/usr/local/isabisac/test/Tools/isac/Frontend/interface.sml"):
116 'val (Form f, tac, asms) = pt_extract (pt, p);' *)
117 (* WN120315 these 2 thms need "::real", because no " \<up> " constrains type as
118 required in test --- rls d2_polyeq_bdv_only_simplify --- *)
119 d2_reduce_equation1: "(bdv*(a +b*bdv)=0) = ((bdv=0)|(a+b*bdv=(0::real)))" and
120 d2_reduce_equation2: "(bdv*(a + bdv)=0) = ((bdv=0)|(a+ bdv=(0::real)))"
122 axiomatization where (*..if replaced by "and" we get errors:
123 exception PTREE "nth _ []" raised
124 (line 783 of "/usr/local/isabisac/src/Tools/isac/Interpret/ctree.sml"):
125 'fun nth _ [] = raise PTREE "nth _ []"'
127 exception Bind raised
128 (line 1097 of "/usr/local/isabisac/test/Tools/isac/Frontend/interface.sml"):
129 'val (Form f, tac, asms) = pt_extract (pt, p);' *)
130 d2_pqformula1: "[|0<=p \<up> 2 - 4*q|] ==> (q+p*bdv+ bdv \<up> 2=0) =
131 ((bdv= (-1)*(p/2) + sqrt(p \<up> 2 - 4*q)/2)
132 | (bdv= (-1)*(p/2) - sqrt(p \<up> 2 - 4*q)/2))" and
133 d2_pqformula1_neg: "[|p \<up> 2 - 4*q<0|] ==> (q+p*bdv+ bdv \<up> 2=0) = False" and
134 d2_pqformula2: "[|0<=p \<up> 2 - 4*q|] ==> (q+p*bdv+1*bdv \<up> 2=0) =
135 ((bdv= (-1)*(p/2) + sqrt(p \<up> 2 - 4*q)/2)
136 | (bdv= (-1)*(p/2) - sqrt(p \<up> 2 - 4*q)/2))" and
137 d2_pqformula2_neg: "[|p \<up> 2 - 4*q<0|] ==> (q+p*bdv+1*bdv \<up> 2=0) = False" and
138 d2_pqformula3: "[|0<=1 - 4*q|] ==> (q+ bdv+ bdv \<up> 2=0) =
139 ((bdv= (-1)*(1/2) + sqrt(1 - 4*q)/2)
140 | (bdv= (-1)*(1/2) - sqrt(1 - 4*q)/2))" and
141 d2_pqformula3_neg: "[|1 - 4*q<0|] ==> (q+ bdv+ bdv \<up> 2=0) = False" and
142 d2_pqformula4: "[|0<=1 - 4*q|] ==> (q+ bdv+1*bdv \<up> 2=0) =
143 ((bdv= (-1)*(1/2) + sqrt(1 - 4*q)/2)
144 | (bdv= (-1)*(1/2) - sqrt(1 - 4*q)/2))" and
145 d2_pqformula4_neg: "[|1 - 4*q<0|] ==> (q+ bdv+1*bdv \<up> 2=0) = False" and
146 d2_pqformula5: "[|0<=p \<up> 2 - 0|] ==> ( p*bdv+ bdv \<up> 2=0) =
147 ((bdv= (-1)*(p/2) + sqrt(p \<up> 2 - 0)/2)
148 | (bdv= (-1)*(p/2) - sqrt(p \<up> 2 - 0)/2))" and
149 (* d2_pqformula5_neg not need p^2 never less zero in R *)
150 d2_pqformula6: "[|0<=p \<up> 2 - 0|] ==> ( p*bdv+1*bdv \<up> 2=0) =
151 ((bdv= (-1)*(p/2) + sqrt(p \<up> 2 - 0)/2)
152 | (bdv= (-1)*(p/2) - sqrt(p \<up> 2 - 0)/2))" and
153 (* d2_pqformula6_neg not need p^2 never less zero in R *)
154 d2_pqformula7: "[|0<=1 - 0|] ==> ( bdv+ bdv \<up> 2=0) =
155 ((bdv= (-1)*(1/2) + sqrt(1 - 0)/2)
156 | (bdv= (-1)*(1/2) - sqrt(1 - 0)/2))" and
157 (* d2_pqformula7_neg not need, because 1<0 ==> False*)
158 d2_pqformula8: "[|0<=1 - 0|] ==> ( bdv+1*bdv \<up> 2=0) =
159 ((bdv= (-1)*(1/2) + sqrt(1 - 0)/2)
160 | (bdv= (-1)*(1/2) - sqrt(1 - 0)/2))" and
161 (* d2_pqformula8_neg not need, because 1<0 ==> False*)
162 d2_pqformula9: "[|Not(bdv occurs_in q); 0<= (-1)*4*q|] ==>
163 (q+ 1*bdv \<up> 2=0) = ((bdv= 0 + sqrt(0 - 4*q)/2)
164 | (bdv= 0 - sqrt(0 - 4*q)/2))" and
166 "[|Not(bdv occurs_in q); (-1)*4*q<0|] ==> (q+ 1*bdv \<up> 2=0) = False" and
168 "[|Not(bdv occurs_in q); 0<= (-1)*4*q|] ==> (q+ bdv \<up> 2=0) =
169 ((bdv= 0 + sqrt(0 - 4*q)/2)
170 | (bdv= 0 - sqrt(0 - 4*q)/2))" and
172 "[|Not(bdv occurs_in q); (-1)*4*q<0|] ==> (q+ bdv \<up> 2=0) = False" and
174 "[|0<=b \<up> 2 - 4*a*c|] ==> (c + b*bdv+a*bdv \<up> 2=0) =
175 ((bdv=( -b + sqrt(b \<up> 2 - 4*a*c))/(2*a))
176 | (bdv=( -b - sqrt(b \<up> 2 - 4*a*c))/(2*a)))" and
178 "[|b \<up> 2 - 4*a*c<0|] ==> (c + b*bdv+a*bdv \<up> 2=0) = False" and
180 "[|0<=1 - 4*a*c|] ==> (c+ bdv+a*bdv \<up> 2=0) =
181 ((bdv=( -1 + sqrt(1 - 4*a*c))/(2*a))
182 | (bdv=( -1 - sqrt(1 - 4*a*c))/(2*a)))" and
184 "[|1 - 4*a*c<0|] ==> (c+ bdv+a*bdv \<up> 2=0) = False" and
186 "[|0<=b \<up> 2 - 4*1*c|] ==> (c + b*bdv+ bdv \<up> 2=0) =
187 ((bdv=( -b + sqrt(b \<up> 2 - 4*1*c))/(2*1))
188 | (bdv=( -b - sqrt(b \<up> 2 - 4*1*c))/(2*1)))" and
190 "[|b \<up> 2 - 4*1*c<0|] ==> (c + b*bdv+ bdv \<up> 2=0) = False" and
192 "[|0<=1 - 4*1*c|] ==> (c + bdv+ bdv \<up> 2=0) =
193 ((bdv=( -1 + sqrt(1 - 4*1*c))/(2*1))
194 | (bdv=( -1 - sqrt(1 - 4*1*c))/(2*1)))" and
196 "[|1 - 4*1*c<0|] ==> (c + bdv+ bdv \<up> 2=0) = False" and
198 "[|Not(bdv occurs_in c); 0<=0 - 4*a*c|] ==> (c + a*bdv \<up> 2=0) =
199 ((bdv=( 0 + sqrt(0 - 4*a*c))/(2*a))
200 | (bdv=( 0 - sqrt(0 - 4*a*c))/(2*a)))" and
202 "[|Not(bdv occurs_in c); 0 - 4*a*c<0|] ==> (c + a*bdv \<up> 2=0) = False" and
204 "[|Not(bdv occurs_in c); 0<=0 - 4*1*c|] ==> (c+ bdv \<up> 2=0) =
205 ((bdv=( 0 + sqrt(0 - 4*1*c))/(2*1))
206 | (bdv=( 0 - sqrt(0 - 4*1*c))/(2*1)))" and
208 "[|Not(bdv occurs_in c); 0 - 4*1*c<0|] ==> (c+ bdv \<up> 2=0) = False" and
210 "[|0<=b \<up> 2 - 0|] ==> ( b*bdv+a*bdv \<up> 2=0) =
211 ((bdv=( -b + sqrt(b \<up> 2 - 0))/(2*a))
212 | (bdv=( -b - sqrt(b \<up> 2 - 0))/(2*a)))" and
213 (* d2_abcformula7_neg not need b^2 never less zero in R *)
215 "[|0<=b \<up> 2 - 0|] ==> ( b*bdv+ bdv \<up> 2=0) =
216 ((bdv=( -b + sqrt(b \<up> 2 - 0))/(2*1))
217 | (bdv=( -b - sqrt(b \<up> 2 - 0))/(2*1)))" and
218 (* d2_abcformula8_neg not need b^2 never less zero in R *)
220 "[|0<=1 - 0|] ==> ( bdv+a*bdv \<up> 2=0) =
221 ((bdv=( -1 + sqrt(1 - 0))/(2*a))
222 | (bdv=( -1 - sqrt(1 - 0))/(2*a)))" and
223 (* d2_abcformula9_neg not need, because 1<0 ==> False*)
225 "[|0<=1 - 0|] ==> ( bdv+ bdv \<up> 2=0) =
226 ((bdv=( -1 + sqrt(1 - 0))/(2*1))
227 | (bdv=( -1 - sqrt(1 - 0))/(2*1)))" and
228 (* d2_abcformula10_neg not need, because 1<0 ==> False*)
231 (* ---- degree 3 ----*)
233 "(a*bdv + b*bdv \<up> 2 + c*bdv \<up> 3=0) = (bdv=0 | (a + b*bdv + c*bdv \<up> 2=0))" and
235 "( bdv + b*bdv \<up> 2 + c*bdv \<up> 3=0) = (bdv=0 | (1 + b*bdv + c*bdv \<up> 2=0))" and
237 "(a*bdv + bdv \<up> 2 + c*bdv \<up> 3=0) = (bdv=0 | (a + bdv + c*bdv \<up> 2=0))" and
239 "( bdv + bdv \<up> 2 + c*bdv \<up> 3=0) = (bdv=0 | (1 + bdv + c*bdv \<up> 2=0))" and
241 "(a*bdv + b*bdv \<up> 2 + bdv \<up> 3=0) = (bdv=0 | (a + b*bdv + bdv \<up> 2=0))" and
243 "( bdv + b*bdv \<up> 2 + bdv \<up> 3=0) = (bdv=0 | (1 + b*bdv + bdv \<up> 2=0))" and
245 "(a*bdv + bdv \<up> 2 + bdv \<up> 3=0) = (bdv=0 | (1 + bdv + bdv \<up> 2=0))" and
247 "( bdv + bdv \<up> 2 + bdv \<up> 3=0) = (bdv=0 | (1 + bdv + bdv \<up> 2=0))" and
249 "(a*bdv + c*bdv \<up> 3=0) = (bdv=0 | (a + c*bdv \<up> 2=0))" and
250 d3_reduce_equation10:
251 "( bdv + c*bdv \<up> 3=0) = (bdv=0 | (1 + c*bdv \<up> 2=0))" and
252 d3_reduce_equation11:
253 "(a*bdv + bdv \<up> 3=0) = (bdv=0 | (a + bdv \<up> 2=0))" and
254 d3_reduce_equation12:
255 "( bdv + bdv \<up> 3=0) = (bdv=0 | (1 + bdv \<up> 2=0))" and
256 d3_reduce_equation13:
257 "( b*bdv \<up> 2 + c*bdv \<up> 3=0) = (bdv=0 | ( b*bdv + c*bdv \<up> 2=0))" and
258 d3_reduce_equation14:
259 "( bdv \<up> 2 + c*bdv \<up> 3=0) = (bdv=0 | ( bdv + c*bdv \<up> 2=0))" and
260 d3_reduce_equation15:
261 "( b*bdv \<up> 2 + bdv \<up> 3=0) = (bdv=0 | ( b*bdv + bdv \<up> 2=0))" and
262 d3_reduce_equation16:
263 "( bdv \<up> 2 + bdv \<up> 3=0) = (bdv=0 | ( bdv + bdv \<up> 2=0))" and
265 "[|Not(bdv occurs_in a)|] ==> (a + b*bdv \<up> 3=0) = (b*bdv \<up> 3= (-1)*a)" and
267 "[|Not(bdv occurs_in a)|] ==> (a + bdv \<up> 3=0) = ( bdv \<up> 3= (-1)*a)" and
269 "[|Not(b=0);Not(bdv occurs_in a)|] ==> (b*bdv \<up> 3=c) = (bdv \<up> 3=c/b)" and
271 "(bdv \<up> 3=0) = (bdv=0)" and
273 "(bdv \<up> 3=c) = (bdv = nroot 3 c)" and
275 (* ---- degree 4 ----*)
276 (* RL03.FIXME es wir nicht getestet ob u>0 *)
278 "(c+b*bdv \<up> 2+a*bdv \<up> 4=0) =
279 ((a*u \<up> 2+b*u+c=0) & (bdv \<up> 2=u))" and
281 (* ---- 7.3.02 von Termorder ---- *)
283 bdv_collect_1: "l * bdv + m * bdv = (l + m) * bdv" and
284 bdv_collect_2: "bdv + m * bdv = (1 + m) * bdv" and
285 bdv_collect_3: "l * bdv + bdv = (l + 1) * bdv" and
287 (* bdv_collect_assoc0_1 "l * bdv + m * bdv + k = (l + m) * bdv + k"
288 bdv_collect_assoc0_2 "bdv + m * bdv + k = (1 + m) * bdv + k"
289 bdv_collect_assoc0_3 "l * bdv + bdv + k = (l + 1) * bdv + k"
291 bdv_collect_assoc1_1: "l * bdv + (m * bdv + k) = (l + m) * bdv + k" and
292 bdv_collect_assoc1_2: "bdv + (m * bdv + k) = (1 + m) * bdv + k" and
293 bdv_collect_assoc1_3: "l * bdv + (bdv + k) = (l + 1) * bdv + k" and
295 bdv_collect_assoc2_1: "k + l * bdv + m * bdv = k + (l + m) * bdv" and
296 bdv_collect_assoc2_2: "k + bdv + m * bdv = k + (1 + m) * bdv" and
297 bdv_collect_assoc2_3: "k + l * bdv + bdv = k + (l + 1) * bdv" and
300 bdv_n_collect_1: "l * bdv \<up> n + m * bdv \<up> n = (l + m) * bdv \<up> n" and
301 bdv_n_collect_2: " bdv \<up> n + m * bdv \<up> n = (1 + m) * bdv \<up> n" and
302 bdv_n_collect_3: "l * bdv \<up> n + bdv \<up> n = (l + 1) * bdv \<up> n" (*order!*) and
304 bdv_n_collect_assoc1_1:
305 "l * bdv \<up> n + (m * bdv \<up> n + k) = (l + m) * bdv \<up> n + k" and
306 bdv_n_collect_assoc1_2: "bdv \<up> n + (m * bdv \<up> n + k) = (1 + m) * bdv \<up> n + k" and
307 bdv_n_collect_assoc1_3: "l * bdv \<up> n + (bdv \<up> n + k) = (l + 1) * bdv \<up> n + k" and
309 bdv_n_collect_assoc2_1: "k + l * bdv \<up> n + m * bdv \<up> n = k +(l + m) * bdv \<up> n" and
310 bdv_n_collect_assoc2_2: "k + bdv \<up> n + m * bdv \<up> n = k + (1 + m) * bdv \<up> n" and
311 bdv_n_collect_assoc2_3: "k + l * bdv \<up> n + bdv \<up> n = k + (l + 1) * bdv \<up> n" and
314 real_minus_div: "- (a / b) = (-1 * a) / b" and
316 separate_bdv: "(a * bdv) / b = (a / b) * (bdv::real)" and
317 separate_bdv_n: "(a * bdv \<up> n) / b = (a / b) * bdv \<up> n" and
318 separate_1_bdv: "bdv / b = (1 / b) * (bdv::real)" and
319 separate_1_bdv_n: "bdv \<up> n / b = (1 / b) * bdv \<up> n"
324 (*-------------------------rulse-------------------------*)
325 val PolyEq_prls = (*3.10.02:just the following order due to subterm evaluation*)
326 Rule_Set.append_rules "PolyEq_prls" Rule_Set.empty
327 [Rule.Eval ("Prog_Expr.ident", Prog_Expr.eval_ident "#ident_"),
328 Rule.Eval ("Prog_Expr.matches", Prog_Expr.eval_matches ""),
329 Rule.Eval ("Prog_Expr.lhs", Prog_Expr.eval_lhs ""),
330 Rule.Eval ("Prog_Expr.rhs", Prog_Expr.eval_rhs ""),
331 Rule.Eval ("Poly.is_expanded_in", eval_is_expanded_in ""),
332 Rule.Eval ("Poly.is_poly_in", eval_is_poly_in ""),
333 Rule.Eval ("Poly.has_degree_in", eval_has_degree_in ""),
334 Rule.Eval ("Poly.is_polyrat_in", eval_is_polyrat_in ""),
335 (*Rule.Eval ("Prog_Expr.occurs_in", Prog_Expr.eval_occurs_in ""), *)
336 (*Rule.Eval ("Prog_Expr.is_const", Prog_Expr.eval_const "#is_const_"),*)
337 Rule.Eval ("HOL.eq", Prog_Expr.eval_equal "#equal_"),
338 Rule.Eval ("RootEq.is_rootTerm_in", eval_is_rootTerm_in ""),
339 Rule.Eval ("RatEq.is_ratequation_in", eval_is_ratequation_in ""),
340 Rule.Thm ("not_true",ThmC.numerals_to_Free @{thm not_true}),
341 Rule.Thm ("not_false",ThmC.numerals_to_Free @{thm not_false}),
342 Rule.Thm ("and_true",ThmC.numerals_to_Free @{thm and_true}),
343 Rule.Thm ("and_false",ThmC.numerals_to_Free @{thm and_false}),
344 Rule.Thm ("or_true",ThmC.numerals_to_Free @{thm or_true}),
345 Rule.Thm ("or_false",ThmC.numerals_to_Free @{thm or_false})
349 Rule_Set.merge "PolyEq_erls" LinEq_erls
350 (Rule_Set.append_rules "ops_preds" calculate_Rational
351 [Rule.Eval ("HOL.eq", Prog_Expr.eval_equal "#equal_"),
352 Rule.Thm ("plus_leq", ThmC.numerals_to_Free @{thm plus_leq}),
353 Rule.Thm ("minus_leq", ThmC.numerals_to_Free @{thm minus_leq}),
354 Rule.Thm ("rat_leq1", ThmC.numerals_to_Free @{thm rat_leq1}),
355 Rule.Thm ("rat_leq2", ThmC.numerals_to_Free @{thm rat_leq2}),
356 Rule.Thm ("rat_leq3", ThmC.numerals_to_Free @{thm rat_leq3})
360 Rule_Set.merge "PolyEq_crls" LinEq_crls
361 (Rule_Set.append_rules "ops_preds" calculate_Rational
362 [Rule.Eval ("HOL.eq", Prog_Expr.eval_equal "#equal_"),
363 Rule.Thm ("plus_leq", ThmC.numerals_to_Free @{thm plus_leq}),
364 Rule.Thm ("minus_leq", ThmC.numerals_to_Free @{thm minus_leq}),
365 Rule.Thm ("rat_leq1", ThmC.numerals_to_Free @{thm rat_leq1}),
366 Rule.Thm ("rat_leq2", ThmC.numerals_to_Free @{thm rat_leq2}),
367 Rule.Thm ("rat_leq3", ThmC.numerals_to_Free @{thm rat_leq3})
370 val cancel_leading_coeff = prep_rls'(
371 Rule_Def.Repeat {id = "cancel_leading_coeff", preconds = [],
372 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord),
373 erls = PolyEq_erls, srls = Rule_Set.Empty, calc = [], errpatts = [],
375 [Rule.Thm ("cancel_leading_coeff1",ThmC.numerals_to_Free @{thm cancel_leading_coeff1}),
376 Rule.Thm ("cancel_leading_coeff2",ThmC.numerals_to_Free @{thm cancel_leading_coeff2}),
377 Rule.Thm ("cancel_leading_coeff3",ThmC.numerals_to_Free @{thm cancel_leading_coeff3}),
378 Rule.Thm ("cancel_leading_coeff4",ThmC.numerals_to_Free @{thm cancel_leading_coeff4}),
379 Rule.Thm ("cancel_leading_coeff5",ThmC.numerals_to_Free @{thm cancel_leading_coeff5}),
380 Rule.Thm ("cancel_leading_coeff6",ThmC.numerals_to_Free @{thm cancel_leading_coeff6}),
381 Rule.Thm ("cancel_leading_coeff7",ThmC.numerals_to_Free @{thm cancel_leading_coeff7}),
382 Rule.Thm ("cancel_leading_coeff8",ThmC.numerals_to_Free @{thm cancel_leading_coeff8}),
383 Rule.Thm ("cancel_leading_coeff9",ThmC.numerals_to_Free @{thm cancel_leading_coeff9}),
384 Rule.Thm ("cancel_leading_coeff10",ThmC.numerals_to_Free @{thm cancel_leading_coeff10}),
385 Rule.Thm ("cancel_leading_coeff11",ThmC.numerals_to_Free @{thm cancel_leading_coeff11}),
386 Rule.Thm ("cancel_leading_coeff12",ThmC.numerals_to_Free @{thm cancel_leading_coeff12}),
387 Rule.Thm ("cancel_leading_coeff13",ThmC.numerals_to_Free @{thm cancel_leading_coeff13})
388 ],scr = Rule.Empty_Prog});
390 val prep_rls' = Auto_Prog.prep_rls @{theory};
393 val complete_square = prep_rls'(
394 Rule_Def.Repeat {id = "complete_square", preconds = [],
395 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord),
396 erls = PolyEq_erls, srls = Rule_Set.Empty, calc = [], errpatts = [],
397 rules = [Rule.Thm ("complete_square1",ThmC.numerals_to_Free @{thm complete_square1}),
398 Rule.Thm ("complete_square2",ThmC.numerals_to_Free @{thm complete_square2}),
399 Rule.Thm ("complete_square3",ThmC.numerals_to_Free @{thm complete_square3}),
400 Rule.Thm ("complete_square4",ThmC.numerals_to_Free @{thm complete_square4}),
401 Rule.Thm ("complete_square5",ThmC.numerals_to_Free @{thm complete_square5})
403 scr = Rule.Empty_Prog
406 val polyeq_simplify = prep_rls'(
407 Rule_Def.Repeat {id = "polyeq_simplify", preconds = [],
408 rew_ord = ("termlessI",termlessI),
410 srls = Rule_Set.Empty,
411 calc = [], errpatts = [],
412 rules = [Rule.Thm ("real_assoc_1",ThmC.numerals_to_Free @{thm real_assoc_1}),
413 Rule.Thm ("real_assoc_2",ThmC.numerals_to_Free @{thm real_assoc_2}),
414 Rule.Thm ("real_diff_minus",ThmC.numerals_to_Free @{thm real_diff_minus}),
415 Rule.Thm ("real_unari_minus",ThmC.numerals_to_Free @{thm real_unari_minus}),
416 Rule.Thm ("realpow_multI",ThmC.numerals_to_Free @{thm realpow_multI}),
417 Rule.Eval ("Groups.plus_class.plus", (**)eval_binop "#add_"),
418 Rule.Eval ("Groups.minus_class.minus", (**)eval_binop "#sub_"),
419 Rule.Eval ("Groups.times_class.times", (**)eval_binop "#mult_"),
420 Rule.Eval ("Rings.divide_class.divide", Prog_Expr.eval_cancel "#divide_e"),
421 Rule.Eval ("NthRoot.sqrt", eval_sqrt "#sqrt_"),
422 Rule.Eval ("Transcendental.powr" , (**)eval_binop "#power_"),
425 scr = Rule.Empty_Prog
428 setup \<open>KEStore_Elems.add_rlss
429 [("cancel_leading_coeff", (Context.theory_name @{theory}, cancel_leading_coeff)),
430 ("complete_square", (Context.theory_name @{theory}, complete_square)),
431 ("PolyEq_erls", (Context.theory_name @{theory}, PolyEq_erls)),
432 ("polyeq_simplify", (Context.theory_name @{theory}, polyeq_simplify))]\<close>
435 (* ------------- polySolve ------------------ *)
437 (*isolate the bound variable in an d0 equation; 'bdv' is a meta-constant*)
438 val d0_polyeq_simplify = prep_rls'(
439 Rule_Def.Repeat {id = "d0_polyeq_simplify", preconds = [],
440 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord),
442 srls = Rule_Set.Empty,
443 calc = [], errpatts = [],
444 rules = [Rule.Thm("d0_true",ThmC.numerals_to_Free @{thm d0_true}),
445 Rule.Thm("d0_false",ThmC.numerals_to_Free @{thm d0_false})
447 scr = Rule.Empty_Prog
451 (*isolate the bound variable in an d1 equation; 'bdv' is a meta-constant*)
452 val d1_polyeq_simplify = prep_rls'(
453 Rule_Def.Repeat {id = "d1_polyeq_simplify", preconds = [],
454 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord),
456 srls = Rule_Set.Empty,
457 calc = [], errpatts = [],
459 Rule.Thm("d1_isolate_add1",ThmC.numerals_to_Free @{thm d1_isolate_add1}),
460 (* a+bx=0 -> bx=-a *)
461 Rule.Thm("d1_isolate_add2",ThmC.numerals_to_Free @{thm d1_isolate_add2}),
463 Rule.Thm("d1_isolate_div",ThmC.numerals_to_Free @{thm d1_isolate_div})
466 scr = Rule.Empty_Prog
470 subsection \<open>degree 2\<close>
472 (* isolate the bound variable in an d2 equation with bdv only;
473 "bdv" is a meta-constant substituted for the "x" below by isac's rewriter. *)
474 val d2_polyeq_bdv_only_simplify = prep_rls'(
475 Rule_Def.Repeat {id = "d2_polyeq_bdv_only_simplify", preconds = [], rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord),
476 erls = PolyEq_erls, srls = Rule_Set.Empty, calc = [], errpatts = [],
478 [Rule.Thm ("d2_prescind1", ThmC.numerals_to_Free @{thm d2_prescind1}), (* ax+bx^2=0 -> x(a+bx)=0 *)
479 Rule.Thm ("d2_prescind2", ThmC.numerals_to_Free @{thm d2_prescind2}), (* ax+ x^2=0 -> x(a+ x)=0 *)
480 Rule.Thm ("d2_prescind3", ThmC.numerals_to_Free @{thm d2_prescind3}), (* x+bx^2=0 -> x(1+bx)=0 *)
481 Rule.Thm ("d2_prescind4", ThmC.numerals_to_Free @{thm d2_prescind4}), (* x+ x^2=0 -> x(1+ x)=0 *)
482 Rule.Thm ("d2_sqrt_equation1", ThmC.numerals_to_Free @{thm d2_sqrt_equation1}), (* x^2=c -> x=+-sqrt(c) *)
483 Rule.Thm ("d2_sqrt_equation1_neg", ThmC.numerals_to_Free @{thm d2_sqrt_equation1_neg}), (* [0<c] x^2=c -> []*)
484 Rule.Thm ("d2_sqrt_equation2", ThmC.numerals_to_Free @{thm d2_sqrt_equation2}), (* x^2=0 -> x=0 *)
485 Rule.Thm ("d2_reduce_equation1", ThmC.numerals_to_Free @{thm d2_reduce_equation1}),(* x(a+bx)=0 -> x=0 |a+bx=0*)
486 Rule.Thm ("d2_reduce_equation2", ThmC.numerals_to_Free @{thm d2_reduce_equation2}),(* x(a+ x)=0 -> x=0 |a+ x=0*)
487 Rule.Thm ("d2_isolate_div", ThmC.numerals_to_Free @{thm d2_isolate_div}) (* bx^2=c -> x^2=c/b *)
489 scr = Rule.Empty_Prog
493 (* isolate the bound variable in an d2 equation with sqrt only;
494 'bdv' is a meta-constant*)
495 val d2_polyeq_sq_only_simplify = prep_rls'(
496 Rule_Def.Repeat {id = "d2_polyeq_sq_only_simplify", preconds = [],
497 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord),
499 srls = Rule_Set.Empty,
500 calc = [], errpatts = [],
501 (*asm_thm = [("d2_sqrt_equation1", ""),("d2_sqrt_equation1_neg", ""),
502 ("d2_isolate_div", "")],*)
503 rules = [Rule.Thm("d2_isolate_add1",ThmC.numerals_to_Free @{thm d2_isolate_add1}),
504 (* a+ bx^2=0 -> bx^2=(-1)a*)
505 Rule.Thm("d2_isolate_add2",ThmC.numerals_to_Free @{thm d2_isolate_add2}),
506 (* a+ x^2=0 -> x^2=(-1)a*)
507 Rule.Thm("d2_sqrt_equation2",ThmC.numerals_to_Free @{thm d2_sqrt_equation2}),
509 Rule.Thm("d2_sqrt_equation1",ThmC.numerals_to_Free @{thm d2_sqrt_equation1}),
510 (* x^2=c -> x=+-sqrt(c)*)
511 Rule.Thm("d2_sqrt_equation1_neg",ThmC.numerals_to_Free @{thm d2_sqrt_equation1_neg}),
512 (* [c<0] x^2=c -> x=[] *)
513 Rule.Thm("d2_isolate_div",ThmC.numerals_to_Free @{thm d2_isolate_div})
514 (* bx^2=c -> x^2=c/b*)
516 scr = Rule.Empty_Prog
520 (* isolate the bound variable in an d2 equation with pqFormula;
521 'bdv' is a meta-constant*)
522 val d2_polyeq_pqFormula_simplify = prep_rls'(
523 Rule_Def.Repeat {id = "d2_polyeq_pqFormula_simplify", preconds = [],
524 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord), erls = PolyEq_erls,
525 srls = Rule_Set.Empty, calc = [], errpatts = [],
526 rules = [Rule.Thm("d2_pqformula1",ThmC.numerals_to_Free @{thm d2_pqformula1}),
528 Rule.Thm("d2_pqformula1_neg",ThmC.numerals_to_Free @{thm d2_pqformula1_neg}),
530 Rule.Thm("d2_pqformula2",ThmC.numerals_to_Free @{thm d2_pqformula2}),
532 Rule.Thm("d2_pqformula2_neg",ThmC.numerals_to_Free @{thm d2_pqformula2_neg}),
534 Rule.Thm("d2_pqformula3",ThmC.numerals_to_Free @{thm d2_pqformula3}),
536 Rule.Thm("d2_pqformula3_neg",ThmC.numerals_to_Free @{thm d2_pqformula3_neg}),
538 Rule.Thm("d2_pqformula4",ThmC.numerals_to_Free @{thm d2_pqformula4}),
540 Rule.Thm("d2_pqformula4_neg",ThmC.numerals_to_Free @{thm d2_pqformula4_neg}),
542 Rule.Thm("d2_pqformula5",ThmC.numerals_to_Free @{thm d2_pqformula5}),
544 Rule.Thm("d2_pqformula6",ThmC.numerals_to_Free @{thm d2_pqformula6}),
546 Rule.Thm("d2_pqformula7",ThmC.numerals_to_Free @{thm d2_pqformula7}),
548 Rule.Thm("d2_pqformula8",ThmC.numerals_to_Free @{thm d2_pqformula8}),
550 Rule.Thm("d2_pqformula9",ThmC.numerals_to_Free @{thm d2_pqformula9}),
552 Rule.Thm("d2_pqformula9_neg",ThmC.numerals_to_Free @{thm d2_pqformula9_neg}),
554 Rule.Thm("d2_pqformula10",ThmC.numerals_to_Free @{thm d2_pqformula10}),
556 Rule.Thm("d2_pqformula10_neg",ThmC.numerals_to_Free @{thm d2_pqformula10_neg}),
558 Rule.Thm("d2_sqrt_equation2",ThmC.numerals_to_Free @{thm d2_sqrt_equation2}),
560 Rule.Thm("d2_sqrt_equation3",ThmC.numerals_to_Free @{thm d2_sqrt_equation3})
562 ],scr = Rule.Empty_Prog
566 (* isolate the bound variable in an d2 equation with abcFormula;
567 'bdv' is a meta-constant*)
568 val d2_polyeq_abcFormula_simplify = prep_rls'(
569 Rule_Def.Repeat {id = "d2_polyeq_abcFormula_simplify", preconds = [],
570 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord), erls = PolyEq_erls,
571 srls = Rule_Set.Empty, calc = [], errpatts = [],
572 rules = [Rule.Thm("d2_abcformula1",ThmC.numerals_to_Free @{thm d2_abcformula1}),
574 Rule.Thm("d2_abcformula1_neg",ThmC.numerals_to_Free @{thm d2_abcformula1_neg}),
576 Rule.Thm("d2_abcformula2",ThmC.numerals_to_Free @{thm d2_abcformula2}),
578 Rule.Thm("d2_abcformula2_neg",ThmC.numerals_to_Free @{thm d2_abcformula2_neg}),
580 Rule.Thm("d2_abcformula3",ThmC.numerals_to_Free @{thm d2_abcformula3}),
582 Rule.Thm("d2_abcformula3_neg",ThmC.numerals_to_Free @{thm d2_abcformula3_neg}),
584 Rule.Thm("d2_abcformula4",ThmC.numerals_to_Free @{thm d2_abcformula4}),
586 Rule.Thm("d2_abcformula4_neg",ThmC.numerals_to_Free @{thm d2_abcformula4_neg}),
588 Rule.Thm("d2_abcformula5",ThmC.numerals_to_Free @{thm d2_abcformula5}),
590 Rule.Thm("d2_abcformula5_neg",ThmC.numerals_to_Free @{thm d2_abcformula5_neg}),
592 Rule.Thm("d2_abcformula6",ThmC.numerals_to_Free @{thm d2_abcformula6}),
594 Rule.Thm("d2_abcformula6_neg",ThmC.numerals_to_Free @{thm d2_abcformula6_neg}),
596 Rule.Thm("d2_abcformula7",ThmC.numerals_to_Free @{thm d2_abcformula7}),
598 Rule.Thm("d2_abcformula8",ThmC.numerals_to_Free @{thm d2_abcformula8}),
600 Rule.Thm("d2_abcformula9",ThmC.numerals_to_Free @{thm d2_abcformula9}),
602 Rule.Thm("d2_abcformula10",ThmC.numerals_to_Free @{thm d2_abcformula10}),
604 Rule.Thm("d2_sqrt_equation2",ThmC.numerals_to_Free @{thm d2_sqrt_equation2}),
606 Rule.Thm("d2_sqrt_equation3",ThmC.numerals_to_Free @{thm d2_sqrt_equation3})
609 scr = Rule.Empty_Prog
614 (* isolate the bound variable in an d2 equation;
615 'bdv' is a meta-constant*)
616 val d2_polyeq_simplify = prep_rls'(
617 Rule_Def.Repeat {id = "d2_polyeq_simplify", preconds = [],
618 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord), erls = PolyEq_erls,
619 srls = Rule_Set.Empty, calc = [], errpatts = [],
620 rules = [Rule.Thm("d2_pqformula1",ThmC.numerals_to_Free @{thm d2_pqformula1}),
622 Rule.Thm("d2_pqformula1_neg",ThmC.numerals_to_Free @{thm d2_pqformula1_neg}),
624 Rule.Thm("d2_pqformula2",ThmC.numerals_to_Free @{thm d2_pqformula2}),
626 Rule.Thm("d2_pqformula2_neg",ThmC.numerals_to_Free @{thm d2_pqformula2_neg}),
628 Rule.Thm("d2_pqformula3",ThmC.numerals_to_Free @{thm d2_pqformula3}),
630 Rule.Thm("d2_pqformula3_neg",ThmC.numerals_to_Free @{thm d2_pqformula3_neg}),
632 Rule.Thm("d2_pqformula4",ThmC.numerals_to_Free @{thm d2_pqformula4}),
634 Rule.Thm("d2_pqformula4_neg",ThmC.numerals_to_Free @{thm d2_pqformula4_neg}),
636 Rule.Thm("d2_abcformula1",ThmC.numerals_to_Free @{thm d2_abcformula1}),
638 Rule.Thm("d2_abcformula1_neg",ThmC.numerals_to_Free @{thm d2_abcformula1_neg}),
640 Rule.Thm("d2_abcformula2",ThmC.numerals_to_Free @{thm d2_abcformula2}),
642 Rule.Thm("d2_abcformula2_neg",ThmC.numerals_to_Free @{thm d2_abcformula2_neg}),
644 Rule.Thm("d2_prescind1",ThmC.numerals_to_Free @{thm d2_prescind1}),
645 (* ax+bx^2=0 -> x(a+bx)=0 *)
646 Rule.Thm("d2_prescind2",ThmC.numerals_to_Free @{thm d2_prescind2}),
647 (* ax+ x^2=0 -> x(a+ x)=0 *)
648 Rule.Thm("d2_prescind3",ThmC.numerals_to_Free @{thm d2_prescind3}),
649 (* x+bx^2=0 -> x(1+bx)=0 *)
650 Rule.Thm("d2_prescind4",ThmC.numerals_to_Free @{thm d2_prescind4}),
651 (* x+ x^2=0 -> x(1+ x)=0 *)
652 Rule.Thm("d2_isolate_add1",ThmC.numerals_to_Free @{thm d2_isolate_add1}),
653 (* a+ bx^2=0 -> bx^2=(-1)a*)
654 Rule.Thm("d2_isolate_add2",ThmC.numerals_to_Free @{thm d2_isolate_add2}),
655 (* a+ x^2=0 -> x^2=(-1)a*)
656 Rule.Thm("d2_sqrt_equation1",ThmC.numerals_to_Free @{thm d2_sqrt_equation1}),
657 (* x^2=c -> x=+-sqrt(c)*)
658 Rule.Thm("d2_sqrt_equation1_neg",ThmC.numerals_to_Free @{thm d2_sqrt_equation1_neg}),
659 (* [c<0] x^2=c -> x=[]*)
660 Rule.Thm("d2_sqrt_equation2",ThmC.numerals_to_Free @{thm d2_sqrt_equation2}),
662 Rule.Thm("d2_reduce_equation1",ThmC.numerals_to_Free @{thm d2_reduce_equation1}),
663 (* x(a+bx)=0 -> x=0 | a+bx=0*)
664 Rule.Thm("d2_reduce_equation2",ThmC.numerals_to_Free @{thm d2_reduce_equation2}),
665 (* x(a+ x)=0 -> x=0 | a+ x=0*)
666 Rule.Thm("d2_isolate_div",ThmC.numerals_to_Free @{thm d2_isolate_div})
667 (* bx^2=c -> x^2=c/b*)
669 scr = Rule.Empty_Prog
675 (* isolate the bound variable in an d3 equation; 'bdv' is a meta-constant *)
676 val d3_polyeq_simplify = prep_rls'(
677 Rule_Def.Repeat {id = "d3_polyeq_simplify", preconds = [],
678 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord), erls = PolyEq_erls,
679 srls = Rule_Set.Empty, calc = [], errpatts = [],
681 [Rule.Thm("d3_reduce_equation1",ThmC.numerals_to_Free @{thm d3_reduce_equation1}),
682 (*a*bdv + b*bdv \<up> 2 + c*bdv \<up> 3=0) =
683 (bdv=0 | (a + b*bdv + c*bdv \<up> 2=0)*)
684 Rule.Thm("d3_reduce_equation2",ThmC.numerals_to_Free @{thm d3_reduce_equation2}),
685 (* bdv + b*bdv \<up> 2 + c*bdv \<up> 3=0) =
686 (bdv=0 | (1 + b*bdv + c*bdv \<up> 2=0)*)
687 Rule.Thm("d3_reduce_equation3",ThmC.numerals_to_Free @{thm d3_reduce_equation3}),
688 (*a*bdv + bdv \<up> 2 + c*bdv \<up> 3=0) =
689 (bdv=0 | (a + bdv + c*bdv \<up> 2=0)*)
690 Rule.Thm("d3_reduce_equation4",ThmC.numerals_to_Free @{thm d3_reduce_equation4}),
691 (* bdv + bdv \<up> 2 + c*bdv \<up> 3=0) =
692 (bdv=0 | (1 + bdv + c*bdv \<up> 2=0)*)
693 Rule.Thm("d3_reduce_equation5",ThmC.numerals_to_Free @{thm d3_reduce_equation5}),
694 (*a*bdv + b*bdv \<up> 2 + bdv \<up> 3=0) =
695 (bdv=0 | (a + b*bdv + bdv \<up> 2=0)*)
696 Rule.Thm("d3_reduce_equation6",ThmC.numerals_to_Free @{thm d3_reduce_equation6}),
697 (* bdv + b*bdv \<up> 2 + bdv \<up> 3=0) =
698 (bdv=0 | (1 + b*bdv + bdv \<up> 2=0)*)
699 Rule.Thm("d3_reduce_equation7",ThmC.numerals_to_Free @{thm d3_reduce_equation7}),
700 (*a*bdv + bdv \<up> 2 + bdv \<up> 3=0) =
701 (bdv=0 | (1 + bdv + bdv \<up> 2=0)*)
702 Rule.Thm("d3_reduce_equation8",ThmC.numerals_to_Free @{thm d3_reduce_equation8}),
703 (* bdv + bdv \<up> 2 + bdv \<up> 3=0) =
704 (bdv=0 | (1 + bdv + bdv \<up> 2=0)*)
705 Rule.Thm("d3_reduce_equation9",ThmC.numerals_to_Free @{thm d3_reduce_equation9}),
706 (*a*bdv + c*bdv \<up> 3=0) =
707 (bdv=0 | (a + c*bdv \<up> 2=0)*)
708 Rule.Thm("d3_reduce_equation10",ThmC.numerals_to_Free @{thm d3_reduce_equation10}),
709 (* bdv + c*bdv \<up> 3=0) =
710 (bdv=0 | (1 + c*bdv \<up> 2=0)*)
711 Rule.Thm("d3_reduce_equation11",ThmC.numerals_to_Free @{thm d3_reduce_equation11}),
712 (*a*bdv + bdv \<up> 3=0) =
713 (bdv=0 | (a + bdv \<up> 2=0)*)
714 Rule.Thm("d3_reduce_equation12",ThmC.numerals_to_Free @{thm d3_reduce_equation12}),
715 (* bdv + bdv \<up> 3=0) =
716 (bdv=0 | (1 + bdv \<up> 2=0)*)
717 Rule.Thm("d3_reduce_equation13",ThmC.numerals_to_Free @{thm d3_reduce_equation13}),
718 (* b*bdv \<up> 2 + c*bdv \<up> 3=0) =
719 (bdv=0 | ( b*bdv + c*bdv \<up> 2=0)*)
720 Rule.Thm("d3_reduce_equation14",ThmC.numerals_to_Free @{thm d3_reduce_equation14}),
721 (* bdv \<up> 2 + c*bdv \<up> 3=0) =
722 (bdv=0 | ( bdv + c*bdv \<up> 2=0)*)
723 Rule.Thm("d3_reduce_equation15",ThmC.numerals_to_Free @{thm d3_reduce_equation15}),
724 (* b*bdv \<up> 2 + bdv \<up> 3=0) =
725 (bdv=0 | ( b*bdv + bdv \<up> 2=0)*)
726 Rule.Thm("d3_reduce_equation16",ThmC.numerals_to_Free @{thm d3_reduce_equation16}),
727 (* bdv \<up> 2 + bdv \<up> 3=0) =
728 (bdv=0 | ( bdv + bdv \<up> 2=0)*)
729 Rule.Thm("d3_isolate_add1",ThmC.numerals_to_Free @{thm d3_isolate_add1}),
730 (*[|Not(bdv occurs_in a)|] ==> (a + b*bdv \<up> 3=0) =
731 (bdv=0 | (b*bdv \<up> 3=a)*)
732 Rule.Thm("d3_isolate_add2",ThmC.numerals_to_Free @{thm d3_isolate_add2}),
733 (*[|Not(bdv occurs_in a)|] ==> (a + bdv \<up> 3=0) =
734 (bdv=0 | ( bdv \<up> 3=a)*)
735 Rule.Thm("d3_isolate_div",ThmC.numerals_to_Free @{thm d3_isolate_div}),
736 (*[|Not(b=0)|] ==> (b*bdv \<up> 3=c) = (bdv \<up> 3=c/b*)
737 Rule.Thm("d3_root_equation2",ThmC.numerals_to_Free @{thm d3_root_equation2}),
738 (*(bdv \<up> 3=0) = (bdv=0) *)
739 Rule.Thm("d3_root_equation1",ThmC.numerals_to_Free @{thm d3_root_equation1})
740 (*bdv \<up> 3=c) = (bdv = nroot 3 c*)
742 scr = Rule.Empty_Prog
748 (*isolate the bound variable in an d4 equation; 'bdv' is a meta-constant*)
749 val d4_polyeq_simplify = prep_rls'(
750 Rule_Def.Repeat {id = "d4_polyeq_simplify", preconds = [],
751 rew_ord = ("e_rew_ord",Rewrite_Ord.e_rew_ord), erls = PolyEq_erls,
752 srls = Rule_Set.Empty, calc = [], errpatts = [],
754 [Rule.Thm("d4_sub_u1",ThmC.numerals_to_Free @{thm d4_sub_u1})
755 (* ax^4+bx^2+c=0 -> x=+-sqrt(ax^2+bx^+c) *)
757 scr = Rule.Empty_Prog
760 setup \<open>KEStore_Elems.add_rlss
761 [("d0_polyeq_simplify", (Context.theory_name @{theory}, d0_polyeq_simplify)),
762 ("d1_polyeq_simplify", (Context.theory_name @{theory}, d1_polyeq_simplify)),
763 ("d2_polyeq_simplify", (Context.theory_name @{theory}, d2_polyeq_simplify)),
764 ("d2_polyeq_bdv_only_simplify", (Context.theory_name @{theory}, d2_polyeq_bdv_only_simplify)),
765 ("d2_polyeq_sq_only_simplify", (Context.theory_name @{theory}, d2_polyeq_sq_only_simplify)),
767 ("d2_polyeq_pqFormula_simplify",
768 (Context.theory_name @{theory}, d2_polyeq_pqFormula_simplify)),
769 ("d2_polyeq_abcFormula_simplify",
770 (Context.theory_name @{theory}, d2_polyeq_abcFormula_simplify)),
771 ("d3_polyeq_simplify", (Context.theory_name @{theory}, d3_polyeq_simplify)),
772 ("d4_polyeq_simplify", (Context.theory_name @{theory}, d4_polyeq_simplify))]\<close>
774 setup \<open>KEStore_Elems.add_pbts
775 [(Problem.prep_input thy "pbl_equ_univ_poly" [] Problem.id_empty
776 (["polynomial", "univariate", "equation"],
777 [("#Given" ,["equality e_e", "solveFor v_v"]),
778 ("#Where" ,["~((e_e::bool) is_ratequation_in (v_v::real))",
779 "~((lhs e_e) is_rootTerm_in (v_v::real))",
780 "~((rhs e_e) is_rootTerm_in (v_v::real))"]),
781 ("#Find" ,["solutions v_v'i'"])],
782 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [])),
784 (Problem.prep_input thy "pbl_equ_univ_poly_deg0" [] Problem.id_empty
785 (["degree_0", "polynomial", "univariate", "equation"],
786 [("#Given" ,["equality e_e", "solveFor v_v"]),
787 ("#Where" ,["matches (?a = 0) e_e",
788 "(lhs e_e) is_poly_in v_v",
789 "((lhs e_e) has_degree_in v_v ) = 0"]),
790 ("#Find" ,["solutions v_v'i'"])],
791 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [["PolyEq", "solve_d0_polyeq_equation"]])),
793 (Problem.prep_input thy "pbl_equ_univ_poly_deg1" [] Problem.id_empty
794 (["degree_1", "polynomial", "univariate", "equation"],
795 [("#Given" ,["equality e_e", "solveFor v_v"]),
796 ("#Where" ,["matches (?a = 0) e_e",
797 "(lhs e_e) is_poly_in v_v",
798 "((lhs e_e) has_degree_in v_v ) = 1"]),
799 ("#Find" ,["solutions v_v'i'"])],
800 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [["PolyEq", "solve_d1_polyeq_equation"]])),
802 (Problem.prep_input thy "pbl_equ_univ_poly_deg2" [] Problem.id_empty
803 (["degree_2", "polynomial", "univariate", "equation"],
804 [("#Given" ,["equality e_e", "solveFor v_v"]),
805 ("#Where" ,["matches (?a = 0) e_e",
806 "(lhs e_e) is_poly_in v_v ",
807 "((lhs e_e) has_degree_in v_v ) = 2"]),
808 ("#Find" ,["solutions v_v'i'"])],
809 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [["PolyEq", "solve_d2_polyeq_equation"]])),
810 (Problem.prep_input thy "pbl_equ_univ_poly_deg2_sqonly" [] Problem.id_empty
811 (["sq_only", "degree_2", "polynomial", "univariate", "equation"],
812 [("#Given" ,["equality e_e", "solveFor v_v"]),
813 ("#Where" ,["matches ( ?a + ?v_ \<up> 2 = 0) e_e | " ^
814 "matches ( ?a + ?b*?v_ \<up> 2 = 0) e_e | " ^
815 "matches ( ?v_ \<up> 2 = 0) e_e | " ^
816 "matches ( ?b*?v_ \<up> 2 = 0) e_e" ,
817 "Not (matches (?a + ?v_ + ?v_ \<up> 2 = 0) e_e) &" ^
818 "Not (matches (?a + ?b*?v_ + ?v_ \<up> 2 = 0) e_e) &" ^
819 "Not (matches (?a + ?v_ + ?c*?v_ \<up> 2 = 0) e_e) &" ^
820 "Not (matches (?a + ?b*?v_ + ?c*?v_ \<up> 2 = 0) e_e) &" ^
821 "Not (matches ( ?v_ + ?v_ \<up> 2 = 0) e_e) &" ^
822 "Not (matches ( ?b*?v_ + ?v_ \<up> 2 = 0) e_e) &" ^
823 "Not (matches ( ?v_ + ?c*?v_ \<up> 2 = 0) e_e) &" ^
824 "Not (matches ( ?b*?v_ + ?c*?v_ \<up> 2 = 0) e_e)"]),
825 ("#Find" ,["solutions v_v'i'"])],
826 PolyEq_prls, SOME "solve (e_e::bool, v_v)",
827 [["PolyEq", "solve_d2_polyeq_sqonly_equation"]])),
828 (Problem.prep_input thy "pbl_equ_univ_poly_deg2_bdvonly" [] Problem.id_empty
829 (["bdv_only", "degree_2", "polynomial", "univariate", "equation"],
830 [("#Given", ["equality e_e", "solveFor v_v"]),
831 ("#Where", ["matches (?a*?v_ + ?v_ \<up> 2 = 0) e_e | " ^
832 "matches ( ?v_ + ?v_ \<up> 2 = 0) e_e | " ^
833 "matches ( ?v_ + ?b*?v_ \<up> 2 = 0) e_e | " ^
834 "matches (?a*?v_ + ?b*?v_ \<up> 2 = 0) e_e | " ^
835 "matches ( ?v_ \<up> 2 = 0) e_e | " ^
836 "matches ( ?b*?v_ \<up> 2 = 0) e_e "]),
837 ("#Find", ["solutions v_v'i'"])],
838 PolyEq_prls, SOME "solve (e_e::bool, v_v)",
839 [["PolyEq", "solve_d2_polyeq_bdvonly_equation"]])),
840 (Problem.prep_input thy "pbl_equ_univ_poly_deg2_pq" [] Problem.id_empty
841 (["pqFormula", "degree_2", "polynomial", "univariate", "equation"],
842 [("#Given", ["equality e_e", "solveFor v_v"]),
843 ("#Where", ["matches (?a + 1*?v_ \<up> 2 = 0) e_e | " ^
844 "matches (?a + ?v_ \<up> 2 = 0) e_e"]),
845 ("#Find", ["solutions v_v'i'"])],
846 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [["PolyEq", "solve_d2_polyeq_pq_equation"]])),
847 (Problem.prep_input thy "pbl_equ_univ_poly_deg2_abc" [] Problem.id_empty
848 (["abcFormula", "degree_2", "polynomial", "univariate", "equation"],
849 [("#Given", ["equality e_e", "solveFor v_v"]),
850 ("#Where", ["matches (?a + ?v_ \<up> 2 = 0) e_e | " ^
851 "matches (?a + ?b*?v_ \<up> 2 = 0) e_e"]),
852 ("#Find", ["solutions v_v'i'"])],
853 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [["PolyEq", "solve_d2_polyeq_abc_equation"]])),
855 (Problem.prep_input thy "pbl_equ_univ_poly_deg3" [] Problem.id_empty
856 (["degree_3", "polynomial", "univariate", "equation"],
857 [("#Given", ["equality e_e", "solveFor v_v"]),
858 ("#Where", ["matches (?a = 0) e_e",
859 "(lhs e_e) is_poly_in v_v ",
860 "((lhs e_e) has_degree_in v_v) = 3"]),
861 ("#Find", ["solutions v_v'i'"])],
862 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [["PolyEq", "solve_d3_polyeq_equation"]])),
864 (Problem.prep_input thy "pbl_equ_univ_poly_deg4" [] Problem.id_empty
865 (["degree_4", "polynomial", "univariate", "equation"],
866 [("#Given", ["equality e_e", "solveFor v_v"]),
867 ("#Where", ["matches (?a = 0) e_e",
868 "(lhs e_e) is_poly_in v_v ",
869 "((lhs e_e) has_degree_in v_v) = 4"]),
870 ("#Find", ["solutions v_v'i'"])],
871 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [(*["PolyEq", "solve_d4_polyeq_equation"]*)])),
872 (*--- normalise ---*)
873 (Problem.prep_input thy "pbl_equ_univ_poly_norm" [] Problem.id_empty
874 (["normalise", "polynomial", "univariate", "equation"],
875 [("#Given", ["equality e_e", "solveFor v_v"]),
876 ("#Where", ["(Not((matches (?a = 0 ) e_e ))) |" ^
877 "(Not(((lhs e_e) is_poly_in v_v)))"]),
878 ("#Find", ["solutions v_v'i'"])],
879 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [["PolyEq", "normalise_poly"]])),
880 (*-------------------------expanded-----------------------*)
881 (Problem.prep_input thy "pbl_equ_univ_expand" [] Problem.id_empty
882 (["expanded", "univariate", "equation"],
883 [("#Given", ["equality e_e", "solveFor v_v"]),
884 ("#Where", ["matches (?a = 0) e_e",
885 "(lhs e_e) is_expanded_in v_v "]),
886 ("#Find", ["solutions v_v'i'"])],
887 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [])),
889 (Problem.prep_input thy "pbl_equ_univ_expand_deg2" [] Problem.id_empty
890 (["degree_2", "expanded", "univariate", "equation"],
891 [("#Given", ["equality e_e", "solveFor v_v"]),
892 ("#Where", ["((lhs e_e) has_degree_in v_v) = 2"]),
893 ("#Find", ["solutions v_v'i'"])],
894 PolyEq_prls, SOME "solve (e_e::bool, v_v)", [["PolyEq", "complete_square"]]))]\<close>
896 text \<open>"-------------------------methods-----------------------"\<close>
897 setup \<open>KEStore_Elems.add_mets
898 [MethodC.prep_input thy "met_polyeq" [] MethodC.id_empty
900 {rew_ord'="tless_true",rls'=Atools_erls,calc = [], srls = Rule_Set.empty, prls=Rule_Set.empty,
901 crls=PolyEq_crls, errpats = [], nrls = norm_Rational},
905 partial_function (tailrec) normalize_poly_eq :: "bool \<Rightarrow> real \<Rightarrow> bool"
907 "normalize_poly_eq e_e v_v = (
910 (Try (Rewrite ''all_left'')) #>
911 (Try (Repeat (Rewrite ''makex1_x''))) #>
912 (Try (Repeat (Rewrite_Set ''expand_binoms''))) #>
913 (Try (Repeat (Rewrite_Set_Inst [(''bdv'', v_v)] ''make_ratpoly_in''))) #>
914 (Try (Repeat (Rewrite_Set ''polyeq_simplify''))) ) e_e
916 SubProblem (''PolyEq'', [''polynomial'', ''univariate'', ''equation''], [''no_met''])
917 [BOOL e_e, REAL v_v])"
918 setup \<open>KEStore_Elems.add_mets
919 [MethodC.prep_input thy "met_polyeq_norm" [] MethodC.id_empty
920 (["PolyEq", "normalise_poly"],
921 [("#Given" ,["equality e_e", "solveFor v_v"]),
922 ("#Where" ,["(Not((matches (?a = 0 ) e_e ))) | (Not(((lhs e_e) is_poly_in v_v)))"]),
923 ("#Find" ,["solutions v_v'i'"])],
924 {rew_ord'="termlessI", rls'=PolyEq_erls, srls=Rule_Set.empty, prls=PolyEq_prls, calc=[],
925 crls=PolyEq_crls, errpats = [], nrls = norm_Rational},
926 @{thm normalize_poly_eq.simps})]
929 partial_function (tailrec) solve_poly_equ :: "bool \<Rightarrow> real \<Rightarrow> bool list"
931 "solve_poly_equ e_e v_v = (
933 e_e = (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d0_polyeq_simplify'')) e_e
936 setup \<open>KEStore_Elems.add_mets
937 [MethodC.prep_input thy "met_polyeq_d0" [] MethodC.id_empty
938 (["PolyEq", "solve_d0_polyeq_equation"],
939 [("#Given" ,["equality e_e", "solveFor v_v"]),
940 ("#Where" ,["(lhs e_e) is_poly_in v_v ", "((lhs e_e) has_degree_in v_v) = 0"]),
941 ("#Find" ,["solutions v_v'i'"])],
942 {rew_ord'="termlessI", rls'=PolyEq_erls, srls=Rule_Set.empty, prls=PolyEq_prls,
943 calc=[("sqrt", ("NthRoot.sqrt", eval_sqrt "#sqrt_"))], crls=PolyEq_crls, errpats = [],
944 nrls = norm_Rational},
945 @{thm solve_poly_equ.simps})]
948 partial_function (tailrec) solve_poly_eq1 :: "bool \<Rightarrow> real \<Rightarrow> bool list"
950 "solve_poly_eq1 e_e v_v = (
953 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d1_polyeq_simplify'')) #>
954 (Try (Rewrite_Set ''polyeq_simplify'')) #>
955 (Try (Rewrite_Set ''norm_Rational_parenthesized'')) ) e_e;
958 Check_elementwise L_L {(v_v::real). Assumptions})"
959 setup \<open>KEStore_Elems.add_mets
960 [MethodC.prep_input thy "met_polyeq_d1" [] MethodC.id_empty
961 (["PolyEq", "solve_d1_polyeq_equation"],
962 [("#Given" ,["equality e_e", "solveFor v_v"]),
963 ("#Where" ,["(lhs e_e) is_poly_in v_v ", "((lhs e_e) has_degree_in v_v) = 1"]),
964 ("#Find" ,["solutions v_v'i'"])],
965 {rew_ord'="termlessI", rls'=PolyEq_erls, srls=Rule_Set.empty, prls=PolyEq_prls,
966 calc=[("sqrt", ("NthRoot.sqrt", eval_sqrt "#sqrt_"))], crls=PolyEq_crls, errpats = [],
967 nrls = norm_Rational},
968 @{thm solve_poly_eq1.simps})]
971 partial_function (tailrec) solve_poly_equ2 :: "bool \<Rightarrow> real \<Rightarrow> bool list"
973 "solve_poly_equ2 e_e v_v = (
976 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d2_polyeq_simplify'')) #>
977 (Try (Rewrite_Set ''polyeq_simplify'')) #>
978 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d1_polyeq_simplify'')) #>
979 (Try (Rewrite_Set ''polyeq_simplify'')) #>
980 (Try (Rewrite_Set ''norm_Rational_parenthesized'')) ) e_e;
983 Check_elementwise L_L {(v_v::real). Assumptions})"
984 setup \<open>KEStore_Elems.add_mets
985 [MethodC.prep_input thy "met_polyeq_d22" [] MethodC.id_empty
986 (["PolyEq", "solve_d2_polyeq_equation"],
987 [("#Given" ,["equality e_e", "solveFor v_v"]),
988 ("#Where" ,["(lhs e_e) is_poly_in v_v ", "((lhs e_e) has_degree_in v_v) = 2"]),
989 ("#Find" ,["solutions v_v'i'"])],
990 {rew_ord'="termlessI", rls'=PolyEq_erls, srls=Rule_Set.empty, prls=PolyEq_prls,
991 calc=[("sqrt", ("NthRoot.sqrt", eval_sqrt "#sqrt_"))], crls=PolyEq_crls, errpats = [],
992 nrls = norm_Rational},
993 @{thm solve_poly_equ2.simps})]
996 partial_function (tailrec) solve_poly_equ0 :: "bool \<Rightarrow> real \<Rightarrow> bool list"
998 "solve_poly_equ0 e_e v_v = (
1001 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d2_polyeq_bdv_only_simplify'')) #>
1002 (Try (Rewrite_Set ''polyeq_simplify'')) #>
1003 (Try (Rewrite_Set_Inst [(''bdv'',v_v::real)] ''d1_polyeq_simplify'')) #>
1004 (Try (Rewrite_Set ''polyeq_simplify'')) #>
1005 (Try (Rewrite_Set ''norm_Rational_parenthesized'')) ) e_e;
1006 L_L = Or_to_List e_e
1008 Check_elementwise L_L {(v_v::real). Assumptions})"
1009 setup \<open>KEStore_Elems.add_mets
1010 [MethodC.prep_input thy "met_polyeq_d2_bdvonly" [] MethodC.id_empty
1011 (["PolyEq", "solve_d2_polyeq_bdvonly_equation"],
1012 [("#Given" ,["equality e_e", "solveFor v_v"]),
1013 ("#Where" ,["(lhs e_e) is_poly_in v_v ", "((lhs e_e) has_degree_in v_v) = 2"]),
1014 ("#Find" ,["solutions v_v'i'"])],
1015 {rew_ord'="termlessI", rls'=PolyEq_erls, srls=Rule_Set.empty, prls=PolyEq_prls,
1016 calc=[("sqrt", ("NthRoot.sqrt", eval_sqrt "#sqrt_"))], crls=PolyEq_crls, errpats = [],
1017 nrls = norm_Rational},
1018 @{thm solve_poly_equ0.simps})]
1021 partial_function (tailrec) solve_poly_equ_sqrt :: "bool \<Rightarrow> real \<Rightarrow> bool list"
1023 "solve_poly_equ_sqrt e_e v_v = (
1026 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d2_polyeq_sq_only_simplify'')) #>
1027 (Try (Rewrite_Set ''polyeq_simplify'')) #>
1028 (Try (Rewrite_Set ''norm_Rational_parenthesized'')) ) e_e;
1029 L_L = Or_to_List e_e
1031 Check_elementwise L_L {(v_v::real). Assumptions})"
1032 setup \<open>KEStore_Elems.add_mets
1033 [MethodC.prep_input thy "met_polyeq_d2_sqonly" [] MethodC.id_empty
1034 (["PolyEq", "solve_d2_polyeq_sqonly_equation"],
1035 [("#Given" ,["equality e_e", "solveFor v_v"]),
1036 ("#Where" ,["(lhs e_e) is_poly_in v_v ", "((lhs e_e) has_degree_in v_v) = 2"]),
1037 ("#Find" ,["solutions v_v'i'"])],
1038 {rew_ord'="termlessI", rls'=PolyEq_erls, srls=Rule_Set.empty, prls=PolyEq_prls,
1039 calc=[("sqrt", ("NthRoot.sqrt", eval_sqrt "#sqrt_"))], crls=PolyEq_crls, errpats = [],
1040 nrls = norm_Rational},
1041 @{thm solve_poly_equ_sqrt.simps})]
1044 partial_function (tailrec) solve_poly_equ_pq :: "bool \<Rightarrow> real \<Rightarrow> bool list"
1046 "solve_poly_equ_pq e_e v_v = (
1049 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d2_polyeq_pqFormula_simplify'')) #>
1050 (Try (Rewrite_Set ''polyeq_simplify'')) #>
1051 (Try (Rewrite_Set ''norm_Rational_parenthesized'')) ) e_e;
1052 L_L = Or_to_List e_e
1054 Check_elementwise L_L {(v_v::real). Assumptions})"
1055 setup \<open>KEStore_Elems.add_mets
1056 [MethodC.prep_input thy "met_polyeq_d2_pq" [] MethodC.id_empty
1057 (["PolyEq", "solve_d2_polyeq_pq_equation"],
1058 [("#Given" ,["equality e_e", "solveFor v_v"]),
1059 ("#Where" ,["(lhs e_e) is_poly_in v_v ", "((lhs e_e) has_degree_in v_v) = 2"]),
1060 ("#Find" ,["solutions v_v'i'"])],
1061 {rew_ord'="termlessI", rls'=PolyEq_erls, srls=Rule_Set.empty, prls=PolyEq_prls,
1062 calc=[("sqrt", ("NthRoot.sqrt", eval_sqrt "#sqrt_"))], crls=PolyEq_crls, errpats = [],
1063 nrls = norm_Rational},
1064 @{thm solve_poly_equ_pq.simps})]
1067 partial_function (tailrec) solve_poly_equ_abc :: "bool \<Rightarrow> real \<Rightarrow> bool list"
1069 "solve_poly_equ_abc e_e v_v = (
1072 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d2_polyeq_abcFormula_simplify'')) #>
1073 (Try (Rewrite_Set ''polyeq_simplify'')) #>
1074 (Try (Rewrite_Set ''norm_Rational_parenthesized'')) ) e_e;
1075 L_L = Or_to_List e_e
1076 in Check_elementwise L_L {(v_v::real). Assumptions})"
1077 setup \<open>KEStore_Elems.add_mets
1078 [MethodC.prep_input thy "met_polyeq_d2_abc" [] MethodC.id_empty
1079 (["PolyEq", "solve_d2_polyeq_abc_equation"],
1080 [("#Given" ,["equality e_e", "solveFor v_v"]),
1081 ("#Where" ,["(lhs e_e) is_poly_in v_v ", "((lhs e_e) has_degree_in v_v) = 2"]),
1082 ("#Find" ,["solutions v_v'i'"])],
1083 {rew_ord'="termlessI", rls'=PolyEq_erls,srls=Rule_Set.empty, prls=PolyEq_prls,
1084 calc=[("sqrt", ("NthRoot.sqrt", eval_sqrt "#sqrt_"))], crls=PolyEq_crls, errpats = [],
1085 nrls = norm_Rational},
1086 @{thm solve_poly_equ_abc.simps})]
1089 partial_function (tailrec) solve_poly_equ3 :: "bool \<Rightarrow> real \<Rightarrow> bool list"
1091 "solve_poly_equ3 e_e v_v = (
1094 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d3_polyeq_simplify'')) #>
1095 (Try (Rewrite_Set ''polyeq_simplify'')) #>
1096 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''d2_polyeq_simplify'')) #>
1097 (Try (Rewrite_Set ''polyeq_simplify'')) #>
1098 (Try (Rewrite_Set_Inst [(''bdv'',v_v)] ''d1_polyeq_simplify'')) #>
1099 (Try (Rewrite_Set ''polyeq_simplify'')) #>
1100 (Try (Rewrite_Set ''norm_Rational_parenthesized''))) e_e;
1101 L_L = Or_to_List e_e
1103 Check_elementwise L_L {(v_v::real). Assumptions})"
1104 setup \<open>KEStore_Elems.add_mets
1105 [MethodC.prep_input thy "met_polyeq_d3" [] MethodC.id_empty
1106 (["PolyEq", "solve_d3_polyeq_equation"],
1107 [("#Given" ,["equality e_e", "solveFor v_v"]),
1108 ("#Where" ,["(lhs e_e) is_poly_in v_v ", "((lhs e_e) has_degree_in v_v) = 3"]),
1109 ("#Find" ,["solutions v_v'i'"])],
1110 {rew_ord'="termlessI", rls'=PolyEq_erls, srls=Rule_Set.empty, prls=PolyEq_prls,
1111 calc=[("sqrt", ("NthRoot.sqrt", eval_sqrt "#sqrt_"))], crls=PolyEq_crls, errpats = [],
1112 nrls = norm_Rational},
1113 @{thm solve_poly_equ3.simps})]
1115 (*.solves all expanded (ie. normalised) terms of degree 2.*)
1116 (*Oct.02 restriction: 'eval_true 0 =< discriminant' ony for integer values
1117 by 'PolyEq_erls'; restricted until Float.thy is implemented*)
1118 partial_function (tailrec) solve_by_completing_square :: "bool \<Rightarrow> real \<Rightarrow> bool list"
1120 "solve_by_completing_square e_e v_v = (
1122 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''cancel_leading_coeff'')) #>
1123 (Try (Rewrite_Set_Inst [(''bdv'', v_v)] ''complete_square'')) #>
1124 (Try (Rewrite ''square_explicit1'')) #>
1125 (Try (Rewrite ''square_explicit2'')) #>
1126 (Rewrite ''root_plus_minus'') #>
1127 (Try (Repeat (Rewrite_Inst [(''bdv'', v_v)] ''bdv_explicit1''))) #>
1128 (Try (Repeat (Rewrite_Inst [(''bdv'', v_v)] ''bdv_explicit2''))) #>
1129 (Try (Repeat (Rewrite_Inst [(''bdv'', v_v)] ''bdv_explicit3''))) #>
1130 (Try (Rewrite_Set ''calculate_RootRat'')) #>
1131 (Try (Repeat (Calculate ''SQRT'')))) e_e
1134 setup \<open>KEStore_Elems.add_mets
1135 [MethodC.prep_input thy "met_polyeq_complsq" [] MethodC.id_empty
1136 (["PolyEq", "complete_square"],
1137 [("#Given" ,["equality e_e", "solveFor v_v"]),
1138 ("#Where" ,["matches (?a = 0) e_e", "((lhs e_e) has_degree_in v_v) = 2"]),
1139 ("#Find" ,["solutions v_v'i'"])],
1140 {rew_ord'="termlessI",rls'=PolyEq_erls,srls=Rule_Set.empty,prls=PolyEq_prls,
1141 calc=[("sqrt", ("NthRoot.sqrt", eval_sqrt "#sqrt_"))], crls=PolyEq_crls, errpats = [],
1142 nrls = norm_Rational},
1143 @{thm solve_by_completing_square.simps})]
1148 (* termorder hacked by MG *)
1149 local (*. for make_polynomial_in .*)
1151 open Term; (* for type order = EQUAL | LESS | GREATER *)
1153 fun pr_ord EQUAL = "EQUAL"
1154 | pr_ord LESS = "LESS"
1155 | pr_ord GREATER = "GREATER";
1157 fun dest_hd' _ (Const (a, T)) = (((a, 0), T), 0)
1158 | dest_hd' x (t as Free (a, T)) =
1159 if x = t then ((("|||||||||||||", 0), T), 0) (*WN*)
1160 else (((a, 0), T), 1)
1161 | dest_hd' _ (Var v) = (v, 2)
1162 | dest_hd' _ (Bound i) = ((("", i), dummyT), 3)
1163 | dest_hd' _ (Abs (_, T, _)) = ((("", 0), T), 4)
1164 | dest_hd' _ _ = raise ERROR "dest_hd': uncovered case in fun.def.";
1166 fun size_of_term' x (Const ("Transcendental.powr",_) $ Free (var,_) $ Free (pot,_)) =
1169 (if xstr = var then 1000*(the (TermC.int_opt_of_string pot)) else 3)
1170 | _ => raise ERROR ("size_of_term' called with subst = "^
1172 | size_of_term' x (Free (subst,_)) =
1174 (Free (xstr,_)) => (if xstr = subst then 1000 else 1)
1175 | _ => raise ERROR ("size_of_term' called with subst = "^
1177 | size_of_term' x (Abs (_,_,body)) = 1 + size_of_term' x body
1178 | size_of_term' x (f$t) = size_of_term' x f + size_of_term' x t
1179 | size_of_term' _ _ = 1;
1181 fun term_ord' x pr thy (Abs (_, T, t), Abs(_, U, u)) = (* ~ term.ML *)
1182 (case term_ord' x pr thy (t, u) of EQUAL => Term_Ord.typ_ord (T, U) | ord => ord)
1183 | term_ord' x pr thy (t, u) =
1187 val (f, ts) = strip_comb t and (g, us) = strip_comb u;
1188 val _ = tracing ("t= f@ts= \"" ^ UnparseC.term_in_thy thy f ^ "\" @ \"[" ^
1189 commas (map (UnparseC.term_in_thy thy) ts) ^ "]\"");
1190 val _ = tracing ("u= g@us= \"" ^ UnparseC.term_in_thy thy g ^ "\" @ \"[" ^
1191 commas(map (UnparseC.term_in_thy thy) us) ^ "]\"");
1192 val _ = tracing ("size_of_term(t,u)= (" ^ string_of_int (size_of_term' x t) ^ ", " ^
1193 string_of_int (size_of_term' x u) ^ ")");
1194 val _ = tracing ("hd_ord(f,g) = " ^ (pr_ord o (hd_ord x)) (f,g));
1195 val _ = tracing ("terms_ord(ts,us) = " ^ (pr_ord o (terms_ord x) str false) (ts, us));
1196 val _ = tracing ("-------");
1199 case int_ord (size_of_term' x t, size_of_term' x u) of
1201 let val (f, ts) = strip_comb t and (g, us) = strip_comb u
1203 (case hd_ord x (f, g) of
1204 EQUAL => (terms_ord x str pr) (ts, us)
1208 and hd_ord x (f, g) = (* ~ term.ML *)
1209 prod_ord (prod_ord Term_Ord.indexname_ord Term_Ord.typ_ord)
1210 int_ord (dest_hd' x f, dest_hd' x g)
1211 and terms_ord x _ pr (ts, us) =
1212 list_ord (term_ord' x pr (ThyC.get_theory "Isac_Knowledge"))(ts, us);
1216 fun ord_make_polynomial_in (pr:bool) thy subst tu =
1217 ((**)tracing ("*** subs variable is: " ^ (Env.subst2str subst)); (**)
1219 (_, x) :: _ => (term_ord' x pr thy tu = LESS)
1220 | _ => raise ERROR ("ord_make_polynomial_in called with subst = " ^ Env.subst2str subst))
1226 val order_add_mult_in = prep_rls'(
1227 Rule_Def.Repeat{id = "order_add_mult_in", preconds = [],
1228 rew_ord = ("ord_make_polynomial_in",
1229 ord_make_polynomial_in false @{theory "Poly"}),
1230 erls = Rule_Set.empty,srls = Rule_Set.Empty,
1231 calc = [], errpatts = [],
1232 rules = [Rule.Thm ("mult.commute",ThmC.numerals_to_Free @{thm mult.commute}),
1234 Rule.Thm ("real_mult_left_commute",ThmC.numerals_to_Free @{thm real_mult_left_commute}),
1235 (*z1.0 * (z2.0 * z3.0) = z2.0 * (z1.0 * z3.0)*)
1236 Rule.Thm ("mult.assoc",ThmC.numerals_to_Free @{thm mult.assoc}),
1237 (*z1.0 * z2.0 * z3.0 = z1.0 * (z2.0 * z3.0)*)
1238 Rule.Thm ("add.commute",ThmC.numerals_to_Free @{thm add.commute}),
1240 Rule.Thm ("add.left_commute",ThmC.numerals_to_Free @{thm add.left_commute}),
1241 (*x + (y + z) = y + (x + z)*)
1242 Rule.Thm ("add.assoc",ThmC.numerals_to_Free @{thm add.assoc})
1243 (*z1.0 + z2.0 + z3.0 = z1.0 + (z2.0 + z3.0)*)
1244 ], scr = Rule.Empty_Prog});
1248 val collect_bdv = prep_rls'(
1249 Rule_Def.Repeat{id = "collect_bdv", preconds = [],
1250 rew_ord = ("dummy_ord", Rewrite_Ord.dummy_ord),
1251 erls = Rule_Set.empty,srls = Rule_Set.Empty,
1252 calc = [], errpatts = [],
1253 rules = [Rule.Thm ("bdv_collect_1",ThmC.numerals_to_Free @{thm bdv_collect_1}),
1254 Rule.Thm ("bdv_collect_2",ThmC.numerals_to_Free @{thm bdv_collect_2}),
1255 Rule.Thm ("bdv_collect_3",ThmC.numerals_to_Free @{thm bdv_collect_3}),
1257 Rule.Thm ("bdv_collect_assoc1_1",ThmC.numerals_to_Free @{thm bdv_collect_assoc1_1}),
1258 Rule.Thm ("bdv_collect_assoc1_2",ThmC.numerals_to_Free @{thm bdv_collect_assoc1_2}),
1259 Rule.Thm ("bdv_collect_assoc1_3",ThmC.numerals_to_Free @{thm bdv_collect_assoc1_3}),
1261 Rule.Thm ("bdv_collect_assoc2_1",ThmC.numerals_to_Free @{thm bdv_collect_assoc2_1}),
1262 Rule.Thm ("bdv_collect_assoc2_2",ThmC.numerals_to_Free @{thm bdv_collect_assoc2_2}),
1263 Rule.Thm ("bdv_collect_assoc2_3",ThmC.numerals_to_Free @{thm bdv_collect_assoc2_3}),
1266 Rule.Thm ("bdv_n_collect_1",ThmC.numerals_to_Free @{thm bdv_n_collect_1}),
1267 Rule.Thm ("bdv_n_collect_2",ThmC.numerals_to_Free @{thm bdv_n_collect_2}),
1268 Rule.Thm ("bdv_n_collect_3",ThmC.numerals_to_Free @{thm bdv_n_collect_3}),
1270 Rule.Thm ("bdv_n_collect_assoc1_1",ThmC.numerals_to_Free @{thm bdv_n_collect_assoc1_1}),
1271 Rule.Thm ("bdv_n_collect_assoc1_2",ThmC.numerals_to_Free @{thm bdv_n_collect_assoc1_2}),
1272 Rule.Thm ("bdv_n_collect_assoc1_3",ThmC.numerals_to_Free @{thm bdv_n_collect_assoc1_3}),
1274 Rule.Thm ("bdv_n_collect_assoc2_1",ThmC.numerals_to_Free @{thm bdv_n_collect_assoc2_1}),
1275 Rule.Thm ("bdv_n_collect_assoc2_2",ThmC.numerals_to_Free @{thm bdv_n_collect_assoc2_2}),
1276 Rule.Thm ("bdv_n_collect_assoc2_3",ThmC.numerals_to_Free @{thm bdv_n_collect_assoc2_3})
1277 ], scr = Rule.Empty_Prog});
1281 (*.transforms an arbitrary term without roots to a polynomial [4]
1282 according to knowledge/Poly.sml.*)
1283 val make_polynomial_in = prep_rls'(
1284 Rule_Set.Sequence {id = "make_polynomial_in", preconds = []:term list,
1285 rew_ord = ("dummy_ord", Rewrite_Ord.dummy_ord),
1286 erls = Atools_erls, srls = Rule_Set.Empty,
1287 calc = [], errpatts = [],
1288 rules = [Rule.Rls_ expand_poly,
1289 Rule.Rls_ order_add_mult_in,
1290 Rule.Rls_ simplify_power,
1291 Rule.Rls_ collect_numerals,
1292 Rule.Rls_ reduce_012,
1293 Rule.Thm ("realpow_oneI",ThmC.numerals_to_Free @{thm realpow_oneI}),
1294 Rule.Rls_ discard_parentheses,
1295 Rule.Rls_ collect_bdv
1297 scr = Rule.Empty_Prog
1303 Rule_Set.append_rules "separate_bdvs"
1305 [Rule.Thm ("separate_bdv", ThmC.numerals_to_Free @{thm separate_bdv}),
1306 (*"?a * ?bdv / ?b = ?a / ?b * ?bdv"*)
1307 Rule.Thm ("separate_bdv_n", ThmC.numerals_to_Free @{thm separate_bdv_n}),
1308 Rule.Thm ("separate_1_bdv", ThmC.numerals_to_Free @{thm separate_1_bdv}),
1309 (*"?bdv / ?b = (1 / ?b) * ?bdv"*)
1310 Rule.Thm ("separate_1_bdv_n", ThmC.numerals_to_Free @{thm separate_1_bdv_n}),
1311 (*"?bdv \<up> ?n / ?b = 1 / ?b * ?bdv \<up> ?n"*)
1312 Rule.Thm ("add_divide_distrib",
1313 ThmC.numerals_to_Free @{thm add_divide_distrib})
1314 (*"(?x + ?y) / ?z = ?x / ?z + ?y / ?z"
1315 WN051031 DOES NOT BELONG TO HERE*)
1319 val make_ratpoly_in = prep_rls'(
1320 Rule_Set.Sequence {id = "make_ratpoly_in", preconds = []:term list,
1321 rew_ord = ("dummy_ord", Rewrite_Ord.dummy_ord),
1322 erls = Atools_erls, srls = Rule_Set.Empty,
1323 calc = [], errpatts = [],
1324 rules = [Rule.Rls_ norm_Rational,
1325 Rule.Rls_ order_add_mult_in,
1326 Rule.Rls_ discard_parentheses,
1327 Rule.Rls_ separate_bdvs,
1328 (* Rule.Rls_ rearrange_assoc, WN060916 why does cancel_p not work?*)
1330 (*Rule.Eval ("Rings.divide_class.divide" , eval_cancel "#divide_e") too weak!*)
1332 scr = Rule.Empty_Prog});
1334 setup \<open>KEStore_Elems.add_rlss
1335 [("order_add_mult_in", (Context.theory_name @{theory}, order_add_mult_in)),
1336 ("collect_bdv", (Context.theory_name @{theory}, collect_bdv)),
1337 ("make_polynomial_in", (Context.theory_name @{theory}, make_polynomial_in)),
1338 ("make_ratpoly_in", (Context.theory_name @{theory}, make_ratpoly_in)),
1339 ("separate_bdvs", (Context.theory_name @{theory}, separate_bdvs))]