Ranked Forcing and the Length of Generalized Borel Hierarchies

Imagine you are an architect trying to build a city, but instead of bricks and mortar, you are building with logic and sets. In the world of mathematics, there is a famous structure called the Borel Hierarchy. Think of this hierarchy as a giant skyscraper with infinite floors.

Floor 1 contains simple, easy-to-describe shapes (like open windows).
Floor 2 contains shapes made by combining Floor 1 shapes (like walls made of windows).
Floor 3 gets more complex, and so on.

In the "standard" city (the real numbers), this skyscraper never stops. You can always find a shape that is too complex for Floor 100, so you need Floor 101. The "height" of the building is infinite.

However, mathematicians discovered that if you look at a smaller neighborhood within that city (a specific subspace), the building might collapse. Maybe in that tiny neighborhood, everything is so simple that you only need Floor 2 to describe everything. The "height" of the building there is just 2.

The Big Question: Can we control how tall this building is for different neighborhoods? Can we force a neighborhood to have a height of 5, or 100, or infinity?

This paper, written by Nick Chapman, tackles this question in a giant, uncountable universe.

The Setting: The "Uncountable" City

Usually, mathematicians study the "real numbers" (which are infinite, but countable in a specific way). Chapman moves to a much bigger universe involving a massive number called $\kappa$ (kappa). Imagine $\kappa$ as a city so vast that it dwarfs the entire real number line.

In this giant city, the rules of the Borel Hierarchy are different. The question is: How complex are the shapes in this giant city?

The Tool: "Rank-Forcing" (The Magic Elevator)

To change the height of the Borel skyscraper in a specific neighborhood, Chapman uses a mathematical tool called forcing. Think of forcing as a magic elevator that can add new "bricks" (sets) to your universe.

Chapman refines a technique called $\alpha$ -forcing.

The Analogy: Imagine you want to prove that a specific neighborhood is very complex (tall). You use the elevator to drop in a "fresh," incredibly complicated shape that doesn't fit on any lower floor. This forces the building to grow taller.
The Reverse: If you want to prove a neighborhood is simple (short), you use the elevator to add a "code" that explains how to build every shape in that neighborhood using only a few low floors. This forces the building to stay short.

The Challenge: The "Rank" Problem

The tricky part is doing this for many neighborhoods at once without breaking the city. If you try to add a complex shape to Neighborhood A and a simple shape to Neighborhood B, they might clash, or the complexity might "leak" from one to the other.

Chapman's breakthrough is a system called Ranked Forcing.

The Metaphor: Imagine every condition in your magic elevator has a "Rank Badge."
- A badge with a low number means "I am simple."
- A badge with a high number means "I am complex."
Chapman proves that if you organize your elevator rides carefully, you can ensure that the "complexity badges" don't get mixed up. He creates a "black box" (a set of rules) that guarantees: If you want Neighborhood A to be complex and Neighborhood B to be simple, you can do it simultaneously without them interfering.

The Results: Customizing the City

Using this system, Chapman builds several new mathematical universes (models) with specific properties:

Custom Heights: He shows that for any neighborhood with a certain size, you can force its Borel hierarchy to be exactly any height you want (as long as it's a valid mathematical number).
Size Matters: He discovers a rule: Larger neighborhoods tend to have taller Borel skyscrapers. He constructs a model where if Neighborhood A is smaller than Neighborhood B, then Neighborhood A's building is strictly shorter than Neighborhood B's.
Preserving the Past: In the giant city, some shapes are "rigid." If you build a shape in the original city, and you use the magic elevator, that shape stays exactly the same (it doesn't gain new, weird parts). Chapman uses this to build closed, perfect shapes with specific, pre-determined heights.

The Final Twist: The "Tree" Complexity

In the last section, Chapman looks at trees (mathematical structures that branch out, like family trees).

In the small city (real numbers), the set of all "well-founded" trees (trees that don't go on forever) is incredibly complex—it's not even on the Borel skyscraper at all!
In the giant city ( $\kappa$ ), things are different. The set of all well-founded trees is on the Borel skyscraper.
Chapman calculates exactly which floor this set lives on. He finds a precise formula: A tree of rank $\alpha$ lives on floor $2\alpha$ (roughly speaking). This is a sharp, exact calculation that mirrors the old rules but works in the new, giant universe.

Summary

Nick Chapman took a complex mathematical problem about the "height" of logical structures in a giant universe and solved it by inventing a ranked elevator system. This system allows mathematicians to:

Customize the complexity of different parts of the universe independently.
Prove that size dictates complexity in this new setting.
Calculate the exact complexity of tree structures in this giant world.

It's like being a master city planner who can decide exactly how tall the skyscrapers are in every district of a massive metropolis, ensuring they fit together perfectly without collapsing the whole city.

Here is a detailed technical summary of the paper "Ranked Forcing and the Length of Generalized Borel Hierarchies" by Nick Chapman.

1. Problem Statement and Motivation

The paper addresses the behavior of the $\kappa$ -Borel hierarchy on subspaces of the generalized Baire space $\kappa^\kappa$ , where $\kappa$ is a regular uncountable cardinal satisfying $\kappa = \kappa^{<\kappa}$ .

Classical Context: In classical descriptive set theory ( $\kappa = \omega$ ), the length of the Borel hierarchy on a subspace $X \subseteq \omega^\omega$ , denoted $\text{ord}(X)$ , is a measure of its topological complexity. A. Miller established that for uncountable $X$ , the value of $\text{ord}(X)$ is highly independent of ZFC and can be manipulated via forcing.
Generalized Context: In the generalized setting ( $\kappa > \omega$ ), the $\kappa$ -Borel hierarchy is generated by taking complements and unions of size $\le \kappa$ . While previous work (e.g., by Agostini, Motto Ros, and Pitton) generalized some results, a significant limitation remained: existing forcing techniques could only manipulate the hierarchy length to finite ordinals.
The Gap: The paper aims to extend Miller's framework to the uncountable case to determine the possible values of $\text{ord}_\kappa(X)$ for arbitrary ordinals $\alpha < \kappa^+$ , and to study the simultaneous behavior of this length across multiple subspaces of different cardinalities.

2. Methodology

The core methodology involves extending and systematizing Miller's $\alpha$ -forcing and ranked forcing to the generalized setting.

A. Generalized $\alpha$ -Forcing

The author defines a forcing notion $BM_\alpha(A, B, X)$ designed to control the complexity of subsets of a space $X \subseteq \kappa^\kappa$ .

Structure: Conditions are pairs $\langle f_p, R_p \rangle$ where $f_p$ maps leaves of a canonical tree $T_\alpha$ to basic open sets, and $R_p$ tracks "promises" about membership in the generic set.
Criticality Constraint: A novel technical addition for the uncountable case. It handles "small limit nodes" (nodes with rank being a limit ordinal of cofinality $<\kappa$ ) to prevent overdetermination and ensure the forcing remains well-behaved.
Regularity: The forcing is shown to be strategically $<\kappa$ -closed and satisfy a strong version of the $\kappa^+$ -chain condition ( $\kappa^+$ -c.c.). Crucially, the author introduces a property $(\heartsuit)$ (a strengthening of $\kappa$ -linkedness) to ensure that iterations of these forcings preserve cardinals and the $\kappa^+$ -c.c.

B. Ranked Forcing Framework

The paper utilizes Miller's concept of ranked forcing to prove preservation theorems for iterations.

Rank Functions: A rank function $rk: P \to \text{Ord}$ is defined such that for any condition $p$ and ordinal $\beta$ , there is a stronger condition $q$ with lower rank that "controls" compatibility with lower-rank conditions.
The "Old Switcheroo": The author adapts Miller's argument (Theorem 5.30) to show that if an iteration admits a sufficiently rich family of rank functions, a generic set added at an early stage cannot be defined at a lower level of the hierarchy in the final model. This is the mechanism used to establish lower bounds for $\text{ord}_\kappa(X)$ .

C. Iteration Strategy

The paper focuses on $<\kappa$ -supported iterations of $\alpha$ -forcing.

Ground Model Spaces: To ensure the existence of rank functions, the iterations are restricted to spaces $X_\gamma$ that exist in the ground model (or are decided as such).
Bookkeeping: Iterations are constructed to simultaneously add codes for all $\kappa$ -Borel subsets (pushing the hierarchy "down") and add generic sets that resist lower-level definitions (pushing the hierarchy "up").

3. Key Contributions and Results

A. Arbitrary Lengths for Single Spaces

The paper proves that for any space $X \subseteq \kappa^\kappa$ with $|X| > \kappa$ and any successor ordinal $1 < \alpha \le \kappa^+ $, there exists a forcing extension where$ \text{ord}_\kappa(X) = \alpha$.

Theorem 7.1: Establishes that $\text{ord}_\kappa(X)$ can be set to any successor ordinal or $\kappa^+$ .
Limit Ordinals: Theorem 7.2 shows that if $|X|$ is a limit cardinal, $\text{ord}_\kappa(X)$ can be set to a limit ordinal $\zeta$ (provided $\text{cf}(\zeta) = \text{cf}(|X|)$ ) by decomposing $X$ into smaller pieces.

B. Simultaneous Control by Cardinality

A major contribution is the ability to separate the hierarchy lengths of different spaces based on their cardinality.

Theorem 7.6: Given a function $f$ assigning ordinals to cardinals $\lambda \in (\kappa, 2^\kappa]$ (satisfying monotonicity and continuity constraints), there is a model where for all ground model spaces $X$ with $|X| = \lambda$ , $\text{ord}_\kappa(X) = f(\lambda)$ .
This demonstrates that the length of the hierarchy is not just a property of the space's topology but can be tuned independently for spaces of different sizes.

C. Preservation of Definability

The paper highlights a phenomenon unique to the uncountable setting: preservation of definability.

Unlike the countable case, where forcing often destroys the Borel nature of ground model sets, the constructed extensions preserve the $\kappa$ -Borel codes of ground model sets.
Corollary 7.13: It is consistent that for any $0 < \alpha \le \kappa^+ $, there exists a **closed** subset$ X \subseteq \kappa^\kappa $with$ \text{ord}_\kappa(X) = \alpha $. This is significant because in the classical case, closed sets have low Borel complexity (usually$ \le 2$), but in the generalized setting, closed sets can have arbitrarily high Borel complexity.

D. Generalized Steel Forcing and Tree Complexity

The final section generalizes Steel's forcing with tagged trees to the $\kappa$ setting.

Application: This is used to calculate the exact $\kappa$ -Borel complexity of classes of well-founded trees $WF_\alpha$ .
Theorem 8.10:
- $WF_{\kappa \cdot \alpha}$ is $\kappa$ - $\Sigma^0_{2\alpha}$ but not $\kappa$ - $\Pi^0_{2\alpha}$ .
- $WF_{\kappa \cdot \alpha + \beta}$ (for $0 < \beta < \kappa $) is$ \kappa $-$ \Pi^0_{2\alpha+1} $but not$ \kappa $-$ \Sigma^0_{2\alpha+1}$.
This mirrors classical results but requires new rank arguments adapted to the uncountable context.

4. Significance

Systematization: The paper provides a robust "black box" framework (via ranked forcing) for manipulating generalized Borel hierarchies, moving beyond ad-hoc constructions.
Resolution of Limitations: It resolves the technical limitation of previous works that could only achieve finite lengths for $\text{ord}_\kappa(X)$ , proving that the full spectrum of ordinals up to $\kappa^+$ is accessible.
New Phenomena: It uncovers and exploits the divergence between classical and generalized descriptive set theory, specifically regarding the behavior of closed sets and the preservation of definability under forcing.
Foundational Tools: The introduction of the criticality constraint in $\alpha$ -forcing and the property $(\heartsuit)$ for iterations provides essential tools for future research in generalized set theory and forcing iterations on uncountable cardinals.

In summary, Chapman's work successfully lifts the sophisticated machinery of Miller's ranked forcing to the uncountable realm, establishing a comprehensive theory for the possible lengths of generalized Borel hierarchies and their dependence on the cardinality of the underlying spaces.