Commutative algebra Definition
Monomial order
Builds on Polynomial ringMonomial idealTotal orderWell-orderLexicographic order
Definition
Let be a field and let . The monomials of the polynomial ring are the products with . A monomial order is a relation on the set of monomials such that:
- is a strict total order.
- If , then for every .
- is a well-order: every nonempty set of monomials has a smallest element.
Remarks
Given clauses 1 and 2, clause 3 is equivalent to for every ; this uses Dickson's lemma. Equivalently, a monomial order is a total order on that is compatible with addition and has as its least element. For a nonzero polynomial , the leading monomial is the largest monomial that occurs in , and the leading term is that monomial with its coefficient.
Example: the lexicographic order: if the first nonzero entry of is positive. It is total, it is compatible since , and it is a well-order on .
Non-example: for , order the monomials by if . This is a total order compatible with multiplication, but is an infinite descending chain, so clause 3 fails.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Lexicographic order concept
- Monomial ideal concept
- Polynomial ring concept
- Total order concept
- Well-order concept
- Monomial order definition
Further reading
About this page
| Tag | K711RM2Z15 |
|---|---|
| URI | m2://K711RM2Z15 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 13P10, 06A05 |
| Defines | Monomial order |
| Uses | Polynomial ring, Monomial ideal, Total order, Well-order, Lexicographic order |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.