<< Chapter < Page
  Signal theory   Page 1 / 1
Chapter >> Page >
Formulation of the ell_2 space

Definition 1 We define the 2 space of infinite sequences of finite energy as

2 = { ( x 1 , x 2 , x 3 , ... ) R such that i = 1 | x i | 2 < } .

On this space, define the inner product x , y = i = 1 x i y i ¯ , and obtain the induced norm x 2 = i = 1 | x i | 2 , which we term the 2 norm.

Here R refers to the set of all infinite sequences of real values. Note that this implies that the sequence | x i | must converge to zero as i . Note also can then say that the 2 space consists of all infinite sequences with finite 2 norm.

Theorem 1 The 2 space is a Hilbert space.

To prove this theorem, we need the following lemma.

Lemma 1 A Cauchy sequence in a normed space is bounded.

Proof of Lemma 1: Let { x n } be a Cauchy sequence and let n 0 be an integer such that x n - x n 0 < 1 for n > n 0 . For n > N , we have x n = x n - x n 0 + x n 0 x n - x n 0 + x n 0 1 + x n 0 . Now set M = max 1 n n 0 x n + 1 . Then, x n < M for all n = 1 , 2 , 3 , ... .

Proof of Theorem 1: We show that 2 is complete by proving that all Cauchy sequences converge in 2 . Assume that x ( n ) is a Cauchy sequence in 2 . Then, if x ( n ) = x 1 ( n ) , x 2 ( n ) , ... , we have that there exists some n 0 such that if j , k > n 0 , then for each a = 1 , 2 , ... ,

x a ( j ) - x a ( k ) i = 1 x i ( j ) - x i ( k ) 2 = x ( j ) - x ( k ) < ϵ .

Therefore, each sequence x a ( n ) for each a = 1 , 2 , is a Cauchy sequence in the space ( C , d 0 ) , which is complete. Thus, each sequence x a ( n ) must converge in C to some value x a * .

Define x * = ( x 1 * , x 2 * , ... ) . We show that x * 2 . According to Lemma 1, the sequence { x n } is bounded by some constant M . For each pair a , k = 1 , 2 , ... , we have

i = 1 k x a ( n ) 2 x ( n ) 2 2 M 2 .

This inequality is valid for each value of n , and so we must have

i = 1 k x a * 2 M 2 .

Additionally, his inequality is valid for each value of k , and so we must have

i = 1 x a * 2 M 2 .

Thus, we have shown that x * 2 . The last point we need to show is that x ( n ) x * . First, since the sequence x ( n ) is Cauchy, we have that there exists an n 0 such that if j , k n 0 and for each l = 1 , 2 , ... , we have

i = 1 l x i ( j ) - x i ( k ) 2 x ( j ) - x ( k ) 2 2 ϵ 4 .

Observe also that for each i there exists n 0 , i such that if k n 0 , i , then x i ( k ) - x i * < 2 - i ϵ 4 ; therefore, if k max n 0 , sup i n 0 , i , we have

i = 1 l x i ( j ) - x i * 2 2 i = 1 l x i ( j ) - x i ( k ) 2 + x i ( k ) - x i * 2 2 i = 1 l x i ( j ) - x i ( k ) 2 + i = 1 l x i ( k ) - x i * 2 < 2 ϵ 4 + ϵ 4 i = 1 l 2 - i 2 ϵ 4 + ϵ 4 = ϵ ,

where the first inequality come from the fact that | a + b | 2 2 ( | a | 2 + | b | 2 ) , which is easy to check. Since this is true for each l = 1 , 2 , ... , then it follows that if j n 0 * : = max n 0 , sup i n 0 , i , then

x ( j ) - x * = i = 1 x i ( j ) - x i * 2 < ϵ .

This shows that x ( n ) x * .

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