It turns out that S(V) is in effect the same as the polynomial ring, over K, in indeterminates that are basis vectors for V. Therefore this construction only brings something extra, in case the naturality of looking at polynomials this way has some advantage. The construction of S(V) is also a special case, that of the Lie bracket always being 0, of the universal enveloping algebra construction.
It is possible to use the tensor algebraT(V) to describe the symmetric algebra S(V). In fact we pass from the tensor algebra to the symmetric algebra by forcing it to be commutative; if elements of V commute, then tensors in them must, so that we should take the quotient ring of T(V) by the ideal generated by all differences of products
vw − wv
for v and w in V. Given the polynomial ring as model, one expects and can prove a direct sum decomposition of S(V) as a graded algebra, into summands
Sk(V)
which consist of the linear span of the monomials in vectors of V of degree k, for k = 0, 1, 2, ... (with S0(V) = K and S1(V)=V). The K-vector space Sk(V) is the k-th symmetric power of V. It has a universal property with respect to symmetric multilinear operators defined on Vk. The Sk are functors comparable to the exterior powers; here though, of course, the dimension grows with k.
Most associative algebras considered in abstract algebra, for instance group algebras, polynomialalgebras and matrix algebras, are unital, if rings are assumed to be so.
Most algebras of functions considered in analysis are not unital, for instance the algebra of square integrable functions (defined on an unbounded domain), and the algebra of functions decreasing to zero at infinity, especially those with compact support on some (non-compact) space.
The old algebra A is contained in the new one, and in fact A×K is the "most general" unital algebra containing A, in the sense of universal constructions.
A polynomial functor (of one variable) is an endofunctor of the category of sets, built from disjoint unions, products, and exponentiation.
They are the categorification of polynomials with natural-number coefficients, and many constructions and results about such polynomials of numbers can be explained on the level of polynomials of sets, e.g.
Just as for polynomials you can perform many manipulations solely in terms of the coefficients, the operations on polynomial functors can be performed in terms of sets.