polynomial functional calculus


Let 𝒜 be an unital associative algebra over ℂ with identity elementMathworldPlanetmath e and let a∈𝒜.

The polynomial functional calculus is the most basic form of a functional calculus. It allows the expression

p⁢(a)

to make sense as an element of 𝒜, for any polynomialMathworldPlanetmathPlanetmathPlanetmath p:ℂ⟶ℂ.

This is achieved in the following natural way: for any polynomial p⁢(λ):=∑cn⁢λn we the element p⁢(a):=∑cn⁢an∈𝒜.

1 Definition

Recall that the set of polynomial functions in ℂ, denoted by ℂ⁢[λ], is an associative algebra over ℂ under pointwise operations and is generated by the constant polynomial 1 and the variableMathworldPlanetmath λ (corresponding to the identity function in ℂ).

Moreover, any homomorphismPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmathPlanetmath from the algebraMathworldPlanetmathPlanetmathPlanetmathPlanetmath ℂ⁢[λ] is perfectly determined by the values of 1 and λ.

Definition - Consider the algebra homomorphism π:C⁢[λ]⟶A such that π⁢(1)=e and π⁢(λ)=a. This homomorphism is denoted by

p⟼p⁢(a)

and it is called the polynomial functional calculus for a.

It is clear that for any polynomial p⁢(λ):=∑cn⁢λn we have p⁢(a)=∑cn⁢an.

2 Spectral Properties

We will denote by σ⁢(x) the spectrum (http://planetmath.org/Spectrum) of an element x∈𝒜.

TheoremMathworldPlanetmath - (polynomial spectral mapping theorem) - Let A be an unital associative algebra over C and a an element in A. For any polynomial p we have that

σ⁢(p⁢(a))=p⁢(σ⁢(a))

: Let us first prove that σ⁢(p⁢(a))⊆p⁢(σ⁢(a)). Suppose λ~∈σ⁢(p⁢(a)), which means that p⁢(a)-λ~⁢e is not invertiblePlanetmathPlanetmath. Now consider the polynomial in ℂ given by q:=p-λ~. It is clear that q⁢(a)=p⁢(a)-λ~⁢e, and therefore q⁢(a) is not invertible. Since ℂ is algebraically closedMathworldPlanetmath (http://planetmath.org/FundamentalTheoremOfAlgebra), we have that

q⁢(λ)=(λ-λ1)n1⁢⋯⁢(λ-λk)nk

for some λ1,…,λk∈ℂ and n1,…,nk∈ℕ. Thus, we can also write a similar productMathworldPlanetmathPlanetmath for q⁢(a) as

q⁢(a)=(a-λ1⁢e)n1⁢⋯⁢(a-λk⁢e)nk

Now, since q⁢(a) is not invertible we must have that at least one of the factors (a-λi⁢e) is not invertible, which means that for that particular λi we have λi∈σ⁢(a). But we also have that q⁢(λi)=0, i.e. p⁢(λi)=λ~, and hence λ~∈p⁢(σ⁢(a)).

We now prove the inclusion σ⁢(p⁢(a))⊇p⁢(σ⁢(a)). Suppose λ~∈p⁢(σ⁢(a)), which means that λ~=p⁢(λ0) for some λ0∈σ⁢(a). The polynomial p-λ~ has a zero at λ0, hence there is a polynomial d such that

p⁢(λ)-λ~=d⁢(λ)⁢(λ-λ0),λ∈ℂ

Thus, we can also write a similar product for q⁢(a) as

p⁢(a)-λ~⁢e=d⁢(a)⁢(a-λ0⁢e)

If p⁢(a)-λ~⁢e was invertible, then we would see that a-λ0⁢e had a left (http://planetmath.org/InversesInRings) and a right inverseMathworldPlanetmath (http://planetmath.org/InversesInRings), thus being invertible. But we know that λ0∈σ⁢(a), hence we conclude that p⁢(a)-λ~⁢e cannot be invertible, i.e. λ~∈σ⁢(p⁢(a)). □

Title polynomial functional calculus
Canonical name PolynomialFunctionalCalculus
Date of creation 2013-03-22 18:48:23
Last modified on 2013-03-22 18:48:23
Owner asteroid (17536)
Last modified by asteroid (17536)
Numerical id 8
Author asteroid (17536)
Entry type Feature
Classification msc 46H30
Classification msc 47A60
Related topic FunctionalCalculus
Related topic ContinuousFunctionalCalculus2
Related topic BorelFunctionalCalculus
Defines polynomial spectral mapping theorem