|
RegularChains[IsRegular] - check if a polynomial is regular modulo a regular chain
|
|
Calling Sequence
|
|
IsRegular(p, rc, R)
|
|
|
Parameters
|
|
|
p
|
-
|
polynomial of R
|
|
rc
|
-
|
regular chain of R
|
|
R
|
-
|
polynomial ring
|
|
|
|
|
|
Description
|
|
|
•
|
The command IsRegular(in_p, in_rc, R) returns true if and only if p is regular modulo rc, that is if and only if p is not a zero-divisor modulo the saturated ideal of rc.
|
|
•
|
This command is part of the RegularChains package, so it can be used in the form IsRegular(..) only after executing the command with(RegularChains). However, it can always be accessed through the long form of the command by using RegularChains[IsRegular](..).
|
|
|
|
Examples
|
|
|
>
|
 
|
|
>
|
![R := PolynomialRing([x, y, z])](/support/helpjp/helpview.aspx?si=5370/file02684/math96.png)
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
![T := Chain([(z+1)*(z+2), y^2+z, (x-z)*(x-y)], T, R)](/support/helpjp/helpview.aspx?si=5370/file02684/math110.png)
|
|
| (3) |
|
>
|
|
|
![[x^2+(-y-z)*x+z*y, y^2+z, z^2+3*z+2]](/support/helpjp/helpview.aspx?si=5370/file02684/math120.png)
| (4) |
|
>
|
|
|
| (5) |
|
>
|
|
|
| (6) |
|
>
|
|
|
![regl, zdl := [regular_chain], [regular_chain, regular_chain, regular_chain]](/support/helpjp/helpview.aspx?si=5370/file02684/math141.png)
| (7) |
|
>
|
|
|
![[[x-1, y-1, z+1], [x+1, y-1, z+1], [x+1, y+1, z+1]]](/support/helpjp/helpview.aspx?si=5370/file02684/math148.png)
| (8) |
The fact that the list zdl is not empty means that there are cases, modulo which, p is zero. This is clear from the definition of p and rc.
|
>
|
|
|
| (9) |
|
>
|
|
|
| (10) |
|
>
|
|
|
![[[regular_chain], []]](/support/helpjp/helpview.aspx?si=5370/file02684/math179.png)
| (11) |
|
>
|
|
|
![[[[112*z^2*x-206*z*x-515*x*y*z+94*z^3*x-235*x*z^2*y, 504, regular_chain], [112*z^2*x-206*z*x-515*x*y*z+94*z^3*x-235*x*z^2*y, 504, regular_chain], [112*z^2*x+806*z^2*y-224*z^3-206*z*x+412*y*z+412*z^2-515*x*y*z+1030*z*y^2+94*z^3*x+282*z^3*y-188*z^4-235*x*z^2*y+470*z^2*y^2, 504, regular_chain], [112*z^2*x+806*z^2*y-224*z^3-206*z*x+412*y*z+412*z^2-515*x*y*z+1030*z*y^2+94*z^3*x+282*z^3*y-188*z^4-235*x*z^2*y+470*z^2*y^2, 504, regular_chain]], []]](/support/helpjp/helpview.aspx?si=5370/file02684/math186.png)
| (12) |
Since q is regular with respect to T and since every variable q is algebraic with respect to T, we can compute the inverse of q modulo T.
|
>
|
|
|
| (13) |
|
>
|
|
|
| (14) |
|
>
|
|
|
![[[regular_chain, regular_chain], [regular_chain, regular_chain]]](/support/helpjp/helpview.aspx?si=5370/file02684/math221.png)
| (15) |
For each case where r is regular modulo rc, we can compute its inverse.
|
>
|
|
|
![[[[-1, 2, regular_chain], [y+z, 2, regular_chain]], [regular_chain, regular_chain]]](/support/helpjp/helpview.aspx?si=5370/file02684/math234.png)
| (16) |
|
|
Download Help Document
Was this information helpful?
