This proof is from Adams and Franzosa (2008), who in turn got it from Banks, Brooks, Cairns, Davis, and Stacey (1992).
Idea: We find a pair of disjoint periodic orbits and , so any will be at least a constant distance away from at least one of them. We use the first property of chaos (density of periodic points) to get a periodic point nearby (call its period ), and the second property of chaos (topological transitivity) to get a point nearby such that eventually brings near or . The continuity of lets us pick such that iterations of on stay close to or . Then for the we need to demonstrate sensitive dependence on initial conditions, we pick an integer that's a multiple of but also keeps near or . Then , which is large because is near and is far from or . By the triangle inequality, at least one of or must be large, proving the theorem.
Proof: First of all, observe that contains infinitely many periodic points of , since it's infinite and periodic points are dense in it. At least two of these points—call them and —must have disjoint orbits. Otherwise, all of the infinitely many periodic points would be part of the same cycle, prohibiting any of them from having a finite period. Now let , so that is the minimum distance between the orbits of and .
Define . We'll prove that this is the needed for sensitive dependence on initial conditions. So pick an arbitrary and . Without loss of generality, we may force . (We can shrink as much as we like because if we find a suitable for the new , then of course for the original, larger as well.) Since periodic points are dense, there's a periodic point . Let be the period of .
It follows from the triangle inequality (and it's obvious from the picture) that wherever is, it must be at least units away from either every point in or every point in ; suppose, without loss of generality, that the former is the case.
For each , let . (This means that is just . But need not equal , since is the period of , not .) Then for each , the continuity of implies that is continuous, so is open; in fact, it's a neighborhood of . Let be the intersection of all of these neighborhoods.
Since is topologically transitive, there exist and such that .
Now pick with . Suppose we knew that
The triangle inequality would then imply that or , proving the theorem, since . So all we have left to do is prove (1).
By the triangle inequality,
Since ,
Since ,
in particular, since , , so
Combining (2), (3), and (4) yields
But we assumed that is more than units away from every point in , so
and thus
This implies (1), since
being the period of . □