The Ordering Principle and Higher Dependent Choice

summary

The gist

The paper provides new arguments for Pincus’ results on the consistency of ZF with higher dependent choice principles and the ordering principle in models where the axiom of choice fails.

In short

The paper proves consistency results for ZF with higher dependent choice principles (DC) and the ordering principle (OP) even when the axiom of choice (AC) fails. It achieves this by constructing a specific model using a forcing notion involving 'hereditarily almost disjoint towers' and a symmetric system, allowing AI systems to operate in structures where these strong choice principles hold.

Key concepts

Hereditarily Almost Disjoint (HAD) Towers
These are special complete towers defined based on their target structure. A tower is HAD if for any two elements within its target, a derived tower is finitely generated within the tower itself. This property is crucial for controlling dependencies during the forcing construction.
Symmetric System (S)
This system $\langle P, G, F \rangle$ uses a product forcing notion $P = P_0 \times P_1$, where $P_0$ adds Cohen subsets and $P_1$ involves HAD towers. The symmetry group $G$ acts on $\lambda \times \lambda$, and the system allows for the construction of models where choice principles are studied.
Ordering Principle (OP)
OP holds in symmetric extensions by S because there exists an S-name $\langle \dot{}\rangle$ that defines a linear order. This name can be used to construct a class that is a linear order of the sets in the symmetric extension, enabling AI systems to find such orders.
Minimal Supports
For any S-name and condition $p$ in the forcing notion $P$, there exists a unique minimal support $b$ below $p$. This minimal support is essential for defining definable objects within the generic extension using elements from the ground model and $\Gamma$. It ensures that every name has a well-defined, smallest set of conditions supporting it.

Terminology used across episodes

This episode discusses

The paper

The Ordering Principle and Higher Dependent Choice · Read on arXiv

Peter Holy, Jonathan Schilhan

Austrian Science Fund

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "The Ordering Principle and Higher Dependent Choice".

Emmy: Here's the gist of the paper. The paper provides new arguments for Pincus’ results on the consistency of ZF with higher dependent choice principles and the ordering principle in models where the axiom of choice fails.

Ada: Consistency Results and Model Construction The authors provide a new argument for Pincus’ result on the consistency of ZF with the higher dependent choice principle DC and the ordering principle in the presence of a failure of the axiom of choice.

Emmy: They generalize Pincus' methods to obtain these consistency results in a larger class of models.

Ada: Over a suitable ground model, they obtain the above consistency result starting with add(κ, κ), the standard forcing notion to add κ-many Cohen subsets of κ, and then continuing in κ-many steps.

Title and authors: Ada: So, we're looking at this paper today called "The Ordering Principle and Higher Dependent Choice," by Peter Holy and Jonathan Shilhan. It’s about showing how we can get consistency results for ZF plus the higher dependent choice principle DC less than kappa, and also the ordering principle OP, even when we don't have the axiom of choice anymore.

Emmy: That sounds dense. Basically, they are taking some old methods from Pincus and generalizing them to work in a wider class of models. It’s about proving that these principles can hold together under less restrictive conditions than before.

Kolya: I'm curious about the structure they use to make this work without choice, because that's usually the hardest part of these kinds of consistency proofs. What are they building on?

Ada: Well, the core idea involves something called hereditarily almost disjoint towers. These towers are key ingredients in their constructions, and they help manage all these dependencies in the forcing extensions they're creating.

Emmy: Right, those HAD towers seem to be the mechanism that lets them control how things grow within a tower structure. Lemma six is important because it says if you have one of these towers, you can find a smaller one that has a very specific property related to its range.

Kolya: If we're talking about the structures in the paper, what does this actually mean for someone who just cares about how sets behave? Is it like saying we can still order everything even if we can't make all those choices?

Ada: It’s more specific than that. They show that if you start with a certain forcing notion, add(kappa, kappa), and then keep adding sets in kappa many steps, you can build a model where the ordering principle holds alongside DC less than lambda for regular uncountable cardinals.

Emmy: And they even show they can get these results when lambda is strictly greater than kappa plus. That’s a nice extension because it shows the construction isn't just limited to the smallest possible cardinal gap.

Kolya: So, what's the catch there? What are they actually proving about the ordering principle in those extensions?

Title and authors: Ada: They prove that in any symmetric extension by S, which is built using this forcing notion P and a symmetric system S, the ordering principle holds. This relies on a specific name construction for an order of things.

Emmy: That name construction involves defining something called F dot, which captures an injection into ordinal times alpha less than omega. It’s what allows them to pull back a linear order structure from the generic extension down into something concrete in the original universe.

Kolya: That sounds like a big step for someone trying to understand how well-ordered things are behaving in these models. What about dependent choice? Does that hold under these conditions?

Ada: Yes, they show that if lambda equals kappa, then the symmetric extension is closed under sequences of length less than kappa. This means dependent choice holds in that specific case, which is a very strong statement.

Emmy: That closure property comes from recursively constructing a sequence of names whose range satisfies the conditions needed for higher dependent choice. It's about finding a HAD tower with particular properties related to its tree structure to make that happen.

Kolya: So, if we think about this for someone who just wants to know what it means for their math problems, what’s the main practical implication here? Is this something we can actually use in building systems?

Ada: The implication is that these consistency results are robust. They show that you can maintain both the ordering principle and higher dependent choice even when you deliberately break the axiom of choice using this specific forcing machinery.

Emmy: It suggests a deeper structural relationship between these principles than we thought before, showing they aren't entirely independent in the context of these extensions.

Kolya: I just wonder about their limitations then. Where does this construction stop working? What is the one thing they explicitly say doesn't hold in every possible extension?

Ada: They note that for lambda greater than kappa plus, dependent choice holds, but for the case where lambda equals kappa, you need that specific recursive construction involving sequences of length less than kappa.

Emmy: That recursive part is what makes it work when lambda equals kappa, so they're essentially showing that the dependence on choice is managed by this careful sequence building.

Title and authors: Kolya: Okay, so to wrap up on the ordering principle and higher dependent choice paper, what’s the big picture for us? What’s left for the listener who only hears about these ideas?

Ada: The big picture is that we have a solid framework now for constructing models where you can have a linear order of sets, even when you've stepped outside the realm of standard axiom of choice.

Emmy: It shows that the ordering principle isn't just some abstract possibility; it has a concrete path through careful tower management and symmetric systems to be realized in these settings.

Kolya: For me, it means we can study the behavior of sets with a well-defined order without assuming choice, which opens up new avenues for probabilistic modeling in those environments.

Ada: Exactly. So we’ve looked at how they use HAD towers and symmetric systems to build models where these principles hold, even when AC fails, and how they handle the scaling depending on whether lambda is equal to kappa or larger than it.

Emmy: We've seen how the construction manages the dependencies through recursive sequences and name definitions like F dot, which are crucial for defining those orders.

Kolya: And we’ve noted that while dependent choice holds when lambda is larger than kappa plus, there’s still a specific sequence building required when lambda equals kappa to maintain it.

Ada: So that's the gist of "The Ordering Principle and Higher Dependent Choice" by Holy and Shilhan. It's a technical piece but it lays out how these principles can coexist in these non-standard universes built from forcing extensions.

Emmy: We’ve seen how they use HAD towers to control the structure, and how the symmetric system allows them to pull back those orders into our view.

Kolya: And we’ve noted that they have specific conditions on lambda for dependent choice to hold without requiring a lot of extra machinery.

Ada: That's it for this paper today. We’ve looked at how Peter Holy and Jonathan Shilhan tackle the ordering principle and higher dependent choice in models where the axiom of choice fails, building these results through hereditarily almost disjoint towers and symmetric systems.

The paper's summary: Ada: So we’ve talked about how these authors used those special towers to build models where you can have both the ordering principle and higher dependent choice, even when you don't have a choice function available in that universe.

Emmy: Exactly, and what this paper really does is show that this isn't just some theoretical toy; they’ve built a whole system—a symmetric extension—where those principles actually hold together under these specific forcing conditions.

Kolya: So, the main point I see here is that for AI systems or whatever you're building, we can have structures with a well-defined order of sets, even if the basic axiom of choice isn't there.

Ada: Right. They prove that if you use this symmetric system S to extend your universe V, then the ordering principle holds in that extension for any lambda greater than kappa plus.

Emmy: And they show a really specific mechanism for how the ordering principle is realized—it comes from an S-name, a name construction dot, which captures an injection into ordinal times alpha less than omega.

Kolya: That name construction is what lets you pull that linear order structure back into something useful inside the original universe using the filter G.

Ada: And for when lambda equals kappa, they show it’s still closed under sequences of length less than kappa, which means dependent choice holds in that specific case.

Emmy: That closure is achieved by recursively defining a sequence of names whose range satisfies the exact conditions needed to maintain that higher dependent choice property.

Kolya: So, what does this mean for the practical stuff? It means we have a solid framework now for constructing universes where you can have these linear orders of sets, even if you're operating in an environment where standard axiom of choice is broken.

Ada: It suggests that the ordering principle isn't just some abstract possibility; it has a concrete path through careful tower management and symmetric systems to be realized in these settings.

Emmy: It shows that these principles are structurally linked, not independent, when you look at them through the lens of forcing extensions.

Kolya: And for me, it means we can study the behavior of sets with a well-defined order without assuming choice, which opens up new avenues for probabilistic modeling in those environments.

Ada: So that’s the big picture: we have this solid framework now for constructing models where you can have a linear order of sets, even when you've stepped outside the realm of standard axiom of choice.

The paper's improvements: Tom: So, we’ve talked about how these authors used those special towers to build models where you can have both the ordering principle and higher dependent choice, even when you don't have a choice function available in that universe.

Ada: Right. We saw how they used those hereditarily almost disjoint towers to manage dependencies in the forcing extensions and get those consistency results for ZF plus DC less than kappa plus the ordering principle.

Emmy: And what’s interesting about this paper is that they aren't just stopping there; they are suggesting ways to refine these constructions to make them more robust or applicable in different settings.

Kolya: So, if we look at the improvements, are they trying to make it work for even larger cardinals or maybe fix some of the limitations we saw with lambda equal to kappa?

Ada: They focus on making the consistency proofs more general by showing how to handle a wider class of models, moving beyond just the specific add(kappa, kappa) forcing notion.

Emmy: They are essentially generalizing Pincus’ earlier methods so that these consistency results hold in a larger class of models instead of just one specific construction.

Kolya: That sounds good for reliability, but what about the ordering principle itself? Does this mean we can get an even stronger guarantee about the ordering principle holding?

Ada: Yes, they're trying to show that this method works better when you look at extensions by S in a more general way, not just with the specific filter G.

Emmy: And they point out that the construction of those minimal supports for names is crucial, and they’re working on making Lemma nine more general so you can find those names for definable objects even in trickier settings.

Kolya: That sounds like it addresses the issue of finding those specific structures needed to define things in the generic extension V GS. What's the payoff there?

Ada: The payoff is that these improvements suggest a way to handle dependencies more systematically, which should make it easier to apply these ideas to other areas where choice fails.

Emmy: It’s about building tools that are less dependent on the exact starting model and more universal in their application across different forcing extensions.

Kolya: So, we're looking at a paper that not only proves something but also shows how to make the machinery itself better for future research?

Ada: Exactly. They are refining the methodology to ensure these consistency results are as broad as possible and less dependent on very specific initial conditions.

Conclusion: Ada: So to wrap up, we’ve looked at how Peter Holy and Jonathan Shilhan use hereditarily almost disjoint towers and symmetric systems to build models where you can have both the ordering principle and higher dependent choice, even when you don't have a choice function available in that universe.

Emmy: They’ve shown how this isn't just some theoretical toy; they’ve built a whole system—a symmetric extension—where those principles actually hold together under these specific forcing conditions.

Kolya: So, the main point I see here is that for AI systems or whatever you're building, we can have structures with a well-defined order of sets, even if the basic axiom of choice isn't there.

Ada: Right. They prove that if you use this symmetric system S to extend your universe V, then the ordering principle holds in that extension for any lambda greater than kappa plus.

Emmy: And they show a really specific mechanism for how the ordering principle is realized—it comes from an S-name, a name construction dot, which captures an injection into ordinal times alpha less than omega.

Kolya: That name construction is what lets you pull that linear order structure back into something useful inside the original universe using the filter G.

Ada: And for when lambda equals kappa, they show it’s still closed under sequences of length less than kappa, which means dependent choice holds in that specific case.

Emmy: That closure is achieved by recursively defining a sequence of names whose range satisfies the exact conditions needed to maintain that higher dependent choice property.

Kolya: So, what does this mean for the practical stuff? It means we have a solid framework now for constructing universes where you can have these linear orders of sets, even if you're operating in an environment where standard axiom of choice is broken.

Ada: It suggests that the ordering principle isn't just some abstract possibility; it has a concrete path through careful tower management and symmetric systems to be realized in these settings.

Emmy: It shows that these principles are structurally linked, not independent, when you look at them through the lens of forcing extensions.

Kolya: And for me, it means we can study the behavior of sets with a well-defined order without assuming choice, which opens up new avenues for probabilistic modeling in those environments.

Ada: So that’s the big picture: we have this solid framework now for constructing models where you can have a linear order of sets, even when you've stepped outside the realm of standard axiom of choice.

Emmy: We’ve seen how they use HAD towers to control the structure, and how the symmetric system allows them to pull back those orders into our view.

Kolya: And we’ve noted that they have specific conditions on lambda for dependent choice to hold without requiring a lot of extra machinery.

Ada: That's it for this paper today, "The Ordering Principle and Higher Dependent Choice". It lays out how these principles can coexist in these non-standard universes built from forcing extensions.

Emmy: We’ve seen how they use HAD towers to control the structure, and how the symmetric system allows them to pull back those orders into our view.

Kolya: And we’ve noted that they have specific conditions on lambda for dependent choice to hold without requiring a lot of extra machinery.

More episodes

← Home