version 1.3, 1999/12/10 09:17:50 |
version 1.25, 2005/07/24 09:02:40 |
|
|
% $OpenXM: OpenXM/src/kan96xx/Doc/hol.sm1,v 1.2 1999/12/07 09:35:22 takayama Exp $ |
% $OpenXM: OpenXM/src/kan96xx/Doc/hol.sm1,v 1.24 2005/06/23 03:23:26 takayama Exp $ |
%% hol.sm1, 1998, 11/8, 11/10, 11/14, 11/25, 1999, 5/18, 6/5. |
%% hol.sm1, 1998, 11/8, 11/10, 11/14, 11/25, 1999, 5/18, 6/5. 2000, 6/8 |
%% rank, rrank, characteristic |
%% rank, rrank, characteristic |
%% This file is error clean. |
%% This file is error clean. |
/hol.version (2.990515) def |
/hol.version (2.990515) def |
Line 10 hol.version [(Version)] system_variable gt |
|
Line 10 hol.version [(Version)] system_variable gt |
|
error |
error |
} { } ifelse |
} { } ifelse |
|
|
$hol.sm1, basic package for holonomic systems (C) N.Takayama, 1999, 12/07 $ |
$hol.sm1, basic package for holonomic systems (C) N.Takayama, 2000, 06/08 $ |
message-quiet |
message-quiet |
|
|
|
/gb.warning 0 def |
|
/gb.oxRingStructure [[ ] [ ]] def |
/rank.v [(x) (y) (z)] def %% default value of v (variables). |
/rank.v [(x) (y) (z)] def %% default value of v (variables). |
/rank.ch [ ] def %% characteristic variety. |
/rank.ch [ ] def %% characteristic variety. |
/rank.verbose 0 def |
/rank.verbose 0 def |
|
|
] putUsages |
] putUsages |
(rrank ) messagen-quiet |
(rrank ) messagen-quiet |
|
|
|
|
|
% Take the value of arg1 in prior. |
|
/mergeGroebnerOptions { |
|
/arg2 set |
|
/arg1 set |
|
[/loc /glo /ans] pushVariables |
|
[ |
|
/loc arg1 def |
|
/glo arg2 def |
|
/ans [ ] def |
|
{ |
|
loc tag 0 eq { /ans glo def exit } { } ifelse |
|
/ans glo loc join def |
|
exit |
|
} loop |
|
/arg1 ans def |
|
] pop |
|
popVariables |
|
arg1 |
|
} def |
|
|
/gb.v 1 def |
/gb.v 1 def |
/gb.verbose 0 def |
/gb.verbose 0 def |
|
/gb.options [ ] def |
|
/gb.characteristic 0 def |
|
/gb.homogenized 0 def |
|
/gb.autoHomogenize 1 def |
/gb { |
/gb { |
/arg1 set |
/arg1 set |
[/in-gb /aa /typev /setarg /f /v |
[/in-gb /aa /typev /setarg /f /v |
/gg /wv /termorder /vec /ans /rr /mm |
/gg /wv /termorder /vec /ans /rr /mm |
|
/degreeShift /env2 /groebnerOptions |
] pushVariables |
] pushVariables |
[(CurrentRingp) (KanGBmessage)] pushEnv |
[(CurrentRingp) (KanGBmessage)] pushEnv |
[ |
[ |
|
|
/aa arg1 def |
/aa arg1 def |
aa isArray { } { ( << array >> gb) error } ifelse |
aa isArray { } { ( << array >> gb) error } ifelse |
|
aa getAttributeList configureGroebnerOption /groebnerOptions set |
/setarg 0 def |
/setarg 0 def |
/wv 0 def |
/wv 0 def |
|
/degreeShift 0 def |
aa { tag } map /typev set |
aa { tag } map /typev set |
typev [ ArrayP ] eq |
typev [ ArrayP ] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
|
|
/v aa 1 get def |
/v aa 1 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP RingP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
typev [ArrayP ArrayP] eq |
typev [ArrayP ArrayP] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
/v aa 1 get from_records def |
/v aa 1 get from_records def |
|
|
/wv aa 2 get def |
/wv aa 2 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP StringP ArrayP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/wv aa 2 get def |
|
/degreeShift aa 3 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP ArrayP ArrayP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get from_records def |
|
/wv aa 2 get def |
|
/degreeShift aa 3 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
|
|
/env1 getOptions def |
|
|
setarg { } { (gb : Argument mismatch) error } ifelse |
setarg { } { (gb : Argument mismatch) error } ifelse |
|
|
[(KanGBmessage) gb.verbose ] system_variable |
[(KanGBmessage) gb.verbose ] system_variable |
|
|
%%% Start of the preprocess |
%%% Start of the preprocess |
f getRing /rr set |
v tag RingP eq { |
|
/rr v def |
|
}{ |
|
f getRing /rr set |
|
} ifelse |
%% To the normal form : matrix expression. |
%% To the normal form : matrix expression. |
f gb.toMatrixOfString /f set |
f gb.toMatrixOfString /f set |
/mm gb.itWasMatrix def |
/mm gb.itWasMatrix def |
|
|
rr tag 0 eq { |
rr tag 0 eq |
|
v isInteger not |
|
or { |
%% Define our own ring |
%% Define our own ring |
v isInteger { |
v isInteger { |
(Error in gb: Specify variables) error |
(Error in gb: Specify variables) error |
} { } ifelse |
} { } ifelse |
wv isInteger { |
wv isInteger { |
[v ring_of_differential_operators |
[v ring_of_differential_operators |
0] define_ring |
gb.characteristic] define_ring |
/termorder 1 def |
/termorder 1 def |
}{ |
}{ |
[v ring_of_differential_operators |
degreeShift isInteger { |
wv weight_vector |
[v ring_of_differential_operators |
0] define_ring |
wv weight_vector |
wv gb.isTermOrder /termorder set |
gb.characteristic] define_ring |
|
wv gb.isTermOrder /termorder set |
|
}{ |
|
[v ring_of_differential_operators |
|
wv weight_vector |
|
gb.characteristic |
|
[(degreeShift) degreeShift] |
|
] define_ring |
|
wv gb.isTermOrder /termorder set |
|
} ifelse |
} ifelse |
} ifelse |
} { |
} { |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
|
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
wv gb.isTermOrder /termorder set |
wv gb.isTermOrder /termorder set |
} ifelse |
} ifelse |
%%% Enf of the preprocess |
%%% Enf of the preprocess |
|
|
|
|
termorder { |
termorder { |
f { {. dehomogenize} map } map /f set |
/gb.homogenized 0 def |
[f] groebner_sugar 0 get /gg set |
|
}{ |
}{ |
f { {. dehomogenize} map} map /f set |
/gb.homogenized 1 def |
f fromVectors { homogenize } map /f set |
} ifelse |
[f] groebner 0 get /gg set |
groebnerOptions gb.options mergeGroebnerOptions /groebnerOptions set |
|
gb.verbose { (groebnerOptions = ) messagen groebnerOptions message } { } ifelse |
|
termorder { |
|
f { {___ dehomogenize} map } map /f set |
|
[f groebnerOptions] groebner_sugar 0 get /gg set |
|
}{ |
|
f { {___ dehomogenize} map} map /f set |
|
gb.autoHomogenize { |
|
f fromVectors { homogenize } map /f set |
|
} { } ifelse |
|
[f groebnerOptions] groebner 0 get /gg set |
}ifelse |
}ifelse |
wv isInteger { |
wv isInteger { |
/ans [gg gg {init} map] def |
/ans [gg gg {init} map] def |
|
|
/ans set |
/ans set |
}{ } |
}{ } |
ifelse |
ifelse |
|
ans getRing (oxRingStructure) dc /gb.oxRingStructure set |
|
%% gg getAttributeList message |
|
ans gg getAttributeList setAttributeList /ans set |
%% |
%% |
|
env1 restoreOptions %% degreeShift changes "grade" |
|
|
/arg1 ans def |
/arg1 ans def |
] pop |
] pop |
|
|
/arg1 set |
/arg1 set |
[/in-pgb /aa /typev /setarg /f /v |
[/in-pgb /aa /typev /setarg /f /v |
/gg /wv /termorder /vec /ans /rr /mm |
/gg /wv /termorder /vec /ans /rr /mm |
|
/groebnerOptions |
] pushVariables |
] pushVariables |
[(CurrentRingp) (KanGBmessage) (UseCriterion1)] pushEnv |
[(CurrentRingp) (KanGBmessage) (UseCriterion1)] pushEnv |
[ |
[ |
|
|
/aa arg1 def |
/aa arg1 def |
aa isArray { } { (<< array >> pgb) error } ifelse |
aa isArray { } { (<< array >> pgb) error } ifelse |
|
aa getAttributeList configureGroebnerOption /groebnerOptions set |
/setarg 0 def |
/setarg 0 def |
/wv 0 def |
/wv 0 def |
aa { tag } map /typev set |
aa { tag } map /typev set |
|
|
} { } ifelse |
} { } ifelse |
wv isInteger { |
wv isInteger { |
[v ring_of_polynomials |
[v ring_of_polynomials |
0] define_ring |
gb.characteristic] define_ring |
/termorder 1 def |
/termorder 1 def |
}{ |
}{ |
[v ring_of_polynomials |
[v ring_of_polynomials |
wv weight_vector |
wv weight_vector |
0] define_ring |
gb.characteristic] define_ring |
wv gb.isTermOrder /termorder set |
wv gb.isTermOrder /termorder set |
} ifelse |
} ifelse |
} { |
} { |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
v isInteger not { |
(Warning : the given ring definition is not used.) message |
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
} { } ifelse |
} { } ifelse |
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
|
|
} ifelse |
} ifelse |
%%% Enf of the preprocess |
%%% Enf of the preprocess |
|
|
|
groebnerOptions gb.options mergeGroebnerOptions /groebnerOptions set |
|
gb.verbose { (groebnerOptions = ) messagen groebnerOptions message } { } ifelse |
termorder { |
termorder { |
f { {. dehomogenize} map } map /f set |
f { {. dehomogenize} map } map /f set |
[(UseCriterion1) 1] system_variable |
[(UseCriterion1) 1] system_variable |
[f] groebner_sugar 0 get /gg set |
[f groebnerOptions] groebner_sugar 0 get /gg set |
[(UseCriterion1) 0] system_variable |
[(UseCriterion1) 0] system_variable |
}{ |
}{ |
f { {. dehomogenize} map} map /f set |
f { {. dehomogenize} map} map /f set |
f fromVectors { homogenize } map /f set |
f fromVectors { homogenize } map /f set |
[(UseCriterion1) 1] system_variable |
[(UseCriterion1) 1] system_variable |
[f] groebner 0 get /gg set |
[f groebnerOptions] groebner 0 get /gg set |
[(UseCriterion1) 0] system_variable |
[(UseCriterion1) 0] system_variable |
}ifelse |
}ifelse |
wv isInteger { |
wv isInteger { |
|
|
}{ } |
}{ } |
ifelse |
ifelse |
%% |
%% |
|
ans gg getAttributeList setAttributeList /ans set |
|
|
/arg1 ans def |
/arg1 ans def |
] pop |
] pop |
|
|
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f v]; array f; string v; v is the variables. ) |
(a : [f v]; array f; string v; v is the variables. ) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
|
(a : [f v w ds]; array f; string v; array of array w; w is the weight matirx.) |
|
( array ds; ds is the degree shift ) |
( ) |
( ) |
|
(gb.authoHomogenize 1 [default]) |
|
(gb.oxRingStructure ) |
|
( ) |
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -1) ( x y Dx Dy -1)] (x,y) $ |
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -1) ( x y Dx Dy -1)] (x,y) $ |
$ [ [ (Dx) 1 ] ] ] gb pmat ; $ |
$ [ [ (Dx) 1 ] ] ] gb pmat ; $ |
(Example 2: ) |
(Example 2: ) |
|
|
$Example 4: [[ [(x^2) (y+x)] [(x+y) (y^3)] [(2 x^2+x y) (y+x+x y^3)]] (x,y) $ |
$Example 4: [[ [(x^2) (y+x)] [(x+y) (y^3)] [(2 x^2+x y) (y+x+x y^3)]] (x,y) $ |
$ [ [ (x) -1 (y) -1] ] ] gb pmat ; $ |
$ [ [ (x) -1 (y) -1] ] ] gb pmat ; $ |
( ) |
( ) |
|
$Example 5: [[ [(x^2) (y+x)] [(x+y) (y^3)] [(2 x^2+x y) (y+x+x y^3)]] (x,y) $ |
|
$ [ [ (x) -1 (y) -1] ] [[0 1] [-3 1] ] ] gb pmat ; $ |
|
( ) |
|
$Example 6: [ [( (x Dx)^2 + (y Dy)^2 - x y Dx Dy + 1) ( x y Dx Dy -1)] (x,y) $ |
|
$ [ [ (Dx) 1 ] ] ] [(reduceOnly) 1] setAttributeList gb pmat ; $ |
|
( ) |
|
$Example 7: [ [( (x Dx)^2 + (y Dy)^2 + 1) ( x y Dx Dy -1)] (x,y) $ |
|
$ [ [ (Dx) 1 ] ] ] [(gbCheck) 1] setAttributeList gb getAttributeList ::$ |
|
( ) |
(cf. gb, groebner, groebner_sugar, syz. ) |
(cf. gb, groebner, groebner_sugar, syz. ) |
]] putUsages |
]] putUsages |
|
|
|
|
$Example 1: [(x,y) ring_of_polynomials 0] define_ring $ |
$Example 1: [(x,y) ring_of_polynomials 0] define_ring $ |
$ [ [(x^2+y^2-4). (x y -1).] ] pgb :: $ |
$ [ [(x^2+y^2-4). (x y -1).] ] pgb :: $ |
$Example 2: [ [(x^2+y^2) (x y)] (x,y) [ [(x) -1 (y) -1] ] ] pgb :: $ |
$Example 2: [ [(x^2+y^2) (x y)] (x,y) [ [(x) -1 (y) -1] ] ] pgb :: $ |
|
$Example 3: [ [(x^2+y^2 + x y ) (x y)] (x,y) [ [(x) -1 (y) -1] ] ] $ |
|
$ [(reduceOnly) 1] setAttributeList pgb :: $ |
(cf. gb, groebner, groebner_sugar, syz. ) |
(cf. gb, groebner, groebner_sugar, syz. ) |
]] putUsages |
]] putUsages |
|
|
|
|
/v aa 1 get def |
/v aa 1 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP RingP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
typev [ArrayP ArrayP] eq |
typev [ArrayP ArrayP] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
/v aa 1 get from_records def |
/v aa 1 get from_records def |
|
|
/wv aa 2 get def |
/wv aa 2 get def |
/setarg 1 def |
/setarg 1 def |
} { } ifelse |
} { } ifelse |
|
typev [ArrayP RingP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/wv aa 2 get def |
|
/setarg 1 def |
|
} { } ifelse |
typev [ArrayP ArrayP ArrayP] eq |
typev [ArrayP ArrayP ArrayP] eq |
{ /f aa 0 get def |
{ /f aa 0 get def |
/v aa 1 get from_records def |
/v aa 1 get from_records def |
|
|
|
|
|
|
%%% Start of the preprocess |
%%% Start of the preprocess |
f getRing /rr set |
v tag RingP eq { |
|
/rr v def |
|
}{ |
|
f getRing /rr set |
|
} ifelse |
%% To the normal form : matrix expression. |
%% To the normal form : matrix expression. |
f gb.toMatrixOfString /f set |
f gb.toMatrixOfString /f set |
/mm gb.itWasMatrix def |
/mm gb.itWasMatrix def |
|
|
}{ |
}{ |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
v isInteger not { |
(Warning : the given ring definition is not used.) message |
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
} { } ifelse |
} { } ifelse |
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
|
|
[vsize gtmp] toVectors /gtmp set |
[vsize gtmp] toVectors /gtmp set |
ggall 0 gtmp put |
ggall 0 gtmp put |
}{ } ifelse |
}{ } ifelse |
/arg1 [gg dehomogenize ggall] def |
|
|
gg getRing (oxRingStructure) dc /gb.oxRingStructure set |
|
|
|
/arg1 [gg dehomogenize ggall] def |
] pop |
] pop |
popEnv |
popEnv |
popVariables |
popVariables |
|
|
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
(a : [f v]; array f; string v; v is the variables.) |
(a : [f v]; array f; string v; v is the variables.) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
|
( v may be a ring object. ) |
$Example 1: [(x,y) ring_of_polynomials 0] define_ring $ |
$Example 1: [(x,y) ring_of_polynomials 0] define_ring $ |
$ [ [(x^2+y^2-4). (x y -1).] ] syz :: $ |
$ [ [(x^2+y^2-4). (x y -1).] ] syz :: $ |
$Example 2: [ [(x^2+y^2) (x y)] (x,y) [ [(x) -1 (y) -1] ] ] syz :: $ |
$Example 2: [ [(x^2+y^2) (x y)] (x,y) [ [(x) -1 (y) -1] ] ] syz :: $ |
|
|
} { |
} { |
%% Use the ring structre given by the input. |
%% Use the ring structre given by the input. |
v isInteger not { |
v isInteger not { |
(Warning : the given ring definition is not used.) message |
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
} { } ifelse |
} { } ifelse |
rr ring_def |
rr ring_def |
/wv rr gb.getWeight def |
/wv rr gb.getWeight def |
|
|
(Example 3: [(x^2) [(x^2+y^2-4) (x y-1)] [(x) (y)] [[(x) 10]] ] reduction* ) |
(Example 3: [(x^2) [(x^2+y^2-4) (x y-1)] [(x) (y)] [[(x) 10]] ] reduction* ) |
]] putUsages |
]] putUsages |
|
|
( ) message-quiet ; |
|
|
|
|
|
|
%% 2000, 6/7, at Sevilla, Hernando Colon |
|
%% macros that deal with homogenized inputs. |
|
%% Sample: [ [(h+x). (x^3).] [(x). (x).]] /ff set |
|
%% [(Homogenize_vec) 0] system_varialbe |
|
%% (grade) (grave1v) switch_function |
|
%% YA homogenization: [ [(h^3*(h+x)). (x^3).] [(h x). (x).]] /ff set |
|
%% 4+0 3+1 2+0 1+1 |
|
/gb_h { |
|
/arg1 set |
|
[/in-gb_h /aa /typev /setarg /f /v |
|
/gg /wv /termorder /vec /ans /rr /mm |
|
/gb_h.opt /groebnerOptions |
|
] pushVariables |
|
[(CurrentRingp) (KanGBmessage) (Homogenize_vec)] pushEnv |
|
[ |
|
|
|
/aa arg1 def |
|
gb.verbose { (Getting in gb_h) message } { } ifelse |
|
aa isArray { } { ( << array >> gb_h) error } ifelse |
|
aa getAttributeList configureGroebnerOption /groebnerOptions set |
|
/setarg 0 def |
|
/wv 0 def |
|
aa { tag } map /typev set |
|
typev [ ArrayP ] eq |
|
{ /f aa 0 get def |
|
/v gb.v def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP StringP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP RingP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get from_records def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP StringP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/wv aa 2 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP ArrayP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get from_records def |
|
/wv aa 2 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
|
|
setarg { } { (gb_h : Argument mismatch) error } ifelse |
|
|
|
[(KanGBmessage) gb.verbose ] system_variable |
|
|
|
%%% Start of the preprocess |
|
v tag RingP eq { |
|
/rr v def |
|
}{ |
|
f getRing /rr set |
|
} ifelse |
|
%% To the normal form : matrix expression. |
|
f gb.toMatrixOfString /f set |
|
/mm gb.itWasMatrix def |
|
|
|
rr tag 0 eq { |
|
%% Define our own ring |
|
v isInteger { |
|
(Error in gb_h: Specify variables) error |
|
} { } ifelse |
|
wv isInteger { |
|
[v ring_of_differential_operators |
|
0] define_ring |
|
/termorder 1 def |
|
}{ |
|
[v ring_of_differential_operators |
|
wv weight_vector |
|
0] define_ring |
|
wv gb.isTermOrder /termorder set |
|
} ifelse |
|
} { |
|
%% Use the ring structre given by the input. |
|
v isInteger not { |
|
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
|
} { } ifelse |
|
rr ring_def |
|
/wv rr gb.getWeight def |
|
wv gb.isTermOrder /termorder set |
|
} ifelse |
|
getOptions /gb_h.opt set |
|
(grade) (module1v) switch_function |
|
[(Homogenize_vec) 0] system_variable |
|
%%% End of the preprocess |
|
|
|
groebnerOptions gb.options mergeGroebnerOptions /groebnerOptions set |
|
gb.verbose { (groebnerOptions = ) messagen groebnerOptions message } { } ifelse |
|
termorder { |
|
f { {. } map } map /f set |
|
[f groebnerOptions] groebner 0 get /gg set %% Do not use sugar. |
|
}{ |
|
f { {. } map} map /f set |
|
f fromVectors /f set |
|
[f groebnerOptions] groebner 0 get /gg set |
|
}ifelse |
|
wv isInteger { |
|
/ans [gg gg {init} map] def |
|
}{ |
|
/ans [gg gg {wv 0 get weightv init} map] def |
|
}ifelse |
|
|
|
%% Postprocess : recover the matrix expression. |
|
mm { |
|
ans { /tmp set [mm tmp] toVectors } map |
|
/ans set |
|
}{ } |
|
ifelse |
|
ans gg getAttributeList setAttributeList /ans set |
|
gb_h.opt restoreOptions |
|
gb.verbose { (Getting out of gb_h) message } { } ifelse |
|
%% |
|
|
|
/arg1 ans def |
|
] pop |
|
popEnv |
|
popVariables |
|
arg1 |
|
} def |
|
(gb_h ) messagen-quiet |
|
[(gb_h) |
|
[(a gb_h b) |
|
(array a; array b;) |
|
(b : [g ii]; array g; array in; g is a Grobner basis of f) |
|
( in the ring of homogenized differential operators.) |
|
( The input must be homogenized properly.) |
|
( Inproper homogenization may cause an infinite loop.) |
|
( Each element of vectors must be homogenized. If you are using ) |
|
( non-term orders, all elements of vectors must have the same degree with) |
|
( a proper degree shift vector.) |
|
$ ii is the initial ideal in case of w is given or <<a>> belongs$ |
|
$ to a ring. In the other cases, it returns the initial monominal.$ |
|
$ [(Homogenize_vec) 0] system_variable (grade) (module1v) switch_function$ |
|
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
|
(a : [f v]; array f; string v; v is the variables. ) |
|
(a : [f r]; array f; ring r ) |
|
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
|
( ) |
|
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -h^4) ( x y Dx Dy -h^4)] (x,y) $ |
|
$ [ [ (Dx) 1 ] ] ] gb_h pmat ; $ |
|
$Example 2: [ [[(h+x) (x^3)] [(x) (x)]] (x)] gb_h pmat $ |
|
$Example 3: [[ [(x^2) (y+x)] [(x+y) (y^3)] $ |
|
$ [(2 x^2+x y) (y h^3 +x h^3 +x y^3)]] (x,y) $ |
|
$ [ [ (x) -1 (y) -1] ] ] gb_h pmat ; $ |
|
$ Infinite loop: see by [(DebugReductionRed) 1] system_variable$ |
|
$Example 4: [[ [(x^2) (y+x)] [(x^2+y^2) (y)] $ |
|
$ [(2 x^5+x y^4) (y h^3 +x h^3 +x y^3)]] (x,y) $ |
|
$ [ [ (x) -1 (y) -1] ] ] gb_h pmat ; $ |
|
$ This is fine because grade(v_1) = grade(v_2)+1 for all vectors. $ |
|
$Example 5: [ [[(h+x) (x^3 + 2 h^3 + 2 x h^2)] [(x) (x)]] (x)] $ |
|
$ [(reduceOnly) 1] setAttributeList gb_h pmat $ |
|
( ) |
|
(cf. gb, groebner, syz_h. ) |
|
]] putUsages |
|
|
|
/syz_h { |
|
/arg1 set |
|
[/in-syz_h /aa /typev /setarg /f /v |
|
/gg /wv /termorder /vec /ans /ggall /vectorInput /vsize /gtmp /gtmp2 |
|
/rr /mm |
|
/syz_h.opt |
|
] pushVariables |
|
[(CurrentRingp) (KanGBmessage)] pushEnv |
|
[ |
|
|
|
/aa arg1 def |
|
aa isArray { } { (<< array >> syz_h) error } ifelse |
|
/setarg 0 def |
|
/wv 0 def |
|
aa { tag } map /typev set |
|
typev [ ArrayP ] eq |
|
{ /f aa 0 get def |
|
/v syz.v def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP StringP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP RingP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get from_records def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP StringP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get def |
|
/wv aa 2 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
typev [ArrayP ArrayP ArrayP] eq |
|
{ /f aa 0 get def |
|
/v aa 1 get from_records def |
|
/wv aa 2 get def |
|
/setarg 1 def |
|
} { } ifelse |
|
|
|
setarg { } { (syz_h : Argument mismatch) error } ifelse |
|
|
|
[(KanGBmessage) syz.verbose ] system_variable |
|
|
|
|
|
|
|
%%% Start of the preprocess |
|
v tag RingP eq { |
|
/rr v def |
|
}{ |
|
f getRing /rr set |
|
} ifelse |
|
%% To the normal form : matrix expression. |
|
f gb.toMatrixOfString /f set |
|
/mm gb.itWasMatrix def |
|
mm 0 gt { |
|
/vectorInput 1 def |
|
}{ |
|
/vectorInput 1 def |
|
} ifelse |
|
|
|
rr tag 0 eq { |
|
%% Define our own ring |
|
v isInteger { |
|
(Error in syz_h: Specify variables) error |
|
} { } ifelse |
|
wv isInteger { |
|
[v ring_of_differential_operators |
|
0] define_ring |
|
/termorder 1 def |
|
}{ |
|
[v ring_of_differential_operators |
|
wv weight_vector |
|
0] define_ring |
|
wv gb.isTermOrder /termorder set |
|
} ifelse |
|
}{ |
|
%% Use the ring structre given by the input. |
|
v isInteger not { |
|
gb.warning { |
|
(Warning : the given ring definition is not used.) message |
|
} { } ifelse |
|
} { } ifelse |
|
rr ring_def |
|
/wv rr gb.getWeight def |
|
wv gb.isTermOrder /termorder set |
|
} ifelse |
|
|
|
getOptions /syz_h.opt set |
|
(grade) (module1v) switch_function |
|
[(Homogenize_vec) 0] system_variable |
|
%%% End of the preprocess |
|
|
|
termorder { |
|
f { {. } map } map /f set |
|
[f [(needBack) (needSyz)]] groebner /ggall set %% Do not use sugar. |
|
ggall 2 get /gg set |
|
}{ |
|
f { {. } map } map /f set |
|
[f [(needBack) (needSyz)]] groebner /ggall set |
|
ggall 2 get /gg set |
|
}ifelse |
|
vectorInput { |
|
/vsize f 0 get length def %% input vector size. |
|
/gtmp ggall 0 get def |
|
[vsize gtmp] toVectors /gtmp set |
|
ggall 0 gtmp put |
|
}{ } ifelse |
|
|
|
syz_h.opt restoreOptions |
|
%% |
|
|
|
/arg1 [gg ggall] def |
|
] pop |
|
popEnv |
|
popVariables |
|
arg1 |
|
} def |
|
(syz_h ) messagen-quiet |
|
|
|
[(syz_h) |
|
[(a syz_h [b c]) |
|
(array a; array b; array c) |
|
(b is a set of generators of the syzygies of f in the ring of) |
|
(homogenized differential operators.) |
|
( The input must be homogenized properly.) |
|
( Inproper homogenization may cause an infinite loop.) |
|
( Each element of vectors must be homogenized. If you are using ) |
|
( non-term orders, all elements of vectors must have the same degree with) |
|
( a proper degree shift vector.) |
|
(c = [gb, backward transformation, syzygy without dehomogenization].) |
|
(See gb_h.) |
|
$ [(Homogenize_vec) 0] system_variable (grade) (module1v) switch_function$ |
|
(a : [f ]; array f; f is a set of generators of an ideal in a ring.) |
|
(a : [f v]; array f; string v; v is the variables.) |
|
(a : [f r]; array f; ring r ) |
|
(a : [f v w]; array f; string v; array of array w; w is the weight matirx.) |
|
$Example 1: [ [( (x Dx)^2 + (y Dy)^2 -h^4) ( x y Dx Dy -h^4)] (x,y) $ |
|
$ [ [ (Dx) 1 ] ] ] syz_h pmat ; $ |
|
$Example 2: [ [[(h+x) (x^3)] [(x) (x)]] (x)] syz_h pmat $ |
|
$Example 3: [[ [(x^2) (y+x)] [(x+y) (y^3)] $ |
|
$ [(2 x^2+x y) (y h^3 +x h^3 +x y^3)]] (x,y) $ |
|
$ [ [ (x) -1 (y) -1] ] ] syz_h pmat ; $ |
|
$ Infinite loop: see by [(DebugReductionRed) 1] system_variable$ |
|
$Example 4: [[ [(x^2) (y+x)] [(x^2+y^2) (y)] $ |
|
$ [(2 x^5+x y^4) (y h^3 +x h^3 +x y^3)]] (x,y) $ |
|
$ [ [ (x) -1 (y) -1] ] ] syz_h pmat ; $ |
|
$ This is fine because grade(v_1) = grade(v_2)+1 for all vectors. $ |
|
$Example 5: [ [ [(0) (0)] [(0) (0)] [(x) (y)]] $ |
|
$ [(x) (y)]] syz pmat ;$ |
|
]] putUsages |
|
|
|
|
|
/isSameIdeal { |
|
/arg1 set |
|
[/in-isSameIdeal /aa /ii /jj /iigg /jjgg /vv /ans /k /n /f] pushVariables |
|
[(CurrentRingp)] pushEnv |
|
[ |
|
/aa arg1 def |
|
%% comparison of hilbert series has not yet been implemented. |
|
aa length 3 eq { } |
|
{ ([ii jj vv] isSameIdeal) error } ifelse |
|
gb.verbose { (Getting in isSameIdeal) message } { } ifelse |
|
/ii aa 0 get def |
|
/jj aa 1 get def |
|
/vv aa 2 get def |
|
ii length 0 eq jj length 0 eq and |
|
{ /ans 1 def /LLL.isSame goto } { } ifelse |
|
[ii vv] gb /iigg set |
|
[jj vv] gb /jjgg set |
|
|
|
iigg getRing ring_def |
|
|
|
/ans 1 def |
|
iigg 0 get { [ (toe_) 3 -1 roll ] gbext } map |
|
/iigg set |
|
jjgg 0 get { [ (toe_) 3 -1 roll ] gbext } map |
|
/jjgg set |
|
|
|
gb.verbose { ( ii < jj ?) messagen } { } ifelse |
|
iigg length /n set |
|
0 1 n 1 sub { |
|
/k set |
|
iigg k get |
|
jjgg reduction-noH 0 get |
|
(0). eq not { /ans 0 def /LLL.isSame goto} { } ifelse |
|
gb.verbose { (o) messagen } { } ifelse |
|
} for |
|
gb.verbose { ( jj < ii ?) messagen } { } ifelse |
|
jjgg length /n set |
|
0 1 n 1 sub { |
|
/k set |
|
jjgg k get |
|
iigg reduction-noH 0 get |
|
(0). eq not { /ans 0 def /LLL.isSame goto} { } ifelse |
|
gb.verbose { (o) messagen } { } ifelse |
|
} for |
|
/LLL.isSame |
|
gb.verbose { ( Done) message } { } ifelse |
|
/arg1 ans def |
|
] pop |
|
popEnv |
|
popVariables |
|
arg1 |
|
} def |
|
(isSameIdeal ) messagen-quiet |
|
|
|
[(isSameIdeal) |
|
[([ii jj vv] isSameIdeal bool) |
|
(ii, jj : ideal, vv : variables) |
|
(Note that ii and jj will be dehomogenized and compared in the ring) |
|
(of differential operators. cf. isSameIdeal_h) |
|
$Example 1: [ [(x^3) (y^2)] [(x^2+y) (y)] (x,y)] isSameIdeal $ |
|
$Example 2: [ [[(x^3) (0)] [(y^2) (1)]] $ |
|
$ [[(x^3+y^2) (1)] [(y^2) (1)]] (x,y)] isSameIdeal $ |
|
]] putUsages |
|
|
|
/isSameIdeal_h { |
|
/arg1 set |
|
[/in-isSameIdeal_h /aa /ii /jj /iigg /jjgg /vv /ans /k /n /f |
|
/isSameIdeal_h.opt |
|
] pushVariables |
|
[(CurrentRingp) (Homogenize_vec)] pushEnv |
|
[ |
|
/aa arg1 def |
|
gb.verbose { (Getting in isSameIdeal_h) message } { } ifelse |
|
%% comparison of hilbert series has not yet been implemented. |
|
aa length 3 eq { } |
|
{ ([ii jj vv] isSameIdeal_h) error } ifelse |
|
/ii aa 0 get def |
|
/jj aa 1 get def |
|
/vv aa 2 get def |
|
ii length 0 eq jj length 0 eq and |
|
{ /ans 1 def /LLL.isSame_h goto } { } ifelse |
|
|
|
[ii vv] gb_h /iigg set |
|
[jj vv] gb_h /jjgg set |
|
|
|
iigg getRing ring_def |
|
|
|
getOptions /isSameIdeal_h.opt set |
|
(grade) (module1v) switch_function |
|
[(Homogenize_vec) 0] system_variable |
|
/ans 1 def |
|
iigg 0 get { [ (toe_) 3 -1 roll ] gbext } map |
|
/iigg set |
|
jjgg 0 get { [ (toe_) 3 -1 roll ] gbext } map |
|
/jjgg set |
|
|
|
gb.verbose { (Comparing) message iigg message (and) message jjgg message } |
|
{ } ifelse |
|
gb.verbose { ( ii < jj ?) messagen } { } ifelse |
|
iigg length /n set |
|
0 1 n 1 sub { |
|
/k set |
|
iigg k get |
|
jjgg reduction 0 get |
|
(0). eq not { /ans 0 def /LLL.isSame_h goto} { } ifelse |
|
gb.verbose { (o) messagen } { } ifelse |
|
} for |
|
gb.verbose { ( jj < ii ?) messagen } { } ifelse |
|
jjgg length /n set |
|
0 1 n 1 sub { |
|
/k set |
|
jjgg k get |
|
iigg reduction 0 get |
|
(0). eq not { /ans 0 def /LLL.isSame_h goto} { } ifelse |
|
gb.verbose { (o) messagen } { } ifelse |
|
} for |
|
/LLL.isSame_h |
|
gb.verbose { ( Done) message } { } ifelse |
|
isSameIdeal_h.opt restoreOptions |
|
/arg1 ans def |
|
] pop |
|
popEnv |
|
popVariables |
|
arg1 |
|
} def |
|
(isSameIdeal_h ) messagen-quiet |
|
|
|
[(isSameIdeal_h) |
|
[([ii jj vv] isSameIdeal_h bool) |
|
(ii, jj : ideal, vv : variables) |
|
(Note that ii and jj will be compared in the ring) |
|
(of homogenized differential operators. Each element of the vector must be) |
|
(homogenized.) |
|
$Example 1: [ [(x Dx - h^2) (Dx^2)] [(Dx^3) (x Dx-h^2)] (x)] isSameIdeal_h $ |
|
$Example 2: [ [[(x Dx -h^2) (0)] [(Dx^2) (1)]] $ |
|
$ [[(x Dx -h^2) (0)] [(Dx^2) (1)] [(Dx^3) (Dx)]] (x,y)] isSameIdeal_h $ |
|
]] putUsages |
|
|
|
/gb.reduction { |
|
/arg2 set |
|
/arg1 set |
|
[/in-gb.reduction /gbasis /flist /ans /gbasis2 |
|
] pushVariables |
|
[(CurrentRingp) (KanGBmessage)] pushEnv |
|
[ |
|
/gbasis arg2 def |
|
/flist arg1 def |
|
gbasis 0 get tag 6 eq { } |
|
{ (gb.reduction: the second argument must be a list of lists) error } |
|
ifelse |
|
|
|
gbasis length 1 eq { |
|
gbasis getRing ring_def |
|
/gbasis2 gbasis 0 get def |
|
} { |
|
[ [(1)] ] gbasis rest join gb 0 get getRing ring_def |
|
/gbasis2 gbasis 0 get ___ def |
|
} ifelse |
|
|
|
|
|
flist ___ /flist set |
|
flist tag 6 eq { |
|
flist { gbasis2 reduction } map /ans set |
|
}{ |
|
flist gbasis2 reduction /ans set |
|
} ifelse |
|
/arg1 ans def |
|
|
|
] pop |
|
popEnv |
|
popVariables |
|
arg1 |
|
} def |
|
|
|
/gb.reduction_noh { |
|
/arg2 set |
|
/arg1 set |
|
[/in-gb.reduction_noh /gbasis /flist /ans /gbasis2 |
|
] pushVariables |
|
[(CurrentRingp) (KanGBmessage) (Homogenize)] pushEnv |
|
[ |
|
/gbasis arg2 def |
|
/flist arg1 def |
|
gbasis 0 get tag 6 eq { } |
|
{ (gb.reduction_noh: the second argument must be a list of lists) error } |
|
ifelse |
|
|
|
gbasis length 1 eq { |
|
gbasis getRing ring_def |
|
/gbasis2 gbasis 0 get def |
|
} { |
|
[ [(1)] ] gbasis rest join gb 0 get getRing ring_def |
|
/gbasis2 gbasis 0 get ___ def |
|
} ifelse |
|
|
|
|
|
flist ___ /flist set |
|
[(Homogenize) 0] system_variable |
|
flist tag 6 eq { |
|
flist { gbasis2 reduction } map /ans set |
|
}{ |
|
flist gbasis2 reduction /ans set |
|
} ifelse |
|
/arg1 ans def |
|
|
|
] pop |
|
popEnv |
|
popVariables |
|
arg1 |
|
} def |
|
|
|
/gb.reduction.test { |
|
[ |
|
[( 2*(1-x-y) Dx + 1 ) ( 2*(1-x-y) Dy + 1 )] |
|
(x,y) [[(Dx) 1 (Dy) 1] [(x) -1 (y) -1 (Dx) 1 (Dy) 1]]] |
|
gb /gg set |
|
|
|
((h-x-y)*Dx) [gg 0 get] gb.reduction /gg2 set |
|
gg2 message |
|
(-----------------------------) message |
|
|
|
[[( 2*(h-x-y) Dx + h^2 ) ( 2*(h-x-y) Dy + h^2 )] |
|
(x,y) [[(Dx) 1 (Dy) 1] [(x) -1 (y) -1 (Dx) 1 (Dy) 1]]] /ggg set |
|
((h-x-y)*Dx) ggg gb.reduction /gg4 set |
|
gg4 message |
|
(-----------------------------) message |
|
[gg2 gg4] |
|
} def |
|
[(gb.reduction) |
|
[ (f basis gb.reduction r) |
|
(f is reduced by basis by the normal form algorithm.) |
|
(The first element of basis <g_1,...,g_m> must be a Grobner basis.) |
|
(r is the return value format of reduction;) |
|
(r=[h,c0,syz,input], h = c0 f + \sum syz_i g_i) |
|
(basis is given in the argument format of gb.) |
|
$h[1,1](D)-homogenization is used.$ |
|
(cf. reduction, gb, ecartd.gb, gb.reduction.test ) |
|
$Example:$ |
|
$ [[( 2*(h-x-y) Dx + h^2 ) ( 2*(h-x-y) Dy + h^2 )] $ |
|
$ (x,y) [[(Dx) 1 (Dy) 1] [(x) -1 (y) -1 (Dx) 1 (Dy) 1]]] /ggg set $ |
|
$ ((h-x-y)^2*Dx*Dy) ggg gb.reduction :: $ |
|
]] putUsages |
|
|
|
[(gb.reduction_noh) |
|
[ (f basis gb.reduction_noh r) |
|
(f is reduced by basis by the normal form algorithm.) |
|
(The first element of basis <g_1,...,g_m> must be a Grobner basis.) |
|
(r is the return value format of reduction;) |
|
(r=[h,c0,syz,input], h = c0 f + \sum syz_i g_i) |
|
(basis is given in the argument format of gb.) |
|
(cf. gb.reduction, gb ) |
|
$Example:$ |
|
$ [[( 2*Dx + 1 ) ( 2*Dy + 1 )] $ |
|
$ (x,y) [[(Dx) 1 (Dy) 1]]] /ggg set $ |
|
$ ((1-x-y)^2*Dx*Dy) ggg gb.reduction_noh :: $ |
|
]] putUsages |
|
|
|
( ) message-quiet ; |
|
|
|
/hol_loaded 1 def |
|
|
|
|
|
|