Math-1222 · mathematics · Group theory

Math-1222

Kourovka Notebook Problem 21.52

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

Let $L$ be a finite nonabelian simple group and let $D$ be one conjugacy class of involutions, meaning elements of order two. Form the complete simple graph on vertex set $D$, and label its unordered edge $\{a,b\}$ by the integer $o(ab)$, the order of the product. This is well defined on unordered pairs, since $ba=(ab)^{-1}$ for involutions and inverse elements have the same order.

Its colour-preserving automorphism group is \[ A=\{\tau\in\operatorname{Sym}(D): o(\tau(a)\tau(b))=o(ab)\text{ for all distinct }a,b\in D\}. \] The colours are the actual integer orders; permuting colour labels is not allowed. Let $\operatorname{Aut}(L)_D$ be the subgroup of group automorphisms mapping $D$ to itself. Restriction to $D$ gives a homomorphism $\operatorname{Aut}(L)_D\to A$.

Does every $\tau\in A$ extend to an automorphism of $L$? This is the precise interpretation of the proposed containment of graph automorphisms in $\operatorname{Aut}(L)$. The restriction homomorphism is injective: $\langle D\rangle$ is a nontrivial normal subgroup of the simple group $L$, and consequently is all of $L$.

Thus an extension, if it exists, is unique, and the target can be written $A=\operatorname{Aut}(L)_D|_D$. The task must hold for every choice of involution conjugacy class, not only for its union with other classes. Preservation of pair-product orders is the only graph data supplied.

Short English statement

Does every permutation of an involution conjugacy class preserving all pair-product orders extend to an automorphism of the finite simple group?

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.