Lindelof covering theorem: countable subcollection from uncountable set

  • Level: Undergrad 
  • Thread starter Math Amateur
  • Start date
  • Tags Tags
    Apostol Theorem
2 replies · 4K views · last reply
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:
Printed text of Theorem 3.28 (Lindelöf covering theorem): if A is a subset of R^n and F is an open covering of A, then some countable subcollection of F also covers A. Followed by a proof beginning with G = {A1, A2, ...}, the countable collection of n-balls with rational centers and rational radii.

Printed proof text from a real analysis textbook: the argument that a countable subcollection of an open cover F covers A, by choosing one n-ball A_m(x) for each point x of A.


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:
Printed textbook page, section 3.10 The Lindelöf Covering Theorem, with Definition 3.26 of a covering (F covers S if S is a subset of the union of the sets A in F) and two examples of coverings of intervals and the real line.

Printed textbook page showing Theorem 3.27 on the Lindelöf covering theorem, its proof using rational n-balls, and Figure 3.2 with nested balls B(y; q) and B(x; r) in R^2.


Hope that helps ...

Peter
 
Last edited:
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