Let be an isometry of the tree . After subdividing edges if necessary, it has no edge inversion. If fixes a vertex, it is an elliptic isometry of a tree. Otherwise choose a vertex minimizing the positive integer . The geodesic segments concatenate without backtracking: any backtracking would produce a vertex with smaller displacement. Their union over is therefore a bi-infinite geodesic, the axis of a tree isometry, and translates it by . This proves the elliptic-hyperbolic classification of an isometry of a tree.
An element of finite order cannot translate a line through a positive distance, since its powers would have unbounded displacement. Every finite-order element of therefore fixes a vertex of its Bass-Serre tree. Vertex stabilizers are conjugates of and , so the element is conjugate to a power of or a power of .
Let . A tree has a unique geodesic segment . The isometry sends this segment to the segment . An isometry of a segment that fixes both endpoints fixes every point of it, so
Thus the fixed-point set of an elliptic isometry of a tree is a convex subtree, in particular it is path-connected.
Let be the common fixed subtree of the centre, which is nonempty by hypothesis and is -invariant because is central. Restrict the action to this subtree. There and act pointwise trivially, so the action factors through
In particular, the induced tree isometries satisfy
Assume, as usual for a combinatorial tree action, that edge inversions have been removed by barycentric subdivision. The finite-order elements are then elliptic. Moreover
so each pairwise product is elliptic. Serre lemma for tree actions implies that the fixed subtrees of each pair intersect. Convex subtrees of a tree have the Helly property, so
Since generate , fixes a vertex of . Thus the action of on is trivial in the tree-action sense.