Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Monomial basis

From Wikipedia, the free encyclopedia
(Redirected fromMonomial form)
Basis of polynomials consisting of monomials
This articledoes notcite anysources. Please helpimprove this article byadding citations to reliable sources. Unsourced material may be challenged andremoved.
Find sources: "Monomial basis" – news ·newspapers ·books ·scholar ·JSTOR
(May 2022) (Learn how and when to remove this message)

Inmathematics themonomial basis of apolynomial ring is itsbasis (as avector space orfree module over thefield orring ofcoefficients) that consists of allmonomials. The monomials form a basis because everypolynomial may be uniquely written as a finitelinear combination of monomials (this is an immediate consequence of the definition of a polynomial).

One indeterminate

[edit]

Thepolynomial ringK[x] ofunivariate polynomials over a fieldK is aK-vector space, which has1,x,x2,x3,{\displaystyle 1,x,x^{2},x^{3},\ldots }as an (infinite) basis. More generally, ifK is aring thenK[x] is afree module which has the same basis.

The polynomials ofdegree at mostd form also a vector space (or a free module in the case of a ring of coefficients), which has{1,x,x2,,xd1,xd}{\displaystyle \{1,x,x^{2},\ldots ,x^{d-1},x^{d}\}} as a basis.

Thecanonical form of a polynomial is its expression on this basis:a0+a1x+a2x2++adxd,{\displaystyle a_{0}+a_{1}x+a_{2}x^{2}+\dots +a_{d}x^{d},}or, using the shortersigma notation:i=0daixi.{\displaystyle \sum _{i=0}^{d}a_{i}x^{i}.}

The monomial basis is naturallytotally ordered, either by increasing degrees1<x<x2<,{\displaystyle 1<x<x^{2}<\cdots ,}or by decreasing degrees1>x>x2>.{\displaystyle 1>x>x^{2}>\cdots .}

Several indeterminates

[edit]

In the case of several indeterminatesx1,,xn,{\displaystyle x_{1},\ldots ,x_{n},} amonomial is a productx1d1x2d2xndn,{\displaystyle x_{1}^{d_{1}}x_{2}^{d_{2}}\cdots x_{n}^{d_{n}},}where thedi{\displaystyle d_{i}} are non-negativeintegers. Asxi0=1,{\displaystyle x_{i}^{0}=1,} an exponent equal to zero means that the corresponding indeterminate does not appear in the monomial; in particular1=x10x20xn0{\displaystyle 1=x_{1}^{0}x_{2}^{0}\cdots x_{n}^{0}} is a monomial.

Similar to the case of univariate polynomials, the polynomials inx1,,xn{\displaystyle x_{1},\ldots ,x_{n}} form a vector space (if the coefficients belong to a field) or a free module (if the coefficients belong to a ring), which has the set of all monomials as a basis, called themonomial basis.

Thehomogeneous polynomials of degreed{\displaystyle d} form asubspace which has the monomials of degreed=d1++dn{\displaystyle d=d_{1}+\cdots +d_{n}} as a basis. Thedimension of this subspace is the number of monomials of degreed{\displaystyle d}, which is(d+n1d)=n(n+1)(n+d1)d!,{\displaystyle {\binom {d+n-1}{d}}={\frac {n(n+1)\cdots (n+d-1)}{d!}},}where(d+n1d){\textstyle {\binom {d+n-1}{d}}} is abinomial coefficient.

The polynomials of degree at mostd{\displaystyle d} form also a subspace, which has the monomials of degree at mostd{\displaystyle d} as a basis. The number of these monomials is the dimension of this subspace, equal to(d+nd)=(d+nn)=(d+1)(d+n)n!.{\displaystyle {\binom {d+n}{d}}={\binom {d+n}{n}}={\frac {(d+1)\cdots (d+n)}{n!}}.}

In contrast to the univariate case, there is no naturaltotal order of the monomial basis in the multivariate case. For problems which require choosing a total order, such asGröbner basis computations, one generally chooses anadmissiblemonomial order – that is, a total order on the set of monomials such thatm<nmq<nq{\displaystyle m<n\iff mq<nq}and1m{\displaystyle 1\leq m} for every monomialm,n,q.{\displaystyle m,n,q.}

See also

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Monomial_basis&oldid=1222689040"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp