Can two disjoint sets have equal measure on any interval in a given interval?

Click For Summary

Discussion Overview

The discussion revolves around the question of whether two disjoint sets can be constructed such that they are dense in a given interval and have equal measure on any subinterval of that interval. The context includes theoretical considerations and mathematical reasoning related to measure theory.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant proposes a construction of two disjoint sets A and B that are dense in [0,1] and questions if their measures can be equal on any interval.
  • Another participant suggests specific sets A and B based on rational numbers, noting that these sets are disjoint and dense but have measure 0, which does not satisfy the requirement for positive measure.
  • A different construction is presented using intervals to define sets A_n and B_n, with the intention of showing that they are disjoint and dense, but later it is revealed that the measure of A is 0.
  • Another participant describes a method of constructing sets A and B by selecting distinct points from subdivided intervals, suggesting that this process could yield the desired properties.
  • Some participants express the view that the sets being discussed may be null sets, particularly in the context of countable sets, which raises questions about the initial conditions of the problem.
  • There is a clarification that the sets must have positive measure, which some participants argue makes the problem trivial when only countable sets are considered.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the existence of two disjoint sets with the desired properties. There are multiple competing views and constructions presented, with some participants asserting that the sets discussed are null sets, while others attempt to construct sets that meet the criteria of being dense and having equal positive measure.

Contextual Notes

The discussion includes limitations regarding the definitions of the sets and the implications of countability on measure. There is also uncertainty about the conditions under which the sets can be considered to have positive measure.

dimitri151
Messages
117
Reaction score
3
I saw this problem on this site a while back and started to think about it. I can't find the post so I'll start it anew. The problem is: can you have two disjoint sets dense on an interval so that the measure of each set on any interval of that interval is equal? That is, say you have A, B in [0,1] A(intersection),B=emptyset, are there such sets A and B so that if you take x<y, x,y in [0,1], m(A(intersection)[x,y])=m(B(intersection)[x,y])?

If you let An={x in [0,1] : x's binary expansion has a zero in the nth place }, then you can show that for any epsilon there is a pos integer N such that m(An(intersection)[x,y])-m(~An(intersection)[x,y])<epsilon when n>=N.
However this isn't equality. Furthermore what I'd really like to say is the required set A is limn->infinityAn. Only, I'm not sure what {x in [0,1] : x's binary expansion has a zero in the infinitieth place} means. That doesn't mean anything. So how does one proceed?
 
Physics news on Phys.org
Let A = the set of rationals on the form k/2^n in (0,1) where k, n are integers, and B the set of k/3^n in (0,1). These sets are disjoint and both are dense in [0,1]. Being countable, each have measure 0 on any interval.
 
Last edited:
Oops, I forgot to add that the sets had to be of positive measure.
 
Ok, what about this:

A_n = [0,\frac{1}{2^n}) \cup [\frac{2}{2^n},\frac{3}{2^n}) \cup ... \cup [\frac{2^n-2}{2^n},\frac{2^n-1}{2^n})

B_n = [0,1)-A_n

Let A = \liminf_n A_n = \cup_I \cap_{n \in I} A_n over cofinite subsets I in \mathbb{Z}^+, and B = \liminf_n B_n

If x is in A \cap B, x is in cofinitely many A_n's and cofinitely many B_n's, hence in some A_n \cap B_n which is impossible, so they are disjoint.

It is clear that any dyadic number 0 \leq \frac{k}{2^n} &lt;1 is in A, since \frac{2 k 2^{N-1-n}}{2^N} \leq (=) \frac{k}{2^n} &lt; \frac{2 k 2^{N-1-n}+1}{2^N} for all N \geq n+1. Hence A is dense.

Consider \overline{B} = \overline{\cup_I \cap_{n \in I} B_n} \supseteq \cup_I \overline{\cap_{n \in I} B_n} = \cup_I \cap_{n \in I} \overline{B_n}.

\overline{B_n} = [\frac{1}{2^n},\frac{2}{2^n}] \cup [\frac{3}{2^n},\frac{4}{2^n}] \cup ... \cup [\frac{2^n-1}{2^n},1]

A dyadic number 0&lt;\frac{k}{2^n} \leq 1 is in \overline{B}, since \frac{2 k 2^{N-1-n}-1}{2^N} \leq \frac{k}{2^n} \leq (=) \frac{2 k 2^{N-1-n}}{2^N} for all N \geq n+1, so B is also dense (since \overline{B} is dense).

I think these sets will have positive and equal measure, I will come back to that later. Hope this helps anyway.

EDIT: I calculated the measure of A, it is 0, oh well..
 
Last edited:
Pick two distinct points p and q in [0,1] and let A = {p} and B = {q}. Cut the interval in half, to get [0,1/2] and [1/2,1] and choose a pair of distinct points from each ({a,b} and {c,d} say). Throw into A one point from each interval (say a and c), and do the same for B (b and d). Repeat this process ad infinitum: at stage n you are selecting 2^n points from 2^n-1 intervals and adjoining a selected point from each interval to A, and throwing the rest in B. Always choose distinct points; this is possible because at each stage there are only a finite number of points to avoid, whereas each interval you are selecting from has an infinite number of points. When 'done', the sets A and B so obtained should be what you are looking for.
 
I think those sets are null sets.
 
dimitri151 said:
I think those sets are null sets.

Of course, since they are countable. But you didn't say they had to have positive measure...
 
I added the condition in a subsequent post. Solution of the conditions with countable sets is almost trivial.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K