Show L is Countable - Set of Continuities

  • Thread starter student12s
  • Start date
  • Tags
    Set
In summary, the conversation discusses the proof that the set of points where a function is right-continuous but not left-continuous is countable. The method involves counting subsets of these points based on their epsilon values, and using a lemma to show that each subset is countable. It is also shown that the countable union of countable sets is countable, which proves that the set of points is countable.
  • #1
student12s
9
0
I've been trying to answer the following question:
Let f be an arbitrary function of $(-\infty,+\infty)$ and let L be the set of point where f is right-continuous but not left-continuous. Show that L is countable.
Any help?
 
Physics news on Phys.org
  • #2
Start with the definitions... if f is right continuous at p, that means that for any e>0, there is a d>0 such that at every point q in the interval (p,p+d), |f(p)-f(q)| < e.

Conversely, if f is not left continuous at a point p, that means that there exists an e>0 such that there is no d>0 such that at every point q in (p-d,p), |f(p)-f(q)| < e. At each point p, pick some e=e(p) that works for the definition of left continuous at that p. (choose e(p) = 0 if p is not in L, for convenience)

Now, here is a method you can count L by: first count {p in L : e(p) > 1}. Then count {p in L : e(p) > 1/2}. Then count {p in L : e(p) > 1/4}. And so forth. L is the union of these sets, and the countable union of countable sets is itself countable, so this gives a way to count L.

To show that this works, you first need to show that for any k>0, {p in L : e(p) > k} is countable. You can do this by first proving a lemma that at each such p, there is some f>0 such that for every point q in the interval (p, p + f), e(q) <= k. (Prove it by contradiction using the definition of right continuous). Now all you have to do is show that the lemma implies {p in L : e(p) > k} is countable, which shouldn't be too hard (just devise some way to count a bunch of isolated points).
 
Last edited:
  • #3
Thank you very much. Given your guidance, I think I managed to prove the claim.

Let p be the set of point of f where f is right-continuous but not left-continuous and let p be an element of L.

Since f is not left-continuous in p, there is \epsilon(p)>0 such that, for all \delta>0, there is q \in (p-\delta,p) such that |f(p)-f(q)|>\epsilon(p).

Now define M_n = \{p \in L: \epsilon(p)>\frac{1}{n}\}. If we show that M_n is countable then we are done since L=\cup_n M_n.

Now we use your lemma. For any p \in M_n there is a k(p) such that if m in (p,p+k), \epsilon(m)<1/n

Suppose this is not true. Then f is not right-continuous, since for any k, there exists m,n s.t. p
< n < m \leq p+k and |f(m)-f(n)|>1/n. Since k is arbitrary, f(p) is not right-continuous.

Finally, note that we can pick k so that p+k is rational. So there is a one-to-one mapping between points p in M_n and p+k(p) in a subset of the rational numbers, showing that M_n is countable. Since the countable union of countable sets is also countable, L is countable.
 
  • #4
I just realized I botched the definitions in my last post. Fixed in the edit
student12s said:
Now we use your lemma. For any p \in M_n there is a k(p) such that if m in (p,p+k), \epsilon(m)<1/n

Suppose this is not true. Then f is not right-continuous, since for any k, there exists m,n s.t. p
< n < m \leq p+k and |f(m)-f(n)|>1/n. Since k is arbitrary, f(p) is not right-continuous.
You could use some more detail here. (Also, you used n twice). It would go more like this:

Suppose the lemma is not true. Then there is some p in M_n such that for any k, there is an m in (p,p+k) where e(m) >= 1/n. Now since p is right-continuous, for any e' there is a d such that if q is in (p,p+d) then |f(p)-f(q)| < e'. Choose e'=1/(2n), and k=d. Using the fact that e(m) >= 1/n, that means we can pick any d' and there will be a point q' in (m-d',m) where |f(m)-f(q')| > e(m) >= 1/n. Choose d' so that p < p+d' < m, which means q' is in (p,p+d). Summarizing the situation, we have:
|f(p)-f(q')| < 1/(2n)
|f(p)-f(m)| < 1/(2n)
|f(m)-f(q')| >= 1/n
You can show there's a contradiction with these three inequalities.

Finally, note that we can pick k so that p+k is rational. So there is a one-to-one mapping between points p in M_n and p+k(p) in a subset of the rational numbers, showing that M_n is countable. Since the countable union of countable sets is also countable, L is countable.
Heh, nice.
 
Last edited:
  • #5
Yes, the triangular inequality yields the contradiction. thanks
 

Related to Show L is Countable - Set of Continuities

1. What does it mean for a set to be countable?

For a set to be countable means that the elements in the set can be counted or put in a one-to-one correspondence with the natural numbers (1, 2, 3, ...). In other words, there exists a way to list all the elements in the set without skipping any and without repeating any.

2. How do you prove that a set is countable?

There are different ways to prove that a set is countable. One way is to show that the elements in the set can be put in a one-to-one correspondence with the natural numbers. Another way is to show that the set can be listed in a sequence without skipping or repeating any elements.

3. What is the set of continuities?

The set of continuities, denoted by L, is a set that contains all the real numbers between 0 and 1. These numbers are called continuities because they represent the decimal expansions of real numbers that are between 0 and 1, without any 'holes' or 'gaps' in between.

4. How do you show that the set L is countable?

To show that the set L is countable, we can use the Cantor's diagonal argument. This involves listing the elements in L in a sequence and then constructing a new number that is not in the list. This new number will be a decimal expansion that is different from all the other decimal expansions in the list, proving that the list is incomplete and thus, L is uncountable.

5. Why is proving that the set L is countable important in mathematics?

Proving that the set L is countable has important implications in mathematics, particularly in the field of real analysis. It helps us understand the nature of real numbers and their decimal expansions. It also allows us to make important distinctions between countable and uncountable sets, and between finite and infinite sets. Furthermore, many mathematical theorems and proofs rely on the concept of countability, making it an essential tool in the study of mathematics.

Similar threads

  • Set Theory, Logic, Probability, Statistics
Replies
3
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
11
Views
2K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Calculus and Beyond Homework Help
Replies
1
Views
552
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
3K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
2
Views
771
  • Set Theory, Logic, Probability, Statistics
Replies
4
Views
1K
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
2K
Back
Top