arxiv: 2605.04934 · v1 · submitted 2026-05-06 · 🧮 math.LO

Recognition: unknown

On lam-existence over a predicate

Alexander Usvyatsov

Authors on Pith no claims yet

Pith reviewed 2026-05-08 16:26 UTC · model grok-4.3

classification 🧮 math.LO

keywords model theorystabilitysaturated modelspredicateslambda-completenessexistence propertycountable theories

0 comments

The pith

In a countable theory fully stable over a predicate, any λ-complete set extends to a λ-saturated model without changing the predicate part.

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

The paper establishes that under full stability over a predicate in countable theories, the λ-existence property holds for λ-complete sets. This property allows extending a set to a λ-saturated model while keeping the interpretation of the predicate unchanged. A sympathetic reader would care because it shows that such extensions fail only when obvious necessary conditions, captured by λ-completeness, are not met. Thus, non-trivial obstructions to building saturated models over predicates are eliminated in these theories.

Core claim

In a countable theory T that is fully stable over a predicate P, every λ-complete set A possesses the λ-existence property. This means that A can be extended to a λ-saturated model of T in which the P-part remains the same as in A. The λ-completeness of A incorporates the necessary conditions, such as the P-part of A being a λ-saturated model of the induced theory on P, ensuring that λ-existence can only fail for these trivial reasons.

What carries the argument

The λ-completeness of a set, which encodes the conditions required for extending it to a λ-saturated model without altering the predicate.

If this is right

λ-existence holds whenever the obvious necessary conditions are satisfied.
Models can be constructed by extending λ-complete sets while preserving the predicate.
This applies to any countable theory fully stable over a predicate.
λ-existence can only fail for trivial reasons captured by the completeness notion.

Where Pith is reading between the lines

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

This approach might simplify model construction in theories with distinguished predicates.
Similar completeness notions could be defined for other saturation properties.
The result suggests that stability over predicates removes many barriers to finding saturated extensions.

Load-bearing premise

The theory must be countable and fully stable over the predicate, with λ-completeness accurately capturing all prerequisites for the extension.

What would settle it

A counterexample consisting of a countable fully stable theory T over predicate P and a λ-complete set A that cannot be extended to any λ-saturated model of T while keeping the P-part fixed would disprove the claim.

read the original abstract

We prove that in a countable theory $T$ fully stable over a predicate $P$, any $\lam$-complete set $A$ has the $\lam$-existence property. This means that $A$ can be extended to a $\lam$-saturated model of $T$ without changing the $P$-part. The notion of $\lam$-completeness, introduced in this paper, captures some obvious necessary conditions for such an extension to be possible (for example, the $P$-part of $A$ has to be a $\lam$-saturated model of the appropriate theory). So in a fully stable theory $T$, $\lam$-existence can only fail for trivial reasons. This generalizes results of Chatzidakis in the context of difference fields of characteristic 0.

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.

Desk Editor's Note private letter to a colleague

The paper defines λ-completeness and proves it suffices for λ-existence over a predicate in countable fully stable theories, generalizing Chatzidakis without circularity.

read the letter

The central point is that in a countable theory T fully stable over a predicate P, any λ-complete set A extends to a λ-saturated model of T while keeping the P-interpretation fixed. λ-completeness is defined to capture the necessary conditions, such as the P-part already being λ-saturated in the right way, and the paper shows these are also sufficient under full stability. This is a direct generalization of Chatzidakis' results on difference fields of characteristic zero, and the argument appears internally consistent with no hidden reductions or fitting issues. The proof constructs the extension explicitly while fixing P, and verifies that stability removes further obstructions. The paper does well by isolating this technical detail that shows up in constructions and giving it a clean sufficient condition. It organizes the material without overclaiming. The main limitation is the countability assumption on T, which narrows the scope, and full stability over P is a strong hypothesis that may not hold in every application one cares about. The definition of λ-completeness looks reasonable on the surface but would benefit from explicit checks against edge cases in the full text. This is aimed at model theorists working on stability, saturated models, and predicates or expansions like difference fields. Someone building models or checking extension properties in stable settings would find the statement useful for reference. It deserves a serious referee because the generalization is genuine and the reasoning holds up on its own terms.

Referee Report

0 major / 2 minor

Summary. The manuscript proves that in a countable theory T fully stable over a predicate P, any λ-complete set A has the λ-existence property: A extends to a λ-saturated model of T with the interpretation of P held fixed. The authors introduce λ-completeness to encode the necessary conditions for such an extension (e.g., the P-part of A being λ-saturated) and show sufficiency under full stability. The argument constructs the extension directly and generalizes Chatzidakis' results for difference fields of characteristic zero.

Significance. If the result holds, it supplies a clean, checkable criterion for λ-saturated extensions that preserve a predicate, showing that non-existence occurs only for the trivial obstructions captured by λ-completeness. This strengthens the toolkit for model-theoretic constructions in stable theories with distinguished predicates and directly extends prior work on difference fields without introducing new cardinality restrictions or circular reductions.

minor comments (2)

[Abstract] The abstract refers to 'the appropriate theory' satisfied by the P-part of A; an explicit reference to the induced theory on P (or a forward pointer to its definition) would make the statement of the main result self-contained.
[Main theorem] The construction in the proof of the main theorem fixes the P-interpretation while building the extension; a brief outline of the inductive steps or the role of full stability in eliminating further obstructions would improve readability for readers unfamiliar with the Chatzidakis context.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No specific major comments appear in the report.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The manuscript defines λ-completeness to encode the evident necessary conditions (such as λ-saturation of the P-part) and then proves, via direct construction of the extension while preserving the P-interpretation, that these conditions suffice for λ-existence whenever T is countable and fully stable over P. The argument relies on the stability hypothesis to rule out further obstructions and generalizes the external Chatzidakis results; no step reduces by construction to a fitted parameter, self-referential definition, or load-bearing self-citation. The derivation is therefore a standard mathematical sufficiency proof rather than a tautology.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The result rests on standard model-theoretic background plus the new definition of λ-completeness; no data-fitting parameters appear.

axioms (2)

domain assumption T is a countable theory
Explicitly stated as the ambient setting for the theorem.
domain assumption T is fully stable over the predicate P
Central hypothesis required for the stability and saturation arguments.

invented entities (1)

λ-completeness no independent evidence
purpose: To encode the necessary conditions (such as P-part being λ-saturated) for the extension to exist
New technical notion defined in the paper to make the statement precise and non-vacuous.

pith-pipeline@v0.9.0 · 5420 in / 1125 out tokens · 26685 ms · 2026-05-08T16:26:41.209722+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

138 extracted references · 33 canonical work pages

[1]

Continuous first order logic and local stability , JOURNAL =

Ben Yaacov, Ita. Continuous first order logic and local stability , JOURNAL =. 2010 , NUMBER =. doi:10.1090/S0002-9947-10-04837-3 , URL =

work page doi:10.1090/s0002-9947-10-04837-3 2010
[2]

Generic automorphism of a Hilbert space , journal =

Ben Yaacov, Ita\". Generic automorphism of a Hilbert space , journal =
[3]

Ben Yaacov, Ita. On. Fund. Math. , FJOURNAL =. 2007 , NUMBER =

2007
[4]

Onshuus, Alf and Usvyatsov, Alexander , TITLE =
[5]

Kaplan, Itay and Usvyatsov, Alexander , TITLE =
[6]

Thesis , VOLUME =

Usvyatsov, Alexander , TITLE =. Thesis , VOLUME =
[7]

Usvyatsov, Alexander , TITLE =
[8]

Topology Appl

Usvyatsov, Alexander , TITLE =. Topology Appl. , FJOURNAL =. 2008 , NUMBER =

2008
[9]

Generic stability, forking, and thorn-forking , JOURNAL =

Garc\'. Generic stability, forking, and thorn-forking , JOURNAL =. 2013 , NUMBER =. doi:10.1090/S0002-9947-2012-05451-1 , URL =

work page doi:10.1090/s0002-9947-2012-05451-1 2013
[10]

Onshuus, Alf , TITLE =. J. Symbolic Logic , FJOURNAL =. 2006 , NUMBER =

2006
[11]

Mathematical Logic Quarterly , FJOURNAL =

Onshuus, Alf and Peterzil, Yaacov , TITLE =. Mathematical Logic Quarterly , FJOURNAL =
[12]

Hasson, Assaf and Onshuus, Alf , TITLE =
[13]

Hasson, Assaf and Onshuus, Alf and Peterzil, Yaacov , TITLE =
[14]

Chrnikov, Artem and Kaplan, Itay , TITLE =
[15]

Adler, Hans , TITLE =
[16]

2008 , PAGES =

Haskell, Deirdre and Hrushovski, Ehud and Macpherson, Dugald , TITLE =. 2008 , PAGES =

2008
[17]

Hrushovski, Ehud , TITLE =
[18]

Journal AMS , FJOURNAL =

Hrushovski, Ehud and Peterzil, Yaacov and Pillay, Anand , TITLE =. Journal AMS , FJOURNAL =
[19]

, TITLE =

Shelah, S. , TITLE =. 1990 , PAGES =

1990
[20]

, TITLE =

Shelah, S. , TITLE =
[21]

Classification theory (Chicago, IL, 1985) , SERIES =

Shelah, Saharon , TITLE =. Classification theory (Chicago, IL, 1985) , SERIES =

1985
[22]

Shelah, Saharon , TITLE =. Sci. Math. Jpn. , FJOURNAL =. 2004 , NUMBER =

2004
[23]

Dependent first order theories, continued , volume =

Shelah, Saharon , trueauthor =. Dependent first order theories, continued , volume =. Israel Journal of Mathematics , note =
[24]

Israel J

Shelah, Saharon and Usvyatsov, Alexander , TITLE =. Israel J. Math. , FJOURNAL =. 2011 , PAGES =. doi:10.1007/s11856-011-0028-2 , URL =

work page doi:10.1007/s11856-011-0028-2 2011
[25]

Shelah, Saharon and Usvyatsov, Alexander , title =
[26]

Shelah, Saharon and Usvyatsov, Alexander , title =. Ann. Pure Appl. Logic , FJOURNAL =. 2008 , NUMBER =

2008
[27]

Advances in Mathematics , YEAR =

Shelah, Saharon and Usvyatsov, Alexander , title =. Advances in Mathematics , YEAR =
[28]

Israel J

Shelah, Saharon and Usvyatsov, Alexander , TITLE =. Israel J. Math. , FJOURNAL =. 2006 , PAGES =

2006
[29]

Strongly dependent theories , volume =

Shelah, Saharon , trueauthor =. Strongly dependent theories , volume =. submitted , note =
[30]

Generically stable types in dependent theories , volume =

Usvyatsov, Alexander , trueauthor =. Generically stable types in dependent theories , volume =. J. Symbolic Logic , FJOURNAL =. 2009 , NUMBER =

2009
[31]

Jerome , TITLE =

Keisler, H. Jerome , TITLE =. Ann. Pure Appl. Logic , FJOURNAL =. 1987 , NUMBER =

1987
[32]

Lascar, Daniel and Poizat, Bruno , TITLE =. J. Symbolic Logic , FJOURNAL =. 1979 , NUMBER =

1979
[33]

Poizat, Bruno , TITLE =. J. Symbolic Logic , FJOURNAL =. 1979 , NUMBER =

1979
[34]

Dolich, Alf , TITLE =. J. Symbolic Logic , FJOURNAL =. 2004 , NUMBER =

2004
[35]

Hrushovski, Ehud , TITLE =. J. Amer. Math. Soc. , FJOURNAL =. 1996 , NUMBER =

1996
[36]

and Maurey, B

Krivine, J.-L. and Maurey, B. , TITLE =. Israel J. Math. , FJOURNAL =. 1981 , NUMBER =

1981
[37]

Krivine, J. L. , TITLE =. Ann. of Math. (2) , FJOURNAL =. 1976 , NUMBER =

1976
[38]

Wilkie, A. J. , TITLE =. J. Amer. Math. Soc. , FJOURNAL =. 1996 , NUMBER =

1996
[39]

Macintyre, Angus , TITLE =. Fund. Math. , FJOURNAL =. 1971 , NUMBER =

1971
[40]

Jerome , TITLE =

Chang, Chen-chung and Keisler, H. Jerome , TITLE =
[41]

Banach, Stefan , TITLE =
[42]

It is impossible to imbed

Tsirel. It is impossible to imbed. Funkcional. Anal. i Prilo zen. , FJOURNAL =. 1974 , NUMBER =

1974
[43]

Ward , TITLE =

Henson, C. Ward , TITLE =. Israel J. Math. , FJOURNAL =. 1976 , NUMBER =

1976
[44]

Ward and Iovino, Jos

Henson, C. Ward and Iovino, Jos. Ultraproducts in analysis , BOOKTITLE =
[45]

Model Theory for Metric Structures , BOOKTITLE =

Ben Yaacov, Ita\". Model Theory for Metric Structures , BOOKTITLE =
[46]

A complete axiomatization of discrete-measure almost-everywhere quantification , journal =

Cruz-Filipe, Lu\'. A complete axiomatization of discrete-measure almost-everywhere quantification , journal =
[47]

Baldwin, J. T. and Lachlan, A. H. , TITLE =. J. Symbolic Logic , FJOURNAL =. 1971 , PAGES =

1971
[48]

and Rosendal, Christian , TITLE =

Kechris, Alexander S. and Rosendal, Christian , TITLE =. Proc. Lond. Math. Soc. (3) , FJOURNAL =. 2007 , NUMBER =

2007
[49]

Hodges, Wilfrid and Hodkinson, Ian and Lascar, Daniel and Shelah, Saharon , TITLE =. J. London Math. Soc. (2) , FJOURNAL =. 1993 , NUMBER =

1993
[50]

Vershik, A. M. , TITLE =. Topology Appl. , FJOURNAL =. 2008 , NUMBER =

2008
[51]

and Kutzarova, D

Junge, M. and Kutzarova, D. and Odell, E. , TITLE =. Studia Math. , FJOURNAL =. 2006 , NUMBER =

2006
[52]

Forum Math

Rosendal, Christian , TITLE =. Forum Math. , FJOURNAL =. 2009 , NUMBER =

2009
[53]

, TITLE =

Conway, John B. , TITLE =. Paul
[54]

, TITLE =

Davidson, Kenneth R. , TITLE =
[55]

Ben Yaacov, Itay , TITLE =. J. Symbolic Logic , FJOURNAL =. 2005 , NUMBER =

2005
[56]

Modular functionals and perturbations of

Ben Yaacov, Ita. Modular functionals and perturbations of. J. Log. Anal. , FJOURNAL =. 2009 , PAGES =

2009
[57]

Model theoretic stability and definability of types, after

Ben Yaacov, Ita. Model theoretic stability and definability of types, after. Bull. Symb. Log. , FJOURNAL =. 2014 , NUMBER =. doi:10.1017/bsl.2014.33 , URL =

work page doi:10.1017/bsl.2014.33 2014
[58]

Topometric spaces and perturbations of metric structures , JOURNAL =

Ben Yaacov, Ita. Topometric spaces and perturbations of metric structures , JOURNAL =. 2008 , NUMBER =

2008
[59]

Berenstein, Alexander , TITLE =. Arch. Math. Logic , FJOURNAL =. 2007 , NUMBER =

2007
[60]

Rudin, Walter , TITLE =
[61]

Young, Nicholas , TITLE =
[62]

, TITLE =

Hernandez, A. , TITLE =
[63]

Pedro , TITLE =

Poitevin, L. Pedro , TITLE =
[64]

Iovino, Jos. Stable. Models, algebras, and proofs (
[65]

Definable types over

Iovino, Jos. Definable types over. Notre Dame J. Formal Logic , FJOURNAL =. 2005 , NUMBER =

2005
[66]

Heinrich, Stefan , TITLE =. J. Reine Angew. Math. , FJOURNAL =. 1980 , PAGES =

1980
[67]

Benyamini, Yoav and Lindenstrauss, Joram , TITLE =
[68]

, TITLE =

Milman, V. , TITLE =. Geom. Funct. Anal. , FJOURNAL =. 1992 , NUMBER =

1992
[69]

2006 , PAGES =

Pestov, Vladimir , TITLE =. 2006 , PAGES =

2006
[70]

Zilber, Boris , TITLE =
[71]

Generic stability, regularity, and quasiminimality , BOOKTITLE =

Pillay, Anand and Tanovi. Generic stability, regularity, and quasiminimality , BOOKTITLE =. 2011 , MRCLASS =

2011
[72]

Hrushovski, Ehud and Pillay, Anand , TITLE =. J. Eur. Math. Soc. (JEMS) , FJOURNAL =. 2011 , NUMBER =. doi:10.4171/JEMS/274 , URL =

work page doi:10.4171/jems/274 2011
[73]

Morley, Michael , TITLE =. Trans. Amer. Math. Soc. , FJOURNAL =. 1965 , PAGES =

1965
[74]

Dvoretzky, Aryeh , TITLE =. Proc. 1961 , MRCLASS =

1961
[75]

Brunel, Antoine and Sucheston, Louis , TITLE =. Math. Systems Theory , FJOURNAL =. 1974 , NUMBER =

1974
[76]

Classical sequences in

Guerre-Delabri. Classical sequences in. 1992 , PAGES =

1992
[77]

, TITLE =

Rosenthal, Haskell P. , TITLE =. J. Funct. Anal. , FJOURNAL =. 1978 , NUMBER =. doi:10.1016/0022-1236(78)90086-1 , URL =

work page doi:10.1016/0022-1236(78)90086-1 1978
[78]

Gowers, W. T. , TITLE =. Proceedings of the. 1995 , MRCLASS =

1995
[79]

Acta Math

Odell, Edward and Schlumprecht, Thomas , TITLE =. Acta Math. , FJOURNAL =. 1994 , NUMBER =. doi:10.1007/BF02398436 , URL =

work page doi:10.1007/bf02398436 1994
[80]

Ward and Raynaud, Yves , TITLE =

Henson, C. Ward and Raynaud, Yves , TITLE =. Comment. Math. , FJOURNAL =. 2016 , NUMBER =

2016

Showing first 80 references.