The analyst's traveling salesman problem is an analog of the traveling salesman problem in combinatorial optimization. In its simplest and original form, it asks which plane sets are subsets of rectifiable curves of finite length. Whereas the original traveling salesman problem asks for the shortest way to visit every vertex in a finite set with a discrete path, this analytical version may require the curve to visit infinitely many points.
A rectifiable curve has tangents at almost all of its points, where in this case "almost all" means all but a subset whose one-dimensional Hausdorff measure is zero. Accordingly, if a set is contained in a rectifiable curve, the set must look flat when zooming in on almost all of its points. This suggests that testing us whether a set could be contained in a rectifiable curve must somehow incorporate information about how flat it is when one zooms in on its points at different scales.
This discussion motivates the definition of the following quantity, for a plane set
E\subset\R2
where
E
Q
\ell(Q)
Q
(x,L)
x
L
2\betaE(Q)\ell(Q)
E
Q
\betaE(Q)
Let Δ denote the collection of dyadic squares, that is,
\Delta=\{[i2k,(i+1)2k] x [j2k,(j+1)2k]:i,j,k\inZ\},
where
Z
E\subseteqR2
\beta(E)=diamE+\sumQ\in\Delta\betaE(3Q)2\ell(Q)
where diam E is the diameter of E and
3Q
Q
3\ell(Q)
The Traveling Salesman Theorem was shown to hold in general Euclidean spaces by Kate Okikiolu,[2] that is, the same theorem above holds for sets
E\subseteqRd
Rd
With some slight modifications to the definition of β(E), Raanan Schul[3] showed Traveling Salesman Theorem also holds for sets E that lie in any Hilbert Space, and in particular, implies the theorems of Jones and Okikiolu, where now the constant C is independent of dimension. (In particular, this involves using β-numbers of balls instead of cubes).
Hahlomaa[4] further adjusted the definition of β(E) to get a condition for when a set E of an arbitrary metric space may be contained in the Lipschitz-image of a subset
A\subseteqR
Menger curvature, as in the previous example, can be used to give numerical estimates that determine whether a set contains a rectifiable subset, and the proofs of these results frequently depend on β-numbers.
The Denjoy–Riesz theorem gives general conditions under which a point set can be covered by the homeomorphic image of a curve. This is true, in particular, for every compact totally disconnected subset of the Euclidean plane. However, it may be necessary for such an arc to have infinite length, failing to meet the conditions of the analyst's traveling salesman theorem.