Can <1=1 < 1 = 1 ?

Does there exists intervals I1,I2, I_1, I_2, \ldots , each of which are subintervals of [0,1] [ 0,1] , such that
1. the total length of these subintervals is strictly less than 1.
2. For each rational number r[0,1] r \in [0,1] , there exists a jj such that rIj r \in I_j .

#Calculus

Note by Calvin Lin
6 years, 10 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

We can write the set of rational numbers in [0,1][0,1] as {m/n:0mn,n1}\{m/n : 0\leq m \leq n, n \geq 1\}. Now exclude the point 11 from all these sets and enclose each rational point with denominator nn by a sub interval of length 3n3^{-n}, lying completely in [0,1][0,1] (e.g. enclose the point m/nm/n by the sub-interval [m/n,m/n+3n][m/n, m/n + 3^{-n}]). The total length of all these sub-intervals is n=1n3n=34\sum_{n=1}^{\infty} n3^{-n}=\frac{3}{4}. Finally enclose the point 11 by the sub-interval [9/10,1][9/10,1]. Hence all rational points are enclosed and total length of the sub-intervals = 3/4+1/10<13/4+1/10 <1.

Abhishek Sinha - 6 years, 10 months ago

Log in to reply

This was really good.

A Former Brilliant Member - 6 years, 10 months ago

Quick note that the total length is less than 17/2017/20 because of overlapping intervals.

Jonathan Wong - 6 years, 10 months ago

Indeed, the rationals are measure-zero and countable (despite being dense in R\mathbb{R}); they are a null set. The total length of the required subintervals can be any ϵ>0\epsilon > 0.

Jonathan Wong - 6 years, 10 months ago

Log in to reply

That does not prove existence of sub intervals of the required properties.

Abhishek Sinha - 6 years, 10 months ago

Log in to reply

The proof of my initial statement eludes me. A proof that the total length is less than ϵ\epsilon for any ϵ>0\epsilon>0 is much easier (order the rationals and construct intervals around them with lengths of the terms of a converging infinite geometric series of your choice).

If anyone is able to prove my original statement (especially constructively), by all means, post it here. The "overlaps" of the intervals are bugging me quite a bit.

Jonathan Wong - 6 years, 10 months ago

0.999999999999999.................................=1

Amritanshu Kumar - 6 years, 9 months ago
×

Problem Loading...

Note Loading...

Set Loading...