Is (0,\infty) a Complete Metric Space?

  • Thread starter Thread starter AxiomOfChoice
  • Start date Start date
Click For Summary
SUMMARY

The discussion confirms that the interval (0,∞) is not a complete metric space. A key example provided is the Cauchy sequence x_n = 1/n, which does not converge within this space since 0 is excluded. The participants assert that the completeness of the real numbers (ℝ) implies that unbounded Cauchy sequences cannot exist, as they cannot converge to infinity while remaining Cauchy. A formal proof is presented, demonstrating that if a sequence is unbounded, it cannot satisfy the Cauchy condition.

PREREQUISITES
  • Understanding of Cauchy sequences in metric spaces
  • Knowledge of the completeness property of real numbers (ℝ)
  • Familiarity with the definitions of convergent sequences
  • Basic concepts of metric spaces and their properties
NEXT STEPS
  • Study the properties of Cauchy sequences in various metric spaces
  • Explore the implications of completeness in different mathematical contexts
  • Investigate examples of complete and incomplete metric spaces
  • Learn about the relationship between boundedness and convergence in sequences
USEFUL FOR

Mathematicians, students of real analysis, and anyone interested in the properties of metric spaces and sequence convergence.

AxiomOfChoice
Messages
531
Reaction score
1
I am correct in asserting that (0,\infty) is NOT complete, right? It seems the sequence x_n = 1/n is a Cauchy sequence that does not converge in this metric space (in the standard Euclidean metric), since 0 is not in the space.

Also, doesn't it follow from the completeness of \mathbb R that it's NOT possible to construct an unbounded Cauchy sequence (i.e., a sequence of real numbers that converges to \infty but whose terms get closer and closer together)? Is there a way to prove this without appealing to the fact that the reals are complete?
 
Last edited:
Physics news on Phys.org
Let xn=Σ(k=1,n) 1/k. |xn-xn+1|-> 0.
However |xn-xm| may -> ∞ as |n-m| -> ∞.

So you need to be precise as to what you are referring to. If it is to the usual idea of a Cauchy sequence (n and m independent) then it is not possible, since fixing n and letting m increase will lead to the second part of the example.
 
AxiomOfChoice said:
Also, doesn't it follow from the completeness of \mathbb R that it's NOT possible to construct an unbounded Cauchy sequence (i.e., a sequence of real numbers that converges to \infty but whose terms get closer and closer together)?
Of course it does. Since R is complete, Cauchy sequences and convergent sequences are the same thing. An unbounded sequence is not convergent, hence not Cauchy.
Is there a way to prove this without appealing to the fact that the reals are complete?
I'm not following you. You want to prove that completeness of R implies something, without using the completeness of R?
 
Landau said:
Of course it does. Since R is complete, Cauchy sequences and convergent sequences are the same thing. An unbounded sequence is not convergent, hence not Cauchy.
Ok, that's nice. Thanks.

Landau said:
I'm not following you. You want to prove that completeness of R implies something, without using the completeness of R?
Certainly not! I'm asking for a proof of the fact that if \{x_n\} is Cauchy, then \{x_n\} cannot trail off to infinity, without simply invoking the completeness of \mathbb R (in which case it's trivial, as you pointed out above)...is there a proof that proceeds directly from the definition of Cauchy?
 
AxiomOfChoice said:
I'm asking for a proof of the fact that if \{x_n\} is Cauchy, then \{x_n\} cannot trail off to infinity, without simply invoking the completeness of \mathbb R (in which case it's trivial, as you pointed out above)...is there a proof that proceeds directly from the definition of Cauchy?
Yes, see mathman's last remark. Here is a formal proof:

Suppose (x_n)_n is unbounded. Let's prove that it is not Cauchy: for all N there exists m,n>N such that |x_n-x_m|>1 (this is the negation of the definition of Cauchy sequence, with epsilon=1).

Let N be arbitrary. Take some m>N. Now take n large enough so that |x_n|>|x_m|+1 (possible by unboundedness). Then

|x_n-x_m|\geq||x_n|-|x_m||>1.
 
A subspace of a complete metric space is complete if and only if it is closed.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 24 ·
Replies
24
Views
6K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 18 ·
Replies
18
Views
3K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K