Metric uniform simplicity of simple metric ultraproducts

About 6 years old · traced to

Let (Gmet,∥⋅∥)({\mathcal G}_{\mathrm{met}},\|\cdot\|) be a metric ultraproduct of metric groups. A metric group is metrically uniformly simple if, for every r>0r>0, there is N∈NN\in\mathbb{N} such that CN(g,G)=GC_N(g,G)=G for all g∈Gg\in G with ∥g∥>r\|g\|>r, where CN(g,G):=(gG∪g−1G)≤NC_N(g,G):=(g^G\cup g^{-1G})^{\leq N}. The metric uniform simplicity conjecture. If (Gmet,∥⋅∥)({\mathcal G}_{\mathrm{met}},\|\cdot\|) is simple, then Gmet{\mathcal G}_{\mathrm{met}} must be metrically uniformly simple. The paper identifies this as a conjecture suggested by the fact that all known simple metric ultraproducts have the stronger property, while the available results establish only bounded simplicity.

References

Primary source

Jakub Gismatullin, Krzysztof Majcher and Martin Ziegler, “Metric ultraproducts of groups – simplicity, perfectness and torsion”, arXiv:2010.03394 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.