Indiscernible Extraction in Theories with Bounded k-splitting
summary
The gist
INDISCERNIBLE EXTRACTION FOR THEORIES WITH BOUNDED k-SPLITTING Hanson introduced the class of theories with bounded k-splitting and proved an indiscernible extraction result for those theories…
In short
The paper explores indiscernible extraction results for theories with bounded k-splitting, a generalization of stability. It shows that the original result requiring a k-ineffable cardinal is equivalent to assuming only the existence of a weakly compact cardinal. Furthermore, it proves that total bounded ultraimaginary Morley sequences can be constructed in ZFC, meaning these powerful results do not require strong large cardinal assumptions.
Key concepts
- Bounded k-splitting
- This is a higher-arity notion of stability where a theory is defined by how formulas behave with respect to variable count. A theory has λ-bounded k-splitting if any type with finite blocks splits over some subset C of the parameters, where the size of C is strictly less than λ. Stability corresponds to bounded 1-splitting.
- Indiscernible Extraction
- This refers to a process in model theory that extracts long sequences from a given sequence of tuples that possess specific structural properties, such as being B-indiscernible. The paper proves various extraction theorems for theories with bounded k-splitting, showing how many such subsequences can be found under different set-theoretic assumptions.
- Weakly Compact Cardinal
- This is a large cardinal assumption that is weaker than stronger ones like measurable cardinals. The authors demonstrate that the conclusion of Hanson's theorem regarding indiscernible extraction for bounded k-splitting theories holds if we assume the existence of such a cardinal, showing it is sufficient.
- Total bu-Morley Sequences
- These are sequences constructed within a theory that possess specific structural properties related to ultraimaginary elements. The paper proves that Hanson's construction for these sequences can be achieved entirely within ZFC, without needing the existence of a k-ineffable cardinal.
Terminology used across episodes
This episode discusses
- Indiscernible Extraction in Theories with Bounded k-splitting · Paper Radio
- Indiscernible extraction at small large cardinals from a higher-arity stability notion
- Higher-order generalizations of stability and arithmetic regularity
The paper
Indiscernible Extraction in Theories with Bounded k-splitting · Read on arXiv
Hanson introduced the class of theories with bounded k-splitting, a higher-arity notion of stability, and proved an indiscernible extraction result for those theories assuming the existence of a k-ineffable cardinal. In this article, we show that the conclusion of Hanson's theorem is equivalent to the weaker assertion that there exists a weakly compact cardinal, as well as prove additional indiscernible extraction results for these theories in ZFC. Finally, we show that Hanson's construction of total bounded ultraimaginary Morley sequences in theories with bounded k-splitting follows from ZFC.
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: I'm Ada.
Emmy: And I'm Emmy, here with Kolya.
Ada: We're looking at the paper: "Indiscernible Extraction in Theories with Bounded k-splitting".
Emmy: Here's the gist of the paper. INDISCERNIBLE EXTRACTION FOR THEORIES WITH BOUNDED k-SPLITTING Hanson introduced the class of theories with bounded k-splitting and proved an indiscernible extraction result for those theories assuming the existence of a k-ineffable cardinal In this article, we show that the conclusion of Hanson’s theorem is equivalent to the weaker assertion that there exists a weakly compact cardinal, as well as prove additional indiscernible extraction results for these theories in ZFC Finally, we show that Hanson’s construction of total bounded ultraimaginary Morley sequences in theories with bounded k-splitting follows from ZFC.
Ada: The paper introduces a higher-arity notion of stability called bounded k-splitting, which is a natural generalization of both stability and k-arity A theory T is defined as k-ary if every formula is equivalent modulo T to a Boolean combination of formulas with at most k variables A type tp(a/B) in this context splits over C ⊆ B if there is a formula φ(x, y) and b, b′ ∈ A with b ≡C b′ such that both φ(a, b) and ¬φ(a, b′) are true A theory T has λ-bounded k-splitting if every such type with finite blocks has some C ⊆ A, C < λ, over which it does not k-split It is noted that stability is equivalent to having bounded 1-splitting, and k-arity implies bounded k-splitting.
Emmy: ZFC Results on Indiscernibles The authors establish two indiscernible extraction results in ZFC for theories with bounded k-splitting Theorem 2.1 states that if T has bounded k-splitting and λ ≥ T + B + γ, then every sequence of γ-tuples of length בk(λ) + has a B-indiscernible subsequence of order type λ+ This result is derived by applying Lemma 2.4, which extracts r-end-homogeneous sequences in theories with bounded k-splitting.
Ada: Theorem 2.6 improves this by showing that every sequence of n-tuples of length בk−1(λ) + has a B-indiscernible subsequence of length λ+ + (k − 1) Extraction from Weak Compactness The paper demonstrates that the large cardinal assumption can be weakened to the existence of a weakly compact cardinal Theorem 3.1 shows that if T has bounded k-splitting and κ > T + B + γ is weakly compact, every sequence of γ-tuples of length κ has a B-indiscernible subsequence of order type κ The optimality of this result is shown by considering the theory of the random graph with edge relation R.
Title and authors: Ada: The paper "Indiscernible Extraction in Theories with Bounded k-splitting" focuses on introducing this new class of theories, bounded k-splitting, which is a higher-arity generalization of stability.
Emmy: That generalization means every formula is equivalent modulo the theory to a Boolean combination of formulas with at most k variables, and it's a natural extension of what we already know about NIP theories or k-arity theories.
Kolya: So, what exactly is bounded k-splitting in terms of structure? Is it just about how complex the types are that we're looking at?
Ada: It's defined by requiring that every type with a finite number of blocks splits over some small subset of its parameter domain, specifically one whose size is less than lambda, where lambda is the bound on k-splitting.
Emmy: That definition links the splitting property directly to an ordinal lambda, which we then use to define bounded k-splitting as having a specific restriction on how types can split.
Kolya: So, if we look at the original Hanson theorem, it required a k-ineffable cardinal for the extraction result, and this paper says that's not necessary.
Ada: Exactly, because they show that the conclusion of Hanson’s theorem is equivalent to the weaker assertion that there exists a weakly compact cardinal instead of needing a k-ineffable cardinal.
The paper's summary: Ada: Wrapping up this discussion on "Indiscernible Extraction in Theories with Bounded k-splitting," the main implication is that we don't need those huge cardinals to get these types of extraction results; weak compactness is sufficient for the key result, and they also prove Hanson’s construction of total bounded ultraimaginary Morley sequences actually works just in ZFC.
Emmy: That final point is really interesting because it means that even the most complex constructions, like those involving ultraimaginary sequences, are achievable within standard set theory without relying on those high cardinal assumptions. The machinery they built is actually quite flexible for ZFC applications.
Kolya: If we take what you said about the total bounded ultraimaginary Morley sequences following from ZFC, how does that impact our ability to study these theories further? Can we use those tools more freely in other areas?
Ada: It means we have a robust set of tools available in ZFC for analyzing these theories. The results show that the complexity of bounded k-splitting isn't as high as some of the initial assumptions suggested when we first looked at it.
Emmy: It sets a clearer path for future research, showing that the connection between bounded k-splitting and extraction is more grounded in ZFC than we first thought about it.
The paper's improvements: Ada: So we looked at "Indiscernible Extraction in Theories with Bounded k-splitting," and the main thing is that you can get these strong extraction results in ZFC without needing any of those big large cardinal assumptions we usually have to assume, relying instead on weak compactness.
Emmy: Exactly, and they show that assuming weak compactness is enough to get the key result, which is a significant simplification for applying this kind of theory to broader mathematical structures.
Kolya: From a probabilistic view, that means the tail we're dealing with for these sequences isn't as heavy as we might think when you look at the constraints imposed by bounded k-splitting.
Ada: Right, and they even managed to prove that Hanson’s construction for total bounded ultraimaginary Morley sequences works just in ZFC. That’s a big win because it shows that even those very complex constructions aren't reliant on those high cardinal assumptions we were used to seeing.
Emmy: It means the structural logic behind these theories is more pliable than we thought, and the machinery they built is actually quite flexible for standard set theory applications.
Kolya: I just wonder if that flexibility translates directly into practical bounds for things like approximation or complexity in other areas of mathematics. What does this mean for our usual computational limits?
Ada: It suggests that the theoretical limits we usually impose are often stricter than what's actually needed to achieve these types of order control over sequences.
Emmy: So, we've established a solid foundation here for extracting patterns in theories with bounded k-splitting using only weak compactness and ZFC.
Ada: That’s the gist of "Indiscernible Extraction in Theories with Bounded k-splitting," showing that weaker assumptions can still yield powerful structural results.
Kolya: It certainly opens the door to exploring how these tools interact with things like those random graph theories we saw earlier. Maybe we can see if this extraction power works there too.
Emmy: That seems like a very natural next step, looking at where these ideas connect across different mathematical universes.
Conclusion: Ada: So we’ve been looking at "Indiscernible Extraction in Theories with Bounded k-splitting," and what we've seen is that you can get these strong extraction results in ZFC without needing any of those big large cardinal assumptions we usually have to assume.
Emmy: Exactly, and they show that assuming weak compactness is enough to get the key result, which is a significant simplification for applying this kind of theory.
Kolya: From a probabilistic standpoint, that means the tail we're dealing with for these sequences isn't as heavy as we might think when you look at the constraints imposed by bounded k-splitting.
Emmy: It means the structural logic behind these theories is more pliable than we thought, and the machinery they built is actually quite flexible for ZFC applications.
Ada: It suggests that the theoretical limits we usually impose are often stricter than what’s actually needed to achieve these types of order control over sequences.
Emmy: That seems like a very natural next step, looking at where these ideas connect across different mathematical universes.
More episodes
- 2508.20749-Rates of convergence for extremal spacings in Kakutani's random interval-splitting process
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products