pith. sign in

arxiv: 2605.22314 · v1 · pith:3EQPD2VJnew · submitted 2026-05-21 · 🧮 math.LO

Higher-arity distality and forking triviality

Mervyn Tong This is my paper

Pith reviewed 2026-05-22 02:06 UTC · model grok-4.3

classification 🧮 math.LO
keywords k-trivialitysimple theoriesdistalityforkingstable theoriesquantifier eliminationreducts
0
0 comments X

The pith

k-triviality collapses to 1-triviality among simple theories

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that in simple theories, k-triviality for any k is equivalent to ordinary 1-triviality. This immediately implies that every stable theory with quantifier elimination in a relational language of bounded arity must be trivial. The collapse is applied to construct examples of strongly k-distal theories and to show that no stable theory can be strictly k-distal for k at least 3. Four classes of (strongly) k-distal theories that are not k-ary are exhibited, and it is shown that k-distality is not preserved under reducts.

Core claim

Among simple theories, k-triviality collapses to 1-triviality. Consequently every stable theory with quantifier elimination in a relational language of bounded arity is trivial. This fact, combined with other properties of k-triviality and k-total triviality, generates examples of strongly k-distal theories. The collapse rules out stable theories that are strictly k-distal for k greater than or equal to 3. Four classes of examples are given in which (strongly) k-distal theories fail to be k-ary, and (strong) k-distality is shown not to be preserved under taking reducts.

What carries the argument

The collapse of k-triviality to 1-triviality with respect to forking independence inside simple theories

If this is right

  • No stable theory can be strictly k-distal for any k at least 3.
  • Four classes of (strongly) k-distal theories exist that are not k-ary.
  • Every stable theory with quantifier elimination in a relational language of bounded arity is trivial.
  • (Strong) k-distality is not preserved under taking reducts.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The equivalence of different arities for triviality may streamline classification efforts inside the simple theories.
  • The non-preservation result under reducts suggests k-distality depends on the precise choice of language in ways that could be explored further.
  • If similar collapses hold outside simple theories, higher-arity dividing lines might prove less useful for broader classification.

Load-bearing premise

The theory under consideration belongs to the class of simple theories.

What would settle it

A simple theory that is k-trivial for some k greater than 1 but fails to be 1-trivial would disprove the collapse.

read the original abstract

Answering a question of Goode, we show that $k$-triviality collapses to (1-)triviality among simple theories. In particular, every stable theory with quantifier elimination in a relational language of bounded arity is trivial. We use our collapse result, along with other facts about $k$-triviality and $k$-total triviality, to generate examples of (strongly) $k$-distal theories. The collapse result immediately implies that no stable theory can be strictly $k$-distal for some $k\geq 3$, partially answering a question of Walker. Moreover, all known examples of non-distal (strongly) $k$-distal theories are $k$-ary, rendering (strong) $k$-distality moot as a $(k+1)$-ary dividing line; we give four classes of examples that are not $k$-ary. We also show that just as distality is not preserved under taking reducts, neither is (strong) $k$-distality.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript proves that k-triviality collapses to 1-triviality among simple theories, answering a question of Goode. In particular, every stable theory with quantifier elimination in a relational language of bounded arity is trivial. The authors apply the collapse together with other facts about k-triviality and k-total triviality to produce examples of (strongly) k-distal theories, show that no stable theory is strictly k-distal for k≥3 (partially answering a question of Walker), exhibit four classes of non-k-ary examples, and prove that (strong) k-distality is not preserved under reducts.

Significance. The collapse result is a solid contribution to the model-theoretic study of forking triviality. Its direct character—relying only on the definition of simplicity (forking equals dividing) together with the higher-arity triviality hypothesis, without extra global assumptions—is a clear strength. The immediate consequences for stable theories with bounded-arity QE, the partial resolution of Walker’s question, the supply of non-k-ary k-distal examples, and the reduct non-preservation result all help clarify the status of higher-arity distality as a dividing line.

minor comments (2)
  1. [Abstract] The abstract states the main theorems clearly but supplies no proof details or verification steps; a single sentence sketching the key step of the collapse (e.g., how the simplicity assumption is used) would improve readability without lengthening the abstract.
  2. The four classes of non-k-ary examples are announced but their distinguishing features (arity, stability, etc.) could be summarized in a short table or enumerated list for quicker comparison.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, including the recognition of the directness of the collapse result and its consequences for stable theories, Walker's question, and the status of higher-arity distality. We appreciate the recommendation of minor revision.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The manuscript establishes the collapse of k-triviality to 1-triviality inside simple theories via a direct argument that uses only the definition of simplicity (forking equals dividing) together with the higher-arity triviality assumption. No load-bearing step reduces to a self-citation, fitted parameter, or ansatz imported from prior work by the same authors. The subsequent application to stable theories with bounded-arity QE follows immediately from the collapse without invoking any external uniqueness theorem or renaming of known results. The derivation is therefore self-contained against the stated assumptions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The work rests on the standard definition of simple theories and on previously known facts about k-triviality and k-total triviality; no new free parameters or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption The ambient theory is simple
    Collapse result is stated to hold among simple theories.

pith-pipeline@v0.9.0 · 5698 in / 1111 out tokens · 67517 ms · 2026-05-22T02:06:25.967534+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

30 extracted references · 30 canonical work pages · 2 internal anchors

  1. [1]

    Abd Aldaim, G

    A. Abd Aldaim, G. Conant, and C. Terry. Higher arity stability and the functional order property.Selecta Mathematica New Series, 31(59):1–79, 2025.doi:10.1007/s00029-025-01055-4

    work page doi:10.1007/s00029-025-01055-4 2025

  2. [2]

    Simple Homogeneous Structures and Indiscernible Sequence Invariants

    John Baldwin, James Freitag, and Scott Mutchnik. Simple homogeneous structures and indiscernible se- quence invariants, 2026.arXiv:2405.08211

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  3. [3]

    Baldwin and Leo Harrington

    John T. Baldwin and Leo Harrington. Trivial pursuit: Remarks on the main gap.Annals of Pure and Applied Logic, 34(3):209–230, 1987.doi:10.1016/0168-0072(87)90001-7

    work page doi:10.1016/0168-0072(87)90001-7 1987

  4. [4]

    Structures preserved by primitive actions ofS ω, 2025.arXiv:2501

    Manuel Bodirsky and Bertalan Bodor. Structures preserved by primitive actions ofS ω, 2025.arXiv:2501. 03789

    work page 2025

  5. [5]

    Stable and simple theories (Lecture Notes).https://www.ub.edu/modeltheory/docum entos/stability.pdf, 2007

    Enrique Casanovas. Stable and simple theories (Lecture Notes).https://www.ub.edu/modeltheory/docum entos/stability.pdf, 2007

    work page 2007

  6. [6]

    1985 , issn =

    G. Cherlin, L. Harrington, and A.H. Lachlan.ℵ 0-categorical,ℵ 0-stable structures.Annals of Pure and Applied Logic, 28(2):103–135, 1985.doi:10.1016/0168-0072(85)90023-5

    work page doi:10.1016/0168-0072(85)90023-5 1985

  7. [7]

    Cherlin and A

    G. Cherlin and A. H. Lachlan. Stable finitely homogeneous structures.Transactions of the American Math- ematical Society, 296(2):815–850, 1986.doi:10.2307/2000390

    work page doi:10.2307/2000390 1986

  8. [8]

    Onn-dependent groups and fields II.Forum of Mathematics, Sigma, 9(e38):1–51, 2021.doi:10.1017/fms.2021.35

    Artem Chernikov and Nadja Hempel. Onn-dependent groups and fields II.Forum of Mathematics, Sigma, 9(e38):1–51, 2021.doi:10.1017/fms.2021.35

    work page doi:10.1017/fms.2021.35 2021

  9. [9]

    Onn-dependent groups and fields III

    Artem Chernikov and Nadja Hempel. Onn-dependent groups and fields III. Multilinear forms and invariant connected components, 2025.arXiv:2412.19921

    work page arXiv 2025

  10. [10]

    Onn-dependence.Notre Dame Journal of Formal Logic, 60(2):195–214, 2019.doi:10.1215/00294527-2019-0002

    Artem Chernikov, Daniel Palacin, and Kota Takeuchi. Onn-dependence.Notre Dame Journal of Formal Logic, 60(2):195–214, 2019.doi:10.1215/00294527-2019-0002

    work page doi:10.1215/00294527-2019-0002 2019

  11. [11]

    On n-distality, n-triviality and hypergraph regularity in NIP theories

    Artem Chernikov and Francis Westhead. Onn-distality,n-triviality and hypergraph regularity in NIP the- ories, 2026.arXiv:2605.04714

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  12. [12]

    Trivial stable structures with non-trivial reducts

    David Evans. Trivial stable structures with non-trivial reducts. Unpublished notes,https://www.ma.imper ial.ac.uk/~dmevans/marriagefinal.pdf, October 2004

    work page 2004

  13. [13]

    John B. Goode. Some trivial considerations.The Journal of Symbolic Logic, 56(2):624–631, 1991.doi: 10.2307/2274704

    work page doi:10.2307/2274704 1991

  14. [14]

    Onn-dependent groups and fields.Mathematical Logic Quarterly, 62(3):215–224, 2016.doi: 10.1002/malq.201400080

    Nadja Hempel. Onn-dependent groups and fields.Mathematical Logic Quarterly, 62(3):215–224, 2016.doi: 10.1002/malq.201400080

    work page doi:10.1002/malq.201400080 2016

  15. [15]

    Binary primitive homogeneous simple structures.The Journal of Symbolic Logic, 82(1):183– 207, 2017.doi:10.1017/jsl.2016.51

    Vera Koponen. Binary primitive homogeneous simple structures.The Journal of Symbolic Logic, 82(1):183– 207, 2017.doi:10.1017/jsl.2016.51

    work page doi:10.1017/jsl.2016.51 2017

  16. [16]

    Interpreting groups inω-categorical structures.The Journal of Symbolic Logic, 56(4):1317–1324, 1991.doi:10.2307/2275477

    Dugald MacPherson. Interpreting groups inω-categorical structures.The Journal of Symbolic Logic, 56(4):1317–1324, 1991.doi:10.2307/2275477

    work page doi:10.2307/2275477 1991

  17. [17]

    All these approximate Ramsey properties, 2023.arXiv:2307.14468

    Nadav Meir and Aris Papadopoulos. All these approximate Ramsey properties, 2023.arXiv:2307.14468

    work page arXiv 2023

  18. [18]

    Generalized amalgamation and homogeneity.The Journal of Symbolic Logic, 82(4):1409– 1421, 2017.doi:10.1017/jsl.2016.67

    Daniel Palac´ ın. Generalized amalgamation and homogeneity.The Journal of Symbolic Logic, 82(4):1409– 1421, 2017.doi:10.1017/jsl.2016.67

    work page doi:10.1017/jsl.2016.67 2017

  19. [19]

    Oxford Logic Guides

    Anand Pillay.Geometric Stability Theory. Oxford Logic Guides. Clarendon Press, New York, 1996. HIGHER-ARITY DISTALITY AND FORKING TRIVIALITY 17

    work page 1996

  20. [20]

    The geometry of 1-based minimal types.Transactions of the American Mathematical Society, 355(10):4241–4263, 2003.doi:10.1090/s0002-9947-03-03327-0

    Tristram De Piro and Byunghan Kim. The geometry of 1-based minimal types.Transactions of the American Mathematical Society, 355(10):4241–4263, 2003.doi:10.1090/s0002-9947-03-03327-0

    work page doi:10.1090/s0002-9947-03-03327-0 2003

  21. [21]

    Strongly dependent theories.Israel Journal of Mathematics, 204:1–83, 2014.doi:10.1007/ s11856-014-1111-2

    Saharon Shelah. Strongly dependent theories.Israel Journal of Mathematics, 204:1–83, 2014.doi:10.1007/ s11856-014-1111-2

    work page 2014

  22. [22]

    Definable groups for dependent and 2-dependent theories.Sarajevo Journal of Mathematics, 13(1):3–25, 2017.doi:10.5644/SJM.13.1.01

    Saharon Shelah. Definable groups for dependent and 2-dependent theories.Sarajevo Journal of Mathematics, 13(1):3–25, 2017.doi:10.5644/SJM.13.1.01

    work page doi:10.5644/sjm.13.1.01 2017

  23. [23]

    Distal and non-distal NIP theories.Annals of Pure and Applied Logic, 164(3):294–318, 2013

    Pierre Simon. Distal and non-distal NIP theories.Annals of Pure and Applied Logic, 164(3):294–318, 2013. doi:10.1016/j.apal.2012.10.015

    work page doi:10.1016/j.apal.2012.10.015 2013

  24. [24]

    Lecture Notes in Logic

    Katrin Tent and Martin Ziegler.A Course in Model Theory. Lecture Notes in Logic. Cambridge University Press, New York, 2012.doi:10.1017/CBO9781139015417

    work page doi:10.1017/cbo9781139015417 2012

  25. [25]

    Terry and J

    C. Terry and J. Wolf. Higher-order generalizations of stability and arithmetic regularity, 2025.arXiv:2111. 01739

    work page 2025

  26. [26]

    Terry and J

    C. Terry and J. Wolf. Irregular triads in 3-uniform hypergraphs, 2025.arXiv:2111.01737

    work page arXiv 2025

  27. [27]

    The Journal of Symbolic Logic , volume =

    Simon Thomas. Reducts of the random graph.The Journal of Symbolic Logic, 56(1):176–181, 1991.doi: 10.2307/2274912

    work page doi:10.2307/2274912 1991

  28. [28]

    Reducts of random hypergraphs.Annals of Pure and Applied Logic, 80(2):165–193, 1996

    Simon Thomas. Reducts of random hypergraphs.Annals of Pure and Applied Logic, 80(2):165–193, 1996. doi:10.1016/0168-0072(95)00061-5

    work page doi:10.1016/0168-0072(95)00061-5 1996

  29. [29]

    Distality rank.The Journal of Symbolic Logic, 88(2):704–737, 2023.doi:10.1017/jsl.2022

    Roland Walker. Distality rank.The Journal of Symbolic Logic, 88(2):704–737, 2023.doi:10.1017/jsl.2022. 61

    work page doi:10.1017/jsl.2022 2023

  30. [30]

    PhD thesis, University of Illinois at Chicago, 2023

    Roland Walker.Distality Rank and Tree Dimension. PhD thesis, University of Illinois at Chicago, 2023. doi:10.25417/uic.23661723.v1. Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sci- ences, Wilberforce Road, Cambridge CB3 0WB, United Kingdom Email address:hwmt3@cam.ac.uk

    work page doi:10.25417/uic.23661723.v1 2023