Monomial ideal

Last updated

In abstract algebra, a monomial ideal is an ideal generated by monomials in a multivariate polynomial ring over a field.

Contents

A toric ideal is an ideal generated by differences of monomials (provided the ideal is prime). An affine or projective algebraic variety defined by a toric ideal or a homogeneous toric ideal is an affine or projective toric variety, possibly non-normal.

Definitions and properties

Let be a field and be the polynomial ring over with n indeterminates .

A monomial in is a product for an n-tuple of nonnegative integers.

The following three conditions are equivalent for an ideal :

  1. is generated by monomials,
  2. If , then , provided that is nonzero.
  3. is torus fixed, i.e, given , then is fixed under the action for all .

We say that is a monomial ideal if it satisfies any of these equivalent conditions.

Given a monomial ideal , is in if and only if every monomial ideal term of is a multiple of one the . [1]

Proof: Suppose and that is in . Then , for some .

For all , we can express each as the sum of monomials, so that can be written as a sum of multiples of the . Hence, will be a sum of multiples of monomial terms for at least one of the .

Conversely, let and let each monomial term in be a multiple of one of the in . Then each monomial term in can be factored from each monomial in . Hence is of the form for some , as a result .

The following illustrates an example of monomial and polynomial ideals.

Let then the polynomial is in I, since each term is a multiple of an element in J, i.e., they can be rewritten as and both in I. However, if , then this polynomial is not in J, since its terms are not multiples of elements in J.

Monomial ideals and Young diagrams

Bivariate monomial ideals can be interpreted as Young diagrams.

Let be a monomial ideal in where is a field. The ideal has a unique minimal generating set of of the form , where and . The monomials in are those monomials such that there exists such and [2] If a monomial is represented by the point in the plane, the figure formed by the monomials in is often called the staircase of because of its shape. In this figure, the minimal generators form the inner corners of a Young diagram.

The monomials not in lie below the staircase, and form a vector space basis of the quotient ring .

For example, consider the monomial ideal The set of grid points corresponds to the minimal monomial generators Then as the figure shows, the pink Young diagram consists of the monomials that are not in . The points in the inner corners of the Young diagram, allow us to identify the minimal monomials in as seen in the green boxes. Hence, .

A Young diagram and its connection with its monomial ideal. Wikipic.png
A Young diagram and its connection with its monomial ideal.

In general, to any set of grid points, we can associate a Young diagram, so that the monomial ideal is constructed by determining the inner corners that make up the staircase diagram; likewise, given a monomial ideal, we can make up the Young diagram by looking at the and representing them as the inner corners of the Young diagram. The coordinates of the inner corners would represent the powers of the minimal monomials in . Thus, monomial ideals can be described by Young diagrams of partitions.

Moreover, the -action on the set of such that as a vector space over has fixed points corresponding to monomial ideals only, which correspond to integer partitions of size n, which are identified by Young diagrams with n boxes.

Monomial orderings and Gröbner bases

A monomial ordering is a well ordering on the set of monomials such that if are monomials, then .

By the monomial order, we can state the following definitions for a polynomial in .

Definition [1]

  1. Consider an ideal , and a fixed monomial ordering. The leading term of a nonzero polynomial , denoted by is the monomial term of maximal order in and the leading term of is .
  2. The ideal of leading terms, denoted by , is the ideal generated by the leading terms of every element in the ideal, that is, .
  3. A Gröbner basis for an ideal is a finite set of generators for whose leading terms generate the ideal of all the leading terms in , i.e., and .

Note that in general depends on the ordering used; for example, if we choose the lexicographical order on subject to x > y, then , but if we take y > x then .

In addition, monomials are present on Gröbner basis and to define the division algorithm for polynomials in several indeterminates.

Notice that for a monomial ideal , the finite set of generators is a Gröbner basis for . To see this, note that any polynomial can be expressed as for . Then the leading term of is a multiple for some . As a result, is generated by the likewise.

See also

Footnotes

Related Research Articles

In mathematics, a finite field or Galois field is a field that contains a finite number of elements. As with any field, a finite field is a set on which the operations of multiplication, addition, subtraction and division are defined and satisfy certain basic rules. The most common examples of finite fields are given by the integers mod p when p is a prime number.

In commutative algebra, the prime spectrum of a commutative ring R is the set of all prime ideals of R, and is usually denoted by ; in algebraic geometry it is simultaneously a topological space equipped with the sheaf of rings .

In mathematics, a formal series is an infinite sum that is considered independently from any notion of convergence, and can be manipulated with the usual algebraic operations on series.

In algebraic number theory, an algebraic integer is a complex number that is integral over the integers. That is, an algebraic integer is a complex root of some monic polynomial whose coefficients are integers. The set of all algebraic integers A is closed under addition, subtraction and multiplication and therefore is a commutative subring of the complex numbers.

In mathematics, Hilbert's Nullstellensatz is a theorem that establishes a fundamental relationship between geometry and algebra. This relationship is the basis of algebraic geometry. It relates algebraic sets to ideals in polynomial rings over algebraically closed fields. This relationship was discovered by David Hilbert, who proved the Nullstellensatz in his second major paper on invariant theory in 1893.

<span class="mw-page-title-main">Differential operator</span> Typically linear operator defined in terms of differentiation of functions

In mathematics, a differential operator is an operator defined as a function of the differentiation operator. It is helpful, as a matter of notation first, to consider differentiation as an abstract operation that accepts a function and returns another function.

<span class="mw-page-title-main">Lindemann–Weierstrass theorem</span> On algebraic independence of exponentials of linearly independent algebraic numbers over Q

In transcendental number theory, the Lindemann–Weierstrass theorem is a result that is very useful in establishing the transcendence of numbers. It states the following:

In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring K[x1, ..., xn] over a field K. A Gröbner basis allows many important properties of the ideal and the associated algebraic variety to be deduced easily, such as the dimension and the number of zeros when it is finite. Gröbner basis computation is one of the main practical tools for solving systems of polynomial equations and computing the images of algebraic varieties under projections or rational maps.

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates with coefficients in another ring, often a field.

In mathematics, a homogeneous function is a function of several variables such that the following holds: If each of the function's arguments is multiplied by the same scalar, then the function's value is multiplied by some power of this scalar; the power is called the degree of homogeneity, or simply the degree. That is, if k is an integer, a function f of n variables is homogeneous of degree k if

<span class="mw-page-title-main">Semisimple Lie algebra</span> Direct sum of simple Lie algebras

In mathematics, a Lie algebra is semisimple if it is a direct sum of simple Lie algebras.

In mathematics, Hensel's lemma, also known as Hensel's lifting lemma, named after Kurt Hensel, is a result in modular arithmetic, stating that if a univariate polynomial has a simple root modulo a prime number p, then this root can be lifted to a unique root modulo any higher power of p. More generally, if a polynomial factors modulo p into two coprime polynomials, this factorization can be lifted to a factorization modulo any higher power of p.

In mathematics, the Noether normalization lemma is a result of commutative algebra, introduced by Emmy Noether in 1926. It states that for any field k, and any finitely generated commutative k-algebraA, there exist elements y1, y2, ..., yd in A that are algebraically independent over k and such that A is a finitely generated module over the polynomial ring S = k [y1, y2, ..., yd]. The integer d is equal to the Krull dimension of the ring A; and if A is an integral domain, d is also the transcendence degree of the field of fractions of A over k.

In field theory, a branch of mathematics, the minimal polynomial of an element α of an extension field of a field is, roughly speaking, the polynomial of lowest degree having coefficients in the smaller field, such that α is a root of the polynomial. If the minimal polynomial of α exists, it is unique. The coefficient of the highest-degree term in the polynomial is required to be 1.

In mathematics, Macdonald polynomialsPλ(x; t,q) are a family of orthogonal symmetric polynomials in several variables, introduced by Macdonald in 1987. He later introduced a non-symmetric generalization in 1995. Macdonald originally associated his polynomials with weights λ of finite root systems and used just one variable t, but later realized that it is more natural to associate them with affine root systems rather than finite root systems, in which case the variable t can be replaced by several different variables t=(t1,...,tk), one for each of the k orbits of roots in the affine root system. The Macdonald polynomials are polynomials in n variables x=(x1,...,xn), where n is the rank of the affine root system. They generalize many other families of orthogonal polynomials, such as Jack polynomials and Hall–Littlewood polynomials and Askey–Wilson polynomials, which in turn include most of the named 1-variable orthogonal polynomials as special cases. Koornwinder polynomials are Macdonald polynomials of certain non-reduced root systems. They have deep relationships with affine Hecke algebras and Hilbert schemes, which were used to prove several conjectures made by Macdonald about them.

In mathematics the Function Field Sieve is one of the most efficient algorithms to solve the Discrete Logarithm Problem (DLP) in a finite field. It has heuristic subexponential complexity. Leonard Adleman developed it in 1994 and then elaborated it together with M. D. Huang in 1999. Previous work includes the work of D. Coppersmith about the DLP in fields of characteristic two.

<span class="mw-page-title-main">Kostka number</span>

In mathematics, the Kostka number is a non-negative integer that is equal to the number of semistandard Young tableaux of shape and weight . They were introduced by the mathematician Carl Kostka in his study of symmetric functions.

In algebra and in particular in algebraic combinatorics, a quasisymmetric function is any element in the ring of quasisymmetric functions which is in turn a subring of the formal power series ring with a countable number of variables. This ring generalizes the ring of symmetric functions. This ring can be realized as a specific limit of the rings of quasisymmetric polynomials in n variables, as n goes to infinity. This ring serves as universal structure in which relations between quasisymmetric polynomials can be expressed in a way independent of the number n of variables.

In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts of number theory, but also in other areas. In particular, they have a significant place in cryptography. Micciancio defined a generalization of cyclic lattices as ideal lattices. They can be used in cryptosystems to decrease by a square root the number of parameters necessary to describe a lattice, making them more efficient. Ideal lattices are a new concept, but similar lattice classes have been used for a long time. For example, cyclic lattices, a special case of ideal lattices, are used in NTRUEncrypt and NTRUSign.

In mathematics, the Newton polytope is an integral polytope associated with a multivariate polynomial. It can be used to analyze the polynomial's behavior when specific variables are considered negligible relative to the others. Specifically, given a vector of variables and a finite family of pairwise distinct vectors from each encoding the exponents within a monomial, consider the multivariate polynomial

References

Further reading