Covering the Rationals with Nothing

Cover the rationals one by one and the total length drops below any bound. The Riemann integral cannot move here.

The rationals are countably many. So they can be numbered and given shrinking covers. The covers' total can be made as small as you wish.

For example, cover 🍬 candies scattered on the floor, one by one, with smaller and smaller cups, and the cups' total size shrinks as low as you like.

m(Q∩[0,1])=0m(\mathbb{Q}\cap[0,1]) = 0

Part of these learning paths

Examples & Exercises

Prove by covering that a single point {x0}\{x_0\} has measure 0.

m({x0})≤ε∀ ε>0m(\{x_0\}) \le \varepsilon \quad \forall\,\varepsilon > 0
K=1K = 1: the first rational 00 gets a cover of length 0.050.05.
Show proof
  1. For any ε>0\varepsilon > 0, the interval (x0−ε/2, x0+ε/2)(x_0 - \varepsilon/2,\, x_0 + \varepsilon/2) covers {x0}\{x_0\} and has length ε\varepsilon.

  2. So the outer measure is at most ε\varepsilon, and since ε\varepsilon is arbitrary, the measure is 00.

Prove m(Q∩[0,1])=0m(\mathbb{Q}\cap[0,1]) = 0 with the ε/2k\varepsilon/2^k covering.

∑k=1∞ε2k=ε\sum_{k=1}^{\infty}\frac{\varepsilon}{2^k} = \varepsilon
ε=0.05\varepsilon = 0.05, K=32K = 32: total length ≈0.05\approx 0.05 covers 32 rationals.
Show proof
  1. The rationals are countable, so enumerate those in [0,1][0,1] as r1,r2,…r_1, r_2, \dots.

  2. Covering rkr_k with an interval of length ε/2k\varepsilon/2^k gives total cover length ∑k=1∞ε/2k=ε\sum_{k=1}^{\infty}\varepsilon/2^k = \varepsilon.

  3. Since ε>0\varepsilon > 0 is arbitrary, the outer measure is 00, hence so is the measure.

Prove (briefly) that the Lebesgue integral of the Dirichlet function is 0, and contrast with Riemann.

∫[0,1]D=1⋅m(Q∩[0,1])+0=0\int_{[0,1]} D = 1\cdot m(\mathbb{Q}\cap[0,1]) + 0 = 0
The set where D=1D = 1 (the rationals) has measure 0 — elsewhere D=0D = 0.
Show proof
  1. The set where D=1D = 1 is Q∩[0,1]\mathbb{Q}\cap[0,1], of measure 00; elsewhere D=0D = 0.

  2. So the Lebesgue integral is 1⋅0+0⋅1=01 \cdot 0 + 0 \cdot 1 = 0.

  3. Riemann, by contrast, is stuck at U=1U = 1, L=0L = 0 for every partition — Lebesgue counts "how often each value occurs".

11. Integration