Problem 12.22 — (T.
Status Open · unsolvedmath.comLLM status Open unverified
Top Open Problems Not reported cataloguedOpenOpenStatement
Definitions and mathematical statement
Retain $C_2$ as the group named in the source; its definition is not provided in the statement. For a group $G$, define its derived series by $G^{(0)}=G$ and $G^{(m+1)}=[G^{(m)},G^{(m)}]$. It is solvable if $G^{(m)}=\{1\}$ for some finite $m$. Write $F_r$ for the free group of rank $r$.Questions (T. Stanford).
- Is $C_2$ solvable; that is, does there exist a finite $m$ with $C_2^{(m)}=\{1\}$?
- Does $C_2$ contain a free group? Literally this asks for an embedding $F_r\hookrightarrow C_2$ for some allowed rank $r$. If the intended meaning is a nonabelian free subgroup, the usual precise version is $F_2\hookrightarrow C_2$. The source does not state a rank or the word "nonabelian," so the distinction from an infinite cyclic subgroup must remain explicit.
Short English statement
Stanford asks whether the group $C_2$ is solvable and whether it contains a free subgroup. Its definition and the intended free-group rank are missing; the summary's pure-braid interpretation does not specify a braid index or other necessary conventions.Sources
- Local UnsolvedMath registry, permanent ID 10400227, source code catalogue entry; attribution T. Stanford. The stored title is truncated after "Problem 12.22 --- (T.".
- Ohtsuki, Problems on invariants of knots and 3-manifolds (2002), Problem 12.22, PDF page 169. Supplied URL: https://msp.org/gtm/2002/04/gtm-2002-04-024s.pdf; recorded access 2026-07-29; extraction pdf-font-structure. The collection distinguishes 231 numbered bold problem, conjecture, and question headings.
- The supplied summary interprets $C_2$ as the second lower-central-series term of a pure braid group, but supplies no supporting definition or reference beyond the source item. Status is open and OPEN-TRIAGE. Current primary-literature status and redistribution terms for the publicly accessible author/publisher copy remain NEEDS_REVIEW.
Statement licence: CC-BY-4.0 · Source file
Contributions 0
No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.