Pith. sign in

REVIEW 3 major objections 4 minor 30 references

A group-action Szemer\'edi-Trotter theorem and applications to orchard problems in all characteristics

T0 review · 3 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read Over every field, a group-action incidence theorem with a power saving applies to linear groups and controls collinear triples on planes and quadrics.

desk verdict The main theorem is false as stated: the char 0 clause of Fact 2.2 is wrong, and A5 gives a counterexample to Theorem 1.3. read the letter →

arxiv 2411.13084 v2 pith:VIHMQMJ5 submitted 2024-11-20 math.CO

Yifan Jing , Tingxiang Zou This is my paper · ORCID
classification math.CO MSC 20G1551A0511D45
keywords groupactionSzemerédi–Trottertheoremcollineartriplesfinitefieldsapproximategroupsproductorchardproblemcubicsurfaces
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 establishes a group-action form of the Szemerédi–Trotter theorem that works over every field, including finite fields of every characteristic. The theorem says that for any subgroup of a general linear or projective general linear group acting on a set, if a generating set S is large relative to a set X, avoids certain nilpotent-by-finite subgroups, and most k-tuples of X have trivial stabilizer, then the number of pairs (x,y) in X with y = gx for some g in S is O(|X|^{1-\delta}|S|). This extends the known result for SL2 over prime fields and makes the earlier characteristic-zero version effective. The authors apply it to count collinear triples on three planes and on quadric surfaces, obtaining power-saving upper bounds over all characteristics.

What carries the argument

The engine is an L2-flattening theorem for symmetric probability measures on linear groups. If a symmetric measure fails to flatten under convolution, a noncommutative Balog–Szemerédi–Gowers theorem produces a large approximate subgroup; the product theorem for linear groups over every field (any finite approximate subgroup of GL_n(K) is covered by $K^{{O_n(1)}}$ cosets of a subgroup Gamma for which Gamma/D is nilpotent of step at most n−1 and D lies in a bounded power of the subgroup) then forces the measure to concentrate on a nilpotent-by-finite subgroup. The hypotheses of the main theorem forbid that concentration, so repeated self-convolution flattens the measure, and the flattened measure yields the power-saving incidence bound. To reach the orchard applications, collinearity is encoded as a group action: on three planes it becomes the action of the semidirect product G_a(K)^2 ⋊ G_m(K), and on a smooth quadric it becomes the action of the projective orthogonal group PO_4(K), whose subgroup structure lets the authors verify the escape condition.

What would settle it

A concrete falsifier would be finite sets X1, X2, X3 meeting all hypotheses of Theorem 1.4 — equal size, |Xi| less than $p^{{1/N}}$ in positive characteristic, and no line containing more than |Xi|^{1−epsilon} points — yet having at least c|X1|^2 collinear triples. A second, more fundamental falsifier would be a finite approximate subgroup of GL_n(K) over any field that cannot be covered by $K^{{O(1)}}$ cosets of a bounded-step nilpotent-by-finite subgroup.

Watch

Extended reading notes

Core claim

The central claim is the group-action Szemerédi–Trotter theorem over arbitrary fields: for every n, positive epsilons, r, and k, there are N and delta such that whenever G is a subgroup of GL_n(K) or PGL_n(K) acting on a set T and finite sets S and X satisfy that S generates G, log|X| is comparable to log|S|, S does not concentrate in subgroups that become nilpotent of step at most n−1 after factoring out a subgroup contained in a bounded power of S, and at most |X|^{k−ε3} k-tuples of X have nontrivial stabilizer, then the number of triples (x,y,g) with x,y in X, g in S, and x = gy is at most |X|^{1−δ}|S|. Two theorems give two packages of assumptions: one for possibly finite G with a smallness condition on X, and one with a stronger escape condition that removes the size condition. The paper also proves that these incidence bounds imply power-saving upper bounds for collinear triples on three planes in P3 and on smooth quadrics, over all fields in the plane case and over C and all finite fields in the quadric case.

Load-bearing premise

The argument rests on the product theorem: any finite approximate subgroup of GL_n(K) over any field is covered by few cosets of a subgroup whose quotient by a bounded-power subgroup is nilpotent of step at most n−1; if that structural statement failed for even one field, the flattening argument and hence the main incidence theorems would fail.

Editorial extensions

If this is right

  • Incidence theorems for linear-group actions now hold uniformly over finite fields and characteristic zero, so incidence-geometry arguments that previously required real or complex numbers can be repeated over F_p without losing the power saving.
  • The orchard bound for collinear triples on three non-common-line planes holds for every field under a line-avoidance condition and a smallness condition relative to the characteristic, directly extending the known characteristic-zero result.
  • For smooth quadrics, the same power-saving bound holds uniformly for all finite fields and for C, giving an orchard-type theorem in all characteristics.
  • The proof is effective, with delta exponentially dependent on epsilon, so the theorem can in principle be made quantitative; the question whether delta can depend linearly on epsilon remains open.
  • Because PGL_n(K) embeds in GL_{n^2}(K), the main theorem automatically covers projective group actions, including the standard PGL2 action on the projective line and the hyperbola incidence bound as a special case.

Reading between the lines

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

  • The authors note that the size bound |X| < p^{1/N} in the orchard theorems is likely not intrinsic; a better product theorem or a different flattening might make N a fixed absolute constant, and the same proof strategy would then remove that restriction.
  • The same group-action encoding could be applied to other surfaces or configurations where collinearity is governed by a linear group with well-understood subgroup structure; the three-plane and quadric cases are the first two examples.
  • If a polynomial-in-epsilon dependence for delta becomes available, the bounds in both orchard theorems improve and the method's conclusions change quantitatively without any new structural idea.
  • For finite fields, the escape-from-nilpotent condition in the quadric case is reduced via subgroup classification to escape from abelian subgroups of PO4(K); a similar reduction for other algebraic groups could make the theorem applicable to broader incidence problems.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 4 minor

Summary. The paper claims a group-action generalization of the Szemerédi-Trotter theorem: for G a subgroup of GL_n(K) or PGL_n(K) over an arbitrary field K, if S generates G, log|X| and log|S| are comparable, S avoids 'nilpotent-by-finite' subgroups in a precise sense, and most k-tuples of X have trivial stabilizer, then the number of pairs (x,y) in X with y = gx for some g in S is O(|X|^{1-δ}|S|). This is then applied to count collinear triples on three planes and on a smooth quadric in P^3, over all characteristics, improving a prior result of Bays-Dobrowolski-Zou. The proofs use the standard Bourgain-Gamburd L2-flattening scheme, with the Eberhard-Murphy-Pyber-Szabó product theorem as the key external input, and include self-contained appendices for the Balog-Szemerédi-Gowers lemma.

Significance. If the main theorem were correct, it would provide a substantial and natural extension of Bourgain's SL_2(F_p) incidence theorem to all linear groups over all fields, with effective exponents. The orchard-problem applications are interesting and the paper helpfully includes explicit examples showing that several hypotheses are necessary. The L2-flattening framework and the inclusion of a full proof of the nonabelian BSG lemma are strengths. However, the central theorem is false as stated for characteristic 0, due to a specific error in the stated product theorem, and the applications rely on that false theorem. The paper cannot be accepted until the main theorem and the applications are substantially reworked.

major comments (3)
  1. [Section 2.1, Fact 2.2] The clause 'Moreover, when char(K)=0, D is trivial' is false. For K=C and G=GL_3(C), the alternating group A5, embedded irreducibly, is a 1-approximate group (symmetric, A^2=A). If the conclusion of Fact 2.2 held with D trivial, the covering approximate group Γ would have to equal A5 and Γ/D=A5 would be nilpotent of step at most 2, contradicting that A5 is nonabelian simple. The same obstruction occurs for any finite non-nilpotent subgroup of GL_n(C). Consequently, the later definition D={{id}} in characteristic 0, used in Theorem 2.3 and in Theorems 1.2 and 1.3, is unjustified. This is not a harmless simplification: it changes the escape conditions from 'nilpotent-by-finite' to merely 'nilpotent', which is exactly the type of hypothesis that cannot be checked for finite non-nilpotent subgroups like A5 or dihedral groups of odd index.
  2. [Section 3, Theorem 1.3] Because of the false clause in Fact 2.2, Theorem 1.3 is false in characteristic 0. A concrete counterexample: take n=3, K=C, ε2=0.1, r=2, k=2, any ε3<2. Let G be the dihedral group D_m of order 2m embedded in GL_3(C) via the 2-dimensional real representation plus a trivial character, with m=100. Set S=G and let X=G, with G acting on itself by left multiplication. Then log|X|≈5.3 and log|S|≈5.3, so (1) holds. The only nilpotent subgroups of D_m are cyclic of order dividing m, and for m=100 we have m < (2m)^{1-ε2}, so (2) holds. Since the action is free, (3) holds. But the number of pairs (x,y) with y=gx is exactly |X|^2, contradicting the claimed bound |X|^{1-δ}|S| for any δ>0. Thus Theorem 1.3 is unsound. The same construction also shows that Theorem 2.3 cannot be true with D={{id}} in characteristic 0.
  3. [Section 5, Theorem 5.11] Even if the escape conditions in Theorem 1.3 were corrected to include non-trivial finite normal subgroups D in characteristic 0, the verification for the quadric application is incomplete. The proof of Theorem 5.11 only establishes escape from abelian subgroups H (via Lemma 5.8) and from nilpotent subgroups of step at most 3 (via Lemma 5.6). A corrected theorem would need to handle all subgroups H with some D ⊆ (S^{-1}S)^N, D ◁ H, and H/D nilpotent; in characteristic 0 this includes finite non-abelian subgroups such as A5 × A5 in PSO_4(C). Lemma 5.8 does not address such subgroups, and the manuscript offers no alternative argument. Hence the orchard application is not proved even conditional on a repaired group-action theorem.
minor comments (4)
  1. [Section 2.1] The term 'K-approximate group' is used without definition. Please give the standard definition (symmetric, contains identity, and A^2 is covered by K left translates of A) at first use.
  2. [Section 3, around (3.13)] The notation for the reflected measure ilde{\mu}_S is typeset as 'fµS' in several places. This should be fixed for readability.
  3. [Section 4, Lemma 4.2] The exponent |X_1|^{3-(15/4)δ} in the claim on |A| is unusual, although it may be correct. Please double-check the arithmetic one more time; the intermediate bounds might be clearer if the constants were named explicitly.
  4. [Section 1, footnote i] The footnote correctly cites Jordan's theorem, but it does not justify setting D={id} in characteristic 0; this is precisely the point where the proof diverges from the actual product theorem.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the incidence theorems and applications are derived from stated hypotheses plus external product-theorem inputs, with no fitted parameter renamed as a prediction.

full rationale

The paper's derivation chain is self-contained in the relevant sense. Theorem 2.3 is an L2-flattening statement proved from the Balog–Szemeredi–Gowers theorem (Theorem 2.1) and the Eberhard–Murphy–Pyber–Szabo product theorem (Fact 2.2), both cited from prior work rather than assumed in a form that already contains the target incidence bound. Theorems 1.2 and 1.3 then proceed by contradiction: assuming many group-action incidences, the measure-concentration argument yields a large approximate subgroup violating the non-concentration/non-nilpotent-by-finite hypotheses. There is no step where a quantity is fitted to the data and then reported as a prediction; the constants N and delta are chosen from the hypotheses, not tuned to force the conclusion. The applications in Sections 4 and 5 verify the escape-from-nilpotent-subgroups and trivial-stabilizer conditions for the specific geometric group actions, then invoke Theorem 1.3; this is a standard reduction, not a circular one. The only self-reference is the comparison with, and improvement of, the earlier model-theoretic result [BDZ22], which is used as a benchmark and prior context rather than as the load-bearing premise of the proof. The skeptic's concern about Fact 2.2's characteristic-0 clause (finite non-nilpotent subgroups such as A5 in GL3(C) making D nontrivial) is an objection to the correctness of an imported external theorem or its statement, not a circularity of the paper's own derivation: the paper does not define D in terms of the conclusion, and it does not derive the product theorem from its own incidence result. Accordingly, no specific circular reduction can be exhibited from the paper's equations, and the honest finding is score 0.

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

No free parameters fitted to data; the proof introduces explicit constants depending on epsilon, but these are existential bounds rather than fitted values. The central incidence theorems rely on a small number of powerful external structure theorems, chiefly EMPS21's product theorem, Larsen-Pink, and Jordan/Dickson classifications.

assumptions (6)
  • domain assumption Fact 2.2 (Eberhard-Murphy-Pyber-Szabó product theorem): every finite approximate subgroup A of GL_n(K) over every field is covered by K^{O_n(1)} cosets of a subgroup Gamma with Gamma/D nilpotent of step at most n-1 and D contained in A^{O_n(1)}; D is trivial in characteristic 0.
    Invoked in Section 2 to convert approximate subgroups into nilpotent-by-finite structure; this is the central structural tool for the L2-flattening result and both main theorems.
  • standard math Balog-Szemerédi-Gowers theorem for sets (Fact A.2) and Tao's approximate group facts (Fact A.3).
    Used in the appendix to prove the measure version of the Balog-Szemerédi-Gowers theorem (Theorem 2.1), a standard ingredient in flattening arguments.
  • standard math Larsen-Pink theorem (Fact 5.4) on the structure of finite subgroups of GL_n(K).
    Used in Lemma 5.5 to control large nilpotent subgroups of PO4(K) over finite fields.
  • standard math Jordan's theorem and Dickson's classification of subgroups of PSL2(K).
    Used in Lemmas 5.6 and 5.7 to produce abelian subgroups of bounded index in nilpotent subgroups of PO4(C) and PO4(F_q).
  • standard math Artin's theorem on PO4(K) and POmega4(K) isomorphism to PSL2(K) times PSL2(K) with bounded index.
    Used in Lemma 5.7 to reduce nilpotent subgroups of PO4(K) to products of subgroups of PSL2(K).
  • standard math Jacobson's classification of quadratic forms over finite fields.
    Used in Theorem 5.11 to reduce the smooth quadric to the standard form x1^2+x2^2+x3^2+x4^2=0 over an extension field.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A group-action Szemer\'edi-Trotter theorem and applications to orchard problems in all characteristics." pith.science (2026). https://pith.science/paper/VIHMQMJ5

@misc{pith2026241113084,
  author       = {Pith},
  title        = {Pith review of: A group-action Szemer\'edi-Trotter theorem and applications to orchard problems in all characteristics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VIHMQMJ5}},
  note         = {Machine review of arXiv:2411.13084}
}
abstract

We establish a group-action version of the Szemer\'edi-Trotter theorem over any field, extending Bourgain's result for the group $\mathrm{SL}_2(k)$. As an Elekes-Szab\'o-type application, we obtain quantitative bounds on the number of collinear triples on reducible cubic surfaces in $\mathbb{P}^3(k)$, where $k = \mathbb{F}_{q}$ and $k = \mathbb{C}$, thereby improving a recent result by Bays, Dobrowolski, and the second author.

Figures

Figures reproduced from arXiv: 2411.13084 by the authors.

Figure 1
Figure 1. γx maps y to z when x, y, z are collinear. The following lemma, originally stated in [BDZ22, Lemma 4.7], assists in determining the group structure, and we include it here for completeness [PITH_FULL_IMAGE:figures/full_fig_p015_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 22 canonical work pages

  1. [1]

    Artin, Geometric algebra, Wiley Classics Library, John Wiley & Sons, Inc., New York, 1988, Reprint of the 1957 original, A Wiley-Interscience Publication

    E. Artin, Geometric algebra, Wiley Classics Library, John Wiley & Sons, Inc., New York, 1988, Reprint of the 1957 original, A Wiley-Interscience Publication. 1009557

    work page 1988

  2. [2]

    Martin Bays and Emmanuel Breuillard, Projective geometries arising from E lekes- S zab\' o problems , Ann. Sci. \' E c. Norm. Sup\' e r. (4) 54 (2021), no. 3, 627--681. 4311096

    work page 2021

  3. [3]

    Martin Bays, Jan Dobrowolski, and Tingxiang Zou, E lekes- S zab \' o for collinearity on cubic surfaces , arXiv:2212.14059 (2022)

    work page arXiv 2022

  4. [4]

    Stefan A Burr, Branko Gr \"u nbaum, and Neil JA Sloane, The orchard problem, Geometriae Dedicata 2 (1974), 397--424

    work page 1974

  5. [5]

    Jean Bourgain, Alexander Gamburd, and Peter Sarnak, Markoff triples and strong approximation, C. R. Math. Acad. Sci. Paris 354 (2016), no. 2, 131--135. 3456887

    work page 2016

  6. [6]

    Emmanuel Breuillard, Ben Green, and Terence Tao, Approximate subgroups of linear groups, Geom. Funct. Anal. 21 (2011), no. 4, 774--819. 2827010

    2011

  7. [7]

    , The structure of approximate groups, Publ. Math. Inst. Hautes \' E tudes Sci. 116 (2012), 115--221. 3090256

    2012

  8. [8]

    Jean Bourgain, A modular S zemer\' e di- T rotter theorem for hyperbolas , C. R. Math. Acad. Sci. Paris 350 (2012), no. 17-18, 793--796. 2989378

    work page 2012

Show all 30 references
  1. [9]

    (N.S.) 26 (2020), no

    Artem Chernikov, David Galvin, and Sergei Starchenko, Cutting lemma and Z arankiewicz's problem in distal structures , Selecta Math. (N.S.) 26 (2020), no. 2, Paper No. 25, 27. 4079189

    2020

  2. [10]

    Sean Eberhard, Brendan Murphy, L \'a szl \'o Pyber, and Endre Szab \'o , Growth in linear groups, arXiv:2107.06674 (2021)

    2021 arXiv

  3. [11]

    5, 537--571

    Gy\" o rgy Elekes and Endre Szab\' o , How to find groups? (and how to use them in E rd o s geometry?) , Combinatorica 32 (2012), no. 5, 537--571. 3004808

    2012

  4. [12]

    , On T riple L ines and C ubic C urves: T he O rchard P roblem R evisited , Discrete Comput. Geom. 72 (2024), no. 2, 743--763. 4800740

    2024

  5. [13]

    Jacob Fox, J\'anos Pach, Adam Sheffer, Andrew Suk, and Joshua Zahl, A semi-algebraic version of Z arankiewicz's problem , J. Eur. Math. Soc. (JEMS) 19 (2017), no. 6, 1785--1810. 3646875

    2017

  6. [14]

    Ben Green, Quadratic forms in 8 prime variables, arXiv:2108.10401 (2021)

    2021 arXiv

  7. [15]

    2, 409--468

    Ben Green and Terence Tao, On sets defining few ordinary lines, Discrete & Computational Geometry 50 (2013), no. 2, 409--468

    2013

  8. [16]

    , On sets defining few ordinary lines, Discrete Comput. Geom. 50 (2013), no. 2, 409--468. 3090525

    2013

  9. [17]

    H. A. Helfgott, Growth and generation in SL _2( Z/p Z) , Ann. of Math. (2) 167 (2008), no. 2, 601--623. 2415382

    2008

  10. [18]

    Huppert, Endliche G ruppen

    B. Huppert, Endliche G ruppen. I , Die Grundlehren der mathematischen Wissenschaften, vol. Band 134, Springer-Verlag, Berlin-New York, 1967. 224703

    1967

  11. [19]

    I , second ed., W

    Nathan Jacobson, Basic algebra. I , second ed., W. H. Freeman and Company, New York, 1985. 780184

    1985

  12. [20]

    Larsen and Richard Pink, Finite subgroups of algebraic groups, J

    Michael J. Larsen and Richard Pink, Finite subgroups of algebraic groups, J. Amer. Math. Soc. 24 (2011), no. 4, 1105--1158. 2813339

    2011

  13. [21]

    Brendan Murphy, Upper and lower bounds for rich lines in grids, Amer. J. Math. 143 (2021), no. 2, 577--611. 4234975

    2021

  14. [22]

    J\'anos Pach and Micha Sharir, On the number of incidences between points and curves, Combin. Probab. Comput. 7 (1998), no. 1, 121--127. 1611057

    1998

  15. [23]

    L\' a szl\' o Pyber and Endre Szab\' o , Growth in finite simple groups of L ie type , J. Amer. Math. Soc. 29 (2016), no. 1, 95--146. 3402696

    2016

  16. [24]

    I. D. Shkredov, On asymptotic formulae in some sum--product questions, Transactions of the Moscow Mathematical Society 79 (2018), 231--281

    2018

  17. [25]

    2, 329--345

    , On an application of higher energies to S idon sets , Combinatorica 43 (2023), no. 2, 329--345. 4627312

    2023

  18. [26]

    Trotter, Jr., Extremal problems in discrete geometry, Combinatorica 3 (1983), no

    Endre Szemer\' e di and William T. Trotter, Jr., Extremal problems in discrete geometry, Combinatorica 3 (1983), no. 3-4, 381--392. 729791

    1983

  19. [27]

    I , Grundlehren der Mathematischen Wissenschaften, vol

    Michio Suzuki, Group theory. I , Grundlehren der Mathematischen Wissenschaften, vol. 247, Springer-Verlag, Berlin-New York, 1982, Translated from the Japanese by the author. 648772

    1982

  20. [28]

    5, 547--594

    Terence Tao, Product set estimates for non-commutative groups, Combinatorica 28 (2008), no. 5, 547--594. 2501249

    2008

  21. [29]

    Discrete Math

    , Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets, Contrib. Discrete Math. 10 (2015), no. 1, 22--98. 3386249

    2015

  22. [30]

    Walsh, The polynomial method over varieties, Invent

    Miguel N. Walsh, The polynomial method over varieties, Invent. Math. 222 (2020), no. 2, 469--512. 4160873

    2020

Pith tools

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