Fodor space in generalized descriptive set theory

This paper establishes that for an inaccessible cardinal $\kappa$, the isomorphism relation of any theory with fewer than $\kappa$ non-isomorphic models of size $\kappa$ is continuously reducible to the isomorphism relation of any unstable or superstable non-classifiable theory within the space of regressive functions on $\kappa^\kappa$.

The Gist

Imagine you are a librarian in a massive, infinite library. This library contains every possible book that could ever be written, but the books are written in a strange, abstract code. Your job is to sort these books into "shelves" based on whether they are essentially the same story (isomorphic) or completely different.

In the world of mathematics, specifically Generalized Descriptive Set Theory, mathematicians try to figure out how "hard" it is to sort these books. Some sorting tasks are easy (like sorting by the first letter), while others are incredibly complex.

This paper, written by Idan Feldman and Miguel Moreno, tackles a specific, difficult sorting problem involving infinite books (mathematical models) and a special, tricky section of the library called the Fodor Space.

Here is the story of what they discovered, broken down into simple concepts:

1. The Two Types of Stories (Theories)

The authors are comparing two types of mathematical "stories" (called theories):

• The "Simple" Stories (Classifiable): Imagine a story where the plot is very rigid. No matter how you rearrange the characters, there are only a few distinct ways the story can end. In math terms, there are very few "non-isomorphic models" (few unique versions of the story).
• The "Chaotic" Stories (Non-classifiable): Imagine a story that is wild and unpredictable. You can rearrange the characters in infinite, wildly different ways, and every single version feels unique. These are "unstable" or "superstable non-classifiable" theories.

The Big Question: Can we take the "Simple" stories and translate them into the "Chaotic" ones in a way that preserves their structure? If we can, it means the chaotic stories are "harder" to sort than the simple ones.

2. The Old Map vs. The New Map

Previously, mathematicians knew how to do this translation if the library was built on a "successor" foundation (like a ladder where every rung has a clear next step). They used a standard map called Borel reduction.

However, this paper deals with a library built on an Inaccessible Cardinal. Think of this as a library so vast and "jagged" that it doesn't have a clear "next step" in the usual sense. It's like trying to navigate a mountain range where the peaks are so high and far apart that standard ladders don't work.

The authors wanted to prove that even in this jagged, inaccessible landscape, the "Simple" stories can still be translated into the "Chaotic" ones. But they needed a better map. They needed a Continuous Reduction.

• Analogy: A "Borel reduction" is like translating a book using a dictionary that you can look up words in, but the process might be a bit clunky. A "Continuous reduction" is like a live, seamless translation where the flow of the story never breaks. It's a stronger, smoother connection.

3. The Fodor Space: The "Regressive" Zone

To solve this, the authors introduced a special zone in the library called the Fodor Space.

• The Metaphor: Imagine a hallway where every person walking down it is forced to look back at the floor they just stepped on. If you are at step 100, you must look at step 99 or lower. If you are at step 50, you look at step 49 or lower.
• The Rule: In this space, functions are "regressive." They always point backward to a smaller number. This creates a unique, constrained environment that is perfect for handling these massive, inaccessible infinities.

The authors realized that by forcing their "Simple" stories into this "looking-back" hallway (the Fodor Space), they could build a bridge to the "Chaotic" stories.

4. Building the Bridge: Colored Trees and Models

How did they build the bridge? They used a construction method involving Colored Trees.

• The Tree: Imagine a giant family tree. But instead of just people, the branches are colored.
• The Colors: In previous attempts, they only had two colors (like Red and Blue). But because the library is so huge (inaccessible), they needed thousands of colors to encode enough information.
• The Construction: They took the "Simple" story, turned it into a tree with many colors, and then used a magical machine (called an Ehrenfeucht-Mostowski model) to turn that tree into a "Chaotic" story.

The magic of their proof is that if two "Simple" stories are different, their colored trees will look different, and the resulting "Chaotic" stories will definitely be different. If the "Simple" stories are the same, the "Chaotic" ones will be the same.

5. The Main Result (The "Aha!" Moment)

The paper proves Theorem A:
If you have a "Simple" story with very few unique versions, and you try to translate it into a "Chaotic" story (one that is unstable or superstable non-classifiable), you can do it smoothly and continuously using this new Fodor Space method.

Why does this matter?
It confirms a grand conjecture in mathematics (the "Main Gap" conjecture). It tells us that in the universe of infinite mathematical structures, there is a clear hierarchy:

1. The Simple/Classifiable: These are "small" and easy to sort.
2. The Chaotic/Non-classifiable: These are "huge" and hard to sort.

The authors showed that no matter how weird the "Simple" story is, it will always be "smaller" (easier to sort) than the "Chaotic" ones, even in the most extreme, inaccessible mathematical landscapes.

Summary in One Sentence

The authors built a special, backward-looking hallway (Fodor Space) and a multi-colored tree system to prove that simple mathematical stories can always be smoothly translated into complex, chaotic ones, confirming that chaos is always "harder" to sort than order, even in the most infinite realms of math.

Technical Summary

Here is a detailed technical summary of the paper "Fodor Space in Generalized Descriptive Set Theory" by Idó Feldman and Miguel Moreno.

1. Problem Statement and Context

Context:
The paper operates within Generalized Descriptive Set Theory (GDST), which extends classical descriptive set theory (based on the Baire space $\omega^\omega$) to the generalized Baire space $\kappa^\kappa$, where $\kappa$ is an uncountable cardinal. A central theme in GDST is the classification of isomorphism relations ($\cong_{\mathcal{T}}$) of models of first-order theories $\mathcal{T}$ of size $\kappa$.

The Main Gap Conjecture:
The authors address a generalized version of Shelah's Main Gap Theorem. The conjecture posits a hierarchy of complexity for isomorphism relations:

• Classifiable theories (stable, superstable, and satisfying specific structural conditions like the absence of DOP/OTOP) should have "simple" isomorphism relations.
• Non-classifiable theories (unstable, or superstable with DOP/OTOP) should have "complex" isomorphism relations.
• Specifically, the conjecture asks if the isomorphism relation of a classifiable theory $\mathcal{T}_1$ is Borel reducible (or continuously reducible) to that of a non-classifiable theory $\mathcal{T}_2$.

The Gap in Previous Work:
Previous results (by Hyttinen, Weinstein, Moreno, Mangraviti, etc.) established this reducibility for:

1. Successor cardinals $\kappa = \lambda^+$.
2. Inaccessible cardinals $\kappa$, but only for specific cases (e.g., when $\mathcal{T}_2$ is stable with OCP or superstable with S-DOP).
3. The case where $\mathcal{T}_1$ has fewer than $\kappa$ non-isomorphic models was known to be Borel reducible to non-classifiable theories, but the reduction was not necessarily continuous.

The Specific Problem:
The authors aim to prove a continuous reduction version of the Main Gap for strongly inaccessible cardinals $\kappa$. Specifically, they want to show that if $\mathcal{T}_1$ has $<\kappa$ non-isomorphic models of size $\kappa$ and $\mathcal{T}_2$ is unstable or superstable non-classifiable, then $\cong_{\mathcal{T}_1} \leq_c \cong_{\mathcal{T}_2}$.

2. Methodology

The proof strategy involves constructing a continuous reduction from the equivalence relation of $\mathcal{T}_1$ to the isomorphism relation of $\mathcal{T}_2$. The methodology is divided into three main stages:

A. The Fodor Space and Regressive Functions

Standard reductions in GDST often map to the generalized Cantor space $2^\kappa$. However, for theories with$<\kappa$models, the authors utilize the **Fodor space**$\mathbb{F}$.

• Definition: $\mathbb{F} = \{ \eta \in \kappa^\kappa \mid \exists \alpha < \kappa, \forall \beta > \alpha, \eta(\beta) < \beta \}$. These are "eventually regressive" functions.
• Motivation: If a theory has $<\kappa$ models, the isomorphism relation can be reduced to an equivalence relation on a space of size $\kappa$. The authors show that this reduction can be mapped into the Fodor space, where the functions are regressive on a tail. This allows for a continuous reduction that respects the topological structure of the space.

B. Ordered Colored Trees

The core of the construction involves encoding the information of the input function (representing a model of $\mathcal{T}_1$) into a complex tree structure.

• Generalization: They generalize the "colored trees" used in previous works (Hyttinen-Kulikov-Moreno) to handle $\kappa$ colors instead of just 2.
• Construction: They define a specific class of trees $K_{\lambda \cdot \lambda}^{tr}$ (where $\lambda = \omega$ or $\omega_1$ depending on the theory type).
• Filtration and Stationary Sets: The trees are constructed using filtrations and stationary sets $S \subseteq \kappa$. The coloring of the tree nodes depends on the input function $f$ and stationary sets derived from it (specifically $S_f^\sigma$).
• Key Property: The isomorphism type of the constructed tree $T_f$ is determined by the equivalence class of $f$ modulo a stationary set ($f =_{S_0}^\kappa g$).

C. Ehrenfeucht-Mostowski (EM) Models

To link the trees to the target theory $\mathcal{T}_2$ (which is non-classifiable), the authors construct Ehrenfeucht-Mostowski models.

• Skeleton: The tree $T_f$ serves as the "skeleton" (index model) for the EM model $\mathcal{M}_f$.
• Indiscernibles: The elements of the model are generated by Skolem terms applied to a set of indiscernibles indexed by the tree $T_f$.
• Isomorphism Characterization: The authors prove that for unstable or superstable non-classifiable theories, the isomorphism of the resulting models $\mathcal{M}_f \cong \mathcal{M}_g$ is equivalent to the equivalence of the underlying trees $T_f \cong T_g$, which in turn is equivalent to the equivalence of the input functions $f =_{S_0}^\kappa g$.

3. Key Contributions

1. Continuous Reduction for Inaccessible Cardinals: The paper provides the first proof that the Main Gap holds with continuous reducibility ($\leq_c$) for strongly inaccessible cardinals $\kappa$, extending previous results that were limited to successor cardinals or specific subclasses of theories.
2. The Fodor Space Framework: The authors introduce and rigorously utilize the Fodor space of eventually regressive functions as the domain for reductions involving theories with few models. This resolves the issue of why previous Borel reductions were not continuous in this specific context.
3. Generalized Tree Construction: They develop a sophisticated construction of ordered colored trees with $\kappa$ colors. This allows for the encoding of more complex information than the binary trees used in the successor cardinal case, necessary for handling the structure of inaccessible cardinals.
4. Refined EM Model Analysis: The paper adapts the construction of EM models to work with these specific trees and the Fodor space, proving that the isomorphism of the models faithfully reflects the stationary equivalence of the input functions.

4. Main Results

Theorem A (Main Theorem):
Let $\kappa$ be a strongly inaccessible cardinal. If $\mathcal{T}_1$ is a theory with fewer than $\kappa$ non-isomorphic models of size $\kappa$, and $\mathcal{T}_2$ is an unstable theory or a superstable non-classifiable theory, then:
$$\cong_{\mathcal{T}_1} \leq_c \cong_{\mathcal{T}_2}$$

Supporting Propositions:

• Proposition 2.2: For a classifiable theory $\mathcal{T}$ with $<\kappa$ models, the isomorphism relation $\cong_{\mathcal{T}}$ is continuously reducible to the equivalence relation $=_{S}^\kappa$ restricted to the Fodor space.
• Lemma 5.1: There exists a continuous function $\mathcal{F}$ from the Fodor space to the space of models of $\mathcal{T}_2$ such that $\mathcal{F}(f) \cong \mathcal{F}(g)$ if and only if $f =_{S_0}^\kappa g$.
• Proposition 5.3: The isomorphism of the constructed trees $T_f \cong T_g$ is equivalent to the stationary equivalence $f =_{S_0}^\kappa g$.

5. Significance

• Completing the Generalized Main Gap: This work significantly advances the understanding of the complexity hierarchy of isomorphism relations in generalized descriptive set theory. It confirms that the "gap" between classifiable and non-classifiable theories is robust even at the level of inaccessible cardinals and under the stronger condition of continuous reducibility.
• Topological Nuance: By distinguishing between Borel and continuous reducibility, the paper highlights the importance of the underlying topology (specifically the Fodor space) in the classification of models. It demonstrates that "few models" implies a specific topological simplicity that can be continuously mapped into the complexity of non-classifiable theories.
• Methodological Innovation: The combination of Fodor spaces, generalized colored trees, and EM models provides a new toolkit for researchers in GDST. The techniques for handling stationary sets and regressive functions in the context of model isomorphism are likely to be applicable to other problems in the classification of equivalence relations on $\kappa^\kappa$.

In summary, Feldman and Moreno successfully bridge the gap between the structural properties of classifiable theories with few models and the complexity of non-classifiable theories in the setting of inaccessible cardinals, using a novel topological approach centered on the Fodor space.