A decreasing rearrangement for functions on homogeneous trees (Q1765605)

Let \(T\) be a non-finite and locally finite homogeneous tree (that is, for every vertex the number of neighbor vertices is the same). Denote by \(A^*\) the decreasing rearrangement of a set \(A\subset T\) with respect to a fixed partial order on \(T\). Let \({\mathcal M}_0\) be the set of functions satisfying \(| \{x\in T:| f(x)| >\lambda\}| <\infty\) for all \(\lambda>0\). The decreasing rearrangement of \(f\in{\mathcal M}_0\) is defined by \(f^*(x)=\int_0^\infty\chi_{\{y\in T:| f(y)| >\lambda\}^*}(x)\,d\lambda\). The authors show that \(f^*\) can be calculated using the special geometric structure of the tree. The idea is to iterate, with respect to the partial order, the usual one-dimensional rearrangement of \(f\) on each geodesic (that is, a unique chain joining two arbitrary vertices). Finally, if a tree \(T\) is equipped with a total order, one can consider Lorentz spaces on \(T\), where the functional \((\sum_{x\in T} f^*(x)^pu(x))^{1/p}\) defines a norm under appropriate assumptions on the weight \(u\) and \(p>0\).