06.01.2015 Views

The Real And Complex Number Systems

The Real And Complex Number Systems

The Real And Complex Number Systems

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

2.19 Show that the following sets are countable:<br />

(a) the set of circles in the complex plane having the ratiional radii and<br />

centers with rational coordinates.<br />

Proof: Write the set of circles in the complex plane having the ratiional<br />

radii and centers with rational coordinates, {C (x n ; q n ) : x n ∈ Q × Q and q n ∈ Q} :=<br />

S. Clearly, S is countable.<br />

(b) any collection of disjoint intervals of positive length.<br />

Proof: Write the collection of disjoint intervals of positive length, {I : I is an interval of positive<br />

S. Use the reason in Exercise 2.21, we have proved that S is countable.<br />

2.20 Let f be a real-valued function defined for every x in the interval<br />

0 ≤ x ≤ 1. Suppose there is a positive number M having the following<br />

property: for every choice of a finite number of points x 1 , x 2 , ..., x n in the<br />

interval 0 ≤ x ≤ 1, the sum<br />

|f (x 1 ) + ... + f (x n )| ≤ M.<br />

Let S be the set of those x in 0 ≤ x ≤ 1 for which f (x) ≠ 0. Prove that S<br />

is countable.<br />

Proof: Let S n = {x ∈ [0, 1] : |f (x)| ≥ 1/n} , then S n is a finite set by<br />

hypothesis. In addition, S = ∪ ∞ n=1S n . So, S is countable.<br />

2.21 Find the fallacy in the following ”proof” that the set of all intervals<br />

of positive length is countable.<br />

Let {x 1 , x 2 , ...} denote the countable set of rational numbers and let I<br />

be any interval of positive length. <strong>The</strong>n I contains infinitely many rational<br />

points x n , but among these there will be one with smallest index n. Define<br />

a function F by means of the eqaution F (I) = n if x n is the rational number<br />

with smallest index in the interval I. This function establishes a one-to-one<br />

correspondence between the set of all intervals and a subset of the positive<br />

integers. Hence, the set of all intervals is countable.<br />

Proof: Note that F is not a one-to-one correspondence between the set<br />

of all intervals and a subset of the positive integers. So, this is not a proof.<br />

In fact, the set of all intervals of positive length is uncountable.<br />

Remark: Compare with Exercise 2.19, and the set of all intervals of<br />

positive length is uncountable is clear by considering {(0, x) : 0 < x < 1} .<br />

16

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!