The consistency strength of the failure of amenable C-sequences
Listen
Radio episode about this paper
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: "Amenable C-sequences and ineffability in L".
Emmy: Here's the gist of the paper. Amenable C-sequences and ineffability in L gives a relative consistency counterexample to the conjecture that every regular uncountable cardinal carrying no amenable C-sequence is ineffable in L The existence of a Π21-indescribable cardinal is equiconsistent with the existence of a Π21-indescribable cardinal carrying no amenable C-sequence and not ineffable in L The paper establishes that if ZFC + “there is a Π21-indescribable cardinal” is consistent, then so is ZFC + ∃κ κ is Π21-indescribable ∧ κ /∈ Aκ ∧ L = κ is not ineffable This result provides a relative consistency counterexample to the conjecture of Inamdar and Rinot.
Ada: The authors show that for every ground-model C-sequence on a weakly compact cardinal κ, generalized Hechler forcing adds a club D with D ∩ β ⊆ Cβ at stationarily many inaccessible indices.
Emmy: Indescribability and Ineffability The paper explores the relationship between indescribability and ineffability in L.
Ada: It proves that the least Π21-indescribable cardinal, if it exists, is neither subtle nor ineffable The consistency of a Π21-indescribable cardinal implies the consistency of a universe W = ZFC + V = L containing such a cardinal.
Title and authors: Ada: So we're looking at this paper called "Amenable C-sequences and ineffability in L". It’s about regular uncountable cardinals that don't have any amenable C-sequence and whether those cardinals are ineffable inside the constructible universe, L.
Emmy: And it sets up a counterexample to a conjecture made by Inamdar and Rinot, which suggests every such cardinal must be ineffable in L. It shows that the existence of a pi two one-indescribable cardinal is exactly as hard to prove as finding one that lacks an amenable C-sequence but isn't ineffable in L.
Kolya: That means if you can find a cardinal without an amenable C-sequence, you might not be able to tell if it's ineffable inside L. It’s a subtle distinction between the two concepts, right?
Ada: Exactly. The paper gives a concrete way to construct this situation using generalized Hechler forcing applied to a ground model C-sequence on a weakly compact cardinal kappa. They show that this forcing adds a club set D with specific properties related to the sequence at many inaccessible indices.
Emmy: What I find interesting is how they connect the structure of these C-sequences—which are essentially sequences of sets—to the forcing construction. They use generalized Hechler forcing to get models with no amenable C-sequence while keeping those high levels of indescribability intact and non-ineffability in L.
Kolya: It sounds like they're not just building a model, but they're carefully controlling how the universe behaves at different levels of complexity, which is crucial when dealing with these large cardinal properties.
Ada: Right. They prove that under certain conditions, specifically when kappa is pi two one-indescribable and two kappa equals kappa plus one, the full Hechler iteration computed in a universe U satisfies the property of being pi two one-indescribable at every stage up to that length.
Emmy: That preservation aspect is key. It means that even after all this forcing, the structural properties we started with—like pi two one-indescribability—don't just vanish; they are maintained in the new universe U.
Kolya: So they are showing that you can preserve these complex large cardinal properties while simultaneously achieving a property related to C-sequences. But what about the limitations of this construction?
Ada: Well, one point they make is that for pi three one-indescribable cardinals, the local preparation has a different size bound, which means you have to use Johnstone's corollary directly instead of relying on the previous result. They also point out that they don't determine the absolute optimal consistency strength when you drop the requirement for pi two one-indescribability in their conclusion.
Emmy: That makes sense. It suggests that while they found a way to show that existence implies consistency, pinpointing the exact lowest level of large cardinal required for that specific outcome is still an open area.
Kolya: And then there's the idea about the connection between Hechler forcing and club capture using next-point functions. They use this to make sure that every C-sequence in the final extension actually becomes non-amenable by capturing it at some point in the iteration process.
Title and authors: Ada: So, to summarize, they establish a relative consistency counterexample: if you assume a pi two one-indescribable cardinal exists, then you can force into a universe where there's no amenable C-sequence and that cardinal isn't ineffable in L. This directly challenges the conjecture about all such cardinals needing to be ineffable.
Emmy: It’s a statement about the structure of inner models and how forcing interacts with those large cardinal definitions, showing that even these strong properties can be manipulated while preserving their essence.
Kolya: For someone who just listens to the show, this means there's a way to construct mathematical worlds where some cardinals behave in ways we didn't expect regarding sequences of sets, without losing the structural strength of those cardinals themselves.
Ada: And looking ahead, they’ve shown that for pi three one-indescribable cardinals as well, if you start with V equals L and have a pi three one-indescribable cardinal kappa, you can use the same Hechler iteration to force a universe where kappa is not ineffable in L.
Emmy: That’s a pretty strong result. It shows that the methods they developed for the pi two one-indescribable case are robust enough to handle higher levels of indescribability, provided you adjust the preparation steps correctly.
Kolya: I just wonder how far this goes in terms of general applicability. They built this on weakly compact cardinals and specific forcing techniques, so we need to see if that machinery can be generalized further beyond these specific settings.
Ada: That’s exactly what the work suggests—the tools are there, but the next step is exploring whether these capture theorems can handle even more abstract structures or different cardinal characteristics.
Emmy: So, we’ve seen how they use Hechler forcing and club capture to ensure non-amenability while preserving pi two one-indescribability, and that this works for pi three one-indescribable cardinals too in the context of L.
Kolya: It seems like a solid piece of machinery for constructing specific counterexamples, which is valuable because it shows exactly where the conjectures might fail when you look at these intricate set-theoretic properties.
Ada: To wrap this up, the paper "Amenable C-sequences and ineffability in L" gives us a relative consistency result that shows the conjecture about every regular uncountable cardinal carrying no amenable C-sequence being ineffable in L is not provable from ZFC alone.
Emmy: It’s a demonstration that the relationship between structural properties like indescribability and set-theoretic properties like ineffability can be quite nuanced when you start forcing constructions.
Kolya: I just think it’s important to keep an eye on how these capture theorems evolve, because understanding how to control C-sequences in this way could open up new avenues for studying consistency strengths across different levels of large cardinals.
Ada: That’s right. We'll keep following the development of this area as they continue to explore these connections between set theory and cardinal arithmetic.
The paper's summary: Ada: So, to recap what we're looking at in "Amenable C-sequences and ineffability in L," this paper is showing that you can construct a mathematical universe where some large cardinal properties hold, but a specific property related to sequences of sets fails.
Emmy: Exactly. They take a regular uncountable cardinal, say kappa, and they look at whether that kappa has any "amenable C-sequences." An amenable C-sequence is basically one that behaves nicely when you look at its structure as a sequence of sets.
Kolya: So the big question here is whether having no amenable C-sequence forces the cardinal to be ineffable inside the constructible universe, L. This paper gives a counterexample to that idea.
Ada: Right. They show that if we assume there's this cardinal kappa without an amenable C-sequence, it doesn't guarantee it will be ineffable in L. The existence of a pi two one-indescribable cardinal is exactly as consistent as finding one that lacks an amenable C-sequence but isn't ineffable.
Emmy: The methodology they use involves generalized Hechler forcing, which is a kind of forcing technique used to change the structure of the universe. They use it to add a club set with very specific properties related to those sequences at many inaccessible indices below that large cardinal kappa.
Kolya: And what this actually means for us in terms of the numbers and caveats is that they're not just making up a scenario; they're showing how you can build these models while keeping other strong properties intact, like pi two one-indescribability and non-ineffability in L.
Ada: That preservation part is pretty interesting because it shows the forcing isn't totally destructive. They prove that even after all this complex forcing, the structure of the universe at higher levels stays valid in a certain way.
Emmy: And they get really technical about how this works, using things like local lottery preparation and Hechler iterations to ensure that every C-sequence ends up being non-amenable in the final model. It’s all about making sure the capture happens somewhere in that long iteration process.
Kolya: So for someone who just listens to the show, it means we can't assume that if a cardinal lacks an amenable C-sequence, it has to be ineffable inside L. There's a gap between those two concepts that this construction exposes.
Ada: It’s a relative consistency result, so they can't say anything definitive about the absolute consistency strength without adding even bigger large cardinals on top of it. They don't get to pin down the exact minimal cardinal needed for this specific outcome.
Emmy: The paper also touches on higher levels, showing that if you start with a pi three one-indescribable cardinal and V equals L, you can use the same Hechler iteration to force it into a universe where that cardinal isn't ineffable in L either.
Kolya: That’s a pretty strong statement about the robustness of these forcing techniques across different levels of indescribability. It suggests that the methods they developed for pi two one-indescribable cardinals are quite flexible.
Ada: So, if you're looking at this paper as a way to understand the limits of what we can prove about ineffability in L, this is a good place to look because it shows exactly where those conjectures might break down.
Emmy: It really highlights the interplay between forcing and inner model theory when dealing with these very high-level cardinal characteristics. That interaction is what makes these kinds of results so interesting from an algebraic perspective.
Kolya: So the next thing we can explore, given how they handle higher levels, is whether this kind of construction can be generalized to even more complex structural properties than just C-sequences.
The paper's improvements: Tom: So, we're looking at how these researchers are trying to sharpen this result for "Amenable C-sequences and ineffability in L." They've pointed out a few ways to make the construction more robust or clearer.
Ada: Basically, they suggest improving the proof of consistency by making sure their generalized Hechler forcing actually constructs a model where every single ground-model C-sequence is non-amenable. That’s Theorem five point four, it gives them a stronger guarantee on the sequence behavior during the construction itself.
Emmy: From an algebraic geometry viewpoint, that's like making sure the underlying shape of the universe you're building is structurally sound even after all those forcing operations are done. It ensures that even with all this adding and capturing, you haven't lost control over the original structure.
Kolya: And they also suggest a way to enhance structural preservation for those higher-level computations by using Theorem five point one, which basically tells us how to get a universe where all the complex iterations up to length kappa plus one still maintain that pi two one-indescribable property in the new model.
Ada: That's important because it gives us more confidence that the universe we build is actually behaving as we intended at those higher stages. It means we don't have to worry about the forcing messing up our large cardinal assumptions mid-construction.
Emmy: Plus, they brought in Appendix A, which details how the target universe has an external size of at most kappa plus one, which is a concrete constraint for us when we're trying to verify these properties in practice. It keeps the complexity bound tight.
Kolya: From a probabilistic standpoint, that tightening of bounds is helpful because it means the constants in their arguments are staying within manageable limits for the application we're testing. It shows the tail they're governing is behaving predictably.
Ada: And they also developed a method for verifying C-sequence capture by using the pressing-down lemma, which helps them show that this local domination bound stays constant on a stationary set of indices. This makes their verification process much more efficient than checking every single index individually.
Emmy: So, what this means for us is that the paper isn't just a static existence proof; it has a roadmap for making the construction more precise and verifiable, which is a huge step in applying these abstract set theory ideas to actual model building.
Kolya: It’s about moving from just proving something exists to having a better understanding of how those constructions behave under specific constraints, like bounding the size of the final universe.
Ada: Exactly. The next thing we can explore is how this work connects to other areas, maybe looking at what happens if we replace C-sequences with some other kind of sequence structure entirely.
Conclusion: Ada: So we're wrapping up "Amenable C-sequences and ineffability in L" by summarizing what this paper achieved for us today. We established that finding a cardinal without an amenable C-sequence doesn't automatically mean it has to be ineffable inside L.
Emmy: They used generalized Hechler forcing to show how you can construct models where those properties are preserved while the specific sequence condition is broken at some level. It shows a structural flexibility we didn't expect for these large cardinal concepts.
Kolya: I just think it’s important that this construction relies on stationary capture, which is a very concrete way to handle the sequence behavior, instead of just abstract properties. The bounds they set are what really matter here for the probabilistic side of things.
Ada: Right. And the result for higher levels, like pi three one-indescribable cardinals, suggests this method has more reach than we first thought when we look at these inner model constraints. It keeps showing us how deep these forcing techniques can go.
Emmy: The implication is that the relationship between set-theoretic strength and descriptive properties like ineffability in L isn't as simple as it used to be when you start manipulating the universe with forcing.
Kolya: It changes how we think about consistency proofs because it shows there are more paths to build universes where certain assumptions fail, without immediately collapsing everything. The caveat is that we still have those high-level consistency requirements on the starting cardinal to keep things going.
Ada: Indeed, and the paper itself gives us a clearer picture of how these tools interact with C-sequences under different forcing regimes. It’s a solid piece of machinery for exploring these boundaries in set theory.
Emmy: So, "Amenable C-sequences and ineffability in L" shows us that we can engineer specific universes where certain structural assumptions hold or fail based on how we force the underlying cardinal properties to behave at different scales.
Kolya: It’s a useful tool for testing limits, but remember the caveat: you still need those strong starting assumptions on the cardinal itself to make sure you're in a universe we can actually talk about.
Ada: Exactly. Next up, we'll be looking at how these kinds of structural capture arguments might apply to other sequence types or maybe different classes of mathematical objects entirely.
São Paulo Research Foundation · Bar-Ilan University · OpenAI
math.LO
Submitted: 2026-10-06
Updated: 2026-11-06
Comments: The upper bound is reduced from a $Π^2_1$-indescribable cardinal to an inaccessible $κ$ that is $Π^1_ξ$-indescribable for every $ξ<κ^+$. We now also establish an exact matching lower bound in $L$, determining the consistency strength and proving equiconsistency.40 pages
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 100/100
The gist: Amenable C-sequences and ineffability in L gives a relative consistency counterexample to the conjecture that every regular uncountable cardinal carrying no amenable C-sequence is ineffable in L The…
Key concepts
- Amenable C-sequence
- A sequence of sets indexed by ordinals that exhibits a certain structural property related to amenability. The paper focuses on constructing models where such sequences are guaranteed not to have this property, which is key to proving the counterexample.
- Ineffability in L
- A cardinal is 'ineffable' in the constructible universe L if it cannot be reached by a definable process within that universe. The paper investigates whether a cardinal carrying no amenable C-sequence can still be ineffable, finding that this is not the case under certain conditions.
- $\Pi_2^1$-indescribable cardinal
- This is a very strong type of large cardinal property related to second-order logic. The existence of such a cardinal is used as a consistency assumption. The paper shows that if one exists, it can be shown to be not ineffable in L, providing the basis for the counterexample.
- Generalized Hechler forcing
- This is a specific type of forcing technique used to construct new set-theoretic universes. It is employed here to add a club set with specific intersection properties related to C-sequences, allowing researchers to force models that lack amenable C-sequences while preserving other strong cardinal properties.
Terminology
Summary
Amenable C-sequences and ineffability in L gives a relative consistency counterexample to the conjecture that every regular uncountable cardinal carrying no amenable C-sequence is ineffable in L The existence of a Π21-indescribable cardinal is equiconsistent with the existence of a Π21-indescribable cardinal carrying no amenable C-sequence and not ineffable in L
Main Results
The paper establishes that if ZFC + “there is a Π21-indescribable cardinal” is consistent, then so is ZFC + ∃κ κ is Π21-indescribable ∧ κ /∈ Aκ ∧ L = κ is not ineffable This result provides a relative consistency counterexample to the conjecture of Inamdar and Rinot. The authors show that for every ground-model C-sequence on a weakly compact cardinal κ, generalized Hechler forcing adds a club D with D ∩ β ⊆ Cβ at stationarily many inaccessible indices. p. 0 The existence of a Π
2
1-indescribable cardinal is equiconsistent with
the existence of a Π
2
1-indescribable cardinal carrying no amenable C-sequence and not ineffable
in L. For every ground-model C-sequence on a weakly compact cardinal κ, generalized Hechler
forcing adds a club D with D ∩ β ⊆ Cβ at stationarily many inaccessible indices.Where the paper says it
Indescribability and Ineffability
The paper explores the relationship between indescribability and ineffability in L. It proves that the least Π21-indescribable cardinal, if it exists, is neither subtle nor ineffable The consistency of a Π21-indescribable cardinal implies the consistency of a universe W = ZFC + V = L containing such a cardinal. p. 2 Proposition 2. The least Π2
1
-indescribable cardinal, if it exists, is neither subtle nor ineffable. Its proof in Appendix A uses a canonical
presentation with conditions in Hκ+ , shows that the prepared universe and the embedding target
compute the same canonical iteration, and carries out two lifts. For a Π3
1
-indescribable cardinal,
the corresponding local preparation has the larger size bound ℶκ+1 = 2κ
, so Johnstone’s corollary
applies directly to a dense presentation of the iteration.Where the paper says it
Where the paper says it
Stationary Capture by Generalized Hechler Forcing
The core of the construction involves proving stationary local domination for a ground-model family of functions indexed by the inaccessible cardinals below a weakly compact cardinal. The authors use generalized Hechler forcing to obtain models with no amenable C-sequence while preserving Π21-indescribability and non-ineffability in L. p. 1 Models with no amenable C-sequence were obtained by Radin forcing [1], and later by
overlapping-extender forcing [2]. We obtain such a model by Hechler forcing, while preserving
Π2
1
-indescribability and non-ineffability in L. Under 2
κ = κ
+, Theorem 5. 1
extends this result to the full Hechler iteration. 8 GABRIEL FERNANDES
Since this construction applies below every condition forcing a club, Dκ forces T(
⃗f, d) to be
stationary. □
Definition 3.Where the paper says it
Where the paper says it
Where the paper says it
Preservation and the Consistency Result
The paper details the machinery of Hechler iterations and local lottery preparation used to construct these models. Theorem 5.1 shows that if κ is Π21-indescribable and 2κ = κ+, then the full < κ-support Hechler iteration computed in U satisfies Pθ ⊩U κ is Π21-indescribable. p. 1 Its proof in Appendix A uses a canonical
presentation with conditions in Hκ+ , shows that the prepared universe and the embedding target
compute the same canonical iteration, and carries out two lifts. For a Π3
1
-indescribable cardinal,
the corresponding local preparation has the larger size bound ℶκ+1 = 2κ
, so Johnstone’s corollary
applies directly to a dense presentation of the iteration. Each final C-sequence appears in an intermediate extension; the
next Hechler stage captures it, and the closed tail preserves the stationary capture set. At height κ + 1, [9, Corollary 38] covers orders of size at most κ. In
particular, κ /∈ Aκ says exactly that every C-sequence on κ is captured by some club. If ZFC+ “there is a Π2
1
-indescribable cardinal” is consistent, then so is
ZFC + ∃κ
κ is Π
2
1
-indescribable ∧ κ /∈ Aκ ∧ L |= κ is not ineffable
.Where the paper says it
Where the paper says it
Where the paper says it
Appendix Details
Appendix A provides technical details on the preservation arguments. It describes the embedding data and the canonical presentation of Eθ, showing that each Eθ is forcing equivalent to Pθ and is < κ-closed and κ+-Knaster. p. 1 1
extends this result to the full Hechler iteration. Its proof in Appendix A uses a canonical
presentation with conditions in Hκ+ , shows that the prepared universe and the embedding target
compute the same canonical iteration, and carries out two lifts. 1
extends this result to the full Hechler iteration. Its proof in Appendix A uses a canonical
presentation with conditions in Hκ+ , shows that the prepared universe and the embedding target
compute the same canonical iteration, and carries out two lifts. 1
extends this result to the full Hechler iteration. Its proof in Appendix A uses a canonical
presentation with conditions in Hκ+ , shows that the prepared universe and the embedding target
compute the same canonical iteration, and carries out two lifts. Thus the consistency upper bound supplied by our
construction is strictly below an ineffable cardinal. We do not determine the optimal consistency
strength when the indescribability requirement in the conclusion is omitted.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
References
The paper cites numerous foundational works including [1] Omer Ben-Neria and Jing Zhang, Compactness and guessing principles in the Radin extensions, Journal of Mathematical Logic 23(2) (2023), Article 2250024 and [9] Thomas A. Johnstone, Strongly unfoldable cardinals made indestructible, The Journal of Symbolic Logic 73(4) (2008), 1215–1248.
--- Page 1 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
Abstract. We give a relative consistency counterexample to the conjecture of Inamdar and Rinot that every regular uncountable cardinal carrying no amenable C-sequence is ineffable in the constructible universe L The existence of a Π21-indescribable cardinal is equiconsistent with the existence of a Π21-indescribable cardinal carrying no amenable C-sequence and not ineffable in L For every ground-model C-sequence on a weakly compact cardinal κ, generalized Hechler forcing adds a club D with D ∩ β ⊆ Cβ at stationarily many inaccessible indices We use this capture theorem in an iteration of length κ + after Johnstone’s local lottery preparation
--- Page 2 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The converse consistency implication follows from the indescribability asserted in the conclusion, so the two theories in Theorem 1.3 are equiconsistent Theorem 1. p. 1 2 GABRIEL FERNANDES
The converse consistency implication follows from the indescribability asserted in the conclusion,
so the two theories in Theorem 1. 3 are equiconsistent. 3 are equiconsistent. 3 also gives a negative answer
to [1, Question 5. 5], which asks whether the existence of a cardinal carrying no amenable Csequence is equiconsistent with the existence of an ineffable cardinal. Indeed, by [7, Lemma 5. In particular, Vδ satisfies
ZFC+ “there is a Π2
1
-indescribable cardinal”. Thus the consistency upper bound supplied by our
construction is strictly below an ineffable cardinal. Thus the consistency upper bound supplied by our
construction is strictly below an ineffable cardinal. We do not determine the optimal consistency
strength when the indescribability requirement in the conclusion is omitted.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
--- Page 3 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
Models with no amenable C-sequence were obtained by Radin forcing [1], and later by overlapping-extender forcing [2] We obtain such a model by Hechler forcing, while preserving Π21-indescribability and non-ineffability in L We prove stationary local domination at weakly compact cardinals.
--- Page 4 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
A related result in [11] gives a model in which all C-sequences are trivial in the sense of the C-sequence number, while a κ-Souslin tree exists Triviality allows an initial segment of a cofinal set to be covered by an entry chosen at an index that need not equal the endpoint of that initial segment; capture requires a club D such that D ∩ β ⊆ Cβ for stationarily many β Our model retains weak compactness, and every C-sequence is captured in the sense of Definition 1.2. We start in L, fix its least Π21-indescribable cardinal κ, and show that κ is not ineffable there. p. 1 Our model
retains weak compactness, and every C-sequence is captured in the sense of Definition 1. We start in L, fix its least Π2
1
-indescribable cardinal κ, and show that κ is not ineffable there. We then apply the local lottery preparation of [9] and iterate the full generalized Hechler forcing
with support < κ for κ
+ stages. Each final C-sequence appears in an intermediate extension; the
next Hechler stage captures it, and the closed tail preserves the stationary capture set.Where the paper says it
Where the paper says it
--- Page 5 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The use of a prepared cardinal followed by a long Hechler iteration also appears in [12, Theorem 4.7], for a conclusion about cardinal characteristics There, we use the weaker local hypothesis Π21-indescribability and length κ+. p. 1 There, indestructible strong unfoldability
is followed by a < κ-support Hechler iteration of length κ
++. Here we use the weaker local
hypothesis Π2
1
-indescribability and length κ
+. Here we use the weaker local
hypothesis Π2
1
-indescribability and length κ
+. The capture theorem ensures that every C-sequence
in the final extension is non-amenable.Where the paper says it
Where the paper says it
--- Page 7 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The connection between Hechler forcing and club capture is given by next-point functions For inaccessible β and ξ (ξ + 1)) (ξ < β). If d[β] ⊆ β and nβ ≤∗ d ↾ β hold at stationarily many inaccessible indices, the pressing-down lemma makes the domination threshold uniform on a stationary subset A single tail D of Ed then captures C⃗, as shown in Corollary 3. p. 1 If d[β] ⊆ β and nβ ≤∗ d ↾ β hold at
stationarily many inaccessible indices, the pressing-down lemma makes the domination threshold
uniform on a stationary subset. A single tail of the club of limit closure points of d then captures
C⃗ , as shown in Corollary 3.Where the paper says it
--- Page 8 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The reflection argument at a weakly compact cardinal supplies the stationary local domination needed in Theorem 3.10
--- Page 9 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
We first reflect predensity from Dκ to Dβ for an inaccessible β < κ, then construct a condition in Dκ with stem length β Applied to the next-point functions of a C-sequence, this gives stationary capture
--- Page 13 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The formulas ϕ7 and ϕ8 supply sp and sα,i as elements of Vβ
--- Page 15 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The formula ϕ1 makes β > ω a limit ordinal At a limit height, a finite tuple belongs to Vβ exactly when all its entries do Thus ϕ9 implies that K′ ∩β is unbounded in β Since K′ is closed, β ∈ K′ ⊆ K ∩ B, so β is an uncountable strong-limit cardinal
--- Page 17 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The formula ϕ11 says that all these functions have bounded range Hence cf(β) = β, and β is strongly inaccessible
--- Page 23 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The resulting capture set contains T and is therefore stationary in V [d]
--- Page 24 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
Since the sequence was arbitrary, κ /∈ Aκ in the final extension
--- Page 25 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The consistency of a Π31-indescribable cardinal with V = L is recorded in [9, Section 1, p. 1215] Begin in W = ZFC + V = L and take its least Π31-indescribable cardinal κ If κ were subtle in W, [7, Lemma 5. p. 2 The least Π2
1
-indescribable cardinal, if it exists, is neither subtle nor ineffable. If the least such cardinal κ were subtle, [7, Lemma 5. The least Π2
1
-indescribable cardinal, if it exists, is neither subtle nor ineffable. If the least such cardinal κ were subtle, [7, Lemma 5. If the least such cardinal κ were subtle, [7, Lemma 5. 4] would give a totally indescribable
cardinal γ < κ. If the least such cardinal κ were subtle, [7, Lemma 5. 4] would give a totally indescribable
cardinal γ < κ. We start in L, fix its least Π2
1
-indescribable cardinal κ, and show that κ is not ineffable there. We then apply the local lottery preparation of [9] and iterate the full generalized Hechler forcing
with support < κ for κ
+ stages. We start in L, fix its least Π2
1
-indescribable cardinal κ, and show that κ is not ineffable there. We then apply the local lottery preparation of [9] and iterate the full generalized Hechler forcing
with support < κ for κ
+ stages.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
--- Page 25 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The proposition preserves Π31-indescribability at every initial stage, including the final stage In particular, weak compactness holds at every proper initial stage, so Theorem 5.4 applies over U
--- Page 15 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The consistency of a Π31-indescribable cardinal with V = L is recorded in [9, Section 1, p. 1215] Begin in W = ZFC + V = L and take its least Π31-indescribable cardinal κ If κ were subtle in W, [7, Lemma 5.4] would give a totally indescribable cardinal below it, contradicting its minimality Thus κ is not ineffable in W, and GCH supplies 2κ = κ+. Apply Proposition 5.3 in W, and then force with the full Hechler iteration of length κ+ in the prepared universe U
--- Page 15 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The proposition preserves Π31-indescribability at every initial stage, including the final stage In particular, weak compactness holds at every proper initial stage, so Theorem 5.4 applies over U
--- Page 15 ---
AMENABLE C-SEQUENCES AND INEFFABILITY IN L
The proposition preserves Π31-indescribability at every initial stage, including the final stage In particular, weak compactness holds at every proper initial stage, so Theorem 5.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Improve proof of consistency by using generalized Hechler forcing to construct a model where every ground-model C-sequence is non-amenable, as shown in Theorem 5.4:
If G is generic over V and d = dG, then in V [d] there are a club D such that D ∩ β ⊆ Cβ (β ∈ T).
This allows the AI system to operate reliably on sequences where amenability is guaranteed to fail. -
Enhance structural preservation for high-level computations by utilizing the preservation theorems, specifically Theorem 5.1: "Suppose kappa is Pi21-indescribable and 2kappa = kappa+, let G be generic for the local lottery preparation above and put U = V [G]. Then U |= 2kappa = kappa+, and, for every theta <= kappa+, the full <kappa-support Hechler iteration computed in U satisfies Ptheta in U is Pi21-indescribable." This ensures that complex mathematical structures remain valid under forcing operations.
-
Enable the construction of models with specific cardinal properties by leveraging the results from Appendix A:
The target N[j(G)] still has external size at most kappa+, since N = kappa+ and the two forcings preserve kappa+.
This allows the AI to verify and operate within universes where certain strong inaccessibility properties are maintained. -
Develop a method for verifying C-sequence capture by using the pressing-down lemma:
The pressing-down lemma makes the local domination bound constant on a stationary set of indices.
This allows the system to efficiently determine whether a sequence is amenable or non-amenable based on stationary sets of indices.
Abstract
We give a relative consistency counterexample to the conjecture of Inamdar and Rinot that every regular uncountable cardinal carrying no amenable C-sequence is ineffable in the constructible universe L. The existence of a Π 2 1-indescribable cardinal is equiconsistent with the existence of a Π 2 1-indescribable cardinal carrying no amenable C-sequence and not ineffable in L. For every ground-model C-sequence on a weakly compact cardinal κ, generalized Hechler forcing adds a club D with D β C β at stationarily many inaccessible indices. We use this capture theorem in an iteration of length κ+ after Johnstone's local lottery preparation.
Sources
- Compactness and Guessing Principles in the Radin Extensions
- Was Ulam right? I: Basic theory and subnormal ideals
- A new model for all $C$-sequences are trivial
Related papers
- Classification of bipartite observables III: simplicity, mixtures and quantum error correction
- Indiscernible Extraction in Theories with Bounded k-splitting
- Measuring the Complexity of Countable Presburger Models
- A non-trivially non-trivial automorphism at an inaccessible cardinal
- The Ordering Principle and Higher Dependent Choice
- On separable pairs of fields and beautiful pairs of separably closed valued fields