<< Chapter < Page Chapter >> Page >

Proof: Assume that a sequence x n x in ( X , d ) . Fix ϵ > 0 . Since { x n } is convergent, there must exist an n 0 Z + such that d ( x n , x ) < ϵ / 2 for all n n 0 . Now, pick j , k n 0 . Then, using the triangle inequality, we have d ( x j , x k ) d ( x j , x ) + d ( x , x k ) < ϵ / 2 + ϵ / 2 (since both j and k are greater or equal to n 0 ) and so d ( x j , x k ) < ϵ . Therefore, the sequence { x n } is Cauchy.

One may wonder if the opposite is true: is every Cauchy sequence a convergent sequence?

Example 3 Focus on the metric space ( X , d 0 ) with X = ( 0 , 1 ] = { x R : 0 < x 1 } . Now consider the sequence x n = 1 / n in X . This is a Cauchy sequence: one can show this by picking n 0 ( ϵ ) > 2 / ϵ and using the triangle inequality to get

d 0 ( x j , x k ) d 0 ( x j , 0 ) + d 0 ( x k , 0 ) = | x j | + | x k | = 1 j + 1 k 1 n 0 + 1 n 0 = 2 n 0 < 2 2 / ϵ 2 2 / ϵ = ϵ .

However, this is not a convergent sequence: we've shown earlier that x n 0 . Since 0 ( 0 , 1 ] and a sequence has a unique limit, then there is no x ( 0 , 1 ] such that x n x .

Complete metric spaces

Whether Cauchy sequences converge or not underlies the concept of completeness of a space.

Definition 4 A complete metric space is a metric space in which all Cauchy sequences are convergent sequences.

Example 5 The metric space ( X , d 0 ) with X = ( 0 , 1 ] from earlier is not complete, since we found a Cauchy sequence that converges to a point outside of X . We can make it complete by adding the convergence point, i.e., if X ' = [ 0 , 1 ] then ( X ' , d 0 ) is a complete metric space.

Example 6 Let C [ T ] denote the space of all continuous functions with support T . If we pick the metric d 2 ( x , y ) = T | x ( t ) - y ( t ) | 2 d t 1 / 2 , then ( X , d 2 ) is a metric space; however, it is not a complete metric space.

To show that the space is not complete, all we have to do is find a Cauchy sequence of signals within C [ T ] that does not converge to any signal in C [ T ] . For simplicity, fix T = [ - 1 , 1 ] . Fortuitously, we find the sequence illustrated in [link] , which can be written as

x n ( t ) = - 1 if t < - 1 / n , 1 if t > 1 / n , n t if - 1 / n t 1 / n .
Illustration of a convergent sequence { x i } .

Since all these functions are continuous and defined over T , then { x n } is a sequence in C [ T ] . We can show that { x n } is a Cauchy sequence: let n 0 be an integer and pick j k n 0 . Then,

d 2 ( x j , x k ) = - 1 1 | x k ( t ) - x j ( t ) | 2 d t 1 / 2 = - 1 / j 1 / j | x k ( t ) - x j ( t ) | 2 d t 1 / 2 - 1 / j 1 / j 1 2 d t 1 / 2 ( 2 / j ) 1 / 2 2 / n 0 .

So for a given ϵ > 0 , by picking n 0 such that 2 / n 0 < ϵ (say, for example, n 0 > 2 / ϵ 2 ), we will have that d 2 ( x j , x k ) < ϵ for all j , k > n 0 ; thus, the sequence is Cauchy. Now, we must show that the sequence does not converge within C [ T ] : we will find a point x * C [ T ] such that for X ' = C [ T ] { x * } the sequence x n x * in ( X ' , d 2 ) . By inspecting the sequence of signals, we venture the guess

x * ( t ) = - 1 if t < 0 , 1 if t > 0 , 0 if t = 0 . ,

illustrated in [link] .

Initial guess for a convergence point x * for the sequence { x i } .

For this signal, we will have

d 2 ( x n , x * ) = - 1 1 | x n ( t ) - x * ( t ) | 2 d t 1 / 2 = - 1 0 | x n ( t ) - x * ( t ) | 2 d t + 0 1 | x n ( t ) - x * ( t ) | 2 d t 1 / 2 = - 1 / n 0 | n t - ( - 1 ) | 2 d t + 0 1 / n | n t - 1 | 2 d t 1 / 2 = - 1 / n 0 | n t + 1 | 2 d t + 0 1 / n | 1 - n t | 2 d t 1 / 2 = 0 1 / n | 1 - n t | 2 d t + 0 1 / n | 1 - n t | 2 d t 1 / 2 = 2 0 1 / n ( 1 - n t ) 2 d t 1 / 2 = 2 3 n 1 / 2 .

So if we select n 0 such that ( 2 3 n 0 ) 1 / 2 < ϵ , i.e., n 0 > 2 3 ϵ 2 , then we have that d 2 ( x n , x * ) < ϵ for n > n 0 , and so we have shown that x n x * . Now, since a convergent sequence has a unique limit and x * C [ T ] , then { x n } does not converge in ( C [ T ] , d 2 ) and this is not a complete metric space.

The property of equivalence between Cauchy sequences and convergent sequences often compels us to define metric spaces that are complete by choosing the metric appropriate to the signal space. For example, by switching the distance metric to d ( x , y ) = sup t T | x ( t ) - y ( t ) | , the metric space ( C [ T ] , d ) becomes complete.

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