Riesz representation theorem

From testwiki
Jump to navigation Jump to search

Template:Short description Template:About

The Riesz representation theorem, sometimes called the Riesz–Fréchet representation theorem after Frigyes Riesz and Maurice René Fréchet, establishes an important connection between a Hilbert space and its continuous dual space. If the underlying field is the real numbers, the two are isometrically isomorphic; if the underlying field is the complex numbers, the two are isometrically anti-isomorphic. The (anti-) isomorphism is a particular natural isomorphism.

Preliminaries and notation

Let H be a Hilbert space over a field 𝔽, where 𝔽 is either the real numbers ℝ or the complex numbers ℂ. If 𝔽=ℂ (resp. if 𝔽=ℝ) then H is called a Template:Em (resp. a Template:Em). Every real Hilbert space can be extended to be a dense subset of a unique (up to bijective isometry) complex Hilbert space, called its complexification, which is why Hilbert spaces are often automatically assumed to be complex. Real and complex Hilbert spaces have in common many, but by no means all, properties and results/theorems.

This article is intended for both mathematicians and physicists and will describe the theorem for both. In both mathematics and physics, if a Hilbert space is assumed to be real (that is, if 𝔽=ℝ) then this will usually be made clear. Often in mathematics, and especially in physics, unless indicated otherwise, "Hilbert space" is usually automatically assumed to mean "complex Hilbert space." Depending on the author, in mathematics, "Hilbert space" usually means either (1) a complex Hilbert space, or (2) a real Template:Em complex Hilbert space.

Linear and antilinear maps

By definition, an [[Antilinear map|Template:Em]] (also called a Template:Em) f:H→Y is a map between vector spaces that is Template:Em: f(x+y)=f(x)+f(y) for all x,y∈H, and Template:Em (also called Template:Em or Template:Em): f(cx)=c‾f(x) for all x∈H and all scalar c∈𝔽, where c‾ is the conjugate of the complex number c=a+bi, given by c‾=a−bi.

In contrast, a map f:H→Y is linear if it is additive and [[Homogeneous function|Template:Em]]: f(cx)=cf(x) for all x∈H and all scalars c∈𝔽.

Every constant 0 map is always both linear and antilinear. If 𝔽=ℝ then the definitions of linear maps and antilinear maps are completely identical. A linear map from a Hilbert space into a Banach space (or more generally, from any Banach space into any topological vector space) is continuous if and only if it is bounded; the same is true of antilinear maps. The inverse of any antilinear (resp. linear) bijection is again an antilinear (resp. linear) bijection. The composition of two Template:Emlinear maps is a Template:Em map.

Continuous dual and anti-dual spaces

A Template:Em on H is a function H→𝔽 whose codomain is the underlying scalar field 𝔽. Denote by H∗ (resp. by H‾∗) the set of all continuous linear (resp. continuous antilinear) functionals on H, which is called the Template:Em (resp. the Template:Em) of H.Template:Sfn If 𝔽=ℝ then linear functionals on H are the same as antilinear functionals and consequently, the same is true for such continuous maps: that is, H∗=H‾∗.

One-to-one correspondence between linear and antilinear functionals

Given any functional f:H→𝔽, the Template:Em is the functional f‾:H→𝔽h↦f(h)‾.

This assignment is most useful when 𝔽=ℂ because if 𝔽=ℝ then f=f‾ and the assignment f↦f‾ reduces down to the identity map.

The assignment f↦f‾ defines an antilinear bijective correspondence from the set of

all functionals (resp. all linear functionals, all continuous linear functionals H∗) on H,

onto the set of

all functionals (resp. all Template:Emlinear functionals, all continuous Template:Emlinear functionals H‾∗) on H.

Mathematics vs. physics notations and definitions of inner product

The Hilbert space H has an associated inner product H×H→𝔽 valued in H's underlying scalar field 𝔽 that is linear in one coordinate and antilinear in the other (as specified below). If H is a complex Hilbert space (𝔽=ℂ), then there is a crucial difference between the notations prevailing in mathematics versus physics, regarding which of the two variables is linear. However, for real Hilbert spaces (𝔽=ℝ), the inner product is a symmetric map that is linear in each coordinate (bilinear), so there can be no such confusion.

In mathematics, the inner product on a Hilbert space H is often denoted by ⟨⋅,⋅⟩ or ⟨⋅,⋅⟩H while in physics, the bra–ket notation ⟨⋅∣⋅⟩ or ⟨⋅∣⋅⟩H is typically used. In this article, these two notations will be related by the equality:

⟨x,y⟩:=⟨y∣x⟩ for all x,y∈H.These have the following properties:

  1. The map ⟨⋅,⋅⟩ is linear in its first coordinate; equivalently, the map ⟨⋅∣⋅⟩ is linear in its second coordinate. That is, for fixed y∈H, the map ⟨y∣⋅⟩=⟨⋅,y⟩:H→𝔽 with h↦⟨y∣h⟩=⟨h,y⟩ is a linear functional on H. This linear functional is continuous, so ⟨y∣⋅⟩=⟨⋅,y⟩∈H∗.
  2. The map ⟨⋅,⋅⟩ is antilinear in its Template:Em coordinate; equivalently, the map ⟨⋅∣⋅⟩ is antilinear in its Template:Em coordinate. That is, for fixed y∈H, the map ⟨⋅∣y⟩=⟨y,⋅⟩:H→𝔽 with h↦⟨h∣y⟩=⟨y,h⟩ is an antilinear functional on H. This antilinear functional is continuous, so ⟨⋅∣y⟩=⟨y,⋅⟩∈H‾∗.

In computations, one must consistently use either the mathematics notation ⟨⋅,⋅⟩, which is (linear, antilinear); or the physics notation ⟨⋅∣⋅⟩, which is (antilinear | linear).

Canonical norm and inner product on the dual space and anti-dual space

If x=y then ⟨x∣x⟩=⟨x,x⟩ is a non-negative real number and the map ‖x‖:=⟨x,x⟩=⟨x∣x⟩

defines a canonical norm on H that makes H into a normed space.Template:Sfn As with all normed spaces, the (continuous) dual space H∗ carries a canonical norm, called the Template:Em, that is defined byTemplate:Sfn ‖f‖H∗:=sup‖x‖≤1,x∈H|f(x)| for every f∈H∗.

The canonical norm on the (continuous) anti-dual space H‾∗, denoted by ‖f‖H‾∗, is defined by using this same equation:Template:Sfn ‖f‖H‾∗:=sup‖x‖≤1,x∈H|f(x)| for every f∈H‾∗.

This canonical norm on H∗ satisfies the parallelogram law, which means that the polarization identity can be used to define a Template:Em which this article will denote by the notations ⟨f,g⟩H∗:=⟨g∣f⟩H∗, where this inner product turns H∗ into a Hilbert space. There are now two ways of defining a norm on H∗: the norm induced by this inner product (that is, the norm defined by f↦⟨f,f⟩H∗) and the usual dual norm (defined as the supremum over the closed unit ball). These norms are the same; explicitly, this means that the following holds for every f∈H∗: sup‖x‖≤1,x∈H|f(x)|=‖f‖H∗=⟨f,f⟩H∗=⟨f∣f⟩H∗.

As will be described later, the Riesz representation theorem can be used to give an equivalent definition of the canonical norm and the canonical inner product on H∗.

The same equations that were used above can also be used to define a norm and inner product on H's anti-dual space H‾∗.Template:Sfn

Canonical isometry between the dual and antidual

The complex conjugate f‾ of a functional f, which was defined above, satisfies ‖f‖H∗=‖f‾‖H‾∗ and ‖g‾‖H∗=‖g‖H‾∗ for every f∈H∗ and every g∈H‾∗. This says exactly that the canonical antilinear bijection defined by Cong⁡:H∗→H‾∗f↦f‾ as well as its inverse Cong−1:H‾∗→H∗ are antilinear isometries and consequently also homeomorphisms. The inner products on the dual space H∗ and the anti-dual space H‾∗, denoted respectively by ⟨⋅,⋅⟩H∗ and ⟨⋅,⋅⟩H‾∗, are related by ⟨f‾|g‾⟩H‾∗=⟨f|g⟩H∗‾=⟨g|f⟩H∗ for all f,g∈H∗ and ⟨f‾|g‾⟩H∗=⟨f|g⟩H‾∗‾=⟨g|f⟩H‾∗ for all f,g∈H‾∗.

If 𝔽=ℝ then H∗=H‾∗ and this canonical map Cong⁡:H∗→H‾∗ reduces down to the identity map.

Riesz representation theorem

Two vectors x and y are Template:Em if ⟨x,y⟩=0, which happens if and only if ‖y‖≤‖y+sx‖ for all scalars s.Template:Sfn The orthogonal complement of a subset X⊆H is X⊥:={y∈H:⟨y,x⟩=0 for all x∈X}, which is always a closed vector subspace of H. The Hilbert projection theorem guarantees that for any nonempty closed convex subset C of a Hilbert space there exists a unique vector m∈C such that ‖m‖=infc∈C‖c‖; that is, m∈C is the (unique) global minimum point of the function C→[0,∞) defined by c↦‖c‖.

Statement

Template:Math theorem

Template:Math theorem

Historically, the theorem is often attributed simultaneously to Riesz and Fréchet in 1907 (see references).

Template:Collapse top Let 𝔽 denote the underlying scalar field of H.

Template:Em

Fix y∈H. Define Λ:H→𝔽 by Λ(z):=⟨y|z⟩, which is a linear functional on H since z is in the linear argument. By the Cauchy–Schwarz inequality, |Λ(z)|=|⟨y|z⟩|≤‖y‖‖z‖ which shows that Λ is bounded (equivalently, continuous) and that ‖Λ‖≤‖y‖. It remains to show that ‖y‖≤‖Λ‖. By using y in place of z, it follows that ‖y‖2=⟨y|y⟩=Λ(y)=|Λ(y)|≤‖Λ‖‖y‖ (the equality Λ(y)=|Λ(y)| holds because Λ(y)=‖y‖2≥0 is real and non-negative). Thus that ‖Λ‖=‖y‖. ◼

The proof above did not use the fact that H is complete, which shows that the formula for the norm ‖⟨y|⋅⟩‖H∗=‖y‖H holds more generally for all inner product spaces.

Template:Hr

Template:Em

Suppose f,g∈H are such that φ(z)=⟨f|z⟩ and φ(z)=⟨g|z⟩ for all z∈H. Then ⟨f−g|z⟩=⟨f|z⟩−⟨g|z⟩=φ(z)−φ(z)=0 for all z∈H which shows that Λ:=⟨f−g|⋅⟩ is the constant 0 linear functional. Consequently 0=‖⟨f−g|⋅⟩‖=‖f−g‖, which implies that f−g=0. ◼

Template:Hr

Template:Em

Let K:=ker⁡φ:={m∈H:φ(m)=0}. If K=H (or equivalently, if φ=0) then taking fφ:=0 completes the proof so assume that K≠H and φ≠0. The continuity of φ implies that K is a closed subspace of H (because K=φ−1({0}) and {0} is a closed subset of 𝔽). Let K⊥:={v∈H:⟨v|k⟩=0 for all k∈K} denote the orthogonal complement of K in H. Because K is closed and H is a Hilbert space,[note 1] H can be written as the direct sum H=K⊕K⊥[note 2] (a proof of this is given in the article on the Hilbert projection theorem). Because K≠H, there exists some non-zero p∈K⊥. For any h∈H, φ[(φh)p−(φp)h]=φ[(φh)p]−φ[(φp)h]=(φh)φp−(φp)φh=0, which shows that (φh)p−(φp)h∈ker⁡φ=K, where now p∈K⊥ implies 0=⟨p|(φh)p−(φp)h⟩=⟨p|(φh)p⟩−⟨p|(φp)h⟩=(φh)⟨p|p⟩−(φp)⟨p|h⟩. Solving for φh shows that φh=(φp)⟨p|h⟩‖p‖2=⟨φp‾‖p‖2p|h⟩ for every h∈H, which proves that the vector fφ:=φp‾‖p‖2p satisfies φh=⟨fφ|h⟩ for every h∈H.

Applying the norm formula that was proved above with y:=fφ shows that ‖φ‖H∗=‖⟨fφ|⋅⟩‖H∗=‖fφ‖H. Also, the vector u:=p‖p‖ has norm ‖u‖=1 and satisfies fφ:=φ(u)‾u. ◼

Template:Hr

It can now be deduced that K⊥ is 1-dimensional when φ≠0. Let q∈K⊥ be any non-zero vector. Replacing p with q in the proof above shows that the vector g:=φq‾‖q‖2q satisfies φ(h)=⟨g|h⟩ for every h∈H. The uniqueness of the (non-zero) vector fφ representing φ implies that fφ=g, which in turn implies that φq‾≠0 and q=‖q‖2φq‾fφ. Thus every vector in K⊥ is a scalar multiple of fφ. ◼

The formulas for the inner products follow from the polarization identity.

Template:Collapse bottom

Observations

If φ∈H∗ then φ(fφ)=⟨fφ,fφ⟩=‖fφ‖2=‖φ‖2. So in particular, φ(fφ)≥0 is always real and furthermore, φ(fφ)=0 if and only if fφ=0 if and only if φ=0.

Linear functionals as affine hyperplanes

A non-trivial continuous linear functional φ is often interpreted geometrically by identifying it with the affine hyperplane A:=φ−1(1) (the kernel ker⁡φ=φ−1(0) is also often visualized alongside A:=φ−1(1) although knowing A is enough to reconstruct ker⁡φ because if A=∅ then ker⁡φ=H and otherwise ker⁡φ=A−A). In particular, the norm of φ should somehow be interpretable as the "norm of the hyperplane A". When φ≠0 then the Riesz representation theorem provides such an interpretation of ‖φ‖ in terms of the affine hyperplane[note 3] A:=φ−1(1) as follows: using the notation from the theorem's statement, from ‖φ‖2≠0 it follows that C:=φ−1(‖φ‖2)=‖φ‖2φ−1(1)=‖φ‖2A and so ‖φ‖=‖fφ‖=infc∈C‖c‖ implies ‖φ‖=infa∈A‖φ‖2‖a‖ and thus ‖φ‖=1infa∈A‖a‖. This can also be seen by applying the Hilbert projection theorem to A and concluding that the global minimum point of the map A→[0,∞) defined by a↦‖a‖ is fφ‖φ‖2∈A. The formulas 1infa∈A‖a‖=supa∈A1‖a‖ provide the promised interpretation of the linear functional's norm ‖φ‖ entirely in terms of its associated affine hyperplane A=φ−1(1) (because with this formula, knowing only the Template:Em A is enough to describe the norm of its associated linear Template:Em). Defining 1∞:=0, the infimum formula ‖φ‖=1infa∈φ−1(1)‖a‖ will also hold when φ=0. When the supremum is taken in ℝ (as is typically assumed), then the supremum of the empty set is sup⁡∅=−∞ but if the supremum is taken in the non-negative reals [0,∞) (which is the image/range of the norm ‖⋅‖ when dim⁡H>0) then this supremum is instead sup⁡∅=0, in which case the supremum formula ‖φ‖=supa∈φ−1(1)1‖a‖ will also hold when φ=0 (although the atypical equality sup⁡∅=0 is usually unexpected and so risks causing confusion).

Constructions of the representing vector

Using the notation from the theorem above, several ways of constructing fφ from φ∈H∗ are now described. If φ=0 then fφ:=0; in other words, f0=0.

This special case of φ=0 is henceforth assumed to be known, which is why some of the constructions given below start by assuming φ≠0.

Orthogonal complement of kernel

If φ≠0 then for any 0≠u∈(ker⁡φ)⊥, fφ:=φ(u)‾u‖u‖2.

If u∈(ker⁡φ)⊥ is a unit vector (meaning ‖u‖=1) then fφ:=φ(u)‾u (this is true even if φ=0 because in this case fφ=φ(u)‾u=0‾u=0). If u is a unit vector satisfying the above condition then the same is true of −u, which is also a unit vector in (ker⁡φ)⊥. However, φ(−u)‾(−u)=φ(u)‾u=fφ so both these vectors result in the same fφ.

Orthogonal projection onto kernel

If x∈H is such that φ(x)≠0 and if xK is the orthogonal projection of x onto ker⁡φ then[proof 1] fφ=‖φ‖2φ(x)(x−xK).

Orthonormal basis

Given an orthonormal basis {ei}i∈I of H and a continuous linear functional φ∈H∗, the vector fφ∈H can be constructed uniquely by fφ=∑i∈Iφ(ei)‾ei where all but at most countably many φ(ei) will be equal to 0 and where the value of fφ does not actually depend on choice of orthonormal basis (that is, using any other orthonormal basis for H will result in the same vector). If y∈H is written as y=∑i∈Iaiei then φ(y)=∑i∈Iφ(ei)ai=⟨fφ|y⟩ and ‖fφ‖2=φ(fφ)=∑i∈Iφ(ei)φ(ei)‾=∑i∈I|φ(ei)|2=‖φ‖2.

If the orthonormal basis {ei}i∈I={ei}i=1∞ is a sequence then this becomes fφ=φ(e1)‾e1+φ(e2)‾e2+⋯ and if y∈H is written as y=∑i∈Iaiei=a1e1+a2e2+⋯ then φ(y)=φ(e1)a1+φ(e2)a2+⋯=⟨fφ|y⟩.

Example in finite dimensions using matrix transformations

Consider the special case of H=ℂn (where n>0 is an integer) with the standard inner product ⟨z∣w⟩:=z→‾Tw→ for all w,z∈H where w and z are represented as column matrices w→:=[w1⋮wn] and z→:=[z1⋮zn] with respect to the standard orthonormal basis e1,…,en on H (here, ei is 1 at its ith coordinate and 0 everywhere else; as usual, H∗ will now be associated with the dual basis) and where z→‾T:=[z1‾,…,zn‾] denotes the conjugate transpose of z→. Let φ∈H∗ be any linear functional and let φ1,…,φn∈ℂ be the unique scalars such that φ(w1,…,wn)=φ1w1+⋯+φnwn for all w:=(w1,…,wn)∈H, where it can be shown that φi=φ(ei) for all i=1,…,n. Then the Riesz representation of φ is the vector fφ:=φ1‾e1+⋯+φn‾en=(φ1‾,…,φn‾)∈H. To see why, identify every vector w=(w1,…,wn) in H with the column matrix w→:=[w1⋮wn] so that fφ is identified with fφ→:=[φ1‾⋮φn‾]=[φ(e1)‾⋮φ(en)‾]. As usual, also identify the linear functional φ with its transformation matrix, which is the row matrix φ→:=[φ1,…,φn] so that fφ→:=φ→‾T and the function φ is the assignment w→↦φ→w→, where the right hand side is matrix multiplication. Then for all w=(w1,…,wn)∈H, φ(w)=φ1w1+⋯+φnwn=[φ1,…,φn][w1⋮wn]=[φ1‾⋮φn‾]‾Tw→=fφ→‾Tw→=⟨fφ∣w⟩, which shows that fφ satisfies the defining condition of the Riesz representation of φ. The bijective antilinear isometry Φ:H→H∗ defined in the corollary to the Riesz representation theorem is the assignment that sends z=(z1,…,zn)∈H to the linear functional Φ(z)∈H∗ on H defined by w=(w1,…,wn)↦⟨z∣w⟩=z1‾w1+⋯+zn‾wn, where under the identification of vectors in H with column matrices and vector in H∗ with row matrices, Φ is just the assignment z→=[z1⋮zn]↦z→‾T=[z1‾,…,zn‾]. As described in the corollary, Φ's inverse Φ−1:H∗→H is the antilinear isometry φ↦fφ, which was just shown above to be: φ↦fφ:=(φ(e1)‾,…,φ(en)‾); where in terms of matrices, Φ−1 is the assignment φ→=[φ1,…,φn]↦φ→‾T=[φ1‾⋮φn‾]. Thus in terms of matrices, each of Φ:H→H∗ and Φ−1:H∗→H is just the operation of conjugate transposition v→↦v→‾T (although between different spaces of matrices: if H is identified with the space of all column (respectively, row) matrices then H∗ is identified with the space of all row (respectively, column matrices).

This example used the standard inner product, which is the map ⟨z∣w⟩:=z→‾Tw→, but if a different inner product is used, such as ⟨z∣w⟩M:=z→‾TMw→ where M is any Hermitian positive-definite matrix, or if a different orthonormal basis is used then the transformation matrices, and thus also the above formulas, will be different.

Relationship with the associated real Hilbert space

Template:See also

Assume that H is a complex Hilbert space with inner product ⟨⋅∣⋅⟩. When the Hilbert space H is reinterpreted as a real Hilbert space then it will be denoted by Hℝ, where the (real) inner-product on Hℝ is the real part of H's inner product; that is: ⟨x,y⟩ℝ:=re⁡⟨x,y⟩.

The norm on Hℝ induced by ⟨⋅,⋅⟩ℝ is equal to the original norm on H and the continuous dual space of Hℝ is the set of all Template:Em-valued bounded ℝ-linear functionals on Hℝ (see the article about the polarization identity for additional details about this relationship). Let ψℝ:=re⁡ψ and ψi:=im⁡ψ denote the real and imaginary parts of a linear functional ψ, so that ψ=re⁡ψ+iim⁡ψ=ψℝ+iψi. The formula expressing a linear functional in terms of its real part is ψ(h)=ψℝ(h)−iψℝ(ih) for h∈H, where ψi(h)=−iψℝ(ih) for all h∈H. It follows that ker⁡ψℝ=ψ−1(iℝ), and that ψ=0 if and only if ψℝ=0. It can also be shown that ‖ψ‖=‖ψℝ‖=‖ψi‖ where ‖ψℝ‖:=sup‖h‖≤1|ψℝ(h)| and ‖ψi‖:=sup‖h‖≤1|ψi(h)| are the usual operator norms. In particular, a linear functional ψ is bounded if and only if its real part ψℝ is bounded.

Representing a functional and its real part

The Riesz representation of a continuous linear function φ on a complex Hilbert space is equal to the Riesz representation of its real part re⁡φ on its associated real Hilbert space.

Explicitly, let φ∈H∗ and as above, let fφ∈H be the Riesz representation of φ obtained in (H,⟨,⋅,⋅⟩), so it is the unique vector that satisfies φ(x)=⟨fφ∣x⟩ for all x∈H. The real part of φ is a continuous real linear functional on Hℝ and so the Riesz representation theorem may be applied to φℝ:=re⁡φ and the associated real Hilbert space (Hℝ,⟨,⋅,⋅⟩ℝ) to produce its Riesz representation, which will be denoted by fφℝ. That is, fφℝ is the unique vector in Hℝ that satisfies φℝ(x)=⟨fφℝ∣x⟩ℝ for all x∈H. The conclusion is fφℝ=fφ. This follows from the main theorem because ker⁡φℝ=φ−1(iℝ) and if x∈H then ⟨fφ∣x⟩ℝ=re⁡⟨fφ∣x⟩=re⁡φ(x)=φℝ(x) and consequently, if m∈ker⁡φℝ then ⟨fφ∣m⟩ℝ=0, which shows that fφ∈(ker⁡φℝ)⊥ℝ. Moreover, φ(fφ)=‖φ‖2 being a real number implies that φℝ(fφ)=re⁡φ(fφ)=‖φ‖2. In other words, in the theorem and constructions above, if H is replaced with its real Hilbert space counterpart Hℝ and if φ is replaced with re⁡φ then fφ=fre⁡φ. This means that vector fφ obtained by using (Hℝ,⟨,⋅,⋅⟩ℝ) and the real linear functional re⁡φ is the equal to the vector obtained by using the origin complex Hilbert space (H,⟨,⋅,⋅⟩) and original complex linear functional φ (with identical norm values as well).

Furthermore, if φ≠0 then fφ is perpendicular to ker⁡φℝ with respect to ⟨⋅,⋅⟩ℝ where the kernel of φ is be a proper subspace of the kernel of its real part φℝ. Assume now that φ≠0. Then fφ∉ker⁡φℝ because φℝ(fφ)=φ(fφ)=‖φ‖2≠0 and ker⁡φ is a proper subset of ker⁡φℝ. The vector subspace ker⁡φ has real codimension 1 in ker⁡φℝ, while ker⁡φℝ has Template:Em codimension 1 in Hℝ, and ⟨fφ,ker⁡φℝ⟩ℝ=0. That is, fφ is perpendicular to ker⁡φℝ with respect to ⟨⋅,⋅⟩ℝ.

Canonical injections into the dual and anti-dual

Induced linear map into anti-dual

The map defined by placing y into the Template:Em coordinate of the inner product and letting the variable h∈H vary over the Template:Em coordinate results in an [[Antilinear map|Template:Em functional]]: ⟨⋅∣y⟩=⟨y,⋅⟩:H→𝔽 defined by h↦⟨h∣y⟩=⟨y,h⟩.

This map is an element of H‾∗, which is the continuous anti-dual space of H. The Template:Em H‾∗Template:Sfn is the [[Linear operator|Template:Em operator]] InHH‾∗:H→H‾∗y↦⟨⋅∣y⟩=⟨y,⋅⟩ which is also an injective isometry.Template:Sfn The Fundamental theorem of Hilbert spaces, which is related to Riesz representation theorem, states that this map is surjective (and thus bijective). Consequently, every antilinear functional on H can be written (uniquely) in this form.Template:Sfn

If Cong⁡:H∗→H‾∗ is the canonical [[Antilinear map|Template:Emlinear]] bijective isometry f↦f‾ that was defined above, then the following equality holds: Cong⁡∘InHH∗=InHH‾∗.

Extending the bra–ket notation to bras and kets

Template:Main

Let (H,⟨⋅,⋅⟩H) be a Hilbert space and as before, let ⟨y|x⟩H:=⟨x,y⟩H. Let Φ:H→H∗g↦⟨g∣⋅⟩H=⟨⋅,g⟩H which is a bijective antilinear isometry that satisfies (Φh)g=⟨h∣g⟩H=⟨g,h⟩H for all g,h∈H.

Bras

Given a vector h∈H, let ⟨h| denote the continuous linear functional Φh; that is, ⟨h|:=Φh so that this functional ⟨h| is defined by g↦⟨h∣g⟩H. This map was denoted by ⟨h∣⋅⟩ earlier in this article.

The assignment h↦⟨h| is just the isometric antilinear isomorphism Φ:H→H∗, which is why ⟨cg+h|=c‾⟨g∣+⟨h| holds for all g,h∈H and all scalars c. The result of plugging some given g∈H into the functional ⟨h| is the scalar ⟨h|g⟩H=⟨g,h⟩H, which may be denoted by ⟨h∣g⟩.[note 4]

Bra of a linear functional

Given a continuous linear functional ψ∈H∗, let ⟨ψ∣ denote the vector Φ−1ψ∈H; that is, ⟨ψ∣:=Φ−1ψ.

The assignment ψ↦⟨ψ∣ is just the isometric antilinear isomorphism Φ−1:H∗→H, which is why ⟨cψ+ϕ∣=c‾⟨ψ∣+⟨ϕ∣ holds for all ϕ,ψ∈H∗ and all scalars c.

The defining condition of the vector ⟨ψ|∈H is the technically correct but unsightly equality ⟨⟨ψ∣∣g⟩H=ψg for all g∈H, which is why the notation ⟨ψ∣g⟩ is used in place of ⟨⟨ψ∣∣g⟩H=⟨g,⟨ψ∣⟩H. With this notation, the defining condition becomes ⟨ψ∣g⟩=ψg for all g∈H.

Kets

For any given vector g∈H, the notation |g⟩ is used to denote g; that is, ∣g⟩:=g.

The assignment g↦|g⟩ is just the identity map IdH:H→H, which is why ∣cg+h⟩=c∣g⟩+∣h⟩ holds for all g,h∈H and all scalars c.

The notation ⟨h∣g⟩ and ⟨ψ∣g⟩ is used in place of ⟨h∣∣g⟩⟩H=⟨∣g⟩,h⟩H and ⟨ψ∣∣g⟩⟩H=⟨g,⟨ψ∣⟩H, respectively. As expected, ⟨ψ∣g⟩=ψg and ⟨h∣g⟩ really is just the scalar ⟨h∣g⟩H=⟨g,h⟩H.

Adjoints and transposes

Let A:H→Z be a continuous linear operator between Hilbert spaces (H,⟨⋅,⋅⟩H) and (Z,⟨⋅,⋅⟩Z). As before, let ⟨y∣x⟩H:=⟨x,y⟩H and ⟨y∣x⟩Z:=⟨x,y⟩Z.

Denote by ΦH:H→H∗g↦⟨g∣⋅⟩H and ΦZ:Z→Z∗y↦⟨y∣⋅⟩Z the usual bijective antilinear isometries that satisfy: (ΦHg)h=⟨g∣h⟩H for all g,h∈H and (ΦZy)z=⟨y∣z⟩Z for all y,z∈Z.

Definition of the adjoint

Template:Main

For every z∈Z, the scalar-valued map ⟨z∣A(⋅)⟩Z[note 5] on H defined by h↦⟨z∣Ah⟩Z=⟨Ah,z⟩Z

is a continuous linear functional on H and so by the Riesz representation theorem, there exists a unique vector in H, denoted by A∗z, such that ⟨z∣A(⋅)⟩Z=⟨A∗z∣⋅⟩H, or equivalently, such that ⟨z∣Ah⟩Z=⟨A∗z∣h⟩H for all h∈H.

The assignment z↦A∗z thus induces a function A∗:Z→H called the Template:Em of A:H→Z whose defining condition is ⟨z∣Ah⟩Z=⟨A∗z∣h⟩H for all h∈H and all z∈Z. The adjoint A∗:Z→H is necessarily a continuous (equivalently, a bounded) linear operator.

If H is finite dimensional with the standard inner product and if M is the transformation matrix of A with respect to the standard orthonormal basis then M's conjugate transpose MT‾ is the transformation matrix of the adjoint A∗.

Adjoints are transposes

Template:Main Template:See also

It is also possible to define the Template:Em or Template:Em of A:H→Z, which is the map tA:Z∗→H∗ defined by sending a continuous linear functionals ψ∈Z∗ to tA(ψ):=ψ∘A, where the composition ψ∘A is always a continuous linear functional on H and it satisfies ‖A‖=‖tA‖ (this is true more generally, when H and Z are merely normed spaces).Template:Sfn So for example, if z∈Z then tA sends the continuous linear functional ⟨z∣⋅⟩Z∈Z∗ (defined on Z by g↦⟨z∣g⟩Z) to the continuous linear functional ⟨z∣A(⋅)⟩Z∈H∗ (defined on H by h↦⟨z∣A(h)⟩Z);[note 5] using bra-ket notation, this can be written as tA⟨z∣=⟨z∣A where the juxtaposition of ⟨z∣ with A on the right hand side denotes function composition: H→AZ→⟨z∣ℂ.

The adjoint A∗:Z→H is actually just to the transpose tA:Z∗→H∗Template:Sfn when the Riesz representation theorem is used to identify Z with Z∗ and H with H∗.

Explicitly, the relationship between the adjoint and transpose is:

Template:NumBlk

which can be rewritten as: A∗=ΦH−1∘tA∘ΦZ and tA=ΦH∘A∗∘ΦZ−1.

Template:Math proof

Alternatively, the value of the left and right hand sides of (Template:EquationNote) at any given z∈Z can be rewritten in terms of the inner products as: (tA∘ΦZ)z=⟨z∣A(⋅)⟩Z and (ΦH∘A∗)z=⟨A∗z∣⋅⟩H so that tA∘ΦZ=ΦH∘A∗ holds if and only if ⟨z∣A(⋅)⟩Z=⟨A∗z∣⋅⟩H holds; but the equality on the right holds by definition of A∗z. The defining condition of A∗z can also be written ⟨z∣A=⟨A∗z∣ if bra-ket notation is used.

Descriptions of self-adjoint, normal, and unitary operators

Assume Z=H and let Φ:=ΦH=ΦZ. Let A:H→H be a continuous (that is, bounded) linear operator.

Whether or not A:H→H is self-adjoint, normal, or unitary depends entirely on whether or not A satisfies certain defining conditions related to its adjoint, which was shown by (Template:EquationNote) to essentially be just the transpose tA:H∗→H∗. Because the transpose of A is a map between continuous linear functionals, these defining conditions can consequently be re-expressed entirely in terms of linear functionals, as the remainder of subsection will now describe in detail. The linear functionals that are involved are the simplest possible continuous linear functionals on H that can be defined entirely in terms of A, the inner product ⟨⋅∣⋅⟩ on H, and some given vector h∈H. Specifically, these are ⟨Ah∣⋅⟩ and ⟨h∣A(⋅)⟩[note 5] where ⟨Ah∣⋅⟩=Φ(Ah)=(Φ∘A)h and ⟨h∣A(⋅)⟩=(tA∘Φ)h.

Self-adjoint operators

Template:See also

A continuous linear operator A:H→H is called self-adjoint if it is equal to its own adjoint; that is, if A=A∗. Using (Template:EquationNote), this happens if and only if: Φ∘A=tA∘Φ where this equality can be rewritten in the following two equivalent forms: A=Φ−1∘tA∘Φ or tA=Φ∘A∘Φ−1.

Unraveling notation and definitions produces the following characterization of self-adjoint operators in terms of the aforementioned continuous linear functionals: A is self-adjoint if and only if for all z∈H, the linear functional ⟨z∣A(⋅)⟩[note 5] is equal to the linear functional ⟨Az∣⋅⟩; that is, if and only if

Template:NumBlk

where if bra-ket notation is used, this is ⟨z∣A=⟨Az∣ for all z∈H.

Normal operators

Template:See also

A continuous linear operator A:H→H is called normal if AA∗=A∗A, which happens if and only if for all z,h∈H, ⟨AA∗z∣h⟩=⟨A∗Az∣h⟩.

Using (Template:EquationNote) and unraveling notation and definitions produces[proof 2] the following characterization of normal operators in terms of inner products of continuous linear functionals: A is a normal operator if and only if

Template:NumBlk where the left hand side is also equal to ⟨Ah∣Az⟩‾H=⟨Az∣Ah⟩H. The left hand side of this characterization involves only linear functionals of the form ⟨Ah∣⋅⟩ while the right hand side involves only linear functions of the form ⟨h∣A(⋅)⟩ (defined as above[note 5]). So in plain English, characterization (Template:EquationNote) says that an operator is normal when the inner product of any two linear functions of the first form is equal to the inner product of their second form (using the same vectors z,h∈H for both forms). In other words, if it happens to be the case (and when A is injective or self-adjoint, it is) that the assignment of linear functionals ⟨Ah∣⋅⟩↦⟨h|A(⋅)⟩ is well-defined (or alternatively, if ⟨h|A(⋅)⟩↦⟨Ah∣⋅⟩ is well-defined) where h ranges over H, then A is a normal operator if and only if this assignment preserves the inner product on H∗.

The fact that every self-adjoint bounded linear operator is normal follows readily by direct substitution of A∗=A into either side of A∗A=AA∗. This same fact also follows immediately from the direct substitution of the equalities (Template:EquationNote) into either side of (Template:EquationNote).

Alternatively, for a complex Hilbert space, the continuous linear operator A is a normal operator if and only if ‖Az‖=‖A∗z‖ for every z∈H,Template:Sfn which happens if and only if ‖Az‖H=‖⟨z|A(⋅)⟩‖H∗ for every z∈H.

Unitary operators

Template:See also

An invertible bounded linear operator A:H→H is said to be unitary if its inverse is its adjoint: A−1=A∗. By using (Template:EquationNote), this is seen to be equivalent to Φ∘A−1=tA∘Φ. Unraveling notation and definitions, it follows that A is unitary if and only if ⟨A−1z∣⋅⟩=⟨z∣A(⋅)⟩ for all z∈H.

The fact that a bounded invertible linear operator A:H→H is unitary if and only if A∗A=IdH (or equivalently, tA∘Φ∘A=Φ) produces another (well-known) characterization: an invertible bounded linear map A is unitary if and only if ⟨Az∣A(⋅)⟩=⟨z∣⋅⟩ for all z∈H.

Because A:H→H is invertible (and so in particular a bijection), this is also true of the transpose tA:H∗→H∗. This fact also allows the vector z∈H in the above characterizations to be replaced with Az or A−1z, thereby producing many more equalities. Similarly, ⋅ can be replaced with A(⋅) or A−1(⋅).

See also

Citations

Template:Reflist

Notes

Template:Reflist

Proofs

Template:Reflist

Bibliography

Template:Functional analysis Template:Hilbert space
Cite error: <ref> tags exist for a group named "note", but no corresponding <references group="note"/> tag was found.
Cite error: <ref> tags exist for a group named "proof", but no corresponding <references group="proof"/> tag was found.