Pith. sign in

REVIEW 3 major objections 5 minor 24 references

Most Words are Geometrically Almost Uniform

T0 review · 3 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For every fixed simple algebraic group $\mathbf{G}$ over a finite field $\mathbb{F}_q$, a random word of length $n$ in $d>1$ letters is geometrically almost uniform with probability tending to $1$ as $n\to\infty$.

desk verdict The density-one theorem is significant and the strategy is convincing, but the written proof has a genuine gap in Section 4: Lemma 3.6 is applied to a group that grows with the walk length, so the claimed mixing is impossible; the gap is repairable and the paper deserves a serious referee. read the letter →

arxiv 1908.07287 v1 pith:UTZYT5ZC submitted 2019-08-20 math.GR

Michael Larsen This is my paper · ORCID
classification math.GR MSC 20P0511G2514G1520G40
keywords wordmapsfinitesimplegroupsgeometricirreducibilityrandomwalksChebotarevdensityalmostuniformdistributionsalgebraicoverfieldsprobabilisticgrouptheory
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves that for a fixed simple algebraic group $\mathbf{G}$ over a finite field $\mathbb{F}_q$, a random word of length $n$ in $d>1$ letters is geometrically almost uniform with probability tending to $1$ as $n\to\infty$. Being geometrically almost uniform means that on the finite simple groups $\mathbf{G}(\mathbb{F}_{q^n})/Z(\mathbf{G}(\mathbb{F}_{q^n}))$, evaluation of the word on a random tuple is asymptotically indistinguishable from a uniformly random group element. Earlier work had shown this for a positive proportion of words, and for each $d$ a set of density greater than $1/3$; the paper upgrades that proportion to one. The theorem is established by proving that almost all words with any fixed abelianization gcd $m$ are almost uniform, and then showing that the gcd of a random word is small with overwhelming probability.

What carries the argument

The load-bearing geometric device is Proposition 2.5, a sieve for dominant morphisms over finite fields. Associated to a dominant morphism $\varphi:Y\to X$ of normal varieties, it constructs finitely many large subsets $X_{n,i}\subset X(\mathbb{F}_{q^n})$ such that any dominant morphism $\theta:Z\to X$ whose image contains $\varphi(Y(\mathbb{F}_{q^n}))$ for all $n$ and meets every $X_{n,i}$ for some $n$ must have geometrically irreducible generic fiber. The subsets are built as complements of intermediate coverings $W_i\to X$, indexed by the intermediate fields between the base function field and the Galois closure of the covering field; their largeness is supplied by the Chebotarev density theorem through Proposition 2.4. The probabilistic engine is Proposition 3.5, which says the gcd of the endpoint of a simple random walk on $\mathbb{Z}^d$ is bounded by $M$ with probability arbitrarily close to $1$, uniformly for all large lengths.

What would settle it

For the double cover $\pi:C\to\mathbb{A}^1$, $C:y^2=f(x)$, $\deg f>1$, count the proportion of $t\in\mathbb{F}_{q^n}$ such that $f(t)$ is a square in $\mathbb{F}_{q^n}$ (so that $\pi^{-1}(t)$ splits into two $\mathbb{F}_{q^n}$-points). The Chebotarev input predicts this proportion is bounded below by a fixed positive constant for all sufficiently large $n$; if an explicit polynomial $f$ produced an infinite sequence of $n$ for which the proportion is $o(1)$, the uniformity underlying Proposition 2.4 would fail and the paper's proof would lose its geometric engine.

Watch

Extended reading notes

Core claim

Theorem 1.1 is the central claim: for fixed $\mathbb{F}_q$ and simple simply connected algebraic group $\mathbf{G}$, if $i_1,i_2,\dots$ are independent uniform draws from $\{1,\dots,d\}$ and $w=x_{i_1}\cdots x_{i_n}$, then the probability that $w$ is geometrically almost uniform for $\mathbf{G}$ goes to $1$ as $n\to\infty$. By the established criterion, this is equivalent to the generic fiber of the word map $w:\mathbf{G}^d\to\mathbf{G}$ being geometrically irreducible. The proof splits the word population according to the gcd $\gamma(w)$ of the abelianization coordinates. For each fixed $m$, almost every word with $\gamma(w)=m$ is shown to be geometrically almost uniform: such a word map contains the image of the $m$-th power map, and a random-walk argument over $\mathbf{G}(\mathbb{F}_{q^n})^N$ with $N$ comparable to $q^n$ shows it meets every one of the large test subsets $X_{n,i}$ from Proposition 2.5. Since Proposition 3.5 bounds $\gamma(w)$ by a fixed $M$ with probability tending to $1$, the exceptional words are asymptotically negligible.

Load-bearing premise

The proof relies on a uniformity in the Chebotarev density theorem for varieties over finite fields: on a dense open set with free Galois action, the fraction of $\mathbb{F}_{q^n}$-points whose Frobenius lies in a prescribed conjugacy class is at least a fixed positive constant for all sufficiently large $n$, and if that lower bound failed for infinitely many $n$ the large test sets $X_{n,i}$ could disappear and the covering argument would not force geometric irreducibility.

Editorial extensions

If this is right

  • The set of length-$n$ words that are not geometrically almost uniform for a fixed $\mathbf{G}/\mathbb{F}_q$ has probability tending to $0$, sharpening the earlier lower bound of density $>1/3$ to density $1$.
  • Almost every random word is almost uniform simultaneously for the entire geometric family $\{\mathbf{G}(\mathbb{F}_{q^n})/Z(\mathbf{G}(\mathbb{F}_{q^n})):n\ge1\}$, which includes Suzuki and Ree groups when the root system and characteristic are fixed.
  • For each fixed $m$, almost all words whose abelianization has gcd exactly $m$ have geometrically irreducible generic fiber; the only possible rare failures are words with very large or zero gcd, and those have small probability by Proposition 3.5.
  • Random word maps of this kind are therefore a plentiful source of near-uniform distributions on finite simple groups of Lie type, matching the behavior of specially constructed words such as commutators.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same geometric sieve appears ready-made for simultaneous word maps: the paper's Question 5.3 asks whether a random $e$-tuple of words is almost uniform, and the proof structure suggests the answer should be yes whenever the exponent-sum subgroup has finite index in $\mathbb{Z}^d$, but this is an extension the paper does not claim.
  • A stronger version in which one word works for all simple simply connected groups over all finite fields (Question 5.2) would require Chebotarev uniformity across all characteristics at once; the paper leaves this open, and its method seems to demand exactly that uniformity.
  • Computationally, one could use random words rather than engineered words as near-uniform samplers on finite simple groups: the theorem says the failure rate among sampled words vanishes, so in practice a single random word of moderate length over a fixed generating tuple may be as good as a commutator word.
  • The random-walk fact about gcds (Proposition 3.5) has independent life: it says a random lattice vector from this walk is almost never divisible by a large integer, a statement that could be applied to other equations in free groups where the abelianization obstruction is the only obstruction.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proves that for a fixed simple, simply connected algebraic group G over a finite field F_q, a random word of length n in d>1 letters is geometrically almost uniform for G with probability tending to 1 as n → ∞. This improves on earlier results giving a positive proportion of such words. The proof strategy is to show that, for almost all words, the gcd of the abelianized exponent vector is bounded, and then to use a geometric criterion (Proposition 2.5) to reduce geometric almost uniformity to the existence of certain F_q^n-points in the image of the word map. The existence of these points is established by a random walk argument on a large power of the finite group of F_q^n-points, using the Maróti–Tamburini generation theorem.

Significance. If correct, Theorem 1.1 would be a striking result: it shows that geometric almost uniformity is the typical behavior for random words, even though previous constructions of such words were sparse and special. The algebro-geometric criterion linking word-map images to generic fiber irreducibility, and the use of Chebotarev density, are likely to be influential. The paper also gives a clear reduction to a gcd condition in the abelianization. However, the proof as written contains several technical gaps that affect the central claim.

major comments (3)
  1. [Section 4, paragraph beginning 'By the main theorem of [MT]'] The random walk argument is invalid because the group and the number of steps are not independent. The proof sets N := q^n and then applies Lemma 3.6 to the group G := G(F_q^n)^N, asserting that for all δ > 0 and sufficiently large n, an n-step random walk on this group lands in any subset T with probability at least (1−δ/2)|T|/|G|. Lemma 3.6 is a qualitative convergence statement for a fixed finite group G^N with fixed N; it gives no control when both the group and N grow with the step count. Moreover, the support of an n-step walk on d generators has at most d^n elements, while |G(F_q^n)^N| grows like exp(Θ(n q^n log q)), so the total variation distance from uniform is at least 1 − d^n/|G| → 1. Hence the claimed lower bound for all subsets T is false. This is a load-bearing error: the construction of T and the conclusion that the word map hits every X_{n,i} depend on this uniformity. The proof can likely be repaired by choosing a fixed field degree r, setting N = q^r, and letting the word length tend to infinity independently with a quantitative mixing bound, but this requires a substantial rewrite of Section 4.
  2. [Proposition 3.5, proof] The sentence 'Given n′ the probability that there are at least n′ steps non-zero in the projection goes to 0 as n goes to infinity' is false: for a fixed n′, the probability of at least n′ non-zero projected steps tends to 1, since the number of such steps is Binomial(n, 2/d) and grows linearly with n. The proof of Proposition 3.5 therefore does not establish the stated bound on P[X_{d,n} ∈ ⋃_{i>M} iZ^d]. This proposition is needed to bound the probability that γ(w) is large; while the statement is plausible and likely follows from Proposition 3.4 by conditioning on the non-zero steps, the argument as written must be corrected.
  3. [Proposition 2.5, equation (2.6)] The lower bound |X_{n,i}| ≥ ε q^{dim X} is justified by invoking inequality (2.3) from Proposition 2.1. However, (2.3) holds only for n divisible by an integer m that depends on the morphism W_i → X. The claim in Proposition 2.5 that (2.6) holds 'if n is sufficiently large' for all n is not established. Since the proof of Theorem 1.1 uses (2.6) for the particular n equal to the word length, this creates an additional gap that must be addressed, for instance by showing (2.6) for all large n via a direct Chebotarev argument or by restricting the theorem to a subsequence and then handling the remaining n separately.
minor comments (5)
  1. [After Lemma 3.3] There is an unexplained duplicate paragraph beginning 'Proof. The random walk on (Z/p^k Z)^2...' that appears to be a fragment of an alternative proof; it should be removed or completed and integrated.
  2. [Lemma 3.6] The notation is confusing: 'Let G_n denote the product of n i.i.d. random variables on G' should be something like 'Let W_n denote the product of n i.i.d. random variables taking values in S' to avoid conflict with the group G.
  3. [Proposition 3.5, proof] The conditioning event 'at least n′ steps which are non-zero in the projection' should be specified precisely, and the phrase claiming that the probability of this event goes to 0 should be corrected.
  4. [Section 4] The symbol n is used both for the word length and the field degree in G(F_q^n), which leads to the conflation identified in the first major comment; distinct symbols (e.g., L for word length and r for field degree) would greatly improve clarity.
  5. [Throughout] There are several typos and OCR artifacts (e.g., 'g enusg', 'd oes'), and the reference [LST] is listed as 'Annals of Math., to appear'; if it has been published, the citation should be updated.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the density-one theorem is proved from external Chebotarev and prior independent word-map criteria, not from its own conclusion.

full rationale

The paper's derivation is not circular. Theorem 1.1 asserts that the proportion of random words that are geometrically almost uniform tends to 1. The proof works by (i) recalling the known equivalence from [LST, Theorem 2] between almost-uniformity for the family G(F_q^n)/Z and geometric irreducibility of the generic fiber of the word morphism; (ii) proving a new algebro-geometric criterion (Proposition 2.5) using Serre's Chebotarev density theorem and Lang-Weil bounds; (iii) bounding the probability that the abelianization of a random word has small gcd via random-walk estimates ([LST, Proposition 3.2] and Lemmas 3.2-3.5); and (iv) applying a generating-set theorem of Maroti-Tamburini to make a large tuple of points behave independently. None of these ingredients is the theorem being proved, and no quantity is fitted so as to force the conclusion. The cited [LST] results are prior theorems with stated assumptions that do not include density-one almost uniformity; using them is legitimate external support even though one author overlaps. The proof's possible difficulty in Section 4, applying Lemma 3.6 to a sequence of groups whose order grows with n, would be a correctness gap rather than a circularity, because the desired conclusion is not assumed in any premise.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The central claim rests on standard external theorems in algebraic geometry and finite group theory. No free parameters are fitted and no new objects are postulated. The most load-bearing input is the Chebotarev density theorem for finite-field varieties, together with the prior results [LST] and [MT].

assumptions (7)
  • standard math Borel's theorem that word maps on connected semisimple algebraic groups are dominant.
    Stated in the introduction as a theorem of Borel [B]; ensures w_G is dominant so the algebro-geometric criterion applies.
  • domain assumption Equivalence between almost uniformity and geometric irreducibility of the generic fiber for word maps on G(F_{q^n}) [LST, Theorem 2].
    This is the bridge between probability and algebraic geometry; the paper's conclusion 'geometrically almost uniform' is defined via this criterion.
  • domain assumption Primitive words (gcd of abelianization coordinates equals 1) are almost uniform for every G [LST, Corollary 2.3].
    Used as the base case for the proof; the paper extends to all gcd values.
  • domain assumption Maróti-Tamburini theorem: for every finite simple group Γ and N ≤ 2√|Γ|, Γ^N has a 2-element generating set [MT].
    Used in Section 4 to produce the generating set S = {g_1,...,g_d} of G(F_{q^n})^N needed for the random walk mixing argument.
  • standard math Lang-Weil bounds, uniform in families [LS1, Proposition 3.4; Tao].
    Used in Propositions 2.1 and 2.5 to estimate point counts on varieties over F_{q^n}.
  • standard math Chebotarev density theorem for varieties over finite fields [Serre, Theorem 7].
    Central to Proposition 2.4, which produces a positive proportion of F_{q^n}-points whose Frobenius behavior distinguishes two field extensions; this powers the main avoidance argument.
  • standard math EGA IV 2 and IV 3 results on geometric irreducibility of generic fibers, Stein factorization, and uniform Lang-Weil type estimates.
    Used in Proposition 2.1 to relate K=K0 to geometric irreducibility and to estimate the image of point sets under finite morphisms.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Most Words are Geometrically Almost Uniform." pith.science (2026). https://pith.science/paper/UTZYT5ZC

@misc{pith2026190807287,
  author       = {Pith},
  title        = {Pith review of: Most Words are Geometrically Almost Uniform},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UTZYT5ZC}},
  note         = {Machine review of arXiv:1908.07287}
}
read the original abstract

If w is a word in d>1 letters and G is a finite group, evaluation of w on a uniformly randomly chosen d-tuple in G gives a random variable with values in G, which may or may not be uniform. It is known that if G ranges over finite simple groups of given root system and characteristic, a positive proportion of words w give a distribution which approaches uniformity in the limit as |G| goes to infinity. In this paper, we show that the proportion is in fact 1.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    29 (1983), 151--164

    Armand Borel: On free subgroups of semisimple groups, Enseign.\ Math. 29 (1983), 151--164

    work page 1983

  2. [2]

    Deligne, La conjecture de Weil

    P. Deligne, La conjecture de Weil. II,

    work page

  3. [3]

    Shelly Garion and Aner Shalev: Commutator maps, measure preservation, and T -systems, Trans. Amer. Math. Soc. 361 (2009), 4631--4651

    work page 2009

  4. [4]

    Alexandre Grothendieck,

    work page

  5. [5]

    Alexandre Grothendieck, \'El\'ements de g\'eom\'etrie alg\'ebrique. IV. \'Etude locale des sch\'emas et des morphismes de sch\'emas. II. Inst. Hautes \'Etudes Sci. Publ. Math. No. 24 , 1965

    work page 1965

  6. [6]

    Alexandre Grothendieck, \'El\'ements de g\'eom\'etrie alg\'ebrique. IV. \'Etude locale des sch\'emas et des morphismes de sch\'emas. III. Inst. Hautes \'Etudes Sci. Publ. Math. No. 28 , 1966

    work page 1966

  7. [7]

    AAlexandre Grothendieck,

    work page

  8. [8]

    Michael Larsen: How often is a permutation an n'th power? arXiv: math/9712223

    work page Pith review arXiv

Show all 24 references
  1. [9]

    Philip Hall: The Eulerian Function of a Group, Quart.\ J.\ Math.\ Oxford, Vol.\ os-7, No.\ 1 (1936), 134--151

    1936

  2. [10]

    Michael Larsen: How random are word maps? Thin groups and superstrong approximation, 141--149, Math. Sci. Res. Inst. Publ., 61, Cambridge Univ. Press, Cambridge, 2014

    2014

  3. [11]

    Michael Larsen and Aner Shalev, Word maps and Waring type problems,

  4. [12]

    Larsen and A

    M. Larsen and A. Shalev, Fibers of word maps and some applications,

  5. [13]

    Michael Larsen and Aner Shalev: Fibers of word maps and some applications, J.\ Algebra 354 (2012), 36--48

    2012

  6. [14]

    Michael Larsen and Aner Shalev: On the distribution of values of certain word maps, Trans. Amer. Math. Soc. 368 (2016), 1647--1661

    2016

  7. [15]

    Michael Larsen, Aner Shalev, and Pham Huu Tiep: Probabilistic Waring problems for finite simple groups, Annals of Math., to appear

  8. [16]

    With a chapter by James G

    David Levin, Yuval Peres, and Elizabeth Wilmer: Markov chains and mixing times. With a chapter by James G. Propp and David B. Wilson. American Mathematical Society, Providence, RI, 2009

    2009

  9. [17]

    Martin Liebeck and Aner Shalev: Fuchsian groups, finite simple groups, and representation varieties Invent. Math. 159 (2005), 317--367

    2005

  10. [18]

    J.\ Amer.\ Math.\ Soc

    Alexander Lubotzky and Chen Meiri: Sieve methods in group theory I: Powers in linear groups. J.\ Amer.\ Math.\ Soc. 25 (2012), no.\ 4, 1119--1148

    2012

  11. [19]

    Comm.\ Algebra 41 (2013), no.\ 1, 34--49

    Attila Mar\'oti and Maria Chiara Tamburini: A solution to a problem of Wiegold. Comm.\ Algebra 41 (2013), no.\ 1, 34--49

    2013

  12. [20]

    Electron.\ J.\ Combin

    Nicolas Pouyanne: On the number of permutations admitting an m-th root. Electron.\ J.\ Combin. 9 (2002), no.\ 1, Research Paper 3, 12 pp

    2002

  13. [21]

    Bull.\ Lond.\ Math.\ Soc

    Ori Parzanchevski and Gili Schul: On the Fourier expansion of word maps. Bull.\ Lond.\ Math.\ Soc. 46 (2014), no.\ 1, 91--102

    2014

  14. [22]

    1965 Arithmetical Algebraic Geometry (Proc

    Jean-Pierre Serre: Zeta and L functions. 1965 Arithmetical Algebraic Geometry (Proc. Conf. Purdue Univ., 1963), pp. 82--92, Harper & Row, New York

    1965

  15. [23]

    Erd os centennial, 611--649, Bolyai Soc.\ Math.\ Stud., 25, J\'anos Bolyai Math.\ Soc., Budapest, 2013

    Aner Shalev: Some results and problems in the theory of word maps. Erd os centennial, 611--649, Bolyai Soc.\ Math.\ Stud., 25, J\'anos Bolyai Math.\ Soc., Budapest, 2013

    2013

  16. [24]

    Terence Tao: The Lang-Weil Bound, https: //terrytao.wordpress.com/ 2012/08/31/the-lang-weil-bound/

    2012

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.