pith. sign in

arxiv: 2605.19513 · v1 · pith:OJ3Y2QBLnew · submitted 2026-05-19 · 🧮 math.LO

Trace definability IV: higher arity notions

Erik Walsberg This is my paper

Pith reviewed 2026-05-20 02:18 UTC · model grok-4.3

classification 🧮 math.LO MSC 03Cxx
keywords trace definabilityk-NIP theoriesNIP theoriesmodel theoryfirst-order theoriesuniversal theoriesstability theory
5
0 comments X

The pith

k-trace definability identifies universal theories for several main k-NIP structures inside simpler NIP theories.

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

The paper introduces k-trace definability as a relation between first-order theories that captures how higher-arity complexity can be traced from a base theory. It establishes that any theory k-trace definable in a NIP theory must itself be k-NIP, and that any theory 2-trace definable in a stable theory must be 2-NFOP. The central results show that prominent k-NIP theories, such as those of Hilbert space, generic nilpotent Lie algebras, hypergraphs, and Urysohn space, function as the unique universal theories under k-trace definability in specific NIP bases like real closed fields or vector spaces. A general construction produces, for any theory T, a universal theory D_k(T) that is k-trace definable in T. This framework offers a compositional view of how k-NIP behavior arises from trace operations in base structures.

Core claim

For several of the main examples of k-NIP theories T there is a NIP theory T* such that T is the unique universal theory which is k-trace definable in T*. Concrete cases include the theory of Hilbert space as the universal 2-trace definable theory in RCF, the theory of the generic k-nilpotent Lie algebra over F_p as the universal k-trace definable theory in the theory of infinite F_p-vector spaces, the theory of the generic k-hypergraph as the universal k-trace definable theory in the theory of a two-element set, and the theory of Urysohn space as the universal 2-trace definable theory in the theory of (R; +, <). The paper also constructs the universal theory D_k(T) which is k-trace definabe

What carries the argument

k-trace definability, a relation in which one theory arises by taking controlled traces of higher-arity formulas from the base theory.

Load-bearing premise

The chosen definition of k-trace definability is robust enough to support the preservation theorems and the universality claims for the listed examples.

What would settle it

A concrete k-NIP theory that cannot be realized as k-trace definable in any NIP theory, or a failure of uniqueness up to the paper's equivalence notion for one of the listed examples.

read the original abstract

Motivated by the "composition theorems" of Chernikov-Hempel and Abd Aldaim-Conant-Terry we introduce $k$-trace definability between first order theories. Any theory which is $k$-trace definable in a NIP theory is $k$-NIP and any theory which is $2$-trace definable in a stable theory is $2$-NFOP. All known examples of $k$-NIP theories are $k$-trace definable in NIP theories. We show that for several of the main examples of $k$-NIP theories $T$ there is a NIP theory $T^*$ such that $T$ is the (unique up to a certain notion of equivalence) universal theory which is $k$-trace definable in $T^*$. For example the theory of Hilbert space is the universal theory which is $2$-trace definable in RCF, the theory of the generic class $k$ nilpotent Lie algebra over $\mathbb{F}_p$ is the universal theory which is $k$-trace definable in the theory of infinite $\mathbb{F}_p$-vector spaces, the theory of the generic $k$-hypergraph is the universal theory which is $k$-trace definable in the theory of a set with two elements, and the theory of Uryshon space is the universal theory which is $2$-trace definable in the theory of $(\mathbb{R}; +, <)$. We construct the universal theory $D_k(T)$ which is $k$-trace definable in an arbitrary theory $T$.

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 paper introduces the notion of k-trace definability between first-order theories, motivated by composition theorems of Chernikov-Hempel and Abd Aldaim-Conant-Terry. It proves preservation results showing that any theory k-trace definable in a NIP theory is k-NIP, and any theory 2-trace definable in a stable theory is 2-NFOP. The paper constructs an explicit universal theory D_k(T) for arbitrary T and shows that for several main examples of k-NIP theories T (theory of Hilbert space, generic k-nilpotent Lie algebra over F_p, generic k-hypergraph, theory of Urysohn space) there exists a NIP theory T* such that T is the unique (up to a specified equivalence) universal k-trace definable theory in T*.

Significance. If the results hold, the paper provides a coherent framework for realizing k-NIP theories as trace-definable in simpler NIP bases, with explicit universal objects D_k(T) and concrete examples. The preservation theorems and universality claims strengthen the toolkit for studying dividing lines and composition in model theory, particularly for higher-arity generalizations of NIP and NFOP.

minor comments (2)
  1. The abstract refers to 'a certain notion of equivalence' for uniqueness; this notion should be defined or referenced explicitly in the introduction or §2 to allow readers to assess the universality claims without delay.
  2. The construction of D_k(T) is central; a brief outline of its definition and the verification that it is k-trace definable in T would improve readability in the early sections.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, recognition of the significance of the preservation theorems and universality constructions, and the recommendation for minor revision. We will prepare a revised version incorporating any minor improvements.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper introduces the new notion of k-trace definability from first principles and explicitly constructs the universal theory D_k(T) for arbitrary T. Preservation results (k-NIP theories remain k-NIP when k-trace definable in NIP theories, and 2-NFOP when 2-trace definable in stable theories) and the universality claims for concrete examples such as Hilbert space in RCF or generic k-hypergraphs in two-element sets follow directly from these definitions and constructions. No load-bearing step reduces by equation or self-citation to a prior fitted input or renamed result; the derivation chain is self-contained against external model-theoretic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The paper rests on the standard background of first-order model theory plus the newly introduced definition of k-trace definability; no free parameters or new physical entities are involved.

axioms (1)
  • standard math Standard axioms and definitions of first-order logic, NIP theories, and stability
    The entire development occurs inside classical model theory.
invented entities (1)
  • k-trace definability relation no independent evidence
    purpose: To provide a higher-arity notion of definability between theories that preserves NIP-like properties
    This is the central new definition introduced to organize the examples and prove the stated theorems.

pith-pipeline@v0.9.0 · 5804 in / 1184 out tokens · 38640 ms · 2026-05-20T02:18:22.428265+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

26 extracted references · 26 canonical work pages

  1. [1]

    Abd Aldaim, G

    A. Abd Aldaim, G. Conant, and C. Terry. Higher arity stability and the functional order property. Selecta Mathematica, 31(3):59, Jun 2025

    work page 2025

  2. [2]

    Aschenbrenner, L

    M. Aschenbrenner, L. van den Dries, and J. van der Hoeven.Asymptotic differential algebra and model theory of transseries, volume 195 ofAnnals of Mathematics Studies. Princeton University Press, Prince- ton, NJ, 2017

    work page 2017

  3. [3]

    Baudisch

    A. Baudisch. A fraisse limit of nilpotent groups of finite exponent.Bulletin of the London Mathematical Society, 33(5):513–519, 2001

    work page 2001

  4. [4]

    Berenstein, A

    A. Berenstein, A. Dolich, and A. Onshuus. The independence property in generalized dense pairs of structures.The Journal of Symbolic Logic, 76(2):391–404, 2011

    work page 2011

  5. [5]

    Bodirsky

    M. Bodirsky. New ramsey classes from old.The Electronic Journal of Combinatorics, 21(2), May 2014

    work page 2014

  6. [6]

    Chernikov and N

    A. Chernikov and N. Hempel. On n-dependent groups and fields II.Forum of Mathematics, Sigma, 9:e38, 2021

    work page 2021

  7. [7]

    Chernikov and N

    A. Chernikov and N. Hempel. On n-dependent groups and fields III. multilinear forms and invariant connected components, 2025

    work page 2025

  8. [8]

    Chernikov and N

    A. Chernikov and N. Ramsey. On model-theoretic tree properties.J. Math. Log., (16):1650009 [41 pages], 2016

    work page 2016

  9. [9]

    d’Elb´ ee, I

    C. d’Elb´ ee, I. M¨ uller, N. Ramsey, and D. Siniora. Model-theoretic properties of nilpotent groups and lie algebras.Journal of Algebra, 662:640–701, 2025

    work page 2025

  10. [10]

    D’Elbee, I

    C. D’Elbee, I. Muller, N. Ramsey, and D. Siniora. A two-sorted theory of nilpotent lie algebras.The Journal of Symbolic Logic, page 1–24, 2025

    work page 2025

  11. [11]

    U. Felgner. Onℵ 0-categorical extra-special p-groups.Logique Et Analyse, 18(71-72):407–428, 1975

    work page 1975

  12. [12]

    Guingona and M

    V. Guingona and M. Parnes. Ranks based on strong amalgamation Fra¨ ıss´ e classes.Arch. Math. Logic, 62(7-8):889–929, 2023

    work page 2023

  13. [13]

    N. Hempel. Onn-dependent groups and fields.MLQ Math. Log. Q., 62(3):215–224, 2016

    work page 2016

  14. [14]

    Hodges.Model theory, volume 42 ofEncyclopedia of mathematics and its applications

    W. Hodges.Model theory, volume 42 ofEncyclopedia of mathematics and its applications. Cambridge University Press, 1993

    work page 1993

  15. [15]

    Jeˇ r´ abek

    E. Jeˇ r´ abek. Recursive functions and existentially closed structures.Journal of Mathematical Logic, 20(01):2050002, 2020

    work page 2020

  16. [16]

    H. Kikyo. On the Groups with Homogeneous Theory.Tsukuba Journal of Mathematics, 22(2):551 – 557, 1998

    work page 1998

  17. [17]

    A. A. Kuzichev. Elimination of quantifiers over vectors in some theories of vector spaces.Mathematical Logic Quarterly, 38(1):575–577, 1992

    work page 1992

  18. [18]

    M. Lazard. Sur les groupes nilpotents et les anneaux de Lie.Annales scientifiques de l’ ´Ecole Normale Sup´ erieure, 3e s´ erie, 71(2):101–190, 1954

    work page 1954

  19. [19]

    Macpherson

    D. Macpherson. Interpreting groups inω-categorical structures.J. Symbolic Logic, 56(4):1317–1324, 1991

    work page 1991

  20. [20]

    P. S. Novikov and S. I. Adjan. On abelian subgroups and the conjugacy problem in free periodic groups of odd order.Mathematics of the USSR-Izvestiya, 2(5):1131, oct 1968

    work page 1968

  21. [21]

    F. Oger. An application of ramsey’s theorem to groups with homogeneous theory.Communications in Algebra, 28(6):2977–2981, 2000

    work page 2000

  22. [22]

    D. J. S. Robinson.A Course in the Theory of Groups. Springer New York, 1996

    work page 1996

  23. [23]

    R. M. Solovay, R. Arthan, and J. Harrison. Some new results on decidability for elementary algebra and geometry.Annals of Pure and Applied Logic, 163(12):1765–1802, 2012

    work page 2012

  24. [24]

    Walsberg

    E. Walsberg. Trace definability I: Preservation and characterizations, 2026

    work page 2026

  25. [25]

    Walsberg

    E. Walsberg. Trace definability II: Model-theoretic linearity, 2026

    work page 2026

  26. [26]

    Walsberg

    E. Walsberg. Trace definability III: Infinite dimensional space over a model ofT, 2026. Email address:erik.walsberg@gmail.com 35

    work page 2026