Measures of \(\varepsilon\)-complexity (Q812866): Difference between revisions

Ultrafilters are used to find measures on a compact metric space that reflect the asymptotic behaviour of the \(\varepsilon\)-complexity (the maximum cardinality of an \(\varepsilon\)-separated set) for \(\varepsilon\to0\). The authors point out that related work was done by \textit{J. Mycielski} [Colloq. Math. 32, 105--112 (1974; Zbl 0298.28018)], who proved that measures invariant with respect to local isometries always exist and found conditions that are sufficient to guarantee uniqueness. Example 3 in the current paper answers one of the questions raised by Mycielski by exhibiting an example where the measure is not unique.