Let
be a field. Then
is the polynomial space in variables
with coefficients in
.
A Monomial is a polynomial of the form
, such that
and
.
Let
, and let
be an exponent vector. Let us define:
![{\displaystyle X^{a}=X_{1}^{a_{1}}\!\cdots X_{n}^{a_{n}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/a318c8e885b5f7accced82a963583323ec6ab2df)
- The degree of
is equal to
.
- The degree of a non-zero polynomial is equal to the maximum of the degrees of its compsing monomials.
Monomial multiplication maintains exponent vector addition:
![{\displaystyle {\begin{aligned}X^{a}\cdot X^{b}&=(X_{1}^{a_{1}}\!\cdots X_{n}^{a_{n}})\cdot (X_{1}^{b_{1}}\!\cdots X_{n}^{b_{n}})\\[5pt]&=(X_{1}^{a_{1}}\!\cdot X_{1}^{b_{1}})\cdots (X_{n}^{a_{n}}\!\cdot X_{n}^{b_{n}})\\[5pt]&=X_{1}^{a_{1}+b_{1}}\!\cdots X_{n}^{a_{n}+b_{n}}\\[5pt]&=X^{a+b}\end{aligned}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/cadfa881e6ad2783843a0d2605dd090a210e4107)
Let
be monomials.
We say that
is of lesser order than
(and denote it by
) if there exists an index
such that
![{\displaystyle {\begin{cases}a_{i}=b_{i}&:\!1\leq i\leq k-1\\[3pt]a_{i}<b_{i}&:i=k\end{cases}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/caa68ace087542c5f84118597dc26faa12a5235c)
In other words, the vectors
have a lexicographic ordering.
In a polynomial
, the monomial of maximal order is called the leading monomial, and is denoted by
.
![{\displaystyle x_{1}^{7}x_{2}^{3}x_{3}^{10}\prec x_{1}^{7}x_{2}^{31}x_{3}\iff (7,3,10)\prec (7,31,1)}](https://wikimedia.org/api/rest_v1/media/math/render/svg/89d690bd12276e3ff7bc1856eb9644f29b31cb59)
Let
be polynomials. Then
.
Let
be monomials, with
.
1. Let us assume that
. We will show that
for all
.
By definition, there exists an index
such that
![{\displaystyle {\begin{cases}a_{i}(+\,c_{i})=f_{i}(+\,c_{i})&:\!1\leq i\leq k-1\\[3pt]a_{i}(+\,c_{i})<f_{i}(+\,c_{i})&:i=k\end{cases}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/c7725cf5e89e7c66f4b36ae0a1949ff0d9261a52)
2. Let us assume also that
. We will show that
.
By definition, there exist indexes
such that respectively
![{\displaystyle {\begin{aligned}&{\begin{cases}a_{i}=f_{i}&:\!1\leq i\leq k_{1}-1\\[3pt]a_{i}<f_{i}&:i=k_{1}\end{cases}},\quad {\begin{cases}b_{i}=g_{i}&:\!1\leq i\leq k_{2}-1\\[3pt]b_{i}<g_{i}&:i=k_{2}\end{cases}}\\[8pt]&{\begin{cases}1\leq k_{1}\leq k_{2}\leq n\!:&(a_{k_{1}}\!<f_{k_{1}}\!)\land (b_{k_{1}}\!\leq g_{k_{1}}\!)\,\implies \,a_{k_{1}}\!+b_{k_{1}}\!<f_{k_{1}}\!+g_{k_{1}}\\[5pt]1\leq k_{2}<k_{1}\leq n\!:&(a_{k_{2}}\!=f_{k_{2}}\!)\land (b_{k_{2}}\!<g_{k_{2}}\!)\,\implies \,a_{k_{2}}\!+b_{k_{2}}\!<f_{k_{2}}\!+g_{k_{2}}\end{cases}}\!{\Bigg \}}\,\implies \,X^{a+b}\prec X^{f+g}\end{aligned}}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/84efbd968cbc8b345c3a862f63d2b1f0306cdc90)
hence:
![{\displaystyle {\text{L}}(F\cdot G)=X^{f+g}=X^{f}\cdot X^{g}={\text{L}}(F)\cdot {\text{L}}(G)}](https://wikimedia.org/api/rest_v1/media/math/render/svg/eb23ef93b37d56cf91152a4a396206c8dbba9f77)