no. 16 · Tuesday 17 November 2026
A counterexample to the subgraphings approximate the cost problem
Abstract
We prove that for every $k\ge 2$, the free group $\mathbb{F}_k$ on $k$ generators admits a finite generating set $S$ such that the Schreier graphing of the Bernoulli action of $\mathbb{F}_k$ with respect to $S$ does not admit spanning subgraphings that would approximate the cost of the action. In particular, this gives an example of a graphing that spans a treeable countable pmp equivalence relation, but does not admit a spanning subtreeing.
- fields
- Group Theory, Logic