A monomial ordering that compares exponent vectors componentwise from a specified first variable to last: given a fixed variable ordering, two monomials are compared by the first exponent at which they differ, with the larger exponent at that position making the monomial larger. It is a total, well-founded order on monomials used in symbolic polynomial algorithms.

Principle

Compare exponent vectors lexicographically according to a chosen variable precedence; the earliest (highest-precedence) differing exponent determines the order.

Demonstration

With variables ordered x>y>z, compare x^2y (exponent vector (2,1,0)) and xy^3 (1,3,0). The first coordinate differs (2 vs. 1), so x^2y > xy^3 under lexicographic order.

Misapplication

Using lexicographic order blindly when degree-sensitive heuristics are required; because lex ignores total degree, it can produce Gröbner bases with much larger intermediate degree growth and worse performance for general solving tasks.

Consequence

When applied correctly it enforces variable precedence that is ideal for elimination: a Gröbner basis computed with a lex order places eliminated-variable information into leading terms, enabling direct extraction of elimination ideals.

Reversal

Reverse the ordering to a reverse-lexicographic or graded order: instead of earliest differing exponent, compare from the last variable or prioritize total degree first, which changes elimination and complexity behavior.

Boundary

Applies to monomials in a commutative polynomial ring with a fixed linear variable order; it does not directly generalize to weighted orders, noncommutative monomials, or orders that prioritize total degree.

Semantic Tension

Tension exists between lexicographic order and graded orders (e.g., GrLex): lex enforces strict variable precedence useful for elimination, whereas graded orders balance degree and often yield smaller intermediate expressions for Gröbner basis computations.

Synthesis

Lexicographic order is the componentwise comparison of exponent vectors according to a specified variable precedence; it sacrifices degree sensitivity to guarantee elimination-friendly leading terms and a simple, predictable ordering.