<< Chapter < Page
  Signal theory   Page 1 / 1
Chapter >> Page >
Definition and properties of an adjoint operator between normed spaces

Adjoint operators allow us to translate inner products in the destination space to inner products in the source space.

Definition 1 Let X and Y be inner product spaces and A B ( X , Y ) . The adjoint operator A * : Y X is defined by the equation A x , y Y = x , A * y X for all x X , y Y .

The subindices in the inner product notation clarify the inner product space we refer to, but it is often implicit from the inputs.

Example 1 Pick X = R n , Y = R n , and define the operator A B ( X , Y ) by an m × n matrix; we want to find its adjoint A * . We appeal to the definition:

A x , y Y = y T ( A x ) = y T A x = ( y T A ) x = ( A T y ) T x = x , A T y X

so according to the definition, we have that A * y = A T y , resulting in A * = A T .

Theorem 1 If A B ( X , Y ) then the adjoint operator A * B ( Y , X ) and A * = A .

To see A * is linear, note that

x , A * ( a 1 y 1 + a 2 y 2 ) = A x , a 1 y 1 + a 2 y 2 = a 1 ¯ A x , y 1 + a 2 ¯ A x , y 2 = a 1 ¯ x , A * y 1 + a 2 ¯ x , A * y 2 , = x , a 1 A * y 1 + a 2 A * y 2 ,

so A * ( a 1 y 1 + a 2 y 2 ) = a 1 A * y 1 + a 2 A * y 2 . We will next show that A * A and A A * , which implies that A * = A . First, note that

A * x 2 x 2 = A * x , A * x x 2 = A A * x , x x 2 A A * x x x 2 A A * x x A A * x x , A A * ;

since this is true for all x X , A * 2 A A * , and so A * A .

Next, pick x 0 N ( A ) and set y 0 = A x 0 A x 0 . Note that if N ( A ) = X , then A x = 0 for all x and the adjoint A * y = 0 for all y satisfies the theorem. For such a choice of x 0 and y 0 , we note that

A x 0 2 = A x 0 , A x 0 = A x 0 , A x 0 y 0 = A x 0 A x 0 , y 0 = A x 0 x 0 , A * y 0 , A x 0 x 0 A * y 0 A x 0 x 0 A * y 0 = A x 0 x 0 A * ,

so A x 0 x 0 A * , and A x 0 x 0 A * ; thus, A A * . Therefore, A = A * .

Fact 1 Some quick facts on adjoint operators:

  1. I * = I .
  2. ( A 1 + A 2 ) * = A 1 * + A 2 * .
  3. ( α A ) * = α A * .
  4. ( A 1 A 2 ) * = A 2 * A 1 * .
  5. If A - 1 exists, then ( A - 1 ) * = ( A * ) - 1 .

Definition 2 An operator A B ( X , X ) is said to be self-adjoint if A * = A .

Definition 3 Let X be a Hilbert space. A self-adjoint linear operator A B ( X , X ) is said to be positive semidefinite if x , A x 0 for all x X .

Example 2 Let X = L 2 [ 0 , 1 ] and define an operator A B ( X , X ) by

y ( t ) = A ( x ( t ) ) = 0 1 K ( t , s ) x ( s ) d s , t [ 0 , 1 ] ,

where 0 1 0 1 | K ( t , s ) | 2 d s d t < . What is its adjoint A * ?

To find the adjoint, we use its definition A x , w = x , A * w :

A x , w = 0 1 ( A x ) ( t ) w ( t ) d t = 0 1 0 1 K ( t , s ) x ( s ) d s w ( t ) d t = 0 1 0 1 K ( t , s ) x ( s ) w ( t ) d t d s , = 0 1 x ( s ) 0 1 K ( t , s ) w ( t ) d t d s = x , v ,

where v ( s ) = ( A * w ) ( s ) = 0 1 K ( t , s ) w ( t ) d t ; changing variables, ( A * w ) ( t ) = 0 1 K ( s , t ) w ( s ) d s .

Example 3 Let X = L 2 [ 0 , 1 ] and define an operator A B ( X , X ) by

y ( t ) = ( A x ) ( t ) = 0 t K ( t , s ) x ( s ) d s .

What is its adjoint A * ? Once again, from the definition,

A x , w = 0 1 ( A x ) ( t ) w ( t ) d t = 0 1 0 t K ( t , s ) x ( s ) d s w ( t ) d t = 0 1 0 t K ( t , s ) x ( s ) w ( t ) d s d t , = 0 1 s 1 K ( t , s ) x ( s ) w ( t ) d t d s = 0 1 x ( s ) s 1 K ( t , s ) w ( t ) d t d s .

We have that ( A * w ) ( s ) = s 1 K ( t , s ) w ( t ) d t ; changing variables, we obtain the adjoint ( A * w ) ( t ) = t 1 K ( s , t ) w ( s ) d s .

Example 4 Let X = L 2 [ 0 , 1 ] , Y = R N , and define the operator A B ( X , Y ) as

y = A ( x ) = x ( t 1 ) x ( t 2 ) x ( t n ) .

What is its adjoint A * ? Once again, from the definition of adjoint,

A x , w Y = x , A * w X ,

where the subscript denotes the corresponding space for the sake of clarity. Then,

A x , w Y = [ x ( t 1 ) x ( t 2 ) ... x ( t n ) ] T , w Y = i = 1 N x ( t i ) w i , x , A * w X = 0 1 x ( t ) ( A * w ) ( t ) d t = 0 1 x ( t ) v ( t ) d t ,

where v ( t ) = ( A * w ) ( t ) . We can successfully match these two inner products by using delta functions to define v . Recall the properties of delta functions: ( i ) x ( t ) δ ( t - t 0 ) = x ( t 0 ) δ ( t - t 0 ) , ( i i ) 0 1 δ ( t - t 0 ) d t = 1 . Therefore, we may set v ( t ) = i = 1 N w i δ ( t - t i ) , which then provides

x , v X = 0 1 x ( t ) i = 1 N w i δ ( t - t i ) d t = i = 1 N 0 1 x ( t ) w i δ ( t - t i ) d t ) = i = 1 N w i 0 1 x ( t i ) δ ( t - t i ) d t = i = 1 N w i x ( t i ) ( 0 1 δ ( t - t i ) d t ) = i = 1 N w i x ( t i ) .

This confirms that v ( t ) = A * w ( t ) = i = 1 N w i δ ( t - t i ) .

Theorem 2 Let X , Y be normed spaces and A B ( X , Y ) , then ( R ( A ) ) = N ( A * ) .

We will show the double inclusion ( R ( A ) ) N ( A * ) and N ( A * ) ( R ( A ) ) . Let y N ( A * ) , i.e., A * y = 0 . Then for all x X , we have

x , A * y = 0 = A x , y

and so y ( R ( A ) ) , which implies that N ( A * ) ( R ( A ) ) . Now, pick y ( R ( A ) ) , i.e., for all x X we have that A x , y = 0 . Then, x , A * y = 0 , and since this is true for all x X , then A * y = 0 and y N ( A * ) . Therefore, ( R ( A ) ) N ( A * ) . The two inclusions imply that ( R ( A ) ) = N ( A * ) . The following statements can be proved in a similar fashion.

Theorem 3 Let X , Y be normed spaces and A B ( X , Y ) , then

  1. R ( A ) ¯ = [ N ( A * ) ]
  2. [ R ( A * ) ] = N ( A )
  3. R ( A * ) ¯ = [ N ( A ) ]

Example 5 Let A = 2 1 0 2 2 3 , then R ( A ) = span 1 0 1 , 1 2 3 , A * = 2 0 2 1 2 3 , and N ( A * ) = span - 1 - 1 1 . It is easy to check that ( R ( A ) ) = N ( A * ) .

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Signal theory. OpenStax CNX. Oct 18, 2013 Download for free at http://legacy.cnx.org/content/col11542/1.3
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Signal theory' conversation and receive update notifications?

Ask