{"id":"88755e75-10e3-4cb4-87a7-9c537b98fe87","arxiv_id":"1908.05249","paper_version":6,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The automorphism groups of order and tournament expansions of several homogeneous structures (free amalgamation Fraïssé limits, the bounded Urysohn space, the random poset) are simple.","lead":"This mathematics paper proves that the automorphism groups of certain 'ordered' and 'tournament-added' versions of homogeneous structures, like the random graph and the bounded Urysohn space, are simple: they have no nontrivial normal subgroups. The proof introduces a new general tool, a 'weakly stationary independence relation', that extends earlier machinery to structures carrying an extra order or tournament.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The ordered Urysohn case of Lemma 4.11 is delegated to [13] without the promised adaptation; if the back-and-forth cannot be made to preserve the order, Theorem 1.3(2) is unsupported.","rationale":"The reader's weakest_assumption identifies property (*) for the Urysohn and random poset cases and explicitly notes that Lemma 4.11 Case II is delegated to 'as in [13]'. I agree with that assessment. The most load-bearing point is not whether property (*) is true in the sense of existence of certain order expansions — that follows from the amalgamation property of finite ordered metric spaces and the Fraïssé construction, and the paper even uses (*) in the definition. The real soft spot is the adaptation of the Tent–Ziegler construction from the unordered bounded Urysohn space to the ordered one. The cited papers [12] and [13] do not contain the ordered version, and the one-paragraph description in Lemma 4.11 Case II leaves the preservation of the linear order to the reader. If that adaptation cannot be carried out, the proof of Theorem 1.3(2) collapses. The concrete test I propose is to actually write out the back-and-forth, which would settle the matter. Since this is a gap in exposition rather than a demonstrated falsehood, I do not recommend rejection; the paper should be accepted conditionally on filling in this step, which matches the reader's verdict. No additional independent concern was found; the broad architecture is coherent and the free amalgamation cases are well supported.","tokens_in":16092,"tokens_out":19815,"duration_ms":180381,"concrete_test":"Write out the full back-and-forth for Lemma 4.11 Case II in the ordered bounded rational Urysohn space, specifying at each step the interval constraints on f(x) and verifying that the partial maps extend to order-preserving isometries. Then check that the resulting commutator [h,f] is an L*-automorphism that is unboundedly increasing and, for every non-algebraic metric 1-type p over a finite X, realizes p at some a with d(a,[h,f](a))=1. If the construction fails at any step, Theorem 1.3(2) is not proved.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The proof of Theorem 1.3 for case (2) (bounded rational Urysohn space) rests on Lemma 4.11 Case II. That case says 'as in [13, 1.3]' and 'we can adapt [13, 2.4]' to produce an unboundedly increasing, moving-maximally element, with only the comment that (*) is used. The actual adaptation is not written out. The difficulty is that [13] works in the unordered Urysohn space; here every partial automorphism must preserve the linear order as well as the metric, and the final element must move maximally with respect to the weakly stationary independence relation. Property (*) supplies metric realizations inside prescribed intervals, but it does not by itself guarantee that the iterated commutators constructed in [13, 2.4] can be chosen to be order-preserving at every step of the back-and-forth. Since the centrality of Lemma 4.11 is acknowledged (Proposition 1.6 and the proof of Theorem 1.3), an unverified delegation at this point is a load-bearing gap. The same pattern recurs in Proposition 4.13 for tournament expansions of the Urysohn space.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","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.","tokens_in":16246,"tokens_out":13467,"duration_ms":136963,"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":[{"comment":"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.","section":"Sec. 4, Lemma 4.11 Case II and Prop. 4.13"},{"comment":"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.","section":"Sec. 4, Lemma 4.6"}],"minor_comments":[{"comment":"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.","section":"Sec. 4, Lemma 4.5"},{"comment":"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.","section":"Sec. 4, Lemma 4.11 Case II"},{"comment":"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.","section":"Sec. 1, after Theorem 1.3"},{"comment":"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.","section":"Sec. 4, Lemma 4.11 Case I"}],"recommendation":"major_revision","confidential_remarks":"The main concern is whether the ordered and tournament Urysohn adaptation from [13] is genuinely routine or hides an obstruction. My recommendation of major revision is intended to obtain a complete proof of that adaptation rather than to cast doubt on the overall framework. The misstatement in Lemma 4.6 is likely local and should be corrected during revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The thing to know: this is a real advance. Calderoni, Kwiatkowska, and Tent introduce free fusion and weakly stationary independence relations, and with them prove simplicity of Aut(M<) and Aut(M→) for structures like the ordered random graph, ordered hypergraphs, ordered Kn-free graphs, the ordered random poset, and tournament expansions of free amalgamation limits and the bounded Urysohn space. The weakening from stationary independence is the right one—it keeps invariance, monotonicity, symmetry, and existence, and drops stationarity only to L1-types, which is exactly what allows order and tournament expansions to go through. The reduction in Theorem 1.5 (moving maximally + compatible implies eight conjugates cover G) is clean, and the free amalgamation cases in Section 4 are genuinely proved. The paper also gives the right credit to prior work; the reliance on [12], [13], [8], and [3] is appropriate, and the self-citations are to the very machinery being extended, not a black box.\n\nThe soft spots are concentrated in the Urysohn space cases. Lemma 4.11 Case II says 'as in [13, 1.3]' and then 'In the same way we can adapt [13, 2.4]' to produce an unboundedly increasing, moving-maximally element in the ordered bounded Urysohn space, but the actual back-and-forth is not written out. The stress-test worry is legitimate: [13] works in the unordered Urysohn space, and property (*) gives realizations inside prescribed intervals, but it does not by itself prove that every step of the iterated commutator construction can be made order-preserving. That is a load-bearing step, since Lemma 4.11 feeds directly into Proposition 1.6 and hence Theorem 1.3(2). The same delegation recurs in Proposition 4.13 for tournament expansions of the Urysohn space. I would not call it a counterexample; I would call it a gap in exposition that a referee should require the authors to fill. The paper also needs a small correction in the abstract: it says 'order and tournament expansions of ... the random poset', but Theorem 1.3 only claims the tournament expansion for cases (1) and (2), not for the random poset. That is a minor overclaim, but worth fixing.\n\nBottom line: the central architecture holds up. The free amalgamation results are solid; the Urysohn case is likely correct but under-verified in the written version. This deserves a serious referee. Send it out—with a request that the Urysohn adaptation be proved in full, not referenced.","headline":"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.","tokens_in":16843,"tokens_out":3206,"would_cite":true,"duration_ms":29113,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["03C98","03E15","20B27"],"pacs":[],"model":"deepseek-v4-flash","headline":"Simplicity holds for ordered and tournament expanded structures","keywords":["simple groups","automorphism groups","Fraïssé limits","order expansions","tournament expansions","Urysohn space","random poset","stationary independence relation"],"falsifier":"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.","tokens_in":15816,"feed_emoji":"♾️","tokens_out":6120,"duration_ms":62771,"temperature":0.7,"pith_summary":"This paper proves that if a countable homogeneous structure is one of three families—the Fraïssé limit of a free, transitive, nontrivial amalgamation class (including the random graph and its relatives), the bounded rational Urysohn space, or the random poset—then adding a dense linear order yields a structure whose automorphism group is simple. For the first two families, adding a random tournament also yields a simple automorphism group. Simplicity means the only normal subgroups are the trivial ones, so every automorphism can be built from any nontrivial automorphism and its conjugates. The proof gives a uniform mechanism: a weakened independence relation, called a weakly stationary independence relation, together with a free fusion condition that lets the added order or tournament interact with the base structure.","feed_headline":"Order and tournament expansions keep automorphism groups simple","feed_subtitle":"Random graph, Urysohn space, and random poset stay simple after adding a dense order or random tournament.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"Defines stationary independence relations and supplies the product-of-conjugates strategy that the paper weakens and adapts.","marker":"[12]"},{"why":"Provides the earlier simplicity framework for automorphism groups of homogeneous structures and the moving-maximally approach the paper extends.","marker":"[8]"},{"why":"Proves simplicity of the bounded Urysohn isometry group and supplies the metric back-and-forth construction adapted in the ordered Urysohn case.","marker":"[13]"},{"why":"Proves simplicity for the random poset automorphism group and supplies the unboundedly-increasing conjugation argument used for the ordered random poset.","marker":"[3]"},{"why":"Establishes the classical description of normal subgroups of $\\operatorname{Aut}(\\mathbb{Q},<)$, which the order-expansion argument generalizes.","marker":"[4]"},{"why":"Supplies the stationary independence relation for the random poset that serves as the base relation in the ordered random poset proof.","marker":"[6]"}],"fun_headline_variants":["Automorphism groups stay simple for order and tournament expansions","Order and tournament expansions preserve automorphism group simplicity","Expanding with order or tournament keeps automorphism groups simple","Automorphism groups remain simple after order and tournament add-ons","Simple automorphism groups persist through order and tournament expansions"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Automorphism groups stay simple for order and tournament expansions","Order and tournament expansions preserve automorphism group simplicity","Expanding with order or tournament keeps automorphism groups simple","Automorphism groups remain simple after order and tournament add-ons","Simple automorphism groups persist through order and tournament expansions"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000214,"raw_usage":{"total_tokens":1320,"prompt_tokens":735,"completion_tokens":585,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":351,"completion_tokens_details":{"reasoning_tokens":507}},"tokens_in":351,"tokens_out":585,"duration_ms":5749,"temperature":1.0,"reasoning_tokens":507,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:20:54.389331+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[{"cited_title":"On the isometry group of the Urysohn space","cited_arxiv_id":null,"evidence_quote":"Defines stationary independence relations and supplies the product-of-conjugates strategy that the paper weakens and adapts."},{"cited_title":"Simplicity of some au tomorphism groups","cited_arxiv_id":null,"evidence_quote":"Provides the earlier simplicity framework for automorphism groups of homogeneous structures and the moving-maximally approach the paper extends."},{"cited_title":"The isometry group of th e bounded Urysohn space is simple","cited_arxiv_id":null,"evidence_quote":"Proves simplicity of the bounded Urysohn isometry group and supplies the metric back-and-forth construction adapted in the ordered Urysohn case."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Proves simplicity for the random poset automorphism group and supplies the unboundedly-increasing conjugation argument used for the ordered random poset."},{"cited_title":"On infinite simple permutation groups","cited_arxiv_id":null,"evidence_quote":"Establishes the classical description of normal subgroups of $\\operatorname{Aut}(\\mathbb{Q},<)$, which the order-expansion argument generalizes."},{"cited_title":"Automorphism groups of finite topological rank","cited_arxiv_id":null,"evidence_quote":"Supplies the stationary independence relation for the random poset that serves as the base relation in the ordered random poset proof."}],"review_version":1}