forked from fricas/fricas
-
Notifications
You must be signed in to change notification settings - Fork 0
/
mrv_limit.spad
561 lines (509 loc) · 20.9 KB
/
mrv_limit.spad
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
)abbrev domain OEXPR OrderedExpression
OrderedExpression() : Join(OrderedRing,
Algebra(Fraction(Integer)),
RetractableFrom(Expression(Integer))) == Expression(Integer) add
Rep := Expression(Integer)
SIGNEF ==> ElementaryFunctionSign(Integer, Expression(Integer))
retract(e : Expression(Integer)) : % == e pretend %
coerce(x : %) : Expression(Integer) == x pretend Expression(Integer)
retractIfCan(x) == retract(x)
(x : % < y : %) : Boolean ==
di := y - x
di = 0 => false
(s := sign(di pretend Expression(Integer))$SIGNEF) case Integer =>
(s@Integer) = 1
error "can not determine sign"
)abbrev package MRVLIM MrvLimitPackage
++ Author: W Hebisch
++ Description: Compute limits using Gruntz-Gonnet MRV algorithm
MrvLimitPackage : Exports == Implementation where
R ==> Integer
FE ==> Expression Integer
EQ ==> Equation
OFE ==> OrderedCompletion FE
SY ==> Symbol
K ==> Kernel FE
Z ==> Integer
Expon ==> OrderedExpression
CMP_RES ==> Record(sign : Integer, coeff : FE)
CMP_RESU ==> Union(CMP_RES, "failed")
SET_RES ==> Record(lk : List K, lc : List FE)
SET_RESU ==> Union(SET_RES, "failed")
SER_RES ==> Record(degree : Expon, coeff : FE)
SER_RESU ==> Union(SER_RES, "failed")
STATE_REC ==> Record(tan_syms : List(SY), atan_syms : List(SY),
tan_kers : List(K), atan_kers : List(K))
RESULT ==> Union(OFE, "failed")
TwoSide ==> Record(leftHandLimit : RESULT, rightHandLimit : RESULT)
U ==> Union(OFE, TwoSide, "failed")
Exports ==> with
mrv_limit : (FE, EQ OFE) -> U
++ mrv_limit(f, x=a) computes limit(f(x), x=a) for a finite or
++ infinite limit point a.
mrv_limit : (FE, SY, OFE) -> U
++ mrv_limit(f, x, a) is like mrv_limit(f, x = a).
mrv_limit : (FE, EQ FE, String) -> RESULT
++ mrv_limit(f, x = a, str) computes limit(f(x), x=a) for a
++ strictly finite limit point a. This function computes
++ one-sided limits from the left or right.
mrv_limit : (FE, SY, FE, String) -> RESULT
++ mrv_limit(f, x, a, str) is like mrv_limit(f, x = a, str).
mrv_normalize : (FE, Symbol, STATE_REC) -> FE
++ mrv_normalize(f, x, s) transform f to the form acceptable
++ by core variant of mrv_limit.
mrv_limit : (FE, Symbol, STATE_REC) -> RESULT
++ mrv_limit(f, x, s) computes limit.
mrv_limit1 : (FE, Symbol) -> RESULT
++ mrv_limit1(f, x) normalizes and computes limit.
mrv_sign : (FE, Symbol, STATE_REC) -> Union(Integer, "failed")
++ mrv_sign(f, x, s) computes sign of f near x.
mrv_cmp : (K, K, Symbol, STATE_REC) -> CMP_RESU
++ mrv_cmp compare kernels.
mrv_set : (FE, Symbol, STATE_REC) -> SET_RESU
++ mrv_set compute MRV set.
expr_to_series : (FE, K, STATE_REC) -> SER_RESU
++ expr_to_series computes degree and leading coefficinet of
++ series expansion.
mrv_rewrite : (FE, List K, List FE, Symbol, STATE_REC) -> SER_RESU
++ mrv_rewrite rewrites comparable kernels and computes leading
++ term of series expansion.
mrv_rewrite0 : (FE, List K, List FE, FE) -> FE
++ mrv_rewrite0 rewrites comparable kernels in terms of a single
++ one.
Implementation ==> add
import from ToolsForSign(R)
UTS ==> UnivariateTaylorSeries
FS2UPS2 ==> FunctionSpaceToUnivariatePowerSeries2
GENSER ==> GeneralizedUnivariatePowerSeries
TEXPG ==> TaylorSeriesExpansionGeneralized
EFGUSER ==> ElementaryFunctionsGeneralizedUnivariatePowerSeries
zeroFE : FE := 0
series_x := new()$Symbol
-- Problem ==> Record(func: String, prob: String)
-- UPS_Result ==> Union(%series: ULS_X, %problem: Problem)
op_log_gamma : BasicOperator := operator(operator('%logGamma
)$CommonOperators)$FE
op_eis : BasicOperator := operator(operator('%eis
)$CommonOperators)$FE
op_erfs : BasicOperator := operator(operator('%erfs
)$CommonOperators)$FE
op_erfis : BasicOperator := operator(operator('%erfis
)$CommonOperators)$FE
import from PrintPackage
var_kers(e : FE) : List(K) ==
[kk for kk in tower(e) | differentiate(kk::FE, series_x) ~= 0$FE ]
EFSTRUC ==> ElementaryFunctionStructurePackage(R, FE)
mrv_normalize(f, x, state) ==
f := normalize(f)$EFSTRUC
tf := tower(f)
rtf : List(K) := []
ntf : List(FE) := []
l_atan : List(K) := []
l_as : List(SY) := []
l_tan : List(K) := []
l_ts : List(SY) := []
for k in tf repeat
differentiate(k::FE, x) = 0 => iterate
op := operator(k)
args := argument(k)
nargs := [eval(arg, rtf, ntf) for arg in args]
nk : FE :=
args ~= nargs => op(nargs)
k::FE
rtf := cons(k, rtf)
ntf := cons(nk, ntf)
nm := name(op)
nm = 'exp => iterate
nm = 'log => iterate
#args = 1 =>
lau := mrv_limit(arg1 := nargs(1), x, state)
nm = 'atan =>
lau case "failed" =>
ns := new()$Symbol
nk := ns::FE
l_atan := cons(kernels(nk).1, l_atan)
l_as := cons(ns, l_as)
ntf(1) := nk
la := lau@OFE
ss : Integer := whatInfinity(la)
ss = 0 => iterate
nk :=
ss = 1 => pi()$FE/(2::FE) - atan(1$FE/arg1)
-pi()$FE/(2::FE) -atan(1$FE/arg1)
ntf(1) := nk
nm = 'tan =>
need_subst : Boolean :=
lau case "failed" => true
la := lau@OFE
ss : Integer := whatInfinity(la)
not(ss = 0)
not(need_subst) => iterate
ns := new()$Symbol
nk := ns::FE
l_tan := cons(kernels(nk).1, l_tan)
l_ts := cons(ns, l_ts)
ntf(1) := nk
lau case "failed" => iterate
la := lau@OFE
ss : Integer := whatInfinity(la)
nm = 'Gamma =>
ss = 1 =>
nk := exp(kernel(op_log_gamma, arg1))
ntf(1) := nk
nm = 'Ei =>
ss = 1 =>
nk := exp(arg1)*kernel(op_eis, arg1)
ntf(1) := nk
nm = 'li =>
ss = 1 =>
nk := arg1*kernel(op_eis, log(arg1))
ntf(1) := nk
nm = 'erf =>
ss = 1 =>
nk := 1 - exp(-arg1^2)*kernel(op_erfs, arg1)
ntf(1) := nk
ss = -1 =>
nk := exp(-arg1^2)*kernel(op_erfs, -arg1) - 1
ntf(1) := nk
nm = 'erfi =>
ss = 1 =>
nk := exp(arg1^2)*kernel(op_erfis, arg1)
ntf(1) := nk
ss = -1 =>
nk := -exp(arg1^2)*kernel(op_erfis, -arg1)
ntf(1) := nk
state.tan_syms := l_ts
state.atan_syms := l_as
state.tan_kers := l_tan
state.atan_kers := l_atan
eval(f, rtf, ntf)
Uts := UTS(FE, series_x, zeroFE)
Upg := GENSER(FE, Expon, series_x, zeroFE)
ppack := FS2UPS2(R, FE, Expon, Upg, _
EFGUSER(FE, Expon, Upg), Uts, _
TEXPG(FE, Expon, Upg, Uts), _
(coerce$Expon)@(Expon -> FE), _
series_x)
SIGNEF ==> ElementaryFunctionSign(Integer, FE)
mrv_bounded1(e : FE, state : STATE_REC) : Boolean ==
ke := kernels(e)
ne := numer(e)
de := denom(e)
#ke = 1 =>
kk := first(ke)
member?(kk, state.tan_kers) =>
degree(ne, kk) > degree(de, kk) => false
sde := sign(de::FE)$SIGNEF
sde case Z =>
sde@Z ~= 0
false
member?(kk, state.atan_kers) =>
sde := sign(eval(de::FE, kk, atan(kk::FE)))$SIGNEF
sde case Z =>
sde@Z ~= 0
false
true
vde := variables(de::FE)
not(empty?(setIntersection(vde, state.tan_syms))) or
not(empty?(setIntersection(vde, state.atan_syms))) => false
empty?(setIntersection(kernels(ne::FE), state.tan_kers))
mrv_bounded(state : STATE_REC) : (FE -> Boolean) ==
e +-> mrv_bounded1(e, state)
mrv_invertible(state : STATE_REC) : (FE -> Boolean) ==
var_syms := concat(state.tan_syms, state.atan_syms)
(e : FE) : Boolean +->
empty?(setIntersection(variables(e), var_syms)) => true
ke := kernels(e)
#ke ~= 1 => false
kk := first(ke)
ne := numer(e)
de := denom(e)
member?(kk, state.tan_kers) =>
degree(ne, kk) < degree(de, kk) => false
sde := sign(de::FE)$SIGNEF
sde case Z =>
sde@Z ~= 0
false
member?(kk, state.atan_kers) =>
sde := sign(eval(de::FE, kk, atan(kk::FE)))$SIGNEF
sde case Z =>
sde@Z ~= 0
false
false
mrv_zero(e : FE) : Boolean == normalize(e)$EFSTRUC = 0
-- compute leading term and degree of expansion of e into
-- generalized power series with respect to k
expr_to_series(e : FE, k : K, state : STATE_REC) : SER_RESU ==
ex : FE := eval(e, [k], [series_x :: FE])
not(is?(k, 'exp)) =>
error "Can only expand with respect to exp"
h := argument(k).1
ss := exprToPS(ex, false, "complex", true, h,
mrv_bounded(state), mrv_invertible(state),
mrv_zero)$ppack
ss case %problem => "failed"
ssl := ss.%series
kk : Integer := 0
deg : Expon
lc : FE
ssl0 := ssl
repeat
deg := order(ssl)
ssll := removeZeros(ssl, deg)
lc := normalize(leadingCoefficient(ssll))$EFSTRUC
lc ~= 0 => break
kk := kk + 1
kk > 100 =>
print(ssl0::OutputForm)
error "Series with many zero terms"
ssl := reductum(ssl)
vkers := var_kers(lc)
empty?(vkers) => return [deg, lc]
error "Too many variable kernels"
-- compare comparability classes of two kernels, uses
-- Gruntz Lemma 3.6
mrv_cmp(x : K, y : K, v : Symbol, state : STATE_REC) : CMP_RESU ==
x1 : FE :=
is?(x, "exp" :: Symbol) => argument(x).1
log(x :: FE)
y1 : FE :=
is?(y, "exp" :: Symbol) => argument(y).1
log(y :: FE)
ppu := mrv_limit(x1/y1, v, state)
ppu case OFE =>
pp1 := ppu@OFE
pp1 = (0::OFE) => [-1, 0]
finite?(pp1) =>
[0, retract(pp1)]
[1, 0]
"failed"
-- compute the mrv set -- the method just uses definition
-- and observation that mrv set can contain only x or
-- exponentials
-- as a byproduct we compute list of constants such that
-- res.i =~ res.1^(res_c.i)
mrv_set(e : FE, x : Symbol, state : STATE_REC) : SET_RESU ==
kers := tower(e)
res_k : K := kernels(x::FE).1
res : List K := [res_k]
res_c : List FE := [1::FE]
for y in kers repeat
is?(y, "exp" :: Symbol) =>
icu := mrv_cmp(y, res_k, x, state)
icu case "failed" => return "failed"
ic := icu@CMP_RES
i := ic.sign
c := ic.coeff
i > 0 =>
res_k := y
res := [y]
res_c := [1::FE]
(i = 0)::Boolean =>
res := cons(y, res)
res_c := cons(c, res_c)
0
[reverse(res), reverse(res_c)]
-- rewrite,
-- Arguments
-- e the expression
-- lx list of mrv kernels
-- ly list of replacement kernels
-- we assume that simpler kernels are earlier on the list,
-- more precisely, if lx.i is a subexpression of lx.j then
-- i <= j
mrv_rewrite1(e : FE, lx : List K, ly : List FE) : FE ==
rlx := reverse(lx)
rly := reverse(ly)
for x in rlx for y in rly repeat
e := eval(e, [x], [y])
e
-- rewrite kernels from mrv set in terms of single kernel
-- Arguments
-- e the expression
-- lx list of mrv kernels
-- lc coefficients so that lx.i =~ omega ^(lc.i)
-- where omega is selected mrv kernel
-- v variable
--
-- lx.1 is equivalent to omega, but normalized so that it
-- goes to 0 when v goes to infinity
mrv_rewrite0(e : FE, lx : List K, lc : List FE, x00 : FE) : FE ==
c0 := first lc
(#lx = 1) and (c0 = 1) => e
e0 := argument(kernels(x00).1).1
ly : List FE := []
for xi in rest lx for ci in rest lc repeat
ei := argument(xi).1
yi := x00^(ci)*exp(ei - ci*e0)
ly := cons(yi, ly)
ly := reverse(ly)
if c0 = 1 then
lxx := rest lx
else
ly := cons(x00^c0, ly)
lxx := lx
mrv_rewrite1(e, lxx, ly)
-- Rewrite in terms of mrv kernel and compute leading term of
-- series expansion
-- Arguments:
-- e the expression
-- lx list of mrv kernels
-- lc coefficients so that lx.i =~ lx.1 ^(lc.i)
-- v variable
mrv_rewrite(e : FE, lx : List K, lc : List FE, v : Symbol,
state : STATE_REC) : SER_RESU ==
x0 := first lx
-- Shift up, if needed and recurse
is?(x0, v :: Symbol) =>
lxx : List K := [kernels(eval(ei::FE, [x0], [exp(v::FE)])).1 for ei in lx]
mrv_rewrite(eval(e, [x0], [exp(v::FE)]), lxx, lc, v, state)
-- Sanity check
~ is?(x0, "exp" :: Symbol) =>
error "mrv is not exp, need substitution"
-- [0, 0]
-- normalize mrv kernel, so that it goes to 0 when v goes to
-- infinity
e0 := argument(x0).1
-- vei : Equation OFE := (v::FE)::OFE = plusInfinity()@OFE
-- lip := limit(e0, vei)$PowerSeriesLimitPackage(Integer, FE)
-- kk := kernels(argument(x0).1)
lip : RESULT :=
e0 = (v::FE) => plusInfinity()@OFE
mrv_limit(e0, v, state)
lip case OFE =>
lipp : OFE := lip@OFE
ss : Integer := whatInfinity(lipp)
(ss = 0) =>
error "Wrong mrv element"
-- 0
if ss > 0 then
lcc := cons(1::FE, [-ci for ci in lc])
x00 := exp(-e0)
lxx := cons(kernels(x00).1, lx)
else
lcc := lc
x00 := x0 :: FE
lxx := lx
-- do the rewrite
e := mrv_rewrite0(e, lxx, lcc, x00)
expr_to_series(e, kernels(x00).1, state)
error "limit failed"
mrv_sign(e : FE, v : Symbol, state : STATE_REC
) : Union(Integer, "failed") ==
~ member?(v::Symbol, variables(e)) => sign(e)$SIGNEF
-- (s := sign(e)$SIGNEF) case Integer =>
-- return s
-- error "Can not determine sign"
rkcu := mrv_set(e, v, state)
rkcu case "failed" => "failed"
rkc := rkcu@SET_RES
lx := rkc.lk
lcc := rkc.lc
ssu : SER_RESU := mrv_rewrite(e, lx, lcc, v, state)
ssu case "failed" => "failed"
ss := ssu@SER_RES
mrv_sign(ss.coeff, v, state)
-- Compute limit of e when v goes to infinity
mrv_limit(e : FE, v : Symbol, state : STATE_REC) : RESULT ==
~ member?(v, (ve := variables(e))) =>
empty?(setIntersection(ve, state.tan_syms)) and
empty?(setIntersection(ve, state.atan_syms)) => e :: OFE
"failed"
rkcu := mrv_set(e, v, state)
rkcu case "failed" => "failed"
rkc := rkcu@SET_RES
lx := rkc.lk
lcc := rkc.lc
ssu : SER_RESU := mrv_rewrite(e, lx, lcc, v, state)
ssu case "failed" => "failed"
ss := ssu@SER_RES
deg := ss.degree
deg > 0 => 0$FE::OFE
deg = 0 => mrv_limit(ss.coeff, v, state)
deg < 0 =>
su := mrv_sign(ss.coeff, v, state)
su case "failed" => "failed"
s := su@Integer
s = 1 =>
plusInfinity()
s = -1 =>
minusInfinity()
error "Nonzero term has no sign"
mrv_limit1(e : FE, x : Symbol) : RESULT ==
state := [[], [], [], []]$STATE_REC
e := mrv_normalize(e, x, state)
mrv_limit(e, x, state)
mrv_limit(e : FE, eq : EQ OFE) : U ==
(f := retractIfCan(lhs eq)@Union(FE,"failed")) case "failed" =>
error "limit:left hand side must be a variable"
(var := retractIfCan(f)@Union(SY,"failed")) case "failed" =>
error "limit:left hand side must be a variable"
mrv_limit(e, var@SY, rhs eq)
mrv_limit2(e : FE, v : SY, a : OFE) : U ==
ii := whatInfinity a
-- Case positive infinity
ii = 1 =>
resu := mrv_limit1(e, v)
resu case "failed" => "failed"
resu@OFE
-- Case negative infinity
ii = -1 =>
-- replace x by -x
vK := retract(v::FE)@Kernel(FE)
et : FE := eval(e, vK, -vK::FE)
resu := mrv_limit1(et, v)
resu case "failed" => "failed"
resu@OFE
-- Case finite real value
ii = 0 =>
-- Compute left and right hand limit
vK := retract(v::FE)@Kernel(FE)
-- replace x by a - 1/x
et : FE := eval(e, vK, retract(a)@FE - inv(vK::FE))
ll := mrv_limit1(et, v)
-- replace x by a + 1/x
et : FE := eval(e, vK, retract(a)@FE + inv(vK::FE))
lr := mrv_limit1(et, v)
ll = lr =>
lr case "failed" => "failed"
lr@OFE
[ll, lr]$TwoSide
subst_in_result(r : RESULT, k : Kernel(FE), f : FE) : RESULT ==
r case "failed" => r
ru := retractIfCan(r)@Union(FE, "failed")
ru case "failed" => r
subst(ru@FE, [k], [f])::OFE
mrv_limit(e : FE, v : SY, a : OFE) : U ==
(ae := retractIfCan(a)@Union(FE,"failed")) case FE and
member?(v, variables(ae@FE)) =>
knv := kernel(new()$Symbol)$Kernel(FE)
kv := kernel(v)$Kernel(FE)
a1 := subst(ae@FE, [kv], [knv::FE])
res1 := mrv_limit2(e, v, a1::OFE)
res1 case "failed" => res1
res1 case TwoSide => error "impossible"
res2 := subst_in_result(res1, knv, kv::FE)
res2 case "failed" => error "impossible"
res2@OFE
mrv_limit2(e, v, a)
mrv_limit(e : FE, eq : EQ FE, s : String) : RESULT ==
(f := retractIfCan(lhs eq)@Union(SY,"failed")) case "failed" =>
error "limit:left hand side must be a variable"
mrv_limit(e, f@SY, rhs eq, s)
mrv_limit3(e : FE, v : SY, a : FE, s : String) : RESULT ==
vK := kernel(v)@Kernel(FE)
-- From the right: replace x by a + 1/z
-- From the left: replace x by a - 1/z
delta :=
direction(s) = 1 => inv(vK::FE)
- inv(vK::FE)
et : FE := eval(e, vK, a + delta)
mrv_limit1(et, v)
mrv_limit(e : FE, v : SY, a : FE, s : String) : RESULT ==
member?(v, variables(a)) =>
knv := kernel(new()$Symbol)$Kernel(FE)
kv := kernel(v)$Kernel(FE)
a1 := subst(a, [kv], [knv::FE])
res1 := mrv_limit3(e, v, a1, s)
subst_in_result(res1, knv, kv::FE)
mrv_limit3(e, v, a, s)