REVIEW 2 major objections 4 minor 55 references
Coordinate recognition: General theory, Groups, and other surprises
T0 review · 2 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash
Pith's one-line read Reduced-product rigidity reduces to one first-order formula
desk verdict Main characterization likely true but proof of Proposition 3.5 has a false saturation claim; needs a fix before the theorem is fully established. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing object is the relative support function, which sends a pair of elements of a reduced product to the set of coordinates on which they differ modulo the ideal. The syntactic side is the class of h-formulas: the smallest class of formulas containing the atomic formulas and closed under conjunction, existential and universal quantification, and the operation $(\exists x)\varphi\wedge(\forall x)(\varphi\rightarrow\psi)$. These formulas have the property that their truth in a reduced product is decided by a 'large' set of coordinates, which lets a single h-formula express the inclusion of supports. The proof that recognizing coordinates forces the support function to be definable runs through saturated ultrapowers: under the Continuum Hypothesis two elementarily equivalent saturated ultrapowers of the reduced product give an automorphism that must respect coordinates, and an absoluteness argument removes the CH and cardinality assumptions. The converse direction interprets the quotient Boolean algebra from the definable support relation and then reads off the coordinate-respecting quotient maps.
What would settle it
Take $\mathcal{C}=\{S_3,\mathrm{SL}(2,5)\}$. The paper proves that any class containing both groups does not recognize coordinates; if a syntactic search over h-formulas of increasing quantifier depth in $\mathrm{Th}(\mathcal{C})$ produced an h-formula equivalent to $x=x'\rightarrow y=y'$, then Theorem 3.8's equivalence between coordinate recognition and the syntactic condition would be refuted. More directly, inspect the proof of Proposition 3.5 for the class of all linear orders without endpoints: the paper supplies an explicit h-formula for $x=x'\rightarrow y=y'$, so the definability of the support function in every reduced product over $\mathbb{N}$ is directly checkable, and any ideal on $\mathbb{N}$ where that definability failed would falsify the main theorem.
Extended reading notes
Core claim
The paper's central claim is Theorem 3.8: for a countable language $L$ and a full class $\mathcal{C}$ of $L$-structures, the following are equivalent: $\mathcal{C}$ recognizes coordinates; $\mathcal{C}$ recognizes coordinates when the index set is restricted to $\mathbb{N}$; every reduced product over an arbitrary ideal interprets the quotient Boolean algebra together with all quotient maps; every such reduced product interprets the Boolean algebra together with the relative support function; the formula $x=x'\rightarrow y=y'$ is equivalent to an h-formula in $\mathrm{Th}(\mathcal{C})$; and the formula $x=z\rightarrow y=z$ is equivalent to an h-formula in $\mathrm{Th}(\mathcal{C})$. In the authors' framing, this makes 'recognizes coordinates' a first-order syntactic property of a single formula, rather than a property that has to be checked product-by-product. For uncountable languages, the equivalence between recognizing coordinates and the semantic conditions (3)–(5) remains intact. The theorem also implies that recognizing coordinates is preserved by passing from $\mathcal{C}$ to the class of all models of $\mathrm{Th}(\mathcal{C})$.
Load-bearing premise
The load-bearing premise is that a statement about all reduced products over $\mathbb{N}$ proved using the Continuum Hypothesis and saturated ultrapowers remains valid in ordinary ZFC; the paper cites this absoluteness transfer instead of writing it out, and the equivalence between coordinate recognition and the syntactic h-formula condition stands on it.
Editorial extensions
If this is right
- For every class that recognizes coordinates, the forcing axioms used in the paper imply that any isomorphism between reduced products over the ideal of finite sets is trivial: it is lifted by a bijection between cofinite sets and coordinatewise isomorphisms.
- In particular, every automorphism of the reduced product of finite symmetric groups $S_n$ for $n\geq 3$ over the finite-set ideal lifts to an automorphism of the ordinary product, and analogous lifting holds for reduced products of $\mathrm{SL}(n,F)$ with $|F|\geq 4$, free products, and graph products covered by Theorem 4.6.
- Reduced products whose class recognizes coordinates admit the full quantifier-elimination language from the classical reduced-product theorem as a definable expansion once a fundamental set of h-formulas exists; explicit definable quantifier elimination is obtained for reduced powers of $S_n$ with $n\geq 4$ and $n\neq 6$, and for $S_3$.
- The property is theory-level: a full class $\mathcal{C}$ recognizes coordinates exactly when the class of all models of $\mathrm{Th}(\mathcal{C})$ does, and every model of the theory of an atomless reduced product 'thinks' it is a reduced product with a definable support structure.
- Many concrete classes of groups recognize coordinates—simple groups, finite symmetric groups of degree at least 3, odd dihedral groups, $\mathrm{SL}(n,F)$ for $n\geq 2$ and $|F|\geq 4$, all nontrivial free products, and graph products with connected complement—so the rigidity and quantifier-elimination corollaries apply uniformly to these classes.
Reading between the lines
- Editorial inference: because the characterization is stated at the level of $\mathrm{Th}(\mathcal{C})$, coordinate recognition is invariant under elementary equivalence of the underlying class; this suggests the dividing line, if one exists, should be visible in the lattice of interpretable quotients of a single saturated model of $\mathrm{Th}(\mathcal{C})$.
- Editorial inference: the paper's $|L|$-compactness result suggests that checking recognition on subclasses of size $|L|$ is sufficient; a natural testable strengthening would be to ask whether the witnessing h-formula can always be chosen uniformly from a fundamental set of formulas for $\mathrm{Th}(\mathcal{C})$.
- Editorial inference: the failure of compactness in Theorem 7.1 indicates that coordinate recognition does not behave like a stable first-order property under unions of theories; it may be more natural to study it as a property of theories in the interpretability lattice, where the non-recognizing union phenomenon corresponds to conflicting support definitions.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This paper studies the notion, introduced in the authors' earlier work [10], of a class C of L-structures recognizing coordinates: every isomorphism between reduced products of structures in C is 'isomorphically coordinate respecting.' The central result, Theorem 3.8, gives for countable L and full C an equivalence between recognition of coordinates, recognition over N-indexed reduced products, uniform interpretability of the quotient Boolean algebra P(I)/I together with the quotient structures and projections, interpretability of the relative support function, and the purely syntactic condition that x=x' -> y=y' be equivalent to an h-formula in Th(C). From this the paper derives group-theoretic classifications (simple groups, symmetric groups, dihedral groups, free products, graph products, and others recognize coordinates; decomposable groups, nilpotent groups, and others do not), limiting examples showing failure of compactness, quantifier-elimination consequences, and rigidity corollaries under forcing axioms.
Significance. Should the main equivalence hold, this is a substantial conceptual result: it converts a semantic rigidity property of arbitrary reduced products into a first-order syntactic property of a single formula, and it explains and extends earlier rigidity results for quotients. The paper also contains useful tools: a detailed analysis of h-formulas, support-function definability, a folklore Feferman-Vaught reformulation, and an extensive catalogue of group-theoretic examples and non-examples. The limiting examples in Theorem 7.1 are particularly informative. A notable strength is that the paper gives explicit h-formulas for many of the positive group examples, making the criterion concrete. However, the proof of the main implication (2)->(4) in Theorem 3.8 contains a false saturation assertion and a terse absoluteness transfer; because this implication is load-bearing for the rest of the paper, the manuscript requires revision before the central claim can be regarded as established.
major comments (2)
- [3.2, Proposition 3.5] The proof of Proposition 3.5 asserts: 'If CH holds and all M_i as well as N have cardinality no greater than 2^{aleph0}, then the ultrapowers U(N,s1), U(M,supp), and U(N,s2) have cardinality 2^{aleph0} and are aleph1-saturated.' This is not true for an arbitrary nonprincipal ultrafilter U on N. Aleph1-saturation of an ultrapower requires U to be aleph1-good (or at least sufficiently good); CH guarantees the existence of such ultrafilters but does not make every nonprincipal ultrafilter on N aleph1-good. Since no particular U is chosen afterwards, the existence of the isomorphisms sigma and tau in (3.3) is not justified. Consequently the Beth-definability argument for support definability under CH is incomplete, and because Lemma 3.6 transfers only statements actually proved under ZFC+CH, this gap propagates to the ZFC conclusion and to implication (2)->(4) of Theorem 3.8. The argument is likely repairable by fixing an aleph1-good nonprincipal ultrafilter on N in the CH case and checking the cardinality conditions, but as written this load-bearing step is not proved.
- [3.2, end of Proposition 3.5 and Lemma 3.6] The removal of the cardinality restrictions is left as a sketch with a footnote. The Beth argument proves support definability only for reduced products whose factors and the auxiliary elementary extension N satisfy |M_i| <= 2^{aleph0} and |N| <= 2^{aleph0}; the statement theta_psi transferred by Lemma 3.6 has no such restriction. The text says that the Feferman-Vaught theorem makes C closed under elementary equivalence and then applies Lemma 3.6, but it does not spell out why the restricted CH statement suffices for a fixed M after the Levy collapse, nor how an arbitrary elementary extension N is replaced by one of size at most 2^{aleph0} (for instance, by passing to a small elementary substructure containing the finitely many parameters under consideration). Without this, the ZFC transfer of the main implication is not fully verifiable.
minor comments (4)
- [5.2, proof of Theorem 5.3] In the proof of item (b), the reference to 'Theorem 5.1 (2)' appears incorrect: the case of a nontrivial homomorphism into a center is condition (1) of Theorem 5.1, while condition (2) concerns decomposable products.
- [4.6, proof of Proposition 4.28] The proof begins 'Let Let G' with a duplicated word; this should be corrected.
- [7.4, Proposition 7.6] The sentence 'This is clearly a preorder: for all x,y,z in M x<y<z' has garbled notation; the intended statement is the transitivity of the relation defined by the displayed formula.
- [7.4, Lemma 7.10] Lemma 7.10 is stated for arbitrary groups G and H, but its proof uses saturation of the reduced power of Z(H) over Fin via [9, Theorem 1], which in the introduction is applied to reduced products of countable structures; the cardinality hypotheses needed for the cited theorem should be stated.
Circularity Check
No circular derivation found; the main equivalence is proved from definitions and independent syntactic/model-theoretic lemmas.
full rationale
The central characterization, Theorem 3.8, is not circular. The notion of recognizing coordinates is imported from the authors' earlier paper [10], but the equivalence with the h-formula condition is established through a chain of independent steps: Theorem 2.16 connects interpretability of the relative support function to the syntactic equivalence of x=x' -> y=y' with an h-formula in Th(C), using Omarov's Proposition 2.10 and the construction in Lemma 2.17; Lemma 3.3 shows that definability of the support relation forces coordinate-respecting isomorphisms; Proposition 3.5 proves the converse implication (2)->(4) via Beth definability, ultrapowers, and a forcing absoluteness transfer. The target rigidity property is used as the hypothesis of the implication, not assumed in the conclusion. Citations to the authors' earlier work occur (e.g., [10] for the definition and rigidity corollaries, and [9] for saturation/absoluteness), but these are not load-bearing for the main characterization: the cited facts are either definitions, external lemmas, or applications, and the central proof does not reduce to a self-citation. The skeptical observation about the false claim that every nonprincipal ultrafilter under CH yields aleph-1-saturated ultrapowers is a genuine correctness gap in the proof of Proposition 3.5, but it is not a circularity: saturation is an external model-theoretic property, not an input that definitionally entails the conclusion. There is also no fitted parameter renamed as a prediction. Accordingly, the appropriate finding is no significant circularity.
Assumptions & free parameters
assumptions (5)
- standard math ZFC as the background set theory, including the use of forcing and absoluteness for removing the continuum hypothesis.
- domain assumption Fullness of the class C: every structure has at least three elements and every predicate symbol has nonempty interpretation, as in Definition 2.4.
- domain assumption Closure of C under elementary equivalence when applying Lemma 3.6.
- domain assumption Forcing axioms OCA_T and MA in Section 8.3.
- standard math External group-theoretic results: existence of perfect simple groups K_n with n+1 <= cw(K_n) <= 2n+2 from [34], and uniform commutator width bounds for finite quasisimple groups and SL(n,F) from [31] and [50].
Cite this review
Pith. "Pith review of Coordinate recognition: General theory, Groups, and other surprises." pith.science (2026). https://pith.science/paper/AI7FRKA6
@misc{pith2026250613673,
author = {Pith},
title = {Pith review of: Coordinate recognition: General theory, Groups, and other surprises},
year = {2026},
howpublished = {\url{https://pith.science/paper/AI7FRKA6}},
note = {Machine review of arXiv:2506.13673}
}
read the original abstract
A class of structures \emph{recognizes coordinates} if any reduced product of structures from said class witnesses a certain kind of rigidity phenomenon. We provide several equivalent characterizations of this property. This property has (at least) two remarkable consequences, one set-theoretic and one model-theoretic, for reduced products of structures of the said class. First, under appropriate set-theoretic assumptions every isomorphism between such reduced products associated with the Fr\'echet ideal lifts (modulo a finite change) to an isomorphism between products of the original structures. Second, with an additional mild assumption, it implies a strong quantifier elimination result. Of note, we show that a class recognizes coordinates if and only if an individual formula witnesses a certain syntactic property. We also consider many concrete classes of structures and determine whether or not they recognize coordinates. We place heavy emphasis on well-known classes of groups, such as permutation groups, acylindircally hyperbolic groups, quasisimple groups, free products, and graph products, but we also discuss other classes of structures.
Reference graph
Works this paper leans on
-
[10]
B. De Bondt, I. Farah, and A. Vignati. Trivial automorphisms of reduced products. Israel J. Math., to appear
- [1]
-
[2]
J.N.S. Bidwell. Automorphisms of direct products of finite groups ii.Archiv der Math- ematik, 91:111–121, 2008
work page 2008
-
[3]
W. Brian and I. Farah. Conjugating trivial automorphisms ofPpNq{Fin.arXiv preprint arXiv:2410.08789, 2024
arXiv 2024
-
[4]
L.G. Brown, R.G. Douglas, and P.A. Fillmore. Unitary equivalence modulo the com- pact operators and extensions ofC ˚-algebras. InProceedings of a Conference on Operator Theory, volume 345 ofLecture Notes in Math., pages 58–128. Springer, 1973
work page 1973
- [5]
-
[6]
Chatzidakis.Introductory notes on the model theory of valued fields, page 35–79
Z. Chatzidakis.Introductory notes on the model theory of valued fields, page 35–79. London Mathematical Society Lecture Note Series. Cambridge University Press, 2011
work page 2011
-
[7]
K. Conrad. Simplicity of PSL npFq, 2020
work page 2020
Show all 55 references
-
[8]
Crawley and B
P. Crawley and B. J´ onsson. Refinements for infinite direct decompositions of algebraic systems.Pacific J. Math., 14(3):797–855, 1964
1964
-
[9]
De Bondt, I
B. De Bondt, I. Farah, and A. Vignati. Saturation of reduced products.arXiv preprint arXiv:2401.12539, 2024
2024 arXiv
-
[11]
De Bondt and A
B. De Bondt and A. Thom. On automorphism groups of metric reduced products of symmetric groups.arXiv preprint arXiv:2412.10802, 2024
2024 arXiv
-
[12]
De Bondt and A
B. De Bondt and A. Vignati. A metric lifting theorem.arXiv preprint arXiv:2411.11127, 2024
2024 arXiv
-
[13]
Facchini
A. Facchini. The Krull–Schmidt theorem. In M. Hazewinkel, editor,Handbook of algebra, volume 3, pages 357–397. Elsevier, 2003
2003
-
[14]
I. Farah. Rigidity conjectures. InLogic Colloquium 2000, volume 19 ofLect. Notes Log., pages 252–271. Assoc. Symbol. Logic, Urbana, IL, 2005
2000
-
[15]
I. Farah. All automorphisms of the Calkin algebra are inner.Ann. of Math. (2), 173:619–661, 2011
2011
-
[16]
I. Farah. Between reduced powers and ultrapowers.Journal of the European Mathe- matical Society, 25(11):4369–4394, 2022
2022
-
[17]
Farah, S
I. Farah, S. Ghasemi, A. Vaccaro, and A. Vignati. Corona rigidity.arXiv preprint arXiv:2201.11618, 2022
2022
-
[18]
Fronteau
I. Fronteau. Produits r´ eduits en logique continue. Master’s thesis, Universit´ e Paris Cit´ e, 2023
2023
-
[19]
L. Fuchs. Abelian groups.Springer monographs in mathematics, 2015
2015
-
[20]
Genevois and A
A. Genevois and A. Martin. Automorphisms of graph products of groups from a geometric perspective.Proc. London Math. Soc., 119(6):1745–1779, 2019
2019
-
[21]
S. Ghasemi. Reduced products of metric structures: a metric Feferman–Vaught the- orem.J. Symb. Log., 81(3):856–875, 2016
2016
-
[22]
Green.Graph products of groups
E.R. Green.Graph products of groups. PhD thesis, University of Leeds, 1990
1990
-
[23]
Halevi and I
Y. Halevi and I. Kaplan. Saturated models for the working model theorist.Bull. Symb. Logic, pages 1–5, 2023
2023
-
[24]
Hodges.Model theory, volume 42 ofEncyclopedia of Mathematics and its Appli- cations
W. Hodges.Model theory, volume 42 ofEncyclopedia of Mathematics and its Appli- cations. Cambridge university press, 1993
1993
-
[25]
Jech.Set theory: The third millennium edition, revised and expanded, volume 3
T. Jech.Set theory: The third millennium edition, revised and expanded, volume 3. Springer, 2006
2006
-
[26]
Kanovei and M
V. Kanovei and M. Reeken. On Ulam’s problem concerning the stability of approxi- mate homomorphisms.Tr. Mat. Inst. Steklova, 231:249–283, 2000. COORDINATE RECOGNITION 63
2000
-
[27]
Kanovei and M
V. Kanovei and M. Reeken. New Radon–Nikodym ideals.Mathematika, 47:219–227, 2002
2002
-
[28]
Kassel and V
C. Kassel and V. Turaev.Braid groups, volume 247. Springer Science & Business Media, 2008
2008
-
[29]
Identifying the finite symmetric groups
A. Kruckman. Answer to “Identifying the finite symmetric groups”. https://math.stackexchange.com/questions/4098806/identifying-the-finite- symmetric-groups, 2021
2021
-
[30]
A. G. Kurosh.The theory of groups. Vol. II. Chelsea Publishing Co., New York, 1956
1956
-
[31]
Liebeck, E.A
M.W. Liebeck, E.A. O’Brien, A. Shalev, and P.H. Tiep. Commutators in finite qua- sisimple groups.Bulletin of the London Mathematical Society, 43(6):1079–1092, 2011
2011
-
[32]
Magnus, A
W. Magnus, A. Karrass, and D. Solitar.Combinatorial group theory: Presentations of groups in terms of generators and relations. Courier Corporation, 2004
2004
-
[33]
Medvedev and A
A. Medvedev and A. Van Abel. Variations on the feferman-vaught theorem, with applications to ś p Fp.Archive for Mathematical Logic, pages 1–18, 2024
2024
-
[34]
A. Muranov. Finitely generated infinite simple groups of infinite commutator width. International Journal of Algebra and Computation, 17(03):607–659, 2007
2007
-
[35]
N. Nikolov. On the commutator width of perfect groups.Bull. London Math. Soc., 36(1):30–36, 2004
2004
-
[36]
A.I. Omarov. Filtering formulas.Algebra and Logic, 30:693–704, 1991
1991
-
[37]
A.I. Omarov. A syntactical description of filtering formulas. InDoklady Akademii Nauk, volume 319(1), pages 58–60. Russian Academy of Sciences, 1991
1991
-
[38]
Palmgren
E. Palmgren. A direct proof that certain reduced products are countably saturated. U.U.D.M. Report, 27:1–7, 1994
1994
-
[39]
E. A. Palyutin. Categorical Horn classes I.Algebra Logika, 19:582–614, 1980
1980
-
[40]
E. A. Palyutin. Categorical Horn classes II.Algebra Logika, 49:782–802, 2010
2010
-
[41]
L. Paris. Artin groups of spherical type up to isomorphism.Journal of Algebra, 281(2):666–678, 2004
2004
-
[42]
Phillips and N
N.C. Phillips and N. Weaver. The Calkin algebra has outer automorphisms.Duke Math. Journal, 139:185–202, 2007
2007
-
[43]
R.A. Platek. Eliminating the continuum hypothesis.The J. Symb. Logic, 34(2):219– 225, 1969
1969
-
[44]
Rideau-Kikuchi
S. Rideau-Kikuchi. Some properties of analytic difference valued fields.Journal of the Institute of Mathematics of Jussieu, 16(3):447–499, 2017
2017
-
[45]
Shelah.Proper Forcing
S. Shelah.Proper Forcing. Lecture Notes in Mathematics 940. Springer, 1982
1982
-
[46]
S. Shelah. Vive la diff´ erence I: Nonisomorphism of ultrapowers of countable models. In H. Judah, W. Just, and W.H. Woodin, editors,Set theory of the continuum, volume 26 ofMSRI Publications, pages 357–405. Springer, 1992
1992
-
[47]
Shelah and J
S. Shelah and J. Stepr¯ ans. PFA implies all automorphisms are trivial.Proceedings of the American Mathematical Society, 104:1220–1225, 1988
1988
-
[48]
F. Shinko. Recognizing coordinates: (counter)examples.preprint, 2025
2025
-
[49]
Stepr¯ ans
J. Stepr¯ ans. The autohomeomorphism group of the ˇCech-Stone compactification of the integers.Trans. Amer. Math. Soc., 355(10):4223–4240, 2003
2003
-
[50]
Thompson
R.C. Thompson. Commutators in the special and general linear groups.Trans. Amer. Math. Soc., 101(1):16–33, 1961
1961
-
[51]
Veliˇ ckovi´ c
B. Veliˇ ckovi´ c. OCA and automorphisms ofPpωq{Fin.Top. Appl., 49:1–13, 1993
1993
-
[52]
A. Vignati. Rigidity conjectures for continuous quotients.Ann. Sci. ´Ec. Norm. Sup´ er. (4), 55(6):1687–1738, 2022
2022
-
[53]
A. Vignati. Rigidity of Higson coronas.arXiv preprint arXiv:2502.10073, 2025
2025 arXiv
-
[54]
S. White. Abstract classification theorems for amenable C ˚-algebras. InICM— International Congress of Mathematicians. Vol. 4. Sections 5–8, pages 3314–3338. EMS Press, Berlin, 2023. 64 FARAH, I., GANNON, K., AND TOUCHARD, P
2023
-
[55]
general linear group as a direct product?
Ycor. Answer to “general linear group as a direct product?”. https://mathoverflow.net/questions/222249/general-linear-group-as-a-direct- product, 2015. Department of Mathematics and Statistics, York University, 4700 Keele Street, North York, Ontario, Canada, M3J 1P3 and Matema...
2015
Reviewed August 15, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.