REVIEW 2 major objections 4 minor 14 references
Simplicity of the automorphism groups of order and tournament expansions of homogeneous structures
T0 review · 2 major / 4 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read Simplicity holds for ordered and tournament expanded structures
desk verdict Free fusion and weakly stationary independence genuinely extend Tent–Ziegler to ordered and tournament expansions; the main gap is the delegated Urysohn space case, which a referee should press on. 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 paper defines a free fusion of two structures on the same universe: the added order or tournament layer is fused with the base structure so that every non-algebraic type of the base structure is realized inside any prescribed interval of the order, or with any prescribed orientation to two disjoint finite sets of the tournament. On such a fusion, a stationary independence relation of the base structure becomes a weakly stationary independence relation, meaning independence over a set still determines the base-language type but not necessarily the added-language type. An automorphism moves maximally when it is homogeneous with respect to the added layer and every non-algebraic type over a finite set has a realization whose image under the automorphism is suitably independent; it is compatible when finite sets can be extended so that the correspondence can be adjusted by pointwise stabilizers. The load-bearing result is that four moving-maximal factors arranged with the right independence geometry can realize any prescribed tuple, so any group element is a product of at most eight conjugates of the chosen maximal automorphism and its inverse.
What would settle it
Find a non-algebraic 1-type over a finite set in the bounded rational Urysohn space and an open interval that contains no realization of that type; then the order expansion fails the density property and the proof's back-and-forth construction cannot proceed. If such an expansion also had a nontrivial normal subgroup, the theorem would be false; at minimum, the first step of the proof would break.
Extended reading notes
Core claim
The central claim is that the automorphism group of every order expansion of the random-poset-like structures, the bounded rational Urysohn space, and free amalgamation Fraïssé limits is simple, and likewise for tournament expansions of the latter two families. The engine is a reduction: any element of the group is a product of at most eight conjugates of any automorphism that moves maximally and is compatible, and every nontrivial automorphism has some such automorphism in its normal closure. An automorphism is useful here when it acts homogeneously with respect to the added order or tournament and moves each non-algebraic type to an independent copy of itself. Once such an automorphism exists, a back-and-forth argument writes every group element as a short product of conjugates, and therefore the group is simple.
Load-bearing premise
The construction relies on the free-fusion density property: every non-algebraic type of the base structure must be realizable inside every interval of the order, or with every prescribed tournament orientation to two disjoint finite sets, and for the bounded Urysohn space and the random poset this property is invoked rather than proved in full.
Editorial extensions
If this is right
- Ordered random graphs, ordered random hypergraphs, ordered random $K_n$-free graphs, and their hypergraph analogues all have simple automorphism groups, as do the ordered random poset and the ordered bounded rational Urysohn space.
- For any unboundedly increasing automorphism of $(\mathbb{Q},<)$, every element of $\operatorname{Aut}(\mathbb{Q},<)$ is a product of at most eight conjugates of it and its inverse, refining the classical description of normal subgroups of this group.
- For any automorphism of the random tournament that sends every element to a successor, the same eight-conjugate bound holds for the whole automorphism group.
- The quotient of the automorphism group of the ordered bounded rational Urysohn space modulo the normal subgroup of bounded-displacement automorphisms is simple.
Reading between the lines
- A reader can extract a practical criterion from the proof: if an expansion satisfies the free-fusion density property for every non-algebraic 1-type, then the back-and-forth construction can start; checking this property for a candidate expansion is a concrete model-theoretic task.
- The same strategy is likely to prove simplicity for expansions by several independent orders or tournaments, since the tournament and order arguments only need consistency of 1-types over disjoint finite sets and preservation of the density property.
- For homogeneous metric structures beyond the bounded Urysohn space, the compatibility condition is the bottleneck; the Urysohn case uses metric-specific displacement arguments, so extending the theorem to other metric expansions would require a new way to produce compatible maximal automorphisms.
- The eight-conjugate bound suggests a quantitative version of simplicity for these groups: not only is every element a product of conjugates, but the number of factors is uniformly bounded by eight whenever a suitable maximal automorphism exists.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces the notions of a free fusion of two structures and of a weakly stationary independence relation, and uses them to study the normal subgroup structure of automorphism groups of order and tournament expansions of homogeneous structures. The main abstract result (Theorem 1.5) says that if an automorphism g of such a free fusion moves maximally and is compatible, then every automorphism is a product of at most eight conjugates of g and g^{-1}. The paper then constructs compatible, moving-maximally automorphisms for order expansions of free amalgamation classes, the bounded rational Urysohn space, and the random poset, and for tournament expansions of the first two classes, yielding the simplicity result in Theorem 1.3. The proof proceeds through a series of lemmas in Section 4 that produce fixed-point-free, strictly increasing, unboundedly increasing, and finally moving-maximally automorphisms inside the normal closure of an arbitrary non-identity element.
Significance. If the proof is completed, Theorem 1.3 gives a substantial extension of the earlier simplicity results of Macpherson--Tent and Tent--Ziegler. The conceptual contribution is the weakening of stationarity to L1-stationarity, which is tailored to expansions, and Proposition 2.5 shows that this relation is preserved by free fusions. The framework yields explicit quantitative information: any automorphism is a product of at most eight conjugates of a compatible moving-maximally automorphism. The paper also covers new concrete cases such as ordered random hypergraphs, the ordered random poset, and ordered and tournament-expanded Urysohn spaces. The main weakness is that the Urysohn cases, especially Lemma 4.11 Case II and Proposition 4.13, are delegated to an adaptation of [13] that is not actually written out.
major comments (2)
- [Sec. 4, Lemma 4.11 Case II and Prop. 4.13] The proof of Theorem 1.3(2) is not written out for the ordered (and tournament) Urysohn space. In Lemma 4.11 Case II the argument says "we can adapt [13, 2.4]" and "we end up as in [13, 2.5]", but [13] treats the unordered bounded Urysohn space. The adaptation must verify at every step of the back-and-forth that the partial automorphism f preserves the linear order, that f(x) lies in (x/2 - epsilon, x/2], that the commutator remains unboundedly increasing, and that the final automorphism satisfies the moving-maximally condition with respect to the weakly stationary independence relation. Property (*) alone does not automatically transfer the [13] construction, because metric independence and order preservation are separate requirements that have to be handled simultaneously. Since Proposition 1.6 and Theorem 1.5 make exactly this step load-bearing for Theorem 1.3(2), the case is not proved as written. Proposition 4.13 relies on the same unverified delegation for tournament expansions of the Urysohn space.
- [Sec. 4, Lemma 4.6] The proof of Lemma 4.6 contains a false statement: in the ordered bounded rational Urysohn space, the type d(x,a)=1 and d(x,h(a))=1/2 is not generally consistent; it is inconsistent whenever d(a,h(a))<1/2. Moreover, the finite set Y in the general part of the proof must be required to be disjoint from {a,h(a)}, since otherwise Y={a} would trivially separate a and h(a). Because Lemma 4.6 supplies the fixed-point-free commutator used in Proposition 1.6, this needs a repair: either the general argument (with [8,2.10]) covers all cases and the erroneous Urysohn subcase is deleted, or a correct type and verification must be supplied.
minor comments (4)
- [Sec. 4, Lemma 4.5] In the final extension step of the proof of Lemma 4.5, the indices are garbled: "for j = i = 1, . . . q" should presumably be "j = i+1, . . . , q", and the displayed formula for b(y_j) should be checked against the intended induction.
- [Sec. 4, Lemma 4.11 Case II] The notion "moves almost maximally" is used in Lemma 4.11 Case II without a formal definition; it is later paraphrased as the condition that every non-algebraic type p over a finite set X has a realization a with a |(X) g'(a). This should be stated explicitly at first use.
- [Sec. 1, after Theorem 1.3] The sentence "Apart from the ordered bounded rational Urysohn space see (e.g. [13])" is grammatically unclear and should be rewritten to state which cases are already known and which are new.
- [Sec. 4, Lemma 4.11 Case I] The sentence "Since weak stationary independence agrees with stationary independence on subsets of M<" is imprecise; presumably it means on the M1-reduct, and the reader should not have to infer this.
Circularity Check
No significant circularity: the simplicity proof is a substantive adaptation of published Tent–Ziegler machinery; self-citations are to verifiable prior results and no conclusion is assumed by construction.
full rationale
The paper's core derivation is not circular. Theorem 1.5 reduces simplicity to the existence of a compatible moving-maximally automorphism, and Proposition 1.6 constructs such automorphisms by back-and-forth arguments. The weakly stationary independence relation is not defined in terms of the target conclusion; it is a genuine weakening of Tent–Ziegler's stationarity (Definition 2.4), and Proposition 2.5 proves from property (*) that a free fusion carries it. The order and tournament expansion assumptions are used as hypotheses, not as the conclusion. The heavy citations to [12] and [13] are to published, externally checkable papers by overlapping authors; the present paper adapts rather than assumes their results (e.g., Lemma 4.2 proves fullness for tournament expansions, Lemma 4.5 proves the order-preserving extension lemma, and Proposition 4.12 handles the random poset via [3]). The one genuinely fragile point is Lemma 4.11 Case II, where the ordered bounded Urysohn case is dispatched by 'as in [13, 1.3]' and 'we can adapt [13, 2.4]'; this is a proof-completeness gap, not circularity, because the citation is to an external construction for the unordered Urysohn space and the text asserts an adaptation rather than importing the theorem's own conclusion. Similarly, Proposition 4.13 compresses the tournament-Urysohn construction. These do not reduce the claimed result to its inputs; they leave a verifiability gap that should be weighed as correctness risk, not circularity. No fitted parameter is relabeled as a prediction, no uniqueness theorem is imported from the authors, and no known result is merely renamed under new terminology. Overall circularity score: 1.
Assumptions & free parameters
assumptions (5)
- standard math The structures in Theorem 1.3 admit a stationary independence relation: free amalgamation limits, the bounded Urysohn space, and the random poset.
- standard math The expanded Fraïssé classes with an added order or tournament have disjoint amalgamation, yielding the free fusion as the Fraïssé limit (Remark 1.2).
- domain assumption The ordered bounded rational Urysohn space satisfies the realization property (*) from Definition 1.1(I).
- standard math The random tournament has the property that the union of any two 1-types over disjoint finite sets is consistent.
- standard math The theorems of Tent-Ziegler [12] and [13] used 'as in' for key arguments (e.g., Prop. 3.4, Lemma 4.11) remain valid.
Cite this review
Pith. "Pith review of Simplicity of the automorphism groups of order and tournament expansions of homogeneous structures." pith.science (2026). https://pith.science/paper/CJIXQ2XU
@misc{pith2026190805249,
author = {Pith},
title = {Pith review of: Simplicity of the automorphism groups of order and tournament expansions of homogeneous structures},
year = {2026},
howpublished = {\url{https://pith.science/paper/CJIXQ2XU}},
note = {Machine review of arXiv:1908.05249}
}
read the original abstract
We define the notions of a free fusion of structures and a weakly stationary independence relation. We apply these notions to prove simplicity for the automorphism groups of order and tournament expansions of homogeneous structures like the bounded Urysohn space, the random graph, and the random poset.
Reference graph
Works this paper leans on
-
[12]
On the isometry group of the Urysohn space
Katrin Tent and Martin Ziegler. On the isometry group of the Urysohn space. Journal of the London Mathematical Society , 87(1):289–303, 11 2012. 19
work page 2012
-
[13]
The isometry group of th e bounded Urysohn space is simple
Katrin Tent and Martin Ziegler. The isometry group of th e bounded Urysohn space is simple. Bulletin of the London Mathematical Society , 45 (2013), no. 5, 1026–1030
work page 2013
-
[8]
Simplicity of some au tomorphism groups
Dugald Macpherson and Katrin Tent. Simplicity of some au tomorphism groups. Journal of Algebra, 342(1):40–52, 2011
work page 2011
-
[3]
A. M. W. Glass, Stephen H. McCleary, Matatyahu Rubin. Aut omorphism groups of countable highly homogeneous partially ordered sets. Math. Z. 214 (1993), no. 1, 55–66
work page 1993
-
[1]
Omer Angel, Alexander S. Kechris, Russell Lyons. Random orderings and unique ergodicity of automorphism groups. J. European Math. Society 16 (2014), 2059–2095
work page 2014
-
[2]
Bodirsky, New Ramsey classes from old
M. Bodirsky, New Ramsey classes from old. Electron. J. Combin. 21 (2014), no. 2, Paper 2.22, 13 pp
work page 2014
-
[4]
On infinite simple permutation groups
Graham Higman. On infinite simple permutation groups. Publ. Math. Debrecen , 3:221–226 (1955), 1954
work page 1955
-
[5]
Alexander S. Kechris, Vladimir G. Pestov , Stevo Todorce vic. Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups. Geom. Funct. Anal. 15 (2005), no. 1, 106–189
work page 2005
Show all 14 references
-
[6]
Automorphism groups of finite topological rank
Itay Kaplan, Pierre Simon. Automorphism groups of finite topological rank. Trans. Amer. Math. Soc. , 372 (3):2011–2043, 2019
2011
-
[7]
Les automorphismes d’un ensemble fortem ent minimal
Daniel Lascar. Les automorphismes d’un ensemble fortem ent minimal. The Journal of Sym- bolic Logic, 57(1):238–251, 1992
1992
-
[9]
Order and Tournament Expansions of Homog eneous Structures
Silke Meißner. Order and Tournament Expansions of Homog eneous Structures. Master’s the- sis, TU Darmstadt, 2021
2021
-
[10]
Unpublished notes
Matatyahu Rubin. Unpublished notes. 1988
1988
-
[11]
Directed graphs and boron trees
Miodrag Sokić. Directed graphs and boron trees. J. Combin. Theory Ser. A 132 (2015), 142–171
2015
-
[14]
John K. Truss. The group of the countable universal grap h. Math. Proc. Cambridge Philos. Soc., 98(2):213–245, 1985. Department of Mathematics, Statistics, and Computer Scien ce, University of Illi- nois at Chicago, Chicago (IL) 60613, USA Email address : fcaldero@uic.edu Inst...
1985
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.