{"id":"bc745c0c-4182-49d6-b441-9d136be46d5b","arxiv_id":"2412.10802","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Assuming OCA and Martin's axiom for sigma-linked posets, all isomorphisms between metric reduced products of symmetric groups are trivial, and the outer automorphism group is described explicitly.","lead":"Under two standard set-theoretic forcing axioms, every isomorphism between metric reduced products of symmetric groups is 'trivial': it comes from permuting coordinates and conjugating each coordinate. The result gives a complete description of the automorphism groups of these universal sofic groups, contrasting sharply with the chaotic behavior under the Continuum Hypothesis.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The proof of Theorem 3.5 contains a false uniqueness claim for ¬, but the order-definability in the same theorem likely repairs the argument; the gap is genuine but may not threaten the main theorem.","rationale":"The reader's weakest assumption correctly identifies a false sentence in the proof of Theorem 3.5. I verified the counterexample: with a=(12)(34)(56) in Sym(6), both b=id and b=(13)(24) commute with a, satisfy D1(a)⊕D1(b)=1 and D1(ab)=1, but have D1(b)=0 and D1(b)=2/3 respectively. Hence the uniqueness condition defining ¬ fails, and the written proof that an arbitrary group isomorphism induces an automorphism of the expanded Stone-Cech structure is not justified. This is a real proof gap and should be corrected. However, the central claim of the paper, Theorem 3.9, may still be sound. The paper itself establishes that the order on [0,1]^N/Fin is definable from the group structure, and Kaplansky's theorem on lattices of continuous functions gives that any order automorphism of C(∂βN,[0,1]) fixing 0 and 1 is induced by a homeomorphism of ∂βN. Thus the use of ¬ may be entirely avoidable. The remaining steps of the main proof do not depend on the false claim: the Ulam stability result, the metric lifting theorem, and the product-form rigidity are independent. Therefore I do not recommend changing the conditional verdict. The requested test is to write out the order-only proof of Theorem 3.5; if it succeeds, the identified gap is non-load-bearing, while if it fails, the main theorem would indeed lack a necessary ingredient.","tokens_in":10884,"tokens_out":14042,"duration_ms":131414,"concrete_test":"Analytical check: independently re-prove Theorem 3.5 without using the claimed definability of ¬. Specifically, show that for any isomorphism φ the map α:=D2∘φ∘D1^{-1} on [0,1]^N/Fin preserves the lattice order and fixes 0 and 1; then verify that every order automorphism of [0,1]^N/Fin fixing 0 and 1 is induced by a homeomorphism of ∂βN via Kaplansky's theorem, and that the extension from involutions to arbitrary elements of Sym[(k_n)_n] uses only this order preservation. If this proof succeeds, the false ¬-definability is an inessential exposition error and the main theorem is unaffected.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The most concrete defect is in Theorem 3.5's definability of the expanded structure. The claim that ¬D1(a) is uniquely determined by the existence of a commuting involution b with D1(a)⊕D1(b)=1 and D1(ab)=1 is false. In Sym(6), take a=(12)(34)(56). Then b=id satisfies the conditions with D1(b)=0, while b=(13)(24) also commutes with a, satisfies D1(a)⊕D1(b)=1 and D1(ab)=1, but has D1(b)=2/3. Thus the stated condition does not determine D1(b), and the asserted definability of ¬ in the group is not established. As written, the proof that φ induces an automorphism of ([0,1]^N/Fin,0,1,≤,¬,⊕) is invalid. This is a genuine correctness gap in Theorem 3.5. It may not be load-bearing for Theorem 3.9, because the same theorem proves that the order is definable, and by Kaplansky's lattice theorem every automorphism of the bounded lattice C(∂βN,[0,1]) is composition with a homeomorphism. If the order-only route works, θ and the subsequent argument can be obtained without ¬.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies isomorphisms between metric reduced products Sym[(k_n)_n] of finite symmetric groups with the normalized Hamming metric. Assuming OCA and MA_ℵ1(σ-linked), it claims that every isomorphism between two such groups is trivial in the sense of Definition 2.4: up to conjugation by an element of the target group, it is the coordinate permutation ψ_f associated with an almost permutation f with lim_n k_{f(n)}/l_n = 1. From this it derives a description of the outer automorphism group as Out((k_n)_n), a criterion for completeness, a dichotomy with the CH behavior, and consequences for elementary equivalence and non-isomorphism. The proof strategy is: Theorem 3.5 shows that any isomorphism induces an automorphism θ of P(N)/Fin preserving zero-distance relations; [5, Theorem 1] trivializes θ under OCA; the metric lifting theorem [6] turns the resulting coordinate-respecting map into product form; and the Ulam stability result Theorem 3.2 forces the product form to be inner. The manuscript also proves that all isomorphisms are automatically isometric.","tokens_in":10902,"tokens_out":19366,"duration_ms":188617,"significance":"If the main theorem is correct, this is a substantial rigidity result for universal sofic groups under natural forcing axioms: isomorphism types are completely controlled by asymptotic rearrangements of the defining sequences, and the automorphism group is a split extension with an explicitly computed outer group. The architecture is attractive and reusable: it cleanly packages the black boxes [5] and [6], reduces the product-form case to Ulam stability, and produces explicit, checkable corollaries. The paper contains no fitted parameters and the central claim is not definitionally circular. However, the proof of Theorem 3.5 contains a genuine gap in the definability argument for the complement operation, and since Theorem 3.9 and its corollaries rely on Theorem 3.5, the main rigidity statement is not established as written. The gap appears local and likely repairable through the order-definability part of the same theorem, but the repair is not present in the manuscript.","major_comments":[{"comment":"The uniqueness claim used to define ¬ is false. In a block of six points, let a=(12)(34)(56) and consider b=id and b=(13)(24). Both commute with a, and in both cases D1(a)⊕D1(b)=1 and D1(ab)=1, yet D1(b)=0 in the first case and 2/3 in the second. Taking such blocks for a sequence (k_n) of multiples of 6 tending to infinity gives two distinct involutions b in Sym[(k_n)_n] with different D1-values that satisfy the stated conditions. Consequently the sentence \"Finally, for an involution a ... uniquely determined ...\" does not establish definability of ¬, and the subsequent assertion that φ induces an automorphism of ([0,1]^N/Fin,0,1,≤,¬,⊕) is unsupported.","section":"Section 3.2, proof of Theorem 3.5"},{"comment":"The gap in Theorem 3.5 is load-bearing: property (1) and the existence of θ are used in Theorem 3.9 to apply [5, Theorem 1] and [6], and the corollaries depend on Theorem 3.9. A repair is needed. The order-definability part of the proof may suffice: if one proves directly from the definability of ≤ (and 0,1) that φ induces an automorphism of the lattice C(∂βN,[0,1]) fixing 0 and 1, and that every such automorphism is composition with a homeomorphism, then the rest of the argument can go through. The manuscript currently cites [4] and [16] only for the full expanded structure, so it does not supply this lattice-only argument.","section":"Theorem 3.9 and Corollaries 3.11, 3.13"}],"minor_comments":[{"comment":"There are several typographical and spacing issues, e.g., \"assu ming\" in the abstract and the spacing in \"Todorˇcevi´c\"; a proofreading pass is recommended.","section":"Abstract and general text"},{"comment":"The notation Sym[(k^ν_n)_n]/U is ambiguous, since it could be read as a quotient of the reduced product by an ultrafilter; the earlier notation ∏_n Sym(k_n)/U in Theorem 3.5(2) is clearer and should be used consistently.","section":"Proof of Corollary 3.7"},{"comment":"The step \"Basic combinatorics shows that b is a product of two conjugates of a\" should be expanded or given a reference; it is not immediate that parity obstructions disappear for equality in the metric reduced product quotient, and this point is used to pass from involutions to arbitrary elements.","section":"Proof of Theorem 3.5"}],"recommendation":"major_revision","confidential_remarks":"For the editor: the paper is built on two companion preprints by overlapping authors, which is legitimate but should be watched during the review process. The main result is interesting and likely correct, but Theorem 3.5 needs a substantive fix before publication; I would be happy to see a revised version."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"This paper is a real step forward for set-theoretic rigidity of metric reduced products. Under OCA plus MA_alpha1(sigma-linked), it gives a complete description of isomorphisms between universal sofic groups: every isomorphism is, up to conjugation, a coordinate permutation with matching asymptotic growth, and it computes the outer automorphism group. That is a sharp, satisfying result, and the overall architecture is clean: ZFC reduction to boundary homeomorphisms, OCA to convert the homeomorphism into an almost permutation, the metric lifting theorem to get product form, and Ulam stability to pin down the coordinate maps. Corollaries 3.11, 3.13, and 3.14 are new and worth having.\n\nThe soft spot is in the proof of Theorem 3.5. The definability claim for the complement operation is false as stated: for a fixed-point-free involution a=(12)(34)(56) in Sym(6), both b=id and b=(13)(24) commute with a, satisfy D1(a)+D1(b)=1 and D1(ab)=1 in the relevant sense, yet they have different D1 values. So the \"uniquely determined\" assertion is wrong, and the proof that phi induces an automorphism of the full expanded structure ([0,1]^N/Fin, 0,1,<=,not,o-plus) does not go through. That is a genuine gap in the written proof.\n\nBut I am not convinced it is fatal. The same theorem shows the lattice order is definable, and Kaplansky's theorem on lattices of continuous functions would give the boundary homeomorphism theta from the order alone, without needing the complement operation. The authors already cite Kaplansky and related work; if the order-only route works, the rest of the argument survives intact. So this looks repairable, and the main theorem is probably still true.\n\nThe citation pattern is fair. The heavy reliance on [5] and [6] from the same group is legitimate: those are separate theorems, and using them as black boxes is standard. I checked the Ulam-stability argument in Lemma 3.4 and it is sound. I did not find other issues.\n\nThis paper deserves a serious referee. I would send it to review, with a request to fix the definability step and clarify whether the order definability alone suffices. Anyone working on reduced products, universal sofic groups, or OCA rigidity will want to read it.","headline":"Substantial and likely correct paper, but the proof of Theorem 3.5 has a definability gap that needs fixing.","tokens_in":11677,"tokens_out":2529,"would_cite":true,"duration_ms":23994,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["20B30","03C20"],"pacs":[],"model":"deepseek-v4-flash","headline":"Assuming the open coloring axiom and Martin's axiom for sigma-linked posets, every isomorphism between metric reduced products of symmetric groups is trivial: up to inner conjugation it is a coordinate permutation induced by an almost…","keywords":["metric reduced products","symmetric groups","Hamming metric","outer automorphism group","open coloring axiom","Martin's axiom","sofic groups","rigidity"],"falsifier":"In Sym(6), the uniqueness used to define not D1(a) fails: for a=(12)(34)(56) and b=(13)(24), the defining conditions are satisfied by b with D1(b)=2/3 and D1(ab)=1, not with D1(b)=1. This refutes the definability lemma behind Theorem 3.5, so the proof as written has a concrete gap.","tokens_in":10442,"feed_emoji":"🔀","tokens_out":11546,"duration_ms":99203,"temperature":0.7,"pith_summary":"Metric reduced products of finite symmetric groups, equipped with the normalized Hamming metric, are the universal sofic groups: every sofic group embeds into one of them. The paper studies what happens to their isomorphisms under two forcing axioms, OCA and Martin's axiom for sigma-linked posets. Its central claim is that, under those axioms, every isomorphism between two such products is trivial in a precise sense: it is, up to conjugation in each coordinate, just a permutation of the coordinates that asymptotically preserves the coordinate sizes. This would give a complete description of the outer automorphism group of each such product and would contrast sharply with the situation under the continuum hypothesis, where these groups are extremely flexible. The same results also yield a concrete count of the isomorphism classes of these groups.","feed_headline":"Forcing axioms trivialize symmetric-group limit isomorphisms","feed_subtitle":"Under OCA and Martin's axiom, every such isomorphism is a coordinate permutation up to inner conjugation.","key_machinery":"The central objects are the metric reduced product Sym[(k_n)_n] and the notion of a trivial isomorphism, built from an almost permutation f of the natural numbers together with the coordinatewise cut/lift operation and inner conjugation. The argument runs through four linked mechanisms. First, an Ulam-stability theorem for approximate homomorphisms from Sym(k_n) to Sym(l_n) forces any product-form isomorphism to be inner and to satisfy lim_n k_n/l_n = 1. Second, the proof attaches to every isomorphism an automorphism $\\theta$ of the Stone-Cech boundary of the natural numbers by defining the structure ([0,1]^N/Fin, 0, 1, <=, not, o-plus) inside the group via involution conjugacy classes and the normalized Hamming distance to the identity. Third, OCA converts that boundary automorphism into an almost permutation. Fourth, the metric lifting theorem converts the resulting pseudometric-preserving isomorphism into product form, where the stability theorem applies.","core_discovery":"The paper's main theorem states that, assuming OCA and MA_alpha1($\\sigma$-linked), every isomorphism phi from Sym[(k_n)_n] to Sym[(l_n)_n] is trivial. Concretely, there is an almost permutation f of the natural numbers with lim_n k_{f(n)}/l_n = 1 and an element $\\sigma$ of Sym[(l_n)_n] such that phi maps each element (a_n)_n to (sigma_n (a_{f(n)} updownarrow Sym(l_n)) $sigma_n^{{-1}}$)_n, where updownarrow denotes cutting a permutation to a smaller set or lifting it by adding fixed points. The paper derives two consequences: the outer automorphism group of Sym[(k_n)_n] is isomorphic to the group of almost permutations f with lim_n k_{f(n)}/k_n = 1, and the groups Sym[(k_n)_n] and Sym[(l_n)_n] are isomorphic exactly when the two sequences are asymptotic almost rearrangements of each other. It also proves that, under the same axioms, elementary equivalence does not imply isomorphism, while under the continuum hypothesis the groups are elementarily equivalent exactly when they are isomorphic.","pith_inferences":["The same proof route, with a suitable Ulam-stability result, is expected to transfer the triviality theorem to unitary groups with normalized trace norm, yielding rigidity for the unitary group of the corona algebra; the paper lists this as a natural next step.","The dichotomy between the forcing-axiom universe and the continuum-hypothesis universe suggests a model-theoretic signature: under CH, isomorphism coincides with elementary equivalence, whereas under OCA/MA it is a purely combinatorial condition on the defining sequences.","The rigidity pattern may extend to other reduced products of finite metric groups with bi-invariant metrics, where the same combination of Ulam stability, Stone-Cech boundary automorphisms, and metric lifting could apply."],"forward_implications":["The outer automorphism group of Sym[(k_n)_n] is exactly the group of almost permutations of N that asymptotically preserve the sequence k_n.","Two such metric reduced products are isomorphic exactly when their defining sequences are asymptotic almost rearrangements of each other.","If the logarithms of the coordinate sizes are separated by a positive lower bound, then Sym[(k_n)_n] is complete: every automorphism is inner.","Under OCA and MA_alpha1(sigma-linked), there are elementarily equivalent but non-isomorphic groups Sym[(k_n)_n], a phenomenon that cannot occur under the continuum hypothesis.","There are exactly continuum-many isomorphism classes of metric reduced products of symmetric groups."],"supporting_citations":[{"why":"Supplies the Ulam-stability theorem for approximate homomorphisms of finite symmetric groups on which Theorem 3.2 is built.","marker":"[2]"},{"why":"Provides the result, used with OCA, that automorphisms of P(N)/Fin are induced by almost permutations.","marker":"[5]"},{"why":"Provides the metric lifting theorem that turns pseudometric-preserving isomorphisms into product-form maps.","marker":"[6]"},{"why":"Supplies the isometric-ultraproduct result and the construction of many non-isomorphic sequences used for the lower bound on isomorphism classes.","marker":"[1]"},{"why":"Used to identify [0,1]^N/Fin with C(beta-N,[0,1]) so that structure automorphisms correspond to autohomeomorphisms of the Stone-Cech boundary.","marker":"[4]"},{"why":"Kaplansky's lattice theorem is cited for the same identification of [0,1]^N/Fin with continuous functions on the Stone-Cech boundary.","marker":"[16]"}],"fun_headline_variants":["OCA+MA: symmetric-group limit isomorphisms are trivial","Forcing axioms reduce symmetric-group limit isomorphisms to permutations","Under OCA+MA, symmetric-group limits have only trivial isomorphisms","Symmetric-group limits: isomorphisms collapse to permutations under OCA+MA","OCA and MA force trivial isomorphisms for symmetric-group limits"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof rests on the claim that the operation turning an involution's support fraction into one minus that fraction is uniquely definable from the group structure; that uniqueness fails in concrete finite symmetric groups.","fun_headline_variants_meta":{"raw":{"variants":["OCA+MA: symmetric-group limit isomorphisms are trivial","Forcing axioms reduce symmetric-group limit isomorphisms to permutations","Under OCA+MA, symmetric-group limits have only trivial isomorphisms","Symmetric-group limits: isomorphisms collapse to permutations under OCA+MA","OCA and MA force trivial isomorphisms for symmetric-group limits"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000801,"raw_usage":{"total_tokens":3446,"prompt_tokens":794,"completion_tokens":2652,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":410,"completion_tokens_details":{"reasoning_tokens":2557}},"tokens_in":410,"tokens_out":2652,"duration_ms":17426,"temperature":1.0,"reasoning_tokens":2557,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T15:38:25.216146+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"In Sym(6), the uniqueness used to define not D1(a) fails: for a=(12)(34)(56) and b=(13)(24), the defining conditions are satisfied by b with D1(b)=2/3 and D1(ab)=1, not with D1(b)=1. This refutes the definability lemma behind Theorem 3.5, so the proof as written has a concrete gap.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the Ulam-stability theorem for approximate homomorphisms of finite symmetric groups on which Theorem 3.2 is built."},{"cited_title":"Dubuc and Daniele Mundici , Extending Stone duality to multisets and locally finite MV-algebras , Journal of Pure and Applied Algebra 189 (2004), no","cited_arxiv_id":null,"evidence_quote":"Used to identify [0,1]^N/Fin with C(beta-N,[0,1]) so that structure automorphisms correspond to autohomeomorphisms of the Stone-Cech boundary."},{"cited_title":"II , Amer","cited_arxiv_id":null,"evidence_quote":"Kaplansky's lattice theorem is cited for the same identification of [0,1]^N/Fin with continuous functions on the Stone-Cech boundary."}],"review_version":1}