Result 255, Group theory

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.

Lean formalization Proof

The bigger picture

Why it matters

Can the shape of a group, viewed from far away, reveal how it is built algebraically? This manuscript claims that it can recognize virtually polycyclic groups, even when fine details of distances are lost.

What changes?

The manuscript reports that every finitely generated group quasi-isometric to a finitely generated virtually polycyclic group is itself virtually polycyclic. Finitely generated means built from finitely many generators. Quasi-isometry means having the same large-scale geometry, allowing fixed multiplicative and additive distance errors. A polycyclic group is built through finitely many extensions with cyclic groups, each generated by one element. 'Virtually' means having such a subgroup of finite index: finitely many translates of that subgroup cover the group.

What does that help mathematicians do?

Equivalently, a group quasi-isometric to a lattice in a connected, simply connected solvable Lie group must virtually be a uniform lattice in some such Lie group. A uniform lattice is a discrete subgroup with compact quotient. Researchers can therefore deduce algebraic structure from coarse geometry and rule out groups outside this class as geometric lookalikes. Crucially, the conclusion allows a different ambient Lie group; it does not recover the original one.

Are there practical applications?

The immediate value is foundational: the claimed result makes virtual polycyclicity a property detectable from large-scale geometry, not just an algebraic description. It gives researchers studying solvable Lie group lattices a recognition principle while leaving open which ambient Lie group realizes the recognized group. The supplied material describes no practical deployment.

This section was generated by GPT-6 Astra Medium. This explanation is based on the result summary and manuscript abstracts below. This context is separate from OpenAI's source text.

Manuscript

Quasi-isometric recognition of virtually polycyclic groups

September 24, 2026 73 pages

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.

PDF LaTeX source
Cite (BibTeX) 
@misc{OAI:quasi-isometric-recognition-of-virtually-polycyclic-groups-September-24-2026,
  author = {{OpenAI}},
  title = {{Quasi-isometric Recognition of Virtually Polycyclic Groups}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/quasi-isometric-recognition-of-virtually-polycyclic-groups-September-24-2026/paper.pdf}{OAI:quasi-isometric-recognition-of-virtually-polycyclic-groups-September-24-2026}},
  year = {2026}
}

Lean formalization

OpenAI's note on what the formalization covers, from lean/docs/255.md.

Quasi-isometric recognition of virtually polycyclic groups

The following describes the scope of the Lean formalization related to the following accompanying paper(s):

Scope

The formalization proves quasi-isometric recognition of virtually polycyclic groups: every finitely generated group quasi-isometric to a finitely generated virtually polycyclic group is itself virtually polycyclic. It also realizes a finite-index subgroup of the recognized group as a uniform lattice in a simply connected solvable Lie group, which may differ from the original ambient group.

The linked structural estimate controls the height-coordinate behavior of self quasi-isometries of the stated unimodular solvable Lie models, up to bounded error and one of finitely many linear height symmetries.

Comparator links

Result Comparator statement
Quasi-isometric recognition of virtually polycyclic groups and solvable lattices PolycyclicRecognition.lean

Data from github.com/openai/math at commit adc7f12, committed October 6, 2026 at 21:58 UTC, last checked for changes about 8 hours ago. Titles, subjects, summaries, abstracts and Lean notes are OpenAI's; page counts are read from the PDFs. The map, related results, search, kinds of results and the named-problem index are Emergent Mind's, built with text embeddings and an LLM, and may contain errors.

An Emergent Mind Labs project. Emergent Mind is not affiliated with OpenAI. None of these results has been peer reviewed. Cite the manuscripts themselves, using the BibTeX on each result's page.