fbpx
Wikipedia

Ring of polynomial functions

In mathematics, the ring of polynomial functions on a vector space V over a field k gives a coordinate-free analog of a polynomial ring. It is denoted by k[V]. If V is finite dimensional and is viewed as an algebraic variety, then k[V] is precisely the coordinate ring of V.

The explicit definition of the ring can be given as follows. If is a polynomial ring, then we can view as coordinate functions on ; i.e., when This suggests the following: given a vector space V, let k[V] be the commutative k-algebra generated by the dual space , which is a subring of the ring of all functions . If we fix a basis for V and write for its dual basis, then k[V] consists of polynomials in .

If k is infinite, then k[V] is the symmetric algebra of the dual space .

In applications, one also defines k[V] when V is defined over some subfield of k (e.g., k is the complex field and V is a real vector space.) The same definition still applies.

Throughout the article, for simplicity, the base field k is assumed to be infinite.

Relation with polynomial ring edit

Let   be the set of all polynomials over a field K and B be the set of all polynomial functions in one variable over K. Both A and B are algebras over K given by the standard multiplication and addition of polynomials and functions. We can map each   in A to   in B by the rule  . A routine check shows that the mapping   is a homomorphism of the algebras A and B. This homomorphism is an isomorphism if and only if K is an infinite field. For example, if K is a finite field then let  . p is a nonzero polynomial in K[x], however   for all t in K, so   is the zero function and our homomorphism is not an isomorphism (and, actually, the algebras are not isomorphic, since the algebra of polynomials is infinite while that of polynomial functions is finite).

If K is infinite then choose a polynomial f such that  . We want to show this implies that  . Let   and let   be n +1 distinct elements of K. Then   for   and by Lagrange interpolation we have  . Hence the mapping   is injective. Since this mapping is clearly surjective, it is bijective and thus an algebra isomorphism of A and B.

Symmetric multilinear maps edit

Let k be an infinite field of characteristic zero (or at least very large) and V a finite-dimensional vector space.

Let   denote the vector space of multilinear functionals   that are symmetric;   is the same for all permutations of  's.

Any λ in   gives rise to a homogeneous polynomial function f of degree q: we just let   To see that f is a polynomial function, choose a basis   of V and   its dual. Then

 ,

which implies f is a polynomial in the ti's.

Thus, there is a well-defined linear map:

 

We show it is an isomorphism. Choosing a basis as before, any homogeneous polynomial function f of degree q can be written as:

 

where   are symmetric in  . Let

 

Clearly,   is the identity; in particular, φ is surjective. To see φ is injective, suppose φ(λ) = 0. Consider

 ,

which is zero. The coefficient of t1t2tq in the above expression is q! times λ(v1, …, vq); it follows that λ = 0.

Note: φ is independent of a choice of basis; so the above proof shows that ψ is also independent of a basis, the fact not a priori obvious.

Example: A bilinear functional gives rise to a quadratic form in a unique way and any quadratic form arises in this way.

Taylor series expansion edit

Given a smooth function, locally, one can get a partial derivative of the function from its Taylor series expansion and, conversely, one can recover the function from the series expansion. This fact continues to hold for polynomials functions on a vector space. If f is in k[V], then we write: for x, y in V,

 

where gn(x, y) are homogeneous of degree n in y, and only finitely many of them are nonzero. We then let

 

resulting in the linear endomorphism Py of k[V]. It is called the polarization operator. We then have, as promised:

Theorem — For each f in k[V] and x, y in V,

 .

Proof: We first note that (Py f) (x) is the coefficient of t in f(x + t y); in other words, since g0(x, y) = g0(x, 0) = f(x),

 

where the right-hand side is, by definition,

 

The theorem follows from this. For example, for n = 2, we have:

 

The general case is similar.  

Operator product algebra edit

When the polynomials are valued not over a field k, but over some algebra, then one may define additional structure. Thus, for example, one may consider the ring of functions over GL(n,m), instead of for k = GL(1,m).[clarification needed] In this case, one may impose an additional axiom.

The operator product algebra is an associative algebra of the form

 

The structure constants   are required to be single-valued functions, rather than sections of some vector bundle. The fields (or operators)   are required to span the ring of functions. In practical calculations, it is usually required that the sums be analytic within some radius of convergence; typically with a radius of convergence of  . Thus, the ring of functions can be taken to be the ring of polynomial functions.

The above can be considered to be an additional requirement imposed on the ring; it is sometimes called the bootstrap. In physics, a special case of the operator product algebra is known as the operator product expansion.

See also edit

Notes edit

References edit

  • Kobayashi, S.; Nomizu, K. (1963), Foundations of Differential Geometry, Vol. 2 (new ed.), Wiley-Interscience (published 2004).

ring, polynomial, functions, this, article, technical, most, readers, understand, please, help, improve, make, understandable, experts, without, removing, technical, details, august, 2023, learn, when, remove, this, template, message, mathematics, ring, polyno. This article may be too technical for most readers to understand Please help improve it to make it understandable to non experts without removing the technical details August 2023 Learn how and when to remove this template message In mathematics the ring of polynomial functions on a vector space V over a field k gives a coordinate free analog of a polynomial ring It is denoted by k V If V is finite dimensional and is viewed as an algebraic variety then k V is precisely the coordinate ring of V The explicit definition of the ring can be given as follows If k t1 tn displaystyle k t 1 dots t n is a polynomial ring then we can view ti displaystyle t i as coordinate functions on kn displaystyle k n i e ti x xi displaystyle t i x x i when x x1 xn displaystyle x x 1 dots x n This suggests the following given a vector space V let k V be the commutative k algebra generated by the dual space V displaystyle V which is a subring of the ring of all functions V k displaystyle V to k If we fix a basis for V and write ti displaystyle t i for its dual basis then k V consists of polynomials in ti displaystyle t i If k is infinite then k V is the symmetric algebra of the dual space V displaystyle V In applications one also defines k V when V is defined over some subfield of k e g k is the complex field and V is a real vector space The same definition still applies Throughout the article for simplicity the base field k is assumed to be infinite Contents 1 Relation with polynomial ring 2 Symmetric multilinear maps 3 Taylor series expansion 4 Operator product algebra 5 See also 6 Notes 7 ReferencesRelation with polynomial ring editLet A K x displaystyle A K x nbsp be the set of all polynomials over a field K and B be the set of all polynomial functions in one variable over K Both A and B are algebras over K given by the standard multiplication and addition of polynomials and functions We can map each f displaystyle f nbsp in A to f displaystyle hat f nbsp in B by the rule f t f t displaystyle hat f t f t nbsp A routine check shows that the mapping f f displaystyle f mapsto hat f nbsp is a homomorphism of the algebras A and B This homomorphism is an isomorphism if and only if K is an infinite field For example if K is a finite field then let p x t K x t displaystyle p x prod limits t in K x t nbsp p is a nonzero polynomial in K x however p t 0 displaystyle p t 0 nbsp for all t in K so p 0 displaystyle hat p 0 nbsp is the zero function and our homomorphism is not an isomorphism and actually the algebras are not isomorphic since the algebra of polynomials is infinite while that of polynomial functions is finite If K is infinite then choose a polynomial f such that f 0 displaystyle hat f 0 nbsp We want to show this implies that f 0 displaystyle f 0 nbsp Let deg f n displaystyle deg f n nbsp and let t0 t1 tn displaystyle t 0 t 1 dots t n nbsp be n 1 distinct elements of K Then f ti 0 displaystyle f t i 0 nbsp for 0 i n displaystyle 0 leq i leq n nbsp and by Lagrange interpolation we have f 0 displaystyle f 0 nbsp Hence the mapping f f displaystyle f mapsto hat f nbsp is injective Since this mapping is clearly surjective it is bijective and thus an algebra isomorphism of A and B Symmetric multilinear maps editLet k be an infinite field of characteristic zero or at least very large and V a finite dimensional vector space Let Sq V displaystyle S q V nbsp denote the vector space of multilinear functionals l 1qV k displaystyle textstyle lambda prod 1 q V to k nbsp that are symmetric l v1 vq displaystyle lambda v 1 dots v q nbsp is the same for all permutations of vi displaystyle v i nbsp s Any l in Sq V displaystyle S q V nbsp gives rise to a homogeneous polynomial function f of degree q we just let f v l v v displaystyle f v lambda v dots v nbsp To see that f is a polynomial function choose a basis ei 1 i n displaystyle e i 1 leq i leq n nbsp of V and ti displaystyle t i nbsp its dual Then l v1 vq i1 iq 1nl ei1 eiq ti1 v1 tiq vq displaystyle lambda v 1 dots v q sum i 1 dots i q 1 n lambda e i 1 dots e i q t i 1 v 1 cdots t i q v q nbsp which implies f is a polynomial in the ti s Thus there is a well defined linear map ϕ Sq V k V q ϕ l v l v v displaystyle phi S q V to k V q phi lambda v lambda v cdots v nbsp We show it is an isomorphism Choosing a basis as before any homogeneous polynomial function f of degree q can be written as f i1 iq 1nai1 iqti1 tiq displaystyle f sum i 1 dots i q 1 n a i 1 cdots i q t i 1 cdots t i q nbsp where ai1 iq displaystyle a i 1 cdots i q nbsp are symmetric in i1 iq displaystyle i 1 dots i q nbsp Let ps f v1 vq i1 iq 1nai1 iqti1 v1 tiq vq displaystyle psi f v 1 dots v q sum i 1 cdots i q 1 n a i 1 cdots i q t i 1 v 1 cdots t i q v q nbsp Clearly ϕ ps displaystyle phi circ psi nbsp is the identity in particular f is surjective To see f is injective suppose f l 0 Consider ϕ l t1v1 tqvq l t1v1 tqvq t1v1 tqvq displaystyle phi lambda t 1 v 1 cdots t q v q lambda t 1 v 1 cdots t q v q t 1 v 1 cdots t q v q nbsp which is zero The coefficient of t1t2 tq in the above expression is q times l v1 vq it follows that l 0 Note f is independent of a choice of basis so the above proof shows that ps is also independent of a basis the fact not a priori obvious Example A bilinear functional gives rise to a quadratic form in a unique way and any quadratic form arises in this way Taylor series expansion editMain article Taylor series Given a smooth function locally one can get a partial derivative of the function from its Taylor series expansion and conversely one can recover the function from the series expansion This fact continues to hold for polynomials functions on a vector space If f is in k V then we write for x y in V f x y n 0 gn x y displaystyle f x y sum n 0 infty g n x y nbsp where gn x y are homogeneous of degree n in y and only finitely many of them are nonzero We then let Pyf x g1 x y displaystyle P y f x g 1 x y nbsp resulting in the linear endomorphism Py of k V It is called the polarization operator We then have as promised Theorem For each f in k V and x y in V f x y n 0 1n Pynf x displaystyle f x y sum n 0 infty 1 over n P y n f x nbsp Proof We first note that Py f x is the coefficient of t in f x t y in other words since g0 x y g0 x 0 f x Pyf x ddt t 0f x ty displaystyle P y f x left d over dt right t 0 f x ty nbsp where the right hand side is by definition f x ty f x t t 0 displaystyle left f x ty f x over t right t 0 nbsp The theorem follows from this For example for n 2 we have Py2f x t1 t1 0Pyf x t1y t1 t1 0 t2 t2 0f x t1 t2 y 2 g2 x y displaystyle P y 2 f x left partial over partial t 1 right t 1 0 P y f x t 1 y left partial over partial t 1 right t 1 0 left partial over partial t 2 right t 2 0 f x t 1 t 2 y 2 g 2 x y nbsp The general case is similar displaystyle square nbsp Operator product algebra editWhen the polynomials are valued not over a field k but over some algebra then one may define additional structure Thus for example one may consider the ring of functions over GL n m instead of for k GL 1 m clarification needed In this case one may impose an additional axiom The operator product algebra is an associative algebra of the form Ai x Bj y kfkij x y z Ck z displaystyle A i x B j y sum k f k ij x y z C k z nbsp The structure constants fkij x y z displaystyle f k ij x y z nbsp are required to be single valued functions rather than sections of some vector bundle The fields or operators Ai x displaystyle A i x nbsp are required to span the ring of functions In practical calculations it is usually required that the sums be analytic within some radius of convergence typically with a radius of convergence of x y displaystyle x y nbsp Thus the ring of functions can be taken to be the ring of polynomial functions The above can be considered to be an additional requirement imposed on the ring it is sometimes called the bootstrap In physics a special case of the operator product algebra is known as the operator product expansion See also editAlgebraic geometry of projective spaces Polynomial ring Symmetric algebra Zariski tangent spaceNotes editReferences editKobayashi S Nomizu K 1963 Foundations of Differential Geometry Vol 2 new ed Wiley Interscience published 2004 Retrieved from https en wikipedia org w index php title Ring of polynomial functions amp oldid 1173813370, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.