{"id":"f333e234-5197-42d8-8324-2957108bb56b","arxiv_id":"2507.21366","paper_version":1,"verdict":"CONDITIONAL","confidence":"LOW","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A theory has a (k,1,1)-weave if and only if a Kim's lemma variant for bi-invariant types fails, and k-grids imply stronger failures including, under GCH, failure of generic stationary local character.","lead":"This paper defines a family of combinatorial patterns, called weaves, and proves that the simplest weave appears in a theory exactly when a version of Kim's lemma fails for pairs of bi-invariant types. A model theory specialist would read it because it gives a new bidirectional bridge between dividing behavior and tree-like consistency properties, extending the NTP2 and NSOP1 programs.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 3.10(1) depends on Fact 2.4 from unpublished [7] and on unproved cases of Theorem 2.6; if these fail, the semi-reliably invariant clause is unsupported.","rationale":"The reader's weakest-assumption analysis already identifies Fact 2.4 as the main dependency. My stress-test confirms this is the most load-bearing concern: Theorem 3.10(1) is the only part of the main theorem that goes beyond bi-invariant types, and its proof path runs through Corollary 2.7, which depends on Theorem 2.6(3)-(4) and Fact 2.4. The rest of the paper is largely self-contained: Proposition 1.5 is a direct combinatorial construction, Theorem 2.6(1) is fully proved, and Proposition 3.9 is a detailed forcing-plus-compactness argument whose key claims are addressed in the text. I did not find a concrete internal inconsistency in Proposition 3.9 or in the weave definitions. The risk is therefore external and structural: an unpublished theorem and two omitted proofs carry the extra clause. The bi-invariant core of the equivalence would likely survive, but the abstract's claim of a non-trivial variant over arbitrary invariance bases is conditional on material outside this manuscript. Since the reader's verdict is already CONDITIONAL with LOW confidence, my independent review does not change that verdict; it strengthens the case for requesting written proofs of the omitted cases and an independent check of [7, Thm. 2.14].","tokens_in":28953,"tokens_out":32732,"duration_ms":336240,"concrete_test":"Write out a complete proof of Theorem 2.6(4) by following the pattern of Theorem 2.6(2), explicitly performing the induction step in which the two-element sequence ((b^{d+1}_{(1,1)⌢σ}), (b^{d+1}_{(1,0)⌢σ})) is claimed to be an invariant sequence over A and the semi-reliably invariant type q_d is extended to q_{d+1/2}. Verify at every stage that this extension uses only the semi-reliability property from Definition 2.3 and that the base case q_0 can be obtained over an arbitrary invariance base A without additional assumptions. If the proof cannot be completed without assuming A is a model (where coheirs exist without Fact 2.4), or if any invariance-sequence verification fails, then Theorem 3.10(1) is not established as stated.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central equivalence in Theorem 3.10(1) — that the absence of a (k,1,1)-weave of depth ω is equivalent to (k, bi-invariant or semi-reliably invariant, bi-invariant or semi-reliably invariant)–Kim's lemma — rests on two under-supported inputs. Corollary 2.7 invokes Theorem 2.6(3) and (4), whose proofs are stated only as 'mutatis mutandis' and never written out; these are the only places where the semi-reliably invariant type is used on the left-hand side of the failure. The base case for these arguments requires Fact 2.4 ([7, Thm. 2.14]), an external result from an unpublished arXiv preprint asserting that every type over an invariance base extends to a semi-reliably invariant type, and every type over a model extends to a semi-reliable coheir. Neither the correctness of Fact 2.4 nor the induction details of Theorem 2.6(3)-(4) are verified in the present text. If Fact 2.4 fails, or if the mutatis-mutandis induction needs extra hypotheses (e.g., that A is a model rather than an arbitrary invariance base), the 'semi-reliably invariant' disjunct in Theorem 3.10(1) is spurious and the advertised non-triviality over arbitrary invariance bases collapses. The bi-invariant-only equivalence (condition (2)) may survive via Theorem 2.6(1) and Proposition 3.9, but the paper's strongest stated claim would not.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces two families of combinatorial consistency-inconsistency configurations, (k,m,n)-weaves and k-grids, and proves implications between these configurations and failures of several variants of Kim's lemma for invariant types. The main result, Theorem 3.10, asserts that for a complete theory T and k<ω the absence of a (k,1,1)-weave of depth ω is equivalent to (k, bi-invariant or semi-reliably invariant, bi-invariant or semi-reliably invariant)-Kim's lemma, to (k, bi-invariant, bi-invariant)-Kim's lemma, and to (k, heir-coheir, heir-coheir)-Kim's lemma over models. The forward direction is proved via an induction building weaves from a failure of Kim's lemma (Theorem 2.6), and the converse uses a forcing-plus-compactness construction (Proposition 3.9). The paper also shows that arbitrary cograph consistency-inconsistency patterns are equivalent to certain weaves, that infinite k-grids entail failures of Kim's lemma variants and, under GCH, failure of generic stationary local character, and that the triangle-free random graph satisfies none of the relevant stronger statements.","tokens_in":29211,"tokens_out":18824,"duration_ms":214779,"significance":"If the central equivalence is correct, it gives the first combinatorial configuration known to be equivalent to a Kim's lemma statement for pairs of bi-invariant types, and the use of semi-reliably invariant types is a genuine attempt to make the statement non-vacuous over arbitrary invariance bases. The weave and grid definitions are independent, parameter-free objects, and the main equivalence is not true by definition but is proved in a genuine cycle of implications. The cograph characterization in Section 4 and the k-grid consequences in Section 5 are elegant and will likely be of independent interest to model theorists working on NTP2/NSOP1-type dividing lines. However, the manuscript depends heavily on the author's unpublished preprint [7] and on several proof steps that are omitted or only sketched, so the advertised results are not yet fully verified in the text.","major_comments":[{"comment":"The proofs of parts (3) and (4) are dismissed with 'mutatis mutandis' after part (2). These cases are load-bearing for Theorem 3.10(1), because the 'bi-invariant or semi-reliably invariant' disjunction in condition (1) requires the semi-reliably invariant class on the left-hand side and on both sides, not only on the right-hand side as proved in (2). The semi-reliable extension machinery is delicate: it requires the constructed type q_d to restrict to q on each coordinate and the relevant two-tuples to be invariant sequences. Please write out the inductions for parts (3) and (4) explicitly.","section":"Section 2, Theorem 2.6(3)-(4)"},{"comment":"The claimed canonical identification of W with a subset of (2^2)^L is impossible as stated: W is the sort for (2^2)^≤L, and elements of W_<L are partial functions of finite height, so the map iota(a) = (i mapsto eval(a,i)) is not a total function on L. This lemma is used in Proposition 1.11 to pass from finite-depth weaves to depth ω. The statement should be reformulated for Wtop (or the evaluation function should be extended in a definable way), and the asserted first-order definability of the comb predicates and the axiomatizability of partial weaves should be proved rather than asserted with 'it is not difficult to show'.","section":"Section 1, Lemma 1.8"},{"comment":"The advertised non-triviality of Theorem 3.10(1) over arbitrary invariance bases depends on Fact 2.4, quoted as [7, Thm. 2.14], which asserts that every type over an invariance base extends to a semi-reliably invariant type and every type over a model extends to a semi-reliable coheir. Since [7] is an unpublished preprint and no proof is included in the present paper, the reader cannot verify this dependence. If Fact 2.4 fails, the 'semi-reliably invariant' disjunct in Theorem 3.10(1) may be spurious. Please include a proof of Fact 2.4 or state Theorem 3.10 conditionally on it.","section":"Definition 2.3 and Fact 2.4"},{"comment":"The final step asserts that the displayed up-1-comb statements imply that φ(x,y) k-divides along p(y). This is not immediate, because the Morley sequence (b_i) is generated by p, a coheir coming from the ultrafilter UR, while the displayed up-comb statements involve elements of U, which belong to the UU-side. In particular, when m=0 the displayed set reduces to the b_i's themselves, and the text does not spell out why those form an up-1-comb. Please give the explicit finite-inconsistency and compactness argument justifying the conclusion.","section":"Section 3, Proposition 3.9, final paragraph"}],"minor_comments":[{"comment":"The proof has a typographical swap: it says 'φ(x,b) k-divides along q' and 'since (A,q)∈X', but the hypothesis is (A,p)∈X and (A,q)∈Y, and the assumption should be that φ(x,b) k-divides along p. Please correct this.","section":"Proposition 2.2"},{"comment":"Near the end, the text says 'an up-n-comb in (2^2)^{d+1}' but the property being verified is (U), which concerns up-m-combs. This is a typo and should be fixed.","section":"Theorem 2.6, proof of (1)"},{"comment":"The definition of 'semi-reliably in I' refers to the largest class R satisfying a certain closure property; the existence of such a largest class is not justified. Since the property is preserved under unions of chains, the fix is routine, but it should be stated.","section":"Definition 2.3"},{"comment":"The phrase 'common first-order theory of ordinals' is not a definition. The properties needed later (least element, successor of every non-maximal element, and initial segments) should be made explicit.","section":"Definition 1.1"},{"comment":"The notation (1)_N and (2)_{N,ψ} for the sets of morphisms collides with the numbered item labels in the same sentence; please use a more distinctive notation.","section":"Proposition 3.9"}],"recommendation":"major_revision","confidential_remarks":"The paper is clearly within the scope of a model theory journal, and the central ideas are attractive. However, the referee report identifies proof obligations that are directly load-bearing for the main theorem: the omitted cases of Theorem 2.6, the erroneous identification in Lemma 1.8, and the dependence on the author's unpublished [7]. The editor may also wish to check the status of [7] before acceptance, since Fact 2.4 is used as a black box."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Read this one. It's a serious piece of model theory. The headline: Hanson gives the first exact combinatorial characterization of a Kim's lemma failure for pairs of bi-invariant types. The main result, Theorem 3.10, equates not having a (k,1,1)-weave of depth omega with several Kim's lemma statements, including the bi-invariant-only version and the heir-coheir version over models. That is a genuine step beyond the CTP/NATP territory in [7].\n\nWhat's new and good: the (k,m,n)-weave framework is a natural generalization, and the k-grid section (Section 5) is a bonus: an infinite k-grid gives failures of Kim's lemma for strong heir-coheirs, and under GCH gives failure of generic stationary local character. The cograph connection in Section 4 is a nice observation: the (2,1,omega)-weave case collapses to P4-free graphs. The paper is honestly written; the author flags three known shortcomings himself, including the inability to build n-strong heir-coheirs for n>1.\n\nSoft spots, in proportion:\n\n• Theorem 2.6(3) and (4) are stated as \"mutatis mutandis\" and never written out. Those are the only places the semi-reliably invariant type appears on the left side of the failure. Since the paper's strongest claim, Theorem 3.10(1), uses that disjunct, a referee will want those details. It's a real gap, though likely fillable.\n\n• The paper leans on Fact 2.4 from the author's own unpublished preprint [7] for existence of semi-reliably invariant types and coheirs. That's self-citation, but it's the kind of external dependence that's normal in a research program. Still, since [7] is not yet published, the present paper is not self-contained.\n\nThe proof of Proposition 3.9 (forcing plus compactness) is intricate. I didn't find an error, but it's not fully checkable in a quick read. Some readers may want a cleaner write-up.\n\nI don't think these are fatal. The bi-invariant-only equivalence, condition (2), appears to survive without the semi-reliably invariant machinery. I'd bet the full theorem holds, but the paper as written is conditional on [7] and on the omitted cases.\n\nWho's it for: people working on NTP2/NSOP1 generalizations and invariant type hierarchies. It deserves a serious referee; the editor should send it out, with the request that the author supply the missing proofs of Theorem 2.6(3)-(4) and state the dependence on [7] more prominently.\n\nRecommendation: accept for peer review, conditional on a careful check of the omitted cases and the external fact.","headline":"A serious, genuinely new characterization of Kim's lemma failures via (k,1,1)-weaves, but the strongest version rests on an unpublished companion paper and omitted 'mutatis mutandis' proofs.","tokens_in":29848,"tokens_out":2159,"would_cite":true,"duration_ms":23257,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["03C45"],"pacs":[],"model":"deepseek-v4-flash","headline":"A single weave configuration pinpoints when Kim’s lemma fails.","keywords":["bi-invariant types","Kim’s lemma","dividing","heir-coheirs","comb tree property","(k,1,1)-weaves","cographs","generic stationary local character"],"falsifier":"Construct a complete theory T and k < ω that has a (k,1,1)-weave of depth ω yet still satisfies (k, bi-invariant, bi-invariant)-Kim’s lemma; or exhibit an invariance base A and a type over A admitting no semi-reliably invariant extension, disproving the imported existence result that carries the ‘semi-reliably invariant’ version.","tokens_in":28651,"feed_emoji":"🌳","tokens_out":5291,"duration_ms":57016,"temperature":0.7,"pith_summary":"This paper identifies one combinatorial consistency-inconsistency configuration, the (k,1,1)-weave of depth ω, that exactly marks the failure of several variants of Kim’s lemma. For every complete first-order theory and every k, having such a weave is shown to be equivalent to failing Kim’s lemma for pairs of bi-invariant or semi-reliably invariant types, for pairs of plain bi-invariant types, and for heir-coheir pairs over models. The paper also shows that weaker failures produce stronger configurations, up to arbitrary cograph-indexed consistency patterns when k=2, and that an infinite k-grid yields failures involving strong heir-coheirs plus, under GCH, a failure of generic stationary local character. The upshot is a dividing-line style combinatorial criterion for a family of model-theoretic independence properties.","feed_headline":"A single weave configuration pinpoints when Kim’s lemma fails","feed_subtitle":"For bi-invariant types, one tree pattern decides whether Kim’s lemma holds.","key_machinery":"The central object is the (k,1,1)-weave of depth ω: a family of parameter tuples indexed by the full binary tree of height ω, with each node labelled by a pair from {0,1}², such that any finite up-1-comb (two branches splitting vertically) is k-inconsistent while any finite right-1-comb (two branches splitting horizontally) is consistent. The argument is carried by two mechanisms: an inductive cloning construction that turns a Morley sequence in a bi-invariant type into the vertical or horizontal consistency pattern of a weave, and a forcing-plus-compactness framework that builds a generic filter on dense subsets of an unbounded weave model, producing heir-coheir types whose dividing behaviour is read off from the weave combinatorics.","core_discovery":"The main theorem states an exact equivalence: a theory T has a (k,1,1)-weave of depth ω if and only if T fails (k, bi-invariant or semi-reliably invariant, bi-invariant or semi-reliably invariant)-Kim’s lemma, if and only if it fails (k, bi-invariant, bi-invariant)-Kim’s lemma, if and only if it fails (k, heir-coheir, heir-coheir)-Kim’s lemma over models. Here a formula k-divides along a type when some Morley sequence of that type makes any k of its instances jointly inconsistent. The forward direction converts the failure of Kim’s lemma into a weave by building Morley sequences along the two types and cloning them into a tree of parameters; the reverse direction uses a forcing-plus-compactness construction to turn a weave into two heir-coheirs that separate dividing from non-dividing. This gives, for the first time, a combinatorial object equivalent to the failure of a pair-of-invariant-types form of Kim’s lemma rather than merely a consequence of it.","pith_inferences":["Because the proof is uniform in k, it leaves open whether existence of a (k,1,1)-weave for one k collapses the hierarchy across all k; if true, the family of Kim’s-lemma variants would be a single k-independent dividing line.","The cograph characterization for k=2 suggests that the no-weave condition might be connected to the random-graph consistency-inconsistency pattern and hence to NPM(2), a relationship the paper leaves as questions rather than theorems.","The GCH assumption in the grid-to-stationary-local-character step is likely removable or replaceable by a weaker cardinal hypothesis, since the construction itself is purely combinatorial and the set-theoretic assumption is used only to make a chain of elementary submodels cover the saturated model.","A concrete testable extension would be to check whether a known theory, such as the triangle-free random graph, admits (k,1,1)-weaves of depth ω; the paper’s final example shows that even definable-type Kim’s lemma failures can coexist with no such weave in that setting."],"forward_implications":["The class of theories with no (k,1,1)-weave of depth ω is now a genuine dividing line, characterized by a positive Kim’s-lemma property for bi-invariant and heir-coheir types.","Over arbitrary invariance bases, version (1) of the main theorem gives a non-vacuous Kim’s lemma statement, removing the need to pass to models.","In theories with no weaves, if a formula implies a finite disjunction where each disjunct divides along a bi-invariant or semi-reliably invariant type, then the formula itself divides along a reliably invariant type (Corollary 3.12).","For k=2, failure of (2, bi-invariant or semi-reliably invariant, strongly bi-invariant)-Kim’s lemma implies that the theory admits arbitrary cograph consistency-inconsistency patterns, giving a clean graph-theoretic witness.","An infinite k-grid implies failures of (k, coheir, strong heir-coheir)-Kim’s lemma over models and, assuming GCH, a failure of generic stationary local character."],"supporting_citations":[{"why":"Supplies the existence of semi-reliably invariant types over invariance bases and semi-reliable coheirs over models (Fact 2.4), the load-bearing import for the ‘or semi-reliably invariant’ clause, and the earlier comb-tree-property arguments being generalized.","marker":"[7]"},{"why":"Introduced the New Kim’s Lemma and the framework of invariant-type variants of Kim’s lemma that this paper systematizes.","marker":"[10]"},{"why":"Introduced the comb tree property and canonical coheirs, the antecedents of the weave and heir-coheir configurations studied here.","marker":"[11]"},{"why":"Introduced the antichain tree property, one of the mutual generalizations whose Kim’s-lemma formulations motivate the paper.","marker":"[1]"},{"why":"Proved that cographs are exactly the finite P4-free graphs, the fact used to identify (2,1,ω)-weaves with arbitrary cograph consistency-inconsistency patterns.","marker":"[6]"},{"why":"Used to collapse k-ATP to 2-ATP and to position the weave and grid conditions within the known implication hierarchy.","marker":"[2]"}],"fun_headline_variants":["A weave configuration exactly detects Kim's lemma failure","Kim's lemma holds iff no weave exists for bi-invariant types","Kim's lemma fails precisely when a weave appears","One tree pattern settles Kim's lemma for bi-invariant types"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole equivalence leans on a companion result asserting that any type over an invariance base extends to a semi-reliably invariant type and any type over a model extends to a semi-reliable coheir; if that external existence result fails, the semi-reliably invariant clause in the main equivalence is unsupported and the characterization may reduce to ordinary bi-invariant types.","fun_headline_variants_meta":{"raw":{"variants":["A weave configuration exactly detects Kim's lemma failure","Kim's lemma holds iff no weave exists for bi-invariant types","Kim's lemma fails precisely when a weave appears","One tree pattern settles Kim's lemma for bi-invariant types"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000688,"raw_usage":{"total_tokens":3193,"prompt_tokens":1098,"completion_tokens":2095,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":714,"completion_tokens_details":{"reasoning_tokens":2029}},"tokens_in":714,"tokens_out":2095,"duration_ms":16814,"temperature":1.0,"reasoning_tokens":2029,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T12:50:37.218631+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Construct a complete theory T and k < ω that has a (k,1,1)-weave of depth ω yet still satisfies (k, bi-invariant, bi-invariant)-Kim’s lemma; or exhibit an invariance base A and a type over A admitting no semi-reliably invariant extension, disproving the imported existence result that carries the ‘semi-reliably invariant’ version.","supporting_citations":[{"cited_title":"Bi-invariant types, reliably invariant types, and the comb tree property","cited_arxiv_id":"2306.08239","evidence_quote":"Supplies the existence of semi-reliably invariant types over invariance bases and semi-reliable coheirs over models (Fact 2.4), the load-bearing import for the ‘or semi-reliably invariant’ clause, and the earlier comb-tree-property arguments being generalized."},{"cited_title":"A New Kim’s Lemma","cited_arxiv_id":null,"evidence_quote":"Introduced the New Kim’s Lemma and the framework of invariant-type variants of Kim’s lemma that this paper systematizes."},{"cited_title":"SOP 1, SOP2, and antichain tree property","cited_arxiv_id":null,"evidence_quote":"Introduced the antichain tree property, one of the mutual generalizations whose Kim’s-lemma formulations motivate the paper."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Proved that cographs are exactly the finite P4-free graphs, the fact used to identify (2,1,ω)-weaves with arbitrary cograph consistency-inconsistency patterns."},{"cited_title":"On the antichain tree property","cited_arxiv_id":null,"evidence_quote":"Used to collapse k-ATP to 2-ATP and to position the weave and grid conditions within the known implication hierarchy."}],"review_version":1}