On entropy of pure mixing maps on dendrites

For every dollar sign 0 less than alpha less than or equals infinity dollar sign $0 \lt \alpha\le\infty$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mn>0</mml:mn> <mml:mo>&lt;</mml:mo> <mml:mi>α</mml:mi> <mml:mo>≤</mml:mo> <mml:mo>∞</mml:mo> <mml:mi>$</mml:mi> </mml:mrow> </mml:math> we construct a continuous pure mixing map (topologically mixing, but not exact) on the Gehman dendrite with topological entropy dollar sign alpha dollar sign $\alpha$ <mml:math xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mnf="http://cambridge.org/core/manifest" xmlns:cup="http://contentservices.cambridge.org" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:m="http://cambridge.org/core/metadata" xmlns:core="http://cambridge.org/core" xmlns:c="http://cambridge.org/core/content" display="inline"> <mml:mrow> <mml:mi>$</mml:mi> <mml:mi>α</mml:mi> <mml:mi>$</mml:mi> </mml:mrow> </mml:math> . It has been previously shown by Špitalský that there are exact maps on the Gehman dendrite with arbitrarily low positive topological entropy. Together, these results show that the entropy of maps on the Gehman dendrite does not exhibit the paradoxical behaviour reported for graph maps, where the infimum of the topological entropy of exact maps is strictly smaller than the infimum of the entropy of pure mixing maps. The latter result, stated in terms of popular notions of chaos, says that for maps on graphs, lower entropy implies stronger Devaney chaos. The conclusion of this paper says that lower entropy does not force stronger chaos for maps of the Gehman dendrite.