Lesson plan

Distance set

In geometry, the distance set of a collection of points is the set of distances between distinct pairs of points. Thus, it can be seen as the generalization of a difference set, the set of distances (and their negations) in collections of numbers. Several problems and results in geometry concern distance sets, usually based on the principle that a large collection of points must have a large distance set (for varying definitions of "large"): *Falconer's conjecture is the statement that, for a collection of points in d -dimensional space that has Hausdorff dimension larger than d/2 , the corresponding distance set has nonzero Lebesgue measure. Although partial results are known, the conjecture remains unproven. *The Erdős–Ulam problem asks whether it is possible to have a dense set in the Euclidean plane whose distance set consists only of rational numbers. Again, it remains unsolved. *Fermat's theorem on sums of two squares characterizes the numbers in the distance set of the two-dimensional integer lattice: they are the square roots of integers whose prime factorization does not contain an odd number of copies of any prime congruent to 3 mod 4.…

Back to article

Article summary

In geometry, the distance set of a collection of points is the set of distances between distinct pairs of points. Thus, it can be seen as the generalization of a difference set, the set of distances (and their negations) in collections of numbers. Several problems and results in geometry concern distance sets, usually based on the principle that a large collection of points must have a large distance set (for varying definitions of "large"): *Falconer's conjecture is the statement that, for a collection of points in d -dimensional space that has Hausdorff dimension larger than d/2 , the corresponding distance set has nonzero Lebesgue measure. Although partial results are known, the conjecture remains unproven. *The Erdős–Ulam problem asks whether it is possible to have a dense set in the Euclidean plane whose distance set consists only of rational numbers. Again, it remains unsolved. *Fermat's theorem on sums of two squares characterizes the numbers in the distance set of the two-dimensional integer lattice: they are the square roots of integers whose prime factorization does not contain an odd number of copies of any prime congruent to 3 mod 4.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.