Ryan–Smith Localization in Set Theory
- Ryan–Smith Localization is a set-theoretic framework equating the global Partition Principle with its local restriction combined with the Axiom of Choice for well-ordered families.
- The framework leverages the SVC⁺ hypothesis to enable injections into T×η, systematically decomposing surjections within symmetric models.
- It underpins independence results by constructing models where the Partition Principle holds without the full Axiom of Choice, resolving longstanding open problems in choice theory.
Ryan–Smith localization is a framework in set theory that establishes equivalences between global and local forms of the Partition Principle (PP) and restricted variants of the Axiom of Choice, under certain "small-choice" hypotheses. It underpins constructive separations of from in symmetric models, solving longstanding open questions in the theory of choice principles.
1. Fundamental Definitions
The Partition Principle (PP) states: for every surjection , there exists an injection . In terms of cardinal arithmetic, this asserts whenever . Local restriction of PP to a set (written or ) means the surjection-to-injection property is asserted only for surjections where both domain and codomain are subsets of . The Axiom of Choice restricted to well-ordered index sets, denoted , asserts that every surjection (with an ordinal) admits a right inverse , equivalently, every well-ordered family of nonempty sets has a choice function.
"Small Violations of Choice" (SVC) for a parameter set holds when every set is a surjective image of for some ordinal ; formally, . The strengthening replaces "surjective image" with "injective image": . A standard consequence due to Ryan–Smith is that when , with a set of sequences of Cohen reals in the cited constructions (Gilson, 5 Jan 2026).
2. The Ryan–Smith Localization Theorem
The Ryan–Smith Localization Theorem asserts: Assume . In ZF,
That is, under the small-choice hypothesis for parameter , the global Partition Principle is equivalent to its local restriction to together with the Axiom of Choice for well-ordered families. This equivalence is a central technical tool for separating choice principles at the level of symmetric extensions and iterated forcing.
A summary of key relationships is presented in the following table:
| Principle | Domain | Content |
|---|---|---|
| All sets | Surjections split via injections | |
| As above, restricted to | ||
| Ordinals/indexed families | Choice on well-ordered families | |
| All sets | Each set injects into for some |
3. Outline of the Equivalence Proof
The proof, as presented in (Gilson, 5 Jan 2026) and originally established in Proposition 3.17 of C. Ryan-Smith ("Local reflections of choice", Acta Math. Hung. 2025), proceeds as follows:
- Direction: Global trivially entails the local restriction . The assertion follows since any surjection (with an ordinal) is a special case of .
- Direction: Assume , , and . Let be arbitrary. By , there exist and . For each , let , , giving surjections . By , each splits via . As is well-ordered, assembles the into a global injection with , establishing .
4. Applications in Symmetric Models and Independence Results
Ryan–Smith localization facilitates independence proofs regarding the relative strength of set-theoretic choice principles. In (Gilson, 5 Jan 2026), the theorem is leveraged to construct a transitive model satisfying via class-length countable-support symmetric iterations from a Cohen symmetric seed. In such models:
- holds for (where is the Cohen-reals set),
- and hold for ,
- Yet is forced, as is not well-orderable.
The implication and the localization theorem then yield . Therefore, these constructions formally establish that does not imply .
5. Infrastructure for Symmetric Iterations and Preservation Properties
The construction of relevant symmetric models involves:
- Countable-support symmetric iterations,
- Successor stages forcing with "orbit-symmetrized packages" (to split surjections within ) and (to split surjections onto ordinals ),
- Diagonal-cancellation/diagonal-lift infrastructures supplying -complete normal filters at limit stages,
- Ensuring generic sections are hereditarily symmetric and preservation of via normality and -completeness.
This infrastructure is critical for maintaining fine control over the properties of the constructed model at each stage and for preserving the delicate balance required to force without .
6. Historical and Technical Significance
Ryan–Smith localization addresses a problem posed by Russell in 1906 concerning the equivalence of and and clarifies which fragments of choice are necessary for in certain models. The framework enables local-to-global reductions, crucial for advancing set theory without choice and constructing intermediate models between and . The results are summarized and expanded upon in Gilson (Gilson, 5 Jan 2026), §4.2 ("Reduction blueprint") and Theorem 4.4, with full details in Ryan-Smith ("Local reflections of choice", Acta Math. Hung. 2025).