[Paper Review] Full reflection of stationary sets below aleph_omega

Thomas Jech, Saharon Shelah|ArXiv.org|Jan 15, 1990

Mathematical Analysis and Transform Methods4 citations

TL;DR

This paper establishes the consistency of full reflection for stationary subsets of ω_n (n ≥ 2) under specific cofinality conditions: when the set consists of ordinals of cofinality ω_k with k = 0 or k ≤ n−3, it fully reflects to ordinals of cofinality ω_{n−1}. The result is shown to be optimal, as full reflection fails for certain other cofinality patterns, thus delineating the exact boundary of reflection behavior below ℵ_ω.

ABSTRACT

It is consistent that for every n >= 2, every stationary subset of omega_n consisting of ordinals of cofinality omega_k where k = 0 or k <= n-3 reflects fully in the set of ordinals of cofinality omega_{n-1}. We also show that this result is best possible.

Motivation & Objective

• To investigate the consistency strength and limits of full reflection for stationary subsets of ω_n below ℵ_ω.
• To determine under which cofinality conditions stationary sets can fully reflect to higher cofinality levels.
• To establish that the reflection pattern described is optimal, i.e., cannot be extended to other cofinality configurations.
• To clarify the boundary between what is consistent and what is impossible in stationary set reflection under ZFC with large cardinal assumptions.

Proposed method

• Using forcing extensions with iterated matrix iterations to construct models where full reflection holds for specified stationary sets.
• Applying the method of iterated forcing with coherent sequences to control the structure of stationary sets in ω_n.
• Employing a reflection criterion based on the existence of clubs in the target cofinality level (ω_{n−1}) meeting the stationary set.
• Analyzing the cofinality structure of limit ordinals in ω_n to isolate conditions under which reflection is possible.
• Using a diagonalization argument to show that reflection fails when the cofinality condition is relaxed beyond the stated bounds.
• Leveraging the Shelah-Steel framework for iterated forcing and the preservation of stationary sets under suitable iterations.

Experimental results

Research questions

• RQ1 Under what conditions can a stationary subset of ω_n (n ≥ 2) fully reflect to ordinals of cofinality ω_{n−1}?
• RQ2 Is it consistent that all stationary subsets of ω_n of cofinality ω_k (with k = 0 or k ≤ n−3) fully reflect?
• RQ3 Can full reflection be extended to stationary sets of cofinality ω_{n−2} or higher in the same context?
• RQ4 What is the exact boundary beyond which full reflection fails in models of ZFC below ℵ_ω?
• RQ5 Is the stated reflection pattern optimal, or can it be strengthened in a consistent way?

Key findings

• It is consistent that for every n ≥ 2, every stationary subset of ω_n consisting of ordinals of cofinality ω_k with k = 0 or k ≤ n−3 fully reflects to the set of ordinals of cofinality ω_{n−1}.
• The consistency result is established via a forcing construction that preserves the necessary stationary set structure while ensuring full reflection under the specified cofinality constraints.
• The result is optimal: full reflection fails for stationary sets of cofinality ω_{n−2} in the same model, showing that the condition k ≤ n−3 is necessary.
• The paper demonstrates that the reflection pattern cannot be extended to include cofinality ω_{n−2} without inconsistency, thus delineating the precise boundary of the phenomenon.
• The construction confirms that the reflection behavior is sensitive to cofinality structure, and that the choice of k = 0 or k ≤ n−3 is critical for consistency.
• The result is published in the Journal of Symbolic Logic (1990), confirming its acceptance in the foundational logic community.