HOME

TheInfoList



OR:

In algebra, a polynomial functor is an
endofunctor In mathematics, specifically category theory, a functor is a mapping between categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, an ...
on the category \mathcal of finite-dimensional vector spaces that depends polynomially on vector spaces. For example, the symmetric powers V \mapsto \operatorname^n(V) and the
exterior power In mathematics, the exterior algebra, or Grassmann algebra, named after Hermann Grassmann, is an algebra that uses the exterior product or wedge product as its multiplication. In mathematics, the exterior product or wedge product of vectors is ...
s V \mapsto \wedge^n(V) are polynomial functors from \mathcal to \mathcal; these two are also Schur functors. The notion appears in
representation theory Representation theory is a branch of mathematics that studies abstract algebraic structures by ''representing'' their elements as linear transformations of vector spaces, and studies modules over these abstract algebraic structures. In essen ...
as well as category theory (the calculus of functors). In particular, the category of homogeneous polynomial functors of degree ''n'' is equivalent to the category of finite-dimensional representations of the
symmetric group In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group ...
S_n over a field of characteristic zero.


Definition

Let ''k'' be a field of characteristic zero and \mathcal the
category Category, plural categories, may refer to: Philosophy and general uses *Categorization, categories in cognitive science, information science and generally * Category of being * ''Categories'' (Aristotle) * Category (Kant) * Categories (Peirce) ...
of finite-dimensional ''k''-
vector spaces In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called ''vectors'', may be added together and multiplied ("scaled") by numbers called '' scalars''. Scalars are often real numbers, but c ...
and ''k''- linear maps. Then an
endofunctor In mathematics, specifically category theory, a functor is a mapping between categories. Functors were first considered in algebraic topology, where algebraic objects (such as the fundamental group) are associated to topological spaces, an ...
F\colon \mathcal \to \mathcal is a ''polynomial functor'' if the following equivalent conditions hold: *For every pair of vector spaces ''X'', ''Y'' in \mathcal, the map F\colon \operatorname(X, Y) \to \operatorname(F(X), F(Y)) is a polynomial mapping (i.e., a vector-valued polynomial in linear forms). *Given linear maps f_i: X \to Y, \, 1 \le i \le r in \mathcal, the function (\lambda_1, \dots, \lambda_r) \mapsto F(\lambda_1 f_1 + \cdots + \lambda_r f_r) defined on k^r is a polynomial function with
coefficients In mathematics, a coefficient is a multiplicative factor in some term of a polynomial, a series, or an expression; it is usually a number, but may be any expression (including variables such as , and ). When the coefficients are themselves ...
in \operatorname(F(X), F(Y)). A polynomial functor is said to be ''
homogeneous Homogeneity and heterogeneity are concepts often used in the sciences and statistics relating to the uniformity of a substance or organism. A material or image that is homogeneous is uniform in composition or character (i.e. color, shape, siz ...
of degree ''n if for any linear maps f_1, \dots, f_r in \mathcal with common domain and codomain, the vector-valued polynomial F(\lambda_1 f_1 + \cdots + \lambda_r f_r) is homogeneous of degree ''n''.


Variants

If “finite vector spaces” is replaced by “finite sets”, one gets the notion of
combinatorial species In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for deriving the generating functions of discrete structures, which allows one to not merely count these structures but give bijective proofs in ...
(to be precise, those of polynomial nature).


References

* Functors {{categorytheory-stub