REVIEW 3 major objections 3 minor 19 references
Results on Colored Tree Properties
T0 review · 3 major / 3 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read A formula is unstable exactly when it has the colored tree property.
desk verdict Novel and interesting equivalences, but the proof of the main theorem has a genuine gap that needs a substantive fix. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the colored linear order c: the generic limit of finite linearly ordered sets whose elements are partitioned into colors, a Ramsey index structure with several quantifier-free 1-types. The paper defines I-tree properties for an arbitrary Ramsey index structure I, with siblings indexed by a copy of I and inconsistency of siblings measured by q-inconsistency: for a fixed quantifier-free type q, any tuple of siblings realizing q is inconsistent. The technical engine is a family of generalized tree indiscernibility results: trees $I^{{<ω}}$ are Ramsey index structures, so witnesses to c-TP can be assumed indiscernible in the tree language, and arrays indexed by c can be assumed strongly indiscernible.
What would settle it
One concrete way to settle the claim: attempt to construct a c-indexed family of parameters whose locally based L_{s,κ,c}-indiscernible tree does not preserve the q-inconsistency of siblings; if such a family exists, the proof of Theorem 3 collapses, and c-TP would not characterize instability.
Extended reading notes
Core claim
The paper claims that c-TP, the tree property defined using the colored linear order as the index structure on siblings, is equivalent to instability: a partitioned formula φ(x,y) is unstable if and only if it has c-TP (Theorem 4). The forward direction uses the classical dichotomy that unstable theories have either the independence property or the strict order property, each of which is shown to produce a c-TP witness; the reverse direction shows that a c-TP witness, taken to be indiscernible, yields the order property directly. The argument is then pushed further: the colored tree property of the first kind coincides with TP1, and the colored tree property of the second kind coincides with IP, so a theory has c-TP exactly when it has c-TP1 or c-TP2. A corollary extends the instability characterization to any Ramsey index structure with at least two non-algebraic quantifier-free 1-types.
Load-bearing premise
The proof of the main characterization depends on the claim—asserted by analogy with a known argument it does not reproduce—that the colored tree index structure $c^{{<ω}}$ has the modeling property, so any c-TP witness can be made indiscernible without losing the witness.
Editorial extensions
If this is right
- Instability of a formula is equivalent to the existence of a c-TP witness, so the order property has a positive, negation-free characterization.
- Any Ramsey index structure with at least two non-algebraic quantifier-free 1-types gives the same equivalence; the linear order, with one 1-type, is exactly the case that yields ordinary TP.
- c-TP1 is the same dividing line as TP1, locally up to a conjunction of instances of the formula.
- c-TP2 is the same dividing line as IP, and the colored tree property dichotomy mirrors the classical TP/TP1/TP2 dichotomy.
- The c-TP formulation provides a new positive tool for detecting stability in theories with generalized indiscernibles.
Reading between the lines
- If the equivalences hold for every Ramsey index structure with multiple 1-types, then the classification of unstable theories becomes less sensitive to the exact index structure: the only feature that matters is having more than one non-algebraic quantifier-free 1-type. A natural test is whether other such structures yield the same stability line.
- The failure of c-local character to capture simplicity, while c-TP captures stability, suggests the classical link between local character and the tree property is specific to the linear order; one might explore whether other sibling-inconsistency notions produce genuinely new dividing lines for simple-like theories.
- Because c-TP2 ≡ IP and c-TP1 ≡ TP1, the colored dichotomy gives a purely positive presentation of IP; this could simplify proofs of NIP by working only with positive formulas.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces new tree-theoretic properties for arbitrary Ramsey index structures I, with emphasis on the colored linear order c. It defines I-TP, c-TP1 and c-TP2, and proves that c-TP is equivalent to instability (Theorem 4), that c-TP1 is equivalent to TP1 (Theorem 5), and that c-TP2 is equivalent to IP (Theorem 6). It also proves a colored-tree dichotomy theorem (Corollary 4), establishes modeling-property results for generalized tree and array index structures, and derives a corollary for any Ramsey index structure with at least two non-algebraic quantifier-free 1-types (Corollary 3).
Significance. If the main theorems stand, the paper gives genuinely new positive characterizations of two classical dividing lines: the order property and the independence property. The use of a Ramsey index structure with several quantifier-free types is a natural and interesting idea, and the paper correctly identifies why the linear-order index structure is special for tree properties. The arguments are mostly built from standard tools (Shelah's dichotomy, Nešetřil–Rödl, Chernikov, Kim–Kim–Scow), and I found no circularity or parameter-fitting. However, the proof of the central implication c-TP ⇒ instability has a repairable but genuine gap, and the definition of c-TP1 is formally under-specified. The paper is likely correct in its broad claims, but it needs careful revision before the proofs can be taken as checkable.
major comments (3)
- [§5, Theorem 3] The proof of c-TP ⇒ instability has an indexing gap. Property (f) as stated binds ξ_n, T_{n+1}, and types over {a_{ξ_i} : i ≤ n}, whereas the induction step establishes a statement about T_n and types over {a_{ξ_i} : i < n}. In the final paragraph, (f) is applied to an arbitrary immediate successor η of ξ_{N−1} together with ξ_{N′} ∈ T_N; even on the natural corrected reading (ξ_{N−1} ⊴ η,ν ∈ T_N, same color), η is not guaranteed to be in T_N because the level length(ξ_{N−1})+1 is not forced into X_N. The pigeonhole step should include the successor level of ξ_{N−1} among the selected levels, or otherwise extend the uniformity to all children. Without this repair, the claim that M ⊨ d_φ(a_η) holds for every child of ξ_{N−1}, which drives the contradiction, is unsupported.
- [§5, Theorem 3] Condition (d) is not established as written. The proof says ξ_{n−1} ≠ ξ_n because the two nodes have different colors, but the type q may repeat colors; the text explicitly allows c_{i_0},...,c_{i_{j−1}} not to be distinct. Consecutive ξ's can therefore have the same color. Strict inequality should be ensured by choosing ξ_n with length(ξ_n) > length(ξ_{n−1}), using the fact that X_n is of size κ.
- [§6, Definition 17] The definition of c-TP1 is formally ill-typed. In the condition 'Incomparables are q-inconsistent', q is a complete quantifier-free type in the language of the colored linear order c, but it is applied to a tuple η_1,...,η_n of nodes of c^{<ω}; nodes of c^{<ω} are not elements of c. The proof of Theorem 5 appears to read each node via its color or terminal coordinate, but this reading is never stated. Because the equivalence c-TP1 ↔ TP1 depends on this condition, the definition must be reformulated precisely before the theorem can be fully checked.
minor comments (3)
- [§3, Propositions 1–2] Proposition 1 is used to take c-TP witnesses to be L_{s,κ,c}-indiscernible in Theorem 3, but its proof is only a reference to [KKS13] with the comment that the argument goes through identically. A short sketch of the modified pigeonhole argument would make the paper more self-contained and reduce the verification burden on the reader.
- [Throughout] There are several typos and formatting issues: 'an tree' and 'insiscernible' appear in §5; 'the the structure I' appears in the Introduction; and in the proof of Theorem 6, '{φ(x, a_{k,j_m}) : i is odd}' should use the index k. A careful proofreading pass is needed.
- [§6, Theorem 5] The diagram illustrating the construction of the tree B is very hard to read in the current typesetting. Please redraw it or replace it with a purely formal description of the construction.
Circularity Check
No significant circularity: the equivalences are established by independent constructions and external cited theorems.
full rationale
The paper's central claims are equivalences between newly introduced generalized tree properties and established model-theoretic dividing lines, and the proof chain does not reduce any conclusion to its own input. Theorem 3 (c-TP implies instability) assumes stability and derives a contradiction from definability of the stable formula d_phi versus the q-inconsistency of siblings; the indiscernibility and pigeonhole steps use the external modeling-property results of [KKS13] and [TT12], not the theorem being proved. Theorem 5 (c-TP1 iff TP1) is proved in both directions by explicit construction: coloring a TP1 tree gives c-TP1, and a c-TP1 witness is converted into a TP1 witness for a conjunction of instances of phi, with no fitted parameter or assumed equivalence. Theorem 6 (c-TP2 iff IP) proves c-TP2 implies IP by induction on the number of variables in the quantifier-free type, and the converse direction uses the known fact that IP theories interpret the random graph, whose c-TP2 witness is constructed directly; neither direction presupposes the other. Theorem 4 then assembles Theorem 3 and Corollary 2 via Shelah's external dichotomy theorem. All citations to prior work (Scow, KKS13, TT12, Che14, LS03, She90) are to external authors, not self-citations, and none of them is invoked as a substitute for a proof step that would otherwise be circular. The skeptical concern about Theorem 3's induction applying condition (f) to a child outside T_N is a potential proof gap, not a circularity: it concerns whether the argument is valid as written, not whether the conclusion is assumed or fitted into the premise. Accordingly, the appropriate circularity score is 0.
Assumptions & free parameters
assumptions (8)
- domain assumption Age(I) is Ramsey iff I-indexed indiscernibles have the modeling property (Scow, Theorem 1).
- standard math Nešetřil-Rödl theorem: the class of finite τ ∪ {<}-structures with < a linear order is Ramsey.
- domain assumption Generalized tree index structures L_{s,κ,I} and L_{0,I} have the modeling property (Propositions 1 and 2, extending KKS13 and TT12).
- standard math Shelah's First Dichotomy: unstable theories have IP or SOP (Theorem 2).
- standard math LS03 Lemma 2.2: any theory with IP interprets the countable random graph as an induced subgraph.
- standard math Che14 Proposition 3.5: TP2 implies IP.
- standard math Stable formulas have definable types and unique nonforking extensions (standard stability theory).
- standard math Compactness and the existence of a monster model for complete first-order theories.
Cite this review
Pith. "Pith review of Results on Colored Tree Properties." pith.science (2026). https://pith.science/paper/IQSFE4LO
@misc{pith2026250706977,
author = {Pith},
title = {Pith review of: Results on Colored Tree Properties},
year = {2026},
howpublished = {\url{https://pith.science/paper/IQSFE4LO}},
note = {Machine review of arXiv:2507.06977}
}
abstract
In this paper, we introduce novel variations on several well-known model-theoretic tree properties, and prove several equivalences to known properties. Motivated by the study of generalized indiscernibles, we introduce the notion of the $\calI$-tree property ($\calI$-TP), for an arbitrary Ramsey index structure $\calI$. We focus attention on the colored linear order index structure \textbf{c}, showing that \textbf{c}-TP is equivalent to instability. After introducing \textbf{c}-$\TPi$ and \textbf{c}-$\TPii$, we prove that \textbf{c}-$\TPi$ is equivalent to $\TPi$, and that \textbf{c}-$\TPii$ is equivalent to IP. We see that these three tree properties give a dichotomy theorem, just as with TP, $\TPi$, and $\TPii$. Along the way, we observe that appropriately generalized tree index structures $\calI^{<\omega}$ are Ramsey, allowing for the use of generalized tree indiscernibles.
Reference graph
Works this paper leans on
-
[1]
A Walk on the Wild Side : Notions of maximality in first-order theories, 2024
Michele Bailetti. A Walk on the Wild Side : Notions of maximality in first-order theories, 2024. Version Number: 1
work page 2024
-
[2]
Manuel Bodirsky. New R amsey classes from old. Electronic Journal of Combinatorics , 21, 04 2012
work page 2012
-
[3]
Theories without the tree property of the second kind
Artem Chernikov. Theories without the tree property of the second kind. Annals of Pure and Applied Logic , 165(2):695--723, 2014
2014
-
[4]
On model-theoretic tree properties
Artem Chernikov and Nicholas Ramsey. On model-theoretic tree properties. Journal of Mathematical Logic , 16(02):1650009, 2016
2016
-
[5]
Characterizing model-theoretic dividing lines via collapse of generalized indiscernibles
Vincent Guingona, Cameron Donnay Hill, and Lynn Scow. Characterizing model-theoretic dividing lines via collapse of generalized indiscernibles. Annals of Pure and Applied Logic , 168(5):1091--1111, 2017
work page 2017
-
[6]
Notions around tree property 1
Byunghan Kim and Hyeung-Joon Kim. Notions around tree property 1. Annals of Pure and Applied Logic , 162(9):698--709, 2011
work page 2011
-
[7]
Tree indiscernibilities, revisited
Byunghan Kim, Hyeung-Joon Kim, and Lynn Scow. Tree indiscernibilities, revisited. Archive for Mathematical Logic , 53(1–2):211–232, December 2013
work page 2013
-
[8]
Itay Kaplan and Nicholas Ramsey. On K im-independence. Journal of the European Mathematical Society , 2017
work page 2017
Show all 19 references
-
[9]
Laskowski and S
M.C. Laskowski and S. Shelah. Karp complexity and classes with the independence property. Annals of Pure and Applied Logic , 120:263–283, 04 2003
2003
-
[10]
Practical and structural infinitary expansions
Nadav Meir and Aris Papadopoulos. Practical and structural infinitary expansions. arXiv preprint arXiv:2212.08027 , 2022
2022 arXiv
-
[11]
Malliaris and S
M. Malliaris and S. Shelah. A new look at interpretability and saturation. Annals of Pure and Applied Logic , 170(5):642--671, 2019
2019
-
[12]
Malliaris and S
M. Malliaris and S. Shelah. A separation theorem for simple theories. Transactions of the American Mathematical Society , 375(2):1171--1205, 2022. Publisher Copyright: 2021 American Mathematical Society
2022
-
[13]
Ramsey classes of set systems
Jaroslav Nešetřil and Vojtěch Rödl. Ramsey classes of set systems. Journal of Combinatorial Theory, Series A , 34(2):183--201, 1983
1983
-
[14]
Characterization of NIP theories by ordered graph-indiscernibles
Lynn Scow. Characterization of NIP theories by ordered graph-indiscernibles. 2011
2011
-
[15]
Characterization of nip theories by ordered graph-indiscernibles
Lynn Scow. Characterization of nip theories by ordered graph-indiscernibles. Annals of Pure and Applied Logic , 163(11):1624--1641, 2012. Kurt Goedel Research Prize Fellowships 2010
2012
-
[16]
Classification theory and the number of non-isomorphic models
Saharon Shelah. Classification theory and the number of non-isomorphic models . Number v. 92 in Studies in logic and the foundations of mathematics. North-Holland, Amsterdam, rev. ed edition, 1990
1990
-
[17]
On what I do not understand (and have something to say): Part I
Saharon Shelah. On what I do not understand (and have something to say): Part I . Fundamenta Mathematicae , 166(1):1--82, 2000
2000
-
[18]
A Guide to NIP Theories
Pierre Simon. A Guide to NIP Theories . Lecture Notes in Logic. Cambridge University Press, 2015
2015
-
[19]
On the existence of indiscernible trees
Kota Takeuchi and Akito Tsuboi. On the existence of indiscernible trees. Annals of Pure and Applied Logic , 163(12):1891--1902, 2012
1902
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Sign in to comment.