[논문 리뷰] Towards a theory of symmetric extensions

Asaf Karagila, Jonathan Schilhan|arXiv (Cornell University)|2026. 02. 19.

Advanced Topology and Set Theory인용 수 0

한 줄 요약

이 논문은 대칭 확장에 대한 포섭 이론을 포함하도록 강제 이론을 반복, 몫, 축소된 곱까지 확장하는 포괄적 프레임워크를 개발하고, 대칭 확장에서의 Kinna–Wagner 원리 및 모든 집합이 HOD의 대칭 확장의 안에 놓인다는 것과 같은 핵심 결과를 입증한다.

ABSTRACT

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique remained fairly limited compared to the theory of forcing. Whereas forcing developed products and iterations, no serious attempts at developing any general framework for iterating symmetric extensions were presented before [10], where only finite support iterations are treated. In this paper we develop the theory of symmetric extensions including different types of iterations, quotients, equivalents, and the structural results that can be described in this language. In particular, we give a modern exposition to some of the important theorems of Grigorieff [3], study Kinna--Wagner Principles in symmetric extensions, and show that it is provable from $\mathsf{ZF}$ that every set lies in a symmetric extension of $\operatorname{HOD}$.

연구 동기 및 목표

• Introduce a streamlined, modern framework for symmetric extensions parallel to forcing.
• Develop iteration theory for symmetric extensions including two-step, ideal-support, and product/quotient constructions.
• Establish foundational results such as factorization, completeness, and equivalence within symmetric systems.
• Apply the framework to analyze Kinna–Wagner Principles in symmetric extensions.
• Show that from ZF, every set lies in a symmetric extension of HOD.

제안 방법

• Define symmetric systems (P, G, F) with a normal filter F of subgroups of a group G of automorphisms of P.
• Introduce S-symmetric names and hereditarily S-symmetric names, closed names, and the forcing relation _S_fair (V[G]_{S}).
• Develop two-step iterations S0 * dot{S}1 and prove the Factorization Theorem (G is S-generic over V, G0 and G1 behave as expected).
• Extend to ideal-support iterations, including general pre-iterations and conditions ensuring intermediate models reflect the intended symmetry behavior.
• Present methods for quotients, products, completed systems, and seeds to build complex symmetric extensions.
• Demonstrate that symmetric extensions lie inside a robust, iterative framework analogous to forcing, enabling structural theorems and applications.

실험 결과

연구 질문

• RQ1 How can forcing-like iteration techniques be extended to symmetric extensions while preserving ZF?
• RQ2 What are the appropriate definitions and properties of symmetric systems, symmetric names, and S-genericity to support complex iterations?
• RQ3 How do two-step and ideal-support iterations behave in the symmetric setting, and can we factorize generics similarly to forcing?
• RQ4 What structural results (e.g., Grigorieff-type theorems, seeds, completions, quotients) can be established within a unified symmetric-extension framework?
• RQ5 Do Kinna–Wagner Principles hold in symmetric extensions, and can we show that every set lies in a symmetric extension of HOD?

주요 결과

• A unified framework for symmetric extensions is developed, including different types of iterations, quotients, equivalents, and structural results.
• A Factorization Theorem for two-step symmetric iterations is established, showing how generics relate across stages.
• Closed names and a seed/complete-system framework are introduced to standardize constructions and optimize reuse of symmetry arguments.
• It is shown that starting from a model of ZFC, every symmetric extension has an associated cardinal κ such that KWP*_{κ^+} holds in the extension.
• The framework yields the result that every set lies in a symmetric extension of HOD (ZF proves this).
• The paper connects symmetric extension theory to Grigorieff’s results and generalizes their applicability through a modern, accessible language.