Lindelof Covering Theorem .... Apostol, Theorem 3.28 ....

  • Context: Undergrad 
  • Thread starter Thread starter Math Amateur
  • Start date Start date
  • Tags Tags
    Apostol Theorem
Click For Summary
SUMMARY

The discussion centers on Theorem 3.28, the Lindelof Covering Theorem, from Tom M. Apostol's "Mathematical Analysis" (Second Edition). Participants clarify that the theorem holds true even when the set A is uncountably infinite, as the collection of n-balls A_{m(x)} remains countable. The proof demonstrates that any subset of a countable set G is also countable, thus supporting the theorem's validity in this context. The conversation emphasizes the importance of understanding the mapping from real numbers to rationals in this scenario.

PREREQUISITES
  • Understanding of point set topology concepts
  • Familiarity with the Lindelof Covering Theorem
  • Knowledge of countable vs. uncountable sets
  • Basic principles of set theory and mappings
NEXT STEPS
  • Study the proof of the Lindelof Covering Theorem in detail
  • Explore the implications of countable and uncountable sets in topology
  • Learn about mappings from real numbers to rational numbers
  • Investigate related theorems in point set topology for deeper insights
USEFUL FOR

Mathematicians, students of analysis, and anyone studying point set topology will benefit from this discussion, particularly those seeking clarity on the Lindelof Covering Theorem and its applications in uncountable sets.

Math Amateur
Gold Member
MHB
Messages
3,920
Reaction score
48
TL;DR
I need help in order to fully understand Tom M. Apostol's proof of the Lindelof Covering Theorem ...
I am reading Tom M Apostol's book "Mathematical Analysis" (Second Edition) ...

I am focused on Chapter 3: Elements of Point Set Topology ... ...

I need help in order to fully understand Theorem 3.28 (Lindelof Covering Theorem ... ) .Theorem 3.28 (including its proof) reads as follows:
Apostol - 1- Theorem 3.28 ... PART 1 ... .png

Apostol - 2 - Theorem 3.28 ... PART 2 ... .png


In the above proof by Apostol we read the following:

" ... ... The set of all ##n##-balls ##A_{ m(x) }## obtained as ##x## varies over all elements of ##A## is a countable collection of open sets which covers ##A## ... ..."
My question is as follows:

What happens when ##A## is an uncountably infinite set ... how does the set of all ##n##-balls ##A_{ m(x) }## remain as a countable collection of open sets which covers ##A## ... when ##x## ranges over an uncountable set ... ...? ... ...My thoughts are as follows: ... ... the sets ##A_{ m(x) }## must be used/repeated many times ... indeed in many cases infinitely many times ... is that correct?

Help will be much appreciated ...

Peter=====================================================================================The above post refers to Theorem 3.27 ... so I am providing text of the same ... as follows:
Apostol - 1- Theorem 3.27 ... PART 1 ... .png

Apostol - 2- Theorem 3.27 ... PART 2 ... .png


Hope that helps ...

Peter
 
Last edited:
Physics news on Phys.org
The balls ##A_{m(x)}## form a subset of ##G##. G is countable, and thus since any subset of ##G## is countable, the result follows.

There is nothing in this proof that says that A isn't uncountable. The proof also works in this case.

Ps: Apostol is a great book. Good choice!
 
Last edited by a moderator:
  • Like
Likes   Reactions: Math Amateur and PeroK
Math Amateur said:
What happens when ##A## is an uncountably infinite set ... how does the set of all ##n##-balls ##A_{ m(x) }## remain as a countable collection of open sets which covers ##A## ... when ##x## ranges over an uncountable set ... ...? ... ...My thoughts are as follows: ... ... the sets ##A_{ m(x) }## must be used/repeated many times ... indeed in many cases infinitely many times ... is that correct?

Yes. A simpler way to look at it is as follows. Suppose for every real number ##x## we choose a rational ##r(x)##. Effectively this is a mapping from ##\mathbb{R}## to ##\mathbb{Q}##.

The range of this function, i.e. the set of all rationals we chose, is clearly a subset of ##\mathbb{Q}##, hence countable.

Corollary (your thought): there exists at least one rational ##r## that was chosen for an uncountably infinitely many ##x##'s.
 
  • Like
Likes   Reactions: member 587159

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
3K