Rigid stabilizers and local prosolubility for boundary-transitive actions on tree

Abstract Let 𝐺 be a group acting 2-transitively on the boundary of a locally finite tree, and exclude the situation (which is a genuine exception) where 𝐺 has both <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi mathvariant="normal">P</m:mi> <m:mo>⁢</m:mo> <m:mi mathvariant="normal">Γ</m:mi> <m:mo>⁢</m:mo> <m:msub> <m:mi mathvariant="normal">L</m:mi> <m:mn>3</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mn>4</m:mn> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> </m:math> \mathrm{P}\Gamma\mathrm{L}_{3}(4) and <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mrow> <m:mi mathvariant="normal">P</m:mi> <m:mo>⁢</m:mo> <m:mi mathvariant="normal">Γ</m:mi> <m:mo>⁢</m:mo> <m:msub> <m:mi mathvariant="normal">L</m:mi> <m:mn>3</m:mn> </m:msub> <m:mo>⁢</m:mo> <m:mrow> <m:mo stretchy="false">(</m:mo> <m:mn>5</m:mn> <m:mo stretchy="false">)</m:mo> </m:mrow> </m:mrow> </m:math> \mathrm{P}\Gamma\mathrm{L}_{3}(5) as local actions. We show that, for each half-tree <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi>T</m:mi> <m:mi>a</m:mi> </m:msub> </m:math> T_{a} , the local action of the rigid stabilizer of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi>T</m:mi> <m:mi>a</m:mi> </m:msub> </m:math> T_{a} at the root of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mi>T</m:mi> <m:mi>a</m:mi> </m:msub> </m:math> T_{a} contains the soluble residual of the point stabilizer of the local action of 𝐺. In particular, 𝐺 is locally prosoluble if and only if its local actions have soluble point stabilizers; if 𝐺 is not locally prosoluble, then it has micro-supported action on the boundary. We also prove some strong restrictions on the local actions of end stabilizers in 𝐺. These results are partly inspired by Radu’s classification of groups acting boundary-2-transitively on trees with local action containing the alternating group, and partly based on the author’s recent classification of finite permutation groups that preserve an equivalence relation, act faithfully on blocks and act transitively on pairs of points from different blocks.