Jump to content

Polynomial functor

From Wikipedia, the free encyclopedia

In algebra, a polynomial functor is an endofunctor on the category 𝒱 of finite-dimensional vector spaces that depends polynomially on vector spaces. For example, the symmetric powers V↦Symn(V) and the exterior powers V↦∧n(V) are polynomial functors from 𝒱 to 𝒱; these two are also Schur functors.

The notion appears in representation theory 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 Sn over a field of characteristic zero.[1]

Definition

[edit]

Let k be a field of characteristic zero and 𝒱 the category of finite-dimensional k-vector spaces and k-linear maps. Then an endofunctor F:𝒱→𝒱 is a polynomial functor if the following equivalent conditions hold:

  • For every pair of vector spaces X, Y in 𝒱, the map F:Hom⁡(X,Y)→Hom⁡(F(X),F(Y)) is a polynomial mapping (i.e., a vector-valued polynomial in linear forms).
  • Given linear maps fi:X→Y,1≤i≤r in 𝒱, the function (λ1,…,λr)↦F(λ1f1+⋯+λrfr) defined on kr is a polynomial function with coefficients in Hom⁡(F(X),F(Y)).

A polynomial functor is said to be homogeneous of degree n if for any linear maps f1,…,fr in 𝒱 with common domain and codomain, the vector-valued polynomial F(λ1f1+⋯+λrfr) is homogeneous of degree n.

Variants

[edit]

If “finite vector spaces” is replaced by “finite sets”, one gets the notion of combinatorial species (to be precise, those of polynomial nature).

References

[edit]
  1. ↑ Macdonald 1995, Ch. I, Appendix A: 5.4.
  • Macdonald, Ian G. (1995). Symmetric functions and Hall polynomials. Oxford: Clarendon Press. ISBN 0-19-853489-2. OCLC 30733523.MR 1354144