The question and the answers
For a word in the free group and a group , substitution defines the word map
J. Mycielski's Problem 16.68 asks whether every nonidentity word gives a surjective map on each of , and [1]. The complex answer is affirmative; the real answer is negative. Throughout, we use and the ordinary matrix trace .
Complex theorem. Let be an algebraically closed field of characteristic zero. For every , the map
is surjective. In particular, this holds for .
Real theorem. In , put
Then and
Consequently, is not surjective: its image contains no nonidentity involution.
The complex proof combines an elementary-matrix specialization from Schneider–Thom [2, Lemma 1] with a polynomial-fibre observation appearing in Mushkarov–Nikolov [3, Example 1(iii)]. The real proof is an explicit trace identity and an inequality. The word has cyclically reduced length .
The compact answer is already negative by Thom's almost-law theorem [4, Corollary 1.2]: there are nonidentity two-variable words whose values on are uniformly arbitrarily close to the identity. Restriction to , with a sufficiently small neighbourhood, gives a nonsurjective word map. This is an attributed prior result and is not part of the Lean formalizations described here.
A simple root gives a unipotent
Fix an algebraically closed field of characteristic zero. The obstruction to proving the complex theorem from traces alone is that a matrix of trace or might be scalar. The following two observations remove it.
Two-fibre lemma. If is nonconstant and , then or has a simple root.
Proof. Put . If neither fibre had a simple root, each would have at most distinct roots. A root of multiplicity contributes to the multiplicity of . The fibres are disjoint, so together they contribute at least zeros to , counted with multiplicity. This contradicts .
Matrix-curve lemma. If has nonconstant trace, then is nonscalar of trace or for some .
Proof. Write . The preceding lemma supplies and with
If were scalar, it would equal . Write
Differentiating at would give
a contradiction.
Every nonidentity word over an algebraically closed field
Word images are invariant under conjugation, and conjugate words have the same image. If is conjugate to a nonzero power of one generator, surjectivity follows from power maps on . For semisimple elements, take roots in the diagonal torus. For unipotents, use
Otherwise, cyclic reduction and rotation give a conjugate of the form
Substitute
For all integer exponents, including negative ones,
The coefficient of in this block is the rank-one matrix . Multiplying these coefficients gives
Thus is nonconstant and takes every value in .
For each , all determinant-one matrices of trace are conjugate: their characteristic polynomial has distinct roots. The image of therefore contains every nonidentity semisimple element of .
The matrix-curve lemma supplies a value with and , the latter equality following from Cayley–Hamilton. Its projective class is , a nonidentity unipotent. All nonidentity unipotents are conjugate over , so they also belong to the image. The conjugators can be taken in : multiply a conjugator by a scalar with the appropriate square to make its determinant one. Finally, . These cases exhaust and prove the complex theorem.
The real trace identity
The real construction substitutes conjugate inputs into the shorter word
This forces the two inputs of to have the same trace, and real conjugacy imposes an additional restriction that makes the bound possible.
Trace identity. Let have common trace . Put and . Then
Here is a derivation, so the large factored polynomial can be checked from smaller identities. Write
and set
The skein and Fricke identities are
where , and . They give
For the formula for , the identity first gives . Apply the skein identity to and : their product is , and the product of the first with the inverse of the second is . Also is conjugate to , which gives the formula for . Expansion now yields
Multiplying proves the trace identity.
The restriction imposed by real conjugacy
For , the parameters satisfy
To prove this, put . The skein identity gives , so it suffices to show when . Write
The determinant and trace identities give
Consequently,
If , this proves the claim. If , then , so . The upper-right entry of is then zero, giving . The boundary and degenerate cases are therefore included.
A uniform lower bound
Apply the trace identity to . First suppose . If , each term in the defining expression for is nonnegative and . Otherwise, put . Substitution gives
Indeed, on , while on ,
Thus the factored trace gives throughout this region.
The remaining region has and . Set
Then , and
The identity
gives . If , again . If , then , and the exact inequality
yields
For the strict final inequality, expand the difference:
Every coefficient is positive. The two regions cover all real inputs, proving universally.
The word is nonidentity and omits involutions
One exact evaluation certifies that is a nonidentity free-group word. Take
Here and , so
This single calculation proves nonidentity; the preceding symbolic inequalities establish the bound for every pair.
Now let lift a nonidentity involution in the projective group. Then . The case forces : its minimal polynomial has distinct roots among , and determinant one excludes a pair of opposite eigenvalues. This would make the projective class the identity. Hence , and Cayley–Hamilton gives .
Every pair of projective inputs has special-linear lifts. If its -value were a nonidentity involution, the matrix word evaluated on those lifts would therefore have trace zero, contradicting the strict bound. For example, the class of
is omitted. This proves the real theorem.
Credit and the formal record
Bandman–Zarhin proved earlier complex surjectivity results [5]; the all-word question is stated explicitly by Gordeev–Plotkin [6, Problem 0.1]. The complex argument above uses the specialization of Schneider–Thom and the scalar polynomial observation of Mushkarov–Nikolov. Differentiating the determinant connects a simple root to a nonidentity projective unipotent.
For the real group, Gordeev–Kunyavskii–Plotkin discuss the surjectivity question and prove that every nonidentity word attains all split semisimple elements. They also show that attaining an involution would imply that every semisimple element is attained [7, Question 2.5 and Proposition 2.6]. The explicit word and its trace bound give the obstruction here. Thom's compact result supplies the third answer to Problem 16.68.
The solution and formalization are by Nilradical v1.0.0, using Lean and mathlib. Both the real and complex results have complete proofs with the standard free-group and projective special linear group definitions. The complex endpoint proves WordMaps.word_surjective for every algebraically closed field of characteristic zero and specializes it in WordMaps.complex_word_surjective. The real endpoint proves RealWord.word_ne_one, RealWord.tr_value_gt_seven_fourths, RealWord.word_not_surjective and RealWord.exists_nontrivial_nonsurjective_word.
The real formal proof explicitly omits the displayed class of . Omission of every nonidentity involution is the consequence of the trace bound proved above; it is not a separately exported endpoint. The compact case is attributed to Thom and is not formalized in these projects. The formalization guide and verification record identify the sources and their verification evidence. The frozen developments passed independent statement comparison, proof replay and external kernel checking.
References
-
E. I. Khukhro and V. D. Mazurov (eds.), The Kourovka Notebook, 21st ed., September 2026 update, Problem 16.68 (J. Mycielski), p. 102. Editors' text.
-
J. Schneider and A. Thom, Word images in symmetric and unitary groups are dense, arXiv:1802.09289v1, Lemma 1. Published, with revised title, in Pacific J. Math. 311 (2021), 475–504. Original preprint.
-
O. Mushkarov and N. Nikolov, A Picard little theorem for entire functions of matrices, Elem. Math. 81 (2026), 34–39, Example 1(iii). DOI.
-
A. Thom, Convergent sequences in discrete groups, Canad. Math. Bull. 56 (2013), 424–433, Corollary 1.2. Author version.
-
T. Bandman and Yu. G. Zarhin, Surjectivity of certain word maps on and , Eur. J. Math. 2 (2016), 614–643. Author version.
-
N. Gordeev and E. Plotkin, The group : Word maps and related topics (2026), Problem 0.1. DOI.
-
N. Gordeev, B. Kunyavskii and E. Plotkin, Geometry of word equations in simple algebraic groups over special fields, Russian Math. Surveys 73 (2018), 753–796, Question 2.5 and Proposition 2.6. Author version.