solve a linear semi-algebraic system
LinearSolve(sys, R, options)
LinearSolve(F, N, P, H, R, options)
list of linear equations, inequations and inequalities of R
list of linear polynomials over R representing equations
list of linear polynomials over R representing nonnegativity conditions
list of linear polynomials over R representing positivity conditions
list of linear polynomials over R representing nonzero conditions
(optional) equation(s) of the form keyword=value, where keyword is either 'canonical' or 'projection'
triangularized list of linear equations, inequations, and inequalities of R equivalent to sys
The canonical option controls the redundancy of the output. Its default value is false. If 'canonical'=true, or just 'canonical' for short, is specified, it will be guaranteed that there are no redundancies among the constraints with the same main variables in the output.
The projection option determines the subcoordinate space to be projected onto. If the option 'projection'=k is specified, where k is a nonnegative integer less than the number of variables, then the output provides the projection of the zero set of S onto the coordinate subspace determined by the smallest k variables of R.
The algorithm behind this command is a variant of Fourier-Motzkin elimination.
Consider the linear semi-algebraic system S whose unknowns are the variables of R and whose equations, non-negative inequalities, strictly positive inequalities, and inequations are given either by sys or by F, N, P, and H, respectively.
The commands LinearSolve(sys, R) and LinearSolve(F, N, P, H, R) return an equivalent linear semi-algebraic system of triangular shape to the input linear semi-algebraic system S. This assumes that R is a polynomial ring over the field of rational numbers.
If S has no solutions, the output is the empty list . If the solution of S is the whole space, the output is true. Otherwise, the output is a nonempty list of linear constraints satisfying the following properties:
The output constraints are in an ascending order according to the largest variable appearing in them.
The projection of the solutions of the input system S onto any lower dimensional space, say the space formed by the smallest i variables, are exactly the solutions of those constraints in the output which only involve the smallest i variables.
Define a ring of polynomials. The order of variables is z > y > x.
R ≔ PolynomialRing⁡z,y,x
Define a set of linear equations and inequalities.
sys ≔ x+y+z=0,0≤x+y−z,x−y−z<0
We eliminate variables according to the order z > y > x.
T ≔ LinearSolve⁡sys,R
The output is a set of equivalent linear equations and inequalities sorted in ascending order according to the largest variables appearing in the constraints. It provides conditions on lower order variables such that higher order variables have solutions.
Now compute the projection of sys.
T ≔ LinearSolve⁡sys,R,'projection'=2
The output is a set of linear constraints describing the projection of the zero set of sys onto x,y space.
The option 'canonical' can be used to remove redundancies among constraints having the same main variables.
sys ≔ x+y+z≤1,x+y+z≤2,0≤x+y−z
T ≔ LinearSolve⁡sys,R,'canonical'='true'
The F, N, P, H and options parameters were introduced in Maple 17.
For more information on Maple 17 changes, see Updates in Maple 17.
Download Help Document