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.
Solved by gpt-5.6-sol high.
Let and let be the nearest-point projection of to . If the translation length is , the unique path from to is the concatenation
The first and last pieces both have length , while the middle one has length . Therefore
The displacement is minimized exactly when , proving that the axis is the minimum set of the displacement function.
On , the power translates through when and in the opposite direction through when . The same formula applied to shows that its minimum set is . Hence
Solved by gpt-5.6-sol high.
Suppose that acted as a hyperbolic isometry of a tree, with translation length . Nonzero powers have the same axis and
Translation length is invariant under conjugacy, whereas the defining relation in the Baumslag-Solitar group says that and are conjugate. Hence , contradicting . Therefore acts elliptically in every combinatorial tree action.
Solved by gpt-5.6-sol high.
Suppose were a nontrivial free product. Its Bass-Serre tree action has trivial edge stabilizers and no global fixed vertex. Part c makes elliptic. Since has infinite order, the fixed set of every nonzero power is a single vertex: it is nonempty, while fixing two vertices would fix the intervening edge and put the infinite-order element in a trivial edge stabilizer.
Let this vertex be . The relation gives
and both sides are the singleton . Thus also fixes . Since and generate the Baumslag-Solitar group, the entire group fixes , contradicting the Bass-Serre action of a nontrivial free product. Hence no such decomposition exists.
Solved by gpt-5.6-sol high.

Articles by others on the same topic (0)

There are currently no matching articles.