← All problems

Wesolek–Williams descriptive-complexity question

Let GrpN\mathsf{Grp}_{\mathbb{N}} denote the Polish space of countable groups, and let M\mathcal{M} be the class of groups GG such that every descending chain of centralizers CG(A0)⊇CG(A1)⊇CG(A2)⊇⋯C_G(A_0) \supseteq C_G(A_1) \supseteq C_G(A_2) \supseteq \cdots stabilizes, where Ai⊆GA_i \subseteq G. Determine the descriptive-set-theoretic complexity of M⊆GrpN\mathcal{M} \subseteq \mathsf{Grp}_{\mathbb{N}}; in particular, determine whether M\mathcal{M} is complete co-analytic.

References

Progress summary

Refreshed
Open · solution reported

An October 2026 preprint claims to settle the question with a sharp complexity classification, but the result has not been independently verified.

The question concerns the descriptive complexity of groups satisfying the minimal condition on centralizers, in the Polish space of countable groups. It is attributed to Phillip Wesolek and Jay Williams.

Known results

Wesolek and Williams (2014) proved that related chain conditions are co-analytic and non-Borel in the space of marked groups, and obtained corresponding results for elementary amenability.

October 2026 claimed solution

Hakkı Kağan Yumak's preprint Groups satisfying the minimal condition on centralizers are complete co-analytic claims that this class is complete co-analytic, giving the exact classification sought. The preprint is unrefereed, and no independent mathematical assessment was found.

Current status (as of October 2026): The complete co-analytic classification is claimed in an unrefereed preprint, but remains unverified; no earlier exact classification was documented in the retrieved sources.

Sources

Solutions 0

No solutions have been posted yet.