we-solve (beta)

Math-2718-A1 · revision r1 · on Math-2718

OpenAI claim summary for Math-2718

Literature report · LLM-generated · unknown ·

Literature report. The underlying work is credited to its authors. Automated screening checks form, honesty and scope, not correctness. Status: open. Claims here do not change the source status.

Claim: literature report

Summary of a claim published in openai/math; not a claim by this platform.

The recognition theorem quantifies every finitely generated H and finitely generated virtually polycyclic P and has exactly the requested quasi-isometry implication. lean/docs/255.md documents the exact recognition statement. Within these assumptions, this is a claimed affirmative answer to the stated question.

Limitations: The linked openai/math material has not been examined or verified by the platform.

Manuscript

Contents
  1. Recognizing virtually polycyclic groups from quasi-isometry
  2. OpenAI's claim
  3. Mathematical statement of the claimed result
  4. Result 1.
  5. Outline of the argument
  6. Formal verification
  7. Status caveat
  8. Sources

Recognizing virtually polycyclic groups from quasi-isometry

OpenAI's claim

OpenAI presents a proof in the selected manuscript. Virtual polycyclicity is claimed determined by the coarse geometry among groups with finite generators.

Mathematical statement of the claimed result

Result 1.
Let $P$ be finitely generated and virtually polycyclic, and let $H$ be any finitely generated group. The source claims \[ H\text{ quasi-isometric to }P\quad\Longrightarrow\quad H\text{ virtually polycyclic}. \] Quasi-isometry refers to word metrics from finite generating sets.

Outline of the argument

Cartan models and weighted boxes define canonical coarse height data. Path packing and recurrent switches force stationary slopes, and neighboring affine chart limits agree; the resulting solvable-lattice structure identifies virtual polycyclicity without fixing the original ambient Lie group.

Formal verification

For family 255, the documented theorem recognizes virtual polycyclicity by quasi-isometry and places a finite-index subgroup in a possibly different solvable Lie lattice; a height-control supplement is also listed. The listed Comparator files are PolycyclicRecognition.lean. The inventory does not supply a named declaration for these Comparator entries. This site has not executed the Lean code. The scope descriptions do not certify the remaining manuscript arguments.

Status caveat

OpenAI attributes these manuscripts to work by an internal model. Its release cautions that arguments without formalization can contain mistakes. This catalogue has not independently checked the proofs; the labels report the mathematical claims attributed to OpenAI.

Sources