type/monomial
check for a monomial
Calling Sequence
Parameters
Description
Examples
Compatibility
type(m, monomial)
type(m, monomial(K))
type(m, monomial(K, v))
m
-
any expression
K
(optional) type name for the coefficient domain
v
(optional) variable(s)
The call type(m, monomial(K, v)) checks to see if m is a monomial in the variable(s) v over the coefficient domain K, where v is either an indeterminate or a list or set of indeterminates.
A monomial is defined to be a polynomial in v which syntactically is the product of powers of indeterminates in v with nonnegative exponents, times a coefficient c free of the indeterminates in v, i.e., it is of the form c⋅x1e1⁢⋯⁢xkek, where v=x1,…,xk, e1,…,ek∈ℕ, and c does not contain any of the xi. Note that the coefficient c may be a sum. This function returns true if m is such a monomial, and false otherwise.
If v is omitted, it is taken to be the set of all indeterminates appearing in m, that is, it checks if m is a monomial in all of its variables.
The domain specification K should be a type name, such as rational or algebraic. If K is specified, then this function will check that the coefficients of m come from the domain K. If the coefficient domain K is omitted, then only coefficients of type constant are allowed.
type⁡sin⁡1⁢x2,monomial
true
type⁡sin⁡1x2,monomial
false
type⁡1+y⁢x2,monomial⁡anything,y
type⁡1+y⁢x2,monomial⁡anything,x
type⁡sin⁡x⁢y,monomial⁡anything,y
The following is not syntactically a monomial.
f≔x+sqrt⁡2⁢x
f≔x+2⁢x
type⁡f,monomial⁡radalgnum
type⁡collect⁡f,x,monomial⁡radalgnum
type⁡collect⁡f,x,monomial⁡rational
Any constant is a monomial.
type⁡1+sqrt⁡2,monomial
The type/monomial command was updated in Maple 2020.
See Also
indets
type
type/polynom
Download Help Document