|
Calling Sequence
|
|
Closure(L, Qx, x, q, p, func, options)
|
|
Parameters
|
|
L
|
-
|
polynomial in with coefficients which are polynomials in over the field of rational functions in
|
Qx
|
-
|
name, variable denoting the -shift operator
|
x
|
-
|
variable name
|
q
|
-
|
either a variable name, or a nonzero constant, or an equation of the form name=constant
|
p
|
-
|
(optional) set of irreducible polynomials in , or a single such polynomial
|
func
|
-
|
(optional) procedure
|
options
|
-
|
(optional) equation(s) of the form 'keyword'=value, where the keyword is either order or maximal
|
|
|
|
|
Returns
|
|
•
|
list of polynomials in with coefficients which are polynomials in over the field of rational functions in
|
|
|
Description
|
|
•
|
Let be a field of characteristic 0. Denote by the -shift polynomial ring consisting of elements, each of which is a polynomial in , with coefficients which are polynomials in over . For a given operator , the Closure(L,Qx,x,q) calling sequence constructs a closure of in the -shift polynomial ring .
|
|
The output is a list of elements in . Each element in this list represents a generator of the closure of . For example, there exists and , such that the torsion relation holds.
|
•
|
The Closure(L,Qx,x q,p) calling sequence constructs a local closure of at the irreducible(s) . The output is a list of generators of the local closure of . For example, each element in the list is such that the torsion relation holds for some operator , where and .
|
•
|
The parameter q does not have to be a variable. A constant value, such as is possible as well, including the case of a root of unity.
|
•
|
The optional argument func, if specified, is applied to the coefficients of the result with respect to ; typical examples are expand or factor.
|
•
|
Note that setting infolevel[Closure]:=3 will cause some diagnostics to be printed during the computation.
|
|
|
Options
|
|
|
If this option is given, the Groebner[Basis] command, with respect to the given monomial order, will be applied to the computed closure.
|
•
|
'maximal'=truefalse (default: false)
|
|
This option only has an effect if a local closure is requested. If maximal=true (or maximal for short) is specified, then each element in the output list is such that the torsion relation holds for some operator , where , , and . In other words, all generators for the -shift-equivalence class(es) represented by are computed and returned.
|
|
|
Examples
|
|
>
|
|
| (1) |
Compute a closure of the following linear -shift operator when :
>
|
|
| (2) |
>
|
|
| (3) |
Compute a local closure of , now with a symbolic , at , with factored coefficients:
>
|
|
| (5) |
Compute a local closure of at the q-shift equivalence class represented by :
>
|
|
| (6) |
Verify the torsion property:
>
|
|
>
|
|
| (7) |
>
|
|
| (8) |
>
|
|
>
|
|
| (10) |
>
|
|
| (12) |
>
|
|
>
|
|
| (14) |
This is, in fact, a negative -shift of :
>
|
|
Compute a closure of the following operator when , a second root of unity:
>
|
|
>
|
|
Closure: "-1 is a 2 root of unity"
Closure: "compute the matrix representation of the input operator"
Closure: "the matrix representation is Matrix(2, 2, [[(x+2)^2,(x+1)*(x-2)^2],[(1-x)*(-x-2)^2*eta,(-x+2)^2]])"
Closure: "compute the candidate primes and bounds for their multiplicities"
Closure: "the candidate primes and bounds for their multiplicities are [[x-2, 2], [x+2, 2]]"
Closure: "compute the local closures"
Closure: "compute P such that P.L = (x-2)^j.R, 1<=j<=2"
Closure: "compute P such that P.L = (x+2)^j.R, 1<=j<=2"
| |
| (18) |
|
|
Compatibility
|
|
•
|
The QDifferenceEquations[Closure] command was introduced in Maple 18.
|
|
|
|