A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Quasi-isometric rigidity of virtually polycyclic groups
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Zeta Defense <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:symmetry Levels:1
Category:Group theory Lean version:YES! ✔
Rate this game! 4.3 out of 5 (6,189 votes)

>>> How to Play <<<
Quasi-isometric recognition of virtually polycyclic groups. Proves that every finitely generated group quasi-isometric to a finitely generated virtually polycyclic group is virtually polycyclic, resolving the Eskin–Fisher–Whyte lattice-recognition conjecture. Equivalently, a group quasi-isometric to a lattice in a connected simply connected solvable Lie group is virtually a uniform lattice in some such Lie group, possibly a different one.

>>> Level Select <<<
released 2026-09-24  |  2 theorems · 35 lemmas · 47 proofs · 34,989 words  |  PLAY LEVEL 1 »  (pdf)
We prove that every finitely generated group quasi-isometric to a finitely generated virtually polycyclic group is virtually polycyclic. This resolves the lattice-recognition conjecture of Eskin, Fisher and Whyte, which allows the ambient solvable Lie group in the conclusion to differ from the one in the hypothesis.

More Group theory Games!
Amenability, unitarizability, and Ulam stabilityA non-residually-finite torsion-free hyperbolic groupAn infinite finitely presented simple amenable groupClassifying spaces and geometric obstructions for Artin groups
Howie's conjecture on equations over groupsA hyperbolic group with no geometric CAT(0) actionGersten's conjecture for one-relator groupsA group without fixed price

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games