Proving Null Set: Defining and Showing a Set is Null in \mathbb{R}^2

  • Thread starter Thread starter Ted123
  • Start date Start date
  • Tags Tags
    Set
Click For Summary

Homework Help Overview

The discussion revolves around demonstrating that a specific set, defined as \{ (x,y) : x+y=0 \} within \mathbb{R}^2, is a null set. Participants are exploring the definition of null sets and the implications of covering sets with intervals in the context of measure theory.

Discussion Character

  • Exploratory, Assumption checking, Conceptual clarification

Approaches and Questions Raised

  • Participants suggest visualizing the set as an infinite line in \mathbb{R}^2 and consider covering it with rectangles. There are discussions about how to formalize this covering mathematically, including the choice of ε and the dimensions of the rectangles. Questions arise regarding the equivalence of finite segments and the infinite line, as well as the implications of symmetry in proving nullity.

Discussion Status

The conversation is active, with participants providing hints and exploring various approaches to formalizing their arguments. Some participants express uncertainty about the definitions and the implications of their reasoning, while others clarify the relationship between finite segments and the infinite line.

Contextual Notes

Participants are navigating the constraints of homework rules, particularly regarding the use of theorems and definitions in their proofs. There is a focus on ensuring that arguments are grounded in the definitions provided without relying on established results about countable unions of null sets.

Ted123
Messages
428
Reaction score
0

Homework Statement



I'm trying to get to grips with how to show a set is null.

For example, how would I show that the set [tex]\{ (x,y) : x+y=0 \} \subseteq \mathbb{R}^2[/tex] is null using the definition below?

Homework Equations



[itex]A \subseteq \mathbb{R}^k[/itex] is null if, given any [itex]\varepsilon >0[/itex] there exists a countable collection of intervals of [itex]\mathbb{R}^k[/itex], [itex](I_n)_{n\in\mathbb{N}}[/itex] such that [itex]A \subseteq \bigcup_{n\in\mathbb{N}} I_n[/itex] and [itex]\sum_{n\in\mathbb{N}} |I_n| \leq \varepsilon[/itex].

The Attempt at a Solution



How do I start?
 
Last edited:
Physics news on Phys.org
Start by drawing a picture of your set. It's an infinite line in R^2. The I_n will be rectangles in R^2. Now do a warm-up exercise. Take a finite piece of your line. Say 0<=x<=1 and -1<=y<=0 with x+y=0. Can you figure out how to cover that with a finite set of rectangles whose area sums to less than ε?
 
Dick said:
Start by drawing a picture of your set. It's an infinite line in R^2. The I_n will be rectangles in R^2. Now do a warm-up exercise. Take a finite piece of your line. Say 0<=x<=1 and -1<=y<=0 with x+y=0. Can you figure out how to cover that with a finite set of rectangles whose area sums to less than ε?

I can do it with a picture but how do I transform this into maths? Since A is just a line, I can draw a picture showing that you can 'cover' the line with arbitrarily small squares with the top left and bottom right corners touching.
 
Ted123 said:
I can do it with a picture but how do I transform this into maths? Since A is just a line, I can draw a picture showing that you can 'cover' the line with arbitrarily small squares with the top left and bottom right corners touching.

You start formalizing it by saying how small the squares have to be and how many of them there have to be to have a total area less than ε. Pick ε=1/n for n an integer.
 
Last edited:
Dick said:
You start formalizing it by saying how small the squares have to be and how many of them there have to be to have a total area less than ε. Pick ε=1/n for n an integer.

What do you mean 'Pick ε=1/n for n an integer'? Isn't ε arbitrary?
 
Ted123 said:
What do you mean 'Pick ε=1/n for n an integer'? Isn't ε arbitrary?

You can find an integer such that 1/n<ε for any ε. I was just thinking it might be easier to think about integer numbers for the line segment.
 
Dick said:
You can find an integer such that 1/n<ε for any ε. I was just thinking it might be easier to think about integer numbers for the line segment.

If the [itex]I_n[/itex] have side length [itex]\frac{\delta}{n}[/itex] then the sum of all their areas will be [itex]\frac{\delta \pi^2}{6}[/itex]. So for any epsilon if I can choose an appropriate delta. In terms of a picture the squares are getting smaller the further they are from 0.
 
Ted123 said:
If the [itex]I_n[/itex] have side length [itex]\frac{\delta}{n}[/itex] then the sum of all their areas will be [itex]\frac{\delta \pi^2}{6}[/itex]. So for any epsilon if I can choose an appropriate delta. In terms of a picture the squares are getting smaller the further they are from 0.

You've left some parts of the argument out. That looks like something you found online. But if you understand it, that's fine with me.
 
How could I present it similar to this:

21o8pwo.jpg
 
  • #10
Ted123 said:
How could I present it similar to this:

21o8pwo.jpg

I was trying to give you hints to do that. You want to describe how to cover the line segment (t,-t) where 0<=t<=1 with squares in such a way that the sum of the areas of the squares is less than 1/N for an integer N.
 
  • #11
Dick said:
I was trying to give you hints to do that. You want to describe how to cover the line segment (t,-t) where 0<=t<=1 with squares in such a way that the sum of the areas of the squares is less than 1/N for an integer N.

Why does [itex]\{(x,y) : x+y=0\} = \{ (t,-t) : 0 \leq t \leq 1 \}[/itex] ?
 
  • #12
Ted123 said:
Why does [itex]\{(x,y) : x+y=0\} = \{ (t,-t) : 0 \leq t \leq 1 \}[/itex] ?

They aren't equal. The first set is an infinite line, the second set is a finite segment of that line. Once you show the segment is null, it's pretty easy to show the whole line is null.
 
  • #13
Dick said:
They aren't equal. The first set is an infinite line, the second set is a finite segment of that line. Once you show the segment is null, it's pretty easy to show the whole line is null.

Well can't I just put [itex]x=1[/itex] and [itex]y=-1[/itex] into the above and then write [tex]\{(t,-t) : t\in \mathbb{R} \} = \bigcup_{n\in\mathbb{N}} A_n[/tex] where [itex]A_n = \{(t,-t) : t\in [-n,n] \}[/itex].

Each set [itex]A_n[/itex] is null so [itex]\{(t,-t) : t\in \mathbb{R} \}[/itex] is null, being a countable union of null sets.
 
  • #14
Ted123 said:
Well can't I just put [itex]x=1[/itex] and [itex]y=-1[/itex] into the above and then write [tex]\{(t,-t) : t\in \mathbb{R} \} = \bigcup_{n\in\mathbb{N}} A_n[/tex] where [itex]A_n = \{(t,-t) : t\in [-n,n] \}[/itex].

Each set [itex]A_n[/itex] is null so [itex]\{(t,-t) : t\in \mathbb{R} \}[/itex] is null, being a countable union of null sets.

Well, yes. That's pretty much how it goes.
 
  • #15
Dick said:
Well, yes. That's pretty much how it goes.

But if I prove that [itex]\{ (-x,x) : 0 \leq x \leq n \}[/itex] is null then the set [itex]\{ (-x,x) : x \geq 0 \}[/itex] can be written as [itex]\bigcup_{n\in\mathbb{N}} \{ (-x,x) : x \in [0,n] \}[/itex] and each set [itex]\{ (-x,x) : x \in [0,n] \}[/itex] we've proved to be null but what about the other half of the line: I need the set [itex]\{ (-x,x) : x \in \mathbb{R} \}[/itex] to be null.

Or can I just say by symmetry [itex]\{ (-x,x) : -n \leq x \leq 0 \}[/itex] is also null?
 
Last edited:
  • #16
Ted123 said:
But if I prove that [itex]\{ (-x,x) : 0 \leq x \leq n \}[/itex] is null then the set [itex]\{ (-x,x) : x \geq 0 \}[/itex] can be written as [itex]\bigcup_{n\in\mathbb{N}} \{ (-x,x) : x \in [0,n] \}[/itex] and each set [itex]\{ (-x,x) : x \in [0,n] \}[/itex] we've proved to be null but what about the other half of the line: I need the set [itex]\{ (-x,x) : x \in \mathbb{R} \}[/itex] to be null.

Or can I just say by symmetry [itex]\{ (-x,x) : -n \leq x \leq 0 \}[/itex] is also null?

The proof for -n<=x<=0 would go pretty much exactly the same way as for 0<=x<=n. If you don't want to write it out then saying 'by symmetry' should be fine. It is pretty obvious.
 
  • #17
In the argument I posted to show that the set [itex]\{(tx,ty) : 0\leq t \leq n \}[/itex] is null:
21o8pwo.jpg


why is the measure of each interval [tex]I_n = \left [\frac{(j-1)nx}{N} , \frac{jnx}{N} \right] \times \left [\frac{(j-1)ny}{N} , \frac{jny}{N} \right][/tex] given by [tex]|I_n| = \frac{x^2y^2}{N^2} \;?[/tex]
The measure of intervals in [itex]\mathbb{R}^2[/itex] is the product of the measure of the 2 intervals in [itex]\mathbb{R}[/itex] so [itex]|I| = |I_1|\cdot |I_2|[/itex].

The measure of an interval [itex]I=[a,b][/itex] is [itex]|I|=b-a[/itex] so the measure of [tex]I_1= \left [\frac{(j-1)nx}{N} , \frac{jnx}{N} \right][/tex] is [tex]|I_1| = \frac{jnx}{N} - \left(\frac{jnx}{N} -\frac{nx}{N} \right) = \frac{nx}{N}[/tex] and the measure of [tex]I_2= \left [\frac{(j-1)ny}{N} , \frac{jny}{N} \right][/tex] is [tex]|I_2| = \frac{jny}{N} - \left(\frac{jny}{N} -\frac{ny}{N} \right) = \frac{ny}{N}[/tex] so the measure of each [itex]I_n[/itex] is [tex]\frac{nx}{N}\frac{ny}{N} = \frac{n^2xy}{N^2}[/tex] but they have it as [tex]\frac{x^2y^2}{N^2}[/tex]
 
Last edited:
  • #18
They were just being sloppy. Yes, it should be n^2*xy/N^2. It doesn't change the conclusion.
 
  • #19
Dick said:
They were just being sloppy. Yes, it should be n^2*xy/N^2. It doesn't change the conclusion.

Trouble is when I see something like that it makes me think I'm doing something wrong.

Is there a way of showing the set [itex]\{ (t,-t) : t\in\mathbb{R} \}[/itex] is a null set directly from the definition (i.e. without using the result that a countable union of null sets is itself null)? In some questions I've seen it states the bit in italics which makes me think they don't want me to use any theorems for those questions.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
Replies
1
Views
1K
Replies
2
Views
1K
Replies
8
Views
2K