Ma · Mathematics

What Is the Difference Between Lebesgue-Null and Jordan-Null Sets?

Published By the 9to5Science editorial team

At a glance

  1. 1. Check boundedness

    Classical Jordan nullity applies to bounded sets; Lebesgue nullity also applies to unbounded sets.

  2. 2. Compare the covers

    Lebesgue nullity allows countably many boxes, while Jordan nullity requires finitely many.

  3. 3. Test the closure

    For a bounded set, Jordan nullity is equivalent to its closure being Lebesgue null.

  4. 4. Use a counterexample

    The rationals in [0,1] are Lebesgue null but not Jordan null because they are dense.

A null set is a set that can be covered by boxes whose total volume is as small as desired. The key difference between the Lebesgue and Jordan versions is whether the cover may use countably many boxes or must use finitely many.

That difference matters: every Jordan-null set is Lebesgue null, but the reverse implication can fail even for bounded sets. The rationals in the unit interval are the standard example.

The two definitions

For a set E⊆RnE \subseteq \mathbb{R}^n, being Lebesgue null means that for every ε>0\varepsilon>0, there is a countable collection of boxes covering EE whose total volume is less than ε\varepsilon:

E⊆⋃k=1∞Bk,∑k=1∞vol⁡(Bk)<ε.E \subseteq \bigcup_{k=1}^{\infty} B_k, \qquad \sum_{k=1}^{\infty} \operatorname{vol}(B_k)<\varepsilon.

Boxes here may be intervals in one dimension, rectangles in two dimensions, and their higher-dimensional analogues. Equivalent formulations use open boxes.

Classical Jordan nullity (also called having Jordan content zero) uses the same idea but requires a finite cover. In the usual definition, EE must also be bounded: for every ε>0\varepsilon>0, finitely many boxes cover EE and the sum of their volumes is less than ε\varepsilon.

The definitions immediately give one implication. A finite cover is a countable cover, so

Jordan null  ⟹  Lebesgue null.\text{Jordan null} \implies \text{Lebesgue null}.

But a countable cover need not have a finite subcover of similarly small total volume. That is why the converse is not automatic.

Why the rationals are the key example

Let E=Q∩[0,1]E=\mathbb{Q}\cap[0,1]. The rationals are countable, so enumerate them as q1,q2,…q_1,q_2,\ldots. Given ε>0\varepsilon>0, cover qkq_k by an interval of length less than ε/2k+1\varepsilon/2^{k+1}. The total length of these intervals is less than ε\varepsilon. Thus EE is Lebesgue null.

However, EE is not Jordan null. Any finite collection of closed intervals that covers every rational in [0,1][0,1] must also cover the closure of those rationals, which is all of [0,1][0,1]. The sum of the intervals’ lengths must therefore be at least 11. It cannot be made arbitrarily small.

This illustrates the role of the closure. Finite covers cannot avoid covering limit points of the set, because a finite union of closed boxes is closed.

A useful test for bounded sets

For a bounded set E⊆RnE \subseteq \mathbb{R}^n, the following criterion is often the quickest way to compare the notions:

E is Jordan null⟺E‾ is Lebesgue null.E \text{ is Jordan null} \quad\Longleftrightarrow\quad \overline{E} \text{ is Lebesgue null}.

For the forward direction, suppose finite box covers of EE have arbitrarily small total volume. Take the closures of the boxes in such a cover. Their union is closed and contains EE, so it also contains E‾\overline{E}. These closures have the same volumes as the original boxes. Enlarge them slightly to open boxes, increasing the total volume by as little as desired. The resulting open boxes cover E‾\overline{E} with arbitrarily small total volume.

For the reverse direction, suppose E‾\overline{E} is Lebesgue null. Cover it by countably many open boxes with total volume less than ε\varepsilon. Since EE is bounded, its closure is compact. Compactness gives a finite subcover, and the total volume of that finite collection is no greater than the total for the original countable cover. Hence EE has finite covers of arbitrarily small total volume and is Jordan null.

The criterion explains the rational example: Q∩[0,1]‾=[0,1]\overline{\mathbb{Q}\cap[0,1]}=[0,1], which is not Lebesgue null.

Worked comparison: a compact null set

Consider the middle-thirds Cantor set C⊆[0,1]C\subseteq[0,1]. At stage mm of its construction, it is contained in 2m2^m closed intervals, each of length 3−m3^{-m}. Their total length is

2m3−m=(23)m.2^m 3^{-m}=\left(\frac{2}{3}\right)^m.

As mm increases, this quantity tends to zero. The cover at every stage is finite, so CC is Jordan null as well as Lebesgue null. This example contrasts with the rationals: the Cantor set is closed, and its closure has measure zero.

Common mistakes

  • Assuming bounded Lebesgue-null sets are automatically Jordan null. The rationals in [0,1][0,1] are bounded and Lebesgue null, but their closure is the whole interval.
  • Ignoring the number of boxes. A countable cover with small total volume establishes Lebesgue nullity, not by itself Jordan nullity.
  • Calling every null set Jordan null without checking boundedness. Classical Jordan content is defined for bounded sets. Some texts use local or extended variants, so check the convention if the set is unbounded.
  • Confusing Jordan nullity with Jordan measurability. A bounded set is Jordan measurable when its boundary is Jordan null. A Jordan-null set is itself a set of Jordan content zero; these are related but different statements.

In short, Lebesgue nullity concerns the size of the set under countable covers. Jordan nullity adds a finite-cover requirement, which makes the closure decisive for bounded sets.

References

  1. Real Analysis: Modern Techniques and Their Applications, Gerald B. Folland
  2. Real Analysis, H. L. Royden and P. M. Fitzpatrick

Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.