(Mathematical Surveys and Monographs 248) Paul B. Larson, Jindřich Zapletal - Geomet

Mathematical
Surveys
and
Monographs
Volume 248
Geometric
Set Theory
Paul B. Larson
Jindřich Zapletal
Geometric
Set Theory
Mathematical
Surveys
and
Monographs
Volume 248
Geometric
Set Theory
Paul B. Larson
Jindřich Zapletal
EDITORIAL COMMITTEE
Robert Guralnick, Chair Natasa Sesum
Bryna Kra Constantin Teleman
Melanie Matchett Wood
2010 Mathematics Subject Classification. Primary 03E15, 03E25,

03E35, 03E40, 05C15, 05B35, 11J72, 11J81, 37A20.
For additional information and updates on this book, visit

www.ams.org/bookpages/surv-248
Library of Congress Cataloging-in-Publication Data

Names: Larson, Paul B. (Paul Bradley), 1970– author. | Zapletal, Jindřich, 1969– author.
Title: Geometric set theory / Paul B. Larson, Jindrich Zapletal.
Description: Providence, Rhode Island: American Mathematical Society, [2020] | Series: Mathe-
matical surveys and monographs, 0076-5376; volume 248 | Includes bibliographical references
and index.
Identifiers: LCCN 2020009795 | ISBN 9781470454623 (softcover) | ISBN 9781470460181 (ebook)
Subjects: LCSH: Descriptive set theory. | Equivalence relations (Set theory) | Borel sets. |
Independence (Mathematics) | Axiomatic set theory. | Forcing (Model theory) | AMS: Mathe-
matical logic and foundations – Set theory – Descriptive set theory. | Mathematical logic and
foundations – Set theory – Axiom of choice and related propositions. | Mathematical logic
and foundations – Set theory – Consistency and independence results. | Mathematical logic
and foundations – Set theory – Other aspects of forcing and Boolean-valued models. | Com-
binatorics – Graph theory – Coloring of graphs and hypergraphs. | Combinatorics – Designs
and configurations – Matroids, geometric lattices. | Number theory – Diophantine approxima-
tion, transcendental number theory– Irrationality; linear independence over a field. | Number
theory – Diophantine approximation, transcendental number theory – Transcendence (gen-
eral theory). | Dynamical systems and ergodic theory – Ergodic theory – Orbit equivalence,
cocycles, ergodic equivalence relations.
Classification: LCC QA248 .L265 2020 | DDC 511.3/22–dc23
LC record available at https://lccn.loc.gov/2020009795
Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting
for them, are permitted to make fair use of the material, such as to copy select pages for use
in teaching or research. Permission is granted to quote brief passages from this publication in
reviews, provided the customary acknowledgment of the source is given.
Republication, systematic copying, or multiple reproduction of any material in this publication
is permitted only under license from the American Mathematical Society. Requests for permission
to reuse portions of AMS publication content are handled by the Copyright Clearance Center. For
more information, please visit www.ams.org/publications/pubpermissions.
Send requests for translation rights and licensed reprints to [email protected].

c 2020 by the authors. All rights reserved.
Printed in the United States of America.

∞ The paper used in this book is acid-free and falls within the guidelines
established to ensure permanence and durability.
Visit the AMS home page at https://www.ams.org/
10 9 8 7 6 5 4 3 2 1 25 24 23 22 21 20
Contents
Preface ix
Chapter 1. Introduction 1
1.1. Outline of the subject 1
1.2. Equivalence relation results 2
1.3. Independence: by topic 5
1.4. Independence: by model 10
1.5. Independence: by preservation theorem 12
1.6. Navigation 15
1.7. Notation and terminology 25
Part I. Equivalence relations 33
Chapter 2. The virtual realm 35

2.1. Virtual equivalence classes 35
2.2. Virtual structures 37
2.3. Classification: general theorems 39
2.4. Classification: specific examples 41
2.5. Cardinal invariants 45
2.6. Restrictions on partial orders 58
2.7. Absoluteness 61
2.8. Dichotomies 64
Chapter 3. Turbulence 73
3.1. Independent functions 73
3.2. Examples and operations 75
3.3. Placid equivalence relations 78
3.4. Examples and operations 79
3.5. Absoluteness 83
3.6. A variation for measure 86
Chapter 4. Nested sequences of models 93

4.1. Prologue 93
4.2. Coherent sequences of models 93
4.3. Choice-coherent sequences of models 96
v
vi CONTENTS
Part II. Balanced extensions of the Solovay model 103
Chapter 5. Balanced Suslin forcing 105

5.1. Virtual conditions 105
5.2. Balanced virtual conditions 108
5.3. Weakly balanced Suslin forcing 114
Chapter 6. Simplicial complex forcings 117

6.1. Basic concepts 117
6.2. Fragmented complexes 117
6.3. Matroids 124
6.4. Quotient variations 128
Chapter 7. Ultrafilter forcings 135

7.1. A Ramsey ultrafilter 135
7.2. Fubini powers of the Fréchet ideal 136
7.3. Ramsey sequences of structures 138
7.4. Semigroup ultrafilters 141
Chapter 8. Other forcings 145

8.1. Coloring graphs 145
8.2. Coloring hypergraphs 148
8.3. Discontinuous homomorphisms 157
8.4. Automorphisms of 𝒫(𝜔) modulo finite 159
8.5. Kurepa families 160
8.6. Set mappings 162
8.7. Saturated models on quotient spaces 165
8.8. Non-DC variations 169
8.9. Side condition forcings 170
8.10. Weakly balanced variations 173
Chapter 9. Preserving cardinalities 179

9.1. The well-ordered divide 179
9.2. The smooth divide 182
9.3. The turbulent divide 188
9.4. The orbit divide 193
9.5. The 𝔼𝐾𝜍 divide 205
9.6. The pinned divide 211
Chapter 10. Uniformization 213

10.1. Tethered Suslin forcing 213
10.2. Uniformization theorems 214
10.3. Examples 221
Chapter 11. Locally countable structures 227

11.1. Central objects and notions 227
11.2. Definable control 233
11.3. Centered control 237
11.4. Linked control 244
CONTENTS vii
11.5. Measured control 250

11.6. Ramsey control 254
11.7. Liminf control 258
11.8. Compactly balanced posets 262
Chapter 12. The Silver divide 269

12.1. Perfectly balanced forcing 269
12.2. Bernstein balanced forcing 274
12.3. 𝑛-Bernstein balanced forcing 285
12.4. Existence of generic filters 292
Chapter 13. The arity divide 299

13.1. 𝑚, 𝑛-centered and balanced forcings 299
13.2. Preservation theorems 300
13.3. Examples 307
Chapter 14. Other combinatorics 313

14.1. Maximal almost disjoint families 313
14.2. Unbounded linear suborders 314
14.3. Measure and category 315
14.4. The Ramsey ultrafilter extension 318
Bibliography 323
Index 329
Preface
We wish to present to the reader a fresh and exciting new area of mathematics:
geometric set theory. The purpose of this research direction is to compare transitive
models of set theory with respect to their extensional agreement and definability. It
turns out that many fracture lines in descriptive set theory, analysis, and model theory
can be efficiently isolated and treated from this point of view. A particular success is
the comparison of various Σ21 consequences of the Axiom of Choice in unparalleled
detail and depth.
The subject matter of the book was rather slow in coming. The initial work, restat-
ing Hjorth’s turbulence in geometric terms and isolating the notion of a virtual quotient
space of an analytic equivalence relation, existed in rudimentary versions since about
2013 in unpublished manuscripts of the second author. The joint effort [74] contained
some independence results in choiceless set theory similar to those of the present book,
but in a decidedly suboptimal framework. It was not until the January 2018 discovery
of balanced Suslin forcing that the flexibility and power of the geometric method fully
asserted itself. The period after that discovery was filled with intense wonder—passing
from one configuration of models of set theory to another and testing how they sepa-
rate various well-known concepts in descriptive set theory, analysis, and model theory.
At the time of writing, geometric set theory seems to be an area wide open for innu-
merable applications.
The authors benefited from discussion with a number of mathematicians, includ-
ing, but not limited to, David Chodounský, James Freitag, Michael Hrušák, Anush
Tserunyan, Douglas Ulrich, and Lou van den Dries. The second author wishes to ex-
tend particular thanks to the Bernoulli Center at EPFL Lausanne, where a significant
part of the results was obtained during the special semester on descriptive set theory
and Polish groups in 2018.
During the work on the book, the first author was supported by grants NSF DMS
1201494 and DMS-1764320. The second author was supported by NSF grant DMS
1161078.
ix
CHAPTER 1
Introduction
1.1. Outline of the subject

Geometric set theory is the research direction which studies transitive models of
set theory with respect to their extensional agreement. It turns out that numerous ex-
isting concepts in descriptive set theory and analysis have intuitive and informative
geometric restatements, and the geometric point of view makes it possible to readily
isolate many new concepts and generalize old ones. Surprising parallels appear be-
tween areas that to date did not have a discernible interface.
The oldest part of the subject deals with Borel equivalence relations on Polish
spaces. Here, given an equivalence 𝐸 on a space 𝑋 and a configuration {𝑀𝑖 ∶ 𝑖 ∈ 𝐼}
of transitive models of set theory, one asks whether it is possible for an 𝐸-equivalence
class to have representatives in some models of the configuration and fail to be rep-
resented in others. The answer to this question greatly varies with the nature of the
equivalence relation and the configuration in question, and the resulting differences
can be used with great effect to prove non-reducibility and ergodicity theorems for var-
ious Borel equivalence relations. One notable success in this area is a reformulation
of Hjorth’s turbulence in geometric terms, which is much more practicable than the
original definition and allows endless generalizations and variations entirely divorced
from the original context of Polish group actions.
Geometric set theory really started to blossom after it was applied in a seemingly
entirely different direction: the independence results in choiceless Zermelo–Fraenkel
(ZF) set theory. This is an area which saw a surge of results in early 1970’s after which
the interest in it waned. Both our purpose and methodology are quite different from
the early practitioners though. We study almost exclusively ZF independence results
between Σ21 consequences of the Axiom of Choice which are intimately connected to
various contemporary concerns of descriptive set theory and analysis. A very detailed
structure appears, with some fracture lines running in parallel to existing combina-
torial, algebraic, or analytic concepts and other fracture lines showing up in places
quite unexpected. The main geometric motif is the following. Given a Σ21 sentence
𝜙 = ∃𝐴 ⊂ 𝑋 𝜓(𝐴), a consequence of the Axiom of Choice in which 𝑋 is a Polish space
and 𝜓 is a formula quantifying only over elements of Polish spaces, and given a config-
uration {𝑀𝑖 ∶ 𝑖 ∈ 𝐼} of transitive models of set theory with choice, is there a set 𝐴 ⊂ 𝑋
such that in all (or many) models 𝑀 in the configuration, 𝐴 ∩ 𝑀 ∈ 𝑀 and 𝐴 ∩ 𝑀
is a witness to 𝜙 in the model 𝑀? The answer to this question is surprisingly varied
and successful in separating consequences of the Axiom of Choice of this syntactical
complexity.
1
2 1. INTRODUCTION
The models of ZF we use for the independence results are nearly exclusively of
the same form: they are extensions of the symmetric Solovay model by a simply de-
finable 𝜎-closed forcing. As a result, they are all models of DC, the Axiom of Depen-
dent Choices. DC is instrumental for developing the basic concepts of mathematical
analysis, thus highly desirable; at the same time, it is an axiom which is difficult to
obtain in the symmetric models of 1970’s. If suitable large cardinals are present, essen-
tially identical effects can be obtained in generic extensions of the model 𝐿(ℝ) which
have a very strong claim to canonicity. In addition, given Σ21 sentences 𝜙0 , 𝜙1 , there
is usually a quite canonical choice for a forcing which should generate a model of
ZF+DC+¬𝜙0 +𝜙1 . The whole analysis of the forcing in question takes place in ZFC,
using central concepts of the fields related to the Σ21 sentences in question.
We conclude this brief outline of the area with the observation that the mass of
natural questions that either seem to be treatable using the geometric method, or are
generated by the inner workings of the geometric method, is entirely overwhelming.
This book cannot be more than a relatively brief introduction to the subject. In many di-
rections, our efforts faded due to sheer exhaustion and not because of insurmountable
obstacles. We hope to motivate the reader to explore the enormous, inviting expanses
of geometric set theory.
1.2. Equivalence relation results

The first group of results deals with the simplest geometric concern. If 𝐸 is an
analytic equivalence relation on a Polish space, and 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic
extensions of 𝑉, is it possible to find an 𝐸-class which is represented in both 𝑉[𝐻0 ] and
𝑉[𝐻1 ] but not in 𝑉? Kanovei [54, Chapter 17], continuing the seminal work of Hjorth,
defined an analytic equivalence 𝐸 to be pinned just in case the answer is negative.
In Chapter 2, we develop the notion of the virtual quotient space for a given an-
alytic equivalence relation on a Polish space. A virtual 𝐸-class is one which is repre-
sented in some mutually generic extensions of 𝑉; from a different angle, it is a class
which may be represented only in some generic extension, but it does not depend on
the choice of the generic filter. A formal definition uses the notion of an 𝐸-pin and an
equivalence on the class of 𝐸-pins, which naturally extends the analytic equivalence re-
lation 𝐸 into the transfinite domain–Definitions 2.1.1 and 2.1.4. The virtual 𝐸-quotient
space is then the class of all 𝐸-pins up to their equivalence. Every Borel structure on
the 𝐸-quotient space has a natural virtual version on the virtual 𝐸-quotient space. Vir-
tual structures appear in many places in this book. The main theorem governing their
behavior:
Theorem 1.2.1. (Proposition 2.2.5) Let 𝐸 be a Borel equivalence relation on a Polish

space 𝑋. Let ℳ be a Borel structure on the 𝐸-quotient space 𝑋/𝐸. The natural map from
the 𝐸-quotient space to the virtual 𝐸-quotient space is a Π1 -elementary embedding from
ℳ to its virtual version.
To size up the virtual 𝐸-quotient space, in Definition 2.5.1 we isolate cardinal invariants
𝜅(𝐸) and 𝜆(𝐸) of an equivalence relation 𝐸: 𝜆(𝐸) is the cardinality of the virtual space,
while 𝜅(𝐸) is its forcing-theoretic complexity. The cardinals 𝜅(𝐸), 𝜆(𝐸) respect the Borel
reducibility order of equivalence relations, and as such serve as valuable tools for non-
reducibility results. Their key feature: for Borel equivalence relations 𝐸, these cardinals
1.2. EQUIVALENCE RELATION RESULTS 3
are well-defined and obey an explicit upper bound. In particular, the virtual 𝐸-quotient
space is a set, as opposed to a proper class as occurs for some analytic equivalence
relations.
Theorem 1.2.2. (Theorem 2.5.6) Let 𝐸 be a Borel equivalence relation on a Polish
space 𝑋. Then 𝜅(𝐸), 𝜆(𝐸) < ℶ𝜔1 .
As a result, the well-known Friedman–Stanley theorem [36] on nonreducibility of a
jump 𝐸 + of a Borel equivalence relation 𝐸 to 𝐸 is immediately translated to the Can-
tor theorem on the cardinality of the powerset: 𝜆(𝐸 + ) = 2𝜆(𝐸) > 𝜆(𝐸)–Example 2.5.5.
Other similar conceptual and brief nonreducibility results appear as well. The cardinal
invariants 𝜅(𝐸) and 𝜆(𝐸) can attain many exotic and informative values, and inequal-
ities between them can be manipulated by forcing. Most of Section 2.5 is devoted to
examples of such manipulation. However, the main underlying concept is absolute,
which justifies the parlance used throughout the book:
Theorem 1.2.3. (Corollary 2.7.3) Let 𝐸 be a Borel equivalence relation on a Polish
space 𝑋. The statement “𝐸 is pinned” is absolute among all generic extensions.
We stress that the above result holds within the context of ZFC. If one drops the Axiom
of Choice but holds on to Dependent Choices, the class of Borel unpinned equivalence
relations will shrink; in the symmetric Solovay model, it shrinks to the minimal pos-
sible extent: only the canonical unpinned relation 𝔽2 and the equivalence relations
above it in the reducibility order are unpinned, see below. If one drops even the Ax-
iom of Dependent Choices, the class of Borel unpinned equivalence relations becomes
more erratic. We conjecture that it may expand to its largest possible extent: to the
class of equivalence relations which are not reducible to 𝐹𝜍 equivalence relations.
As is usual in the realm of equivalence relations, we aim to prove various dichoto-
mies.
Theorem 1.2.4. (Theorem 2.8.9) Suppose that there is a measurable cardinal. Let
𝐸 be an analytic equivalence relation on a Polish space 𝑋. Exactly one of the following
occurs:
(1) 𝜅(𝐸), 𝜆(𝐸) < ∞;
(2) 𝔼𝜔1 is almost Borel reducible to 𝐸.
Theorem 1.2.5. (Corollary 2.8.13) In the symmetric Solovay model: let 𝐸 be a Borel
equivalence relation on a Polish space 𝑋. Exactly one of the following occurs:
(1) 𝐸 is pinned;
(2) 𝔽2 is Borel reducible to 𝐸.
In Chapter 3, we deal with a more sophisticated geometric concern. Let 𝐸 be an an-
alytic equivalence relation on a Polish space 𝑋. Is it possible to find two generic exten-
sions 𝑉[𝐻0 ] and 𝑉[𝐻1 ] of 𝑉 such that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 in which there is an 𝐸-class
represented in both extensions 𝑉[𝐻0 ] and 𝑉[𝐻1 ], but not in 𝑉? Note that we do not
ask the extensions to be mutually generic. In an initial approach, we develop a fruitful
method for constructing separately Cohen-generic extensions 𝑉[𝐻0 ] and 𝑉[𝐻1 ] such
that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉. We define (Definition 3.1.3) a practical and easily checked
notion of independence of continuous open maps between Polish spaces using a notion
of a walk reminiscent of Hjorth’s method of turbulence [54, Section 13.1] and prove the
following.
4 1. INTRODUCTION
Theorem 1.2.6. (Theorem 3.1.4) Let 𝑋 be a Polish space and 𝑓0 ∶ 𝑋 → 𝑌0 and

𝑓1 ∶ 𝑋 → 𝑌1 be continuous open maps to Polish spaces. The following are equivalent:
(1) the maps 𝑓0 , 𝑓1 are independent;
(2) the Cohen forcing 𝑃𝑋 of nonempty open subsets of 𝑋 forces 𝑉[𝑓0 (𝑥𝑔𝑒𝑛 ̇ )] ∩
𝑉[𝑓1 (𝑥𝑔𝑒𝑛
̇ )] = 𝑉.
As one of the corollaries, we obtain a characterization of Hjorth’s turbulence in geo-
metric terms. This characterization is much more practical than the original statement
for anyone familiar with the forcing relation.
Theorem 1.2.7. (Theorem 3.2.2) Let Γ be a Polish group acting on a Polish space 𝑋
with all orbits meager and dense. The following are equivalent:
(1) the action is generically turbulent;
(2) 𝑉[𝑥] ∩ 𝑉[𝛾 ⋅ 𝑥] = 𝑉 whenever 𝛾 ∈ Γ and 𝑥 ∈ 𝑋 are mutually generic points.
To support a broad extension of ergodicity results due to Hjorth and Kechris [59, The-
orem 12.5], we develop the classes of placid and virtually placid equivalence relations
(the latter including all equivalence relations classifiable by countable structures) and
prove:
Theorem 1.2.8. (Theorem 3.3.5) Let 𝐸 be the orbit equivalence relation on a Polish
space 𝑋 resulting from a turbulent Polish group action. Let 𝐹 be an analytic, virtually
placid equivalence relation on a Polish space 𝑌 and let ℎ ∶ 𝑋 → 𝑌 be a Borel homomor-
phism of 𝐸 to 𝐹. Then there is an 𝐹-class whose ℎ-preimage is comeager in 𝑋.
It turns out that there is a version of turbulence for measure which leads to many of
the same ergodicity results. It uses the notion of concentration of measure quite close
to the abstract whirly actions on measure algebras isolated in [38].
Theorem 1.2.9. (Theorem 3.6.2) Let Γ be a Polish group continuously acting on a
Polish space 𝑋 with an invariant Borel probability measure and an invariant ultrametric.
Suppose that the action has concentration of measure. Then 𝑉[𝑥] ∩ 𝑉[𝛾 ⋅ 𝑥] whenever
𝑥 ∈ 𝑋 is a random point and 𝛾 ∈ Γ is a generic point mutually generic with 𝑥.
As usual with the forcing reconceptualizations of various notions in descriptive set
theory, we have to show that the resulting notions are suitably absolute and evaluate
their complexity–Theorem 3.5.6.
Chapter 4 addresses infinite configurations of transitive models of ZFC. The most
important case is in which there is an infinite inclusion-descending sequence ⟨𝑀𝑛 ∶ 𝑛
∈ 𝜔⟩ of models. Under suitable, commonly satisfied coherence assumptions (Defini-
tion 4.2.1 or 4.3.1), the intersection ⋂𝑛 𝑀𝑛 is a model of ZF or even ZFC. We spend
some time developing a flexible technology of constructing nontrivial coherent se-
quences as in Theorem 4.3.5. The breakthough achieved in this chapter is the theorem
showing that similar configurations detect the distinction between equivalence rela-
tions induced as orbit equivalences of continuous actions of Polish groups, and those
which are not reducible to orbit equivalence relations:
Theorem 1.2.10. (Theorem 4.3.6) Let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a choice-coherent sequence
of models of ZFC. Let 𝐸 be an orbit equivalence relation of a continuous Polish group ac-
tion with a code in the intersection model ⋂𝑛 𝑀𝑛 . If a virtual 𝐸-class has a representative
in every model 𝑀𝑛 , then it has a representative in the intersection model ⋂𝑛 𝑀𝑛 .
1.3. INDEPENDENCE: BY TOPIC 5
Recall that the canonical equivalence relation not reducible to an orbit equivalence
relation is 𝔼1 . It is not difficult to construct a choice-coherent sequence of models
⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ and an 𝔼1 -class which is represented in each model on the sequence but
not in the intersection model ⋂𝑛 𝑀𝑛 –Example 4.3.10.
1.3. Independence: by topic

Our concerns in the part of the book that deals with independence results in
ZF+DC can be grouped into several large areas.
Cardinalities of quotient spaces. Mirroring the traditional concerns of descriptive

set theory, we work on cardinalities of quotient spaces of Borel equivalence relations.
Given Polish spaces 𝑋, 𝑌 and Borel equivalence relations 𝐸, 𝐹 on each, descriptive set
theorists study the question when there can be a Borel function ℎ ∶ 𝑋 → 𝑌 which
reduces 𝐸 to 𝐹. This line of work has been very successful in the last two decades.
In the ZF+DC context, the 𝐸- and 𝐹-quotient spaces can have distinct cardinal-
ities, and the existence of a Borel reduction implies the inequality |𝐸| ≤ |𝐹|, where
we abuse the notation to write |𝐸| for the cardinality of the 𝐸-quotient space. On the
other hand, the nonexistence of a Borel reduction is often connected with the possibil-
ity that ZF+DC cannot prove the cardinal inequality |𝐸| ≤ |𝐹|. A number of our results
deal with the question whether a given Σ21 statement is consistent with ZF+DC plus a
statement of the type |𝐸| ≰ |𝐹| for some benchmark Borel equivalence relations 𝐸, 𝐹
identified in Section 1.7.
The most commonly considered quotient space cardinal inequality is |𝔼0 | > |2𝜔 |
and we spend a great deal of energy proving that various Σ21 statements are consistent
with it.
Theorem 1.3.1. The following statements are separately consistent with ZF plus DC
plus |𝔼0 | > |2𝜔 |:
(1) ([22], Corollary 9.2.5) There is a nonprincipal ultrafilter on 𝜔;
(2) (Corollary 9.2.21) there is a discontinuous homomorphism of ℝ to ℝ/ℤ;
(3) (Corollary 9.2.12) given a Borel equivalence relation 𝐸 on a Polish space, the
𝐸-quotient space can be linearly ordered;
(4) given a pinned Borel equivalence relation 𝐸, |𝐸| ≤ |𝔼0 |;
(5) (Corollary 11.3.12) given a countable Borel equivalence relation 𝐸, 𝐸 is the orbit
equivalence relation of a (discontinuous) action of ℤ.
We give a similar treatment to certain other well-known quotient cardinal inequalities.
For example,
plus |𝔼1 | ≰ |𝐹| for any orbit equivalence relation 𝐹 of a continuous Polish group action:
(1) (Corollary 9.4.8) There is a nonprincipal ultrafilter on 𝜔;
(2) (Corollary 9.4.11) there is a discontinuous homomorphism of ℝ to ℝ/ℤ;
(3) (Corollary 9.4.22) given a Borel graph Γ on a Polish space, Γ contains a maximal
acyclic subgraph;
(4) (Corollary 9.4.10) given a Borel equivalence relation 𝐸 on a Polish space, the
𝐸-quotient space can be linearly ordered;
6 1. INTRODUCTION
(5) (Corollary 9.4.15) given a pinned orbit equivalence relation 𝐸 of a continuous

Polish group action, 𝐸 has a transversal.
plus |𝐸| ≰ |𝐹| for any orbit equivalence relation 𝐸 of a turbulent Polish group action and
an analytic equivalence relation 𝐹 classifiable by countable structures:
(1) (Corollary 9.3.5) Given a Polish vector space 𝑋 over a countable field, 𝑋 has a
basis;
(2) (Corollary 9.3.6) given a Borel graph 𝐺 on a Polish space, 𝐺 contains a maximal
acyclic subgraph;
(3) (Corollary 9.3.9) for any specific pinned equivalence relation 𝐺 classifiable by
countable structures, 𝐺 has a transversal.
There are many interesting open questions left in the area of quotient space cardi-
nalities. Can the cardinalities of countable Borel equivalence relations can be manip-
ulated in the context of ZF+DC? For example, are there countable Borel equivalence
relations 𝐸, 𝐹 such that both inequalities |𝐸| < |𝐹| and |𝐹| < |𝐸| are consistent with
ZF+DC? In ZF+DC, does the existence of a nonprincipal ultrafilter on 𝜔 introduce new
provable inequalities between quotient space cardinalities?
Locally countable structures. One particularly popular subject of descriptive set

theory in the last quarter-century has been the study of countable Borel equivalence
relations and the various structures on their equivalence classes. Using the methods
of this book, one can identify many new fracture lines in this subject; various selection
principles can be meaningfully stratified by the ZF+DC provability of implications be-
tween them. The following is a sampling of the results we obtain.
Theorem 1.3.4. (Corollary 11.4.9) Let 𝐺 be an analytic graph on a Polish space,
with uncountable Borel chromatic number. Given a locally finite bipartite Borel graph 𝐻
satisfying the Marks–Unger condition, it is consistent that ZF+DC holds, 𝐻 has a perfect
matching and the chromatic number of 𝐺 is uncountable.
Theorem 1.3.5. Let 𝐺 be an analytic hypergraph with all hyperedges finite, on a
Polish space 𝑋, with uncountable Borel chromatic number. The following are consistent
with ZF+DC plus the statement that the chromatic number of the hypergraph 𝐺 is un-
countable.
(1) (Corollary 11.3.12) given a countable Borel equivalence relation 𝐸 on a Polish
space with all classes infinite, 𝐸 is the orbit equivalence relation of a (discontin-
uous) action of ℤ;
(2) (Corollary 11.3.9) given a locally finite acyclic Borel graph Γ on a Polish space,
the chromatic number of Γ is ≤ 3;
(3) (Corollary 11.3.15) given a pinned Borel equivalence relation 𝐸 on a Polish
space, |𝐸| ≤ |𝔼0 |.
An important fracture line among Borel locally countable graphs appears at the level
of the diagonal Hamming graph ℍ<𝜔 which is the product of cliques on 2, 3, 4 . . . :
Theorem 1.3.6. The following are consistent with ZF+DC plus the statement that
the chromatic number of ℍ<𝜔 is uncountable.
(1) (Corollary 11.8.8) there is a nonprincipal ultrafilter on 𝜔;

(2) (Corollary 11.8.10) given a locally finite bipartite Borel graph Γ satisfying the
Hall’s marriage condition, Γ has a perfect matching;
(3) (Corollary 11.8.9) given a Borel equivalence relation 𝐸 on a Polish space 𝑋, the
𝐸-quotient space is linearly ordered;
(4) (Corollary 11.5.8) given a pinned Borel equivalence relation 𝐸 on a Polish space,
|𝐸| ≤ |2𝜔 |.
Note that in the case of the last consistency result for the case 𝐸 = 𝔼0 , the countable
uniformization has to fail, as the uncountable chromatic number of ℍ<𝜔 implies among
other things that 𝔼0 has no transversal.
Another fracture line occurs at the level of the Hamming graph ℍ𝜔 on 𝜔𝜔 which is the
product of infinitely many cliques on 𝜔:
Theorem 1.3.7. (Corollary 11.7.9) It is consistent with ZF+DC that the chromatic
number of the diagonal Hamming graph ℍ<𝜔 is countable while the chromatic number
of the Hamming graph ℍ𝜔 on the Baire space is uncountable.
Model theory. Given a pre-geometry on a Polish structure (for example, the pre-
geometry of linear span on a Polish vector space), the axiom of choice yields a maximal
independent set (a basis for the vector space). This broad stroke erases many fine com-
binatorial distinctions between the various pre-geometries. In the choiceless context,
interesting distinctions become visible.
In our context, it is more convenient to work with Borel matroids, a combinato-
rial concept dual to pre-geometries. Matroids from broad classes give rise to balanced
forcings (Theorems 6.3.4 and 6.3.9), providing theorems of the following kind:
Theorem 1.3.8. (Corollary 12.2.13) It is consistent with ZF+DC that there is a tran-
scendence basis for the reals over ℚ and there is no diffuse probability measure on 𝜔.
One traditional fracture line between matroids leads between the modular ones (like
the matroid of linearly independent sets) and the non-modular ones (like the matroid
of algeraically independent sets). We develop an abstract notion of modularity in Def-
inition 6.3.3 and, improving on earlier work of [10, 13], we prove:
Theorem 1.3.9. (Corollary 12.3.14) Let 𝑋 be a Borel vector space over a countable
field Φ. Let 𝑌 be an uncountable Polish field with a countable subfield Ψ. It is consistent
with ZF+DC that there is a Hamel basis for 𝑋 over Φ but no transcendence basis for 𝑌
over Ψ.
Matroid theorists also distinguish between linear matroids (like the matroid of linearly
independent sets) and graphic matroids (the matroids of finite acyclic subsets of a given
graph). This distinction gives rise to the following theorem:
Theorem 1.3.10. Let 𝐺 be a Borel graph on a Polish space 𝑋. It is consistent with
ZF+DC that 𝐺 contains a maximal acyclic subgraph and there is no Hamel basis for any
uncountable Polish vector space over any countable field.
The proof takes an unexpected turn: we prove that in ZF+DC, existence of a Hamel ba-
sis implies that 𝔼1 has a complete countable section, in particular |𝔼1 | ≤ |𝔽2 |–Corollary
8 1. INTRODUCTION
9.4.34. At the same time, existence of a maximal acyclic subgraph of any Borel graph
𝐺 is consistent with ZF+DC+ |𝔼1 | ≰ |𝐸| for any orbit equivalence relation 𝐸–Corollary
9.4.22.
In another direction connecting model theory with choiceless ZF+DC arguments,
we study theories which can have models on the various quotient spaces. In a typical
development, given a Borel equivalence relation 𝐸 on a Polish space 𝑋 and a Fraissé
class ℱ of relational structures with strong amalgamation, we can add a ℱ-structure (a
structure all of whose finite induced substructures are in ℱ) on the 𝐸-quotient space
in a highly controlled way. This results in many theorems of the following kind:
Theorem 1.3.11. (Corollary 13.3.2) Let 𝐸 be a Borel equivalence relation on a Polish
space 𝑋. It is consistent with ZF+DC that there is a tournament on the 𝐸-quotient space
while there is no linear ordering on the 𝔼0 -quotient space.
Combinatorics. A challenging part of set theory deals with chromatic numbers of var-
ious natural Borel graphs and hypergraphs. Among the locally countable graphs and
hypergraphs, in Section 11.1 we define numerous variants of graph characteristics like
the Borel chromatic number and learn to prove associated consistency results. Non-
locally countable graphs require an entirely different approach. For a sample result,
for each number 𝑛 > 0 consider the graph 𝐺𝑛 on ℝ𝑛 connecting points of rational Eu-
clidean distance. The work of Schmerl [92] shows that these graphs (and many similar
algebraic hypergraphs on Euclidean spaces) have countable chromatic number. We
can prove the following:
number of 𝐺1 is countable while the chromatic number of 𝐺2 is uncountable.
number of 𝐺2 is countable while the chromatic number of 𝐺3 is uncountable.
To continue this line of results past dimension 3 requires designing new balanced
posets; we conjecture that this is possible. If the set of distances changes, so does the
logical strength of the assertion that there is a coloring for the associated graph.
Theorem 1.3.14. (Corollary 11.7.11) Let 𝑟 ⃗ be a sequence of positive real numbers
converging to 0. Let 𝐺 be the graph on ℝ2 connecting two points if their Euclidean distance
appears on the sequence 𝑟.⃗ It is consistent with ZF+DC that the chromatic number of 𝐺
is countable, yet there is no 𝔼0 -transversal.
Hypergraphs of arity higher than 2 present enormous challenges. To illustrate the pos-
sibilities, call a coloring 𝑐 ∶ ℝ2 → 𝜔 an equilateral triangle-free decomposition if there
is no equilateral triangle whose vertices are painted the same color; similar terminology
can be adopted for other types of polygons.
Theorem 1.3.15. (Corollary 12.3.15) It is consistent with ZF+DC that the equilat-
eral triangle-free decomposition on ℝ2 exists, yet there is no isosceles triangle-free decom-
position on ℝ2 .
Theorem 1.3.16. (Corollary 11.4.15) It is consistent with ZF+DC that a square-
free decomposition on ℝ2 exists, yet the chromatic number of the Hamming graph ℍ is
uncountable.
Open problems abound. For example, given nonsimilar triangles 𝑇0 , 𝑇1 , is it possible

to find a model of ZF+DC in which there is a coloring of ℝ2 with no monochromatic
triangles similar to 𝑇0 , while in every coloring there is a monochromatic triangle similar
to 𝑇1 ?
Ultrafilters. The methods of the book can separate various types of ultrafilters on 𝜔
and other combinatorial objects in the context of ZF+DC.
Theorem 1.3.17. (Corollary 9.2.5, Proposition 9.2.22 and Corollary 12.2.10) In
ZF+DC, there are no provable implications between the existence of a Hamel basis and
existence of a nonprincipal ultrafilter on natural numbers.
Improving [42], we have
Theorem 1.3.18. (Corollary 14.4.7) In ZF+DC, the existence of a nonprincipal ul-
trafilter on natural numbers does not imply the existence of one which is disjoint from the
summable ideal.
We isolate several ways of adding an ultrafilter to the symmetric Solovay model in a con-
trolled way, providing ultrafilters with various interesting partition properties: Ram-
sey ultrafilters and stable ordered union ultrafilters are just two examples. However,
the comparison of the various models obtained as well as a classification of ultrafil-
ters appearing in each model seems to be beyond our skill. Many other combinations
of implications remain unresolved. For example, we do not know how to construct a
model of ZF+DC in which there is a nonprincipal ultrafilter on 𝜔, |𝔼1 | ≤ |𝔼0 | holds,
yet |𝔼0 | ≰ |2𝜔 |.
Uniformization. Uniformization problems belong to the guiding lights of descriptive

set theory. One of the most notorious versions of it is countable to one uniformiza-
tion, the statement that every subset of the plane with nonempty countable vertical
sections contains the graph of a total function. In Chapter 10, greatly improving the
methods and results of [62], we develop a satisfactory criterion which guarantees that
various strong uniformization principles (including the countable-to-one uniformiza-
tion as the humblest special case) hold in nearly all models under study. Separating the
various uniformization principles seems to be a difficult task beyond the techniques of
the present book.
Limitations of the method. Balanced forcing offers a very flexible and powerful
method for obtaining independence results in ZF+DC set theory. However, certain
desirable types of independence results are outside of its reach. Certain basic limita-
tions are encapsulated in the following theorems.
Theorem 1.3.19. (Corollary 9.1.2) In every balanced extension of the symmetric
Solovay model, there is no 𝜔1 sequence of distinct Borel sets of bounded Borel rank.
Theorem 1.3.20. (Theorem 14.3.1) In every nontrivial balanced extension of the
symmetric Solovay model, there is a set of reals without the Baire property.
Theorem 1.3.21. (Theorem 14.1.1) In every balanced extension of the symmetric
Solovay model, there is no maximal almost disjoint family of subsets of 𝜔.
10 1. INTRODUCTION
Theorem 1.3.22. (Theorem 14.2.1 simplified) In every balanced extension of the

symmetric Solovay model, there is no linearly ordered, unbounded set of elements of 𝜔𝜔
in the modulo finite domination ordering.
Thus, balanced forcing cannot be used to prove for example the consistency with
ZF+DC of the statement that ℵ1 ≤ |𝔼1 | but ℵ1 ≰ |𝔼0 |. For consistency results of this
type, one has to reach to the weakly balanced forcing of Section 5.3. Balanced forcing
also cannot be used to resolve consistency of any statement with the assertion that all
sets of reals have the Baire property. We mention two interesting questions of this type:
consistency of ZF+DC plus the statement that there is a non-Lebesgue measurable set
of reals, every uncountable set of reals contains a perfect subset, and every set of re-
als has the Baire property [94], and consistency ZF+DC that every set of reals has the
Baire property and every countable Borel equivalence relation is an orbit equivalence
relation of a (discontinuous) action of ℤ (Marks–Unger).
1.4. Independence: by model

One appealing way to present the work in this book is to consider several more
or less canonical generic extensions of the Solovay model and list the statements that
we know hold in them. There are also test problems that we do not know how to
resolve. The reader needs to keep in mind that all the models are balanced extensions
of the Solovay model 𝑊 and as such obey the general limitations described at the end
of the previous section. The list below includes only models that we find of immediate
interest for an introduction; there are innumerable other options.
The Ramsey ultrafilter model. Consider the poset of infinite subsets of 𝜔 ordered
by inclusion and the associated extension of the Solovay model 𝑊. The generic filter is
identified with a Ramsey ultrafilter, and well-known pre-existing results [30, 62] show
that in a suitable sense, every Ramsey ultrafilter is generic over 𝑊 for the poset 𝒫(𝜔)
modulo finite. The resulting model was investigated in numerous papers such as [22,
74].
Theorem 1.4.1. In the model 𝑊[𝑈], the following statements hold:

(1) ([22], Corollary 9.2.5) |𝔼0 | ≰ |2𝜔 |;
(2) (Corollary 9.4.8) |𝔼1 | ≰ |𝐹| for any orbit equivalence relation 𝐹;
(3) (Corollary 14.4.7 and Theorem 10.2.9) the 𝔼0 - and 𝔼1 -quotient spaces are lin-
early orderable, while the 𝔼2 - and 𝔽2 -quotient spaces do not carry even any tour-
nament;
(4) (Example 12.1.9) if 𝐸 is a Borel equivalence relation and 𝐴 is a subset of the
𝐸-quotient space then either |𝐴| ≤ ℵ0 or |2𝜔 | ≤ |𝐴|;
(5) (Corollary 14.4.7) every nonprincipal ultrafilter on 𝜔 has nonempty intersection
with the summable ideal;
(6) (Example 10.3.8) countable-to-one uniformization.
One can consider many variations, adding an ultrafilter which is not Ramsey. We study
the cases of a stable ordered union ultrafilter and certain other ultrafilters. It is chal-
lenging to discern between the resulting models by sentences which do not mention
ultrafilters.
1.4. INDEPENDENCE: BY MODEL 11
There are many open questions about the Ramsey ultrafilter model. We do not
know how to classify the ultrafilters on 𝜔 in it. We do not know if there can be Borel
equivalence relations 𝐸, 𝐹 such that |𝐸| ≰ |𝐹| holds in 𝑊 and |𝐸| ≤ |𝐹| holds in 𝑊[𝑈].
In particular, we do not know if this can occur for countable Borel equivalence relations
𝐸, 𝐹 or in the situation where 𝐸 is the orbit equivalence relation of a turbulent action
of a Polish group and an equivalence 𝐹 classifiable by countable structures.
The Hamel basis model. Consider the poset 𝑃 of countable sets of reals which are
linearly independent over the rationals. The generic filter yields a Hamel basis 𝐵 ⊂ ℝ
over the rationals. It does not seem to be easy to provide a simple criterion which
would guarantee that a given Hamel basis is 𝑃-generic over the Solovay model. Still,
we understand the theory of the model 𝑊[𝐵] fairly well:
Theorem 1.4.2. In the model 𝑊[𝐵], the following statements hold:
(1) (Proposition 9.2.22) 𝔼0 has a transversal;

(2) (Corollary 9.4.34) 𝔼1 has a complete countable section;
(3) (Corollary 12.3.14) whenever 𝑋 is an uncountable Polish field and Φ is a count-
able subfield, there is no transcendence basis for 𝑋 over Φ;
(4) (Corollary 12.2.10) there is no diffuse probability measure on 𝜔;
One can consider a different Polish vector space in place of ℝ and add a basis to it; a
natural example is 𝒫(𝜔) viewed with the symmetric difference operation as a vector
space over the binary field. The conclusions of the above theorem remain in force. We
do not know how to discern between the resulting models in general. In particular,
we do not know if an existence of a basis for one Polish vector space over one count-
able field implies the existence of a basis for another Polish vector space over another
countable field in any nontrivial case.
If suitable large cardinals exist, one can find a Hamel basis generic over the model
𝐿(ℝ), independently of the size or structure of the continuum–Example 12.4.5. The
model 𝐿(ℝ)[𝐵] inherits all features quoted in Theorem 1.4.2.
Models with a linear ordering. Let 𝐸 be a Borel equivalence relation on a Polish

space 𝑋. Consider the poset 𝑃 of linear orderings of countable subsets of the 𝐸-quotient
space, ordered by reverse extension. The generic filter yields a linear ordering ≤ on the
𝐸-quotient space. The resulting model is a very humble extension of the symmetric
Solovay model.
Theorem 1.4.3. In the model 𝑊[≤], the following statements hold:
(1) (Corollary 9.2.12) |𝔼0 | > |2𝜔 |;

(2) (Corollary 9.4.10) |𝔼1 | ≰ |𝐹| for any orbit equivalence relation 𝐹;
(3) (Corollary 13.3.15) there are no discontinuous homomorphism between Polish
groups;
(4) (Corollary 12.2.17) OCA holds;
12 1. INTRODUCTION
Other features may depend on the nature of the equivalence relation 𝐸. For example, if
𝐸 is pinned, then in the model 𝑊[≤] one cannot find a linear ordering or even a tourna-
ment on the 𝔽2 -quotient space–Theorem 10.2.9. Many questions remain open. In par-
ticular, it is not clear whether in the model 𝑊[≤] there is a cardinal inequality between
quotient spaces which does not appear already in 𝑊. If suitable large cardinals exist
and 𝐸 is pinned, one can find a linear ordering of the 𝐸-quotient space generic over the
model 𝐿(ℝ), independently of the size or structure of the continuum–Example 12.4.8.
One can add other structures to quotient spaces. In particular, one can add a tour-
nament instead of a linear ordering. In the resulting model, the 𝔼0 -quotient space
cannot be linearly ordered–Corollary 13.3.2.
The transversal models. Let 𝐸 be a pinned Borel equivalence relation on a Pol-

ish space 𝑋. Consider the poset 𝑃 of countable subsets of 𝑋 consisting of pairwise
𝐸-unrelated elements, ordered by reverse inclusion. The generic filter yields an 𝐸-
transversal 𝑇 ⊂ 𝑋. The study of the resulting model is fairly straightforward with
our methods:
Theorem 1.4.4. In the model 𝑊[𝑇], the following statements hold:
(1) (Theorem 12.2.15) the Open Coloring Axiom;
(2) (Corollary 12.2.15) there is no diffuse finitely additive probability measure on
𝜔;
(3) (Corollary 13.3.10) there is no discontinuous homomorphism between Polish
groups;
Other features depend on the equivalence relation 𝐸 in a rather predictable way. Thus,
if 𝐸 is classifiable by countable structures, then in 𝑊[𝑇], |𝐹| ≰ |𝐺| holds whenever
𝐹 is an orbit equivalence relation of a turbulent group action and 𝐺 is an equivalence
relation classifiable by countable structures. If 𝐸 is reducible to an orbit equivalence
relation, then in 𝑊[𝑇], |𝔼1 | ≰ |𝐺| holds whenever 𝐺 is an orbit equivalence relation
of a turbulent group action. If suitable large cardinals exist, one can find a transversal
generic over the model 𝐿(ℝ), independently of the size or structure of the continuum.
The model 𝐿(ℝ)[𝑇] inherits all features quoted in Theorem 1.4.4.
1.5. Independence: by preservation theorem

For a practitioner, it is probably most useful to categorize the results we obtain by
the technical preservation theorem for balanced forcing that leads to them. The spec-
trum of preservation theorems for balanced forcing rivals the proper forcing technol-
ogy. Many classes considered below are closed under countable, full support product.
In the broad class of balanced forcings, a number of preservation theorems are pos-
sible. Balanced extensions of symmetric Solovay model do not add any well-ordered
sequences of elements of the Solovay model–Theorem 9.1.1. They do not contain any
inequalities of the form |𝐸 + | ≤ |𝐸| where 𝐸 is a Borel equivalence relation and 𝐸 + is its
Friedman–Stanley jump–Corollary 9.1.5. Certain more sophisticated objects are miss-
ing from these extensions, such as maximal almost disjoint families–Theorem 14.1.1.
To overcome these limitations, one has to reach for the weakly balanced forcings. They
do not add any sets of ordinals. A prominent example of a weakly balanced forcing
1.5. INDEPENDENCE: BY PRESERVATION THEOREM 13
which is not balanced is one which adds a maximal almost disjoint family with a cer-
tain type of approximations–Definition 8.10.6.
Compactly balanced forcings are those for which the space of balanced classes
is naturally organized into a compact Hausdorff space–Definition 9.2.1. The most
prominent example is the poset 𝒫(𝜔) modulo finite–Example 9.2.4. The extensions
of the symmetric Solovay model by compactly balanced forcings satisfy |𝔼0 | > |2𝜔 |–
Theorem 9.2.2. It is even true that the chromatic number of a certain Hamming-type
graph remains uncountable–Theorem 11.8.2.
Placid forcings are those in which placid virtual conditions exist: these are virtual
conditions 𝑝 ̄ such that for any pair of separately generic extensions 𝑉[𝐻0 ], 𝑉[𝐻1 ] such
that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 and for any conditions 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ] such that
𝑝0 , 𝑝1 are both stronger than 𝑝,̄ the conditions 𝑝0 , 𝑝1 are compatible–Definition 9.3.1.
Thus, the mutual genericity required in the definition of balanced forcing is replaced
by the weaker demand 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉. The most prominent example is the poset
adding a Hamel basis to the reals with countable approximations–Example 9.3.4. The
extensions of the symmetric Solovay model by placid forcings do not contain any in-
equalities |𝐸| ≤ |𝐹| where 𝐸 is an orbit equivalence relation of a turbulent Polish
group action, and 𝐹 is an equivalence relation classifiable by countable structures–
Theorem 9.3.3. Another attractive property of placid forcings is that they do not add
transcendence bases for Polish fields–Theorem 12.3.12. There are many other effects
(such as the nonexistence of nonprincipal ultrafilters on 𝜔) which are in fact conse-
quences of preservation theorems for the broader class of Bernstein balanced forcings.
Nested balanced forcings are those which contain a sequence of balanced virtual
conditions for a suitable infinite nested sequence of generic extensions, as in Defini-
tion 9.4.1. All compactly balanced forcings are nested balanced–Example 9.4.7. A
prominent example of a nested balanced but not compactly balanced forcing is the
poset adding a transversal to the equivalence 𝔼0 by countable approximations–Example
9.4.14. The extensions of the symmetric Solovay model by nested balanced forcings
do not contain any inequalities |𝔼1 | ≤ |𝐸| where 𝐸 is an orbit equivalence relation–
Theorem 9.4.4.
Tethered forcings are those for which, to establish the balance of a pair ⟨𝑄, 𝜏⟩,
it is enough to show that the pair decides virtual conditions of certain complexity–
Definition 10.1.1. Most balanced forcings are tethered; a prominent example of an
untethered poset is the collapse poset adding an injection of the 𝔼0 -quotient space to
2𝜔 . In tethered extensions of the symmetric Solovay model, the countable-to-one uni-
formization (and many other uniformization principles) holds–Theorem 10.2.6. In the
extension by the untethered collapse poset, there is no 𝔼0 -transversal which means that
the countable-to-one uniformization must fail.
The perfectly balanced forcings are the balanced Suslin forcings such that for ev-
ery perfect collection {𝑉[𝐻𝑥 ] ∶ 𝑥 ∈ 2𝜔 } of mutually generic extensions of 𝑉 and in
each model 𝑉[𝐻𝑥 ] there is a condition 𝑝𝑥 ∈ 𝑃 stronger than a given balanced vir-
tual condition 𝑝,̄ there is a condition in 𝑃 stronger than uncountably many conditions
𝑝𝑥 –Definition 12.1.1. Prominent examples include posets adding ultrafilters, like the
poset of infinite subsets of 𝜔 ordered by inclusion. The perfectly balanced extensions
of the symmetric Solovay model satisfy such features as the strong Silver dichotomy
(Theorem 12.1.6) and a strong version of OCA (Theorem 12.1.8).
14 1. INTRODUCTION
The Bernstein balanced forcings are posets such that for every perfect collection
{𝑉[𝐻𝑥 ] ∶ 𝑥 ∈ 2𝜔 } of mutually generic extensions of 𝑉 and every collection {𝑝𝑥 ∶ 𝑥 ∈
2𝜔 } of conditions in the respective models 𝑉[𝐻𝑥 ] and stronger than a given balanced
virtual condition 𝑝,̄ no condition in 𝑃 below 𝑝 ̄ is incompatible with more than count-
ably many conditions 𝑝𝑥 –Definition 12.2.1. While this definition may look obscure
at first reading, many posets satisfy it and it has many consequences which are dif-
ficult to obtain otherwise. Bernstein balanced forcings add no finitely additive dif-
fuse probability measures on 𝜔, in particular non nonprincipal ultrafilters–Theorem
12.2.3. Among other effects, their generic extensions satisfy the Open Coloring Axiom–
Theorem 12.2.5. For many of them, a filter generic over the model 𝐿(ℝ) exists in the
theory ZFC plus a suitable large cardinal, independently of the status of the Continuum
Hypothesis or similar issues–Theorem 12.4.2. The Bernstein balanced forcings should
be viewed as dual to the perfectly balanced forcings, as generic filter for a perfectly bal-
anced forcing and a generic filter for a Bernstein balanced forcing tend to be automat-
ically mutually generic–Theorem 12.4.15. Prominent examples of Bernstein balanced
forcings include all placid forcings and also the forcings adding transcendence bases to
Polish fields.
The class of Bernstein balanced forcings allows a meaningful stratification, which
amounts to assigning numerical dimension to the posets in the class–Definition 12.3.10.
This move leads to some of the most attractive results of this book. To state some of
them, let 𝑛 ≥ 1 be a natural number. The 𝑛-Bernstein balanced forcings do not add
transcendence bases to uncountable Polish fields (Theorem 12.3.12), and do not add
colorings to Borel graphs of Komjáth dimension 𝑛 or greater–Theorem 12.3.11. The
latter notion of dimension of a graph is introduced in Definition 12.3.1 and faithfully
reflects the usual dimension of Euclidean spaces on which certain interesting algebraic
graphs are defined.
3, 2-balanced forcings form a class useful for ruling out discontinuous homomor-
phisms between Polish groups. A poset 𝑃 is 3, 2-balanced if there are 3, 2-balanced
virtual conditions 𝑝 ̄ in it; these are virtual conditions such that for any triple 𝑉[𝐻0 ],
𝑉[𝐻1 ], 𝑉[𝐻2 ] of pairwise mutually generic extensions of 𝑉 and conditions 𝑝0 ∈ 𝑉[𝐻0 ],
𝑝1 ∈ 𝑉[𝐻1 ], and 𝑝2 ∈ 𝑉[𝐻2 ] below 𝑝 ̄ there is a common lower bound of {𝑝0 , 𝑝1 , 𝑝2 }–
Definition 13.1.1. A prominent example is the forcing adding a linear ordering of a
given quotient space by countable approximations. 3, 2-balanced extensions of the
symmetric Solovay model do not contain any discontinuous homomorphisms between
Polish groups; in particular, they contain no nonprincipal ultrafilters on 𝜔–Theorem
13.2.1. Among other effects, they do not contain non-Borel automorphisms between
many quotient groups–Theorem 13.2.3. A much stronger form of this property is 3, 2-
centeredness, in which any collection of three pairwise compatible conditions has a
lower bound. Such posets for example do not add linear orderings of quotient spaces
except for trivial reasons–Theorem 13.2.7.
There are a number of preservation properties discussed in Chapter 11. The
strongest one is definable balance. A poset 𝑃 is definably balanced if below every
condition 𝑝 ∈ 𝑃 there is a balanced virtual condition definable from real and ordi-
nal parameters. A prominent example is the poset adding a nontrivial automorphism
of the algebra 𝒫(𝜔) modulo finite. Definably balanced posets preserve uncountable
chromatic numbers of analytic hypergraphs; they also share a great number of other
1.6. NAVIGATION 15
regularity properties. A significant weakening of this notion is centered control. A

poset 𝑃 is balanced with centered control if for every condition 𝑝 ∈ 𝑃 there is a control
poset 𝑄 covered by centered sets definable from ordinal parameters and a single real
parameter, and a definable 𝑄-name 𝜎 such that 𝑄 forces 𝜎 to be balanced virtual condi-
tion stronger than 𝑝–Definition 11.3.5. Balanced posets with centered control preserve
uncountable chromatic numbers of finitary analytic hypergraphs–Theorem 11.3.6. A
prominent example is the poset adding a ℤ-type ordering to every 𝐸-class, where 𝐸 is a
countable Borel equivalence relation with all classes infinite. Similar preservation the-
orems are proved for balanced forcings with linked control, measured control, liminf
control etc, where the adjective refers to the regularity properties of the control poset.
The technology allows one to separate chromatic numbers of various classes of (locally
countable) Borel hypergraphs. There are other applications of the technology which
did not make it into this book.
1.6. Navigation
The structure of the book is quite complicated and some navigation advice will
greatly enhance the reader’s experience. Part I contains results about reducibility of
Borel and analytic equivalence relations and how amalgamation properties of models
of set theory can be used to disprove it. Part II provides all of the choiceless indepen-
dence results. It is difficult to appreciate the methods of Part II without having basic
acquiantance with the concepts introduced in Part I. Still, Part I should be viewed as
only the gate to Cantor’s paradise, while Part II is already within the gates.
Chapter 2 defines and explores the notion of the virtual quotient space for an
analytic equivalence relation 𝐸 on a Polish space 𝑋. On an intuitive level, a virtual
equivalence class is one which may only exist in some forcing extension but still we
already have a sensible calculus for speaking about it.
Section 2.1 provides the basic definitions. If 𝑃 is a partial order and 𝜏 is a 𝑃-name
for an element of 𝑋, the name is called 𝐸-pinned if its 𝐸-class does not depend on the
generic filter on 𝑃. There is a natural equivalence 𝐸̄ on pinned names, and the 𝐸̄ equiv-
alence classes are referred to as the virtual 𝐸-classes. Section 2.2 shows that if one has
a definable structure on the 𝐸-quotient space, it is possible to consider the virtual ver-
sion of that structure on the virtual quotient space. This is a structure Π1 -elementarily
equivalent to the original one. Structures such as virtual versions of partially ordered
sets of Borel simplicial complexes will come handy later in the book.
Sections 2.3 and 2.4 deal with the most immediate concern: the classification prob-
lem for the virtual quotient spaces. The virtual equivalence classes should correspond
to some immediately recognizable combinatorial objects, and in many important cases
this hope is fulfilled. In a broad class of equivalence relations (the pinned equiva-
lence relations of [54, Section 17]) the virtual quotient space is simply identical to
the quotient space. Many jump-type operations on equivalence relations have a nat-
ural translation to operations on virtual quotient spaces; for example, the Friedman–
Stanley jump [36] is translated to a powerset operation–Theorem 2.3.4. Virtual classes
of isomorphism relations on countable structures naturally correspond to uncountable
structures of the same type (Theorem 2.4.5), even though in some cases there may be
mysterious virtual classes which are not classified in this way [56]. Still, there are many
16 1. INTRODUCTION
wide open questions. For example, we do not know how to classify the virtual quotient
space for the measure equivalence. The virtual space of homomorphism of second
countable compact Hausdorff spaces sems to be naturally classified by compact Haus-
dorff spaces, but there is no theorem to that effect.
Section 2.5 deals with the next most natural concern: the attempt to size up the
virtual quotient space in terms of cardinality. The effort is surprisingly successful, gen-
erating cardinal invariants of analytic equivalence relations which can take all kinds
of exotic and informative values. Given an analytic equivalence relation 𝐸, one defines
the pinned cardinal 𝜅(𝐸) as the minimal cardinal such that all virtual classes of 𝐸 are
represented by names on posets of size < 𝜅. One also defines 𝜆(𝐸) as the cardinality
of the virtual quotient space, and 𝜆(𝐸, 𝑃) as the cardinality of the set of virtual classes
which are represented by names on the poset 𝑃. These cardinals respect the Borel
reducibility order; therefore, they serve as viable tools for the Borel nonreducibility
results. In addition, they interact well with a number of operations on equivalence
relations. In a jarring development, these cardinals can connect Borel nonreducibil-
ity results to hard questions about singular cardinal arithmetic or similar concerns of
transfinite set theory.
Section 2.6 limits the type of partial orders that can carry a nontrivial 𝐸-pinned
name. Theorem 2.6.2 shows that, in particular, proper forcings do not carry any non-
trivial 𝐸-pinned names. Theorem 2.6.3 shows that as soon as there are some nontrivial
𝐸-pinned names (i.e. 𝐸 is not pinned), then one can find them in any partial order col-
lapsing ℵ1 . The most curious result is Theorem 2.6.4: if 𝐸 is Borel reducible to an orbit
equivalence relation, then every nontrivial virtual 𝐸-class really comes from a collapse
of some uncountable cardinality to ℵ0 . Compare this with the efforts of Section 2.4
where some virtual classes of equivalence relations classifiable by countable structures
were classified by uncountable structures to be collapsed down to the countable size.
This feature does not persist to arbitrary analytic equialence relations: Example 2.6.8
produces a nontrivial 𝐸-pinned name on the Namba forcing for a suitable equivalence
relation 𝐸.
Section 2.7 proves two absoluteness results. First, in Corollary 2.7.3 we show that
for a Borel equivalence relation 𝐸, the statement “𝐸 is pinned” is absolute among all
forcing extensions. This greatly simplifies the language used to formulate later results.
A similar statement for analytic equivalence relations requires large cardinal assump-
tions. Second, in Theorem 2.7.4, we show that at least for equivalence relations 𝐸
reducible to orbit equivalence relations, transitive inner models of ZFC calculate the
pinned cardinal 𝜅(𝐸) predictably: their calculation cannot return a value larger than
the actual value of 𝜅(𝐸) in 𝑉.
It is not clear if the class of unpinned Borel equivalence relations allows a neat
basis in ZFC. The main result of Section 2.8 shows that the answer is affirmative at
least in the symmetric Solovay model. There, the basis for unpinned Borel equivalence
relations is just {𝔽2 } (a former conjecture of Kechris, which nevertheless fails badly
in ZFC); for unpinned analytic equivalence relations we isolate the basis {𝔽2 , 𝔼𝜔1 }–
Corollary 2.8.13 and Theorem 2.8.11. We also provide a basis for the class of analytic
equivalence relations 𝐸 such that 𝜅(𝐸) = ∞. The basis is {𝔼𝜔1 }–Theorem 2.8.9.
1.6. NAVIGATION 17
Chapter 3 restates and greatly generalizes Hjorth’s notion of turbulence in forc-

ing terms. This development shows that nonturbulent equivalence relations are in
fact parallel to pinned equivalence relations in a very precise sense. The forcing re-
lation encapsulates many distracting estimates needed in the traditional treatment of
turbulence, resulting in a clean and efficient general calculus.
Section 3.1 provides the motivating insight–namely, that building pairs of models
𝑉[𝑦0 ], 𝑉[𝑦1 ] where 𝑦0 ∈ 𝑌0 and 𝑦1 ∈ 𝑌1 are separately Cohen generic elements of their
respective Polish spaces such that 𝑉[𝑦0 ] ∩ 𝑉[𝑦1 ] = 𝑉 depends on a suitable notion of
a walk–Theorem 3.1.4. The comparison of generic extensions vis-a-vis their intersec-
tion is an important concern in the later parts of this book. Section 3.2 provides two
basic examples. In the first, Hjorth’s notion of turbulence of group actions is restated
in geometric terms–Theorem 3.2.2. The second example provides a complete charac-
terization of those analytic ideals on 𝜔 such that it is possible to find points 𝑥0 , 𝑥1 ∈ 2𝜔
separately generic over 𝑉 such that they are equal modulo 𝐼 and 𝑉[𝑥0 ] ∩ 𝑉[𝑥1 ] = 𝑉–
Theorem 3.2.4.
Section 3.3 defines two classes of equivalence relations that are simple from the
turbulent point of view. An equivalence relation 𝐸 on a Polish space 𝑋 is placid if any
𝐸-class represented in generic extensions with trivial intersection is represented in the
ground model. 𝐸 is virtually placid if any virtual 𝐸-class represented in such generic
extensions is represented as a virtual class in the ground model. These definitions are
preserved under Borel reducibility and under many natural operations on equivalence
relations, as shown in Section 3.4. The main application is the generalization of an
ergodicity theorem by Hjorth and Kechris [59, Theorem 12.5] (Theorem 3.3.5): any
Borel homomorphism from a turbulent equivalence relation to a virtually placid one
stabilizes on a comeager set.
Section 3.5 provides a necessary complement to the forcing development in this
chapter: a theorem asserting that the notions introduced are absolute among all generic
extensions and evaluating their descriptive complexity–Theorem 3.5.6. Finally, Sec-
tion 3.6 develops turbulence of group actions for measure. It turns out that the appro-
priate concept uses the familiar notion of concentration of measure of [86].
Chapter 4 presents one of the novel concepts of geometric set theory: that of a
coherent nested sequence of models of ZFC, with emphasis on the intersection model.
Thus, let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be an inclusion-decreasing sequence of transitive models of
ZFC and consider the transitive class 𝑀𝜔 = ⋂𝑛 𝑀𝑛 . A simple coherence condition
on the sequence guarantees that 𝑀𝜔 is a model of ZF (Theorem 4.2.9); a coherence
condition with a suitable well-ordering parameter guarantees that 𝑀𝜔 is a model of
ZFC–Theorem 4.3.2. In Section 4.2 we develop the technology of building coherent se-
quences of generic extensions (Theorem 4.2.8) and produce a case in which choice fails
in the intersection model. In Section 4.3 we develop a machinery of building choice-
coherent sequences of generic extensions–Theorem 4.3.5. In principle, there is a whole
field of coherent set theory lurking behind these concepts and the intersection models
can serve as new vehicles for obtaining independence results. However, in this chapter
our emphasis is on the connection with Borel equivalence relations. Our main result
shows that the choice-coherent sequences of models detect the difference between 𝔼1
and orbit equivalence relations: if 𝐸 is an orbit equivalence relation and 𝐶 is a virtual
18 1. INTRODUCTION
𝐸-class represented in each model 𝑀𝑛 , then it is represented in 𝑀𝜔 –Theorem 4.3.6.

This typically fails for 𝔼1 . The topic is revisited in Section 9.4 below.
Chapter 5 develops the basic general theory of balanced Suslin forcing. The treat-
ment of Suslin forcing is quite different from that in [7] or similar treatments on the
structure of the real line. Our partial orders are typically (but not necessarily) 𝜎-closed,
and serve to add combinatorial objects by explicit countable approximations in the con-
text of the symmetric Solovay model. It is important to understand that the study of
these partial orders takes place exclusively within set theory with choice.
Section 5.1 defines the notion of a virtual condition in a Suslin forcing 𝑃. A vir-
tual condition is an element of the completion of the poset 𝑃 which only exists in some
generic extension, but for which one can develop a sensible calculus of comparison al-
ready in the ground model, quite in parallel to virtual equivalence classes developed in
Chapter 2. There are natural equivalence and ordering relations on virtual conditions
in 𝑃.
Section 5.2 defines the key notion of a balanced pair in a Suslin forcing 𝑃. This is a
pair ⟨𝑄, 𝜏⟩ where 𝑄 is a poset and 𝜏 is a 𝑄-name for an element of the forcing 𝑃 which
satisfies a natural amalgamation property in mutually generic extensions. There is a
natural notion of equivalence on balanced pairs in 𝑃. The motherload feature exploited
throughout the rest of the book is the simple Theorem 5.2.8: every balanced class con-
tains exactly one virtual condition. The task of understanding a given Suslin forcing
𝑃 in the context of geometric set theory is then nearly identical to the classification of
balanced virtual conditions in a given Suslin forcing 𝑃. Balanced virtual conditions in
balanced Suslin forcing are quite parallel to master conditions in proper forcing.
Section 5.3 defines weakly balanced Suslin forcing. This is a weakening of the
notion of balanced Suslin forcing designed to produce some effects (such as MAD fam-
ilies) which are absent from balanced extensions of the symmetric Solovay model. The
whole development is quite parallel to balanced Suslin forcing with suitable quantifi-
cation adjustments. Some examples of weakly balanced forcings can be found in Sec-
tion 8.10. This book’s primary focus is on balanced forcing, and the potential of the
weakly balanced variations is left wide open.
Chapter 6 analyzes a class of balanced forcings arising from simplicial complexes

of various algebraic forms. Namely, let 𝒦 be a Borel simplicial complex on a Polish
space 𝑋. Let 𝑃𝒦 be the poset of countable subsets 𝑝 ⊂ 𝑋 such that [𝑝]<ℵ0 ⊂ 𝒦, ordered
by reverse inclusion. Many useful posets in this book arise in this fashion. Section 6.2
introduces a novel general notion of a fragmented simplicial complex, Definiton 6.2.1.
The posets generated by fragmented simplicial complexes are balanced–Theorem 6.2.3.
We introduce three important subclasses of fragmented simplicial complexes–the lo-
cally countable ones, the ones with Borel coloring number ℵ1 , and the complexes gen-
erated by modular matroids. Section 6.3 considers the simplicial complexes which
happen to be matroids. Modular matroids are fragmented and therefore yield balanced
forcings–Theorem 6.3.4. However, there is another large class of matroids–the 𝐺𝛿 -ones
of Definition 6.3.8, which include in particular the algebraic matroids of Polish fields.
These are typically not modular and not fragmented, yet they yield balanced posets by
1.6. NAVIGATION 19
Theorem 6.3.9. The resulting forcings are then much more complicated than the frag-
mented ones. It is very likely that further distinctions will be found among matroid
forcings in the future. Section 6.4 investigates simplicial complexes naturally related
to quotient spaces, and shows that balanced virtual conditions are naturally found in
the related virtual quotient spaces. Particularly interesting cases concern the collapse
of one quotient cardinality to another, Definition 6.4.1, and the transversal type posets
which to each pair 𝐸 ⊂ 𝐹 of Borel equivalence relations on a Polish space 𝑋 add a
maximal set 𝐴 ⊂ 𝑋 such that 𝐸 ↾ 𝐴 = 𝐹 ↾ 𝐴–Definition 6.4.4.
Chapter 7 analyzes various ways of adding a nonprincipal ultrafilter on 𝜔 to a

choiceless model. The basic method, the poset of all infinite subsets of 𝜔 ordered by
inclusion, is investigated in Section 7.1. This poset adds a Ramsey ultrafilter, and its
balanced virtual conditions are classified simply by ultrafilters. The resulting model
has been investigated from many directions previously [22, 103]. The next simplest
type of ultrafilter is added by a poset with Ramsey sequences of finite structures, dis-
cussed in Section 7.3. It turns out that balanced virtual conditions in this type of forcing
are classified by 𝜔-sequences of ultrafilters of a certain type. Section 7.2 shows how to
add an ultrafilter which is not a P-point in the simplest fashion: using the quotient
poset of 𝒫(𝜔 × 𝜔) modulo 𝐼 where 𝐼 is the Fubini power of the Fréchet ideal. The inter-
esting development in this case is the complexity of balanced virtual conditions–they
are classified by ultrafilters on the set of ultrafilters on 𝜔 (Theorem 7.2.2). It is interest-
ing to compare this situation with Section 6.4: there, the balanced virtual conditions
were also classified by complex sets, but the complexity seemed to be worked into the
definitions of the posets from the beginning. Here, the increased complexity appeared
without invitation and as a surprise, at least to the authors. Section 7.4 shows how to
add a stable ordered union ultrafilter; the most interesting insight–the balanced virtual
conditions are classified by idempotent ultrafilters (Theorem 7.4.7).
Chapter 8 contains the analysis of balanced forcings which are designed to per-
form a specific task, and from the point of view of the previous chapters may seem
somewhat ad hoc. In Section 8.1, we consider the problem of adding a coloring of a
Borel graph or hypergraph by countably many colors. It turns out that the task is closely
related to the coloring number of graphs introduced by Erdős and Hajnal [28]. If a Borel
graph has countable coloring number, then there is a natural balanced poset (Defini-
tion 8.1.1) adding a coloring by countably many colors (Theorem 8.1.2). The classical
examples of such graphs appear on Euclidean spaces as distance graphs (Example 8.1.7
and 8.1.8) and have been studied among others by the Hungarian combinatorial school
[65]. Adding colorings to hypergraphs seems to be much trickier business. We iso-
late a broad class of circular hypergraphs (Definition 8.2.6) and design balanced posets
adding a coloring with countably many colors (Definition 8.2.7 and Theorem 8.2.8).
One interesting example of a circular hypergraph is the hypergraph of triples of dis-
tinct points of the plane forming vertices of an equilateral triangle–Example 8.2.10. In
a comment on an old result of Erős and Kakutani [26] we show how to add a count-
able decomposition of a vector space over a countable field in which each composant
is linearly independent (Theorem 8.2.17).
20 1. INTRODUCTION
Section 8.3 considers the problem of adding a discontinuous homomorphism be-

tween given Polish groups. This task cannot have a positive resolution in general since
many Polish groups have the automatic continuity property, for example the unitary
group [108]. However, we provide a balanced forcing in the case of abelian groups, one
of which is torsion free, and the other divisible (Theorem 8.3.2). Section 8.4 shows that
it is possible to force a nontrivial automorphism of the Boolean algebra 𝒫(𝜔) modulo
finite with a balanced forcing. The forcing consists simply of countable approxima-
tions ordered by reverse inclusion, and balanced virtual conditions correspond exactly
to automorphisms of the algebra–Theorem 8.4.3. Section 8.5 considers the problem of
adding a cofinal Kurepa family on a Polish space with a balanced poset. Again, the
natural countable approximation poset works, and there is a very simple classification
theorem for the balanced virtual conditions–Theorem 8.5.3. Section 8.6 presents bal-
anced forcings for adding set mappings on Polish spaces without nontrivial free sets.
Section 8.7 shows how one can add saturated models of first order theories to 𝐸-
quotient spaces for a Borel equivalence relation 𝐸. An especially interesting case is
adding a saturated limit of a Fraissé class with strong amalgamation; i.e. a linear order-
ing, a tournament, or similar structures (Theorem 8.7.4). In this section, the amalga-
mation problems familiar from model theory and the amalgamation questions arising
in geometric set theory exhibit a particularly strong affinity.
Section 8.8 shows that there are balanced orderings which produce extensions of
the symmetric Solovay model in which the Axiom of Dependent Choices fails. The
seminal example is the finite-countable poset of Definition 8.8.1 which introduces a
partition of an uncountable Polish space into two parts, one of them without a perfect
subset and the other without countably infinite set.
Section 8.9 introduces several balanced posets which in the usual ZFC context
would be viewed as “side condition” forcings. The general Definition 8.9.1 provides
a general construction for adding an uncountable set whose intersection with every
set in 𝐼 is countable, where 𝐼 is a given ideal generated by closed sets. Theorem 8.9.6
shows how to add a special type of a Lusin set. The forcings mostly serve as delimiting
examples in Section 12.2.
Section 8.10 provides two examples of weakly balanced forcings, achieving what
balanced forcing cannot do. In the first case (Theorem 8.10.2) we construct a weakly
balanced poset which collapses |𝐸| to |𝔼0 |, for any given Borel equivalence relation 𝐸.
This breaks the Friedman–Stanley jump barrier which is one of the basic features of
balanced extensions of the Solovay model by Corollary 9.1.5. The second example (The-
orem 8.10.7) is a weakly balanced poset adding a maximal almost disjoint family, an
object one cannot find in balanced extensions of the Solovay model by Theorem 14.1.1.
In general, the weakly balanced arguments are much more difficult than the balanced
ones.
Chapter 9 compares cardinalities of quotient spaces in balanced extensions of the

symmetric Solovay model 𝑊. On the surface, this is an enterprise very similar to the
traditional forcing concerns in the context of the axiom of choice. However, it is im-
portant to understand that the non-well-ordered quotient cardinals offer many more
opportunities for meaningful independence work and also for surprising ZF results
preventing various patterns of cardinal collapses.
1.6. NAVIGATION 21
Section 9.1 shows that no new inequalities between well-ordered cardinalities and
quotient cardinalities are added by balanced forcing. In fact, no new well-ordered se-
quences of elements of 𝑊 are added–Theorem 9.1.1. This result is central for the rest
of the book. Section 9.2 provides a very flexible tool for verification of the inequality
|𝔼0 | > |2𝜔 | in certain classes of balanced extensions. Namely, it turns out that if the
balanced virtual conditions of the forcing are naturally organized into a compact Haus-
dorff space, then the inequality is preserved in the 𝑃-extension of the symmetric Solo-
vay model–Theorem 9.2.2. The compact Hausdorff space in question may certainly be
nonmetrizable; in the case of the poset 𝑃 of infinite subsets of 𝜔 ordered by inclusion, it
is simply the Čech–Stone remainder of 𝜔. Among the applications, it is possible to add
linear ordering to any Borel quotient space and preserve |𝔼0 | > |2𝜔 |–Corollary 9.2.12,
or to add a discontinuous homomorphism from ℝ to ℝ/ℤ and preserve |𝔼0 | > |2𝜔 |
as in Corollary 9.2.21. The inequality |𝔼0 | > |2𝜔 | can be verified in other ways when
the balanced classes do not form a compact Hausdorff space, for example using The-
orem 11.4.5 to maintain the chromatic number of the 𝔾0 -graph uncountable which
automatically implies |𝔼0 | > |2𝜔 | by Proposition 11.1.6(2).
Section 9.3 shows that the nonreducibility results obtained by Hjorth’s turbulence
method turn into cardinal inequalities in certain classes of balanced extensions. The
main contribution here is Definition 9.3.1, isolating the relevant class of placid Suslin
forcings. In placid extensions of the symmetric Solovay model, no inequalities of the
type |𝐸| ≤ |𝐹| appear where 𝐸 is the orbit equivalence relation of a turbulent Polish
group action, and 𝐹 is an equivalence relation classifiable by countable structures. A
weakening of placidity is used in Section 12.2 to rule out combinatorial objects from
generic extensions which have nothing to do with any group actions, such as nonprin-
cipal ultrafilters. Placid forcings are revisited in Section 12.3 to prove further preserva-
tion results–for example, placid forcings do not add transcendence bases to uncount-
able Polish fields.
Section 9.4 provides practical criteria for showing that the classical nonreducibility
of 𝔼1 to any orbit equivalence relation translates into cardinal inequalities in certain
classes of balanced extensions of the Solovay model. This turns out to require close
study of nested sequences ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ of models of ZFC as in Chapter 4. In particular,
we must resolve the question whether, for a given Σ21 sentence 𝜙 which is a consequence
of the axiom of choice, one can produce a set 𝐴 such that for each 𝑛 ∈ 𝜔, the set
𝐴 ∩ 𝑀𝑛 belongs to 𝑀𝑛 and is a witness for the sentence 𝜙 there. The resulting tricky
combinatorial work can be used to separate for example the existence of a Hamel basis
from existence of maximal acyclic subgraphs in Borel graphs.
Section 9.6 shows that the nonreducibility results between analytic equivalence
relations obtained by the comparisons of their cardinal invariants 𝜅 and 𝜆 mostly turn
into cardinal inequalities in the Solovay model 𝑊, and these inequalities survive un-
harmed into balanced extensions.
Chapter 10 deals with the question of whether countable-to-one uniformization

and similar uniformization principles hold in balanced forcing extensions. Section 10.1
provides the a practical criterion on a Suslin forcing 𝑃 which implies that many strong
uniformization principles hold in the forcing extension of the Solovay model by 𝑃. It
turns out that the criterion is satisfied in a great number of interesting cases, and its
22 1. INTRODUCTION
verification mostly follows from the careful classification of balanced virtual condi-
tions for 𝑃. Section 10.2 studies various uniformization principles in turn and shows
that they in fact hold in tethered extensions of the symmetric Solovay model. Lastly,
Section 10.3 provides a great number of examples and non-examples.
Chapter 11 considers the independence results which appear when one attempts
to select one type of structure to each 𝐸-class, and not select another type; here 𝐸 is
a given countable Borel equivalence relation on a Polish space. The problems consid-
ered are motivated by the present practice of descriptive graph theory. The upshot is
a discovery of new and very pertinent fracture lines in the realm of (locally countable)
Borel hypergraphs. The main point of the whole section is that definable c.c.c. posets
have great influence on independence results in ZF+DC, even though heretofore they
were used only for ZFC independence results.
The fracture lines and their critical objects are defined in Section 11.1. We define
two variations of countable Borel chromatic number of hypergraphs on Polish spaces:
the Borel 𝜎-finite chromatic number (Definition 11.1.9) and the Borel 𝜎-finite fractional
chromatic number (Definition 11.1.18. The relevant classes of hypergraphs contain
minimal objects obtained by the same operation of a skew product (Definition 11.1.1).
There are several dichotomies in style very similar to the original 𝔾0 -dichotomy of [61].
A number of examples illustrate the new concepts; among them, there is one obtained
from the density version of the van der Waerden theorem (Example 11.1.20).
Each of the following sections deals with a different fracture line, separating exis-
tence of locally countable objects of various types. Many of the proofs run in parallel,
but we have not been able to find an overarching general principle. The resulting proofs
are long and verbose, but no steps in them are particularly demanding.
In Section 11.2 we treat the very soft class of posets which possess definable bal-
anced virtual conditions. While at first sight it may seem that this class contains no
particularly interesting posets, this is not the case: for example, the posets adding a
discontinuous automorphism of 𝒫(𝜔) modulo finite or a countable complete section
to a given pinned Borel equivalence relation belong to it. We show that these posets pre-
serve uncountable chromatic numbers of analytic hypergraphs (Theorem 11.2.2) and
do not introduce inequalities of the form |𝐸| ≤ |𝔼0 | where 𝐸 is the orbit equivalence re-
lation of the shift action of a countable non-amenable group. Many other preservation
properties of posets in this class remain unstated.
Section 11.3 deals with preservation of uncountable chromatic numbers for all an-
alytic finitary hypergraphs. The key notion is that of balance with centered control
(Definition 11.3.5). Briefly, a balanced forcing has centered control if there is a defin-
able, definably centered forcing which adds a balanced virtual condition via a definable
name. Balanced posets with centered control preserve uncountable chromatic num-
bers of analytic finitary hypergraphs–Theorem 11.3.6. A typical application is Corol-
lary 11.3.9. Given a locally countable Borel graph 𝐺 of finite chromatic number 𝑛 ∈ 𝜔,
it is possible to find a model of ZF+DC in which the chromatic number of 𝐺 is ≤ 2𝑛 − 1
and at the same time the uncountable chromatic numbers of all analytic finitary hy-
pergraphs are preserved.
Section 11.4 deals with preservation of uncountable chromatic numbers for all ana-
lytic graphs. The key tool is the notion of balance with linked control–Definition 11.4.4.
1.6. NAVIGATION 23
The technology allows one in particular to make many Borel hypergraphs of arity
greater than two countably chromatic, while the uncountable Borel chromatic number
of graphs is preserved–Corollary 11.4.12. Another application shows that it is possible
to add perfect matchings for many locally finite Borel graphs while maintaining un-
countable chromatic numbers of graphs–Corollary 11.4.9. Further sections introduce
other variations of control, separating chromatic numbers of various other classes of
Borel graphs in ZF+DC.
Section 11.8 revisits the class of compactly balanced forcing. We show that for
many locally countable hypergraphs 𝐺, compactly balanced forcings do not make 𝐺
have countable chromatic number. such forcings do not add countable coloring to
a number of locally countable hypergraphs. The notion of Borel 𝜎-finite chromatic
number (Definition 11.1.9) is critical here; the diagonal Hamming graph ℍ<𝜔 is the
most prominent example. In particular, it is consistent with ZF+DC that there be a
nonprincipal ultrafilter on 𝜔, yet the chromatic number of ℍ<𝜔 is uncountable.
Chapter 12 presents important two classes of posets which are in a precise sense
dual to each other. Both of them offer extensive control over uncountable subsets of
Polish spaces, but they approach the task from exactly orthogonal directions.
Section 12.1 isolates the classes of perfectly balanced and perfect forcings. The
main inhabitant of these classes is the ordering of infinite subsets of natural numbers
ordered by inclusion. However, it turns out that most natural partial orders for adding
ultrafilters are perfectly balanced. Extensions of the symmetric Solovay model by per-
fectly balanced forcings satisfy a strong form of Silver dichotomy: every uncountable
subset of a Borel quotient space contains an injective copy of 2𝜔 (Theorem 12.1.6).
Among other effects, they also satisfy a strong form of the Open Coloring Axiom–
Theorem 12.1.8.
Section 12.2 presents the dual class of Bernstein balanced forcings. It is very rich,
including the placid posets, but also posets for adding transcendence bases for Polish
fields, or posets adding Fraissé structures on Borel quotient spaces. The preservation
theorems show in particular that their extensions do not contain nonprincipal ultrafil-
ters (Theorem 12.2.3 or satisfy the Open Coloring Axiom (Theorem 12.2.5). The exten-
sions also exhibit properties which are in certain sense dual to known ZFC indepen-
dence results. For example, every unbounded subset of 𝜔𝜔 under the modulo finite
domination order contains a bounded uncountable subset–Theorem 12.2.7.
Section 12.3 contains a stratification of the class of Bernstein balanced forcings
by dimension. We first define the novel concept of Komjáth dimension of graphs and
hypergraphs–Definition 12.3.1. This notion of dimension faithfully reflects the dimen-
sion of Euclidean spaces on which the (hyper)graphs may be defined. The evaluation
of graph dimension typically uses the tame topology and o-minimality machinery of
[110] and the associated tame-topological dimension of semi-algebraic sets. Then, for
each number 𝑛 ≥ 1 we define the class of 𝑛-Bernstein posets (Definition 12.3.10) and
prove several preservation theorems. 𝑛-Bernstein forcings do not add colorings to hy-
pergraphs of dimension at least 𝑛 (Theorem 12.3.11) and do not add transcendence
bases to Polish fields (Theorem 12.3.11). There are very many attractive corollaries.
24 1. INTRODUCTION
The duality between perfectly balanced and Bernstein balanced posets comes to
full view in Section 12.4. It turns out that the generic filters for Bernstein balanced forc-
ings and perfectly balanced forcings are often automatically mutually generic–Theorem
12.4.15. This is the most precise and elegant way of framing intuitions like “ultrafil-
ters and transcendence bases for fields have nothing to do with each other”. At the
same time, filters for Bernstein balanced forcings generic over 𝐿(ℝ) exist as a mat-
ter of ZFC plus large cardinals, without regard to the structure of continuum issues–
Theorem 12.4.2. Thus, we get say generic Hamel bases for vector spaces or generic
transcendence bases for Polish fields in ZFC plus large cardinals. This contrasts with
the perfectly balanced ultrafilter posets, where a long line of ZFC independence results
may be interpreted as showing that generic filters for these posets consistently fail to
exist.
Chapter 13 presents the classes of 𝑚, 𝑛-balanced and centered forcings. These

classes serve to separate combinatorial objects of different arity of organization. The
reader has to keep in mind that the notion of arity used here is quite abstract or even
somewhat ineffable.
Section 13.2 contains the main preservation results. The raison d’etre of the classes
of forcings under discussion is Theorem 13.2.1 which shows that 𝑛+1, 𝑛-balanced forc-
ings do not add discontinuous homomorphisms between Polish groups. This means
that in particular no nonprincipal ultrafilters on 𝜔 are added. A similar effect is pro-
duced by Theorem 13.2.3: 𝑛 + 1, 𝑛-balanced forcings do not add non-Borel homomor-
phisms between various Borel quotient groups studied in particular by Ilijas Farah
[32]. The evaluation of arity comes into view with Theorem 13.2.4: it turns out that
4, 3-balanced forcings add no colorings of the Euclidean space which avoid parallelo-
grams, and similar conclusions are available for 𝑚, 𝑛-balance for higher values of 𝑚, 𝑛.
We also study the related and much more restrictive class of 𝑚, 𝑛-centered forcings.
A particular success is Theorem 13.2.7 showing that 3, 2-centered forcings do not add
linear orderings of Borel quotient spaces except for a trivial reason. Section 13.3 pro-
vides a long list of examples and corollaries with particular emphasis on illustrating
the differences between the forcing classes introduced in this chapter.
Chapter 14 contains results that for some reason do not fit into the previous chap-
ters; some of our favorite theorems are here. Certain structures are impossible to add
by balanced forcing; MAD families (Theorem 14.1.1) and linearly ordered unbounded
subsets of many partial orderings (Theorem 14.2.1) fall into this category.
In Section 14.3, we prove one of the main constraints on the (nontrivial) balanced
extensions of the Solovay model: there must be a set of reals in them which does not
have the Baire property (Theorem 14.3.1). On the other hand, one does obtain cer-
tain models in which every set of real is Lebesgue measurable as per Theorem 14.3.4.
An old result of Shelah concerning the consistency of ZF+DC plus every set of reals
is Lebesgue measurable plus there is a set of reals without the Baire property can be
presented using this theorem–Example 14.3.5.
In Section 14.4 we gather our results about the extension of the symmetric Solovay
model with a single Ramsey ultrafilter, i.e. the extension by the poset of infinite subsets
of 𝜔 ordered by inclusion. The model has been investigated for a long time. This book
1.7. NOTATION AND TERMINOLOGY 25
makes a significant contribution to its study and leaves several interesting directions
open. The reader can find the loose ends neatly categorized here.
1.7. Notation and terminology
General. The shorthand DC denotes the Axiom of Dependent Choices. It states that
for every set 𝑋 and every binary relation 𝑅 on 𝑋 such that for every 𝑥 ∈ 𝑋 there is
𝑦 ∈ 𝑋 such that 𝑥 𝑅 𝑦 holds, there is an infinite sequence ⟨𝑥𝑖 ∶ 𝑖 ∈ 𝜔⟩ of elements of 𝑋
such that for all 𝑖 ∈ 𝜔, 𝑥𝑖 𝑅 𝑥𝑖+1 holds. It is not difficult to show that 𝜎-closed forcing
extensions of models of ZF+DC are again models of ZF+DC.
In this book, as in many books on set theory, it is a frequently played gambit in
the proofs to take an elementary submodel of a “large structure”. The structure itself is
rarely relevant. As a metadefinition, by a “large structure” we always mean the struc-
ture ⟨𝐻<𝜅 , ∈⟩ where 𝐻<𝜅 is the set of all sets whose transitive closure has cardinality
< 𝜅, and 𝜅 is the smallest regular cardinal such that 𝐻<𝜅 contains all objects named in
the proof to that point, and also their powersets. Similarly, the phrase “a large fragment
of ZFC” occurs in several places in the book. It is never truly informative to analyze
precisely how large a fragment is needed. As a matter of convention, we mean the fi-
nite fragment of ZFC including all axioms except the schemas of comprehension and
replacement, and the schemas of comprehension of replacement for all formulas of set
theory of 10100 many symbols or fewer.
Combinatorics. We use plenty of standard graph theoretic parlance throughout. A

graph is a pair Γ = ⟨𝑉, 𝐸⟩ where 𝑉 is a set and 𝐸 ⊂ [𝑉]2 . A (partial) Γ-coloring is a
partial function 𝑐 on 𝑉 such that for every edge {𝑣0 , 𝑣1 } ∈ 𝐸, 𝑐(𝑣0 ) ≠ 𝑐(𝑣1 ) holds. Chro-
matic number of a graph is the smallest cardinal 𝜅 such that there is a total 𝐺-coloring
𝑐 ∶ 𝑉 → 𝜅. A homomorphism of a graph ⟨𝑉0 , 𝐸0 ⟩ to a graph ⟨𝑉1 , 𝐸1 ⟩ is a map ℎ ∶ 𝑉0 → 𝑉1
such that if {𝑣0 , 𝑣1 } ∈ 𝐸0 then {ℎ(𝑣0 ), ℎ(𝑣1 )} ∈ 𝐸1 ; in particular, a homomorphism of
graphs need not be injective. The following is a brief list of standard graphs.
Definition 1.7.1. Let 𝑛 ∈ 𝜔 be a number.
(1) 𝐾𝑛 is the clique on 𝑛 many vertices;
(2) 𝐾𝑛,𝑛 is the complete bipartite graph on 𝑛 plus 𝑛 many vertices;
(3) 𝐾𝑛,𝜔1 is the complete bipartite graph in which one size of the bipartition has
cardinality 𝑛 and the other ℵ1 ;
→
(4) 𝐾𝜔,𝜔 is the graph on 𝜔 × 2 containing all edges {⟨𝑚, 0⟩, ⟨𝑛, 1⟩} where 𝑚 ∈ 𝑛
are natural numbers.
A directed graph on 𝑋 is just a subset of 𝑋 2 disjoint from the diagonal. An orientation
of a graph Γ on 𝑋 is a directed graph Γ⃗ on 𝑋 such that for every pair of distinct points
𝑥0 , 𝑥1 ∈ 𝑋, if {𝑥0 , 𝑥1 } ∉ Γ then ⟨𝑥0 , 𝑥1 ⟩ ∉ Γ,⃗ and if {𝑥0 , 𝑥1 } ∈ Γ then exactly one of
⟨𝑥0 , 𝑥1 ⟩, ⟨𝑥1 , 𝑥0 ⟩ belongs to Γ.⃗ A tournament on 𝑋 is an orientation of the clique on 𝑋.
A hypergraph on a set 𝑋 is an arbitrary subset Γ ⊂ 𝒫(𝑋) consisting of nonempty sets.
As a matter of convention, our hypergraphs do not contain any singleton sets. The
elements of Γ will be called hyperedges while the elements of 𝑋 will be called vertices.
A hypergraph is finitary if all of its hyperedges are finite sets. It is a graph if all its
hyperedges have cardinality two. A Γ-anticlique is a set 𝐴 ⊂ 𝑋 such that Γ ∩ 𝒫(𝐴) = 0.
26 1. INTRODUCTION
A Γ-coloring is any function with domain 𝑋 which is not constant on any hyperedge; the
elements of the range of a coloring are referred to as colors. The chromatic number 𝜒(Γ)
of the hypergraph Γ is the smallest cardinal number 𝜅 such that there is a Γ-coloring
with at most 𝜅-many colors. This definition makes sense only in the context of the
Axiom of Choice in which cardinalities are well-ordered; therefore, 𝜒(Γ) must exist. In
a choiceless context, only a limited version is available: we discern between countable
and uncountable chromatic number, and the various values of the countable chromatic
numbers.
Analytic equivalence relations. A number of concepts and results in this book are
stated in terms of Borel equivalence relations on Polish spaces. As a matter of basic
terminology, if 𝐸 is an equivalence relation on a set 𝑋, a 𝐸-transversal is a set 𝑇 ⊂ 𝑋
such that 𝑇 has a singleton intersection which each equivalence class. If 𝑥 ∈ 𝑋 is a
point, then [𝑥]𝐸 denotes the equivalence class containing 𝑥. If 𝐴 ⊂ 𝑋 is any set, then
[𝐴]𝐸 denotes the 𝐸-saturation of 𝐴, the set {𝑥 ∈ 𝑋 ∶ ∃𝑦 ∈ 𝐴 𝑥 𝐸 𝑦}. The following
definition records several benchmark relations which are used throughout the book.
Definition 1.7.2.
(1) 𝔼0 is the Vitali equivalence on 2𝜔 , connecting 𝑥, 𝑦 ∈ 2𝜔 if they differ at only
finite set of entries;
(2) 𝔼1 is the equivalence relation on (2𝜔 )𝜔 connecting 𝑥, 𝑦 if they differ at only
finite number of entries;
1
(3) 𝔼2 is the relation on 2𝜔 connecting 𝑥, 𝑦 if the sum Σ{ ∶ 𝑥(𝑛) ≠ 𝑦(𝑛)} is
𝑛+1
finite;
(4) 𝔼𝐾𝜍 is the relation on ∏𝑛∈𝜔 (𝑛 + 1) connecting 𝑥, 𝑦 if 𝑥 − 𝑦 is a bounded
function on 𝜔;
(5) 𝔽2 is the equivalence relation on (2𝜔 )𝜔 connecting 𝑥, 𝑦 if rng(𝑥) = rng(𝑦);
(6) ℍℂ is the equivalence relation on 𝒫(𝜔 × 𝜔) connecting relations 𝑥, 𝑦 if either
both are illfounded or fail the axiom of extensionality or fail to have a maximal
element, or they are isomorphic;
(7) 𝔼𝜔1 is the equivalence relation on 𝒫(𝜔 × 𝜔) connecting relations 𝑥, 𝑦 if either
both are illfounded or are not linear orders, or they are isomorphic;
(8) if Γ is a coanalytic class of structures on 𝜔 invariant under isomorphism, 𝔼Γ
is the equivalence relation on countable structures on 𝜔 connecting two such
structures if they are both fail to belong to Γ or they are isomorphic;
(9) if 𝐼 is an ideal on 𝜔 then =𝐼 on 2𝜔 is the equivalence relation connecting 𝑥, 𝑦
if {𝑛 ∈ 𝜔 ∶ 𝑥(𝑛) ≠ 𝑦(𝑛)} ∈ 𝐼. There is an identically defined equivalence
relation on (2𝜔 )𝜔 .
Borel equivalence relations are naturally ordered by Borel reducibility. In the case of
analytic equivalence relations, the Borel reducibility relation exhibits certain patholo-
gies, and it is best replaced by some of its strengthenings. This is the content of the
following definition.
Definition 1.7.3. Let 𝐸 and 𝐹 be analytic equivalence relations on respective Pol-
ish spaces 𝑋 and 𝑌 .
(1) 𝐸 is Borel reducible to 𝐹, in symbols 𝐸 ≤ 𝐹, if there is a Borel function ℎ ∶ 𝑋 →
𝑌 such that ∀𝑥0 , 𝑥1 ∈ 𝑋 𝑥0 𝐸 𝑥1 iff ℎ(𝑥0 ) 𝐹 ℎ(𝑥1 ).
(2) 𝐸 is almost Borel reducible to 𝐹, in symbols 𝐸 ≤𝑎 𝐹, if there exists a Borel

function ℎ ∶ 𝑋 → 𝑌 and a set 𝑍 ⊂ 𝑋 consisting of countably many 𝐸-classes
such that ∀𝑥0 , 𝑥1 ∈ 𝑋 ⧵ 𝑍 𝑥0 𝐸 𝑥1 iff ℎ(𝑥0 ) 𝐹 ℎ(𝑥1 ).
The most permissive comparison of equivalence relations is the one which compares
just the cardinalities of the quotient spaces. The following abuse of notation is used
throughout:
Definition 1.7.4. If 𝐸 is an equivalence relation on a Polish space 𝑋 then the

𝐸-quotient space is the set of all 𝐸-equivalence classes. Moreover, |𝐸| denotes the car-
dinality of the 𝐸-quotient space.
The Silver dichotomy shows that for a Borel equivalence relation 𝐸, |𝐸| is either count-
able or |2𝜔 | ≤ |𝐸|. In the context of the axiom of choice, the latter disjunct implies
that |𝐸| = |2𝜔 | since the quotient space 𝑋/𝐸 is a surjective image of 2𝜔 . In choiceless
context though, the dichotomies satisfying the latter disjunct may represent many dif-
ferent cardinalities, and this is the subject of study of several sections in this book. It
is clear that 𝐸 ≤ 𝐹 implies that |𝐸| ≤ |𝐹|, and in the context of the axiom of dependent
choices, 𝐸 ≤𝑎 𝐹 and |𝐹| is uncountable implies that |𝐸| ≤ |𝐹|.
Forcing. A great part of this book is devoted to forcing. The words forcing, poset, or
partially ordered set are treated as synonyms. A condition is any element of a partially
ordered set. We use the Boolean notation: 𝑞 ≤ 𝑝 means that the condition 𝑞 is stronger,
more informative than 𝑝. Now, let 𝑃 be a partially ordered set. For a set 𝐴 ⊂ 𝑃 and a
condition 𝑝 ∈ 𝑃, we write 𝑝 ≤ Σ𝐴 if for every condition 𝑞 ≤ 𝑝 there is a condition 𝑟 ≤ 𝑞
which is stronger than some element of 𝐴. The formula 𝑃 ⊩ 𝜙 denotes the statement
that every condition 𝑝 ∈ 𝑃, 𝑝 ⊩ 𝜙. Whenever 𝑃 is a partial ordering, 𝜏 is a 𝑃-name, and
𝐺 ⊂ 𝑃 is a generic filter, the symbol 𝜏/𝐺 denotes the valuation of the name 𝜏 according
to the filter 𝐺. In Chapter 11, we use the technology of finite support iterations of c.c.c.
posets. For the basic exposition of the definitions, see [51, Definition 16.8] or [7, Section
1.5]. Every Polish space 𝑋 and every analytic set 𝐴 ⊂ 𝑋 have a canonical interpretation
in every generic extension, which commutes with all usual descriptive set theoretic
operations on Polish spaces. For detailed theory of interpretations, see [116]; we will
use it without explicit mention as is customary in the current forcing practice. The
interpretations obey two basic absoluteness rules:
Fact 1.7.5. (Mostowski absoluteness) If 𝑀 ⊂ 𝑁 are transitive models of ZF plus DC

and 𝜙(𝑝)⃗ is a Σ11 -formula with parameters in 𝑀, then 𝑀 ⊧ 𝜙(𝑝)⃗ if and only if 𝑁 ⊧ 𝜙(𝑖𝑝)⃗
where 𝑖 is the interpretation operation.
Fact 1.7.6. (Shoenfield absoluteness) If 𝑀 ⊂ 𝑁 are transitive models of ZF plus DC

such that 𝜔1 ⊂ 𝑀 holds, and 𝜙(𝑝)⃗ is a Π12 -formula with parameters in 𝑀, then 𝑀 ⊧ 𝜙(𝑝)⃗
if and only if 𝑁 ⊧ 𝜙(𝑖𝑝)⃗ where 𝑖 is the interpretation operation.
In particular, intepretations of analytic equivalence relations are equivalence relations

again, interpretations of analytic partial orders are partial orders, and interpretations of
Polish groups and continuous Polish group actions on Polish spaces are Polish groups
and continuous Polish group actions again. Mutual relationships between forcing ex-
tensions of ZFC are captured in the following facts.
28 1. INTRODUCTION
Fact 1.7.7. If 𝑉 is a model of ZFC, 𝑉[𝐺] is a forcing extension of 𝑉, and 𝑀 is a model

of ZFC such that 𝑉 ⊂ 𝑀 ⊂ 𝑉[𝐺], then 𝑀 is a forcing extension of 𝑉 and 𝑉[𝐺] is a forcing
extension of 𝑀.
The book is loaded with product forcing notions. This section provides basic informa-
tion on products.
Fact 1.7.8. [51, Lemma 15.9] Let 𝑃, 𝑄 be posets and in some generic extension, let
𝐺 ⊂ 𝑃, 𝐻 ⊂ 𝑄 be filters separately generic over the ground model. The following are
equivalent:
(1) 𝐺 × 𝐻 ⊂ 𝑃 × 𝑄 is a filter generic over the ground model;
(2) 𝐺 ⊂ 𝑃 is generic over the model 𝑉[𝐻].
In the affirmative case, 𝑉[𝐺] ∩ 𝑉[𝐻] = 𝑉.
If 𝐺 × 𝐻 ⊂ 𝑃 × 𝑄 is a filter generic over the ground model, we say that the filters 𝐺, 𝐻
(or their generic extensions) are mutually generic.
The following humble observation greatly simplifies the methodology of product
forcing. It says that mutual genericity of forcing extensions can be characterized with-
out an appeal to the specific generic filters and posets that were used to obtain the
extensions, and indeed without any appeal to forcing at all.
Proposition 1.7.9. Let 𝑛 ∈ 𝜔 be a number and {𝑃𝑖 ∶ 𝑖 ∈ 𝑛} be posets. Let {𝐺𝑖 ∶ 𝑖 ∈
𝑛} be filters separately generic over the ground model 𝑉 over the respective posets. The
following are equivalent:
(1) ∏𝑖 𝐺𝑖 ⊂ ∏𝑖 𝑃𝑖 is a filter generic over 𝑉;
(2) whenever {𝑎𝑖 ∶ 𝑖 ∈ 𝑛} are subsets of the ground model in the respective models
𝑉[𝐺𝑖 ] such that ⋂𝑖 𝑎𝑖 = 0 then there are sets {𝑏𝑖 ∶ 𝑖 ∈ 𝑛} in the ground model
𝑉 such that for all 𝑖 ∈ 𝑛 𝑎𝑖 ⊂ 𝑏𝑖 and ⋂𝑖 𝑏𝑖 = 0 holds.
Proof. Suppose first that (1) holds. Move to the ground model 𝑉. Suppose that
{𝑎𝑖̇ ∶ 𝑖 ∈ 𝑛} are 𝑃𝑖 -names for subsets of the ground model and ⟨𝑝𝑖 ∶ 𝑖 ∈ 𝑛⟩ ∈ ∏𝑖 𝑃𝑖 is a
condition forcing that ⋂𝑖 𝑎𝑖 = 0. Let 𝑏𝑖 = {𝑥 ∈ 𝑉 ∶ ∃𝑝′ ≤ 𝑝𝑖 𝑝′ ⊩𝑃𝑖 𝑥̌ ∈ 𝑎𝑖̇ } for each
𝑖 ∈ 𝑛. It is immediate that ⋂𝑖 𝑏𝑖 = 0 holds, and for all 𝑖 ∈ 𝑛 and 𝑝𝑖 ⊩𝑃𝑖 𝑎𝑖̇ ⊂ 𝑏𝑖̌ holds.
(2) then follows by the forcing theorem.
Suppose now that (2) holds. To confirm (1), suppose towards a contradiction that
it fails. There must be an open dense set 𝐷 ⊂ ∏𝑖 𝑃𝑖 in the ground model such that
∏𝑖 𝐺𝑖 ∩ 𝐷 = 0. For every number 𝑖 ∈ 𝑛, in the model 𝑉[𝐺𝑖 ] consider the set 𝑎𝑖 =
{⟨𝑝𝑗 ∶ 𝑗 ∈ 𝑛⟩ ∈ 𝐷 ∶ 𝑝𝑖 ∈ 𝐺𝑖 } ⊂ ∏𝑗 𝑃𝑗 . The contradictory assumption gives that ⋂𝑖 𝑎𝑖 =
0; the assumption (2) yields sets 𝑏𝑖 ⊂ ∏𝑖 𝑃𝑖 in the ground model such that ∀𝑖 ∈ 𝑛 𝑎𝑖 ⊂ 𝑏𝑖
and ⋂𝑖 𝑏𝑖 = 0. In each model 𝑉[𝐺𝑗 ], a genericity argument shows that there must be a
condition 𝑟𝑗 ∈ 𝐺𝑗 such that every tuple ⟨𝑝𝑖 ∶ 𝑖 ∈ 𝑛⟩ ∈ 𝐷 with 𝑝𝑗 ≤ 𝑟𝑗 must in fact belong
to the set 𝑏𝑗 . Use the density of the set 𝐷 to find a tuple ⟨𝑝𝑖 ∶ 𝑖 ∈ 𝑛⟩ ∈ 𝐷 such that for
all 𝑖 ∈ 𝑛, 𝑝𝑖 ≤ 𝑟𝑖 holds. Then ⟨𝑝𝑖 ∶ 𝑖 ∈ 𝑛⟩ ∈ ⋃𝑖 𝑏𝑖 , contradicting the choice of the sets
𝑏𝑖 for 𝑖 ∈ 𝑛. □
The following corollary is easy to prove without the proposition, but its present proof
is much more appealing:
Corollary 1.7.10. Let 𝑛 ∈ 𝜔 be a natural number. Suppose that {𝑃𝑖 ∶ 𝑖 ∈ 𝑛} are
posets, {𝑄𝑖 ∶ 𝑖 ∈ 𝑛} are posets, ∏𝑖 𝐺𝑖 ⊂ ∏𝑖 𝑃𝑖 is a generic filter, and for each 𝑖 ∈ 𝑛 𝐻𝑖 ∈
𝑉[𝐺𝑖 ] is a filter generic over 𝑉 on the poset 𝑄𝑖 . Then ∏𝑖 𝐻𝑖 ⊂ ∏𝑖 𝑄𝑖 is a filter generic over
𝑉.
Proof. The criterion (2) of Proposition 1.7.9 is preserved when passing to smaller
models, in particular from 𝑉[𝐺𝑖 ] to 𝑉[𝐻𝑖 ]. □
The following feature of mutually generic extensions plays a key role in several argu-
ments in this book.
Proposition 1.7.11. Let 𝑋0 , 𝑋1 be Polish spaces, 𝐴1 ⊂ 𝑋1 be an analytic set, 𝐶 ⊂
𝑋0 × 𝑋1 be an 𝐹𝜍 -set, 𝑉[𝐺0 ], 𝑉[𝐺1 ] be mutually generic extensions, 𝑥0 ∈ 𝑋0 ∩ 𝑉[𝐺0 ] and
𝑥1 ∈ 𝐴1 ∩𝑉[𝐺1 ] be points. If ⟨𝑥0 , 𝑥1 ⟩ ∈ 𝐶 then there is 𝑥1′ ∈ 𝐴1 ∩𝑉 such that ⟨𝑥0 , 𝑥1′ ⟩ ∈ 𝐶.
It is not possible to generalize this statement to 𝐺𝛿 sets. Let 𝐶 ⊂ 𝜔𝜔 ×𝜔𝜔 be the set of all
pairs ⟨𝑥0 , 𝑥1 ⟩ such that for infinitely many 𝑛 ∈ 𝜔 𝑥0 (𝑛) ∈ 𝑥1 (𝑛). This is a 𝐺𝛿 -set. Let 𝑃
be a poset and 𝜎 a 𝑃-name for a dominating element of 𝜔𝜔 . Let 𝐺0 , 𝐺1 ⊂ 𝑃 be mutually
generic filters and let 𝑥0 = 𝜎/𝐺0 and 𝑥1 = 𝜎/𝐺1 . A simple genericity argument shows
that ⟨𝑥0 , 𝑥1 ⟩ ∈ 𝐶 holds. At the same time, there is no element 𝑥1′ ∈ 𝜔𝜔 ∩ 𝑉 such that
⟨𝑥0 , 𝑥1′ ⟩ ∈ 𝐶 by the choice of the name 𝜎.
Proof. Work in the ground model. First of all, finding a continuous surjection
𝑓 ∶ 𝜔𝜔 → 𝐴1 and replacing 𝑋1 with 𝜔𝜔 and 𝐶 with its 𝑓-preimage if necessary, it be-
comes clear that we may assume 𝐴1 = 𝑋1 . Express 𝐶 as a countable union ⋃𝑛 𝐶𝑛 of
closed subsets of 𝑋0 ×𝑋1 . Let 𝑃0 , 𝑃1 be posets and 𝜎0 , 𝜎1 be 𝑃0 - and 𝑃1 - names for elements
of 𝑋0 and 𝑋1 respectively, and let 𝑛 ∈ 𝜔 be a number such that 𝑃0 × 𝑃1 ⊩ ⟨𝜎0 , 𝜎1 ⟩ ∈ 𝐶𝑛 .
We will produce a point 𝑥1′ ∈ 𝑋1 such that 𝑃0 ⊩ ⟨𝜎0 , 𝑥1′̌ ⟩ ∈ 𝐶𝑛 . By the forcing theorem,
this will prove the proposition.
First of all, there must be a point 𝑥 ∈ 𝑋1 such that for every open neighborhood
𝑂 ⊂ 𝑋1 of 𝑥 there is a condition 𝑝1 ∈ 𝑃1 such that 𝑝1 ⊩ 𝜎1 ∈ 𝑂. If this failed, then
𝑋1 would be covered by countably many open sets 𝑂 ⊂ 𝑋1 such that 𝑃1 ⊩ 𝜎1 ∉ 𝑂,
which would leave no place in 𝑋1 where 𝜎1 could land. Let 𝑥1′ ∈ 𝑋1 be such a point;
we claim that 𝑃0 ⊩ ⟨𝜎0 , 𝑥1′̌ ⟩ ∈ 𝐶𝑛 holds. If not, there would have to be a condition
𝑝0 ∈ 𝑃0 and open sets 𝑂0 ⊂ 𝑋0 and 𝑂1 ⊂ 𝑋1 such that (𝑂0 × 𝑂1 ) ∩ 𝐶𝑛 = 0, 𝑥1′ ∈ 𝑂1 , and
𝑝0 ⊩ 𝜎0 ∈ 𝑂0 . Use the choice of 𝑥1′ to find a condition 𝑝1 ∈ 𝑃1 such that 𝑝1 ⊩ 𝜎1 ∈ 𝑂1 .
Then in the product, ⟨𝑝0 , 𝑝1 ⟩ ⊩ ⟨𝜎0 , 𝜎1 ⟩ ∈ 𝑂0 × 𝑂1 and ⟨𝜎0 , 𝜎1 ⟩ ∉ 𝐶𝑛̇ . This contradicts
the initial assumptions on the names 𝜎0 , 𝜎1 . □
The final remark on the product forcing provides a perfect set of generics over any
countable model–a standard trick which comes handy in several places in the book.
Proposition 1.7.12. Let 𝑀 be a countable transitive model of set theory and 𝑃 ∈ 𝑀
be a poset. Then there is a continuous map ℎ ∶ 2𝜔 → 𝒫(𝑃) such that for every finite set
𝑎 ⊂ 2𝜔 , the product ∏𝑥∈𝑎 ℎ(𝑥) is a filter on the poset 𝑃|𝑎| generic over the model 𝑀.
Proof. Let ⟨𝐷𝑛 ∶ 𝑛 ∈ 𝜔⟩ be an enumeration of all open dense subsets of various
finite powers of 𝑃 which appear in the model 𝑀. By induction on 𝑚 ∈ 𝜔 build maps
𝑔𝑚 ∶ 2𝑚 → 𝑃 satisfying the following demands:
• 𝑔0 ∶ {0} → 𝑃 is arbitrary;
• for every 𝑚 ∈ 𝜔, every 𝑠 ∈ 2𝑚 and every 𝑡 ∈ 2𝑚+1 such that 𝑠 ⊂ 𝑡, 𝑔𝑚+1 (𝑡) ≤
𝑔𝑚 (𝑠) holds;
30 1. INTRODUCTION
• for every 𝑚 ∈ 𝜔 and every 𝑛 ≤ 𝑚, if 𝐷𝑛 ⊂ 𝑃 𝑘 is a set for some 𝑘 ≤ 2𝑚+1 and

⟨𝑡𝑖 ∶ 𝑖 ∈ 𝑘⟩ is a sequence of distinct elements of 2𝑚+1 , then ⟨𝑔𝑚+1 (𝑡𝑖 ) ∶ 𝑖 ∈
𝑘⟩ ∈ 𝐷 holds.
This is easy to arrange as the last item requires meeting only finitely many open dense
sets. In the end, let ℎ ∶ 2𝜔 → 𝒫(𝜔) be the continuous function defined by setting ℎ(𝑥)
to be the filter generated by the set {𝑔𝑚 (𝑥 ↾ 𝑚) ∶ 𝑚 ∈ 𝜔}, and check that the demands
of the theorem are satisfied. □
There are several standard forcing notions used throughout:
Definition 1.7.13.
(1) If 𝑋 is a set then Coll(𝜔, 𝑋) is the poset of finite partial functions from 𝜔 to 𝑋
ordered by reverse extension;
(2) if 𝜅 is a cardinal then Coll(𝜔, < 𝜅) is the finite support product of the posets
Coll(𝜔, 𝛼) for all 𝛼 ∈ 𝜅;
(3) if 𝑋 is a topological space then 𝑃𝑋 is the poset of all nonempty open subsets
of 𝑋 ordered by inclusion. If 𝑋 is in addition Polish, then 𝑥𝑔𝑒𝑛 ̇ denotes the
𝑃𝑋 -name for the generic point of 𝑃𝑋 –the unique element of the interpretation
of the Polish space 𝑋 in the 𝑃𝑋 -extension which belongs to all open sets in the
generic filter.
The collapse poset obeys an important factoring rule:
Fact 1.7.14. [51, Corollary 26.11] Let 𝜆 be a cardinal and let 𝑃 be a poset of size < 𝜆.
Suppose that 𝐺 ⊂ Coll(𝜔, 𝜆) is a generic filter and in 𝑉[𝐺], 𝐻 ⊂ 𝑃 is a filter generic over
𝑉. Then there is a filter 𝐾 ⊂ Coll(𝜔, 𝜆) generic over 𝑉[𝐻] such that 𝑉[𝐺] = 𝑉[𝐻][𝐾].
Let 𝜅 be an inaccessible cardinal. The symmetric Solovay model derived from 𝜅

is obtained as follows. Let 𝐺 ⊂ Coll(𝜔, < 𝜅) be a generic filter and in 𝑉[𝐺], form
𝑉 [𝐺]
the model HOD𝑉 ∪𝒫(𝜔) of all sets hereditarily definable from reals and elements of the
ground model. This is the symmetric Solovay model; we will always denote it by 𝑊,
neglecting the dependence on 𝜅 and the filter 𝐺 in the notation. The theory of the
Solovay model has been thoroughly investigated throughout the years. We note the
following:
Fact 1.7.15. [100] In 𝑊, ZF+DC holds, every set has the Baire property and is
Lebesgue measurable, and there is no uncountable well-ordered sequence of distinct Borel
sets of bounded Borel rank.
During the investigation of the symmetric Solovay model, the following technical fact
and its corollary about the symmetric Solovay model will be used without mention.
Fact 1.7.16. [51, Section 26] Let 𝜅 be an inaccessible cardinal and let 𝑊 be the
symmetric Solovay extension of 𝑉 associated with 𝜅. Then the following holds in 𝑊:
(1) every set is definable from parameters in 𝑉 ∪ 2𝜔 ;
(2) whenever 𝑀 is a generic extension of 𝑉 by a partial order of cardinality smaller
than 𝜅 then 𝑊 is a symmetric Solovay extension of 𝑀;
(3) whenever 𝑎 is a set of ordinals then 𝑉[𝑎] is a generic extension of 𝑉 by a poset
of cardinality smaller than 𝜅.
Corollary 1.7.17. Suppose that 𝜅 is an inaccessible cardinal, 𝑋 is a Polish space,

𝜙(𝑥, 𝑦)⃗ is a formula of set theory with all free variables displayed, and 𝑝 ⃗ is a sequence of
sets of the same length as 𝑦.⃗ The following are equivalent:
(1) Coll(𝜔, < 𝜅) ⊩ ∃𝑥 ∈ 𝑋 𝜙(𝑥, 𝑝); ⃗
(2) there exist a poset 𝑅 of cardinality smaller than 𝜅 and an 𝑅-name 𝜎 for an ele-
ment of 𝑋 such that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜙(𝜎, 𝑝). ⃗
Many models of set theory we investigate are extensions of the symmetric Solovay
model by a suitably definable, typically Suslin, forcing. Since the instrumental proper-
ties of the Suslin forcing in question may not be absolute between forcing extensions,
we use the following key convention to shorten the statements of the results we obtain.
Convention 1.7.18. Let 𝜓 be a property of partial orders, and let 𝜙 be a sentence
in the language of set theory.
(1) For a Suslin forcing 𝑃 and an inaccessible cardinal 𝜅, the statement “𝑃 is 𝜓
below 𝜅” means that 𝑉𝜅 ⊧ 𝜓(𝑃) holds in every forcing extension”. The state-
ment “𝑃 is 𝜓 cofinally below 𝜅” means that 𝑉𝜅 ⊧every forcing extension has a
further extension in which 𝜓(𝑃) holds”.
(2) The phrase “In 𝜓 extensions of the Solovay model, 𝜙 holds” denotes the fol-
lowing long statement. Let 𝑃 be a Suslin forcing and let 𝜅 be an inaccessible
cardinal such that 𝑃 is 𝜙 below 𝜅. Let 𝑊 be a symmetric Solovay model de-
rived from 𝜅. Let 𝐺 ⊂ 𝑃 be a filter generic over 𝑊. Then 𝑊[𝐺] ⊧ 𝜙 holds.
(3) The phrase “In cofinally 𝜓 extensions of the Solovay model, 𝜙 holds” denotes
the following statement. Let 𝑃 be a Suslin forcing. Let 𝜅 be an inaccessible
cardinal. Suppose that 𝑃 is 𝜓 cofinally below 𝜅. Let 𝑊 be a symmetric Solovay
model derived from 𝜅. Let 𝐺 ⊂ 𝑃 be a filter generic over 𝑊. Then 𝑊[𝐺] ⊧ 𝜙
holds.
In several cases, we will need the basics of the stationary tower forcing.
Definition 1.7.19. [72] Let 𝜅 be an inaccessible cardinal. The symbol ℚ𝜅 denotes
the (countably based) stationary tower up to 𝜅. That is, ℚ𝜅 consists of sets 𝑆 such that
𝑆 ⊂ [dom(𝑆)]ℵ0 is stationary and dom(𝑆) ∈ 𝑉𝜅 . The ordering is defined by 𝑇 ≤ 𝑆
if dom(𝑆) ⊂ dom(𝑇) and {𝑥 ∩ dom(𝑆) ∶ 𝑥 ∈ 𝑇} ⊂ 𝑆. If 𝐺 ⊂ ℚ𝜅 is a generic filter,
𝑗 ∶ 𝑉 → 𝑀 denotes the generic ultrapower derived from 𝐺.
Fact 1.7.20. [72] Let 𝜅 be an inaccessible cardinal, 𝐺 ⊂ ℚ𝜅 be a generic filter, and
𝑗 ∶ 𝑉 → 𝑀 be the generic embedding.
𝑉 [𝐺]
(1) If 𝜅 is a Woodin cardinal in the ground model, then 𝜅 = 𝜔1 and 𝑀 𝜔 ⊂ 𝑀 in
𝑉[𝐺]. In particular, 𝑀 is well-founded.
(2) If 𝜅 is a weakly compact Woodin cardinal in the ground model, then for every
𝑧 ∈ 2𝜔 in 𝑉[𝐺] there is a Woodin cardinal 𝜆 < 𝜅 such that 𝐺∩ℚ𝜆 is generic over
𝑉 and 𝑧 ∈ 𝑉[𝐺 ∩ ℚ𝜆 ]. In particular, the model 𝑊 = 𝑉(ℝ𝑉 [𝐺] ) is a symmetric
Solovay extension of 𝑉 derived from 𝜅.
As a matter of notation, if the generic ultrapower model 𝑀 is well-founded, it is always
identified with its transitive collapse.
Part I
Equivalence relations
CHAPTER 2
The virtual realm
There are many quotient structures in mathematics. It turns out that a typical quo-
tient structure allows a useful canonical extension to its virtual version. The purpose
of this chapter is to lay the foundations of the theory of virtual structures.
2.1. Virtual equivalence classes

The basis of any quotient structure of interest in the present book is a Polish space
𝑋. A quotient structure worth its salt will also use an equivalence relation 𝐸 on the
underlying Polish space. In this section we indicate how to extend the 𝐸-quotient space
in a canonical way to a potentially much larger set or class.
Definition 2.1.1. [54, Definition 17.1.2] Let 𝐸 be an analytic equivalence relation
on a Polish space 𝑋. Let 𝑃 be a poset and 𝜏 a 𝑃-name for an element of 𝑋.
(1) The name 𝜏 is 𝐸-pinned if 𝑃 × 𝑃 ⊩ 𝜏left 𝐸 𝜏right ;
(2) if 𝜏 is 𝐸-pinned, then the pair ⟨𝑃, 𝜏⟩ will be called an 𝐸-pin.
The definition may puzzle a novice reader. Its meaning is best illustrated by the fol-
lowing proposition. An 𝐸-pinned name is one which in all forcing extensions points
at the same 𝐸-class, even though that 𝐸-class may not have any representative in the
ground model.
Proposition 2.1.2. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋.
Let 𝑃 be a poset and 𝜏 a 𝑃-name for an element of 𝑋. The following are equivalent:
(1) ⟨𝑃, 𝜏⟩ is an 𝐸-pin;
(2) in every forcing extension, if 𝐺0 , 𝐺1 ⊂ 𝑃 are filters separately generic over the
ground model, then 𝜏/𝐺0 𝐸 𝜏/𝐺1 holds.
Proof. (2) immediately implies (1) by considering the 𝑃×𝑃 extension. To see how
(1) implies (2), suppose that 𝑉[𝐻] is a forcing extension and in 𝑉[𝐻] there are filters
𝐺0 , 𝐺1 ⊂ 𝑃 separately generic over 𝑉. Let 𝐺2 ⊂ 𝑃 be a filter generic over 𝑉[𝐻]. By the
product forcing theorem, 𝐺0 , 𝐺2 ⊂ 𝑃 are mutually generic filters, and so are 𝐺1 , 𝐺2 ⊂ 𝑃.
Applying the assumption (1), we see that 𝜏/𝐺0 𝐸 𝜏/𝐺2 𝐸 𝜏/𝐺1 , so 𝜏/𝐺0 𝐸 𝜏/𝐺1 by the
transitivity of the equivalence relation 𝐸. □
The following is the archetypal example of a non-trivial pinned name.
Example 2.1.3. Consider the poset 𝑃 = Coll(𝜔, 2𝜔 ) and its name 𝜏 for the generic
surjection from 𝜔 to (2𝜔 )𝑉 . The name 𝜏 is 𝔽2 -pinned since no matter which generic
filter 𝐺 ⊂ 𝑃 one selects, the range of 𝜏/𝐺 is the same: it is the set (2𝜔 )𝑉 . Clearly, it is a
nontrivial name since the set 2𝜔 is uncountable, so there is no ground model element
of (2𝜔 )𝜔 that can enumerate it and be equivalent to 𝜏.
35
36 2. THE VIRTUAL REALM
Given an analytic equivalence relation 𝐸 on a Polish space 𝑋, the 𝐸-pinned names

form a seemingly inexhaustible and complicated class. However, this class admits a
natural equivalence relation which usually greatly clarifies matters:
Definition 2.1.4. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋.
Suppose that ⟨𝑃, 𝜏⟩ and ⟨𝑄, 𝜎⟩ are 𝐸-pins. Define ⟨𝑃, 𝜏⟩ 𝐸̄ ⟨𝑅, 𝜎⟩ if 𝑃 × 𝑄 ⊩ 𝜏 𝐸 𝜎.
Proposition 2.1.5. The relation 𝐸̄ is an equivalence. If 𝑃, 𝑄 are posets with 𝐸-
pinned names 𝜏, 𝜎 on them, the following are equivalent:
(1) ⟨𝑃, 𝜏⟩ 𝐸̄ ⟨𝑄, 𝜎⟩;
(2) in every forcing extension, if 𝐺 ⊂ 𝑃 and 𝐻 ⊂ 𝑄 are filters separately generic over
the ground model, then 𝜏/𝐺 𝐸 𝜎/𝐻 holds.
Proof. 𝐸̄ is clearly symmetric and reflexive by its definition. To see the transitiv-
ity, suppose that ⟨𝑃0 , 𝜏0 ⟩ 𝐸̄ ⟨𝑃1 , 𝜏1 ⟩ 𝐸̄ ⟨𝑃2 , 𝜏2 ⟩. This means that 𝑃0 × 𝑃1 × 𝑃2 ⊩ 𝜏0 𝐸 𝜏1 𝐸 𝜏2 ,
and by the transitivity of the equivalence relation 𝐸, 𝑃0 × 𝑃1 × 𝑃2 ⊩ 𝜏0 𝐸 𝜏2 . By the
Mostowski absoluteness between the 𝑃0 × 𝑃1 × 𝑃2 extension and 𝑃0 × 𝑃2 extension, it is
the case that 𝑃0 × 𝑃2 ⊩ 𝜏0 𝐸 𝜏2 and consequently ⟨𝑃0 , 𝜏0 𝐸̄ ⟨𝑃2 , 𝜏2 ⟩.
Now, (2) immediately implies (1) by considering the 𝑃 × 𝑄 extension. To see how
(1) implies (2), suppose that 𝑉[𝐾] is a forcing extension and in 𝑉[𝐾] there are filters
𝐺 ⊂ 𝑃, 𝐻 ⊂ 𝑄 separately generic over 𝑉. Let 𝐻 ′ ⊂ 𝑄 be a filter generic over 𝑉[𝐾].
By the product forcing theorem, 𝐺, 𝐻 ′ are mutually generic filters, and so are 𝐻, 𝐻 ′ .
Applying the assumption (1), we see that 𝜏/𝐺 𝐸 𝜎/𝐻 ′ 𝐸 𝜎/𝐻, so 𝜏/𝐺 𝐸 𝜎/𝐻 by the
transitivity of the equivalence relation 𝐸. □
̄
(1) The 𝐸-classes are referred to as the virtual 𝐸-classes;
(2) if 𝑧 is a virtual 𝐸-class and in some generic extension 𝑉[𝐺] 𝑦 is an 𝐸-class,
we say that 𝑦 is a realization of 𝑧 if for some (equivalently, all) representatives
⟨𝑃, 𝜏⟩ ∈ 𝑧 and 𝑥 ∈ 𝑦, 𝑉[𝐺] ⊧ 𝑃 ⊩ 𝜏 𝐸 𝑥̌ holds.
The following proposition is used throughout this book. It says that 𝐸-classes repre-
sented in mutually generic extensions must be realizations of a virtual 𝐸-class in the
ground model.
Proposition 2.1.7. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋.
Let 𝑃0 , 𝑃1 be partial orders and 𝐺0 ⊂ 𝑃0 and 𝐺1 ⊂ 𝑃1 be mutually generic filters. If
𝑥0 ∈ 𝑉[𝐺0 ] and 𝑥1 ∈ 𝑉[𝐺1 ] are 𝐸-equivalent points then [𝑥0 ]𝐸 is the realization of
some virtual 𝐸-class from the ground model.
Proof. Suppose that 𝑝0 ∈ 𝑃0 , 𝑝1 ∈ 𝑃1 , 𝜏0 is a 𝑃0 -name and 𝜏1 is a 𝑃1 -name such that
⟨𝑝0 , 𝑝1 ⟩ ⊩ 𝜏0 𝐸 𝜏1 . It immediately follows that 𝜏0 must be an 𝐸-pinned name on the
poset 𝑃 ↾ 𝑝0 so 𝑝0 forces [𝜏0 ]𝐸 to be the realization of the virtual 𝐸-class represented
by the pair ⟨𝑃 ↾ 𝑝0 , 𝜏0 ⟩. □
The main question surrounding the virtual 𝐸-classes is whether they can be classi-
fied in some informative way. Is there a proper class of virtual 𝐸-classes or just a set? If
there is just a set, what is its cardinality? Do virtual 𝐸-classes correspond to some more
tangible combinatorial objects? This chapter contains many good answers to similar
questions, even though many problems remain unsolved.
2.2. VIRTUAL STRUCTURES 37
2.2. Virtual structures

It is now possible to define virtual versions of quotient structures on Polish spaces.
Definition 2.2.1. An analytic quotient structure is a tuple ℳ = ⟨𝑋, 𝐸, 𝑅𝑖 ∶ 𝑖 ∈
𝜔, 𝑓𝑗 ∶ 𝑗 ∈ 𝜔⟩ where
(1) 𝑋 is a Polish space;
(2) 𝐸 is an analytic equivalence relation on 𝑋;
(3) for every 𝑖 ∈ 𝜔, 𝑅𝑖 ⊂ 𝑋 𝑛𝑖 is an analytic relation which is invariant under 𝐸;
(4) for every 𝑗 ∈ 𝜔, 𝑓𝑗 ⊂ 𝑋 𝑚𝑗 +1 is an analytic relation which is invariant under
𝐸, and in the 𝐸-quotient space it is a graph of a function.
The quotient structure ℳ is Borel if all the relations above including 𝐸 are Borel.
There are many popular examples of analytic quotient structures. If ⟨𝐺, ⋅⟩ is a Pol-
ish group and 𝐻 ⊂ 𝐺 is an analytic normal subgroup, one can form the quotient group
𝐺/𝐻. If ⟨𝑋, ≤⟩ is an analytic partial ordering, one can form the separative quotient
under the assumption that the quotient equivalence relation is analytic. Embeddabil-
ity of countable structures forms an ordering on the quotients space of all countable
structures modulo the equivalence relation of biembeddability etc.
If ℳ = ⟨𝑋, 𝐸, 𝑅𝑖 ∶ 𝑖 ∈ 𝜔, 𝑓𝑗 ∶ 𝑗 ∈ 𝜔⟩ is an analytic quotient structure, then we write
ℳ ∗ = ⟨𝑋 ∗ , 𝑅∗𝑖 ∶ 𝑖 ∈ 𝜔, 𝑓𝑗 ∗ ∶ 𝑗 ∈ 𝜔⟩ for its associated structure on the actual quotient
space 𝑋/𝐸 of all 𝐸-classes.
Definition 2.2.2. Let ℳ = ⟨𝑋, 𝐸, 𝑅𝑖 ∶ 𝑖 ∈ 𝜔, 𝑓𝑗 ∶ 𝑗 ∈ 𝜔⟩ be an analytic quotient
structure. The virtual version of ℳ is the tuple ℳ ∗∗ = ⟨𝑋 ∗∗ , 𝑅𝑖∗∗ ∶ 𝑖 ∈ 𝜔, 𝑓𝑗 ∗∗ ∶ 𝑗 ∈ 𝜔⟩
where
(1) 𝑋 ∗∗ is the set or class of all virtual 𝐸-classes;
(2) for each 𝑖 ∈ 𝜔, 𝑅𝑖∗∗ is the relation on 𝑋 ∗∗ of arity 𝑛𝑖 given by ⟨⟨𝑄𝑘 , 𝜏𝑘 ⟩ ∶ 𝑘 ∈
𝑛𝑖 ⟩ ∈ 𝑅𝑖∗∗ if ∏𝑘 𝑄𝑘 ⊩ ⟨𝜏𝑘 ∶ 𝑘 ∈ 𝑛𝑖 ⟩ ∈ 𝑅̇ 𝑖 ;
(3) for each 𝑗 ∈ 𝜔, 𝑓𝑗 ∗∗ is the relation on 𝑋 ∗∗ of arity 𝑚𝑗 +1 given by ⟨⟨𝑄𝑘 , 𝜏𝑘 ⟩ ∶ 𝑘 ∈
𝑚𝑗 + 1⟩ ∈ 𝑓𝑗 ∗∗ if ∏𝑘 𝑄𝑘 ⊩ ⟨𝜏𝑘 ∶ 𝑘 ∈ 𝑚𝑗 + 1⟩ ∈ 𝑓𝑗 .̇
The first proposition says that Definition 2.2.2 is sound and that we receive a struc-
ture with the same signature as the original one:
Proposition 2.2.3. The definition of 𝑅𝑖∗∗ and 𝑓𝑗 ∗∗ does not depend on the choice of
representatives of the virtual classes. Moreover, 𝑓𝑗 is a graph of a (total) function.
Proof. The statements “𝑅𝑖 , 𝑓𝑗 are 𝐸-invariant relations” and “𝑓𝑗 is a graph of a
total function in the quotient” are 𝚷12 ; therefore, they are absolute between 𝑉 and all
forcing extensions. The first sentence of the proposition immediately follows. For the
second sentence, suppose that the function 𝑓𝑗 has arity 𝑚𝑗 and ⟨⟨𝑄𝑘 , 𝜏𝑘 ⟩ ∶ 𝑘 ∈ 𝑚𝑗 ⟩ is
a tuple of 𝐸-pins. Let 𝑄 = ∏𝑘 𝑄𝑘 and let 𝜏 be a 𝑄-name for an element of 𝑋 such
that 𝑓𝑗 (𝜏𝑘 ∶ 𝑘 ∈ 𝑚𝑗 , 𝜏) is forced to hold. Since in the 𝑄 × 𝑄-extension, 𝑓𝑗 is a graph of a
function on the quotient and the names 𝜏𝑘 for 𝑘 ∈ 𝑚𝑗 are 𝐸-pinned, it follows that the
name 𝜏 is 𝐸-pinned as well. Clearly, the tuple ⟨⟨𝑄𝑘 , 𝜏𝑘 ⟩ ∶ 𝑘 ∈ 𝑚𝑗 , ⟨𝑄, 𝜏⟩⟩ belongs to 𝑓𝑗 ∗∗
and the second sentence of the proposition follows. □
In the case of an analytic quotient structure, it is possible that its virtual version
is a proper class. In particular, it is possible to express the whole ordinal axis as an
isomorph of a virtual version of an analytic quotient structure–Example 2.4.6. How-

ever, if the equivalence relation 𝐸 is Borel then the virtual version is a set of cardinality
smaller than ℶ𝜔1 by Theorem 2.5.6. In any case, it is possible to stratify ℳ ∗∗ into set
sized pieces:
Definition 2.2.4. Let ℳ = ⟨𝑋, 𝐸, 𝑅𝑖 ∶ 𝑖 ∈ 𝜔, 𝑓𝑗 ∶ 𝑗 ∈ 𝜔⟩ be an analytic quotient

structure. ℳ𝜅∗∗ is the substructure of ℳ ∗∗ consisting of the virtual 𝐸-classes repre-
sented by names on Coll(𝜔, 𝜅).
A proof identical to that of Proposition 2.2.3 shows that ℳ𝜅∗∗ is closed under all
functions of ℳ ∗∗ so it is truly a substructure of ℳ ∗∗ . An elementary name-counting
argument shows that for each infinite 𝜅, the structure ℳ𝜅∗∗ has size at most 2𝜅 . If 𝜅 ≤
𝜆 are cardinals then Coll(𝜔, 𝜅) is regularly embedded in Coll(𝜔, 𝜆) so ℳ𝜅∗∗ ⊆ ℳ𝜆∗∗ .
Every poset is regularly embedded in Coll(𝜔, 𝜅) for some 𝜅 so ℳ ∗∗ decomposes into a
monotone union ⋃𝜅 ℳ𝜅∗∗ .
For each analytic quotient structure ℳ, there is a canonical embedding 𝜋 ∶ ℳ ∗ →
∗∗
ℳ which maps each class [𝑥]𝐸 to the virtual 𝐸-class of ⟨𝑄, 𝑥⟩̌ for a trivial poset 𝑄.
The most important fact about the virtual structures is that there is some degree of
elementarity:
Proposition 2.2.5. The embedding 𝜋 ∶ ℳ ∗ → ℳ ∗∗ is Π1 -elementary.
Proof. Let 𝜅 be a cardinal, and let 𝐺 ⊂ Coll(𝜔, 𝜅) be a generic filter. In the model
𝑉[𝐺], let 𝜒 ∶ (ℳ𝜅∗∗ )𝑉 → (ℳ ∗ )𝑉 [𝐺] be the map sending a virtual 𝐸-class in (ℳ𝜅∗∗ )𝑉 to
𝜋 𝜒
its realization. Thus, we have maps (ℳ ∗ )𝑉 → (ℳ𝜅∗∗ )𝑉 → (ℳ ∗ )𝑉 [𝐺] . The composition
𝜒 ∘ 𝜋 sends each equivalence class in 𝑉 to its interpretation in 𝑉[𝐺].
Let 𝜙 be a Π1 formula in ℒ𝜔1 𝜔 logic with possible parameters such that ℳ ∗ ⊧ 𝜙.
The statement ℳ ∗ ⊧ 𝜙 is a 𝚷12 sentence about the structure ℳ, and by Shoenfield
absoluteness it transfers from the ground model 𝑉 to the generic extension 𝑉[𝐺]. Thus,
the map 𝜒 ∘ 𝜋 is a Π1 elementary embedding from (ℳ ∗ )𝑉 to (ℳ ∗ )𝑉 [𝐺] . It follows that
the map 𝜋 ∶ ℳ ∗ → ℳ𝜅∗∗ in 𝑉 must be a Π1 -elementary embedding. Since 𝑀 ∗∗ is an
increasing union ⋃𝜅 ℳ𝜅∗∗ , the proposition follows. □
In particular, if the original quotient structure was a group, a partial order, or an

acyclic graph, its virtual version maintains these properties. However, it is important to
understand that the embedding does not have to be Σ2 -elementary, so virtual versions
of connected graphs may become disconnected, virtual versions of divisible groups may
not be divisible anymore, and virtual versions of nonatomic partial orders may have
atoms.
Example 2.2.6. Let 𝑅 be the relation on 𝑋 = (2𝜔 )𝜔 defined by 𝑥0 𝑅 𝑥1 if rng(𝑥0 ) ⊆

rng(𝑥1 ). Clearly, the tuple ⟨𝑋, 𝔽2 , 𝑅⟩ is an analytic quotient structure. The relation 𝑅∗
is a partial order on 𝑋 ∗ without largest element. At the same time, the relation 𝑅∗∗ on
𝑋 ∗∗ does have the largest element, namely the 𝔽2 -pin presented in Example 2.1.3: the
pin corresponding to the name for a generic enumeration of 2𝜔 in ordertype 𝜔. This
follows immediately from the classification of 𝔽2 -pins in Example 2.3.5 below.
2.3. CLASSIFICATION: GENERAL THEOREMS 39
2.3. Classification: general theorems

In this section, we provide a number of general classification theorems for virtual
equivalence classes. The theorems are all of the same type: if 𝐹 is an analytic equiv-
alence relation which is obtained from another equivalence relation 𝐸 using a certain
operation, then all virtual 𝐹-classes are obtained from virtual 𝐸-classes using a similar
operation. This will provide a suitable background to the investigation of specific cases
in Section 2.4.
To start with, a great many analytic equivalence relations yield only utterly unin-
teresting virtual classes: only those already realized in the ground model. This phe-
nomenon is isolated in the following definition.
Definition 2.3.1. [54, Definition 17.1.2] Let 𝐸 be an analytic equivalence relation
on a Polish space 𝑋. A virtual 𝐸-class represented by ⟨𝑃, 𝜏⟩ is trivial if there is 𝑥 ∈ 𝑋
such that 𝑃 ⊩ 𝜏 𝐸 𝑥.̌ The equivalence relation 𝐸 is pinned if it has only trivial virtual
classes.
The class of pinned equivalence relations has been investigated for a number of years.
The basic pre-existing knowledge about this class is subsumed in the following fact.
Fact 2.3.2. [54, Theorem 17.1.3] The analytic equivalence relations in the following
classes are pinned:
(1) orbit equivalence relations generated by actions of Polish cli groups;
(2) Borel equivalence relations with all classes 𝚺03 ;
(3) equivalence relations Borel reducible to pinned ones.
The operation on equivalence relations which has the most informative translation into
virtual classes is that of the Friedman–Stanley jump.
The Friedman–Stanley jump of 𝐸 is the equivalence relation 𝐸+ on the space 𝑌 = 𝑋 𝜔
defined by 𝑦0 𝐸 + 𝑦1 if [rng(𝑦0 )]𝐸 = [rng(𝑦1 )]𝐸 .
Here, the classification of pinned names is right at hand: a pinned name for the jump
is essentially just a set of pinned names for the original equivalence relation. For a
nonempty set 𝑆 = {⟨𝑃𝑖 , 𝜏𝑖 ⟩ ∶ 𝑖 ∈ 𝐼} of representatives of virtual 𝐸-classes, let 𝜏𝑆 be the
name on the poset 𝑄𝑆 = ∏𝑖 𝑃𝑖 × Coll(𝜔, 𝐼) for an element of 𝑋 𝜔 enumerating the set
{𝜏𝑖 ∶ 𝑖 ∈ 𝐼}.
Theorem 2.3.4. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋.
(1) If 𝑆 is a set of 𝐸-pinned names then ⟨𝑄𝑆 , 𝜏𝑆 ⟩ is an 𝐸 + -pinned name;
(2) ⟨𝑄𝑆 , 𝜏𝑆 ⟩ 𝐸̄+ ⟨𝑄𝑇 , 𝜏𝑇 ⟩ iff the sets 𝑆, 𝑇 represent the same set of virtual 𝐸-classes;
(3) whenever ⟨𝑃, 𝜏⟩ is an 𝐸 + -pinned name, there is a set 𝑆 of 𝐸-pinned names such
that ⟨𝑃, 𝜏⟩ 𝐸̄+ ⟨𝑄𝑆 , 𝜏𝑆 ⟩.
Proof. Items (1) and (2) are immediate. To prove (3), suppose that 𝜏 is an 𝐸 + -
pinned name on a poset 𝑃. For every virtual 𝐸-class 𝑦, the statement 𝜙(𝑦) =“rng(𝜏)
contains a realization of the class 𝑦” must be decided in the same way by every condi-
tion in 𝑃. Let 𝑆 be any set of 𝐸-pinned names which collects representatives from all
virtual 𝐸-classes 𝑦 such that ∀𝑝 ∈ 𝑃 𝑝 ⊩ 𝜙(𝑦).̌ We claim that the set 𝑆 works.
Indeed, suppose that 𝐺0 , 𝐺1 ⊂ 𝑃 are mutually generic filters. The sets [rng(𝜏/𝐺0 )]𝐸
and [rng(𝜏/𝐺1 )]𝐸 are equal, and by Proposition 2.1.7 they contain only realizations of
ground model virtual 𝐸-classes. By the choice of the set 𝑆, these sets contain exactly
realizations of virtual 𝐸-classes represented by names in 𝑆. Since the generic ultrafilter
𝐺0 was arbitrary, ⟨𝑃, 𝜏⟩ 𝐸̄+ ⟨𝑄𝑆 , 𝜏𝑆 ⟩ as desired. □
Example 2.3.5. The relation 𝔽2 is the Friedman–Stanley jump of the identity on
𝑋 = 2𝜔 . The identity is pinned by Fact 2.3.2 so its virtual classes can be identified with
elements of 𝑋. The 𝔽2 -classes then correspond to subsets of 2𝜔 .
Countable products of equivalence relations translate to the virtual realm without
change.
Definition 2.3.6. For each 𝑛 ∈ 𝜔, let 𝐸𝑛 be an analytic equivalence relation on
a Polish space 𝑋𝑛 . The product Π𝑛 𝐸𝑛 is the equivalence relation 𝐸 on 𝑌 = ∏𝑛 𝑋𝑛
defined by 𝑦0 𝐸 𝑦1 if for every 𝑛 ∈ 𝜔, 𝑦0 (𝑛) 𝐸𝑛 𝑦1 (𝑛).
For every function 𝑔 such that dom(𝑔) = 𝜔 and for all 𝑛 ∈ 𝜔 𝑔(𝑛) is some 𝐸𝑛 -pinned
name ⟨𝑄𝑛 , 𝜏𝑛 ⟩, let 𝜏𝑔 be the name on the poset 𝑄𝑔 = ∏𝑛 𝑄𝑛 (the support applied in
the product is irrelevant for the equivalence class of the resulting Π𝑛 𝐸𝑛 -pin) for the
sequence ⟨𝜏𝑛 ∶ 𝑛 ∈ 𝜔⟩, which is forced to be an element of 𝑌 . The following is nearly
immediate.
Theorem 2.3.7. For each 𝑛 ∈ 𝜔, let 𝐸𝑛 be analytic equivalence relations on respec-
tive Polish spaces 𝑋𝑛 and let 𝐸 = ∏𝑛 𝐸𝑛 .
(1) If 𝑔 is a sequence of 𝐸𝑛 -pinned names, then ⟨𝑄𝑔 , 𝜏𝑔 ⟩ is an ∏𝑛 𝐸𝑛 -pin;
(2) ⟨𝑄𝑔 , 𝜏𝑔 ⟩ 𝐸̄ ⟨𝑄ℎ , 𝜏ℎ ⟩ iff for each 𝑛 ∈ 𝜔, 𝑔(𝑛) 𝐸𝑛̄ ℎ(𝑛);
(3) whenever ⟨𝑃, 𝜏⟩ is an 𝐸-pinned name, there is a function 𝑔 such that ⟨𝑃, 𝜏⟩ 𝐸̄
⟨𝑄𝑔 , 𝜏𝑔 ⟩.
Countable increasing unions of equivalence relations translate to the virtual realm
without change as well.
Theorem 2.3.8. Let {𝐸𝑛 ∶ 𝑛 ∈ 𝜔} be an increasing sequence of analytic equivalence
relations on a Polish space 𝑋, and let 𝐸 = ⋃𝑛 𝐸𝑛 .
(1) Whenever ⟨𝑄, 𝜎⟩ is an 𝐸𝑛 -pinned name for some 𝑛 ∈ 𝜔 then it is also 𝐸-pinned;
(2) whenever ⟨𝑃, 𝜏⟩ is an 𝐸-pinned name, there exists a number 𝑛 ∈ 𝜔 and an 𝐸𝑛 -
pinned name ⟨𝑄, 𝜎⟩ such that ⟨𝑃, 𝜏⟩ 𝐸̄ ⟨𝑄, 𝜎⟩.
Proof. (1) is immediate as 𝐸𝑛 ⊂ 𝐸. For (2), by the forcing theorem there must
be conditions 𝑝0 , 𝑝1 ∈ 𝑃 and a number 𝑛 such that ⟨𝑝0 , 𝑝1 ⟩ ⊩𝑃×𝑃 𝜏left 𝐸𝑛 𝜏right . The
transitivity of the relation 𝐸𝑛 then shows that 𝜏 on the poset 𝑃 ↾ 𝑝0 is an 𝐸𝑛 -pinned
name. The initial assumptions show that ⟨𝑃, 𝜏⟩ 𝐸̄ ⟨𝑃 ↾ 𝑝0 , 𝜏⟩. as desired. □
Example 2.3.9. The Louveau jump survives into the virtual realm without change.
The Louveau jump of an analytic equivalence relation 𝐸 on a Polish space 𝑋 is the equiv-
alence relation 𝐸 +𝐿 on 𝑌 = 𝑋 𝜔 connecting 𝑦0 , 𝑦1 ∈ 𝑌 if for all but finitely many 𝑛 ∈ 𝜔,
𝑦0 (𝑛) 𝐸 𝑦1 (𝑛). The Louveau jump can be written as a countable increasing union of
countable products of 𝐸, which by Theorems 2.3.7 and 2.3.8 yields a complete analysis
of its virtual classes in terms of virtual 𝐸-classes. In particular, if 𝐸 is pinned then its
Louveau jump is pinned.
The virtual realm also correctly reflects the situation in which the equivalence classes
of one relation consist of countably many equivalence classes of another one.
2.4. CLASSIFICATION: SPECIFIC EXAMPLES 41
Definition 2.3.10. Let 𝐸, 𝐹 be analytic equivalence relations on a Polish space 𝑋.

We say that 𝐹 is countable over 𝐸 if 𝐸 ⊂ 𝐹 and every 𝐹-class consists of countably many
𝐸-classes.
Theorem 2.3.11. Let 𝐸, 𝐹 be analytic equivalence relations on a Polish space 𝑋, with
𝐹 countable over 𝐸.
(1) If ⟨𝑄, 𝜎⟩ is an 𝐸-pinned name then it is 𝐹-pinned as well;
(2) if ⟨𝑃, 𝜏⟩ is an 𝐹-pinned name then there is an 𝐸-pinned name ⟨𝑄, 𝜎⟩ such that
⟨𝑃, 𝜏⟩ 𝐹 ̄ ⟨𝑄, 𝜎⟩.
Proof. (1) is immediate. For (2), it will be enough to show that there is a condition
𝑝 ∈ 𝑃 such that 𝜏 is an 𝐸-pinned name on 𝑃 ↾ 𝑝, for then ⟨𝑃, 𝜏⟩ 𝐹 ̄ ⟨𝑃 ↾ 𝑝, 𝜏⟩ as desired.
Suppose towards a contradiction that there is no condition 𝑝 ∈ 𝑃 such that 𝜏 is 𝐸-
pinned on the poset 𝑃 ↾ 𝑝. It follows by the forcing theorem that 𝑃 × 𝑃 ⊩ ¬𝜏left 𝐸 𝜏right
holds. Let 𝑀 be a countable elementary submodel of a large structure containing 𝑃, 𝜏
and the codes for 𝐸, 𝐹. Use Proposition 1.7.9 to find an uncountable collection {𝑔𝑖 ∶ 𝑖 ∈
𝐼} of filters on 𝑀 ∩ 𝑃 pairwise mutually generic over the model 𝑀. By the Mostowski
absoluteness between the models 𝑀[𝑔𝑖 , 𝑔𝑗 ] and 𝑉 for 𝑖 ≠ 𝑗 ∈ 𝐼, the elements 𝜏/𝑔𝑖 ∈ 𝑋
for 𝑖 ∈ 𝐼 are pairwise 𝐹-related, but pairwise 𝐸-unrelated, contradicting the initial
assumptions on the relations 𝐸, 𝐹. □
Example 2.3.12. The Clemens jump survives into the virtual realm without
change. Here the Clemens jump of an analytic equivalence relation 𝐸 on a Polish space
𝑋 is the equivalence relation 𝐸 +𝐶 on 𝑌 = 𝑋 ℤ connecting 𝑦0 , 𝑦1 ∈ 𝑌 if there is 𝑛 ∈ ℤ
such that for every 𝑚 ∈ ℤ 𝑦0 (𝑚) 𝐸 𝑦1 (𝑚 + 𝑛). The Clemens jump is countable over the
product of ℤ-many copies of 𝐸, which yields a complete analysis of its virtual classes
by Theorems 2.3.7 and 2.3.8. In particular, if 𝐸 is pinned, then so is its Clemens jump.
2.4. Classification: specific examples

There are many analytic equivalence relations for which the virtual space can be
classified by more tangible combinatorial objects, but which do not fit into the context
of the theorems of Section 2.3. The purpose of this section is to investigate these more
difficult, but also more informative, possibilities.
The most interesting issues arise in equivalence relations classifiable by countable
structures. Among these, the Borel equivalence relations are Borel reducible to an it-
erated jump of the identity [54, Theorem 12.5.2], so can be handled by Theorems 2.3.4
and 2.3.8. For example, for all equivalence relations 𝐸 Borel reducible to 𝔽2 , the virtual
𝐸-classes are classifiable by subsets of 2𝜔 by Example 2.3.5.
More interesting issues arise with analytic equivalence relations. Let 𝐸 be the
equivalence relation of isomorphism of structures on 𝜔. In this case, the virtual classes
correspond to potential Scott sentences in the sense of [109]. In some cases, it is possi-
ble to classify virtual classes of 𝐸 by uncountable structures as in the following defini-
tion.
Definition 2.4.1. Let 𝑀 be a (possibly uncountable) structure of a countable sig-
nature. 𝜏𝑀 is a Coll(𝜔, 𝑀)-name for some structure on 𝜔 isomorphic to 𝑀.
̄
It is immediate that the pair ⟨Coll(𝜔, 𝑀), 𝜏𝑀 ⟩ is an 𝐸-pin, and its 𝐸-equivalence relation
̄
does not depend on the choice of the name 𝜏𝑀 . It turns out that the 𝐸-equivalence
relation on the 𝐸-pins obtained in this way coincides with a familiar concept of model
theory:
Definition 2.4.2. [78, Section 2.4] Let 𝑀, 𝑁 be structures with the same signature.
Say that 𝑀, 𝑁 are Ehrenfeucht–Fraissé-equivalent if Player II has a winning strategy in
the Ehrenfeucht–Fraissé game. In the EF-game, the two players take turns, at round
𝑖 ∈ 𝜔 Player I starting with an element 𝑛𝑖 ∈ 𝑁 or 𝑚𝑖 ∈ 𝑀 and Player II responding
with an element 𝑚𝑖 ∈ 𝑀 or 𝑛1 ∈ 𝑁 respectively. After all rounds indexed by 𝑖 ∈ 𝜔 have
been completed, Player II wins if the map 𝑛𝑖 ↦ 𝑚𝑖 for 𝑖 ∈ 𝜔 preserves all relations and
functions of 𝑁, 𝑀 in the signature.
Theorem 2.4.3. Let 𝑀, 𝑁 be models with the same countable signature. The follow-
ing are equivalent:
(1) 𝑀, 𝑁 are Ehrenfeucht–Fraissé equivalent;
(2) ⟨Coll(𝜔, 𝑀), 𝜏𝑀 ⟩ 𝐸̄ ⟨Coll(𝜔, 𝑁), 𝜏𝑁 ⟩.
Proof. For the (1)→(2) direction, if 𝑀 is Ehrenfeucht–Fraissé equivalent to 𝑁
as witnessed by a winning strategy 𝜎 for Player I in the EF-game, then Coll(𝜔, 𝑀) ×
Coll(𝜔, 𝑁) ⊩ 𝜏𝑀 𝐸 𝜏𝑁 , since a generic run of the EF-game in which Player II follows
the strategy 𝜎 will generate an isomorphism between 𝑀 and 𝑁 in the extension. For the
(2)→(1) direction, suppose that Coll(𝜔, 𝑀) × Coll(𝜔, 𝑁) ⊩ 𝜏𝑀 𝐸 𝜏𝑁 and let 𝜋 ∶ 𝑀̌ →
𝑁̌ be a product name for the isomorphism. The winning strategy for Player II can
be described as follows: as the game develops, Player II also maintains on the side
conditions 𝑞𝑖 ∈ Coll(𝜔, 𝑀) × Coll(𝜔, 𝑁) such that 𝑞0 ≥ 𝑞1 ≥ . . . and 𝑞𝑖 ⊩ 𝜋(𝑚̌ 𝑖 ) = 𝑛𝑖̌ .
It is immediate that this is possible and Player II must win in the end. □
In the language of [109], a sentence 𝜙 of ℒ𝜔1 𝜔 is grounded if every virtual equivalence
class is represented by a collapse name for a possibly uncountable model of 𝜙. In gen-
eral, there are virtual 𝐸-classes which are not represented by a straightforward collapse
name as in Definition 2.4.1, as [56, Section 4] shows. However, a collapse name can be
found for certain classes of structures.
Definition 2.4.4. Let Γ be a coanalytic set of structures on 𝜔, closed under iso-
morphism. A (possibly uncountable) structure 𝑀 is a Γ∗∗ -structure if Coll(𝜔, 𝑀) ⊩
𝜏𝑀 ∈ Γ.
We proceed to show that for some interesting coanalytic classes Γ, every 𝔼̄ Γ -class is
represented by a collapse name of a Γ∗∗ -structure as in Definition 2.4.1. In the classi-
fication results, we always ignore the trivial class of structures which do not belong to
Γ. Results similar to the following theorem appear in [63] and [73].
Theorem 2.4.5. Let Γ be a coanalytic class of countable structures on 𝜔, invariant
under isomorphism, consisting of rigid structures only.
(1) For Γ∗∗ -structures, Ehrenfeucht–Fraissé equivalence and isomorphism coin-
cide;
(2) for every 𝔼Γ -pin ⟨𝑃, 𝜎⟩ there is a Γ∗∗ -structure 𝑀 such that ⟨𝑃, 𝜎⟩ 𝐸̄ ⟨Coll(𝜔, 𝑀),
𝜏𝑀 ⟩.
Proof. Before we begin the argument, note that the statement that every structure
in the set 𝐴 is rigid is 𝚷12 ; therefore, it holds also in all generic extensions by Shoenfield
absoluteness.
2.4. CLASSIFICATION: SPECIFIC EXAMPLES 43
For (1), it is clear that isomorphic structures are Ehrenfeucht–Fraissé equivalent.

For the opposite implication, suppose that 𝑀, 𝑁 are Γ∗∗ structures which are EF-
equivalent. By Theorem 2.4.3, Coll(𝜔, 𝑀) × Coll(𝜔, 𝑁) ⊩ 𝜏𝑀 𝐸 𝜏𝑁 must hold. As
Γ consists of rigid structures even in the collapse extension, Coll(𝜔, 𝑀) × Coll(𝜔, 𝑁)
forces that there is a unique isomorphism 𝜋 ∶ 𝑀 → 𝑁. Since Coll(𝜔, 𝑀) × Coll(𝜔, 𝑁) is
a homogeneous notion of forcing, for each 𝑚 ∈ 𝑀 the value of 𝜋(𝑚)̌ is decided by the
largest condition to be some ℎ(𝑚) ∈ 𝑁. The function ℎ ∶ 𝑀 → 𝑁 is an isomorphism
of 𝑀 to 𝑁 present already in 𝑉.
For (2), let 𝐺0 × 𝐺1 ⊂ 𝑃 × 𝑃 be mutually generic filters over 𝑉. In the model
𝑉[𝐺0 , 𝐺1 ], let 𝑁0 = 𝜏/𝐺0 and 𝑁1 = 𝜏/𝐺1 . To define the model 𝑀 ∈ 𝑉, let 𝑥0 = {𝑠 ∶ 𝑠
is the Scott sentence of the model ⟨𝑁0 , 𝑎⟩ for some 𝑎 ∈ 𝑁0 } ∈ 𝑉[𝐺0 ] and 𝑥1 = {𝑠 ∶ 𝑠
is the Scott sentence of the model ⟨𝑁1 , 𝑎⟩ for some 𝑎 ∈ 𝑁1 } ∈ 𝑉[𝐺1 ]. Since 𝑁0 is
isomorphic to 𝑁1 , it follows from Karp’s theorem [37, Lemma 12.1.6] that 𝑥0 = 𝑥1 , so
𝑥0 = 𝑥1 ∈ 𝑉[𝐺0 ]∩𝑉[𝐺1 ] ∈ 𝑉. The set 𝑥0 will be the universe of the model 𝑀. Note that
since the model 𝑁0 is rigid, the elements of 𝑁0 are in one-to-one correspondence with
𝑥0 by Karp’s theorem again and the unique isomorphism between 𝑁0 and 𝑁1 factors
through the identity on the set 𝑥0 = 𝑥1 . To construct the realizations of relational and
functional symbols of the model 𝑀, for every relational symbol 𝑅 (say binary) of the
language of the models and 𝑠, 𝑡 ∈ 𝑥0 , let 𝑠 𝑅𝑀 𝑡 if for the unique 𝑎, 𝑏 ∈ 𝑁0 such that 𝑠
is the Scott sentence of 𝑎 and 𝑡 is a Scott sentence of 𝑏, 𝑁0 ⊧ 𝑠 𝑅 𝑡. The same definition
using the model 𝑁1 yields the same relation, so 𝑅𝑀 ∈ 𝑉[𝐺0 ] ∩ 𝑉[𝐺1 ] = 𝑉. Define the
realizations of all functional and relational symbols of the model 𝑀 in this way. As a
result, 𝑀 is a model in 𝑉 and the map sending each 𝑎 ∈ 𝑀 to the Scott sentence of
⟨𝑀, 𝑎⟩ is an isomorphism of 𝑁0 and 𝑀 in the model 𝑉[𝐺0 ]. Thus, (2) follows. □
Theorem 2.4.5 makes it possible to describe some class-sized virtual spaces explicitly:
Example 2.4.6. The virtual 𝔼𝜔1 -classes are precisely classified by ordinals, since
𝔼𝜔1 = 𝔼Γ where Γ is the class of all well-orderings on 𝜔. Well-orderings are rigid, and
up to isomorphism are classified by ordinals.
Example 2.4.7. The virtual ℍℂ-classes are classified by transitive sets with the
∈-relation. Note that all extensional, well-founded relations are rigid and uniquely
isomorphic to a unique transitive set with the membership relation by the Mostowski
collapse theorem [51, Theorem 6.15].
In the case of non-rigid structures, the classification may become more compli-
cated. We will treat the case of acyclic graphs, which has the virtue of being Borel-
complete among the equivalence relations classifiable by countable structures. Note
that the Ehrenfeucht–Fraissé equivalence on uncountable acyclic graphs is distinct
from isomorphism, as the case of an empty graph on ℵ1 or ℵ2 vertices shows.
Theorem 2.4.8. Let Γ be the class of all acyclic graphs on 𝜔. For every 𝔼Γ -pin ⟨𝑃, 𝜎⟩
there is an acyclic graph 𝐻 such that ⟨𝑃, 𝜎⟩ 𝐸̄ ⟨Coll(𝜔, 𝐻), 𝜏𝐻 ⟩.
Proof. The point of the proof is that an acyclic graph can be explicitly built from
automorphism orbits of its elements. This procedure is captured in the following ob-
servation. Suppose 𝑥 is a set, 𝑓 ∶ 𝑥2 → 𝜔 + 1 is a function such that 𝑓(𝑠, 𝑡) > 0 ↔
𝑓(𝑡, 𝑠) > 0, and 𝑔 ∶ 𝑥2 → 𝜔 + 1 is a function such that 𝑓(𝑠, 𝑡) > 0 implies 𝑔(𝑠) = 𝑔(𝑡).
Then there is, up to an isomorphism unique, acyclic graph 𝐻(𝑥, 𝑓, 𝑔) together with an
onto map ℎ ∶ 𝑦 → 𝑥, where 𝑦 is the set of vertices of 𝐻(𝑥, 𝑓, 𝑔), such that
• for every 𝑠, 𝑡 ∈ 𝑥 and every vertex 𝑣 ∈ 𝑦, if ℎ(𝑣) = 𝑠 then the set of all
neighbors of 𝑣 mapped to 𝑡 has size 𝑓(𝑠, 𝑡);
• for every 𝑠 ∈ 𝑥 there are 𝑔(𝑠) many connected components of the graph 𝐻
containing a vertex 𝑣 with ℎ(𝑣) = 𝑠.
The construction of the graph 𝐻(𝑥, 𝑓, 𝑔) is straightforward. Note that whenever
𝑢, 𝑣 ∈ 𝑦 are two vertices such that ℎ(𝑢) = ℎ(𝑣) then there is an automorphism of the
graph 𝐻(𝑥, 𝑓, 𝑔) sending 𝑢 to 𝑣.
Now, suppose that 𝜎 is an 𝐸-pinned name on a poset 𝑃 and let 𝐺0 × 𝐺1 ⊂ 𝑃 × 𝑃 be
mutually generic filters over 𝑉. In the model 𝑉[𝐺0 , 𝐺1 ], let 𝐻0 = 𝜎/𝐺0 and 𝐻1 = 𝜎/𝐺1 .
To define the graph 𝐻 ∈ 𝑉, let 𝑥0 = {𝑠 ∶ 𝑠 is the Scott sentence of the model ⟨𝐻0 , 𝑣⟩ for
some vertex 𝑣 of 𝐻0 } ∈ 𝑉[𝐺0 ] and 𝑥1 = {𝑠 ∶ 𝑠 is the Scott sentence of the model ⟨𝐻1 , 𝑣⟩
for some vertex 𝑣 in 𝐻1 } ∈ 𝑉[𝐺1 ]. Since 𝐻0 is isomorphic to 𝐻1 , it follows from Karp’s
theorem [37, Lemma 12.1.6] that 𝑥0 = 𝑥1 , so 𝑥 = 𝑥0 = 𝑥1 ∈ 𝑉[𝐺0 ] ∩ 𝑉[𝐺1 ] ∈ 𝑉. Let
𝑓 ∶ 𝑥2 → 𝜔 + 1 be the function defined by 𝑓(𝑠, 𝑡) = 𝑖 if every vertex of 𝐻0 of type 𝑠 has
𝑖-many neighbors of type 𝑡 when 𝑖 ∈ 𝜔, and 𝑓(𝑠, 𝑡) = 𝜔 if every vertex of 𝐻0 of type 𝑠
has infinitely many neighbors of type 𝑡. Let 𝑔 ∶ 𝑥 → 𝜔 + 1 be the function defined by
𝑓(𝑠) = 𝑖 if there are 𝑖-many connected components of 𝐻0 containing a node of type 𝑠
when 𝑖 ∈ 𝜔, and 𝑔(𝑠) = 𝜔 if there are infinitely many connected components of 𝐻0
containing a node of type 𝑠. Note that these functions are well-defined and the graph
𝐻0 is isomorphic to 𝐻(𝑥, 𝑓, 𝑔) in the model 𝑉[𝐺0 ]. Similar definitions using the grap
𝐻1 yield the same functions, so 𝑓, 𝑔 ∈ 𝑉[𝐺0 ] ∩ 𝑉[𝐺1 ] = 𝑉. Working in 𝑉, consider the
graph 𝐻 = 𝐻(𝑥, 𝑓, 𝑔). This graph is isomorphic to 𝐻0 in 𝑉[𝐺0 ], so 𝜏𝐻 𝐸̄ 𝜎. □
In the recent years, model theorists proved several other theorems regarding the clas-
sification of virtual isomorphism classes by possibly uncountable structures. [109] pro-
vides further examples of grounded sentences beyond those obtained by Theorems 2.4.5
and 2.4.8. The first item of the following theorem is related to classical arguments going
at least as far back as the unpublished work of Leo Harrington in the 1980’s. Similar
results also appear in [6] and [73].
Fact 2.4.9. [56, Section 4] Let 𝐸 be the equivalence relation of isomorphism of struc-
tures on 𝜔.
(1) If 𝑃 is a poset forcing |ℵ𝑉 ̄
2 | > ℵ0 then every 𝐸-pin ⟨𝑃, 𝜎⟩ is 𝐸-equivalent to
⟨Coll(𝜔, 𝑀), 𝜏𝑀 ⟩ for some structure 𝑀 of cardinality at least ℵ1 ;
(2) if 𝑃 forces |ℵ𝑉 ̄
2 | = ℵ0 , then there is an 𝐸-pin ⟨𝑃, 𝜎⟩ which is not 𝐸-equivalent to
⟨Coll(𝜔, 𝑀), 𝜏𝑀 ⟩ for any structure 𝑀.
Virtual spaces for equivalence relations which are not classifiable by countable struc-
tures are often quite difficult to understand. To conclude this section, we state another
classification theorem and a couple of open questions.
Theorem 2.4.10. Let 𝐸 be the equivalence relation on 𝑋 = (𝒫(𝜔))𝜔 connecting

𝑥0 , 𝑥1 if rng(𝑥0 ) and rng(𝑥1 ) generate the same filter on 𝜔. The virtual 𝐸-classes are clas-
sified by filters on 𝜔.
2.5. CARDINAL INVARIANTS 45
Proof. On one hand, if 𝐹 is a filter on 𝜔, one can consider the Coll(𝜔, 𝐹)-name 𝜏𝐹
for a generic enumeration of the filter 𝐹. It is immediate that the name 𝜏𝐹 is 𝐸-pinned,
and distinct filters yield inequivalent names.
For the more difficult part, suppose that 𝑃 is a partial order and 𝜏 is an 𝐸-pinned
name on 𝑃; we must find a filter 𝐹 on 𝜔 such that 𝜏 is equivalent to 𝜏𝐹 . To do this,
let 𝐹 = {𝑎 ⊂ 𝜔 ∶ ∃𝑝 𝑝 ⊩ 𝑎̌ belongs to the filter generated by rng(𝜏)}. By the pinned
property of the name 𝜏, the existential quantifier in the definition of 𝐹 can be replaced
by universal without changing the resulting set 𝐹. It follows immediately that the set
𝐹 is a filter; we must show that 𝜏 is equivalent to 𝜏𝐹 .
Suppose towards a contradiction that this fails; then it must be the case that for
some condition 𝑝 ∈ 𝑃 and some number 𝑛 ∈ 𝜔, 𝑝 forces 𝜏(𝑛)̌ to have no subset in the
filter 𝐹. Since the name 𝜏 is 𝐸-pinned, there must exist conditions 𝑝0 , 𝑝1 ≤ 𝑝 and a
finite set 𝑎 ⊂ 𝜔 such that ⟨𝑝0 , 𝑝1 ⟩ ⊩ ⋂𝑚∈𝑎̌ 𝜏right (𝑚) ⊂ 𝜏left (𝑛).
̌ Let 𝑏 = {𝑘 ∈ 𝜔 ∶ ∃𝑟 ≤
̌
𝑝1 𝑟 ⊩ 𝑘 ∈ ⋂𝑚∈𝑎 𝜏(𝑚)} and let 𝑐 = {𝑘 ∈ 𝜔 ∶ 𝑝0 ⊩ 𝑘 ∈ 𝜏(𝑛)}. ̌ ̌ Observe that 𝑏 ∈ 𝐹
(since 𝑝1 ⊩ ⋂𝑚∈𝑎 𝜏(𝑚) ⊂ 𝑏)̌ and 𝑐 ∉ 𝐹 (since 𝑝0 ⊩ 𝑐 ̌ ⊂ 𝜏). Thus, there has to be a
number 𝑘 ∈ 𝑏 ⧵ 𝑐, and for this number 𝑘 there are conditions 𝑟0 ≤ 𝑝0 and 𝑟1 ≤ 𝑝1 such
that 𝑟1 ⊩ 𝑘 ̌ ∈ ⋂𝑚∈𝑎 𝜏(𝑚) and 𝑟0 ⊩ 𝑘 ̌ ∉ 𝜏(𝑛). ̌ This, however, contradicts the choice of
the conditions 𝑝0 , 𝑝1 . □
Consider the equivalence relation 𝐸 of homeomorphism of compact metrizable spaces.
This is known to be the largest equivalence relation reducible to an orbit equivalence in
the sense of Borel reducibility [119]. In an attempt to describe its virtual space, consider
any compact Hausdorff space 𝑋 with a topology basis of cardinality 𝜅, and consider
the Coll(𝜔, 𝜅)-name 𝜏𝑋 for the interpretation of the space 𝑋 in the extension in the
sense of [116]. The interpretation of 𝑋 will have a countable basis, so the interpretation
will be a compact metrizable space. The basic theory of interpretations shows that
⟨Coll(𝜔, 𝜅), 𝜏𝑋 ⟩ is an 𝐸-pin. The most natural question is open:
Question 2.4.11. Is every virtual 𝐸-class represented by a compact Hausdorff
space?
The measure equivalence 𝐸 is one of the hardest equivalence relations to understand.
It connects two Borel probability measures 𝜇, 𝜈 on the Cantor space if they share the
same ideal of null sets. The relation 𝔽2 Borel reduces to 𝐸, so 𝐸 is not pinned.
Question 2.4.12. Classify the virtual space for the measure equivalence.
2.5. Cardinal invariants

There are several cardinal invariants of equivalence relations which are associated
with the concept of virtual equivalence classes. They respect the Borel reducibility
order; therefore, they are useful as tools for nonreducibility results. They also are con-
ceptually useful in several places in this book.
2.5a. Basic definitions. The following definition records the most natural car-
dinal invariants associated with the virtual spaces.
(1) 𝜅(𝐸), the pinned cardinal of 𝐸, is the smallest 𝜅 (if it exists) such that every
virtual 𝐸-class has a representative on a poset of cardinality smaller than 𝜅.
If 𝐸 is pinned, we let 𝜅(𝐸) = ℵ1 . If 𝜅(𝐸) does not exist, we write 𝜅(𝐸) = ∞;
(2) 𝜆(𝐸) is the cardinality of the set of all virtual 𝐸-classes. If the virtual 𝐸-classes
form a proper class, we let 𝜆(𝐸) = ∞;
(3) 𝜆(𝐸, 𝑃) is the cardinality of the set of all virtual 𝐸-classes represented on the
poset 𝑃.
Note that 𝜅(𝐸) = ∞ just in case 𝜆(𝐸) = ∞; at the same time, 𝜆(𝐸, 𝑃) < ∞ holds for
all 𝐸, 𝑃. The rather mysterious demand that 𝜅(𝐸) = ℵ1 for all pinned equivalence
relations 𝐸 is explained by a reference to Theorem 2.6.2: there are no nontrivial pinned
names on countable posets for any analytic equivalence relation. It turns out that the
cardinals 𝜅(𝐸) and 𝜆(𝐸, 𝑃) can attain all kinds of exotic and informative values. We will
start with the two archetypal and somewhat boring computations.
Example 2.5.2. 𝜅(𝔽2 ) = 𝔠+ and 𝜆(𝔽2 ) = 2𝔠 .
Proof. This follows immediately from the classification of pinned names for the
Friedman–Stanley jump. Every virtual 𝔽2 class is represented by a subset of 2𝜔 , and
distinct subsets of 2𝜔 give rise to distinct virtual 𝔽2 classes. □
Example 2.5.3. 𝜅(𝔼𝜔1 ) = ∞. To see this, note that by Example 2.4.6, the vir-
tual 𝔼𝜔1 -classes are classified by ordinals, so there is a proper class of them. Similarly,
𝜅(ℍℂ) = ∞, as by Example 2.4.7 the virtual ℍℂ-classes are classified by transitive sets,
so there is a proper class of them.
Theorem 2.8.9 shows that in fact 𝔼𝜔1 is a minimal example of an equivalence relation
𝐸 with 𝜅(𝐸) = ∞.
The most appealing fact about the cardinal invariants 𝜅(𝐸) and 𝜆(𝐸, 𝑃) is that they
respect the Borel reducibility order; therefore, they can be used to prove Borel nonre-
ducibility results. In a good number of instances, the comparison of the cardinal invari-
ants is the fastest and most intuitive way of proving nonreducibility. One of the main
features of this style of argumentation is that it automatically survives the transfer to
nonreducibility by functions more complicated than Borel.
Theorem 2.5.4. Let 𝐸, 𝐹 be analytic equivalence relations on Polish spaces 𝑋, 𝑌 re-
spectively. If 𝐸 ≤𝑎 𝐹 then 𝜅(𝐸) ≤ 𝜅(𝐹) and 𝜆(𝐸, 𝑃) ≤ 𝜆(𝐹, 𝑃) holds for every partial order
𝑃.
Proof. Suppose that ℎ ∶ 𝑋 → 𝑌 is a Borel function witnessing the reduction of
𝐸 to 𝐹 everywhere except for a set 𝑍 ⊂ 𝑋 consisting of countably many 𝐸-classes. By
a Shoenfield absoluteness argument, these properties of the function ℎ transfer to all
generic extensions. If 𝑃 is a partial ordering and 𝜏 is an 𝐸-pinned name on 𝑃 which
̇ is an 𝐹-pinned name on 𝑃,
is not a name for one of the classes in the set 𝑍, then ℎ(𝜏)
̇
and the map 𝜏 ↦ ℎ(𝜏) respects virtual 𝐸- and 𝐹-classes, and it is an injection from the
former to the latter. It follows that 𝜆(𝐸, 𝑃) ≤ 𝜆(𝐹, 𝑃).
̄
Now, suppose that 𝑄 is another poset and that ℎ(𝜏) has a 𝐹-equivalent name 𝜎 on
𝑄. By the Shoenfield absoluteness, 𝑄 ⊩ ∃𝑥 ∈ 𝑋 ⧵ 𝑍 ℎ(𝑥) ̇ = 𝜏; any 𝑄-name for such an
̄
𝑥 is 𝐸-pinned and the name for ℎ(𝑥) is 𝐹-equivalent to ℎ(𝜏). A brief bout of diagram
chasing now shows that 𝜅(𝐸) ≤ 𝜅(𝐹) and the theorem follows. □
The following neat application has been observed by [109] for the case of Borel equiv-
alence relations classified by countable structures.
Example 2.5.5. By Friedman and Stanley [36], the Friedman–Stanley jump of a

Borel equivalence relation 𝐸 is not Borel reducible to 𝐸. The most appealing proof of
this fact uses the cardinal invariant 𝜆(𝐸). Theorem 2.5.6 below shows that for Borel
equivalence relations, the value of 𝜆(𝐸) is an actual cardinal as opposed to ∞. The-
orem 2.3.4 shows that virtual 𝐸 + -classes are classified by sets of virtual 𝐸-classes, in
other words 𝜆(𝐸 + ) = 2𝜆(𝐸) . Theorem 2.5.4 then completes the argument.
2.5b. Estimates. The key fact about the pinned cardinal is the following theo-
rem. It shows that there are a priori bounds on the size of the pinned cardinal; in
particular, if the equivalence relation 𝐸 is Borel, then 𝜅(𝐸) ≤ ℶ𝜔1 and the virtual space
of 𝐸 is a set. Recall that the ℶ function is defined by recursion: ℶ0 = ℵ0 , ℶ𝛼+1 = 2ℶ𝛼 ,
and ℶ𝛼 = sup𝛽∈𝛼 ℶ𝛽 if 𝛼 is a limit ordinal.
Theorem 2.5.6. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋 of rank

𝚷𝟎𝜶 . Then 𝜅(𝐸) ≤ (ℶ𝛼 )+ .
Proof. Let 𝜏 be an 𝐸-pinned name on a poset 𝑃; we must produce a Coll(𝜔, ℶ𝛼 )-

̄
name 𝜎 which is 𝐸-related to 𝜏. Note that [𝜏]𝐸 is a 𝑃-name for a Borel set of rank ≤ 𝛼.
As is the case for every name for a Borel set, [100, Corollary 2.9] shows that in the
Coll(𝜔, ℶ𝛼 ) extension 𝑉[𝐺] there is a Borel code for a Borel set 𝐵 ⊂ 𝑋 such that in
every further forcing extension 𝑉[𝐺][𝐻] and every 𝑥 ∈ 𝑋 ∩ 𝑉[𝐺][𝐻] in that extension,
𝑥 ∈ 𝐵 if and only if 𝑉[𝑥] ⊧ 𝑃 ⊩ 𝑥̌ ∈ [𝜏]𝐸 . Note that if 𝐻 ⊂ 𝑃 is generic over 𝑉[𝐺],
then the set 𝐵 is nonempty in 𝑉[𝐺][𝐻], containing the point 𝜏/𝐻; this follows from the
fact that 𝜏 is 𝐸-pinned. Thus, the set 𝐵 is nonempty already in 𝑉[𝐺] by the Mostowski
absoluteness between 𝑉[𝐺] and 𝑉[𝐺][𝐻]. Back in 𝑉, let 𝜎 be any Coll(𝜔, ℶ𝛼 )-name for
an element of the set 𝐵. This clearly works. □
Example 2.5.7. For any given countable ordinal 𝛼, let Γ𝛼 be the class of binary
relations on 𝜔 which are extensional and wellfounded of rank < 𝛼; let 𝐸𝛼 be the iso-
morphism relation. It is not difficult to check (Theorem 2.4.5) that for each countable
ordinal 𝛼, the relation 𝐸𝛼 is Borel, and its pinned names are collapse names for iso-
morphs of the membership relation on sets in 𝑉𝛼 . Thus, the cardinals 𝜅(𝐸𝛼 ) converge
to ℶ𝜔1 .
Theorem 2.5.8. Let 𝐸 be an analytic equivalence relation almost reducible to an

orbit equivalence relation of a continuous Polish group action. If 𝜅(𝐸) < ∞ then 𝜅(𝐸) is
not greater than the first 𝜔1 -Erdős cardinal.
Proof. Let 𝜅 be the first 𝜔1 -Erdős cardinal, and suppose that 𝜅(𝐸) > 𝜅; we must
show that 𝜅(𝐸) = ∞. Since the cardinal 𝜅 is the Hanf number for the class of well-
founded models of first order sentences, for every cardinal 𝜆 there is a wellfounded
model 𝑀 such that 𝑀 ⊧ 𝜅(𝐸) > 𝜆. Now, since 𝐸 is almost reducible to an orbit equiv-
alence relation, Corollary 2.7.4 shows that the wellfounded model 𝑀 is correct about
𝜅(𝐸) to the extent that |𝜅(𝐸)𝑀 | ≤ 𝜅(𝐸). It follows that 𝜅(𝐸) > 𝜆, and since 𝜆 was arbi-
trary, 𝜅(𝐸) = ∞. □
Example 2.5.9. For every countable ordinal 𝛼 there is a coanalytic class Γ of struc-
tures on 𝜔, invariant under isomorphism, such that 𝜅(𝔼Γ ) is equal to the first 𝛼-Erdős
cardinal.
Proof. Let Γ be the class of all binary relations on 𝜔 which are extensional, well-
founded, and do not admit a sequence of indiscernibles of ordertype 𝛼; we claim that
this class works.
Clearly, Γ is a coanalytic set of rigid structures invariant under isomorphism. Write
𝐸 for 𝔼Γ and 𝜅 for the first 𝛼-Erdős cardinal. By Theorem 2.4.5, every virtual 𝐸-class is
represented by a transitive set 𝐴 without indiscernibles of ordertype 𝛼. It must be the
case that |𝐴| < 𝜅 so 𝜅(𝐸) ≤ 𝜅. On the other hand, whenever 𝜆 < 𝜅 is an ordinal, then
the structure ⟨𝑉𝜆 , ∈⟩ has no indiscernibles of ordertype 𝛼, and it remains such in every
forcing extension by a wellfoundedness argument. Thus, the Coll(𝜔, 𝑉𝜆 )-name for the
generic isomorph of this structure is 𝐸-pinned, and it is not equivalent to any 𝐸-pinned
name on a poset of cardinality smaller than |𝑉𝜆 | since it entails the collapse of |𝑉𝜆 | to
ℵ0 . Thus, 𝜅(𝐸) = 𝜅 as desired. □
Theorem 2.5.10. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋. Let
𝜅 be a measurable cardinal. If 𝜅(𝐸) < ∞ then 𝜅(𝐸) < 𝜅.
Proof. Suppose that there is a poset 𝑃 and an 𝐸-pinned name 𝜏 on 𝑃 which is
̄
not 𝐸-related to any name on a poset of cardinality smaller than 𝜅. We will produce a
̄
proper class of pairwise non-𝐸-related 𝐸-pinned names.
First note that the poset 𝑃 and the name 𝜏 can be selected so that |𝑃| = 𝜅. Simply
take an elementary submodel 𝑀 of cardinality 𝜅 of large structure with 𝑉𝜅 ⊂ 𝑀 and
consider 𝑄 = 𝑃 ∩ 𝑀 and 𝜎 = 𝜏 ∩ 𝑀; so |𝑄| = 𝜅. As 𝑀 is correct about pinned names
and the equivalence 𝐸̄ by a Shoenfield absoluteness argument, 𝜎 is an 𝐸-pinned name
̄
on 𝑄 and it is not 𝐸-equivalent to any pinned names on posets of cardinality smaller
than 𝜅.
Thus, assume that the poset 𝑃 has size 𝜅. Let 𝑗 ∶ 𝑉 → 𝑁 be any elementary em-
bedding into a transitive model with critical point equal to 𝜅. Note that 𝐻(𝜅) ⊂ 𝑁, so
both 𝑃, 𝜏 are (isomorphic to) elements of 𝑁. Let ⟨𝑁𝛼 , 𝑗𝛽𝛼 ∶ 𝛽 ∈ 𝛼⟩ be the usual system
of iteration of the elementary embedding 𝑗 along the ordinal axis. Let 𝑃𝛼 = 𝑗0𝛼 (𝑃) and
𝜏𝛼 = 𝑗0,𝛼 (𝜏). It will be enough to show that the pairs ⟨𝑃𝛼 , 𝜏𝛼 ⟩ for 𝛼 ∈ Ord are pairwise
̄
𝐸-unrelated. To see this, pick ordinals 𝛼 ∈ 𝛽. As the original poset had size 𝜅, it is the
case that 𝑃𝛼 , 𝜏𝛼 , 𝑃𝛽 , 𝜏𝛽 are in the model 𝑁𝛽 . By the elementarity of the embedding 𝑗0𝛽 ,
𝑁𝛽 ⊧ ¬⟨𝑃𝛼 , 𝜏𝛼 ⟩ 𝐸̄ ⟨𝑃𝛽 , 𝜏𝛽 ⟩. The wellfounded model 𝑁𝛽 is correct about 𝐸̄ by a Shoenfield
absoluteness argument, so ⟨𝑃𝛼 , 𝜏𝛼 ⟩ 𝐸̄ ⟨𝑃𝛽 , 𝜏𝛽 ⟩ fails also in 𝑉 as required. □
Unlike the previous theorems in this section, we do not have a complementary ex-
ample showing that the measurable cardinal bound is, at least to some extent, optimal.
The last theorem in this section provides an estimate of the 𝜆 cardinal for unpinned
equivalence relations. The well-known Silver dichotomy says that every Borel equiva-
lence relation with uncountably many classes has in fact 2ℵ0 many classes. We would
like to show that every unpinned Borel equivalence relation has at least 2ℵ1 many vir-
tual classes. However, in ZFC this is still open. The best we can do is the following.
Theorem 2.5.11. Let 𝐸 be an unpinned Borel equivalence relation. Let 𝜅 be an in-
accessible cardinal. Then Coll(𝜔, < 𝜅) ⊩ 𝜆(𝐸, Coll(𝜔, 𝜔1 )) = 2ℵ1 .
Proof. Let 𝐴 ⊂ 𝒫(𝜅) be a set of cardinality 2𝜅 such that all elements of 𝐴 have
cardinality 𝜅 and any two distinct elements of 𝐴 have intersection of cardinality < 𝜅.
Recall that the poset 𝑃 = Coll(𝜔, < 𝜅) is a finite support product of posets Coll(𝜔, 𝛼)
for 𝛼 ∈ 𝜅. For every set 𝑎 ⊂ 𝜅 write 𝑃𝑎 = Π𝛼∈𝑎 Coll(𝜔, 𝛼) ⊂ 𝑃. Let 𝐺 ⊂ Coll(𝜔, < 𝜅)
be a generic filter. Use Theorem 2.7.1 to argue that for every 𝑎 ∈ 𝐴, 𝑉[𝐺 ∩ 𝑃𝑎 ] ⊧ 𝐸 is
unpinned, and let ⟨𝑄𝑎 , 𝜏𝑎 ⟩ ∈ 𝑉[𝐺∩𝑃𝑎 ] be a nontrivial 𝐸-pinned name with its attendant
poset. It will be enough to show that the pairs ⟨𝑄𝑎 , 𝜏𝑎 ⟩ for 𝑎 ∈ 𝐴 represent pairwise
distinct virtual classes.
Suppose towards a contradiction that for some 𝑎 ≠ 𝑏 in the set 𝐴 the 𝐸-pinned
names 𝜏𝑎 , 𝜏𝑏 are equivalent. Let 𝑐 = 𝑎 ∩ 𝑏 and work in the model 𝑉[𝐺 ∩ 𝑃𝑐 ]. The
assumptions imply that the poset (𝑃𝑎⧵𝑐 ∗ 𝑄𝑎̇ ) × (𝑃𝑏⧵𝑐 ∗ 𝑄𝑏̇ ) forces (at least below some
condition) that 𝜏𝑎 𝐸 𝜏𝑏 . It follows that the name 𝜏𝑎 on the poset 𝑃𝑎⧵𝑐 ∗ 𝑄𝑎̇ is 𝐸-pinned.
Since the equivalence relation 𝐸 is Borel, it follows that that the virtual class of ⟨𝑃𝑎⧵𝑐 ∗
𝑄𝑎̇ , 𝜏𝑎 ⟩ is also represented by some pair ⟨𝑅, 𝜎⟩ by some poset of cardinality smaller than
ℶ𝜔1 < 𝜅 by Theorem 2.5.6. However, in the model 𝑉[𝐺 ∩ 𝑃𝑎 ], there is a filter 𝐻 ⊂ 𝑅
generic over the model 𝑉[𝐺 ∩ 𝑃𝑐 ]. Thus, it would have to be the case that in the model
𝑉[𝐺 ∩ 𝑃𝑎 ], 𝑄𝑎 ⊩ 𝜏𝑎 𝐸 𝜎/𝐻, contradicting the nontriviality of the name 𝜏𝑎 . □
Example 2.5.12. Similarly to the Silver dichotomy, the conclusion of Theorem
2.5.11 fails for analytic equivalence relations. Consider the case of the equivalence
relation 𝔼𝜔1 and an inaccessible cardinal 𝜅 such that 2𝜅 > 𝜅+ . In the Coll(𝜔, < 𝜅)
extension, ℵ2 < 2ℵ1 will hold; at the same time, 𝔼𝜔1 -names realized on Coll(𝜔, 𝜔1 ) are
classified by ordinals of cardinality ℵ1 , so there are only ℵ2 -many of them.
2.5c. Cardinal arithmetic examples. The cardinal invariants 𝜅(𝐸) and 𝜆(𝐸)
provide a basis on which equivalence relations can be compared with uncountable car-
dinals of all sorts. In this section, we will introduce several jump operations which have
direct translations into cardinal arithmetic operations. Using this approach, one can
formally encode statements such as the failure of the singular cardinal hypothesis into
reducibility results between Borel or analytic equivalence relations. For brevity, given
a coanalytic class Γ of structures on 𝜔 invariant under isomorphism, we write 𝜅(Γ) for
𝜅(𝔼Γ ) in this section.
The constructions in this section depend on certain types of jump operators on
structures and equivalence relation. They are all provisionally denoted by the + sign,
not to be confused with the Friedman–Stanley jump. The first jump operation on
equivalence relations we will consider translates into the powerset operation using the
pinned cardinal:
Definition 2.5.13. Let Γ be a coanalytic class of structures on 𝜔, invariant under
isomorphism. Γ+ is the class of structures on 𝜔 of the following description: there is
a partition 𝜔 = 𝑎 ∪ 𝑏 into two infinite sets, there is a Γ-structure on 𝑎, and there is
an extra relation 𝑅 on 𝑏 × 𝑎 such that the vertical sections 𝑅𝑚 for 𝑚 ∈ 𝑏 are pairwise
distinct subsets of 𝑎.
Proposition 2.5.14. Let Γ be a coanalytic class of structures on 𝜔, invariant under
isomorphism.
(1) Γ+ is coanalytic, and if Γ is Borel then so is Γ+ ;
(2) if Γ consists of rigid structures, then so does Γ+ ;
(3) if Γ consists of rigid structures and 𝜅(Γ) = 𝜆+ then 𝜅(Γ+ ) = (2𝜆 )+ .
Proof. The first two items are obvious. For (3), suppose that 𝜅(Γ) = 𝜆+ . Then
there must be a Γ∗∗ structure 𝑀 of cardinality 𝜆 and no Γ∗∗ structures of larger size.
By Theorem 2.4.5 and (2), every virtual 𝔼Γ -class is associated with a Γ∗∗ structure. Ev-
ery (Γ+ )∗∗ -structure consists of a Γ∗∗ -structure and some family of its pairwise distict
subsets; the largest such structure then is of cardinality 2𝜆 exactly. This completes the
proof. □
Corollary 2.5.15. For every countable ordinal 𝛼 there is a Borel class Γ of rigid
structures such that 𝜅(𝔼Γ ) = ℶ+
𝛼.
Proof. By transfinite recursion on 𝛼 define Borel classes Γ𝛼 consisting of rigid

structures as follows. Let Γ0 be the class of structures isomorphic to ⟨𝜔, ∈⟩. Let Γ𝛼+1 =
(Γ𝛼 )+ . For a limit cardinal 𝛼 let Γ𝛼 be the class of structures which consist of exactly one
copy of a structure in class Γ𝛽 for each 𝛽 ∈ 𝛼. It is not difficult to prove by induction
on 𝛼 using the Proposition 2.5.14 at the successor stage and Theorem 2.4.5 at the limit
stage that 𝜅(𝔼Γ ) = ℶ+ 𝛼 as desired. □
Definition 2.5.16. Let Γ be a coanalytic class consisting of structures on 𝜔 in-

variant under isomorphism. Γ+ is the class of structures on 𝜔 of the following descrip-
tion. A structure 𝑀 ∈ Γ+ has a linear order ≤𝑀 . Moreover, writing 𝐿𝑛 for the set
{𝑚 ∈ 𝑀 ∶ 𝑚 ≤𝑀 𝑛}, the structure 𝑀 induces a Γ-structure 𝑀𝑛 on 𝐿𝑛 for coboundedly
many 𝑛 ∈ 𝑀 such that for distinct elements 𝑛0 , 𝑛1 ∈ 𝑀, the structures ⟨𝑀𝑛0 , ≤𝑀 ⟩ and
⟨𝑀𝑛1 , ≤𝑀 ⟩ are nonisomorphic.
Proposition 2.5.17. Let Γ be a coanalytic class of structures on 𝜔, invariant under

isomorphism.
(1) Γ+ is coanalytic;
(2) if Γ is Borel and consists of rigid structures, then Γ+ is Borel and consists of rigid
structures;
(3) if Γ consists of rigid structures, then 𝜅(Γ+ ) = 𝜅(Γ)+ .
Proof. (1) is clear. For (2), the rigidity conclusion is clear. To see the Borelness of
the class Γ+ note that the statement “⟨𝑀, ≤𝑀 ⟩ is isomorphic to ⟨𝑁, ≤𝑁 ⟩” for structures
𝑀, 𝑁 ∈ Γ is Borel by the rigidity of the structures in Γ and the Lusin–Suslin theorem
[58, Theorem 15.1]. For (3), write 𝜅 = 𝜅(Γ). To show that 𝜅(Γ+ ) ≤ 𝜅+ , use Theo-
rem 2.4.5 to argue that every virtual 𝐸Γ+ class is classified by (Γ+ )∗∗ -structure. Such
a structure contains a linear ordering, and on cofinally many initial segments of the
ordering there is a Γ∗∗ -structure. It follows that every initial segment of the ordering is
of cardinality less than 𝜅, so the underlying set has size at most 𝜅.
To show that 𝜅(Γ+ ) ≥ 𝜅+ , treat first the case that 𝜅 is a limit cardinal. Let 𝑀 be the
structure on 𝜅 which includes the usual ∈-ordering on 𝜅 and on each cardinal 𝜆 < 𝜅 on
which there is a Γ∗∗ -structure, 𝑀 contains one. This is a (Γ+ )∗∗ -structure of cardinality
𝜅, so 𝜅(Γ+ ) ≥ 𝜅+ .
Suppose now that 𝜅 is a successor cardinal, 𝜅 = 𝜆+ . This means that there is a
Γ∗∗ -structure 𝑁 of cardinality 𝜆. Let 𝑀 be the structure on 𝜅 which includes the usual
∈-ordering of 𝜅 and on each ordinal 𝜇 < 𝜅 of cardinality 𝜆, it contains a copy of 𝑁. This
is a (Γ+ )∗∗ -structure of cardinality 𝜅, so 𝜅(Γ+ ) ≥ 𝜅+ in this case as well. The proof is
complete. □
Corollary 2.5.18. For every countable ordinal 𝛼 > 0 there is a Borel equivalence
relation 𝐸 such that (provably) 𝜅(𝐸) = ℵ𝛼 .
Proof. Now, by recursion on a countable ordinal 𝛼 construct a Borel class Γ𝛼 of

rigid structures as follows. Γ0 is the set of structures isomorphic to ⟨𝜔, ∈⟩, contain-
ing just one isomorphism class. Then let Γ𝛼+1 = Γ𝛼+ and Γ𝛼 = ⋃𝛽∈𝛼 Γ𝛽 if 𝛼 is limit.
Proposition 2.5.17 can be used to show by transfinite induction that 𝜅(Γ𝛼 ) = ℵ1+𝛼 as
desired. □
Note that an equivalence relation 𝐸 as above for 𝛼 ≥ 2 cannot be reducible to 𝔽2 and
𝔽2 cannot be reducible to it. This answers a question of Kechris [54, Question 17.6.1] in
the negative as well as some related questions of Simon Thomas. To see that 𝔽2 cannot
be Borel reducible to any 𝐸, suppose for contradiction that ℎ ∶ dom(𝐸) → dom(𝔽2 ) is
a Borel reduction. Pass to a generic extension in which 𝔠 > ℵ𝜔1 . There, ℎ is still a
reduction of 𝐸 to 𝐹, while 𝜅(𝐸) > 𝜅(𝐹). This contradicts Theorem 2.5.4. To see that
𝐸 cannot be reducible to 𝔽2 for any 𝛼 > 2, pass to a generic extension in which the
Continuum Hypothesis holds instead.
The following two examples deal with jump operations designed to mimic cardinal
exponentiation. They lead to nonreducibility results which, at least on the face of it, use
the failure of singular cardinal hypothesis in various situations. This means that the
proofs presented use large cardinal assumptions, as they are needed to get the failure
of the singular cardinal hypothesis. We make no claim as to whether the large cardinal
assumptions are necessary for the conclusion.
Definition 2.5.19. Let Γ, Δ be coanalytic classes of structures on 𝜔, invariant un-
der isomorphism. The symbol Γ∆ stands for the coanalytic class of structures 𝑀 on
𝜔 of the following form: 𝜔 is partitioned into infinite sets 𝜔 = 𝑎 ∪ 𝑏 ∪ 𝑐, on 𝑀 ↾ 𝑎
is a structure in class Γ, 𝑀 ↾ 𝑏 is a structure in class Δ, and there is an extra relation
𝑅 ⊂ 𝑐 × 𝑏 × 𝑎 such that for every 𝑚 ∈ 𝑐, the vertical section 𝑅𝑚 is a function from 𝑏 to
𝑎, and for 𝑚0 ≠ 𝑚1 ∈ 𝑐 the vertical sections 𝑅𝑚0 and 𝑅𝑚1 are distinct.
Proposition 2.5.20. Suppose that the classes Γ, Δ consist of rigid structures only.
Then
(1) Γ∆ consists of rigid structures only;
(2) 𝜅(Γ∆ ) = sup{𝜅𝜆 ∶ 𝜅 < 𝜅(Γ), 𝜆 < 𝜅(Δ)}.
Proof. The first item is nearly trivial. For the second item, use Theorem 2.4.5 to
note that a (Γ∆ )∗∗ structure is represented by a Γ∗∗ -structure, a Δ∗∗ -structure, and an
infinite set of functions from the latter to the former. □
Example 2.5.21. Let Δ be the class of structures isomorphic to ⟨𝜔, ∈⟩ (consisting
of just one equivalence class). For every countable ordinal 𝛼, let Γ𝛼 be the class derived
in Corollary 2.5.18. Let 𝐸 be the equivalence relation of isomorphism on the class (Γ𝜔 )∆
and 𝐹 be the isomorphism equivalence relation on the class 𝔼Γ𝛼 . Then 𝐸 is not Borel
reducible to 𝔽2 × 𝐹.
ℵ
Proof. Move to a model of ZFC where 𝔠 = ℵ1 and ℵ𝜔0 > ℵ𝛼 . Proposition 2.5.20
ℵ
shows that 𝜅(𝐸) = ℵ𝜔0 > 𝔠 ⋅ ℵ𝛼 = 𝜅(𝔽2 × 𝐹). The conclusion of the example follows
from Theorem 2.5.4. □
Definition 2.5.22. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋
and 𝐹 be a Borel equivalence relation on a Polish space 𝑌 . 𝐸 𝐹 is the equivalence relation
(𝐹 × 𝐸)+ on the space (𝑌 × 𝑋)𝜔 restricted to the Borel set {𝑧 ∈ (𝑌 × 𝑋)𝜔 ∶ rng(𝑧) is a
partial function from 𝑌 to 𝑋 whose domain consists of pairwise 𝐹-unrelated elements}.
It seems to be impossible to formulate this concept in an analytic form without the

additional demand that 𝐹 be Borel.
Proposition 2.5.23. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋
and 𝐹 be a Borel equivalence relation on a Polish space 𝑌 . Then
(1) 𝜆(𝐸 𝐹 ) = 𝜆(𝐸)𝜆(𝐹) ;
(2) if 𝑃 is a partial order such that 𝑃 ⊩ |𝜆(𝐹)| = |𝜅(𝐹)| = ℵ0 then 𝜆(𝐸 𝐹 , 𝑃) =
𝜆(𝐸, 𝑃)𝜆(𝐹) .
Note that as 𝐹 is assumed to be Borel, the value of 𝜆(𝐹) is not ∞.
Proof. Both statements follow from the classification of virtual classes for prod-
uct and Friedman–Stanley jump in Theorem 2.3.4. An 𝐸 𝐹 -virtual class is represented
by a function from 𝐹-virtual classes to 𝐸-virtual classes. □
Example 2.5.24. Let 𝐹0 be any Borel equivalence relation with countably many
𝐹
classes and let 𝐹1 be the identity on 2𝜔 . For every Borel equivalence relation 𝐸, 𝔼𝜔11 is
𝐹0
not Borel reducible to 𝐸 × 𝔼𝜔1 .
Proof. Move to a model of set theory where 𝔠 = ℵ1 and there is a cardinal 𝜅 >
ℶ𝜔1 such that (𝜅+ )ℵ1 > (𝜅+ )ℵ0 . The first such a cardinal must be in violation of the
singular cardinal hypothesis at cofinality 𝜔1 . Let 𝑃 = Coll(𝜔, 𝜅). Clearly, 𝜆(𝔼𝜔1 , 𝑃) =
𝜅+ , since the pinned names on 𝑃 correspond to ordinals below 𝜅+ . Since 𝐸 is Borel,
𝐹
𝜆(𝐸), 𝜅(𝐸) < ℶ𝜔1 < 𝜅 by Theorem 2.5.6, so Proposition 2.5.23 shows that 𝜆(𝐸 × 𝔼𝜔01 ) =
𝐹
𝜆(𝐸) ⋅ (𝜅+ )ℵ0 = (𝜅+ )ℵ0 < (𝜅+ )ℵ1 = 𝜆(𝔼𝜔11 ). The argument is concluded by a reference
to Theorem 2.5.4. □
A similar argument with a failure of the singular cardinal hypothesis at larger cofinal-
ities yields
Example 2.5.25. Let 𝐹 be any Borel equivalence relation. For every Borel equiv-
+
alence relation 𝐸, 𝔼𝐹𝜔1 is not Borel reducible to 𝐸 × 𝔼𝐹𝜔1 .
2.5d. Hypergraph examples. The previous examples were to some extent arti-
ficial in the sense that the values of the pinned cardinal were directly built into them.
The following examples, all Borel reducible to 𝔽2 , are connected with combinatorics
of small uncountable cardinals via the pinned cardinal, even though the connection is
not at first sight obvious.
Definition 2.5.26. A hypergraph on a set 𝑋 is a subset of 𝑋 ≤𝜔 . If 𝒢 is a hypergraph
on 𝑋, a 𝒢-anticlique is a set 𝐴 ⊂ 𝑋 such that 𝐴≤𝜔 ∩ 𝒢 = 0. If 𝒢 is an analytic hypergraph
on a Polish space 𝑋, write 𝐸𝒢 for the equivalence relation on 𝑋 𝜔 connecting 𝑦, 𝑧 if the
sets rng(𝑦), rng(𝑧) either both fail to be 𝒢-anticliques or they are equal.
It is clear that the equivalence relations of the form 𝐸𝒢 are all analytic and almost Borel
reducible to 𝔽2 . In the common case when 𝒢 is Borel and contains only finite edges,
the equivalence relation is in fact Borel. The following proposition provides a simple
combinatorial characterization of the pinned cardinal of equivalence relations of this
form.
Proposition 2.5.27. Let 𝒢 be an analytic hypergraph on a Polish space 𝑋. Then
𝜅(𝐸𝒢 ) is equal to the larger of ℵ1 and the minimal cardinal 𝜅 such that there is no 𝒢-
anticlique of cardinality 𝜅.
Proof. Write 𝐸 = 𝐸𝒢 and write 𝜅 for the minimum cardinality in which there
is no 𝒢-anticlique. To exclude trivial cases, assume that 𝜅 is uncountable. For the
≤-inequality in the proposition, let 𝑄 be a poset and 𝜎 be an 𝐸-pinned 𝑄-name. By
Example 2.3.5, there must be a set 𝐴 ⊂ 𝑋 such that 𝑄 ⊩ rng(𝜎) = 𝐴.̌ If 𝐴 is not an
anticlique then the 𝐸-pin ⟨𝑄, 𝜎⟩ is trivial as it is forced to belong to the single 𝐸-class
consisting of enumerations of sets which are not anticliques. If 𝐴 is an anticlique, then
the 𝐸-pin ⟨𝑄, 𝜎⟩ is equivalent to a pin on the Coll(𝜔, |𝐴|)-poset which has size less than
𝜅.
For the ≥-inequality, suppose that 𝐴 ⊂ 𝑋 is an anticlique. A simple well-founded-
ness argument shows that 𝐴 remains an anticlique in any generic extension. Thus, the
Coll(𝜔, 𝐴)-name 𝜏𝐴 for a generic enumeration of 𝐴 is 𝐸-pinned an the 𝐸-pin
⟨Coll(𝜔, 𝐴), 𝜏𝐴 ⟩ can be equivalent only to 𝐸-pins on posets which make the cardinal-
ity of 𝐴 countable. □
The values of cardinals defined in this way are subject to forcing manipulations and
transfinite combinatorics. The interesting examples are always connected with a uni-
versality feature of the hypergraph in question. Our first two examples use Borel hy-
pergraphs of finite arity.
Definition 2.5.28. Let 𝑋 be a Polish space. A Borel relation 𝑅 ⊂ [𝑋]<ℵ0 × 𝑋 is
combinatorially universal if it has countable vertical sections and for every cardinal 𝜅
and every relation 𝑇 ⊂ 𝜅<ℵ0 × 𝜅 with countable vertical sections, there is a c.c.c. poset
𝑃 adding an injective function 𝜋 ∶ 𝜅 → 𝑋 which is a homomorphism of 𝑇 to 𝑅.
It is not clear whether combinatorial universality of this sort is actually a property ab-
solute among transitive models of ZFC, but all universal examples found in this section
are absolutely universal.
Theorem 2.5.29. Let 𝑋 be a Polish space. There is a combinatorially universal Borel
relation on [𝑋]<ℵ0 × 𝑋 with countable vertical sections.
Proof. Let 𝑋 = 𝒫(𝜔). We will show that the relation 𝑅 ⊂ [𝑋]<ℵ0 × 𝑋 defined by
⟨𝑎, 𝑥⟩ ∈ 𝑅 if 𝑥 is computable from 𝑎 is universal. Let 𝜅 be a cardinal and let 𝑇 ⊂ [𝜅]𝑛 ×𝜅
be a relation with countable vertical sections. Let ⟨𝑘𝑚 ∶ 𝑚 ∈ 𝜔⟩ be a recursive sequence
of increasing functions in 𝜔𝜔 with disjoint ranges. For a finite set 𝑏 ⊂ 𝒫(𝜔) let 𝑒𝑏 be
the increasing enumeration of the set ⋂ 𝑏, for every 𝑚 ∈ 𝜔 let ℎ𝑚 (𝑏) ⊂ 𝒫(𝜔) be the
set of all 𝑙 ∈ 𝜔 such that 𝑒𝑏 ∘ 𝑘𝑚 (𝑙) is an odd number. We will produce a forcing which
adds an injection 𝜋 ∶ 𝜅 → 𝑋 such that for every finite set 𝑎 ⊂ 𝜅 and every 𝛼 ∈ 𝑇𝑎 , there
is a number 𝑚 ∈ 𝜔 such that 𝜋(𝛼) is modulo finite equal to ℎ𝑚 (𝜋″ 𝑎).
Let 𝑃 be the poset of all tuples 𝑝 = ⟨𝑛𝑝 , 𝜋𝑝 , 𝜈𝑝 ⟩ so that
• 𝑛𝑝 ∈ 𝜔, 𝜋𝑝 is a partial function from 𝜅 to 𝒫(𝑛𝑝 ) with finite domain dom(𝑝);
• 𝜈𝑝 is a finite partial function from 𝒫(dom(𝑝)) × 𝜔 to dom(𝑝) such that
(𝑎, 𝜈𝑝 (𝑎, 𝑚)) ∈ 𝑇 whenever ⟨𝑎, 𝑚⟩ ∈ dom(𝜈𝑝 ).
The ordering on 𝑃 is defined by 𝑞 ≤ 𝑝 if 𝑛𝑝 ≤ 𝑛𝑞 , dom(𝑝) ⊂ dom(𝑞), ∀𝛼 ∈
dom(𝑝) 𝜋𝑝 (𝛼) = 𝜋𝑞 (𝛼) ∩ 𝑛𝑝 , 𝜈𝑝 ⊂ 𝜈𝑞 , and for every ⟨𝑎, 𝑚⟩ ∈ dom(𝜈𝑝 ), whenever 𝑙 is
a number in the domain of (𝑒𝜋″𝑞 𝑎 ⧵ 𝑒𝜋″𝑞 𝑎 ) ∘ 𝑘𝑚 then 𝑒𝜋″𝑞 𝑎 ∘ 𝑘𝑚 (𝑙) is odd if and only if
𝑙 ∈ 𝜋𝑞 (𝜈𝑝 (𝑎, 𝑚)). It is not difficult to see that 𝑃 is indeed an ordering.
Claim 2.5.30. The poset 𝑃 is c.c.c.
Proof. Let ⟨𝑝𝛼 ∶ 𝛼 ∈ 𝜔1 ⟩ be conditions in 𝑃. The usual Δ-system and counting

arguments can be used to thin down the collection if necessary so that the sets dom(𝑝𝛼 )
for 𝛼 ∈ 𝜔1 form a Δ-system with root 𝑏 and for all 𝑎 ∈ [𝑏]𝑛 and all 𝛼 ∈ 𝜔1 , 𝑇𝑎 ∩
dom(𝑝𝛼 ) ⊂ 𝑏. Moreover, we can require that the increasing bijection between dom(𝑝𝛼 )
and dom(𝑝𝛽 ) extends to an isomorphism of 𝑝𝛼 and 𝑝𝛽 for every 𝛼, 𝛽 ∈ 𝜔1 .
We claim that any two conditions in such a collection are compatible. Indeed,
whenever 𝛼, 𝛽 ∈ 𝜔1 , then the condition 𝑞 defined by 𝑛𝑞 = 𝑛𝑞𝛼 , 𝜋𝑞 = 𝜋𝑝𝛼 ∪𝜋𝑝𝛽 and 𝜈𝑞 =
𝜈𝑝𝛼 ∪ 𝜈𝑝𝛽 is easily checked to be a common lower bound of the conditions 𝑝𝛼 , 𝑝𝛽 . □
Claim 2.5.31. Whenever 𝑎 ∈ [𝜅]𝑛 and 𝛽 ∈ 𝑇𝑎 , the set 𝐷𝑎,𝛽 = {𝑝 ∈ 𝑃 ∶ 𝑎 ∪ {𝛽} ⊂

dom(𝑝), ∃𝑚 𝜈𝑝 (𝑎, 𝑚) = 𝛽} is dense in 𝑃.
Proof. Let 𝑝 ∈ 𝑃; we must find a condition 𝑞 ≤ 𝑝 in the set 𝐷𝑎,𝛽 . For definiteness
assume that 𝛽 ∉ dom(𝑝). Choose 𝑚 ∈ 𝜔 such that ⟨𝑎, 𝑚⟩ ∉ dom(𝜈𝑝 ). Consider the
condition 𝑞 ≤ 𝑝 defined by 𝑛𝑞 = 𝑛𝑝 , 𝜋𝑞 = 𝜋𝑝 ∪ {⟨𝛼, 0⟩ ∶ 𝛼 ∈ 𝑎 ⧵ dom(𝑝), ⟨𝛽, 0⟩},
𝜈𝑞 = 𝜈𝑝 ∪ {⟨𝑎, 𝑚, 𝛽⟩}. The condition 𝑞 ≤ 𝑝 is in the set 𝐷𝑎,𝛽 as required. □
Claim 2.5.32. For every finite set 𝑎 ⊂ 𝜅 and every 𝑘 ∈ 𝜔, the set 𝐷𝑎,𝑘 = {𝑝 ∈ 𝑃 ∶ 𝑎 ⊂
dom(𝑝) and the set ⋂ 𝜋𝑝″ 𝑎 has at least 𝑘 elements} is dense in 𝑃.
Proof. Fix 𝑎, 𝑘 and let 𝑝 ∈ 𝑃 be an arbitrary condition. We must find a condition
𝑞 ≤ 𝑝 in the set 𝐷𝑎,𝑘 . First of all, the previous claim shows that one can strengthen 𝑝 to
include all ordinals in 𝑎. Increasing 𝑛𝑝 if necessary, we may also assume that 𝑘 < 𝑛𝑝 .
Consider the set 𝑏 = 𝜋𝑝″ 𝑎 and the function 𝑒𝑏 ; write 𝑘′ = dom(𝑒𝑏 ). If 𝑘 ≤ 𝑘′ then
𝑞 = 𝑝 will work. Otherwise, it is easy to find an increasing sequence 𝑑 = ⟨𝑚𝑖 ∶ 𝑘′ ≤ 𝑖 <
𝑘⟩ of numbers larger than 𝑛𝑝 such that, writing 𝑒 = 𝑒𝑏 ∪ 𝑑, for every natural number
𝑚 such that ⟨𝑎, 𝑚⟩ ∈ dom(𝜈𝑝 ) and every 𝑙 such that 𝑘′ ≤ 𝑘𝑚 (𝑙) < 𝑘, 𝑚𝑘𝑚 (𝑙) is odd if
and only if 𝑙 ∈ 𝑝(𝜈𝑟 (𝑎, 𝑚)). The condition 𝑞 ≤ 𝑝 defined by 𝑛𝑞 = 𝑚𝑘−1 + 1, dom(𝜋𝑞 ) =
dom(𝜋𝑝 ), ∀𝛽 ∈ 𝑎 𝜋𝑞 (𝛽) = 𝜋𝑝 (𝑎) ∪ {𝑚𝑖 ∶ 𝑘′ ≤ 𝑖 < 𝑘}, ∀𝛽 ∈ dom(𝜋𝑝 ) ⧵ 𝑎 𝜋𝑞 (𝛽) = 𝜋𝑝 (𝛽),
and 𝜈𝑞 = 𝜈𝑝 , is in the set 𝐷𝑎,𝑘 as desired. □
The last two claims show that the function 𝜋 ∶ 𝜅 → 𝑋 defined as 𝜋(𝛼) = ⋃{𝜋𝑝 ∶ 𝑝
is in the generic filter} is forced by 𝑃 to be the desired homomorphism. □
Recall that if 𝑅 ⊂ [𝑋]ℵ0 × 𝑋 is a relation then 𝑎 ⊂ 𝑋 is 𝑅-free if for every 𝑥 ∈ 𝑎

⟨𝑎 ⧵ {𝑥}, 𝑥⟩ ∉ 𝑅.
Example 2.5.33. Let 𝑋 be a Polish space and let 𝑅 ⊂ [𝑋]<ℵ0 × 𝑋 be a combinato-
rially universal Borel relation with countable vertical sections. Let 𝑛 ≥ 1 be a number.
Let 𝒢𝑛 be the hypergraph of all sets 𝑎 ∈ [𝑋]𝑛 which are 𝑅-free. Then
(1) 𝜅(𝐸𝒢𝑛 ) ≤ ℵ𝑛+1 ;
(2) if Martin’s Axiom for ℵ𝑛 holds then equality is attained.
Proof. Fix the number 𝑛 ∈ 𝜔. The argument depends on an old theorem of
Sierpiński [40]: ℵ𝑛+1 is the smallest cardinal 𝜅 such that every relation 𝑇 ⊂ [𝜅]𝑛 ×𝜅 with
countable vertical sections has a 𝑇-free 𝑛 + 1-tuple. To prove (1), apply the Sierpiński
theorem to show that there is no 𝒢𝑛 -anticlique of cardinality at least ℵ𝑛+1 . To prove
(2), let 𝜅 = ℵ𝑛 and use the Sierpiński theorem again to find a relation 𝑇 ⊂ 𝜅<ℵ0 ×
𝜅 with countable vertical sections and no 𝑇-free 𝑛-tuple. Then use the universality
assumption to find an injective homomorphism 𝜋 ∶ 𝜅 → 𝑋 which is a homomorphism
of 𝑇 to 𝑅. Observe that rng(𝜋) is a 𝒢𝑛 -anticlique of cardinality 𝜅. Proposition 2.5.27

then implies that 𝜅(𝐸𝒢𝑛 ) ≥ 𝜅+ = ℵ𝑛+1 . □
Definition 2.5.34. Let 𝑋 be a Polish space. A Borel equivalence relation 𝑅 on
<ℵ0
[𝑋] with countably many classes is combinatorially universal if for every cardinal
𝜅 and every equivalence relation 𝑇 on [𝜅]<ℵ0 with countably many classes, there is a
c.c.c. poset 𝑃 adding an injection 𝜋 ∶ 𝜅 → 𝑋 which is a homomorphism of ¬𝑇 to ¬𝑅.
Theorem 2.5.35. Let 𝑋 be a Polish space. There is a combinatorially universal Borel
equivalence relation on [𝑋]<ℵ0 with countably many classes.
Proof. Without loss of generality assume 𝑋 = [𝜔]ℵ0 . Consider the following
relation 𝑅 on [𝑋]<ℵ0 . Define a Borel function 𝑔 ∶ [𝑋]<ℵ0 → [𝜔]<ℵ0 by 𝑔(𝑎) = {min(𝑥 ⧵
𝑚 + 1) ∶ 𝑥 ∈ 𝑎} if 𝑎 is a set of cardinality at least two and consists of pairwise almost
disjoint sets and 𝑚 is the largest number which appears in at least two of them; 𝑔(𝑎) =
min(𝑥) if 𝑎 = {𝑥} is a singleton; and otherwise 𝑔(𝑎) = 0. Let 𝑅 be the equivalence
relation induced by the function 𝑔. We will show that 𝑅 is universal.
Let 𝜅 be a cardinal, 𝑇 an equivalence relation on [𝜅]<ℵ0 with countably many
classes, and let 𝑓 ∶ [𝜅]<ℵ0 → 𝜔 be a map inducing the equivalence relation 𝑇. Let
𝜈 ∶ [𝜔]<ℵ0 → 𝜔 be a sufficiently generic map such that 𝜈(𝑔(0)) = 𝑓(0). Let 𝑃 be the
poset of all maps 𝑝 such that
• dom(𝑝) ⊂ 𝜅 is a finite set;
• for every 𝛼 ∈ dom(𝑝) the value 𝑝(𝛼) is a nonempty subset of 𝜔;
• for every 𝛼 ∈ dom(𝑝), 𝜈(min(𝑝(𝛼))) = 𝑓(𝛼);
• for every set 𝑎 ⊂ dom(𝑝) of cardinality at least 2 there is a number which
belongs to at least two sets 𝑝(𝛼), 𝑝(𝛽) for 𝛼 ≠ 𝛽 ∈ 𝑎, and writing 𝑚 for the
largest such number, 𝑝(𝛼)⧵𝑚+1 ≠ 0 holds for every 𝛼 ∈ 𝑎, and 𝜈({min(𝑝(𝛼)⧵
𝑚 + 1) ∶ 𝛼 ∈ 𝑎}) = 𝑓(𝑎).
The ordering is defined by 𝑞 ≤ 𝑝 if for every 𝛼 ∈ dom(𝑝), 𝑞(𝛼) end-extends 𝑝(𝛼), and
the sets 𝑞(𝛼) ⧵ 𝑝(𝛼) are pairwise disjoint for 𝛼 ∈ dom(𝑝).
Claim 2.5.36. 𝑃 is c.c.c.
Proof. In fact, 𝑃 is semi-Cohen in the sense of [4], but we will not need that fact
here. By the usual Δ-system arguments, it is enough to show that any two conditions
𝑝, 𝑞 ∈ 𝑃 such that 𝑝 ↾ dom(𝑝) ∩ dom(𝑞) = 𝑞 ↾ dom(𝑝) ∩ dom(𝑞), are compatible. To
find the lower bound, enumerate dom(𝑝)∪dom(𝑞) as 𝛽𝑖 for 𝑖 ∈ 𝑘, enumerate (dom(𝑝)⧵
dom(𝑞)) × (dom(𝑞) ⧵ dom(𝑝)) as 𝑢𝑗 for 𝑗 ∈ 𝑙. Use the genericity of the function 𝜈 to
𝑗
build numbers 𝑚0 < 𝑚1 < ⋯ < 𝑚𝑙−1 and pairwise distinct numbers 𝑛𝑖 for 𝑖 ∈ 𝑘 and
𝑗 ∈ 𝑙 so that
• 𝑚0 > max(⋃ rng(𝑝) ∪ ⋃ rng(𝑞));
𝑗
• 𝑚𝑗 < 𝑛𝑖 < 𝑚𝑗−1 for every 𝑗 ∈ 𝑙;
𝑗
• for every set 𝑎 ⊂ dom(𝑝) ∪ dom(𝑞), 𝜈({𝑛𝑖 ∶ 𝛽𝑖 ∈ 𝑎}) = 𝑓(𝑎).
The lower bound is then a function 𝑟 defined by dom(𝑟) = dom(𝑝) ∪ dom(𝑞), for 𝛼 ∈
𝑗
dom(𝑝), 𝛼 = 𝛽𝑖 set 𝑟(𝛼) = 𝑝(𝛼) ∪ {𝑛𝑖 ∶ 𝑗 ∈ 𝑙} ∪ {𝑚𝑗 ∶ 𝛼 appears in the pair 𝑢𝑗 }. Similarly,
𝑗
for 𝛼 ∈ dom(𝑞), 𝛼 = 𝛽𝑖 set 𝑟(𝛼) = 𝑞(𝛼) ∪ {𝑛𝑖 ∶ 𝑗 ∈ 𝑙} ∪ {𝑚𝑗 ∶ 𝛼 appears in the pair 𝑢𝑗 }.
It is not difficult to check that 𝑟 ≤ 𝑝, 𝑞 as required. □
Claim 2.5.37. The set 𝐷𝛼 = {𝑝 ∈ 𝑃 ∶ 𝛼 ∈ dom(𝑝)} is dense in 𝑃 for every 𝛼 ∈ 𝜅.
Proof. Let 𝛼 ∈ 𝜅 and 𝑝 ∈ 𝑃; we must produce 𝑞 ≤ 𝑝 such that 𝛼 ∈ dom(𝑞).

Enumerate dom(𝑝) as 𝛽𝑖 for 𝑖 ∈ 𝑘 and write 𝛼 = 𝛽𝑘 . Use the genericity of the function
𝑗
𝜈 to find numbers 𝑚 < 𝑚0 < 𝑚1 < . . . 𝑚𝑘−1 and pairwise distinct numbers 𝑛𝑖 for
𝑖 ∈ 𝑘, 𝑗 ∈ 𝑘 + 1 so that
• 𝜈(𝑚) = 𝑓(𝛼) and 𝑚0 > max ⋃ rng(𝑝);
𝑗
• 𝑚𝑖 < 𝑛𝑖 for every 𝑗 ∈ 𝑘 + 1;
𝑗
• for every nonempty set 𝑎 ⊂ dom(𝑝) ∪ {𝛼} and every 𝑖 ∈ 𝑘, 𝜈({𝑛𝑖 ∶ 𝛽𝑗 ∈ 𝑎}) =
𝑓(𝑎).
Once this is done, just consider the function 𝑞 defined by dom(𝑞) = dom(𝑝) ∪ {𝛼},
𝑠(𝛼) = {𝑚, 𝑚𝑖 ∶ 𝑖 ∈ 𝑘, 𝑛𝑘𝑖 ∶ 𝑖 ∈ 𝑘}, and for every 𝑖 ∈ 𝑘, 𝑞(𝛽𝑖 ) = 𝑝(𝛽𝑖 ) ∪ {𝑚𝑖 , 𝑛𝑗𝑖 ∶ 𝑗 ∈ 𝑘}.
It is not difficult to observe that 𝑞 ∈ 𝑃 and 𝑞 ≤ 𝑝 as desired. □
Now, if 𝐺 ⊂ 𝑃 is a generic filter, then in 𝑉[𝐺] let 𝜋 ∶ 𝜅 → 𝒫(𝜔) be defined by 𝜋(𝛼) =

⋃𝑝∈𝐺 𝑝(𝛼). The claims show that 𝑓 = 𝜈 ∘ 𝑔 ∘ 𝜋, in particular 𝜋 is a homomorphism of
¬𝑇 to ¬𝑅. □
Example 2.5.38. Let 𝑋 be a Polish space and 𝑅 a combinatorially universal equiv-

alence relation on [𝑋]<ℵ0 with countably many classes. Let 𝑛 > 0 be a number. Let 𝒢𝑛
be the Borel hypergraph on 𝑋 consisting of all finite sets 𝑎 ⊂ 𝑋 which can be written
in more than 2𝑛 − 1 ways as a union of two distinct 𝑅-equivalent sets. Then
(1) 𝜅(𝐸𝒢𝑛 ) ≤ ℵ𝑛+1 ;
(2) if Martin’s Axiom for ℵ𝑛 holds, then the equality is attained.
Proof. Fix the number 𝑛. The computations depend on and are motivated by
the following results of Komjáth and Shelah [67]. Let 𝜅 = ℵ𝑛 . For every equivalence
relation 𝑇 on [𝜅]<ℵ0 with countably many classes, there is a finite set 𝑎 ⊂ 𝜅 which can
be written in at least 2𝑛 − 1 ways as a union of two distinct 𝑇-related sets. In addition,
if Martin’s Axiom for 𝜅 holds then there is an equivalence relation 𝑇 on [𝜅]<ℵ0 with
countably many classes such that every finite set 𝑎 ⊂ 𝜅 can be written in at most 2𝑛 − 1
ways as a union of two distinct 𝑇-related sets.
For (1), the first part of this result shows that there is no 𝒢𝑛 -anticlique of cardinality
+
𝜅 . For (2), use Martin’s Axiom and the second part of the Komjáth–Shelah result
to find the equivalence relation 𝑇 on [𝜅]<ℵ0 with countably many classes as above,
and use the universality of the relation 𝑅 to find an injective homomorphism 𝜋 ∶ 𝜅 →
𝑋 of ¬𝑇 to ¬𝑅. It is immediate that rng(𝜋) ⊂ 𝑋 is a 𝒢𝑛 -anticlique of cardinality 𝜅.
Proposition 2.5.27 then implies that 𝜅(𝐸𝒢𝑛 ) ≥ 𝜅+ = ℵ𝑛+1 . □
Much more complicated effects can be realized if the hypergraph 𝒢 is allowed to have
infinite edges. We conclude this section with an example of this type.
Definition 2.5.39. Let 𝑋 be a Polish space. A Borel equivalence relation 𝑅 on

𝑋 2 with countably many classes is combinatorially universal if for every ordinal 𝜅 and
every equivalence relation 𝑇 on 𝜅2 with countably many classes, there is a c.c.c. poset
𝑃 adding an injective function 𝜋 ∶ 𝜅 → 𝑋 which is a homomorphism of ¬𝑇 to ¬𝑅.
Theorem 2.5.40. There is a combinatorially universal Borel equivalence relation

with countably many classes on 𝑋 2 for every Polish space 𝑋.
Proof. Without loss of generality, assume 𝑋 = 𝒫(𝜔). Let 𝜔 = ⋃𝑛,𝑚∈𝜔 𝑎𝑛,𝑚 be a

partition of 𝜔 into infinite sets. For almost disjoint sets 𝑏, 𝑐 ⊂ 𝜔 such that 𝑏 is lexico-
graphically less than 𝑐 define 𝑓(𝑏, 𝑐) = 𝑛 and 𝑓(𝑐, 𝑏) = 𝑚 if max(𝑏 ∩ 𝑐) ∈ 𝑎𝑛,𝑚 , in other
cases define 𝑓(𝑏, 𝑐) = 0. Let 𝑅 be the equivalence relation induced by the function 𝑓.
We will show that 𝑅 is combinatorially universal.
Fix a cardinal 𝜅 and a function 𝑔 ∶ 𝜅2 → 𝜔 which induces an equivalence relation
𝑇 with countably many classes. Define the poset 𝑃 as the collection of all functions 𝑝
such that
• dom(𝑝) ⊂ 𝜅 is a finite set;
• rng(𝑝) consists of finite subsets of 𝜔 such that neither of them is an initial
segment of another;
• for every 𝛼 ≠ 𝛽 such that 𝑝(𝛼) is lexicographically smaller than 𝑝(𝛽), the
set 𝑝(𝛼) ∩ 𝑝(𝛽) is nonempty, and its maximum belongs to the set 𝑎𝑚,𝑛 where
𝑔(𝛼, 𝛽) = 𝑚 and 𝑔(𝛽, 𝛼) = 𝑛.
The ordering on 𝑃 is defined by 𝑞 ≤ 𝑝 if dom(𝑝) ⊂ dom(𝑞), for every 𝛼 ∈ dom(𝑝)
the set 𝑝(𝛼) is an initial segment of 𝑞(𝛼), and the sets {𝑞(𝛼) ⧵ 𝑝(𝛼) ∶ 𝛼 ∈ dom(𝑝)} are
pairwise disjoint. The following routine claims complete the proof of the theorem.
Claim 2.5.41. The poset 𝑃 is c.c.c.
Proof. By the usual Δ-system arguments it is only necessary to show that any
two conditions 𝑝, 𝑞 ∈ 𝑃 such that 𝑝 ↾ dom(𝑝) ∩ dom(𝑞) = 𝑞 ↾ dom(𝑝) ∩ dom(𝑞) are
compatible in the poset 𝑃. Strengthening the conditions 𝑝, 𝑞 on dom(𝑝) ⧵ dom(𝑞) and
dom(𝑝)⧵dom(𝑞) respectively if necessary, we may assume that no set in rng(𝑝)∪rng(𝑞)
is an initial segment of another. Enumerate (dom(𝑝) ⧵ dom(𝑞)) × (dom(𝑞) ⧵ dom(𝑝))
as 𝑢𝑖 for 𝑖 ∈ 𝑗 and find pairwise distinct numbers 𝑚𝑖 for 𝑖 ∈ 𝑗 such that
• if 𝑢𝑖 = ⟨𝛼, 𝛽⟩ and 𝑝(𝛼) is lexicographically smaller than 𝑞(𝛽) then 𝑚𝑖 ∈ 𝑎𝑚,𝑛
where 𝑔(𝛼, 𝛽) = 𝑚 and 𝑔(𝛽, 𝛼) = 𝑛;
• if 𝑢𝑖 = ⟨𝛼, 𝛽⟩ and 𝑝(𝛼) is lexicographically greater than 𝑞(𝛽) then 𝑚𝑖 ∈ 𝑎𝑚,𝑛
where 𝑔(𝛼, 𝛽) = 𝑛 and 𝑔(𝛽, 𝛼) = 𝑚;
• all numbers 𝑚𝑖 are greater than max(⋃ rng(𝑝) ∪ ⋃ rng(𝑞)).
In the end, let 𝑟 be the function defined by dom(𝑟) = dom(𝑝) ∪ dom(𝑞), for all 𝛼 ∈
dom(𝑝) let 𝑟(𝛼) = 𝑝(𝛼) ∪ {𝑚𝑖 ∶ 𝛼 appears in 𝑢𝑖 }, and for all 𝛽 ∈ dom(𝑞) let 𝑟(𝛽) =
𝑞(𝛽) ∪ {𝑚𝑖 ∶ 𝛽 appears in 𝑢𝑖 }. It is not difficult to check that 𝑟 is a common lower bound
of the conditions 𝑝, 𝑞 as desired. □
Claim 2.5.42. For every 𝛼 ∈ 𝜅 the set 𝐷𝛼 = {𝑝 ∈ 𝑃 ∶ 𝛼 ∈ dom(𝑟)} is dense in 𝑃.
Proof. Let 𝛼 ∈ 𝜅 be an ordinal and 𝑝 ∈ 𝑃 be a condition; we must produce a

condition 𝑞 ≤ 𝑝 such that 𝛼 ∈ dom(𝑞). It will be the case that 𝑞(𝛼) ∩ max(⋃ rng(𝑝)) +
1 = 0; this way, 𝑞(𝛼) will be lexicographically smaller than all 𝑞(𝛽) for 𝛽 ∈ dom(𝑝).
List dom(𝑝) as 𝛽𝑖 for 𝑖 ∈ 𝑗, and find pairwise distinct numbers 𝑚𝑖 for 𝑖 ∈ 𝑗 so that
• 𝑚𝑖 ∈ 𝑎𝑚,𝑛 where 𝑔(𝛼, 𝛽) = 𝑚 and 𝑔(𝛼, 𝛽) = 𝑛;
• each 𝑚𝑖 is greater than max(⋃ rng(𝑝)).
Then, let 𝑞 be the function defined by dom(𝑞) = dom(𝑝) ∪ {𝛼} and 𝑞(𝛽𝑖 ) = 𝑝(𝛽𝑖 ) ∪
{𝑚𝑖 } and 𝑞(𝛼) = {𝑚𝑖 ∶ 𝑖 ∈ 𝑗}. It is immediate that the condition 𝑞 works. □
Now it is easy to see that if 𝐺 ⊂ 𝑃 is a generic filter, the function 𝜋 ∶ 𝜅 → 𝒫(𝜔)

defined by 𝜋(𝛼) = ⋃{𝑝(𝛼) ∶ 𝑝 ∈ 𝐺} induces a homomorphism of ¬𝑇 to ¬𝑅 as desired.
□
Example 2.5.43. Let 𝑋 be a Polish space and let 𝑅 be a combinatorially universal
Borel equivalence relation on 𝑋 2 with countably many classes. Let 𝒢 be the hypergraph
on 𝑋 consisting of all unions 𝑏0 ∪ 𝑏1 where 𝑏0 , 𝑏1 are infinite sets such that 𝑏0 × 𝑏1 is a
subset of a single 𝑅-class.
(1) if Chang’s conjecture holds, then 𝜅(𝐸𝒢 ) ≤ ℵ2 ;
(2) if Martin’s Axiom for ℵ2 holds then Chang’s conjecture is equivalent to 𝜅(𝐸𝒢 )
≤ ℵ2 .
Proof. The argument is based on and motivated by two results of Todorcevic
[105]. Namely, if Chang’s conjecture holds, then for every partition of 𝜔22 into countably
many pieces, one piece of the partition contains a product of infinite sets. In addition,
if Martin’s Axiom for ℵ2 holds and Chang’s conjecture fails, then there is a partition of
𝜔22 into countably many pieces such that no piece of the partition contains a product of
infinite sets.
Now, for (1) use the first result of Todorcevic to argue that under Chang’s conjec-
ture there is no 𝒢-anticlique of cardinality ℵ2 , so by Proposition 2.5.27, 𝜅(𝐸𝒢 ) ≤ ℵ2 . For
(2), suppose that Martin’s Axiom holds and Chang’s conjecture fails. By the second re-
sult of Todorcevic, find an equivalence relation 𝑇 on 𝜔22 with countably many classes
without any monochromatic infinite rectangles. Use the universality of the equiva-
lence relation 𝑅 to find an injection 𝜋 ∶ 𝜔2 → 𝑋 which is a homomorphism of ¬𝑇
to ¬𝑅. Observe that rng(𝜋) is a 𝒢-anticlique of cardinality ℵ2 . By Proposition 2.5.27,
𝜅(𝐸𝒢 ) > ℵ2 . □
2.6. Restrictions on partial orders

Given an analytic equivalence relation 𝐸 on a Polish space 𝑋, it may be informative
to investigate which posets can carry nontrivial 𝐸-pinned names. After all, essentially
all pinned names discussed in this chapter naturally live on collapse posets, so one may
easily (and wrongly) assume that no forcing sophistication is needed when it comes to
the investigation of the virtual realm. This section contains several theorems on this
topic.
First of all, there are some partial orders which can never carry a nontrivial pinned
name.
Definition 2.6.1. [33] A poset 𝑃 is reasonable if for every ordinal 𝜆 and for every
function 𝑓 ∶ 𝜆<𝜔 → 𝜆 in the 𝑃-extension there is a set 𝑎 ⊂ 𝜆 which is closed under 𝑓,
belongs to the ground model, and is countable in the ground model.
In particular, all c.c.c. and all proper forcings are reasonable. Good examples of un-
reasonable forcings are posets which collapse ℵ1 , Namba forcing and Prikry forcing.
Theorem 2.6.2. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋. If 𝑃
is a reasonable forcing and 𝜏 is an 𝐸-pinned name on 𝑃, then 𝜏 is trivial.
Proof. Suppose that 𝑃 is a reasonable poset and 𝜏 is an 𝐸-pinned name on 𝑃. We
will produce a condition 𝑝 ∈ 𝑃 and a point 𝑥 ∈ 𝑋 such that 𝑝 ⊩ 𝜏 𝐸 𝑥.̌ Towards
2.6. RESTRICTIONS ON PARTIAL ORDERS 59
this end, choose a large structure and use the reasonability of 𝑃 to find a countable
elementary submodel 𝑀 of it containing 𝑃, 𝐸 and 𝜏 and a condition 𝑝 ∈ 𝑃 such that
𝑝 ⊩ 𝐺∩ ̇ 𝑀̌ is generic over 𝑀,̌ where 𝐺̇ is the canonical 𝑃-name for its generic ultrafilter.
As 𝑀 is countable, there is a filter 𝐻 ⊂ 𝑃 ∩ 𝑀 generic over 𝑀 in the ground model 𝑉.
Let 𝑥 = 𝜏/𝐻 ∈ 𝑋. Proposition 2.1.5 applied to the model 𝑀 and the filters 𝐻 and 𝐺̇ ∩ 𝑀
now says that 𝑝 ⊩ 𝑥̌ 𝐸 𝜏, completing the proof. □
The key feature of partial orders from the point of view of existence of pinned
names is collapsing ℵ1 , as the following theorem shows:
Theorem 2.6.3. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋. Ex-
actly one of the following occurs:
(1) 𝐸 is pinned;
(2) for every poset 𝑃 collapsing ℵ1 , 𝑃 carries a nontrivial 𝐸-pinned name.
Proof. Clearly (1) implies the negation of (2). For the difficult direction, suppose
that (1) fails and work to confirm (2). Let 𝜏 be a nontrivial 𝐸-pinned name on some
poset 𝑃. Let ⟨𝑀𝛼 ∶ 𝛼 ∈ 𝜔1 ⟩ be a continuous ∈-tower of countable elementary submod-
els of a large structure containing 𝑋, 𝐸, 𝜏, and 𝑃. Let 𝑀 = ⋃𝛼 𝑀𝛼 , let 𝑄 = 𝑃 ∩ 𝑀 and
let 𝜎 = 𝜏 ∩ 𝑀.
First, observe that the pair ⟨𝑄, 𝜎⟩ is an 𝐸-pin: by elementarity, 𝑀 ⊧ 𝑄 × 𝑄 ⊩ 𝜎left 𝐸
𝜎right , and by the Mostowski absoluteness between the generic extensions of 𝑀 and 𝑉,
𝑉 ⊧ 𝑄 × 𝑄 ⊩ 𝜎left 𝐸 𝜎right as well. We will now prove that the pair ⟨𝑄, 𝜏⟩ is a non-trivial
𝐸-pin.
Assume towards a contradiction that there exists a point 𝑥 ∈ 𝑋 such that 𝑄 ⊩
𝜎 𝐸 𝑥.̌ We will show that there then must be 𝑦 ∈ 𝑀 ∩ 𝑋 which is 𝐸-related to 𝑥.
Then 𝑄 ⊩ 𝜎 𝐸 𝑦,̌ by the Mostowski absoluteness between the 𝑄-extensions of 𝑀 and
𝑉 𝑀 ⊧ 𝑃 ⊩ 𝜏 𝐸 𝑦,̌ and this will contradict the elementarity of the model 𝑀 and the
nontriviality of the name 𝜏.
To find the point 𝑦 ∈ 𝑀 ∩ 𝑋, let 𝑁 be a countable elementary submodel of a large
structure containing ⟨𝑀𝛼 ∶ 𝛼 ∈ 𝜔1 ⟩, 𝑄, 𝑥. Since the tower of models ⟨𝑀𝛼 ∶ 𝛼 ∈ 𝜔1 ⟩ is
continuous, there is a limit ordinal 𝛼 ∈ 𝜔1 such that 𝑀𝛼 = 𝑁 ∩ 𝑀. Let 𝑄𝛼 = 𝑄 ∩ 𝑀𝛼 =
𝑃 ∩ 𝑀𝛼 and 𝜎𝛼 = 𝜎 ∩ 𝑀𝛼 = 𝜏 ∩ 𝑀𝛼 . By elementarity of the model 𝑁 and analytic
absoluteness between the 𝑄𝛼 -extension of 𝑁 and 𝑉, 𝑄𝛼 ⊩ 𝜎𝛼 𝐸 𝑥.̌ Since 𝑄𝛼 = 𝑃 ∩ 𝑀𝛼
and 𝜎𝛼 = 𝜏 ∩ 𝑀𝛼 , both 𝑄𝛼 , 𝜏𝛼 belong to the model 𝑀𝛼+1 . By the elementarity of the
model 𝑀𝛼+1 , there must be a point 𝑦 ∈ 𝑋 ∩ 𝑀𝛼+1 such that 𝑄𝛼 ⊩ 𝜎𝛼 𝐸 𝑦 ̌ (since the
point 𝑥 is such). By the transitivity of 𝐸, it follows that 𝑥 𝐸 𝑦. The point 𝑦 ∈ 𝑀𝛼+1 ⊂ 𝑀
works.
Now, suppose that 𝑅 is a poset collapsing ℵ1 . Since |𝑀| = ℵ1 , in the 𝑅-extension
there is a filter 𝑄-generic over 𝑀. Let 𝐻̇ be an 𝑅-name for such a filter and let 𝜈 be the
𝑅-name for 𝜎/𝐻.̇ By the Mostowski absoluteness between the generic extensions of 𝑀
and 𝑉 again, it follows that 𝑄 × 𝑅 ⊩ 𝜎 𝐸 𝜈. We have just proved that 𝜈 is a nontrivial
𝐸-pinned name on 𝑅. □
Theorem 2.6.3 does not rule out the possibility that some ℵ1 preserving posets carry
nontrivial 𝐸-pinned names. This does not occur for orbit equivalence relations. In
them, every pinned name is inescapably connected with a collapse of a certain cardinal
to ℵ0 . To state this in the most informative way, we introduce a piece of notation. Let
𝐸 be an analytic equivalence relation on a Polish space 𝑋, and let 𝑐 be a virtual 𝐸-class.
We write 𝜅(𝑐) for the smallest cardinality of a poset 𝑃 such that there is an 𝐸-pinned
𝑃-name 𝜎 such that the 𝐸-pin ⟨𝑃, 𝜎⟩ belongs to 𝑐.
Theorem 2.6.4. Let 𝐸 be an equivalence relation on a Polish space 𝑋, Borel reducible
to an orbit equivalence relation of a Polish group action. Let 𝑐 be a virtual 𝐸-class and
write 𝜅 = 𝜅(𝑐). The following are equivalent for every poset 𝑃:
(1) there is an 𝐸-pinned 𝑃-name 𝜎 such that the 𝐸-pin ⟨𝑃, 𝜎⟩ belongs to 𝑐;
(2) 𝑃 ⊩ |𝜅| = ℵ0 .
Proof. (2) implies (1) is the easier direction, and it does not use the assumption
on the equivalence relation 𝐸. Suppose that 𝑃 ⊩ |𝜅| = ℵ0 |. Let ⟨𝑅, 𝜏⟩ be an 𝐸-pin in
𝑐 such that |𝑅| = 𝜅. Let 𝑀 be an elementary submodel of a large structure such that
|𝑀| = 𝜅, 𝑅 ⊂ 𝜅, and 𝑅, 𝜏 ∈ 𝑀. By the collapsing assumption, there is a 𝑃-name 𝜂 for
a filter on 𝑅 which is generic over the model 𝑀. Let 𝜎 be a 𝑃-name for 𝜏/𝜂. We claim
that 𝜎 is 𝐸-pinned and moreover ⟨𝑃, 𝜎⟩ ∈ 𝑐.
To this end, let 𝐺 ⊂ 𝑃 and 𝐻 ⊂ 𝑅 be mutually generic filters; we must show that
𝜏/𝐺 𝐸 𝜎/𝐻. To see this, observe that the filters 𝜂/𝐺 ⊂ 𝑅 and 𝐻 ⊂ 𝑅 are mutually
generic over the model 𝑀, so 𝑀[𝜂/𝐺, 𝐻] ⊧ 𝜎/𝜂/𝐺 𝐸 𝜎/𝐻 as the name 𝜎 is 𝐸-pinned
and 𝑀 is an elementary submodel. 𝜎/𝜂/𝐺 = 𝜏/𝐺 𝐸 𝜎/𝐻 then follows by the Mostowski
absoluteness between the models 𝑀[𝜂/𝐺, 𝐻] and 𝑉[𝐺, 𝐻].
For the harder direction (1) implies (2), first fix a Polish group Γ, an action of Γ on
a Polish space 𝑌 , and a Borel function ℎ ∶ 𝑋 → 𝑌 which is a reduction of 𝐸 to the orbit
equivalence relation 𝐹 induced by the action of Γ. Suppose that 𝜎 is an 𝐸-pinned name
on 𝑃 such that the 𝐸-pin ⟨𝑃, 𝜎⟩ belongs to 𝑐. Consider the Cohen poset 𝑃Γ of nonempty
open subsets of Γ, with its associated name 𝛾𝑔𝑒𝑛 ̇ for a generic element of Γ. Consider
the product 𝑃Γ × 𝑃 and the poset 𝑄, the subset of the complete Boolean algebra of 𝑃Γ × 𝑃
which is generated by the name 𝜏 for 𝛾𝑔𝑒𝑛 ̇
̇ ⋅ ℎ(𝜎), an element of the space 𝑌 . Since the
poset 𝑃Γ is countable, it preserves all cardinals. Therefore, to show that 𝑃 collapses 𝜅,
it will be enough to show that 𝑄 collapses 𝜅.
Claim 2.6.5. Let 𝐻 ⊂ 𝑄 be a generic filter. In 𝑉[𝐻], 𝑃Γ forces the point 𝛾𝑔𝑒𝑛
̇ ⋅𝜏/𝐻 ∈ 𝑌
to be 𝑄-generic over 𝑉[𝐻].
The difficulty resides in the assertion that the point is forced to be 𝑄-generic over 𝑉[𝐻]
and not just over 𝑉.
Proof. Let 𝛾0 , 𝛾1 , 𝛾2 ∈ Γ and 𝐾0 , 𝐾1 ⊂ 𝑃 be 𝑃Γ -generic points and generic filters on
𝑃 respectively, which are in addition mutually generic. Since 𝜎 is an 𝐸-pinned name,
𝜎/𝐾0 𝐸 𝜎/𝐾1 holds. Since ℎ is a reduction of 𝐸 to 𝐹, ℎ(𝜎/𝐾0 ) 𝐹 ℎ(𝜎/𝐾1 ) holds. Writing
𝑦0 = ℎ(𝜎/𝐾0 ) and 𝑦1 = ℎ(𝜎/𝐾1 ), there must be a group element 𝛿 ∈ Γ such that
𝛿𝛾0 ⋅ 𝑦0 = 𝛾1 ⋅ 𝑦1 in the model 𝑉[𝛾0 , 𝐾0 ][𝛾1 , 𝐾1 ]. Observe that both points 𝛾2 𝛿 and 𝛾2 𝛾1
are 𝑃Γ -generic over the model 𝑉[𝛾0 , 𝐾0 ][𝛾1 , 𝐾1 ] since 𝛾2 is, and multiplication by 𝛿 (or
𝛾1 ) from the right induces an automorphism of the poset 𝑃Γ .
It follows that 𝛾2 𝛿 is 𝑃Γ -generic, and the pair 𝛾2 𝛾1 , 𝐾1 is 𝑃Γ × 𝑃-generic, both over the
model 𝑉[𝛾0 , 𝐾0 ]. Observe that 𝛾2 𝛿𝛾0 ⋅ 𝑦0 = 𝛾2 𝛾1 ⋅ 𝑦1 by the initial choice of 𝛿. The claim
now follows by considering the filter 𝐻 ⊂ 𝑄 (generic over 𝑉) obtained from the point
𝛾0 ⋅ 𝑦0 ∈ 𝑌 , and the point 𝛾2 𝛿 ∈ Γ (𝑃Γ -generic over 𝑉[𝐻]), and the forcing theorem. □
Now, let 𝐻 ⊂ 𝑄 be a generic filter, and work in 𝑉[𝐻]. Since the poset 𝑃Γ has a
countable dense subset and it introduces a generic for 𝑄, it must be the case that 𝑄 has
2.7. ABSOLUTENESS 61
a countable dense subset as well. Back in 𝑉, the forcing theorem says that 𝑄 forces 𝑄̌
to have a countable dense subset. Fix a 𝑄-name 𝜂 for a function from 𝜔 to 𝑄 whose
range is forced to be dense, and let 𝐷 = {𝑞 ∈ 𝑄 ∶ ∃𝑟 ∃𝑚 ∈ 𝜔 𝑟 ⊩ 𝜂(𝑚) = 𝑞}. ̌ It will be
enough to show that |𝐷| ≥ 𝜅 and 𝑄 ⊩ |𝐷|̌ = ℵ0 .
The latter statement is easier: 𝑄 forces 𝐷 to be the range of the partial function 𝑓
on 𝜔 × 𝜔 defined by 𝑓(𝑛, 𝑚) = 𝑞 if 𝜂(𝑛) ⊩ 𝜂(𝑚) = 𝑞.̌ For the former statement, first
note that 𝐷 ⊂ 𝑄 is dense since 𝐷 is forced to contain the range of 𝜂. It follows that
𝐷 and 𝑄 viewed as posets give the same extensions and 𝜏 is really a 𝐷-name. By the
Mostowski absoluteness between the 𝑃Γ × 𝑃-extension and the 𝐷-extension, there must
be a 𝐷-name 𝜒 for an element of 𝑋 such that 𝐷 ⊩ ℎ(𝜒) ̇ 𝐹 𝜏. Since ℎ is a reduction, it
follows that ⟨𝑄, 𝜒⟩ is an 𝐸-pin equivalent to ⟨𝑃, 𝜎⟩. By the initial choice of the cardinal
𝜅, |𝑄| ≥ 𝜅 follows. □
Corollary 2.6.6. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋,
Borel reducible to an orbit equivalence relation. If 𝐸 is not pinned then the following are
equivalent for any partial order 𝑃:
(1) 𝑃 carries a nontrivial 𝐸-pinned name;
(2) 𝑃 collapses ℵ1 to ℵ0 .
Proof. (2) implies (1) by Theorem 2.6.3. For the opposite implication, let 𝜏 be a
nontrivial 𝐸-pinned name on 𝑃. Let 𝜅 be the cardinal of Theorem 2.6.4 associated with
the virtual 𝐸-class containing ⟨𝑃, 𝜏⟩. Note that 𝜅 cannot be ℵ0 since then the Cohen
poset would carry an 𝐸-pinned name equivalent to 𝜏; however, all 𝐸-pinned names on
the Cohen poset are trivial by Theorem 2.6.2. Note also that 𝑃 collapses 𝜅 to ℵ0 since
it realizes the virtual 𝐸-class associated with ⟨𝑃, 𝜏⟩. In conclusion, 𝑃 collapses some
uncountable cardinal to ℵ0 , in particular it must collapse ℵ1 . □
Example 2.6.7. Consider the equivalence relation 𝔽2 on (2𝜔 )𝜔 . This is clearly an
orbit equivalence relation. Every 𝐸-pinned name is represented by a set 𝐴 ⊂ 2𝜔 by
Example 2.3.5. The cardinal 𝜅 of Theorem 2.6.4 is equal to |𝐴|.
Example 2.6.8. Let 𝐸 be the equivalence relation on 𝑋 = (𝒫(𝜔))𝜔 defined by
𝑥0 𝐸 𝑥1 if rng(𝑥0 ) and rng(𝑥1 ) generate the same filter on 𝜔. Suppose that in 𝑉, there
is a modulo finite strictly decreasing sequence 𝑎 = ⟨𝑎𝛼 ∶ 𝛼 ∈ 𝜔2 ⟩ of subsets of 𝜔. Let 𝑃
be the Namba forcing. It is well-known that 𝑃 preserves ℵ1 and adds a cofinal sequence
𝜎 ∶ 𝜔 → 𝜔2𝑉 to 𝜔2 . Let 𝜏 be the 𝑃-name for 𝑎 ∘ 𝜎. It is immediate that 𝜏 is a nontrivial
𝐸-pinned name on 𝑃. Thus, the assumption that 𝐸 be reducible to an orbit equivalence
in Corollary 2.6.6 cannot be omitted.
2.7. Absoluteness
This section compiles the available information regarding the absoluteness of var-
ious notions regarding the virtual equivalence classes. The most substantial and useful
statement is Corollary 2.7.3: if 𝐸 is a Borel equivalence relation then its pinned status
is absolute among all generic extensions.
Theorem 2.7.1. Suppose that 𝐸 is a Borel equivalence relation on a Polish space 𝑋.
The following are equivalent:
(1) 𝐸 is pinned;
(2) For every 𝜔-model 𝑀 of ZFC containing the code for 𝐸, 𝑀 ⊧ 𝐸 is pinned.
Proof. For simplicity assume 𝑋 = 𝜔𝜔 . The implication (2)→(1) is trivial. If (1)

fails, then 𝐸 is not pinned, and the failure of (2) is witnessed by 𝑀 = 𝑉.
The implication (1)→(2) is more difficult. We start with an abstract claim which
can be used in several other absoluteness results, and which appears in several less
efficient versions in existing literature. Say that an 𝜔-model 𝑁 of ZFC is correct about
stationary sets if for all sets 𝑎, 𝑏 ∈ 𝑁, if 𝑁 ⊧ 𝑎 is uncountable then in fact 𝑎 is uncount-
able, and if 𝑁 ⊧ 𝑏 ⊂ [𝑎]ℵ0 is a stationary system of countable sets, then in fact 𝑏 is a
stationary system of countable sets. Note that as 𝑁 is an 𝜔-model, for any set 𝑐, if 𝑁 ⊧ 𝑐
is countable then in fact 𝑐 is countable.
Claim 2.7.2. [5, Theorem 1.12], [57, Section 4] Let 𝑀 be a countable 𝜔-model of a
large fragment of ZFC. Then there is an elementary embedding 𝑗 ∶ 𝑀 → 𝑁 such that 𝑁
is an 𝜔-model correct about stationary sets.
Proof. We start with setting up a bookkeeping tool. By a classical result of Solo-

vay, 𝜔1 can be decomposed into ℵ1 many stationary sets. Thus, there is a surjective
function 𝑓 ∶ 𝜔1 → 𝜔1 × 𝜔 such that preimages of singletons are stationary.
Now, by recursion on 𝛼 ∈ 𝜔1 build countable 𝜔-models 𝑀𝛼 of ZFC and maps
𝑗𝛽𝛼 ∶ 𝑀𝛽 → 𝑀𝛼 for all 𝛽 ∈ 𝛼. With each model 𝑀𝛼 we also pick a surjection 𝜋𝛼 ∶ 𝜔 →
𝑀𝛼 arbitrarily. The following are the recursive demands on the construction:
• 𝑀 = 𝑀0 and ⟨𝑗≫𝛽 ∶ 𝑀≫ → 𝑀𝛽 ∶ ≫∈ 𝛽 ∈ 𝛼⟩ is a commuting system of
elementary embeddings;
• if 𝛼 ∈ 𝜔1 is limit then 𝑀𝛼 is the direct limit of the previous models and em-
beddings;
• whenever 𝛼 ∈ 𝜔1 is an ordinal such that 𝑓(𝛼) = ⟨𝛽, 𝑛⟩ and 𝛽 ∈ 𝛼 and 𝑀𝛽 ⊧
𝑏 = 𝜋𝛽 (𝑛) is a stationary system of countable sets on 𝑎 = ⋃ 𝑏, then writing
″
𝑐 = 𝑗𝛼𝛼+1 𝑗𝛽𝛼 (𝑎) we get that 𝑀𝛼+1 contains 𝑐 and 𝑀𝛼+1 ⊧ 𝑐 ∈ 𝑗𝛽𝛼+1 (𝑏).
It is only necessary to show how the last item is arranged. Thus, suppose that its as-
sumptions are satisfied at 𝛼 ∈ 𝜔1 . Work in the model 𝑀𝛼 and consider the poset 𝑃
of all stationary subsets of 𝑏, ordered by inclusion. Since the model 𝑀𝛼 is countable,
there is a filter 𝐺 ⊂ 𝑃 generic over the model 𝑀𝛼 . Let 𝑗𝛼𝛼+1 ∶ 𝑀𝛼 → 𝑀𝛼+1 be its asso-
ciated generic ultrapower as in [51, Lemmas 22.13 and 14]. Then 𝑀𝛼+1 will be again
an 𝜔-model. Note that the set 𝑐 belongs to the model 𝑀𝛼+1 as it is represented by the
identity function; it also has the requested properties by the Łoś theorem.
In the end, let 𝑗 ∶ 𝑀 → 𝑁 be the direct limit of the system of elementary embed-
dings produced during the recursion; we claim that this embedding works as required.
Suppose then that 𝑀 ⊧ 𝑏 is a stationary system of countable sets on 𝑎 = ⋃ 𝑏. To show
that 𝑏 ̄ is indeed stationary, let 𝑑 be a closed unbounded set of countable subsets of 𝑎,
and work to show that 𝑑 ∩ 𝑏 ̄ ≠ 0 holds. Fix an ordinal 𝛽 ∈ 𝜔1 and a number 𝑛 ∈ 𝜔 such
that 𝑏 = 𝑗𝛽𝜔1 (𝜋𝛽 (𝑛)). Let 𝐾 be a countable elementary submodel of a large substruc-
ture, containing in particular the set 𝑑, the ordinal 𝛽, and the system of elementary
embeddings constructed above, and such that 𝑓(𝛼) = ⟨𝛽, 𝑛⟩ where 𝛼 = 𝐾 ∩ 𝜔1 . Such a
model exists by the initial choice of the function 𝑓. Clearly 𝐾 ∩ 𝑎 ∈ 𝑑; we will be done
once we show that 𝐾 ∩ 𝑎 ∈ 𝑏.
″
To see this, let 𝑐 = 𝑗𝛼𝛼+1 𝑗𝛽𝛼 (⋃ 𝜋𝛽 (𝑛)). By the elementarity of the embedding
𝑗𝛼+1𝜔1 and the last item above, it is the case that 𝑗𝛼+1𝜔1 (𝑐) ∈ 𝑏. Also, 𝑗𝛼+1𝜔1 (𝑐) =
″ ″
𝑗𝛼+1𝜔 1
𝑐 = 𝑗𝛼𝜔 𝑗 (⋃ 𝜋𝛽 (𝑛)), By the elementarity of the model 𝐾 and the second item
1 𝛽𝛼
above, the latter expression is exactly equal to 𝐾 ∩ 𝑗𝛽𝜔1 (⋃ 𝜋𝛽 (𝑛)) = 𝐾 ∩ 𝑎. This com-
pletes the proof. □
Now, back to the theorem. Suppose that (2) fails. Fix a 𝜔-model 𝑀 of ZFC containing
the code for 𝐸 such that 𝑀 ⊧ 𝐸 is unpinned; taking an elementary submodel if neces-
sary we may assume that 𝑀 is countable. Let 𝑗 ∶ 𝑀 → 𝑁 be an elementary embedding
from the claim. By elementarity, 𝑁 ⊧ 𝐸 is unpinned, so there is a poset 𝑃 and a 𝑃-name
𝜏 such that 𝑁 ⊧ 𝜏 is a nice nontrivial 𝐸-pinned name. We will show that in fact 𝜏 really
is a nontrivial 𝐸-pinned name.
First of all, 𝜏 indeed is 𝐸-pinned. If 𝐺0 , 𝐺1 ⊂ 𝑃 are mutually generic filters then
𝑁[𝐺0 , 𝐺1 ] ⊧ 𝜏/𝐺0 𝐸 𝜏/𝐺1 holds, and by the Borel absoluteness between 𝑁[𝐺0 , 𝐺1 ] and
𝑉[𝐺0 , 𝐺1 ], 𝜏/𝐺0 𝐸 𝜏/𝐺1 holds in 𝑉[𝐺0 , 𝐺1 ] as required. To show that 𝜏 is a nontrivial
𝐸-pinned name, assume towards a contradiction that there is a point 𝑥 ∈ 𝑋 such that
𝑃 ⊩ 𝜏 𝐸 𝑥;̌ the difficulty resides in the possibility that 𝑥 ∉ 𝑁.
Let 𝜅 be some large cardinal in the model 𝑁. Let 𝐾 be a countable elementary
submodel of a large structure containing in particular 𝑁, 𝑃, 𝜏, and 𝜅, such that 𝑐 =
𝐾 ∩ 𝑁 ∩ 𝑉𝜅 belongs to the model 𝑁 and is countable there. Such a model 𝐾 exists since
the model 𝑁 is correct about the stationarity of the set it views as [𝑉𝜅 ]ℵ0 . Work in the
model 𝑁. Since 𝑐 is an elementary submodel of 𝑉𝜅 , it follows that 𝜎 = 𝜏 ∩ 𝑐 is an 𝐸-
pinned name on the poset 𝑄 = 𝑃 ∩ 𝑐. Since the poset 𝑄 is countable, by Theorem 2.6.2
below applied in the model 𝑁, there must be a point 𝑦 ∈ 𝑁 such that 𝑄 ⊩ 𝜎 𝐸 𝑦.̌ Now,
work in the model 𝐾 and observe that 𝑄 ⊩ 𝜎 𝐸 𝑥.̌ It follows that 𝑥 𝐸 𝑦. Now, back in
the model 𝑁 it must be the case that 𝑃 ⊩ 𝜏 𝐸 𝑦,̌ contradicting the assumption that 𝜏 is
a nontrivial 𝐸-pinned name. □
Corollary 2.7.3. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. The
statement “𝐸 is pinned” is absolute between all generic extensions.
Proof. The validity of item (2) of Theorem 2.7.1 does not change if one only
considers countable models. This follows from an immediate downward Löwenheim-
Skolem argument. The countable model version of (2) is a coanalytic statement, and
as such it is absolute among all forcing extensions by the Mostowski absoluteness. □
The absoluteness of the pinned status of analytic equivalence relations does not al-
low a similar sweeping statement. Consider a Π11 set 𝐴 ⊂ 2𝜔 which contains no perfect
subset, but is uncountable in the constructible universe 𝐿 [51, Corollary 25.37]. Let 𝐸
be the analytic equivalence relation on 𝑋 = (2𝜔 )𝜔 defined by 𝑥0 𝐸 𝑥1 if either both
rng(𝑥0 ), rng(𝑥1 ) have nonempty intersection with the complement of 𝐴, or rng(𝑥0 ) =
rng(𝑥1 ). In 𝐿, the equivalence relation 𝐸 is not pinned, as witnessed by the Coll(𝜔, 𝐴)-
name for the generic enumeration of 𝐴. At the same time, in the Coll(𝜔, 2𝜔 )-extension
of 𝐿, the (reinterpretation of the) set 𝐴 is countable, containing only constructible
elements, and in consequence the equivalence relation 𝐸 is smooth, so pinned. On
the other hand, in the presence of sufficiently large cardinals the pinned status of ev-
ery analytic equivalence relation is absolute by a proof similar to the proof of Theo-
rem 2.7.1 where we adjust Claim 2.7.2 to input a well-founded model 𝑀 of ZFC plus
the statement that there is a propoer class of Woodin cardinals, and output a well-
founded model 𝑁 correct about stationary sets. The adjustment needs the classical
well-foundedness results regarding the well-foundedness of the stationary tower ultra-
power in [72, 113]. We refrain from providing further detail.
Another natural question concerns the computation of the various cardinal invari-
ants of equivalence relations in inner models. In particular, we would like to see that
if 𝑀 ⊂ 𝑁 are transitive models of ZFC containing the code for an analytic equivalence
relation 𝐸, then (𝜅(𝐸))𝑀 ≤ (𝜅(𝐸))𝑁 . Interestingly enough, this is not clear, and we only
have a positive answer in the case of orbit equivalence relations and their relatives.
Theorem 2.7.4. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋 almost
reducible to an orbit equivalence relation. Let 𝑀 be a transitive model of large fragment
of set theory containing the codes for 𝐸, the group action, and the almost reduction. Then
𝜅(𝐸)𝑀 ≤ 𝜅(𝐸) holds.
Proof. To begin, let Γ be a Polish group continuously acting on a Polish space 𝑌 ,
inducing an orbit equivalence relation 𝐹. Let ℎ ∶ 𝑋 → 𝑌 be a Borel reduction of 𝐸 to
𝐹. Choose Γ, 𝑌 , ℎ so that they belong to the model 𝑀.
Suppose that the conclusion of the theorem fails. Then, writing 𝜅 = (𝜅(𝐸))𝑉 , in
the model 𝑀 there exists an 𝐸-pin ⟨𝑄, 𝜏⟩ such that 𝑀 ⊧ ⟨𝑄, 𝜏⟩ is not equivalent to any 𝐸-
pin on a poset of cardinality less than 𝜅. By Theorem 2.6.3 applied in the model 𝑀, this
means that if 𝑁 is a generic extension of 𝑀, then 𝑁 ⊧ (∃𝑥 ∈ 𝑋 𝑄 ⊩ 𝜏 𝐸 𝑥)̌ → |𝜅| = ℵ0 ).
Let ⟨𝑅, 𝜎⟩ be an 𝐸-pin in 𝑉 such that |𝑅| < 𝜅 and 𝑄 × 𝑅 ⊩ 𝜏 𝐸 𝜎. Let 𝐺 ⊂ 𝑄,
𝐻 ⊂ 𝑅 and 𝐾 ⊂ 𝑃Γ be filters mutually generic over 𝑉. Write 𝑦0 = ℎ(𝜏/𝐺), 𝑦1 = ℎ(𝜎/𝐻),
write 𝛾 ∈ Γ for the generic point associated with the filter 𝐾, and let 𝑦2 = 𝛾 ⋅ 𝑦1 . By the
assumptions, 𝑦0 , 𝑦1 , and 𝑦2 ∈ 𝑌 are mutually orbit-equivalent points.
Claim 2.7.5. The point 𝑦2 ∈ 𝑌 is generic over the model 𝑀, and in the model 𝑀[𝑦2 ]
there exists a point 𝑥 ∈ 𝑋 such that 𝑀[𝑦2 ] ⊧ 𝑄 ⊩ 𝜏 𝐸 𝑥.̌
Proof. There is a point 𝛿 ∈ Γ in the model 𝑉[𝐺][𝐻] such that 𝑦1 = 𝛿 ⋅ 𝑦0 . The
point 𝛾 ∈ Γ is 𝑃Γ -generic over 𝑉[𝐺][𝐻] by the product forcing theorem. Now, multi-
plication by 𝛿 from the right is an automorphism of the poset 𝑃Γ , so the point 𝛾𝛿 ∈ Γ
is 𝑃Γ -generic over 𝑉[𝐺][𝐻]. Therefore, the point 𝛾𝛿 is also 𝑃Γ -generic over the smaller
model 𝑀[𝐺], and by the product forcing theorem, 𝐺 and 𝛾𝛿 are mutually generic ob-
jects over 𝑀. The point 𝑦2 = 𝛾𝛿 ⋅ 𝑦0 ∈ 𝑀[𝐺, 𝛾𝛿] belongs to a generic extension of 𝑀, so
is generic over 𝑀 itself.
Now, the model 𝑀[𝑦2 ] is transitive, so by Mostowski absoluteness it must contain
a point 𝑥 ∈ 𝑋 such that ℎ(𝑥) 𝐹 𝑦2 , since one such point 𝜎/𝐻 exists in the model
𝑉[𝐻][𝐾]. We claim that 𝑀[𝑦2 ] ⊧ 𝑄 ⊩ 𝜏 𝐸 𝑥.̌ To see this, observe that the filter 𝐺 ⊂ 𝑄
is generic over the model 𝑉[𝐻][𝐾], so also generic over the smaller model 𝑀[𝑦2 ]. Since
𝑀[𝐺][𝑦2 ] ⊧ 𝑦0 = ℎ(𝜏/𝐺) 𝐹 𝑦2 , the forcing theorem implies that 𝑀[𝑦2 ] ⊧ 𝑄 ⊩ ℎ(𝜏) 𝐹 𝑦2̌ ,
so 𝜏 𝐸 𝑥.̌ □
By the second paragraph of the proof, it must be the case that 𝑀[𝑦2 ] ⊧ |𝜅| = ℵ0 ;
therefore, 𝑉[𝐻][𝐾] ⊧ |𝜅| = ℵ0 . This, however, contradicts the assumption that in 𝑉,
|𝑅| < 𝜅, which is equivalent to |𝑅 × 𝑃Γ | < 𝜅. □
2.8. Dichotomies
This section presents three theorems which characterize various complex features
of the virtual realm in terms of dichotomies. It turns out that each of the dichotomies
uses a preparatory proposition or two on the descriptive theory of forcing and model
theory. These preparatory propositions are perhaps more difficult to state properly
2.8. DICHOTOMIES 65
than to prove. Nevertheless, they are unavoidably needed and they do not seem to
be present in published literature. We gather them in the first subsection, while the
second subsection contains the dichotomies themselves.
2.8a. Preliminaries. The first two auxiliary propositions concern pure model
theory; they show that the satisfaction relation and the construction of models from
indiscernibles are in a suitable sense Borel affairs. The proofs are straightforward and
left to the reader. For both of them, fix a countable language and let 𝑋 be the Polish
space of models of that language whose universe is 𝜔.
Proposition 2.8.1. Suppose that 𝑓 ∶ 2𝜔 → 𝑋 is a Borel function, 𝜙 is a formula of

the language with 𝑛 free variables, and 𝑔𝑖 ∶ 2𝜔 → 𝜔 are Borel functions for every 𝑖 ∈ 𝑛.
The set {𝑥 ∈ 𝑋 ∶ 𝑓(𝑥) ⊧ 𝜙(𝑔0 (𝑥), 𝑔1 (𝑥) . . . 𝑔𝑛−1 (𝑥))} is Borel.
Let 𝑇 be a Skolemized complete consistent theory containing a linear ordering. Let 𝑆

be the theory of an infinite ordered set of indiscernibles in the linear order of 𝑇. Let 𝑌
be the space of all linear orderings on 𝜔.
Proposition 2.8.2. There are Borel functions 𝑓 ∶ 𝑌 → 𝑋 and 𝑔 ∶ 𝑌 × 𝜔 → 𝜔 such

that for each 𝑦 ∈ 𝑌 ,
(1) 𝑓(𝑦) is a model of 𝑇;
(2) the function 𝑔𝑦 ∶ 𝜔 → 𝜔 is an order-preserving map from the ordering 𝑦 to the
ordering of 𝑓(𝑦) and its range consists of indiscernibles with theory 𝑆;
(3) the model 𝑓(𝑦) is a Skolem hull of rng(𝑔𝑦 ).
The rest of the subsection deals with models of set theory, showing that the con-
struction of their generic extensions is a Borel affair. Thus, let 𝑋 be the Polish space of
all models for the language with one binary relation whose universe is 𝜔. Let 𝑌 be any
uncountable Polish space, serving as an index space. Let 𝑀 ∶ 𝑌 → 𝑋 and 𝑃 ∶ 𝑌 → 𝜔
be Borel functions such that for each 𝑦 ∈ 𝑌 , 𝑀(𝑦) is a model of (a large fragment of)
ZF and 𝑀(𝑦) ⊧ 𝑃(𝑦) is a partially ordered set.
Proposition 2.8.3. There is a Borel function 𝐺 ∶ 𝑌 → 𝒫(𝜔) such that for every
𝑦 ∈ 𝑌 , 𝐺(𝑦) is a filter on 𝑃(𝑦) which is generic over 𝑀(𝑦).
Proof. By induction on 𝑛 ∈ 𝜔 define Borel functions 𝑓𝑛 ∶ 𝑌 → 𝜔 so that

• for every 𝑦 ∈ 𝑌 , 𝑀(𝑦) ⊧ 𝑓0 (𝑦) is the largest element of the poset 𝑃(𝑦);
• for every 𝑦 ∈ 𝑌 and 𝑛 ∈ 𝜔, if 𝑀(𝑦) ⊧ 𝑛 is an open dense subset of the poset
𝑃(𝑦), then 𝑓𝑛+1 (𝑦) is the smallest number 𝑚 such that 𝑀(𝑦) ⊧ 𝑚 is an element
of 𝑛 and it is smaller that 𝑓𝑛 (𝑦) in the poset 𝑃(𝑦); otherwise, 𝑓𝑛+1 (𝑦) = 𝑓𝑛 (𝑦).
The functions defined in this way are Borel by Proposition 2.8.1. Define the function
𝐺 ∶ 𝑌 → 𝒫(𝜔) as follows: for every 𝑦 ∈ 𝜔, 𝐺(𝑦) is the set of all 𝑚 such that 𝑀(𝑦) ⊧ 𝑚
is an element of the poset 𝑃(𝑦) and for some 𝑛 ∈ 𝜔, 𝑀(𝑦) ⊧ 𝑓𝑛 (𝑦) is smaller than 𝑚 in
the poset 𝑃(𝑦). It is clear that the function 𝐺 works. □
Now, suppose that a Borel function 𝐺 ∶ 𝑌 → 𝒫(𝜔) as in Proposition 2.8.3 is given;

we want to produce the generic extensions. To wit, we have to produce the generic
extensions as Borel functions on 𝑌 and also the valuation functions for names in the
ground models as Borel functions.
Proposition 2.8.4. There are Borel functions 𝑀[𝐺] ∶ 𝑌 → 𝑋 and 𝑣 ∶ 𝑌 × 𝜔 → 𝜔

such that for every 𝑦 ∈ 𝑌 , 𝑀[𝐺](𝑦) is a generic extension of 𝑀(𝑦) by 𝐺(𝑦) and for every
𝑛 ∈ 𝜔, 𝑣(𝑦)(𝑛) = 𝑛/𝐺(𝑦) whenever 𝑀(𝑦) ⊧ 𝑛 is a 𝑃(𝑦)-name.
Proof. Let 𝐸 be the Borel equivalence relation on 𝑌 × 𝜔 connecting pairs ⟨𝑦0 , 𝑛0 ⟩
and ⟨𝑦1 , 𝑛1 ⟩ if 𝑦0 = 𝑦1 and (denoting their common value by 𝑦) either 𝑀(𝑦) ⊧ neither
𝑛0 , 𝑛1 is a 𝑃(𝑦)-name or 𝑀[𝑦] ⊧ both 𝑛0 , 𝑛1 are 𝑃(𝑦)-names and there is some condition
𝑝 ∈ 𝐺(𝑦) such that 𝑀(𝑦) ⊧ 𝑝 ⊩ 𝑛0 = 𝑛1 . Let 𝑣 ∶ 𝑌 × 𝜔 → 𝜔 be the Borel function
defined in the following way: 𝑓(𝑦)(𝑛) = 0 if 𝑀(𝑦) ⊧ 𝑛 is not a 𝑃(𝑦)-name, and 𝑓(𝑦)(𝑛) =
𝑚 if 𝑀(𝑦) ⊧ 𝑛 is a 𝑃(𝑦)-name and, writing 𝑛′ for the smallest name 𝐸-related to 𝑛, there
are exactly 𝑚-many 𝐸-classes of 𝑃(𝑦)-names represented by numbers smaller than 𝑛′ .
Let 𝑀[𝐺] be the Borel function defined in the following way: 𝑀[𝐺](𝑦) connects the
pair ⟨𝑚0 , 𝑚1 ⟩ just in case there are numbers 𝑛0 , 𝑛1 ∈ 𝜔 such that 𝑀(𝑦) ⊧ 𝑛0 , 𝑛1 are
𝑃(𝑦)-names, 𝑓(𝑦)(𝑛0 ) = 𝑚0 + 1, 𝑓(𝑦)(𝑛1 ) = 𝑚1 + 1, and there is a condition 𝑝 ∈ 𝐺(𝑦)
such that 𝑀(𝑦) ⊧ 𝑝 ⊩ 𝑛0 ∈ 𝑛1 . The Borelness of the functions 𝑀[𝐺] and 𝑣 follows
from Proposition 2.8.1. □
The construction of the generic filters may be subject to an additional constraint. Sup-
pose that 𝐸 is an equivalence relation on a Polish space 𝑍, coded in each model 𝑀(𝑦).
Suppose that 𝜏 ∶ 𝑌 → 𝜔 is a Borel function such that for each 𝑦 ∈ 𝑌 , 𝑀(𝑦) ⊧ 𝜏(𝑦) is
a 𝑃(𝑦)-name of an element of 𝑍. Suppose that 𝑧 ∶ 𝑌 → 𝑍 is a Borel function. Can we
find a Borel function 𝐺 ∶ 𝑌 → 𝒫(𝜔) such that for each 𝑦 ∈ 𝑌 , 𝐺(𝑦) is a filter on 𝑃(𝑦)
generic over 𝑀(𝑦), such that the valuation of 𝜏(𝑦) over 𝐺(𝑦) is 𝐸-related to 𝑧(𝑦)? To
come to a useful affirmative conclusion, we assume that the models in the range of the
function 𝑀 are all well-founded, and the equivalence relation 𝐸 is induced as an orbit
equivalence relation of a continuous action of a Polish group Γ on the space 𝑍. In such
circumstances, we have the following:
Proposition 2.8.5. Given 𝐸, 𝑀, 𝑃, 𝜏 as above:
(1) the set 𝐵 = {𝑦 ∈ 𝑌 : there is a filter 𝐺 ⊂ 𝑃(𝑦) generic over the model 𝑀(𝑦) such
that 𝜏(𝑦)/𝐺 is 𝐸-related to 𝑧(𝑦)} is Borel;
(2) there is a Borel function 𝐺 ∶ 𝐵 → 𝒫(𝜔) such that for every 𝑦 ∈ 𝐵, 𝐺(𝑦) ⊂ 𝑃(𝑦)
is a filter generic over 𝑀(𝑦) such that 𝜏(𝑦)/𝐺(𝑦) is 𝐸-related to 𝑧(𝑦).
Proof. Let 𝑃Γ be the poset of all nonempty open subsets of Γ ordered by inclusion,
with its name 𝛾 ̇ for a generic element of Γ. Use Proposition 2.8.1 to find Borel functions
𝑄, 𝜎 ∶ 𝑌 → 𝜔 so that for every 𝑦 ∈ 𝑌 , 𝑀(𝑦) ⊧ 𝑄(𝑦) is the complete subalgebra of the
complete Boolean algebra of 𝑃(𝑦) × 𝑃Γ generated by the name 𝜎(𝑦) = 𝛾 ̇ ⋅ 𝜏(𝑦).
Let 𝐷 = {⟨𝑦, 𝛿, 𝐺⟩ ∈ 𝑌 ×Γ×𝒫(𝜔) ∶ 𝐺 ⊂ 𝑄(𝑦) is a filter generic over the model 𝑀(𝑦)
such that 𝜈(𝑦)/𝐺 = 𝛿 ⋅ 𝑧(𝑦)}. This is a Borel set by Proposition 2.8.1. The projection of
𝐷 into the 𝑌 coordinate is the set 𝐵.
Claim 2.8.6. For each pair ⟨𝑦, 𝛿⟩ ∈ 𝑌 × Γ, the vertical section 𝐷𝑦𝛿 is either empty or
a singleton.
Proof. This uses the wellfoundedness of the model 𝑀(𝑦). Suppose that the sec-
tion 𝐷𝑦𝛿 is nonempty, containing some filter 𝐺. As 𝑀(𝑦) ⊧“𝑄(𝑦) is completely gen-
erated by the name 𝜎(𝑦)”, the filter 𝐺 can be recovered by transfinite induction using
infinitary Boolean expressions in 𝑀 applied to 𝛿 ⋅ 𝑧(𝑦); therefore, it is unique. □
2.8. DICHOTOMIES 67
Write 𝐶 ⊂ 𝑌 × Γ for the projection of 𝐷 into the first two coordinates. Since one-to-one
projections of Borel sets are Borel [58, Theorem 15.1], the set 𝐶 is Borel.
Claim 2.8.7. For each point 𝑦 ∈ 𝑌 , the section 𝐶𝑦 either empty or else comeager in Γ.
Proof. To simplify the notation, fix 𝑦 ∈ 𝑌 and omit the argument 𝑦 from the
expressions like 𝑀(𝑦), 𝜎(𝑦) . . . . Suppose that the Γ-section 𝐶𝑦 is nonempty. Thus, there
is a filter 𝐺 ⊂ 𝑃 be a filter generic over 𝑀 such that 𝜏/𝐺 is 𝐸-related to 𝑧. Let 𝐴 ⊂ Γ be
the set of all elements of the group Γ which are 𝑃Γ -generic over the model 𝑀[𝐺]; this is
a co-meager set. Let 𝛿 ∈ Γ be an element of the group such that 𝜏/𝐺 = 𝛿 ⋅ 𝑧. Then the
vertical section 𝐶𝑦 contains the set 𝐴 ⋅ 𝛿 which is co-meager as the right multiplication
by 𝛿 is a self-homeomorphism of the group Γ. □
As the category quantifier yields Borel sets [58, Theorem 16.1], the set 𝐵 as the pro-
jection of 𝐶 into the first coordinate is Borel. Borel sets with nonmeager vertical sec-
tions allow Borel uniformizations [58, Theorem 18.6], so there is a Borel uniformization
𝑓 ∶ 𝐵 → Γ of 𝐶. As the set 𝐷 has singleton vertical sections, it is itself its uniformiza-
tion 𝑔 ∶ 𝐶 → 𝒫(𝜔). Let 𝐻 ∶ 𝐵 → 𝒫(𝜔) be the function defined by 𝐻(𝑦) = 𝑔(𝑦, 𝑓(𝑦)).
Thus, for every 𝑦 ∈ 𝐵, 𝐻(𝑦) ⊂ 𝑄(𝑦) is a filter generic over 𝑀(𝑦) such that 𝜎(𝑦)/𝐻(𝑦) is
𝐸-related to 𝑧(𝑦).
Now, let 𝑅 ∶ 𝑌 → 𝜔 be a Borel function such that for every 𝑦 ∈ 2𝜔 , 𝑀(𝑦) ⊧ 𝑅(𝑦) is
a name for the quotient poset 𝑃(𝑦) × 𝑃Γ /𝑄(𝑦). Use Propositions 2.8.3 and 2.8.4 to find
a Borel function 𝐾 ∶ 𝐵 → 𝒫(𝜔) such that 𝐾(𝑦) ⊂ 𝑅(𝑦) is a filter generic over the model
𝑀(𝑦)[𝐻(𝑦)]. Let 𝐺 ∶ 𝐵 → 𝒫(𝜔) be a Borel function indicating a filter on 𝑃(𝑦) which is
the 𝑃(𝑦)-coordinate the composition of 𝐻(𝑦) ∗ 𝐾(𝑦). The function 𝐺 has the required
properties. □
Corollary 2.8.8. Suppose that Γ is a Polish group continuously acting on a Polish

space 𝑋, inducing an orbit equivalence relation 𝐸. Let 𝑀 be a countable transitive model
of set theory containing a code for the action, let 𝑃 ∈ 𝑀 be a poset and 𝜏 ∈ 𝑀 be a 𝑃-name
for an element of the space 𝑋. Then
(1) the set 𝐵 = {𝑥 ∈ 𝑋 ∶ ∃𝐺 ⊂ 𝑃 generic over 𝑀 such that 𝜏/𝐺 = 𝑥} is Borel;
(2) the equivalence relation 𝐸 ↾ 𝐵 is Borel.
Proof. (1) is immediate from the proposition. To see (2), consider the set 𝐶 =
{⟨𝑥, 𝑦⟩ ∈ 𝑋 2 ∶ ∃𝐺 × 𝐻 ⊂ 𝑃 × 𝑃Γ generic over 𝑀 such that 𝑥 = 𝜏/𝐺 and 𝑦 = (𝛾gen ̇ /𝐻) ⋅ 𝑥}.
The set 𝐶 is Borel by the proposition again. Now, for 𝑥, 𝑧 ∈ 𝐵, 𝑥 𝐸 𝑧 just in case the
set 𝐴𝑥𝑧 = {𝛾 ∈ Γ ∶ ⟨𝑥, 𝛾 ⋅ 𝑧⟩ ∈ 𝐶} is comeager in Γ. To see this, note that if 𝑥 𝐸 𝑧 fails
then the set 𝐴𝑥𝑧 ⊂ Γ is actually empty, and if 𝑥 𝐸 𝑧 holds with 𝛿 ⋅ 𝑥 = 𝑧, then the
𝐴𝑥𝑧 ⊃ {𝛾 ∈ Γ ∶ 𝛾 ⋅ 𝛿−1 is 𝑃Γ -generic over 𝑀[𝑥]} and the latter set is comeager since it is
a shift of the comeager set of all points in Γ which are 𝑃Γ -generic over the model 𝑀[𝑥].
Finally, observe that the equivalence relation 𝐸 ↾ 𝐵 is obtained by an application
of the category quantifier to the Borel set {⟨𝑥, 𝑧, 𝛾⟩ ∈ 𝐵 × 𝐵 × Γ ∶ 𝛾 ∈ 𝐴𝑥𝑧 ⟩}, so is Borel
by [58, Theorem 16.1]. □
2.8b. Results. The first dichotomy characterizes the existence of the pinned car-
dinal in analytic equivalence relations.
Theorem 2.8.9. Assume that there is a measurable cardinal. Let 𝐸 be an analytic

equivalence relation on a Polish space 𝑋. The following are equivalent:
(1) 𝜅(𝐸) = ∞;
(2) 𝔼𝜔1 ≤𝑎 𝐸.
Proof. (2) implies (1) by Example 2.4.6 and Theorem 2.5.4. The large cardinal
assumption is not needed for this direction. For the (1)→(2) implication, suppose that
𝜅(𝐸) = ∞. Let 𝜅 be a measurable cardinal.
Claim 2.8.10. There exist a poset 𝑃 of cardinality 𝜅 and an 𝐸-pinned 𝑃-name 𝜏 such
̄
that 𝜏 is not 𝐸-related to any name on a poset of cardinality less than 𝜅.
Proof. Since 𝜅(𝐸) = ∞, there exist a poset 𝑄 and an 𝐸-pinned 𝑄-name 𝜎 which
̄
is not 𝐸-equivalent to any name on a poset of cardinality less than 𝜅. Choose an ele-
mentary submodel 𝑀 of a large structure such that |𝑀| = 𝜅, 𝑉𝜅 ⊂ 𝑀 and 𝑄, 𝜎 ∈ 𝑀. Let
𝑃 = 𝑄 ∩ 𝑀 and let 𝜏 = 𝜎 ∩ 𝑀. We claim that 𝑃, 𝜏 works as required.
Indeed, if 𝐺 × 𝐻 ⊂ 𝑃 × 𝑃 is a filter generic over 𝑉, then it is also generic over 𝑀, by
the elementarity of 𝑀 and the forcing theorem in 𝑀 𝑀[𝐺, 𝐻] ⊧ 𝜏/𝐺 𝐸 𝜏/𝐻, and by the
Mostowski absoluteness between 𝑀[𝐺, 𝐻] and 𝑉[𝐺, 𝐻], 𝑉[𝐺, 𝐻] ⊧ 𝜏/𝐺 𝐸 𝜏/𝐻. This
proves that the name 𝜏 is 𝐸-pinned. If 𝑅 is a poset in 𝑉 of cardinality smaller than 𝜅 and
𝜈 is an 𝐸-pinned 𝑅-name and 𝐺 × 𝐻 ⊂ 𝑃 × 𝑅 is a generic filter over 𝑉, then 𝑅, 𝜈 ∈ 𝑀,
the filter 𝐺 × 𝐻 also generic over 𝑀, by the elementarity of 𝑀 and the forcing theorem
in 𝑀 𝑀[𝐺, 𝐻] ⊧ ¬𝜏/𝐺 𝐸 𝜈/𝐻, and by the Mostowski absoluteness between 𝑀[𝐺, 𝐻]
and 𝑉[𝐺, 𝐻], 𝑉[𝐺, 𝐻] ⊧ ¬𝜏/𝐺 𝐸 𝜎/𝐻. This proves that 𝜈 𝐸̄ 𝜏 fails and completes the
proof of the claim. □
Choose a poset 𝑃 on 𝜅 and an 𝐸-pinned name 𝜏 as in the claim. Choose a large enough
cardinal 𝜃 and skolemize the structure ⟨𝐻𝜃 , ∈, 𝑃, 𝜏⟩ of sets whose transitive closures
have cardinality less than 𝜃. Let 𝑇 be the theory of the skolemized structure. Let
𝑗 ∶ 𝑉 = 𝑀0 → 𝑀1 be an ultrapower embedding associated with some normal mea-
sure on the measurable cardinal 𝜅, and let 𝑗𝑛 ∶ 𝑉 → 𝑀𝑛 be its iterations of length 𝑛 for
𝑛 ≤ 𝜔. The ordinals {𝑗𝑛 (𝜅) ∶ 𝑛 ∈ 𝜔} form a sequence of indiscernibles in the model
𝑗𝜔 (𝐻𝜃 ). Let 𝑆 be the theory of the indiscernibles in this structure. Let 𝑌 be the space
of all linear orderings on 𝜔, and let 𝑍 be the space of all binary relations on 𝜔. By
Propositions 2.8.2 and 2.8.3, there are Borel functions 𝑀 ∶ 𝑌 → 𝑍, 𝐺 ∶ 𝑌 × 𝑀 → 𝒫(𝜔),
𝑃 ∶ 𝑌 → 𝜔 and 𝜏 ∶ 𝑌 → 𝜔 such that whenever 𝑦 ∈ 𝑌 is a linear ordering then 𝑀(𝑦)
is a model of 𝑇 which is a Skolem hull of indiscernibles of ordertype 𝑦 satisfying the
theory 𝑆, 𝑃(𝑦) is its version of the poset 𝑃, and 𝜏(𝑦) is its version of the name 𝜏, and
𝐺(𝑦) ⊂ 𝑃(𝑦) is a filter generic over the model 𝑀(𝑦). Note that all models 𝑀(𝑦) are
𝜔-models, so compute the Polish space 𝑋 correctly. Let 𝑘 ∶ 𝑌 → 𝑋 be the function
defined by 𝑘(𝑦) = 𝜏(𝑦)/𝐺(𝑦), which is Borel by Proposition 2.8.4. It will be enough to
show that 𝑘 is a Borel reduction of 𝔼𝜔1 to 𝐸 on the set of 𝑦 ∈ 𝑌 which are well-orders.
Suppose first that 𝑦0 , 𝑦1 ∈ 𝑌 are well-orders of the same length. Then the models
𝑀(𝑦0 ), 𝑀(𝑦1 ) are wellfounded and isomorphic. Write 𝑁 for their common transitive
isomorph and 𝑄, 𝜎 for its version of the poset 𝑃 and the name 𝜏. Thus, 𝑁 ⊧ 𝜎 is an
𝐸-pinned 𝑄-name. The filters 𝐺(𝑦0 ), 𝐺(𝑦1 ) ⊂ 𝑄 are separately generic over 𝑁. Let
𝐺 ⊂ 𝑄 be a filter generic over both countable models 𝑁[𝐺(𝑦0 )] and 𝑁[𝐺(𝑦1 )]. By the
product forcing theorem, the filters 𝐺(𝑦0 ) × 𝐺 and 𝐺(𝑦1 ) × 𝐺 are both 𝑄 × 𝑄-generic
over 𝑁. As 𝑁 ⊧ 𝜎 is an 𝐸-pinned name, it follows that 𝑁[𝐺(𝑦0 ), 𝐺] ⊧ 𝜎/𝐺(𝑦0 ) 𝐸 𝜎/𝐺
2.8. DICHOTOMIES 69
and 𝑁[𝐺(𝑦1 ), 𝐺] ⊧ 𝜎/𝐺(𝑦1 ) 𝐸 𝜎/𝐺. By the Mostowski absoluteness between these

two models and 𝑉, and the transitivity of the relation 𝐸, 𝜎/𝐺(𝑦0 ) = 𝑘(𝑦0 ) 𝐸 𝑘((𝑦1 ) =
𝜎/𝐺(𝑦1 ) follows.
Suppose now that 𝑦0 , 𝑦1 ∈ 𝑌 are well-orders of different lengths; say that 𝑦0 is
shorter than 𝑦1 . Let 𝑁0 be the transitive isomorph of 𝑀(𝑦0 ), let 𝜅0 , 𝑃0 , 𝜎0 be the versions
of 𝜅, 𝑃, and 𝜏 in the model 𝑁0 , and let 𝐺0 ⊂ 𝑃0 be the filter generic over 𝑁0 indicated
by 𝐺(𝑦0 ). Similar notation prevails for subscript 1. Let 𝑖 ∶ 𝑁0 → 𝑁1 be the elementary
embedding obtained by sending the indiscernibles of 𝑁0 to an initial segment of the
indiscernibles of 𝑁1 . Note that the critical point of 𝑖 is exactly 𝜅0 , so 𝑃0 ∈ 𝑁1 as 𝑃0 = 𝑃1 ↾
𝜅0 . Also, 𝑁1 ⊧ |𝑃0 | < 𝜅1 . Find a filter 𝐺 ⊂ 𝑃0 generic over both the countable models
𝑁0 [𝐺0 ] and 𝑁1 [𝐺1 ]. Since 𝑁0 ⊧ 𝜎0 is 𝐸-pinned, the Mostowski absoluteness between
̄
𝑉 and 𝑁0 [𝐺, 𝐺0 ] implies that 𝜎0 /𝐺0 𝐸 𝜎0 /𝐺 holds. Since 𝑁1 ⊧ 𝜎1 is not 𝐸-equivalent
to any name on a poset of cardinality smaller than 𝜅1 , in particular to 𝜎0 , it follows
from the Mostowski absoluteness between 𝑉 and 𝑁1 [𝐺, 𝐺1 ] that 𝜎0 /𝐺 𝐸 𝜎1 /𝐺1 fails. In
conclusion, 𝑘(𝑦0 ) = 𝜎0 /𝐺0 𝐸 𝜎1 /𝐺1 = 𝑘(𝑦1 ) fails as required. □
The status of a Borel equivalence relation as pinned/unpinned may be absolute be-

tween models of ZFC by Corollary 2.7.3. However, if one dares to look at choiceless
models, a much more colorful picture comes to sight. The simplest description of the
pinned status occurs in the Solovay model, where it actually obeys a former conjecture
of Kechris [54, Question 17.6.1].
Theorem 2.8.11. The following holds in the Solovay model derived from a measur-
able cardinal. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋. The following
are equivalent:
(1) 𝐸 is unpinned;
(2) 𝔽2 ≤ 𝐸 or 𝔼𝜔1 ≤𝑎 𝐸.
Proof. Let 𝜅 be a measurable cardinal and let 𝑊 be the derived Solovay model. In
𝑊, (2) certainly implies (1) as the proofs that 𝔽2 , 𝐸𝜔1 are unpinned work in ZF, and the
proof that pinned equivalence relations persist downwards in the reducibility orderings
works in ZF+DC.
For the implication (1)→ (2), assume that 𝑊 ⊧ 𝐸 is unpinned. There must be a
poset 𝑃 and a nontrivial 𝐸-pinned name 𝜏 on the poset 𝑃, both in 𝑊. Both 𝑃 and 𝜏
must be definable in 𝑊 from a ground model parameter 𝑧 ∈ 2𝜔 . For simplicity of the
notation assume that 𝑧 ∈ 𝑉. Return to 𝑉. Let 𝑄 be the two-step iteration Coll(𝜔, <
𝜅) ∗ 𝑃,̇ and write 𝜎 for the 𝑄-name obtained from the 𝑃-namė 𝜏. There are two cases.
Case 1. There is a condition 𝑞 ∈ 𝑄 such that the 𝑄 ↾ 𝑞-name 𝜎 is 𝐸-pinned. In this
case, we will conclude that 𝔼𝜔1 ≤𝑎 𝐸 and use the Shoenfield absoluteness to transfer
the almost reducibility to the Solovay model. To simplify the notation assume that 𝑞 is
the largest element of the poset 𝑄.
̄
Observe that the name 𝜎 cannot be 𝐸-equivalent to any name on a poset of cardi-
nality smaller than 𝜅. Suppose for contradiction that 𝑅 is a poset of cardinality smaller
than 𝜅 and 𝜒 an 𝐸-pinned 𝑅-name such that ⟨𝑅, 𝜒⟩ 𝐸̄ ⟨𝑄, 𝜎⟩. In 𝑊, let 𝐻 ⊂ 𝑅 be a
filter generic over 𝑉. By Proposition 2.1.5 applied over 𝑉, 𝑊 ⊧ 𝑃 ⊩ 𝜏 𝐸 𝜒/𝐻. This
contradicts the assumption that 𝑉[𝐺] ⊧ 𝑃 ⊩ ∀𝑥 ∈ 𝑋 ∩ 𝑉[𝐺] ¬𝜏 𝐸 𝑥.
Now, it follows that 𝜅(𝐸) ≥ 𝜅. By Theorem 2.5.6(2), since 𝜅 is a measurable cardi-
nal, 𝜅(𝐸) = ∞. By Theorem 2.8.9, 𝔼𝜔1 ≤𝑎 𝐸 as desired.
Case 2. For every condition 𝑞 ∈ 𝑄, the 𝑄 ↾ 𝑞-name 𝜎 is not 𝐸-pinned. In this case,
we will conclude that 𝔽2 is reducible to 𝐸. Then, a Shoenfield absoluteness argument
shows that the Borel reduction of 𝔽2 to 𝐸 remains a Borel reduction also in the Solovay
model.
Fix a countable elementary submodel 𝑀 of a large structure containing the code
for 𝐸, the posets 𝑃, 𝑄 and the name 𝜏. Write 𝑅 = Coll(𝜔, < 𝜅) ∩ 𝑀. Let 𝑍 = 2𝜔 , and use
Proposition 1.7.9 to find a Borel function 𝐺 from 𝑍 to 𝒫(𝑀) such that for every finite
set 𝑎 ⊂ 𝑍 the filters 𝐺(𝑧) ⊂ 𝑅 for 𝑧 ∈ 𝑎 are mutually generic over 𝑀. For every set
𝑎 ⊂ 𝑍 write 2𝜔 𝜔 𝜔
𝑎 = ⋃{2 ∩ 𝑀[∏𝑧∈𝑏 𝐺(𝑧)] ∶ 𝑏 ⊂ 𝑎 finite}, 𝑀𝑎 = 𝑀(2𝑎 ), 𝑃𝑎 and 𝜏𝑎 for the
𝜔
poset and name in 𝑀𝑎 defined in the model 𝑀(2𝑎 ) by the formulas 𝜙𝑃 and 𝜙𝜏 . Similar
usage will prevail for functions 𝑦 ∶ 𝜔 → 𝐼, writing 𝑃𝑦 = 𝑃rng(𝑦) etc.
Lemma 2.8.12.
(1) whenever 𝑎 ⊂ 𝑍 is a nonempty set then there exists a filter ℎ ⊂ 𝑅 generic over 𝑀
such that 2𝜔 ∩ 𝑀[ℎ] = 2𝜔 𝑎;
(2) whenever 𝑎, 𝑏, 𝑐 ⊂ 𝐼 are pairwise disjoint countable nonempty sets then there
is a filter ℎ𝑎 × ℎ𝑏 × ℎ𝑐 ⊂ 𝑅3 generic over 𝑀 such that 2𝜔 𝜔
𝑎 = 2 ∩ 𝑉[ℎ𝑎 ] and
𝜔 𝜔
similarly for 2𝑏 and 2𝑐 ;
(3) whenever 𝑎, 𝑏 are distinct countable subsets of 𝐼 then 𝑃𝑎 × 𝑃𝑏 ⊩ ¬𝜏𝑎 𝐸 𝜏𝑏 .
Proof. For (1), let 𝑆 = {𝑘 ∶ ∃𝛼 ∈ 𝜅 ∩ 𝑀 ∃𝑏 ⊂ 𝑎 𝑏 is finite and 𝑘 ⊂ Coll(𝜔, < 𝛼) ∩ 𝑀
is a filter generic over 𝑀 and 𝑘 ∈ 𝑀[𝐺(𝑧) ∶ 𝑧 ∈ 𝑏]} and order 𝑆 by inclusion. Let 𝐾 ⊂ 𝑆
be a sufficiently generic filter; we claim that ℎ = ⋃ 𝐾 works as desired. Indeed, a
simple density argument shows that ℎ ⊂ 𝑅 is an ultrafilter all of whose proper initial
segments are generic over 𝑀. By the 𝜅-c.c. of Coll(𝜔, < 𝜅), the filter ℎ is in fact generic
over 𝑀 itself. A straightforward genericity argument using Fact 1.7.14 then shows that
2𝜔 𝜔
𝑎 = 2 ∩ 𝑀[ℎ] as desired.
(2) follows easily from (1). Let ℎ𝑎 , ℎ𝑏 , ℎ𝑐 ⊂ 𝑅 be any filters obtained from (1);
we will show that these filters are in fact mutually generic over the model 𝑉. Since
Coll(𝜔, < 𝜅)3 has 𝜅-c.c.c., it is enough to show that for every ordinal 𝛼 ∈ 𝜅, the filters
ℎ𝑎𝛼 = ℎ𝑎 ∩ Coll(𝜔, < 𝛼), ℎ𝑏𝛼 = ℎ𝑏 ∩ Coll(𝜔, < 𝛼), and ℎ𝑐𝛼 = ℎ𝑐 ∩ Coll(𝜔, < 𝛼) are
mutually generic over 𝑉. Since the filters ℎ𝑎𝛼 , ℎ𝑏𝛼 and ℎ𝑐𝛼 are coded by reals in the
models 𝑀[ℎ𝑎 ], 𝑀[ℎ𝑏 ], and 𝑀[ℎ𝑐 ],there are finite subsets 𝑎′ , 𝑏′ , 𝑐′ of 𝑎, 𝑏, 𝑐 respectively
such that ℎ𝑎𝛼 ∈ 𝑀[∏𝑖∈𝑎′ 𝑔𝑖 ] etc. The mutual genericity now follows from the general
Corollary 1.7.10 about product forcing.
(3) is proved in several parallel cases depending on the mutual position of the sets
𝑎, 𝑏 vis-a-vis inclusion. We will treat the case in which all three sets 𝑎 ∩ 𝑏, 𝑎 ⧵ 𝑏, 𝑏 ⧵ 𝑎
are nonempty. Suppose for contradiction that 𝑃𝑎 × 𝑃𝑏 ⊩ 𝜏𝑎 𝐸 𝜏𝑏 . From (2), it follows
that in 𝑉, the triple product Coll(𝜔, < 𝜅)3 forces 𝑃{0,1} ̇ × 𝑃{1,2}
̇ ⊩ 𝜏{0,1} 𝐸 𝜏{1,2} . Then, the
4
quadruple product Coll(𝜔, < 𝜅) forces in 𝑉 that 𝑃{0,1} ̇ × 𝑃{1,2}
̇ × 𝑃{2,3}
̇ ⊩ 𝜏{0,1} 𝐸 𝜏{1,2} 𝐸
̇
𝜏{2,3} , in particular 𝑃{0,1} ̇
× 𝑃{2,3} ⊩ 𝜏{0,1} × 𝜏{2,3} . In view of (2) again, this means that
the product Coll(𝜔, < 𝜅) × Coll(𝜔, < 𝜅) forces 𝑃left ̇ × 𝑃right
̇ ⊩ 𝜏left 𝐸 𝜏right . In other
̇ ̇
words, (Coll(𝜔, < 𝜅) ∗ 𝑃) × (Coll(𝜔, < 𝜅) ∗ 𝑃) forces 𝜎left 𝐸 𝜎right , contradicting the case
assumption. □
Write 𝑌 = (2𝜔 )𝜔 = dom(𝔽2 ). Use the Lusin–Novikov theorem to find a Borel map
𝑔 ∶ 𝑌 → (2𝜔 )𝜔 such that for every 𝑦 ∈ 𝑌 , 𝑔(𝑦) enumerates the set 2𝜔
𝑦 . Use Lem-
mas 2.8.12(1) and 2.8.5 to find a Borel map ℎ ∶ 𝑌 → 𝒫(𝑄 ∩ 𝑀) such that for every
2.8. DICHOTOMIES 71
𝑦 ∈ 𝑌 , ℎ(𝑦) ⊂ 𝑄 is a filter generic over 𝑀 and rng(𝑔(𝑦)) = 2𝜔 ∩ 𝑉[ℎ0 (𝑦)], where

ℎ0 (𝑦) ⊂ 𝑅 is the filter generic over 𝑀 obtained from ℎ(𝑦). Let 𝑘 ∶ 𝑌 → 𝑋 be given by
𝑘(𝑦) = 𝜏/ℎ(𝑦); this is a Borel map by Lemma 2.8.4. We will show that 𝑘 is a reduction
of 𝔽2 to 𝐸.
First, assume that 𝑦0 , 𝑦1 ∈ 𝑌 are 𝔽2 -related. Then rng(𝑦0 ) = rng(𝑦1 ), rng(𝑔(𝑦0 )) =
rng(𝑔(𝑦1 )), so 𝑀𝑦0 = 𝑀𝑦1 , 𝑃𝑦0 = 𝑃𝑦1 and 𝜏𝑦0 = 𝜏𝑦1 . Let 𝐻 ⊂ 𝑃𝑦0 be a filter generic over
both countable models 𝑀𝑦0 [𝑘(𝑦0 )] and 𝑀𝑦1 [𝑘(𝑦1 )] and let 𝑥 = 𝜏𝑦0 /𝐻. By the forcing
theorem applied in the model 𝑀𝑦0 = 𝑀𝑦1 and the fact that 𝜏𝑦0 is an 𝐸-pinned name,
conclude that 𝑥 𝐸 𝑘(𝑦0 ) and 𝑥 𝐸 𝑘(𝑦1 ), so 𝑘(𝑥0 ) 𝐸 𝑘(𝑥1 ) as desired.
Second, assume that 𝑦0 , 𝑦1 ∈ 𝑌 are not 𝔽2 -related. Choose a sufficiently generic
filter 𝐻0 × 𝐻1 ⊂ 𝑃𝑦0 × 𝑃𝑦1 so that 𝐻0 is generic over 𝑀𝑦0 [𝑘(𝑦0 )] and 𝐻1 is generic
over 𝑀𝑦1 [𝑘(𝑦1 )]. As the names 𝜏𝑦0 and 𝜏𝑦1 are 𝐸-pinned, the forcing theorem in the
models 𝑀𝑦0 and 𝑀𝑦1 implies that 𝑘(𝑦0 ) 𝐸 𝜏𝑦0 /𝐻0 and 𝑘(𝑦1 ) 𝐸 𝜏𝑦1 /𝐻1 . Now, 𝜏𝑦0 /𝐻0 𝐸
𝜏𝑦1 /𝐻1 fails by Lemma 2.8.12(3), so 𝑘(𝑦0 ) 𝐸 𝑘(𝑦1 ) must fail as well. This completes the
proof. □
Corollary 2.8.13. The following holds in the symmetric Solovay model derived
from a measurable cardinal. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. 𝐸
is unpinned if and only if 𝔽2 ≤ 𝐸.
Proof. This follows from Theorem 2.8.11 once we show that the option 𝔼𝜔1 ≤𝑎
𝐸 is not available for any Borel equivalence relation 𝐸. This in turn follows easily
from results on the pinned cardinal 𝜅(𝐸) obtained in Section 2.5: 𝜅(𝐸) < ∞ by Theo-
rem 2.5.6(1), 𝜅(𝐸𝜔1 ) = ∞ by Example 2.4.6, and the pinned cardinal is monotone with
respect to the reducibility ordering ≤𝑎 –Theorem 2.5.4. □
CHAPTER 3
Turbulence
In this chapter, we investigate pairs of generic extensions 𝑉[𝐻0 ] and 𝑉[𝐻1 ] such
that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉. In a particularly successful application, this allows us to
restate Hjorth’s concept of turbulence in geometric terms and produce many general-
izations of the associated ergodicity theorem [59, Theorem 12.5].
3.1. Independent functions

The purpose of this section is to find a practical way of producing many extensions
which satisfy the condition 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 without being mutually generic. We
need a folkloric observation. Recall that for a Polish space 𝑋, the poset 𝑃𝑋 consists
of nonempty open subsets of 𝑋 ordered by inclusion; 𝑥𝑔𝑒𝑛 ̇ is its name for the unique
element of 𝑋 belonging to all open sets in the generic filter.
Proposition 3.1.1. Let 𝑋, 𝑌 be Polish spaces and 𝑓 ∶ 𝑋 → 𝑌 be a continuous open

function. Then 𝑃𝑋 forces 𝑓(𝑥𝑔𝑒𝑛
̇ ) to be a 𝑃𝑌 -generic element of 𝑌 .
Proof. It is just necessary to show that for every open dense set 𝐷 ⊂ 𝑌 , 𝑃𝑋 ⊩
̇ ) ∈ 𝐷 holds. To this end, let 𝑂 ∈ 𝑃𝑋 be a condition. The set 𝑓″ 𝑂 ⊂ 𝑌 is
𝑓(𝑥𝑔𝑒𝑛
open; therefore, it has nonempty intersection with 𝐷. Consider the nonempty open
set 𝑂′ = (𝑓−1 (𝑓″ 𝑂 ∩ 𝐷)) ∩ 𝑂 ⊂ 𝑂. For every point 𝑥 ∈ 𝑂′ , 𝑓(𝑥) ∈ 𝐷 holds, so
𝑂′ ⊩ 𝑓(𝑥𝑔𝑒𝑛
̇ ) ∈ 𝐷 as required. □
Now suppose that 𝑋, 𝑌0 , 𝑌1 are Polish spaces and 𝑓0 ∶ 𝑋 → 𝑌0 and 𝑓1 ∶ 𝑋 → 𝑌1 are

continuous open maps. We want to find a criterion implying that 𝑃𝑋 ⊩ 𝑉[𝑓0 (𝑥𝑔𝑒𝑛
̇ )] ∩
𝑉[𝑓1 (𝑥𝑔𝑒𝑛
̇ )] = 𝑉. The following turbulence–like definition is central.
Definition 3.1.2. Let 𝑋, 𝑌0 , 𝑌1 be Polish spaces and 𝑓0 ∶ 𝑋 → 𝑌0 and 𝑓1 ∶ 𝑋 → 𝑌1

be continuous open maps. Let 𝑘 ∈ 𝜔 be a number. A walk (of points) of length 𝑘 is a
sequence ⟨𝑥𝑖 ∶ 𝑖 ≤ 𝑘⟩ of points in 𝑋 such that for each 𝑖 ∈ 𝑘, either 𝑓0 (𝑥𝑖 ) = 𝑓0 (𝑥𝑖+1 ) or
𝑓1 (𝑥𝑖 ) = 𝑓1 (𝑥𝑖+1 ) holds.
Definition 3.1.3. Let 𝑋, 𝑌0 , 𝑌1 be Polish spaces and 𝑓0 ∶ 𝑋 → 𝑌0 and 𝑓1 ∶ 𝑋 → 𝑌1

be continuous open maps. The functions 𝑓0 , 𝑓1 are independent if for every nonempty
open set 𝑂 ⊂ 𝑋 there is a nonempty open set 𝐴 ⊂ 𝑌0 such that for all nonempty open
subsets 𝐵0 , 𝐵1 ⊂ 𝐴 there is a walk consisting of points in 𝑂 starting in 𝑓0−1 𝐵0 and ending
in 𝑓0−1 𝐵1 .
It may appear that the definition is not symmetric with respect to the maps 𝑓0 , 𝑓1 . In
fact, the definition is symmetric, and this follows as a small corollary from the following
central theorem.
73
74 3. TURBULENCE
Theorem 3.1.4. Suppose that 𝑋, 𝑌0 , 𝑌1 are Polish spaces and 𝑓0 ∶ 𝑋 → 𝑌0 and

𝑓1 ∶ 𝑋 → 𝑌1 are continuous open maps. The following are equivalent:
(1) 𝑓0 , 𝑓1 are independent;
(2) 𝑃𝑋 ⊩ 𝑉[𝑓0 (𝑥𝑔𝑒𝑛̇ )] ∩ 𝑉[𝑓1 (𝑥𝑔𝑒𝑛
̇ )] = 𝑉 where 𝑥𝑔𝑒𝑛
̇ is the 𝑃𝑋 -name for the generic
element of 𝑋.
Andy Zucker remarked in personal communication that item (2) can be naturally re-
stated without reference to forcing as a statement about impossibility of completing
the functions 𝑓0 , 𝑓1 to a nontrivial commutative diagram: whenever 𝑔0 ∶ 𝑌0 → 𝑍 and
𝑔1 ∶ 𝑌1 → 𝑍 are Borel functions to a Polish space 𝑍 such that the set {𝑥 ∈ 𝑋 ∶ 𝑔0 (𝑓0 (𝑥))
= 𝑔1 (𝑓1 (𝑥))} is non-meager, then there is a point 𝑧 ∈ 𝑍 such that {𝑥 ∈ 𝑋 ∶ 𝑔0 (𝑓0 (𝑥)) =
𝑔1 (𝑓1 (𝑥)) = 𝑧} is non-meager.
Proof. For the (1)→(2) implication, we need a preliminary definition and a claim.
Let 𝑘 ∈ 𝜔 be a number. A walk of open sets of length 𝑘 is a sequence ⟨𝑂𝑖 ∶ 𝑖 ≤ 𝑘⟩
of nonempty open subsets of 𝑋 such that for each 𝑖 ∈ 𝑘, either 𝑓0″ 𝑂𝑖 = 𝑓0″ 𝑂𝑖+1 or
𝑓1″ 𝑂𝑖 = 𝑓1″ 𝑂𝑖+1 .
Claim 3.1.5. Let 𝑘 ∈ 𝜔 be a number. Suppose that ⟨𝑥𝑖 ∶ 𝑖 ≤ 𝑘⟩ is a walk of points,
𝑂𝑖 ⊂ 𝑋 are open sets such that 𝑥𝑖 ∈ 𝑂𝑖 , and 𝐷 is a finite collection of open subsets of 𝑋.
Then there is a walk ⟨𝑃𝑖 ∶ 𝑖 ≤ 𝑘⟩ of open sets such that 𝑃𝑖 ⊂ 𝑂𝑖 holds for each 𝑖 ≤ 𝑘 and for
each 𝑈 ∈ 𝐷 and each 𝑖 ≤ 𝑘, 𝑃𝑖 is either disjoint from 𝑈 or a subset of 𝑈.
Proof. By induction on 𝑘. The case 𝑘 = 0 is trivial. Suppose that the claim has
been proved for 𝑘 and ⟨𝑥𝑖 ∶ 𝑖 ≤ 𝑘 + 1⟩ is a walk of points, 𝑂𝑖 are open sets, and 𝐷 is a
finite collection of open subsets of 𝑋. Suppose for definiteness that 𝑓0 (𝑥𝑘 ) = 𝑓0 (𝑥𝑘+1 ).
Shrinking 𝑂𝑘 and 𝑂𝑘+1 if necessary, we may assume that 𝑓0″ 𝑂𝑘 = 𝑓0″ 𝑂𝑘+1 . For each
open set 𝑈 ∈ 𝐷 let 𝑈 ′ = ⋃{𝑉 ⊂ 𝑋 ∶ 𝑉 is open and 𝑓0−1 𝑓0″ 𝑉 ⊂ 𝑈} and let 𝐸 =
{𝑈 ′ ∶ 𝑈 ∈ 𝐷}. By the induction hypothesis, there is a walk ⟨𝑃𝑖 ∶ 𝑖 ≤ 𝑘⟩ of open sets
such that 𝑃𝑖 ⊂ 𝑂𝑖 and 𝑃𝑖 is either disjoint from or a subset of each element of 𝐷 ∪ 𝐸. Let
𝑃𝑘+1 = 𝑓0−1 𝑓0″ 𝑃𝑘 ∩ 𝑂𝑘+1 and observe that the walk ⟨𝑃𝑖 ∶ 𝑖 ≤ 𝑘 + 1⟩ of open sets works as
required. □
Assume now that the functions 𝑓0 , 𝑓1 are independent. Since the models in (2) satisfy
ZFC, it is enough to show that every set of ordinals in the intersection is actually in 𝑉.
To this end, suppose that 𝜏0 , 𝜏1 are 𝑃𝑌0 and 𝑃𝑌1 -names for sets of ordinals. We will abuse
notation somewhat and write 𝜏0 also for the 𝑃𝑋 -name for 𝜏0 /𝑓0̇ (𝑥𝑔𝑒𝑛 ̇ ) and 𝜏1 for the 𝑃𝑋 -
name for 𝜏1 /𝑓1 (𝑥𝑔𝑒𝑛
̇ ). Suppose that 𝑂 ⊂ 𝑋 is a nonempty open set forcing 𝜏0 = 𝜏1 . We
must find a nonempty open set 𝑂′ ⊂ 𝑂 deciding the statement 𝛼̌ ∈ 𝜏0 for every ordinal
𝛼.
Let 𝐴 ⊂ 𝑌0 be a nonempty open set standing witness to the independence of the
functions 𝑓0 , 𝑓1 . We claim that for every ordinal 𝛼, in the poset 𝑃𝑌0 , 𝐴 ⊩ 𝛼̌ ∈ 𝜏0 or
𝐴 ⊩ 𝛼̌ ∉ 𝜏0 . Once this is proved, let 𝑂′ = 𝑂 ∩ 𝑓0−1 𝐴 and note that 𝑂′ decides the
membership of every ordinal in 𝜏0 as desired.
Suppose towards a contradiction that there exist an ordinal 𝛼 and nonempty open
sets 𝐵0 , 𝐵1 ⊂ 𝐴 such that 𝐵0 ⊩ 𝛼̌ ∈ 𝜏0 and 𝐵1 ⊩ 𝛼̌ ∉ 𝜏0 . Let ⟨𝑥𝑖 ∶ 𝑖 ≤ 𝑘⟩ be a walk
of points in 𝑂 such that 𝑓0 (𝑥0 ) ∈ 𝐵0 and 𝑓0 (𝑥𝑘 ) ∈ 𝐵1 . Let 𝑈0 = ⋃{𝑈 ∶ 𝑈 ⊂ 𝑋 and
𝑈 ⊩ 𝛼̌ ∈ 𝜏0 } and 𝑈1 = ⋃{𝑈 ∶ 𝑈 ⊂ 𝑋 and 𝑈 ⊩ 𝛼̌ ∈ 𝜏1 }. By the claim, there must
be a walk of open sets ⟨𝑂𝑖 ∶ 𝑖 ≤ 𝑘⟩ such that each set 𝑂𝑖 is a subset of 𝑂, 𝑂0 ⊂ 𝑓0−1 𝐵0 ,
3.2. EXAMPLES AND OPERATIONS 75
𝑂𝑘 ⊂ 𝑓0−1 𝐵1 , and each 𝑂𝑖 is either disjoint from or a subset of 𝑈0 , and either disjoint
from or a subset of 𝑈1 . This means in particular that each 𝑂𝑖 decides both statements
𝛼̌ ∈ 𝜏0 and 𝛼̌ ∈ 𝜏1 .
Now, since 𝑂0 ⊩ 𝛼̌ ∈ 𝜏0 and 𝑂𝑘 ⊩ 𝛼̌ ∉ 𝜏0 , there must be a number 𝑖 ∈ 𝑘 such
that 𝑂𝑖 ⊩ 𝛼̌ ∈ 𝜏0 and 𝑂𝑖+1 ⊩ 𝛼̌ ∉ 𝜏0 . It then must be the case that 𝑓0″ 𝑂𝑖 , 𝑓0″ 𝑂𝑖+1 ⊂ 𝑌0
are disjoint; therefore, the sets 𝑓1″ 𝑂𝑖 , 𝑓1″ 𝑂𝑖+1 ⊂ 𝑌1 are equal. This means that the sets
𝑂𝑖 , 𝑂𝑖+1 must either both force 𝛼̌ ∈ 𝜏1 or both force 𝛼̌ ∉ 𝜏1 . In conclusion, one of the
sets 𝑂𝑖 , 𝑂𝑖+1 forces 𝜏0 ≠ 𝜏1 , a contradiction.
To see why the negation of (1) implies the negation of (2), let 𝑂 ⊂ 𝑋 be a nonempty
open set witnessing the failure of (1). For each 𝑦 ∈ 𝑌0 , define the orbit of 𝑦 to be the set
of all elements 𝑧 ∈ 𝑌0 such that there is a walk ⟨𝑥𝑖 ∶ 𝑖 ≤ 2𝑘⟩ in 𝑂 such that 𝑓0 (𝑥0 ) = 𝑦
and 𝑓0 (𝑥2𝑘 ) = 𝑧. Let 𝑥 ∈ 𝑂 be a 𝑃𝑋 -generic and work in the model 𝑉[𝑥].
Claim 3.1.6. The orbit of 𝑓0 (𝑥) is nowhere dense in 𝑌0 .
Proof. If the orbit were dense in some nonempty open set 𝐵 ⊂ 𝑌0 , then in the
ground model, the set 𝐵 would show that 𝑂 is not a witness to the failure of (1). To see
this, suppose that 𝐵0 , 𝐵1 ⊂ 𝐵 are nonempty open subsets of 𝐵. Working in 𝑉[𝑥], find
walks 𝑤0 , 𝑤1 in 𝑂 which lead from 𝑓0 (𝑥) to 𝐵0 and 𝐵1 , invert 𝑤0 and concatenate with
𝑤1 and get a walk from 𝐵0 to 𝐵1 . By the Mostowski absoluteness between 𝑉[𝑥] and 𝑉,
there must be such a walk in 𝑉 as well. □
Now look at the set 𝐴 = {𝐵 ⊂ 𝑌0 ∶ 𝐵 is a basic open subset of 𝑌0 and 𝐵 contains no

element of the orbit of 𝑓0 (𝑥)}.
Claim 3.1.7. 𝐴 ∈ 𝑉[𝑓0 (𝑥)] ∩ 𝑉[𝑓1 (𝑥)].
Proof. In 𝑉[𝑥], the set 𝐴 is defined as the set of all basic open sets 𝐵 ⊂ 𝑌0 such
that there is no walk ⟨𝑥𝑖 ∶ 𝑖 ≤ 2𝑘⟩ in 𝑂 such that 𝑓0 (𝑥0 ) = 𝑓0 (𝑥) and 𝑓0 (𝑥2𝑘 ) ∈ 𝐵. This is
a Π11 definition with parameter 𝑓0 (𝑥) which therefore yields the same set in the model
𝑉[𝑓0 (𝑥)].
In 𝑉[𝑥], the same set 𝐴 also has an alternative definition: it is the set of all basic
open sets 𝐵 ⊂ 𝑌0 such that there is no walk ⟨𝑥𝑖 ∶ 𝑖 ≤ 2𝑘⟩ in 𝑂 such that 𝑓1 (𝑥0 ) = 𝑓1 (𝑥)
and 𝑓0 (𝑥2𝑘 ) ∈ 𝐵. To see this, note that a walk with 𝑓0 (𝑥0 ) = 𝑓0 (𝑥) can be transformed
into a walk with 𝑓1 (𝑥0 ) = 𝑓1 (𝑥) (and also vice versa) by simply adding the point 𝑥
twice to the beginning of the walk. This alternative definition of the set 𝐴 is again
Π11 with parameter 𝑓1 (𝑥), so Mostowski absoluteness yields the same set in the model
𝑉[𝑓1 (𝑥)]. □
To show that (2) fails, it is enough to argue that 𝐴 ∉ 𝑉. However, if 𝐴 ∈ 𝑉 then ⋃ 𝐴 ∈

𝑉 is an open dense subset of 𝑌0 by Claim 3.1.6, and 𝑓0 (𝑥) ∉ ⋃ 𝐴. This contradicts
Proposition 3.1.1: the point 𝑓0 (𝑥) ∈ 𝑌 is forced to be 𝑃𝑌 -generic over the ground model,
so to belong to every open dense set in the ground model. □
3.2. Examples and operations

Several groups of results in this book depend on an identification of a suitable pair
of independent maps. The most important example comes from Hjorth’s notion of
turbulence of group actions. Recall the following standard definition.
76 3. TURBULENCE
Definition 3.2.1. [54, Section 13.1] Let Γ be a Polish group continuously acting
on a Polish space 𝑌 .
(1) If 𝑈 ⊂ Γ, 𝑂 ⊂ 𝑌 are sets then a 𝑈, 𝑂-walk is a sequence ⟨𝑦𝑖 ∶ 𝑖 ≤ 𝑘, 𝛾𝑖 ∶ 𝑖 < 𝑘⟩
such that for each 𝑖 ≤ 𝑘 𝑦𝑖 ∈ 𝑂 holds, and for each 𝑖 < 𝑘 𝛾𝑖 ∈ 𝑈 and 𝑦𝑖+1 =
𝛾𝑖 ⋅ 𝑦𝑖 both hold;
(2) if 𝑦 ∈ 𝑂 then 𝑈, 𝑂-orbit of 𝑦 is the set of all 𝑧 ∈ 𝑂 such that there is a 𝑈, 𝑂-
walk starting at 𝑦 and ending at 𝑧;
(3) the action is turbulent at 𝑦 ∈ 𝑌 if for all open sets 𝑈 ⊂ Γ and 𝑂 ⊂ 𝑋 with
1 ∈ 𝑈 and 𝑦 ∈ 𝑂 the 𝑈, 𝑂-orbit of 𝑦 is somewhere dense;
(4) the action is generically turbulent if its orbits are meager and dense and the
set of points of turbulence is comeager.
Now, suppose that Γ is a Polish group acting continuously on a Polish space 𝑌 . Let
𝑋 = {⟨𝛾, 𝑦0 , 𝑦1 ⟩ ∈ Γ × 𝑌 × 𝑌 ∶ 𝛾 ⋅ 𝑦0 = 𝑦1 }; this is a closed subset of Γ × 𝑌 × 𝑌 and Polish
in the inherited topology. Let 𝑓0 ∶ 𝑋 → 𝑌 be the projection into the second coordinate,
𝑓1 ∶ 𝑋 → 𝑌 be the projection into the third coordinate, and let 𝑓2 ∶ 𝑋 → Γ × 𝑌 be the
projection into the first two coordinates. Since the set 𝑋 can be viewed as a graph of a
continuous function of any pair of coordinates into the remaining one, these mappings
are continuous and open. With this notation in hand, we prove:
Theorem 3.2.2. Let Γ be a Polish group continuously acting on a Polish space 𝑌
such that all orbits are meager and dense. The following are equivalent:
(1) the action is generically turbulent;
(2) 𝑓0 , 𝑓1 ∶ 𝑋 → 𝑌 is an independent pair of functions;
(3) 𝑃Γ × 𝑃𝑌 forces 𝑉[𝑥𝑔𝑒𝑛
̇ ] ∩ 𝑉[𝛾𝑔𝑒𝑛
̇ ⋅ 𝑥𝑔𝑒𝑛
̇ ] = 𝑉.
Proof. For the implication (1)→(2), suppose that the action is generically turbu-
lent. Let 𝑂 ⊂ 𝑋 be a nonempty open set. Find a point 𝛿 ∈ Γ and open sets 𝑈 ⊂ Γ and
𝑂0 , 𝑂1 ⊂ 𝑌 such that 1 ∈ 𝑈, 𝑈 = 𝑈 −1 , and (𝛿 ⋅ 𝑈 × 𝑂0 × 𝑂1 ) ∩ 𝑋 ⊂ 𝑂. Find a point
𝑦 ∈ 𝑂0 such that the 𝑈, 𝑂0 -orbit of 𝑦 is somewhere dense; let 𝐴 ⊂ 𝑌 be a nonempty
open set such that the 𝑈, 𝑂0 -orbit of 𝑦 is dense in 𝐴. We claim that 𝐴 ⊂ 𝑌 is an open
set witnessing the independence of functions 𝑓0 and 𝑓1 .
To see this, let 𝐵0 , 𝐵1 ⊂ 𝐴 be nonempty open sets. Concatenating 𝑈, 𝑂0 -walks from
𝑦 to 𝐵0 and 𝐵1 , we can find a 𝑈, 𝑂0 -walk ⟨𝑦𝑖 ∶ 𝑖 ≤ 𝑘, 𝛾𝑖 ∶ 𝑖 < 𝑘⟩ which starts in 𝐵0 and
ends in 𝐵1 . Consider the sequence ⟨𝑥𝑖 ∶ 𝑖 ≤ 2𝑘⟩ of points in the open set 𝑂 ⊂ 𝑋 given by
𝑥2𝑖 = ⟨𝛿, 𝑦𝑖 , 𝛿 ⋅𝑦𝑖 ⟩ and 𝑥2𝑖+1 = ⟨𝛿𝛾𝑖 , 𝑦𝑖 , 𝛿𝑦𝑖+1 ⟩ if 𝑖 < 𝑘. It is immediate that this is an walk
of points in the set 𝑂 in the sense of Definition 3.1.2, confirming the independence of
functions 𝑓0 , 𝑓1 .
For the implication (2)→(1), suppose that the functions 𝑓0 , 𝑓1 are independent. Let
𝑈 ⊂ Γ be an open neighborhood of 1 and 𝑂0 ⊂ 𝑌 be a nonempty open set. Choose an
open neighborhood 𝑈0 ⊂ Γ of the unit such that 𝑈0−1 ⋅ 𝑈0 ⊂ 𝑈 and let 𝑂 = {⟨𝛾, 𝑦0 , 𝑦1 ⟩ ∈
𝑋 ∶ 𝛾 ∈ 𝑈0 and 𝑦0 , 𝑦1 ∈ 𝑂0 }. Suppose that ⟨𝑥𝑖 ∶ 𝑖 ≤ 𝑘⟩ is a walk of points in the set 𝑂 in
the sense of Definition 3.1.2 and 𝑥𝑖 = ⟨𝛿𝑖 , 𝑧𝑖 , 𝑧′𝑖 ⟩; then the sequence ⟨𝑧𝑖 ∶ 𝑖 ≤ 𝑘, 𝛾𝑖 ∶ 𝑖 <
𝑘⟩ is an 𝑈, 𝑂0 -walk in the sense of Definition 3.2.1, where 𝛾𝑖 = 1 if 𝑧𝑖 = 𝑧𝑖+1 and
−1
𝛾𝑖 = 𝛿𝑖+1 𝛿𝑖 if 𝑧𝑖 ≠ 𝑧𝑖+1 (in which case 𝑧′𝑖 = 𝑧′𝑖+1 ).
Now, if 𝐴 ⊂ 𝑂0 is an open set witnessing the independence of 𝑓0 , 𝑓1 for 𝑂 and 𝐵 ⊂ 𝐴
is a nonempty open set, then the set {𝑦 ∈ 𝐴 ∶ there is a walk of points in 𝑂 from 𝑦 to
𝐵} is open dense in 𝐴, and by the previous paragraph it is a subset of the set {𝑦 ∈ 𝐴 ∶
there is an 𝑈, 𝑂0 -walk from 𝑦 to 𝐵}. Thus, the set 𝐶𝑈,𝑂0 = {𝑦 ∈ 𝑌 ∶ either 𝑦 ∉ 𝐴 or the
𝑈, 𝑂0 -orbit of 𝑦 is dense in 𝐴} is comeager. The set of turbulent points then contains
the intersection ⋂{𝐶𝑈,𝑂0 ∶ 𝑈 ⊂ Γ is a basic open neighborhood of 1 and 𝑂0 ⊂ 𝑌 is a
basic open set} and is comeager.
The equivalence (2)↔(3) follows from Theorem 3.1.4 and the fact that the func-
tion 𝑓2 is continuous and open, so the first two coordinates of the 𝑃𝑋 -generic point are
generic for 𝑃Γ × 𝑃𝑌 by Proposition 3.1.1. □
A somewhat similar characterization theorem can be proved for analytic ideals
on 𝜔.
Definition 3.2.3. [14] A set 𝐼 ⊂ 𝒫(𝜔) is 𝜔-hitting if for every countable collection
of infinite subsets of 𝜔 there is a set 𝑏 ∈ 𝐼 which has nonempty intersection with each
set in the collection.
A typical analytic 𝜔-hitting ideal is 𝐼𝑝 , where 𝑝 is a partition of 𝜔 into finite sets and
𝐼𝑝 is the collection of all sets 𝑎 ⊂ 𝜔 such that for some number 𝑛 ∈ 𝜔, for every set
𝑏 ∈ 𝑝, |𝑎 ∩ 𝑏| ≤ 𝑛. In fact, [49] shows that every Borel 𝜔-hitting ideal contains one
of the ideals 𝐼𝑝 as a subset in a suitable sense. 𝜔-hitting ideals give rise to pairs of
independent functions in the proof of the following theorem:
Theorem 3.2.4. Let 𝐼 be an analytic ideal on 𝜔. The following are equivalent:
(1) 𝐼 is 𝜔-hitting;
(2) in some forcing extension, there are points 𝑦0 , 𝑦1 ∈ 2𝜔 separately Cohen-generic
over 𝑉 such that 𝑦0 =𝐼 𝑦1 and 𝑉[𝑦0 ] ∩ 𝑉[𝑦1 ] = 𝑉.
Proof. For the direction (1)→(2), assume that the ideal 𝐼 is 𝜔-hitting. Let ℎ ∶ 𝜔𝜔
→ 𝒫(𝜔) be a continuous map such that 𝐼 = rng(ℎ). Let 𝑇 = {𝑡 ∈ 𝜔<𝜔 ∶ ℎ″ [𝑡] is
𝜔-hitting}. The set 𝑇 ⊂ 𝜔<𝜔 is clearly closed under initial segment.
Claim 3.2.5. For all 𝑡 ∈ 𝑇 there is 𝑛 ∈ 𝜔 such that for all 𝑚 > 𝑛 there is 𝑧 ∈ [𝑇 ↾ 𝑡]
such that 𝑚 ∈ ℎ(𝑧).
Proof. Suppose towards a contradiction that the conclusion fails for some node
𝑡 ∈ 𝑇. Let 𝑎 = 𝜔 ⧵ ⋃ ℎ″ [𝑇 ↾ 𝑡]; the set 𝑎 ⊂ 𝜔 is infinite. For each 𝑠 ∈ 𝜔<𝜔 ⧵ 𝑇 let 𝑐𝑠 be
a countable collection of infinite subsets of 𝜔 such that for all 𝑧 ∈ [𝑠], ℎ(𝑧) has finite
intersection with one element of 𝑐𝑠 . Let 𝑐 = ⋃𝑠∉𝑇 𝑐𝑠 ∪ {𝑎}; it is not difficult to see that
for every 𝑧 ∈ [𝑡], ℎ(𝑧) has finite intersection with an element of 𝑐, contradicting the
assumption that 𝑡 ∈ 𝑇. □
Now, let 𝑋 be the closed set of all triples ⟨𝑦0 , 𝑦1 , 𝑧⟩ ⊂ 2𝜔 × 2𝜔 × [𝑇] such that
{𝑛 ∈ 𝜔 ∶ 𝑦0 (𝑛) ≠ 𝑦1 (𝑛)} ⊂ ℎ(𝑧). Let 𝑓0 , 𝑓1 ∶ 𝑋 → 2𝜔 be the projections into the first and
second coordinate. It is not difficult to see that both of these maps are continuous and
open. In view of Theorem 3.1.4, the following claim concludes the proof of (2).
Claim 3.2.6. The maps 𝑓0 , 𝑓1 are independent.
Proof. Let 𝑂 ⊂ 𝑋 be an open set. Find 𝑢0 , 𝑢1 ∈ 2<𝜔 and 𝑡 ∈ 𝑇 such that ([𝑢0 ] ×
[𝑢1 ] × [𝑡]) ∩ 𝑋 is a nonempty subset of 𝑂. Thinning out further, we may assume that the
binary strings 𝑢0 , 𝑢1 have the same length and for all 𝑧 ∈ [𝑇 ↾ 𝑡] and every 𝑙 such that
𝑢0 (𝑙) ≠ 𝑢1 (𝑙), 𝑛 ∈ ℎ(𝑧) holds. Let 𝑛 ∈ 𝜔 be such that for all 𝑚 > 𝑛 there is 𝑧 ∈ [𝑇 ↾ 𝑡]
such that 𝑚 ∈ ℎ(𝑧). Let 𝑣 ∈ 2<𝜔 be any binary string extending 𝑢0 of length > 𝑛 and
78 3. TURBULENCE
𝐴 = [𝑣]. We claim that the open set 𝐴 witnesses the definition of independence for
𝑓0 , 𝑓1 and 𝑂.
Indeed, suppose that 𝑤0 , 𝑤1 are two binary strings of the same length extending 𝑣.
To produce a walk from [𝑤0 ] to [𝑤1 ], list all entries on which the strings 𝑤0 , 𝑤1 differ
by {𝑚𝑗 ∶ 𝑗 ∈ 𝑖}. Let 𝑦 ∈ [𝑤0 ] be any point, and let 𝑦𝑗 ∈ 2𝜔 be the point obtained from
𝑦 by flipping the outputs at all 𝑚𝑘 for 𝑘 ∈ 𝑗. Thus, 𝑦𝑗 differs from 𝑦𝑗+1 only at entry
𝑚𝑗 and 𝑦𝑖 ∈ [𝑤1 ]. Let 𝑦𝑗′ ∈ 2𝜔 be the point obtained by replacing the initial segment
𝑢0 ⊂ 𝑦𝑗 with 𝑢1 . Also, let 𝑧𝑗 ∈ [𝑇 ↾ 𝑡] be any point such that 𝑚𝑗 ∈ ℎ(𝑧𝑗 ). Now, define
points 𝑥2𝑗+1 , 𝑥2𝑗+2 ∈ 𝑋 for 𝑗 ∈ 𝑖 as follows:
• 𝑥0 = ⟨𝑦0 , 𝑦0′ , 𝑧⟩ for any 𝑧 ∈ [𝑇 ↾ 𝑡];
′
• 𝑥2𝑗+1 = ⟨𝑦𝑗 , 𝑦𝑗+1 , 𝑧𝑗 ⟩;
• 𝑥2𝑗+2 = ⟨𝑦𝑗+1 , 𝑦𝑗+1 ′
, 𝑧⟩ for any 𝑧 ∈ [𝑇 ↾ 𝑡].
Clearly, the sequence ⟨𝑥𝑘 ∶ 𝑘 ≤ 2𝑖⟩ is a walk from [𝑤0 ] to [𝑤1 ] as required. □
To prove that (2) implies (1), assume that (1) fails, as witnessed by a countable
collection {𝑎𝑛 ∶ 𝑛 ∈ 𝜔} of infinite subsets of 𝜔. Suppose that in some generic extension,
𝑦0 , 𝑦1 ∈ 2𝜔 are =𝐼 -related points which are separately Cohen-generic over 𝑉. The
set 𝑏 = {𝑛 ∈ 𝜔 ∶ 𝑦0 (𝑛) ≠ 𝑦1 (𝑛)} belongs to the ideal 𝐼; therefore, there is a number
𝑛 ∈ 𝜔 such that 𝑏 ∩ 𝑎𝑛 is finite. It follows that the functions 𝑦0 ↾ 𝑎𝑛 and 𝑦1 ↾ 𝑎𝑛 are
modulo finite equal; therefore, they belong to 𝑉[𝑦0 ] ∩ 𝑉[𝑦1 ]. By a genericity argument,
𝑦0 ↾ 𝑎𝑛 ∉ 𝑉 holds, so (2) fails. □
3.3. Placid equivalence relations

The characterization of turbulence in Theorem 3.2.2 leads to many Borel nonre-
ducibility results and cardinal preservation results in the generic extensions of the Solo-
vay model. To state these results succinctly, the following definitions are helpful.
We say that 𝐸 is placid if, whenever 𝑉[𝐻0 ] and 𝑉[𝐻1 ] are separately generic extensions
of 𝑉 (inside some ambient generic extension) such that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 and 𝑥0 ∈
𝑉[𝐻0 ] and 𝑥1 ∈ 𝑉[𝐻1 ] are 𝐸-related points in the space 𝑋, then they are 𝐸-related to
some point in 𝑉.
We say that 𝐸 is virtually placid if, whenever 𝑉[𝐻0 ] and 𝑉[𝐻1 ] are separately generic
extensions of 𝑉 (inside some ambient generic extension) such that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉
̄
and ⟨𝑄0 , 𝜏0 ⟩ ∈ 𝑉[𝐻0 ] and ⟨𝑄1 , 𝜏1 ⟩ ∈ 𝑉[𝐻1 ] are 𝐸-related ̄
𝐸-pins, then they are 𝐸-related
to some 𝐸-pin in 𝑉.
In other words, an equivalence relation 𝐸 is placid if disjoint generic extensions do
not share any 𝐸-classes which are not represented in 𝑉. An equivalence relation 𝐸 is
virtually placid if disjoint generic extensions do not share any virtual 𝐸-classes which
are not represented in 𝑉. The following propositions encapsulate the basic properties
of the two classes of equivalence relations.
Proposition 3.3.3. Let 𝐸 be an analytic equivalence relation on a Polish space 𝑋. 𝐸
is virtually placid if and only if for any separately generic extensions 𝑉[𝐻0 ], 𝑉[𝐻1 ] such
that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 and 𝐸-related points 𝑥0 ∈ 𝑉[𝐻0 ] and 𝑥1 ∈ 𝑉[𝐻1 ], 𝑥0 and 𝑥1
are realizations of some virtual 𝐸-class in 𝑉.
Proof. The left-to-right implication is immediate from the definitions. For the
right-to-left implication, suppose that 𝑉[𝐻0 ] and 𝑉[𝐻1 ] are separately generic exten-
sions such that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 and ⟨𝑄, 𝜏0 ⟩ ∈ 𝑉[𝐻0 ] and ⟨𝑄1 , 𝜏1 ⟩ ∈ 𝑉[𝐻1 ] are
̄
𝐸-related pins. Let 𝐾0 ⊂ 𝑄0 and 𝐾1 ⊂ 𝑄1 be filters mutually generic over the model
𝑉[𝐻0 , 𝐻1 ] and let 𝑥0 = 𝜏0 /𝐾0 and 𝑥1 = 𝜏1 /𝐾1 . By the mutual genericity, 𝑉[𝐻0 ][𝐾0 ] ∩
𝑉[𝐻1 ][𝐾1 ] = 𝑉, and the assumption on 𝐸 gives that 𝑥0 , 𝑥1 are realizations of some vir-
̄
tual 𝐸-class from the ground model. It follows that both 𝐸-pins are 𝐸-related to some
𝐸-pin from 𝑉. □
Proposition 3.3.4. An analytic equivalence relation 𝐸 on a Polish space 𝑋 is placid
if and only if it is pinned and virtually placid.
Proof. The right-to-left implication is immediate. If 𝐸 is a pinned and virtually
placid equivalence relation and 𝑉[𝐻0 ], 𝑉[𝐻1 ] are separately generic extensions such
that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉, then any 𝐸-class represented in both must be represented as a
virtual class in 𝑉 by the virtual placid assumption, and this virtual class must be trivial
by the pinned assumption. This means that 𝐸 is placid. For the left-to-right implica-
tion, if 𝐸 is placid then it must be pinned because if 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic
extensions then 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 by the product forcing theorem. To show that 𝐸
must be virtually placid, suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are separately generic extensions.
By Proposition 3.3.3, it is enough to verify that every 𝐸-class represented in both ex-
tensions is a realization of some virtual 𝐸-class in 𝑉. However, the placid assumption
even implies that it is a realization of a trivial virtual 𝐸-class in 𝑉. □
A good example of an equivalence relation which is virtually placid but not placid is
𝔽2 . It is not placid since it is not pinned.
The following ergodicity theorem is a great generalization of the ergodicity theo-
rems of Hjorth and Kechris [59, Theorem 12.5], and it is the main motivation behind
the definition of placid and virtually placid classes of equivalence relations.
Theorem 3.3.5. Suppose that a Polish group Γ acts continuously and in a generically
turbulent way on a Polish space 𝑋 such that the resulting orbit equivalence relation 𝐸 is
analytic, with all orbits dense. Suppose that 𝐹 is a virtually placid equivalence relation
on a Polish space 𝑌 . Suppose that ℎ ∶ 𝑋 → 𝑌 is a homomorphism of 𝐸 to 𝐹. Then there
is a comeager set 𝐵 ⊂ 𝑋 which is mapped into a single 𝐹-class.
Proof. Let 𝛾 ∈ Γ, 𝑥 ∈ 𝑋 be a mutually generic pair of points for the posets 𝑃Γ and
𝑃𝑋 . Theorem 3.2.2 implies the instrumental equality: 𝑉[𝑥]∩𝑉[𝛾⋅𝑥] = 𝑉. Since 𝑥 𝐸 𝛾⋅𝑥
holds, it must be the case that ℎ(𝑥) 𝐹 ℎ(𝛾 ⋅ 𝑥) must hold. By the virtual placidity of the
equivalence relation 𝐹, it must be the case that ℎ(𝑥) is a realization of a ground model
virtual 𝐹-class. However, the poset 𝑃𝑋 is countable, so all virtual classes realized in its
extension are already represented in the ground model by Theorem 2.6.2. Thus, there
must be a point 𝑦 ∈ 𝑌 ∩ 𝑉 such that ℎ(𝑥) 𝐹 𝑦. Since the generic point 𝑥 ∈ 𝑋 avoids all
ground model coded meager sets, it must be the case that the set 𝐵 = ℎ−1 ([𝑦]𝐸 ) ⊂ 𝑋 is
nonmeager. Since this is an analytic set which is invariant under the continuous group
action all of whose orbits are dense, it follows that the set 𝐵 is comeager. □
3.4. Examples and operations

The extent of the classes of placid and virtually placid equivalence relations is best
explored using the following closure theorems.
80 3. TURBULENCE
Theorem 3.4.1. The class of placid equivalence relations is closed under the follow-
ing operations:
(1) Borel almost reduction;
(2) countable product;
(3) countable increasing union;
(4) countable factor;
The class of virtually placid equivalence relations is closed under the same operations and
the Friedman–Stanley jump.
Proof. In view of Proposition 3.3.4, it is enough to show the closure of virtual

placidity under these operations, since the class of pinned equivalence relations is
closed under (1–4) by the work of Chapter 2. For virtual placidity, we will prove (1)
and the closure under the Friedman–Stanley jump.
For (1), suppose that 𝐸, 𝐹 are analytic equivalence relations on Polish spaces 𝑋, 𝑌
and ℎ ∶ 𝑋 → 𝑌 is a Borel function which is a reduction of 𝐸 to 𝑌 everywhere except
for a set 𝑍 ⊂ 𝑋 consisting of countably many 𝐸-classes. Suppose that 𝐹 is virtually
placid and work towards the conclusion that 𝐸 is virtually placid. Let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be
generic extensions such that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 and let 𝑥0 ∈ 𝑉[𝐻0 ] and 𝑥1 ∈ 𝑉[𝐻1 ]
be 𝐸-related points in 𝑋; we need to show that they are realizations of some virtual 𝐸-
class in 𝑉. If 𝑥0 ∈ 𝑍 then this certainly occurs as 𝑉 contains a countable set of points
whose 𝐸-classes cover 𝑍, and this feature of the countable set persists to 𝑉[𝐻0 ] by a
Shoenfield absoluteness argument. If 𝑥0 ∉ 𝑍 then 𝑥1 ∉ 𝑍; look at the points ℎ(𝑥0 ) ∈
𝑉[𝐻0 ] and ℎ(𝑥1 ) ∈ 𝑉[𝐻1 ]. These are 𝐹-related points; since 𝐹 is placid they realize
some virtual 𝐹-class represented by some 𝐹-pin ⟨𝑄, 𝜎⟩. By a Shoenfield absoluteness
argument, 𝑄 ⊩ ∃𝑥 ∈ 𝑋 ⧵ 𝑍 ℎ(𝑥) 𝐸 𝜎; let 𝜏 be a 𝑄-name for such a point 𝑥 ∈ 𝑋. It is
not difficult to see that ⟨𝑄, 𝜏⟩ is an 𝐸-pin and 𝑥0 , 𝑥1 realize the virtual class of ⟨𝑄, 𝜎⟩.
For the Friedman–Stanley jump, suppose that 𝐸 is a virtually placid equivalence
relation on a Polish space 𝑋, 𝑉[𝐻0 ] and 𝑉[𝐻1 ] are separately generic extensions of 𝑉
such that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 and 𝑦0 , 𝑦1 ∈ 𝑋 𝜔 are elements in the respective models
such that [rng(𝑦0 )]𝐸 = [rng(𝑦1 )]𝐸 . Since 𝐸 is virtually placid, every element of rng(𝑦0 )
is a realization of a virtual 𝐸-class from 𝑉. Let 𝐵 be the set of all virtual 𝐸-classes in 𝑉
which have realizations in rng(𝑦0 ). Since 𝐵 is also the set of all virtual 𝐸-classes in 𝑉
which have realizations in rng(𝑦1 ), it is clear that 𝐵 ∈ 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉. Thus, the
points 𝑦0 , 𝑦1 ∈ 𝑋 𝜔 are realizations of the virtual 𝐸 + -class represented by the set 𝐵. By
Proposition 3.3.3, we conclude that 𝐸 + is virtually placid. □
Theorem 3.4.2. Suppose that Γ is a Polish group continuously acting on a Polish

space 𝑋 and 𝐸 is the resulting orbit equivalence relation. The following are equivalent:
(1) 𝐸 is virtually placid;
(2) for every Borel set 𝐵 ⊂ 𝑋 such that 𝐸 ↾ 𝐵 is Borel, 𝐸 ↾ 𝐵 is virtually placid.
Proof. (1) immediately implies (2) since 𝐸 ↾ 𝐵 is reducible to 𝐸 by the identity

map on 𝐵. Now suppose that (1) fails, and let 𝑃 be a poset and 𝜏 be a name for an
element of 𝑋 such that 𝑃 × 𝑃 ⊩ 𝜏left 𝐸 𝜏right fails, and let 𝑄 be a poset with names 𝐻̇ 0 ,
𝐻̇ 1 for filters generic over the ground model such that 𝑄 ⊩ 𝑉[𝐻̇ 0 ] ∩ 𝑉[𝐻̇ 1 ] = 𝑉 and
𝜏/𝐻̇ 0 = 𝜏/𝐻̇ 1 .
Let 𝑀 be a countable elementary submodel of a large structure containing all ob-

jects mentioned so far. Let 𝑀̄ be the transitive collapse of 𝑀, and 𝑃,̄ 𝑄̄ etc. be the im-
ages of 𝑃, 𝑄 etc. under the transitive collapse map. By Proposition 3.5.5, 𝑄̄ ⊩ 𝑉[𝐻̄ 0 ] ∩
𝑉[𝐻̄ 1 ] = 𝑉 holds even in 𝑉 (as opposed to 𝑀). ̄ Let 𝐵 = {𝑥 ∈ 𝑋 ∶ ∃𝐻 ⊂ 𝑃 ̄ generic
over 𝑀̄ such that 𝑥 = 𝜏/𝐻}.
̄ We have just proved that 𝐸 ↾ 𝐵 is not virtually placid.
The proof is completed by a reference to Corollary 2.8.8–the set 𝐵 ⊂ 𝑋 is Borel and the
equivalence relation 𝐸 ↾ 𝐵 is Borel as well. □
The theorem allows the transfer of the virtual placid property from Borel fragments
of a given orbit equivalence relation to the whole equivalence relation. Consider the
following attractive corollary:
Corollary 3.4.3. Every equivalence relation classifiable by countable structures is
virtually placid.
Proof. In view of Theorem 3.4.1(1), it is only necessary to show that every or-
bit equivalence relation 𝐸 obtained from an action of 𝑆∞ is virtually placid. By Theo-
rem 3.4.2, it is only necessary to show that all Borel fragments of 𝐸 are virtually placid.
To this end, consider the transfinite sequence ⟨𝔽𝛼 ∶ 𝛼 ∈ 𝜔1 ⟩ obtained from 𝔽1 =identity
on 2𝜔 by repeated application of Friedman–Stanley jump, at limit stages taking disjoint
unions. It is well-known [54, Theorem 12.5.2] that every Borel equivalence relation
classifiable by countable structures is Borel reducible to 𝔽𝛼 for some countable ordinal
𝛼. Theorem 3.4.1 iterated transfinitely shows that each 𝔽𝛼 is virtually placid. Thus,
every Borel fragment of 𝐸 is virtually placid, and so is 𝐸. □
There are many Borel placid equivalence relations which cannot be obtained from
the identity by repeated application of the operations indicated in Theorem 3.4.1. The
following examples deal with equivalence relations associated with ideals on countable
sets. If 𝑎 is a countable set and 𝐽 is an ideal on 𝑎, write =𝐽 for the equivalence relation
on the space 𝑋 = (2𝜔 )𝑎 connecting points 𝑥0 , 𝑥1 if the set {𝑛 ∈ 𝑎 ∶ 𝑥0 (𝑛) ≠ 𝑥1 (𝑛)}
belongs to 𝐽.
Example 3.4.4. Let 𝑎 = 2<𝜔 and let 𝐽 be the branch ideal: the ideal generated by
the subsets of 𝑎 linearly ordered by inclusion. The equivalence relation =𝐽 is placid.
<𝜔
Proof. Write 𝑋 = (2𝜔 )2 . For every node 𝑡 ∈ 𝜔<𝜔 write [𝑡] for the set of all nodes
in 2<𝜔 extending 𝑡. Let 𝑉[𝐺0 ], 𝑉[𝐺1 ] be two generic extensions containing respective
=𝐽 -related points 𝑥0 , 𝑥1 ∈ 𝑋. Assume that 𝑉[𝐺0 ] ∩ 𝑉[𝐺1 ] = 𝑉 and work to find a
ground model point 𝑥 ∈ 𝑋 which is =𝐽 -related to both 𝑥0 , 𝑥1 .
Let 𝑇 = {𝑡 ∈ 2<𝜔 ∶ 𝑥0 ↾ [𝑡] is not =𝐽 -equivalent to any point in the ground model}.
This is a subtree of 𝜔<𝜔 . If 0 ∉ 𝑇 then the proof is complete; thus, it is only necessary
to derive a contradiction from the assumption 0 ∈ 𝑇. First, observe that the tree 𝑇
cannot have any terminal nodes: if 𝑡 were a terminal node of 𝑇 then one could combine
the ground model witnesses for 𝑡⌢ 0 ∉ 𝑇 and 𝑡⌢ 1 ∉ 𝑇 to find a witness for 𝑡 ∉ 𝑇.
Second, observe that the definition of the tree 𝑇 depends only on the =𝐽 -class of 𝑥0 , so
𝑇 ∈ 𝑉[𝐺0 ] ∩ 𝑉[𝐺1 ] = 𝑉. Since 𝑇 is a nonempty ground model tree without endnodes,
it must have an infinite branch 𝑦 ∈ 2𝜔 in the ground model. Since 𝑥0 =𝐽 𝑥1 , there
is a number 𝑛 ∈ 𝜔 such that for every 𝑡 ∈ 2<𝜔 such that 𝑥0 (𝑡) ≠ 𝑥1 (𝑡), either 𝑡 is
incompatible with 𝑦 ↾ 𝑛 or else 𝑡 is an initial segment of 𝑦. Let 𝑒 = [𝑦 ↾ 𝑛] ⧵ {𝑦 ↾
𝑚 ∶ 𝑚 ≥ 𝑛} and observe that 𝑒 ∈ 𝑉 and 𝑥0 and 𝑥1 coincide on 𝑒, therefore 𝑥0 ↾ 𝑒 ∈ 𝑉.
82 3. TURBULENCE
If 𝑧 ∈ 𝑉 is any function in 2[𝑦↾𝑛] extending 𝑥0 ↾ 𝑒, then 𝑧 =𝐽 𝑥0 ↾ [𝑡], contradicting the

assumption that 𝑦 ↾ 𝑛 ∈ 𝑇. □
A whole class of ideals with placid equivalence relations is isolated in the following
definition.
Definition 3.4.5. An ideal 𝐼 on 𝜔 is countably separated if there is a countable

collection 𝐴 of subsets of 𝜔 such that for every 𝑏 ∈ 𝐼 and 𝑐 ∉ 𝐼 there is 𝑎 ∈ 𝐴 such that
𝑏 ∩ 𝑎 = 0 and 𝑐 ∩ 𝑎 ∉ 𝐼.
Countably separated ideals include for example the ideal of nowhere dense subsets of
the rationals; a characterization theorem is proved in [70]. Note that if 𝐼 is analytic then
the instrumental property of the set 𝐴 is coanalytic, and by Mostowski absoluteness it
will hold in all forcing extensions.
Theorem 3.4.6. The equivalence relation =𝐼 is placid for every countably separated
Borel ideal 𝐼 on 𝜔.
Proof. Let {𝑎𝑛 ∶ 𝑛 ∈ 𝜔} be a countable collection of subsets of 𝜔 witnessing the

countable separation of the ideal 𝐼. Write 𝑋 = (2𝜔 )𝜔 . Let 𝑉[𝐺0 ], 𝑉[𝐺1 ] be generic ex-
tensions containing respective =𝐼 -related points 𝑥0 , 𝑥1 ∈ 𝑋. Assume 𝑉[𝐺0 ] ∩ 𝑉[𝐺1 ] =
𝑉 and work to find a ground model point 𝑥 ∈ 𝑋 which is =𝐼 -related to both 𝑥0 , 𝑥1 .
Consider the set 𝑏 = {𝑛 ∈ 𝜔 ∶ 𝑥0 ↾ 𝑎𝑛 is 𝐼-equivalent to some element of the
ground model}. The definition of the set 𝑏 depends only on the =𝐼 -equivalence class of
𝑥0 , therefore the set 𝑏 belongs to both 𝑉[𝐺0 ] and 𝑉[𝐺1 ], and by the initial assumptions,
to 𝑉. Let 𝑓 be the map with domain 𝑏 which to each 𝑛 ∈ 𝑏 identifies the =𝐼 -class in
𝑉 which contains 𝑥0 ↾ 𝑎𝑛 . Again, the definition of 𝑓 depends only on the =𝐼 -class of
𝑥0 , so 𝑓 ∈ 𝑉[𝐺0 ] and 𝑓 ∈ 𝑉[𝐺1 ], therefore 𝑓 ∈ 𝑉. By the Mostowski absoluteness
between 𝑉 and 𝑉[𝐺0 ], there is a point 𝑥 ∈ 𝑋 such that for all 𝑛 ∈ 𝑏, 𝑥 ↾ 𝑎𝑛 ∈ 𝑓(𝑛). We
will show that 𝑥 =𝐼 𝑥0 holds.
Suppose towards a contradiction that this fails. Consider the set 𝑐 = {𝑖 ∈ 𝜔 ∶ 𝑥(𝑖) ≠
𝑥0 (𝑖)} ∉ 𝐼 and the set 𝑑 = {𝑖 ∈ 𝜔 ∶ 𝑥0 (𝑖) ≠ 𝑥1 (𝑖)} ∈ 𝐼. By the countable separation of
the ideal 𝐼, there must be a number 𝑛 ∈ 𝜔 such that 𝑐∩𝑎𝑛 ∉ 𝐼 and 𝑑∩𝑎𝑛 = 0. However,
the latter equality shows that 𝑥0 ↾ 𝑎𝑛 = 𝑥1 ↾ 𝑎𝑛 , so 𝑥0 ↾ 𝑎𝑛 ∈ 𝑉 and 𝑛 ∈ 𝑏. But then
{𝑖 ∈ 𝑎𝑛 ∶ 𝑥(𝑖) ≠ 𝑥0 (𝑖)} ∈ 𝐼 by the choice of the point 𝑥. This contradicts the fact that
𝑐 ∩ 𝑎𝑛 ∉ 𝐼. The proof of the theorem is complete. □
There is a natural operation on analytic ideals which seeks a countably separated clo-
sure. For the discussion below, let {𝑎𝑛 ∶ 𝑛 ∈ 𝜔} be a fixed countable collection of
subsets of 𝜔.
Definition 3.4.7. Let 𝐼 be an ideal on 𝜔. 𝐼 + is the ideal on 𝜔 consisting of all sets

𝑏 ⊂ 𝜔 such that there is 𝑐 ∈ 𝐼 such that ∀𝑛 ∈ 𝜔 𝑏 ∩ 𝑎𝑛 ∉ 𝐼 → 𝑐 ∩ 𝑎𝑛 ≠ 0.
We will start with some simple observations. It is clear that 𝐼 + is an ideal containing 𝐼 as
a subset. If 𝐼 is analytic, then so is 𝐼 + . Moreover, 𝐼 is separated by the sequence {𝑎𝑛 ∶ 𝑛 ∈
𝜔} just in case 𝐼 = 𝐼 + . We will show that under suitable additional assumption, the
jump preserves placidity of the equivalence relation =𝐼 .
Definition 3.4.8. Let 𝐼 be an ideal on 𝜔. 𝐼 is skew if for every set 𝑐 ⊂ 𝜔 there is a

subset 𝑐′ ⊂ 𝑐 such that for every finite set 𝑑 ⊂ 𝜔, if 𝑐∩⋂𝑛∈𝑑 𝑎𝑛 ∉ 𝐼 then 𝑐′ ∩⋂𝑛∈𝑑 𝑎𝑛 ∉ 𝐼
and if 𝑐 ∩ ⋂𝑛∈𝑑 𝑎𝑛 ∈ 𝐼 then 𝑐′ ∩ ⋂𝑛∈𝑑 𝑎𝑛 is finite.
It is not dificult to see that every 𝐹𝜍 ideal is skew and every analytic P-ideal is skew.
Theorem 3.4.9. If 𝐼 is a skew analytic ideal on 𝜔 then 𝐼 + is a skew analytic ideal as

well. If in addition the equivalence relation =𝐼 is placid then the equivalence relation =𝐼 +
is placid as well.
Proof. For the first sentence, if 𝑐 ⊂ 𝜔 is a set and 𝑐′ ⊂ 𝑐 witnesses the skew prop-
erty for 𝐼 and 𝑐, then 𝑐′ also witnesses the skew property for 𝐼 + and 𝑐. The proof of the
second sentence is more involved. Write 𝑋 = (2𝜔 )𝜔 . Let 𝑉[𝐺0 ], 𝑉[𝐺1 ] be generic exten-
sions containing respective =𝐼 + -related points 𝑥0 , 𝑥1 ∈ 𝑋. Assume 𝑉[𝐺0 ] ∩ 𝑉[𝐺1 ] = 𝑉
and work to find a ground model point 𝑥 ∈ 𝑋 which is =𝐼 + -related to both 𝑥0 , 𝑥1 .
Consider the set 𝑏 = {𝑛 ∈ 𝜔 ∶ 𝑥0 ↾ 𝑎𝑛 is 𝐼 + -equivalent to some element of the
ground model}. The definition of the set 𝑏 depends only on the =𝐼 + -equivalence class of
𝑥0 , therefore the set 𝑏 belongs to both 𝑉[𝐺0 ] and 𝑉[𝐺1 ], and by the initial assumptions,
to 𝑉. Let 𝑓 be the map with domain 𝑏 which to each 𝑛 ∈ 𝑏 identifies the =𝐼 + -class in
𝑉 which contains 𝑥0 ↾ 𝑎𝑛 . Again, the definition of 𝑓 depends only on the =𝐼 + -class
of 𝑥0 , so 𝑓 ∈ 𝑉[𝐺0 ] and 𝑓 ∈ 𝑉[𝐺1 ], therefore 𝑓 ∈ 𝑉. By the Mostowski absoluteness
between 𝑉 and 𝑉[𝐺0 ], there is a point 𝑥 ∈ 𝑋 such that for all 𝑛 ∈ 𝑏, 𝑥 ↾ 𝑎𝑛 ∈ 𝑓(𝑛). We
will show that 𝑥 =𝐼 + 𝑥0 holds.
Suppose towards a contradiction that this fails. Consider the set 𝑐 = {𝑖 ∈ 𝜔 ∶ 𝑥(𝑖) ≠
𝑥0 (𝑖)} ∉ 𝐼 + and the set 𝑑 = {𝑖 ∈ 𝜔 ∶ 𝑥0 (𝑖) ≠ 𝑥1 (𝑖)} ∈ 𝐼 + . It is now time to use the skew
assumption on the ideal 𝐼. Find a set 𝑐′ ⊂ 𝑐 witnessing the skew property of 𝐼 + . Use
the definition of the jump to find a set 𝑒 ∈ 𝐼 such that for all 𝑛 ∈ 𝜔, 𝑑 ∩ 𝑎𝑛 ∉ 𝐼 implies
𝑒 ∩ 𝑎𝑛 ≠ 0. Since the set 𝑐′ is positive in the jump, there must be a number 𝑛 ∈ 𝜔
such that 𝑐′ ∩ 𝑎𝑛 ∉ 𝐼 and 𝑒 ∩ 𝑎𝑛 = 0. The choice of the set 𝑐′ shows that 𝑐′ ∩ 𝑎𝑛 is
in fact 𝐼 + -positive. The choice of the set 𝑒 shows that 𝑑 ∩ 𝑎𝑛 ∈ 𝐼. This means that
𝑥0 ↾ 𝑎𝑛 =𝐼 𝑥1 ↾ 𝑎𝑛 , and by the placid assumption on the equivalence relation =𝐼 ,
𝑛 ∈ 𝑏 must hold. This stands in contradiction with the fact that 𝑐′ ∩ 𝑎𝑛 , so 𝑐 ∩ 𝑎𝑛 is
𝐼 + -positive. The proof of the theorem is complete. □
Example 3.4.10. Let 𝐼 be the branch ideal on 2𝜔 , and let {𝑎𝑛 ∶ 𝑛 ∈ 𝜔} be an enu-
meration of the basic open subsets of 2<𝜔 . The ideal 𝐼 is skew. One can start iterating
the jump for countable ordinals 𝛼, at limit stages taking unions. The resulting ideals
consist of subsets of 𝜔<𝜔 whose closure in 2𝜔 is countable with Cantor–Bendixson rank
≤ 𝛼. All the resulting equivalence relations are placid.
3.5. Absoluteness
The placid and virtually placid classes of equivalence relations are defined in such
a way that it is not clear whether the membership in them is absolute, and what the
actual complexity is. This section provides a satisfactory resolution to these questions.
To reach the absoluteness result, one has to perform a computation of intersections
of forcing extensions of independent interest. The computation starts with several def-
initions, below.
84 3. TURBULENCE
Definition 3.5.1. Let 𝐵 be a Boolean algebra. A subalgebra 𝐴 ⊂ 𝐵 is projective if

the projection function 𝜋 ∶ 𝐵 → 𝐴, assigning to each 𝑏 ∈ 𝐵 the smallest element of 𝐴
which is ≥ 𝑏, is defined for every 𝑏.
A good example of a projection is any complete subalgebra of a complete Boolean al-

gebra. The point of the current definition is that the property of being projective is first
order in 𝐴, 𝐵, so (unlike completeness) transfers from model to model without damage.
Note that if 𝐴 ⊂ 𝐵 is a projective subalgebra, then every maximal antichain of 𝐴 is also
a maximal antichain of 𝐵; therefore, the intersection of a generic filter on 𝐵 with 𝐴 will
be a generic filter on 𝐴. To see this, let 𝐷 ⊂ 𝐴 be a maximal antichain of 𝐴 and 𝑏 ∈ 𝐵
be a condition. Let 𝑑 ∈ 𝐷 be an element of 𝐴 compatible with 𝜋(𝑏). Then 𝜋(𝑏) − 𝑑 ∈ 𝐴
is strictly smaller element of 𝐴 than 𝜋(𝑏), so 𝜋(𝑏) − 𝑑 ≱ 𝑏 holds. This means that 𝑑 and
𝑏 must be compatible.
Definition 3.5.2. Let 𝐵 be a Boolean algebra and 𝐴0 , 𝐴1 ⊂ 𝐵 be projective subal-

gebras with projection functions 𝜋0 , 𝜋1 .
(1) The projection sequence starting at 𝑏 ∈ 𝐵 is the sequence ⟨𝑏𝑛 ∶ 𝑛 ∈ 𝜔⟩ defined
by 𝑏0 = 𝑏, 𝑏2𝑛+1 = 𝜋0 (𝑏2𝑛 ) and 𝑏2𝑛+2 = 𝜋1 (𝑏2𝑛+1 );
(2) the pair {𝐴0 , 𝐴1 } is projective if for each 𝑏 ∈ 𝐵, the supremum of the projection
sequence starting at 𝑏 exists in 𝐵 and belongs to 𝐴0 ∩ 𝐴1 .
Again, a good example of a projective pair is a pair of complete subalgebras of a com-

plete Boolean algebra. The notion of a projective pair is no longer a first order statement
about 𝐴0 , 𝐴1 , 𝐵, but it still transfers between 𝜔-models of ZFC without damage.
Proposition 3.5.3. Let 𝐵 be a Boolean algebra and {𝐴0 , 𝐴1 } be a projective pair of

subalgebras. Then
(1) 𝐴0 ∩ 𝐴1 ⊂ 𝐵 is a projective subalgebra of 𝐵;
(2) if 𝜏0 , 𝜏1 are 𝐴0 - and 𝐴1 -names for sets of ordinals and 𝐵 ⊩ 𝜏0 = 𝜏1 , then there
is a 𝐴0 ∩ 𝐴1 -name 𝜏2 such that 𝐵 ⊩ 𝜏0 = 𝜏1 = 𝜏2 .
Proof. Let 𝜋0 , 𝜋1 be the projections of 𝐵 to 𝐴0 , 𝐴1 . Let 𝜋 ∶ 𝐵 → 𝐴0 ∩ 𝐴1 be the

function which assigns to each 𝑏 ∈ 𝐵 the supremum of the projection sequence starting
from 𝑏. It is clear from the definitions that 𝜋(𝑏) is the smallest element of 𝐴0 ∩𝐴1 above
𝑏 and (1) follows.
For (2), first note that for every 𝑏 ∈ 𝐵 and every ordinal 𝛼, 𝑏 ⊩ 𝛼̌ ∈ 𝜏0 just in case
𝜋(𝑏) ⊩ 𝛼̌ ∈ 𝜏. To see this, by induction on 𝑛 ∈ 𝜔 argue that 𝑏𝑛 ⊩ 𝛼̌ ∈ 𝜏0 . If this
holds for 𝑛 = 2𝑘, then use the fact that 𝜏0 is an 𝐴0 -name, so 𝑏𝑛+1 = 𝜋0 (𝑏𝑛 ) must force
𝛼̌ ∈ 𝜏; if this holds for 𝑛 = 2𝑘 + 1, then use the fact that 𝜏1 is an 𝐴1 -name forced to be
equal to 𝜏0 , so 𝑏𝑛+1 = 𝜋1 (𝑏𝑛 ) must force 𝛼̌ ∈ 𝜏. It follows that 𝑏 ⊩ 𝛼̌ ∈ 𝜏 just in case
𝜋(𝑏) ⊩ 𝛼̌ ∈ 𝜏, so one can let ⟨𝜋(𝑏), 𝛼⟩̌ ∈ 𝜏2 if 𝑏 ⊩ 𝛼̌ ∈ 𝜏0 . □
The above notions have the slightly unpleasant feature that they do not necessarily
survive localization well, so an additional local definition is needed.
Definition 3.5.4. Let 𝐵 be a Boolean algebra and {𝐴0 , 𝐴1 } be a pair of subalgebras.

The pair is locally projective if for every nonzero element 𝑏 ∈ 𝐵, in the algebra 𝐵 ↾ 𝑏 the
subalgebras 𝐴0 ↾ 𝑏 = {𝑏 ∧ 𝑎 ∶ 𝑎 ∈ 𝐴0 } and 𝐴1 ↾ 𝑏 = {𝑏 ∧ 𝑎 ∶ 𝑎 ∈ 𝐴1 } form a projective
pair.
The following is the central motivation of the notion of a projective pair of subalgebras:
Proposition 3.5.5. Let 𝐵 be a Boolean algebra and 𝐴0 , 𝐴1 be a locally projective
pair of subalgebras. The following are equivalent:
(1) 𝐵 ⊩ 𝑉[𝐺̇ ∩ 𝐴0 ] ∩ 𝑉[𝐺̇ ∩ 𝐴1 ] = 𝑉;
(2) for every 𝑏 ∈ 𝐵, the intersection algebra 𝐴0 ↾ 𝑏 ∩ 𝐴1 ↾ 𝑏 has an atom.
Proof. Suppose that (2) fails for some 𝑏 ∈ 𝐵. Write 𝐶 = 𝐴0 ↾ 𝑏 ∩ 𝐴1 ↾ 𝑏 and use
Proposition 3.5.3 to argue that 𝐶 is a projective subalgebra of 𝐵 ↾ 𝑏, so 𝑏 ⊩ 𝐺̇ ∩ 𝐶 ̌ is a
𝐶-generic filter, and since 𝐶 is nonatomic, 𝐺̇ ∩ 𝐶 ̌ ∉ 𝑉. At the same time, 𝐺̇ ∩ 𝐶 ̌ belongs
to 𝑉[𝐺̇ ∩ 𝐴0 ] ∩ 𝑉[𝐺̇ ∩ 𝐴1 ], so (1) fails.
Suppose now that (2) holds. Suppose that 𝜏0 , 𝜏1 are 𝐴0 - and 𝐴1 -names for sets of
ordinals and some condition 𝑏 ∈ 𝐵 forces 𝜏0 = 𝜏1 . Write 𝐶 = 𝐴0 ↾ 𝑏 ∩ 𝐴1 ↾ 𝑏 and let 𝑐
be an atom of 𝐶. To verify (1), it is enough to argue that 𝑐 decides the membership of
any given ordinal in 𝜏0 . However, this follows immediately from Proposition 3.5.3 (2)
applied below 𝑏. □
Finally, we are in a position to give a succinct and principled proof of the main abso-
luteness result of this section.
Theorem 3.5.6. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. The state-
ment “𝐸 is virtually placid” is absolute among transitive models of set theory containing
the code for 𝐸.
Proof. We will show that the statement “𝐸 is not virtually placid” is in ZFC equiv-
alent to the statement “there is a countable 𝜔-model 𝑀 of a large fragment of ZFC
containing the code for 𝐸 such that 𝑀 ⊧ 𝐸 is not virtually placid”. This is an analytic
statement; therefore, it is absolute among transitive models of set theory.
Now, the left-to-right implication is immediate: one just needs to take a countable
elementary submodel of a large enough structure to get the requisite 𝑀. The right-to-
left direction is more interesting. Suppose that 𝑀 is a countable 𝜔-model containing
the code for 𝐸 which satisfies that 𝐸 is not virtually placid. Working in the model 𝑀,
there must be complete algebra 𝐵, complete subalgebras 𝐴0 , 𝐴1 ⊂ 𝐵, and respective
𝐴0 , 𝐴1 -names 𝜏0 , 𝜏1 for elements of the underlying space 𝑋 such that first, 𝐵 × 𝐵 ⊩
¬(𝜏0 )left 𝐸 (𝜏0 )right , and second, 𝐵 ⊩ 𝑉[𝐺̇ ∩ 𝐴0 ] ∩ 𝑉[𝐺̇ ∩ 𝐴1 ] = 𝑉 and 𝜏0 𝐸 𝜏1 . The
subalgebras 𝐴0 , 𝐴1 ⊂ 𝐵 form a locally projective pair in 𝑀 since they are complete. By
Proposition 3.5.5 applied in 𝑀 in the (1)→(2) direction, for every 𝑏 ∈ 𝐵, the algebra
𝐴0 ↾ 𝑏 ∩ 𝐴1 ↾ 𝑏 has an atom. Stepping out of the model 𝑀, we see that the pair 𝐴0 , 𝐴1 ⊂
𝐵 is a projective pair and for every 𝑏 ∈ 𝐵, the algebra 𝐴0 ↾ 𝑏 ∩ 𝐴1 ↾ 𝑏 has an atom. By
Proposition 3.5.5 applied in the (2)→(1) direction, 𝐵 ⊩ 𝑉[𝐺̇ ∩ 𝐴0 ] ∩ 𝑉[𝐺̇ ∩ 𝐴1 ] = 𝑉
holds. Moreover, 𝐵 ⊩ 𝜏0 𝐸 𝜏1 , and 𝐵 × 𝐵 ⊩ ¬(𝜏0 )left 𝐸 (𝜏0 )right , since 𝐸 is absolute
between generic extensions of 𝑉 and generic extensions of 𝑀 by Borel absoluteness. In
conclusion, 𝐸 is not virtually placid in 𝑉. □
Corollary 3.5.7. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. The
statement “𝐸 is placid” is absolute among transitive models of set theory containing the
code for 𝐸.
Proof. The placidity of 𝐸 is a conjunction of virtual placidity and the pinned prop-
erty of 𝐸 by Proposition 3.3.4. The conjuncts are absolute by Theorem 3.5.6 and 2.7.1,
and so is the conjunction. □
86 3. TURBULENCE
3.6. A variation for measure

The purpose of this section is to introduce a parallel for turbulence for measure,
with attendant ergodicity results for measure. Curiously enough, the measure theo-
retic parallel for turbulence is intimately connected to the concentration of measure
phenomenon. The following definition is close to the whirly actions of [38]:
Definition 3.6.1. Let 𝑋 be a Polish space with a Borel probability measure 𝜇 and
a metric 𝑑. Let Γ be a Polish group acting on 𝑋 in a measure preserving and distance
preserving fashion. We say that the action has concentration of measure if for every
open neighborhood 𝑈 ⊂ Γ containing the unit and every 𝜀 > 0 there is 𝛿 > 0 such that
for every 𝑑-ball 𝐵 ⊂ 𝑋 of radius < 𝛿 and every Borel set 𝐶 ⊂ 𝐵 of relative 𝜇-mass > 𝜀,
the set (𝑈 ⋅ 𝐶) ∩ 𝐵 has relative 𝜇-mass > 1/2.
To formulate the main results of this section, let 𝑃Γ be the Cohen forcing on Γ and 𝑃𝜇
be the random forcing with 𝜇, i.e. the forcing with 𝜇-positive Borel subset of 𝑋, ordered
by inclusion. The poset 𝑃Γ adds a generic point 𝛾𝑔𝑒𝑛 ̇ ∈ Γ while the poset 𝑃𝜇 adds a
random point 𝑥𝑔𝑒𝑛
̇ ∈ 𝑋.
Theorem 3.6.2. Suppose that Γ is a Polish group acting on a Polish space 𝑋 with a
Borel probability measure 𝜇 and an ultrametric 𝑑 in a measure preserving and distance
preserving fashion. Suppose that the action has concentration of measure. Then 𝑃Γ ×𝑃𝜇 ⊩
𝑉[𝑥𝑔𝑒𝑛
̇ ] = 𝑉.
The proof of Theorem 3.6.2 hinges on a new walk concept and a proposition.
Definition 3.6.3. Let 𝑈 ⊂ Γ be an open neighborhood of the unit and 𝛿 > 0.
A 𝑈, 𝛿-walk is a sequence ⟨𝑥𝑖 ∶ 𝑖 ≤ 𝑗⟩ of points in 𝑋 such that for every 𝑖 ∈ 𝑗, either
𝑑(𝑥𝑖 , 𝑥𝑖+1 ) < 𝛿 or there is 𝛾 ∈ 𝑈 such that 𝛾 ⋅ 𝑥𝑖 = 𝑥𝑖+1 .
Definition 3.6.4. Let 𝑈 ⊂ Γ be an open neighborhood of the unit and 𝐷 ⊂ 𝑋 be
a closed set. We say that the set 𝐷 is 𝑈-connected if for any two points 𝑥0 , 𝑥1 ∈ 𝐷 and
any 𝛿 > 0 there is a 𝑈, 𝛿-walk from 𝑥0 to 𝑥1 using only points from 𝐷.
The main import of the concentration of measure assumption is that for any open
neighborhood 𝑈 of the unit, closed 𝑈-connected 𝜇-positive sets can be found under
every stone.
Proposition 3.6.5. Suppose that the action of Γ has concentration of measure and
𝑑 is an ultrametric. Then for every open neighborhood 𝑈 ⊂ Γ of the unit and every 𝜇-
positive Borel set 𝐶 ⊂ 𝑋 there is a 𝜇-positive 𝑈-connected compact set 𝐷 ⊂ 𝐶.
Proof. We will first fix useful terminology. For a symmetric neighborhood 𝑉 ⊂ Γ
containing the unit and 𝑑-balls 𝐵0 , 𝐵1 ⊂ 𝑋 of the same radius we say that 𝐵0 is 𝑉-related
to 𝐵1 if there is an element 𝛾 ∈ 𝑉 such that 𝛾 ⋅ 𝐵0 = 𝐵1 . Since 𝑑 is an ultrametric, this
is equivalent to the statement that there is 𝛾 ∈ 𝑉 such that 𝛾 ⋅ 𝐵0 ∩ 𝐵1 ≠ 0. A set ℬ
consisting of 𝑑-balls of the same radius will be called 𝑉-connected if for any two balls
𝐵0 , 𝐵1 ∈ ℬ one can find a sequence of balls in ℬ which starts with 𝐵0 , ends in 𝐵1 , and
successive balls in it are 𝑉-related. Lastly, for Borel sets 𝐵, 𝐷 ⊂ 𝑋 write 𝜇𝐵 (𝐷) for the
𝜇(𝐵∩𝐷)
relative measure of 𝐷 in 𝐵, i.e. the ratio .
𝜇(𝐵)
Let 𝑈 ⊂ Γ be an open neighborhood of the unit, and let 𝐶 ⊂ 𝑋 be a Borel 𝜇-positive
set. Find a symmetric open neighborhood 𝑉 ⊂ Γ of the unit such that 𝑉 4 ⊂ 𝑈, and thin
3.6. A VARIATION FOR MEASURE 87
down 𝐶 if necessary to a compact 𝜇-positive set. Let 𝜀0 = 1/8 and for each 𝑛 ∈ 𝜔 let
𝜀𝑛+1 = 2−𝑛−2 𝜀𝑛 . Let 𝛿𝑛 > 0 be the numbers witnessing the concentration of measure
of the action for 𝑉 and 𝜀𝑛 . Thinning down 𝐶 if necessary, use the Lebesgue density
theorem to find a 𝑑-ball 𝐵ini of radius < 𝛿0 such that 𝐶 ⊂ 𝐵ini and 𝜇𝐵ini (𝐶) > 1/2.
By recursion on 𝑛 ∈ 𝜔 find finite families ℬ𝑛 of pairwise disjoint 𝑑-balls of radius
< 𝛿𝑛 such that for every number 𝑛 ∈ 𝜔 ℬ𝑛+1 refines ℬ𝑛 , and writing 𝑌 (𝐵) = {𝐴 ∈
ℬ𝑛+1 ∶ 𝐴 ⊂ 𝐵 for every ball 𝐵 ∈ ℬ𝑛 , the following hold:
• for every 𝐴 ∈ 𝑌 (𝐵), 𝜇𝐴 (𝐶) > 2𝑛+2 𝜀𝑛+1 ;
• 𝜇𝐵 (𝐶 ∩ ⋃ 𝑌 (𝐵)) > (1 − 2−𝑛 )𝜇𝐵 (𝐶).
• the set 𝑌 (𝐵) consists of balls of the same radius < 𝛿𝑛+1 and it is 𝑉 2 -connected.
To begin, set ℬ0 = {𝐵ini }. Now, suppose that ℬ𝑛 has been constructed and 𝐵 ∈ ℬ𝑛
is a ball; we shall show how to construct the set 𝑌 (𝐵) and therefore ℬ𝑛+1 . First, use
the compactness of the set 𝐶 to find a finite set 𝑌0 of 𝑑-balls (subsets of 𝐵) of the same
radius < 𝛿𝑛+1 such that 𝐶 ∩ 𝐵 ⊂ ⋃ 𝑌0 . Let 𝑌1 = {𝐴 ∈ 𝑌0 ∶ 𝜇𝐴 (𝐶) > 2𝑛+2 𝜀𝑛+1 }. Thus,
𝜇𝐵 (𝐶 ∩ ⋃(𝑌0 ⧵ 𝑌1 )) ≤ 2𝑛+2 𝜀𝑛+1 = 𝜀𝑛 .
Claim 3.6.6. There is a 𝑉 2 -connected component 𝑌2 ⊂ 𝑌1 such that 𝜇𝐵 (𝐶 ∩ ⋃(𝑌1 ⧵
𝑌2 )) < 𝜀𝑛 .
Proof. We first show that there is a 𝑉 2 -connected component 𝑌2 ⊂ 𝑌1 such that
𝜇𝐵 (𝐶 ∩ ⋃ 𝑌2 ) > 𝜀𝑛 . If this were not the case, it would be possible to divide 𝑌1 into
sets 𝑌 ′ and 𝑌 ″ which are both invariant under 𝑉 2 -connections, and 𝜇𝐵 (𝐶 ∩ ⋃ 𝑌 ′ ) and
𝜇𝐵 (𝐶 ∩ ⋃ 𝑌 ″ ) are both greater than 𝜀𝑛 . By the concentration of measure assumption,
the sets 𝑉 ⋅ (𝐶 ∩ ⋃ 𝑌 ′ ) and 𝑉 ⋅ (𝐶 ∩ ⋃ 𝑌 ″ ) are both of 𝜇𝐵 -mass greater than 1/2 and
therefore intersect. It follows that 𝑉 2 ⋅ (𝐶 ∩ ⋃ 𝑌 ′ ) ∩ (𝐶 ∩ ⋃ 𝑌 ″ ) ≠ 0, contradicting the
invariance of the sets 𝑌 ′ and 𝑌 ″ under 𝑉 2 -connections.
Now, the 𝑉 2 -connected component 𝑌2 found in the first paragraph must in fact be
such that 𝜇𝐵 (𝐶 ∩ ⋃(𝑌1 ⧵ 𝑌2 )) < 𝜀𝑛 , by an argument identical to the one in the previous
paragraph with 𝑌 ′ = 𝑌2 and 𝑌 ″ = 𝑌1 ⧵ 𝑌2 . This completes the proof of the claim. □
Letting 𝑌 (𝐵) = 𝑌2 completes the construction. The 𝑉 2 -connectedness is clear from the
choice of 𝑌2 , the first item is clear from the choice of 𝑌1 (𝐵), and the second item follows
from some arithmetic: 𝜇𝐵 (𝐶 ∩ ⋃(𝑌 ⧵ 𝑌2 )) < 2𝜀𝑛 = 2−𝑛 2𝑛+1 𝜀𝑛 ≤ 2−𝑛 𝜇𝐵 (𝐶).
Now, let 𝐷 = ⋂𝑛 ⋃ ℬ𝑛 . The set 𝐷 is closed as the 𝑑-balls in the sets ℬ𝑛 are clopen.
It is also a subset of 𝐶, because each of the balls in ℬ𝑛 has nonempty intersection with
𝐶, and 𝐶 is closed. The set 𝐷 also has positive 𝜇-mass; the mass distribution of 𝐷 is
governed by the following claim:
Claim 3.6.7. For every 𝑛 ≥ 2 and every ball 𝐵 ∈ ℬ𝑛 , 𝜇𝐵 (𝐷) > 𝜀𝑛 .
Proof. To get the set 𝐷 ∩ 𝐵, we subtracted from 𝐶 ∩ 𝐵 a set of cardinality at most
Σ𝑚>𝑛 2−𝑚 𝜇𝐵 (𝐶) by the second item above, so 𝜇𝐵 (𝐷) > 1/2𝜇𝐵 (𝐶) > 𝜀𝑛 by the first item
above. □
Towards the connectedness of the set 𝐷, consider the following claim:
Claim 3.6.8. Let 𝑚 ≤ 𝑛 be natural numbers, 𝐵 ∈ ℬ𝑚 a ball, and 𝑥0 , 𝑥1 ∈ 𝐵 ∩ 𝐷 be
any points. Then there is a 𝑈, 𝛿𝑛 -walk from 𝑥0 to 𝑥1 using only points in 𝐵 ∩ 𝐷.
Proof. This is proved by induction on 𝑛 − 𝑚, which is the reason for the convo-
luted statement of the claim. The case 𝑛 − 𝑚 = 0 is trivial since then 𝑑(𝑥0 , 𝑥1 ) < 𝛿𝑛 .
88 3. TURBULENCE
Now suppose that the statement is known for 𝑚 + 1 ≤ 𝑛 and proceed to show that it
is also true for 𝑚 ≤ 𝑛. Let 𝐵0 , 𝐵1 ∈ ℬ𝑚+1 be balls such that 𝑥0 ∈ 𝐵0 and 𝑥1 ∈ 𝐵1 . If
𝐵0 = 𝐵1 then the induction hypothesis immediately applies. Otherwise, by the third
item above, the set 𝑌 (𝐵) is 𝑉 2 -connected, so there must be a sequence of balls in 𝑌 (𝐵)
starting at 𝐵0 and ending at 𝐵1 such that successive balls are 𝑉 2 -connected. Suppose
for simplicity that this sequence has length 2–i.e. 𝐵0 and 𝐵1 are 𝑉 2 -connected. Fix an
element 𝛾 ∈ 𝑉 2 such that 𝛾 ⋅ 𝐵0 = 𝐵1 .
Since 𝜇𝐵0 (𝐷) and 𝜇𝐵1 (𝐷) are both greater than 𝜀𝑚+1 , the concentration assumption
yields that the numbers 𝜇𝐵0 (𝑉 ⋅ (𝐷 ∩ 𝐵0 )) = 𝜇𝐵1 (𝑉 ⋅ (𝐷 ∩ 𝐵1 )) are both greater than 1/2.
It follows that there is a point 𝑥 ∈ (𝑉 ⋅ (𝐷 ∩ 𝐵0 )) ∩ 𝐵0 such that 𝛾 ⋅ 𝑥 ∈ (𝑉 ⋅ (𝐷 ∩ 𝐵1 )).
Find points 𝑥0′ ∈ 𝐷 ∩ 𝐵0 and 𝑥1′ ∈ 𝐷 ∩ 𝐵1 and group elements 𝛽0 , 𝛽1 ∈ 𝑉 such that
𝛽0 ⋅ 𝑥0′ = 𝑥 and 𝛽1 ⋅ (𝛾 ⋅ 𝑥) = 𝑥1′ . Use the induction hypothesis to find a 𝑈, 𝛿𝑛 -walk
from 𝑥0 to 𝑥0′ . Follow it by acting by 𝛽0 𝛾𝛽1 ∈ 𝑈 to get to the point 𝑥1′ , and then use the
induction hypothesis again to extend the walk from 𝑥1′ to 𝑥1 . The claim follows. □
Since the numbers 𝛿𝑛 tend to 0 as 𝑛 tends to infinity and 𝐷 ⊂ 𝐵ini , the claim shows
that the set 𝐷 is 𝑈-connected and completes the proof of the proposition. □
Proof of Theorem 3.6.2. Suppose towards a contradiction that ⟨𝑈, 𝐶⟩ is a con-
dition in the product 𝑃Γ × 𝑃𝜇 which forces 𝑉[𝑥𝑔𝑒𝑛
̇ ] ≠ 𝑉. The following
claim follows from abstract forcing considerations.
Claim 3.6.9. ⟨𝑈, 𝐶⟩ ⊩ 2𝜔 ∩ 𝑉[𝑥𝑔𝑒𝑛
̇ ] ∩ 𝑉[𝛾𝑔𝑒𝑛 ̇ ] ≠ 2𝜔 ∩ 𝑉.
Proof. It will be enough to show that 𝑃𝜇 forces that for every ordinal 𝛼 and every
function 𝑓 ∶ 𝛼 → 2 in the extension, if 𝑓 ∉ 𝑉 then there is a ground model countable
set 𝑏 ⊂ 𝛼 such that 𝑓 ↾ 𝑏 ∉ 𝑉. It will follow immediately that 𝑃Γ × 𝑃𝜇 forces that if
𝑓 ∈ 𝑉[𝑥𝑔𝑒𝑛 ̇ ] ∩ 𝑉[𝛾𝑔𝑒𝑛 ̇ ] ⧵ 𝑉 then 𝑓 ↾ 𝑏 ∈ 𝑉[𝑥𝑔𝑒𝑛
̇ ⋅ 𝑥𝑔𝑒𝑛 ̇ ] ∩ 𝑉[𝛾𝑔𝑒𝑛
̇ ] ⧵ 𝑉 for some
ground model countable set 𝑏. This will prove the claim.
The forcing property of 𝑃𝜇 in question is well-known; we include a complete proof.
Suppose towards a contradiction that 𝐵 ∈ 𝑃𝜇 and 𝐵 ⊩ 𝜏 ∶ 𝛼̌ → 2 is a function which is
not in the ground model, and for every countable set 𝑏 ∈ 𝑉, 𝜏 ↾ 𝑏 ∈ 𝑉. Let ⟨𝑀𝛽 ∶ 𝛽 ∈
𝜔1 ⟩ be an ∈-tower of countable elementary submodels of a large structure containing
𝐵, 𝜏 as elements. For each 𝛽 ∈ 𝜔1 use the contradictory assumption to find a function
𝑔𝛽 ∶ 𝑀𝛽 ∩ 𝛼 → 2 in the model 𝑀𝛽+1 such that some condition below 𝐵 forces 𝜏 ↾ 𝑀𝛽 =
𝑔𝛽̌ . Let 𝐵𝛽 ⊂ 𝐵 be the Borel set representing the nonzero Boolean value of the latter
statement; 𝐵𝛽 ∈ 𝑀𝛽+1 holds by elementarity of the model 𝑀𝛽+1 , but also 𝐵𝛽 ∉ 𝑀𝛽
since 𝜏 is forced not to belong to the ground model. Use a counting argument and the
Lebesgue density theorem to find a basic open set 𝑂 ⊂ 𝑋 such that the set 𝐶 = {𝛽 ∈
1
𝜔1 ∶ 𝜇(𝐵𝛽 ∩𝑂) > 𝜇(𝑂)} is uncountable. Since the conditions {𝐵𝛽 ∶ 𝛽 ∈ 𝐶} are pairwise
2
compatible, the functions {𝑔𝛽 ∶ 𝛽 ∈ 𝐶} must form an increasing chain, so in fact the
conditions {𝐵𝛽 ∶ 𝛽 ∈ 𝐶} form a strictly decreasing chain in 𝑃𝜇 . This contradicts the
countable chain condition of 𝑃𝜇 . □
Strengthening the condition ⟨𝑈, 𝐶⟩ if necessary, we may find a continuous function
𝑓 ∶ 𝐶 → 2𝜔 and a name 𝜏 in the complete Boolean algebra generated by the name for
𝛾𝑔𝑒𝑛 ̇ such that the fibers of 𝑓 are 𝜇-null and ⟨𝑈, 𝐶⟩ ⊩ 𝑓(̇ 𝑥𝑔𝑒𝑛
̇ ⋅ 𝑥𝑔𝑒𝑛 ̇ ) = 𝜏/𝛾𝑔𝑒𝑛
̇ . Let 𝑀
be a countable elementary submodel of a large structure containing 𝑓, 𝜏 in particular,
and let 𝐶 ′ ⊂ 𝐶 be a set of points 𝑃𝜇 -generic over the model 𝑀. The set 𝐶 ′ is Borel and
𝜇-positive. Find open subsets 𝑉, 𝑈 ′ of Γ such that 1 ∈ 𝑉, 𝑈 ′ ⊂ 𝑈, and 𝑈 ′ ⋅ 𝑉 ⊂ 𝑈. Use

Proposition 3.6.5 to find a 𝑉-connected compact 𝜇-positive subset 𝐷 ⊂ 𝐶 ′ .
Since the fibers of 𝑓 are 𝜇-null, there must be points 𝑥0 , 𝑥1 ∈ 𝐷 such that 𝑓(𝑥0 ) ≠
𝑓(𝑥1 ). Find a number 𝑛 ∈ 𝜔 such that 𝑓(𝑥0 )(𝑛) ≠ 𝑓(𝑥1 )(𝑛). Let 𝑂0 = {𝑥 ∈ 𝐷 ∶ 𝑓(𝑥)(𝑛)
= 𝑓(𝑥0 )(𝑛)} and 𝑂1 = {𝑥 ∈ 𝐷 ∶ 𝑓(𝑥)(𝑛) = 𝑓(𝑥1 )(𝑛)}. These are complementary rela-
tively open subsets of the compact set 𝐷, so they are separated by some distance 𝛿 > 0.
Use the connectedness of the set 𝐷 to produce a 𝑉, 𝛿-walk from 𝑥0 to 𝑥1 . There must
be successive points 𝑥0′ , 𝑥1′ on the walk such that 𝑓(𝑥0′ )(𝑛) ≠ 𝑓(𝑥1′ )(𝑛). The two points
are at a distance > 𝛿 by the choice of 𝛿, so there must be a group element 𝛽 ∈ 𝑉 such
that 𝛽 ⋅ 𝑥0′ = 𝑥1′ .
By the Baire category theorem, there must be an element 𝛾 ∈ 𝑈 ′ which belongs to
no meager subset of Γ coded in the model 𝑉[𝑥1′ ] and also to no right 𝛽 −1 -shift of any
meager subset of Γ coded in the model 𝑉[𝑥0′ ]. As a result, the point 𝛾 is 𝑃Γ -generic over
𝑉[𝑥1′ ] and the point 𝛾⋅𝛽 is 𝑃Γ -generic over the model 𝑉[𝑥0′ ]. Both of these points belong
to the set 𝑈. By the product forcing theorem, the pairs ⟨𝛾𝛽, 𝑥0′ ⟩ and ⟨𝛾, 𝑥1′ ⟩ are both 𝑃Γ ×
𝑃𝜇 -generic over the model 𝑀, meeting the condition ⟨𝑈, 𝐶⟩. However, 𝑓(𝑥0′ ) ≠ 𝑓(𝑥1′ )
while 𝜏/𝛾𝛽𝑥0′ = 𝜏/𝛾𝑥1′ , violating the forcing theorem in view of the initial contradictory
assumption. Theorem 3.6.2 follows! □
The main corollaries are encapsulated in the following ergodicity result.
Corollary 3.6.10. Suppose that Γ is a Polish group acting on a Polish space 𝑋 with
a Borel probability measure 𝜇 and an ultrametric 𝑑 in a measure preserving and distance
preserving fashion. Suppose that the action has concentration of measure. Suppose that 𝐸
is the orbit equivalence relation, 𝑌 is a Polish space, 𝐹 on 𝑌 is an analytic virtually placid
equivalence relation, and ℎ ∶ 𝑋 → 𝑌 is a Borel homomorphism from 𝑋 to 𝑌 . Then there
is an 𝐹-equivalence class with 𝜇-positive ℎ-preimage.
Proof. Let 𝛾 ∈ Γ and 𝑥 ∈ 𝑋 be mutually 𝑃Γ -generic and 𝑃𝜇 -generic points, and

look at the models 𝑉[𝑥] and 𝑉[𝛾⋅𝑥]. Since ℎ is a homomorphism of 𝐸 to 𝐹 and 𝑥 𝐸 𝛾⋅𝑥,
ℎ(𝑥) 𝐹 ℎ(𝛾 ⋅ 𝑥) must hold. Since 𝐹 is virtually placid and 𝑉[𝑥] ∩ 𝑉[𝛾 ⋅ 𝑥] = 𝑉 holds per
Theorem 3.6.2, there must be a virtual 𝐹-class in the ground model such that ℎ(𝑥) and
ℎ(𝛾 ⋅ 𝑥) realize it. Since the poset 𝑃Γ × 𝑃𝜇 is c.c.c., Theorem 2.6.2 shows that all virtual
classes realized in its extension are in fact repreented in the ground model. Thus, there
is a ground model element 𝑦 ∈ 𝑌 such that ℎ(𝑥) 𝐹 𝑦 holds. Since 𝑥 is a 𝑃𝜇 -generic point,
it belongs to no analytic ground model coded 𝜇-small sets. Thus, 𝜇(ℎ−1 [𝑦]𝐹 ) > 0 as
desired. □
Examples of actions with concentration of measure are not easy to identify. The fol-
lowing examples use 𝐹𝜍 P-ideals 𝐼 on 𝜔 (which are Polish groups with the symmetric
difference operation and a suitable topology by a result of Solecki [98]) and their stan-
dard action on 2𝜔 (𝑎 ⋅ 𝑥 = 𝑦 just in case {𝑛 ∈ 𝜔 ∶ 𝑥(𝑛) ≠ 𝑦(𝑛)} = 𝑎}), inducing the
equivalence relation =𝐼 . The action preserves the usual Borel probability measure 𝜇
on 2𝜔 and also the usual minimum difference metric 𝑑 on 2𝜔 .
Example 3.6.11. Let {𝑎𝑛 ∶ 𝑛 ∈ 𝜔} be positive real numbers such that Σ𝑛 𝑎𝑛 is

infinite while Σ𝑛 𝑎2𝑛 is finite. Let 𝐼 be the ideal of all sets 𝑏 ⊂ 𝜔 such that Σ𝑛∈𝑏 𝑎𝑛 is finite.
One can view 𝐼 as a Polish group Γ with the complete metric 𝑒(𝛾, 𝛿) = Σ{𝑎𝑛 ∶ 𝛾(𝑛) ≠
90 3. TURBULENCE
𝛿(𝑛)}, continuously acting on the space 𝑋 = 2𝜔 by coordinatewise Boolean addition.

The action exhibits the concentration of measure.
To see this, let 𝑈 be a neighborhood of the unit in Γ, and 𝜀 > 0 be a real number.
Find a real number 𝜂 > 0 such that the 𝜂-ball in the metric 𝑒 around the unit is a subset
of 𝑈, and find a number 𝑚 ∈ 𝜔 such that 2exp(−𝜂2 /8Σ∞ 2
𝑛=𝑚 𝑎𝑛 ) < 𝜀. The concentration
of measure formula in [86, Theorem 4.3.19] then shows that 𝛿 = 2−𝑚 works as required
in Definition 3.6.1.
Corollary 3.6.12. Let 𝐼 be the usual summable ideal on 𝜔. Let ℎ ∶ 2𝜔 → 𝑋 be
a Borel homomorphism of =𝐼 to a virtually placid analytic equivalence relation 𝐹 on a
Polish space 𝑋. Then there is an 𝐹-class whose ℎ-preimage has full 𝜇-mass.
Proof. By Corollary 3.6.10, there is an 𝐹-class whose ℎ-preimage has positive 𝜇-
mass. However, the ℎ-preimage is an =𝐼 -invariant set, the equivalence relation =𝐼
includes 𝔼0 as a subset, and by the usual 𝔼0 -ergodicity considerations, the ℎ-preimage
must in fact have full 𝜇-mass. □
The concentration of measure for actions fails in many cases. Typically, there is a ho-
momorphism of the orbit equivalence relation which violates the conclusion of Corol-
lary 3.6.10 and therefore witnesses the failure of the concentration of measure in a
strong sense.
Example 3.6.13. There is a summable-type ideal 𝐼 on 𝜔 and a Borel homomor-
phism ℎ ∶ 2𝜔 → 2𝜔 of =𝐼 to 𝔼0 such that preimages of 𝔼0 -equivalence classes are 𝜇-
null.
Proof. The key tool is the following:
Claim 3.6.14. For every 𝑖 ∈ 𝜔 and every 𝜀 > 0 there is a number 𝑛 ∈ 𝜔 and sets
1−𝜀
𝑎, 𝑏 ⊂ 2𝑛 of the same relative size > each, such that for every 𝑥 ∈ 𝑎 and 𝑦 ∈ 𝑏 the set
2
{𝑚 ∈ 𝑛 ∶ 𝑥(𝑚) ≠ 𝑦(𝑚)} contains at least 𝑖 many elements.
Proof. Fix 𝑖 and 𝜀. Stirling’s approximation formula shows that there is 𝑛 ∈ 𝜔
𝑛
such that the size of the set {𝑎 ⊂ 𝑛 ∶ ||𝑎| − | < 𝑖 + 1} is less than 𝜀2𝑛 . Let 𝑎 = {𝑥 ∈ 2𝑛 ∶
2
𝑛
the set {𝑚 ∈ 𝑛 ∶ 𝑥(𝑚) = 1} contains at most − 𝑖 many elements} and 𝑏 = {𝑥 ∈ 2𝑛 ∶
2
𝑛
the set {𝑚 ∈ 𝑛 ∶ 𝑥(𝑚) = 1} contains at least + 1 many elements}. This works. □
2
Towards the proof of the example, find a partition 𝜔 = ⋃𝑛 𝐼𝑛 into finite sets such that
for every 𝑛 ∈ 𝜔, the set 2𝐼𝑛 contains subsets 𝑎𝑛 , 𝑏𝑛 of the same size such that their rela-
tive size in 2𝐼𝑛 is greater than 1/2−2−𝑛 , and if 𝑥 ∈ 𝑎𝑛 and 𝑦 ∈ 𝑏𝑛 are arbitrary elements,
1
then the set {𝑖 ∈ 𝐼𝑛 ∶ 𝑥(𝑛) ≠ 𝑦(𝑛)} has size at least 𝑛. Now, define 𝑤(𝑚) = if 𝑚 ∈ 𝐼𝑛
𝑛+1
and 𝐼 = {𝑎 ⊂ 𝜔 ∶ Σ𝑛∈𝑎 𝑤(𝑛) < ∞}. Define 𝐵 = {𝑥 ∈ 2 ∶ ∀ 𝑛 𝑥 ↾ 𝑛 ∈ 𝑎𝑛 ∪ 𝑏𝑛 }; this is a
𝜔 ∞
Borel set of full mass. For 𝑥 ∈ 𝐵, define ℎ0 (𝑥) ∈ 2𝜔 by ℎ0 (𝑥)(𝑛) = 0 ↔ 𝑥 ↾ 𝐼𝑛 ∈ 𝑎𝑛 . It

is not difficult to check that ℎ0 ∶ 𝐵 → 2𝜔 is a continuous homomorphism from 𝐵 to 𝔼0
such that preimages of 𝔼0 -classes are of zero mass. The rest of the proof only adjusts
ℎ0 to a Borel homomorphism ℎ defined on the whole space.
To this end, let 𝐶𝑛 for 𝑛 ∈ 𝜔 be inclusion increasing compact subsets of 𝐵 whose
mass converges to 1. The set ⋃𝑛 𝐶𝑛 is 𝐾𝜍 and the equivalence relation =𝐼 is 𝐾𝜍 , so the
saturation 𝐷 = [⋃𝑛 𝐶𝑛 ]=𝐼 is 𝐾𝜍 as well. Let 𝐹 ⊂ 𝐷×2𝜔 be the Borel set of all pairs ⟨𝑥, 𝑦⟩
such that for some (equivalently, for all) 𝑥′ ∈ 𝐵 such that 𝑥′ =𝐼 𝑥, ℎ0 (𝑥′ ) is 𝔼0 -related
to 𝑦. 𝐹 is a Borel set with nonempty countable sections, and by the Lusin–Novikov
theorem, it has a Borel uniformization ℎ. Extend ℎ to all of 2𝜔 by defining ℎ(𝑥) for
𝑥 ∉ 𝐷 to be an arbitrary fixed element of 2𝜔 . It is not difficult to check that ℎ has the
required properties. □
Example 3.6.15. There is a Tsirelson-type [31] ideal 𝐼 on 𝜔 and a Borel homo-
morphism ℎ ∶ 𝐵 → 2𝜔 of =𝐼 to 𝔼0 such that preimages of 𝔼0 -equivalence classes are
𝜇-null.
Proof. We will deal with a certain special kind of Tsirelson submeasures. Let
𝛼 > 0 be a real number and 𝑓 ∶ 𝜔 → ℝ+ be a nonincreasing function converging to 0.
By induction on 𝑛 ∈ 𝜔 define submeasures 𝜈𝑛 on 𝜔 by setting 𝜈0 (𝑎) = sup𝑖∈𝑎 𝑓(𝑖),
and 𝜈𝑛+1 (𝑎) = sup{𝜈𝑛 (𝑎), 𝛼 ∑𝑏∈𝑏⃗ 𝜈𝑛 (𝑏)} where the variable 𝑏 ⃗ ranges over all finite
sequences ⟨𝑏0 , 𝑏1 , . . . 𝑏𝑗 ⟩ of finite subsets of 𝑎 such that 𝑗 < min(𝑏0 ) ≤ max(𝑏0 ) <
min(𝑏1 ) ≤ max(𝑏1 ) < . . . . In the end, let the submeasure 𝜈 be the supremum of 𝜈𝑛 for
𝑛 ∈ 𝜔. Some computations are necessary to verify that 𝜈 is really a lower semicontinu-
ous submeasure on 𝜔 [31]. The Tsirelson ideal 𝐼 = {𝑎 ⊂ 𝜔 ∶ lim𝑚 𝜈(𝑎 ⧵ 𝑚) = 0} turns
out to be an 𝐹𝜍 P-ideal [31].
By induction on 𝑖 ∈ 𝜔 choose intervals 𝐼𝑖 ⊂ 𝜔 such that max(𝐼𝑖 ) < min(𝐼𝑖+1 ) and
1−2−𝑖
such that min(𝐼𝑖 ) > 𝑖/𝛼 and there are sets 𝑎𝑖 , 𝑏𝑖 ⊂ 2𝐼𝑖 of the same relative size ≥
2
such that for any elements 𝑥 ∈ 𝑎𝑖 , 𝑦 ∈ 𝑏𝑖 the set {𝑚 ∈ 𝐼𝑖 ∶ 𝑥(𝑚) ≠ 𝑦(𝑚)} has size at least
𝑖/𝛼. This is easily possible by Claim 3.6.14. Now, consider the function 𝑓 defined by
𝑓(𝑚) = 1/𝑖 for 𝑚 ∈ (max(𝐼𝑖−1 ), max(𝐼𝑖 )] and let 𝜈 be the derived submeasure and 𝐼 the
derived Tsirelson ideal. Observe that with this choice of the function 𝑓, for any 𝑖 ∈ 𝜔
and elements 𝑥 ∈ 𝑎𝑖 , 𝑦 ∈ 𝑏𝑖 the set {𝑚 ∈ 𝐼𝑖 ∶ 𝑥(𝑚) ≠ 𝑦(𝑚)} has 𝜈-mass at least 1, since
it has 𝜈1 -mass at least 1. The rest of the proof follows the lines of Example 3.6.13. □
Example 3.6.16. Let 𝐽 be the Rado graph ideal on 𝜔. There is a Borel homomor-
phism ℎ ∶ 2𝜔 → 2𝜔 from =𝐽 to 𝔼0 such that preimages of 𝔼0 -classes are 𝜇-null.
Proof. Let 𝐺 be the Rado graph, interpreted so that 𝜔 is the set of its vertices;
then 𝐽 is the ideal on 𝜔 generated by 𝐽-cliques and 𝐽-anticliques. To construct ℎ, by
induction on 𝑛 ∈ 𝜔 find pairwise disjoint finite sets 𝐼𝑛 ⊂ 𝜔 and sets 𝑎𝑛 , 𝑏𝑛 ⊂ 2𝐼𝑛 such
that
• each 𝐼𝑛 is a 𝐺-anticlique;
• if 𝑛 ≠ 𝑚 then 𝐼𝑛 × 𝐼𝑚 ⊂ 𝐺;
• for every 𝑥 ∈ 𝑎𝑛 and every 𝑦 ∈ 𝑏𝑛 the set {𝑡 ∈ 𝐼𝑛 ∶ 𝑥(𝑡) ≠ 𝑦(𝑡)} has size at
least 𝑛;
• the sets 𝑎𝑛 , 𝑏𝑛 ⊂ 2𝐼𝑛 have the same relative size larger than 1/2 − 2−𝑛 .
This is easy to do using the universality properties of the Rado graph and Claim 3.6.14
repeatedly. Let 𝐵 = {𝑥 ∈ 2𝜔 ∶ ∀∞ 𝑛 𝑥 ↾ 𝐼𝑛 ∈ 𝑎𝑛 ∪ 𝑏𝑛 } and let ℎ0 ∶ 𝐵 → 2𝜔 be the Borel
map defined by ℎ0 (𝑥) = 0 ↔ 𝑥 ↾ 𝐼𝑛 ∈ 𝑎𝑛 . It is immediate that the set 𝐵 has full 𝜇-mass
and the function ℎ is a homomorphism from =𝐽 to 𝔼0 . The rest of the proof follows the
lines of Example 3.6.13. □
There are numerous questions left open by the development of this section, of which
we quote two.
92 3. TURBULENCE
Question 3.6.17. Can the assumption that 𝑑 be an ultrametric be eliminated from

the assumptions of Theorem 3.6.2?
Question 3.6.18. Is there a Tsirelson ideal whose natural action on 2𝜔 exhibits
concentration of measure?
CHAPTER 4
Nested sequences of models
4.1. Prologue
The purpose of this chapter is to set up a calculus for infinite nested sequences
of models of ZFC, which turn out to be critical for the treatment of the 𝔼1 cardinal.
As a motivation, we include a simple proof of the fact that 𝔼1 is not Borel reducible
to any orbit equivalence relation. It is quite different from the standard one [54, The-
orem 11.8.1], and it has the advantage that it can be easily adapted to the context of
inequalities between cardinalities of quotient spaces.
Theorem 4.1.1. 𝔼1 is not Borel reducible to any orbit equivalence relation.
Proof. Let 𝑌 be the Polish space (2𝜔 )𝜔 and Γ be a Polish group continuously act-
ing on a Polish space 𝑍, inducing the orbit equivalence relation 𝐹. Suppose towards a
contradiction that there is a Borel reduction ℎ ∶ 𝑌 → 𝑍 of 𝔼1 to 𝐹. Let ⟨𝑥𝑛 ∶ 𝑛 ∈ 𝜔⟩
be a sequence of mutually Cohen generic points in 2𝜔 . For each 𝑛 ∈ 𝜔 let 𝑦𝑛 denote
the element of 𝑌 for which 𝑦(𝑚) is the zero sequence in 2𝜔 if 𝑚 < 𝑛, and 𝑥𝑚 if 𝑚 ≥ 𝑛;
write 𝑀𝑛 = 𝑉[𝑦𝑛 ].
Work in the model 𝑀0 . The reinterpretation of the Borel map ℎ in 𝑀0 is still a
reduction of 𝔼1 to 𝐹. For each number 𝑛 > 0 fix a group element 𝛾𝑛 ∈ Γ such that
𝛾𝑛 ⋅ ℎ(𝑦𝑛 ) = ℎ(𝑦0 ). Let 𝛾 ∈ Γ be a point Cohen-generic over 𝑉[𝑦0 ] and look into the
model 𝑉[𝛾 ⋅ ℎ(𝑦0 )]. By a Mostowski absoluteness argument, there must be a point
𝑦 ∈ 𝑉[𝛾 ⋅ ℎ(𝑦0 )] such that ℎ(𝑦) 𝐹 𝛾 ⋅ ℎ(𝑦0 ). Since the function ℎ is a reduction of 𝔼1
to 𝐹 even in the model 𝑀0 [𝛾], this point 𝑦 ∈ 𝑌 must be 𝔼1 -related to 𝑦0 , so for all but
finitely many numbers 𝑛 it must be the case that 𝑦(𝑛) = 𝑥𝑛 . Choose a number 𝑛 ∈ 𝜔
such that 𝑦(𝑛) = 𝑥𝑛 and look at the model 𝑀𝑛+1 . The point 𝛾𝛾𝑛+1 ∈ Γ is Cohen generic
over 𝑀0 by the invariance of the meager ideal under right shift, and by the product
forcing theorem it follows that the models 𝑀0 and 𝑀𝑛+1 [𝛾𝛾𝑛+1 ] are mutually generic
over the model 𝑀𝑛+1 . Now, the points 𝑦𝑛+1 and 𝛾𝛾𝑛+1 ⋅ ℎ(𝑦𝑛+1 ) = 𝛾 ⋅ ℎ(𝑦0 ) belong to
the model 𝑀𝑛+1 [𝛾𝛾𝑛+1 ] and so does 𝑦. Thus, even the point 𝑦(𝑛) = 𝑥𝑛 ∈ 2𝜔 belongs to
this model; however, it is a point of 𝑀0 Cohen generic over 𝑀𝑛+1 . This contradicts the
product forcing theorem. □
4.2. Coherent sequences of models

It is clear from the proof of Theorem 4.1.1 that its generalizations will require cod-
ification of decreasing 𝜔-sequences of generic extensions. In addition to the approach
from Theorem 4.1.1, we pay close attention to the intersection model. This is the con-
tent of the following definitions and theorems.
Definition 4.2.1. Let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be an inclusion decreasing sequence of tran-
sitive models of ZFC. We say that the sequence is coherent if for every ordinal 𝜆 and
93
94 4. NESTED SEQUENCES OF MODELS
every natural number 𝑛, the sequence ⟨𝑉𝜆 ∩ 𝑀𝑚 ∶ 𝑚 ≥ 𝑛⟩ belongs to 𝑀𝑛 . Given a co-

herent sequence of models ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩, a sequence ⟨𝑣𝑛 ∶ 𝑛 ∈ 𝜔⟩ is coherent if for
every number 𝑚 ∈ 𝜔, ⟨𝑣𝑛 ∶ 𝑛 ≥ 𝑚⟩ ∈ 𝑀𝑚 holds.
Example 4.2.2. Let 𝑅𝑚 for 𝑚 ∈ 𝜔 be any partial orders and let ⟨𝐺𝑚 ∶ 𝑚 ∈ 𝜔⟩ be a
sequence of generic filters on the respective posets 𝑅𝑚 added by the countable support
product ∏𝑚 𝑅𝑚 . Let 𝑀𝑛 = 𝑉[𝐺𝑚 ∶ 𝑚 ≥ 𝑛]. Then ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a coherent sequence
of models.
Example 4.2.3. Let 𝑥 be a set. By recursion on 𝑛 ∈ 𝜔, define models 𝑀𝑛 by letting
𝑀0 be 𝑉 and each 𝑀𝑛+1 be the collection of all sets hereditarily definable from ordinal
parameters and the parameter 𝑥 ∩ 𝑀𝑛 in the model 𝑀𝑛 . The sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ is
coherent.
Example 4.2.4. Let 𝜅 be a measurable cardinal, 𝑈 a measure on it, and 𝑗 ∶ 𝑉 → 𝑀
the 𝑈-ultrapower, with iterands denoted by 𝑗𝛼 for every ordinal 𝛼. For each 𝑛 ∈ 𝜔 let
𝑀𝑛 = 𝑗𝑛 (𝑉). The sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ is coherent.
Most of our choice-coherent sequences are sequences of generic extensions in the fol-
lowing sense:
Definition 4.2.5. A sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ is generic over 𝑉 if 𝑉 is a model of
ZFC contained in all 𝑀𝑛 for 𝑛 ∈ 𝜔 and 𝑀0 is a generic extension of 𝑀.
The usual abstract forcing arguments (Fact 1.7.7) show that if the sequence of models
is generic over 𝑉 then all models 𝑀𝑛 are generic extensions of 𝑉 and if 𝑛 ∈ 𝑚 are
numbers then 𝑀𝑛 is a generic extension of 𝑀𝑚 . Coherent sequences of models are
most often formed as generic extensions of the constant sequence ⟨𝑀𝑛 = 𝑉 ∶ 𝑛 ∈ 𝜔⟩
using the following definitions and theorem.
Definition 4.2.6. Let 𝑃, 𝑄 be posets. A projection of 𝑄 to 𝑃 is a pair of order-
preserving functions 𝜋 ∶ 𝑄 → 𝑃 and 𝜉 ∶ 𝑃 → 𝑄 such that
(1) 𝜋 ∘ 𝜉 is the identity on 𝑃;
(2) whenever 𝜋(𝑞) ≤ 𝑝 then 𝑞 ≤ 𝜉(𝑝);
(3) whenever 𝑝 ≤ 𝜋(𝑞) then there is 𝑞′ ≤ 𝑞 such that 𝜋(𝑞′ ) ≤ 𝑝.
As the simplest initial example, let 𝑃, 𝑅 be any posets, let 𝑅 have a largest element 1𝑅
and let 𝑄 = 𝑃 × 𝑅. Then one can consider the projection of 𝑄 to 𝑃 by setting 𝜋(𝑝, 𝑟) = 𝑝
and 𝜉(𝑝) = ⟨𝑝, 1𝑅 ⟩. An important effect of the demand (3) is that the 𝜋-image of the
generic filter on 𝑄 is a generic filter on 𝑃.
Definition 4.2.7. Let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a coherent sequence of models of ZFC. A
coherent sequence of posets is a sequence ⟨𝑃𝑛 , 𝜋𝑛𝑚 , 𝜉𝑚𝑛 ∶ 𝑛 ≤ 𝑚 ∈ 𝜔⟩ such that
(1) For all numbers 𝑛 ≤ 𝑚 the maps 𝜋𝑛𝑚 ∶ 𝑃𝑛 → 𝑃𝑚 and 𝜉𝑚𝑛 ∶ 𝑃𝑚 → 𝑃𝑛 form a
projection of 𝑃𝑛 to 𝑃𝑚 ;
(2) the functions 𝜋𝑛𝑚 form a commutative system, the same for 𝜉𝑚𝑛 , and for all
𝑛 ∈ 𝜔 the functions 𝜋𝑛𝑛 , 𝜉𝑛𝑛 are the identity on 𝑃𝑛 ;
(3) for every number 𝑘 ∈ 𝜔, the sequence ⟨𝑃𝑛 , 𝜋𝑛𝑚 , 𝜉𝑚𝑛 ∶ 𝑘 ≤ 𝑛 ≤ 𝑚 ∈ 𝜔⟩
belongs to the model 𝑀𝑘 .
In particular, every commutative sequence of projections is coherent over the constant
coherent sequence ⟨𝑀𝑛 = 𝑉∶ 𝑛 ∈ 𝜔⟩. As the simplest initial example, let ⟨𝑅𝑛∶ 𝑛 ∈ 𝜔⟩ be a
4.2. COHERENT SEQUENCES OF MODELS 95
sequence of posets with respective largest elements 1𝑛 , let 𝑃𝑛 be the finite (or countable)
support product of 𝑅𝑚 for 𝑚 ≥ 𝑛, and let 𝜋𝑛𝑚 (𝑝) = 𝑝 ↾ [𝑚, 𝜔) and 𝜉𝑛𝑚 (𝑝) = ⟨1𝑘 ∶ 𝑘 ∈
[𝑛, 𝑚)⟩⌢ 𝑝. The sequence ⟨𝑃𝑛 , 𝜋𝑛𝑚 , 𝜉𝑚𝑛 ∶ 𝑛 ≤ 𝑚 ∈ 𝜔⟩ is coherent over ⟨𝑀𝑛 = 𝑉 ∶ 𝑛 ∈
𝜔⟩.
Theorem 4.2.8. Let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a coherent sequence of models of ZFC and
⟨𝑃𝑛 , 𝜋𝑛𝑚 ∶ 𝑃𝑛 → 𝑃𝑚 , 𝜉𝑚𝑛 ∶ 𝑃𝑚 → 𝑃𝑛 ∶ 𝑛 ≤ 𝑚 ∈ 𝜔⟩ be a coherent sequence of posets. Let
−1
𝐺 ⊂ 𝑃0 be a filter generic over 𝑀0 , and for each 𝑛 ∈ 𝜔 let 𝐺𝑛 = 𝜉𝑛0 𝐺. The sequence
⟨𝑀𝑛 [𝐺𝑛 ] ∶ 𝑛 ∈ 𝜔⟩ is a coherent sequence of models of ZFC again.
Proof. Observe that for every number 𝑘 ∈ 𝜔, in the model 𝑀𝑘 [𝐺𝑘 ], one can form
−1
the sequence ⟨𝐺𝑛 ∶ 𝑛 ≥ 𝑘⟩ as ⟨𝜉𝑛𝑘 𝐺𝑘 ∶ 𝑛 ≥ 𝑘⟩ by the commutativity of the 𝜉-maps.
Thus, if 𝜆 is a limit ordinal larger than the rank of all the posets on the coherent se-
quence, one can form the relation {⟨𝑛, 𝑥⟩ ∶ 𝑛 ≥ 𝑘, 𝑥 ∈ 𝑀𝑛 [𝐺𝑛 ] has rank < 𝜆} in the
model 𝑀𝑘 [𝐺𝑘 ] as the set {⟨𝑛, 𝜏/𝐺𝑛 ⟩ ∶ 𝑛 ≥ 𝑘 and 𝜏 ∈ 𝑀𝑛 is a 𝑃𝑛 -name of rank < 𝜆} by
the coherence of the original sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩. □
The critical object for understanding a coherent sequence of models is the intersec-
tion model 𝑀𝜔 = ⋂𝑛 𝑀𝑛 . In Example 4.2.2, the intersection model is a model of
ZFC, and it has been discussed in [55, Theorem 9.3.4]; we will come back to it below–
Theorem 4.3.5. In the context of general coherent sequences, the intersection model is
a transitive model of ZF, and the Axiom of Choice may fail in it. This is the content of
the following theorem and example.
Theorem 4.2.9. If ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a coherent sequence of generic extensions of 𝑉,
then 𝑀𝜔 = ⋂𝑛 𝑀𝑛 is a class in all models 𝑀𝑛 , and it is a model of ZF.
Proof. We will only show that 𝑀𝜔 is a class in 𝑀0 ; it then follows by the same
argument that 𝑀𝜔 is a class in each 𝑀𝑛 for 𝑛 ∈ 𝜔. To show that 𝑀𝜔 is a model of ZF, by
[51, Theorem 13. 9], it is enough to show that 𝑀𝜔 is closed under the Gödel operations
and it is universal: for every set 𝑎 ⊂ 𝑀𝜔 there is a set 𝑏 ∈ 𝑀𝜔 such that 𝑎 ⊂ 𝑏.
The closure under the Gödel operations follows from the fact that these operations are
evaluated in the same way in each model 𝑀𝑛 . For the universality, suppose that 𝑎 ⊂ 𝑀𝜔
is a set, choose an ordinal 𝛼 such that all sets in 𝑎 have rank smaller than 𝛼, and form
the set 𝑏 = 𝑉𝛼 ∩ 𝑀𝜔 . Since 𝑀𝜔 is a class in each model 𝑀𝑛 , the set 𝑏 is in all models
𝑀𝑛 and therefore in 𝑀𝜔 . Clearly, 𝑎 ⊂ 𝑏, concluding the proof of universality.
To show that 𝑀𝜔 is a class in 𝑀0 , let 𝜆 be a large limit cardinal in 𝑉 so that 𝑀0 is
a generic extension of 𝑉 by a poset in 𝑉𝜆 , and such that 𝑉𝜆 satisfies a large fragment of
ZFC. Note that then, all the models 𝑀𝑛 are also obtained from 𝑉 as generic extensions
by posets in 𝑉𝜆 . Move to the model 𝑀0 . Let 𝑓 be the function from 𝜔 to 𝑀0 ∩𝑉𝜆 such that
𝑓(𝑛) = {⟨𝑃, 𝐺⟩ ∶ 𝑃 ∈ 𝑉 ∩𝑉𝜆 , 𝐺 ∈ 𝑀𝑛 is a filter on 𝑃 generic over 𝑉, and whenever ⟨𝑄, 𝐻⟩
is a pair consisting of a poset in 𝑉 ∩ 𝑉𝜆 and a filter on 𝑄 in 𝑀𝑛 generic over 𝑉, there
is a 𝑃-name 𝜎 in 𝑉 such that 𝜎/𝐺 = 𝐻}. The coherence of the sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩
shows that the function 𝑓 can be formed in 𝑀0 . Then, 𝑀𝜔 is exactly the collection of
all sets 𝑥 such that for every 𝑛 ∈ 𝜔 and every pair ⟨𝑃, 𝐺⟩ ∈ 𝑓(𝑛), 𝑥 ∈ 𝑉[𝐺]. Since 𝑉 is
a class in 𝑀0 , this shows that 𝑀𝜔 is a class in 𝑀0 as well. □
Example 4.2.10. Let 𝜅 be a measurable cardinal, with a normal measure 𝑈 on 𝜅
and the associated ultrapower 𝑗 ∶ 𝑉 → 𝑀. Let 𝑗𝑛𝑚 ∶ 𝑀𝑛 → 𝑀𝑚 be the iterands of 𝑗 for
𝑛 ≤ 𝑚 ≤ 𝜔. Then ⋂𝑛∈𝜔 𝑀𝑛 = 𝑀𝜔 [𝑐] holds where 𝑐 = ⟨𝑗0𝑛 (𝜅) ∶ 𝑛 ∈ 𝜔⟩ [16, 21]. It is
well-known and follows from the geometric description of Prikry genericity by Mathias
[80] that the set 𝑐 is generic over the model 𝑀𝜔 for the Prikry forcing associated with
the measure 𝑗0𝜔 𝑈.
Example 4.2.11. Let 𝑐0 ∶ 𝜔1 × 𝜔 → 2 be a Cohen-generic map, and let 𝑐𝑛 = 𝑐0 ↾
𝜔1 × (𝜔 ⧵ 𝑛). Let 𝑀𝑛 = 𝑉[𝑐𝑛 ]. In the model 𝑀𝜔 = ⋂𝑛 𝑀𝑛 , the chromatic number of
𝔾0 is greater than 2; thus, the Axiom of Choice must fail in 𝑀𝜔 .
Proof. Work in 𝑉. For each number 𝑛 ∈ 𝜔, let 𝑃𝑛 be the poset of all finite func-
tions from 𝜔1 × (𝜔 ⧵ 𝑛) to 2 ordered by extension. Note that for each 𝑛 ∈ 𝜔 the map 𝑐𝑛 is
𝑃𝑛 -generic over 𝑉. For each ordinal 𝛼 ∈ 𝜔1 and a number 𝑛 ∈ 𝜔, let 𝑑𝛼𝑛 ̇ be a name for
the function defined by letting 𝑑𝛼𝑛 (𝑚) be 0 if 𝑚 ∈ 𝑛 and the unique value of 𝑝(𝛼, 𝑚)
for all conditions 𝑝 in the generic filter with the pair (𝛼, 𝑚) in their domain if 𝑚 ≥ 𝑛.
Note that 𝑑𝛼𝑛 is really a 𝑃𝑛 -name and it is forced to belong to the intersection model
𝑀𝜔 .
Now, let 𝑝 ∈ 𝑃 be a condition and 𝜎 be a name such that 𝑝 ⊩ 𝜎 ∶ 2𝜔 → 2 is
a function in 𝑀𝜔 ; we will find an ordinal 𝛼 ∈ 𝜔1 , a number 𝑛 ∈ 𝜔 and a condition
strengthening 𝑝 which forces 𝑑𝛼0 ̇ and 𝑑𝛼𝑛̇ to differ in an even number of entries if and
̇ ̇
only if 𝜎(𝑑𝛼0 ) ≠ 𝜎(𝑑𝛼𝑛 ). This cannot occur if 𝜎 is a coloring of 𝔾0 .
By a standard Δ-system argument, strengthening 𝑝 if necessary, we may find an
infinite set 𝑆 ⊂ 𝜔1 , conditions 𝑝𝛼 ∈ 𝑃 for 𝛼 ∈ 𝑆 and a number 𝑛 ∈ 𝜔 such that the
conditions 𝑝𝛼 for 𝛼 ∈ 𝑆 form a Δ-system with root 𝑝, dom(𝑝𝛼 ) ⊂ 𝜔1 × 𝑛 − 1, and each
𝑝𝛼 decides the value of 𝜎(𝑑𝛼0 ̇ ) to be some bit 𝑏𝛼 ∈ 2. Find a condition 𝑞 ≤ 𝑝 and a
𝑃𝑛 -name 𝜏 such that 𝑞 ⊩ 𝜎 = 𝜏; this is possible as 𝜎 is forced to belong to 𝑀𝜔 . Since
the set 𝑆 is infinite, it is possible to find an ordinal 𝛼 ∈ 𝑆 such that 𝑝𝛼 is compatible
with 𝑞. Find a condition 𝑟 ∈ 𝑃𝑛 such that 𝑟 ≤ 𝑞 ↾ 𝜔1 × (𝜔 ⧵ 𝑛) and 𝑟 decides the value
̇ ) to be some specific bit 𝑏 ∈ 2. Note that 𝑝𝛼 and 𝑟 are compatible in 𝑃, and the
of 𝜏(𝑑𝛼𝑛
pair ⟨𝛼, 𝑛 − 1⟩ does not belong to dom(𝑝𝛼 ∪ 𝑟). Thus, it is possible to strengthen the
condition 𝑝𝛼 ∪ 𝑟 to some 𝑠 ∈ 𝑃 such that {𝛼} × 𝑛 ⊂ dom(𝑠), and cardinality of the set
{𝑚 ∈ 𝑛 ∶ 𝑠(𝛼, 𝑚) = 1} is even if and only if 𝑏𝛼 ≠ 𝑏. This completes the proof. □
4.3. Choice-coherent sequences of models

In most of our examples, we will want to look at sequences of models which have
a greater degree of coherence. Certain constructions arising from the axiom of choice
will have to be performed in a coherent way. The following definition records the de-
mands:
Definition 4.3.1. Let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be an inclusion decreasing sequence of tran-
sitive models of ZFC. We say that the sequence is choice-coherent if it is coherent and
for every ordinal 𝜆 there is a well-ordering ≤𝜆 of 𝑉𝜆 ∩ 𝑀0 such that its intersection with
each model 𝑀𝑛 belongs to 𝑀𝑛 .
In the common case of generic coherent sequences, the choice-coherence can be de-
tected from the theory of the intersection model as follows:
Theorem 4.3.2. Suppose that ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a generic coherent sequence of generic
extensions of 𝑉. The following are equivalent:
(1) ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ is choice-coherent;
(2) 𝑀𝜔 = ⋂𝑛 𝑀𝑛 is a model of ZFC.
4.3. CHOICE-COHERENT SEQUENCES OF MODELS 97
Proof. For the (1)→(2) direction, assume the choice coherence. Let 𝜆 be any or-
dinal. In view of Theorem 4.2.9, we only need to produce a well-ordering ≤∗ of 𝑉𝜆 ∩ 𝑀𝜔
such that ≤∈ 𝑀𝜔 . Fix a wellordering ≤ witnessing the fact that ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a
choice-coherent decreasing sequence, and note that ≤∗ =≤ ∩𝑀𝜔 works as desired. The
genericity assumption is not needed for this direction.
For the (2)→(1) direction, that 𝑀𝜔 is a model of ZFC. Let 𝜆 be any ordinal. Let
𝜅 > 𝜆 be a cardinal such that each model 𝑀𝑛 is a generic extension of 𝑉 by a poset
of cardinality smaller than 𝜆. Let ≺ be a well-ordering of 𝑉𝜅 in 𝑉. By recursion on
𝑛 ∈ 𝜔 build a sequence ⟨𝑃𝑛 , 𝐺𝑛 , 𝜏𝑛 ∶ 𝑛 ∈ 𝜔⟩ such that 𝑃𝑛 is ≺-least poset in 𝑉 ∩ 𝑉𝜅
such that 𝑀𝑛 is 𝑃𝑛 -generic extension of 𝑉, 𝐺𝑛 ⊂ 𝑃𝑛 is a filter generic over 𝑉 such that
𝑀𝑛 = 𝑉[𝐺𝑛 ], 𝜏𝑛 is the ≺-least 𝑃𝑛 -name in 𝑉 such that 𝜏𝑛 /𝐺𝑛 ⊂ 𝑃𝑛+1 is a filter generic
over 𝑉 such that 𝑀𝑛+1 = 𝑉[𝜏𝑛 /𝐺𝑛 ], and 𝐺𝑛+1 = 𝜏𝑛 /𝐺𝑛 . It is not difficult to see that the
tail ⟨𝑃𝑛 , 𝐺𝑛 , 𝜏𝑛 ∶ 𝑛 ≥ 𝑚⟩ of the sequence can be recovered from 𝐺𝑚 , and therefore the
sequence is coherent.
Now, let ≤𝜆 be the following well-ordering of 𝑉𝜆 ∩ 𝑀0 : first come the elements of
𝑉𝜆 ∩ 𝑀𝜔 , then the elements of 𝑉𝜆 ∩ 𝑀0 ⧵ 𝑀1 , and then the elements of 𝑉𝜆 ∩ 𝑀𝑛 ⧵ 𝑀𝑛+1
in turn. The elements of 𝑉𝜆 ∩ 𝑀𝜔 are ordered by some well-ordering in 𝑀𝜔 which is
available as 𝑀𝜔 is a model of ZFC. The elements of 𝑀𝑛 ⧵ 𝑀𝑛+1 are ordered by 𝜎𝑛 /𝐺𝑛
where 𝜎𝑛 is the ≺-least name in 𝑉 ∩ 𝑉𝜅 such that 𝜎𝑛 /𝐺𝑛 is a well-ordering of 𝑉𝜆 ∩ 𝑀𝑛 . It
is not difficult to see that ≤𝜆 is a well-ordering of 𝑉𝜆 ∩ 𝑀0 and ≤𝜆 ∩𝑀𝑛 ∈ 𝑀𝑛 holds for
all 𝑛 ∈ 𝜔. □
Most examples of choice-coherent sequences are generic and obtained from the triv-
ial one ⟨𝑀𝑛 = 𝑉 ∶ 𝑛 ∈ 𝜔⟩ by a coherent forcing which satisfies a certain degree of
completeness.
Definition 4.3.3. Let ⟨𝑃𝑛 , 𝜋𝑛𝑚 , 𝜉𝑚𝑛 ∶ 𝑛 ≤ 𝑚 ∈ 𝜔⟩ be a commutative system of

projections from posets 𝑃𝑛 to 𝑃𝑚 for 𝑛 ≤ 𝑚.
(1) The diagonal game is the following infinite game between Players I and II,
in round 𝑛 Player I plays 𝑝𝑛 ∈ 𝑃𝑛 and Player II responds by 𝑞𝑛 ≤ 𝑝𝑛 . Addi-
tionally, 𝑝𝑛+1 ≤ 𝜋𝑛𝑛+1 (𝑞𝑛 ). In the end, Player II wins if there is a condition
𝑟 ∈ 𝑃0 such that 𝜋0𝑛 (𝑟) ≤ 𝑞𝑛 holds for all 𝑛 ∈ 𝜔.
(2) The sequence is diagonally distributive if Player I has no winning strategy in
the diagonal game.
Example 4.3.4. Suppose that ⟨𝑄𝑚 ∶ 𝑚 ∈ 𝜔⟩ are arbitrary posets, and let 𝑃𝑛 =
∏𝑚≥𝑛 𝑄𝑚 be the countable support product with the natural projection maps from 𝑃𝑛
to 𝑃𝑚 for 𝑛 ≤ 𝑚. Player II has a simple winning strategy in the diagonal game in this
setup: set 𝑞𝑛 = 𝑝𝑛 .
Theorem 4.3.5. Let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a choice-coherent sequence of models of ZFC.

Let ⟨𝑃𝑛 , 𝜋𝑛𝑚 , 𝜉𝑚𝑛 ∶ 𝑛 ≤ 𝑚 ∈ 𝜔⟩ be a coherent sequence of posets which is diagonally
−1
distributive in 𝑀0 . Let 𝐺 ⊂ 𝑃0 be a filter generic over 𝑀0 , and let 𝐺𝑛 = 𝜉𝑛0 𝐺. Then
(1) the sequence ⟨𝑀𝑛 [𝐺𝑛 ] ∶ 𝑛 ∈ 𝜔⟩ is choice-coherent;
(2) the models ⋂𝑛 𝑀𝑛 and ⋂𝑛 𝑀𝑛 [𝐺𝑛 ] contain the same 𝜔-sequences of ordinals.
Proof. Write 𝑀𝜔 = ⋂𝑛 𝑀𝑛 . We start with (1). The main task is to find a poset
𝑃𝜔 ∈ 𝑀𝜔 and a filter 𝐺𝜔 ⊂ 𝑃𝜔 generic over 𝑀𝜔 such that ⋂𝑛 𝑀𝑛 [𝐺𝑛 ] = 𝑀𝜔 [𝐺𝜔 ].
Using the choice coherence of the original sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩, we may assume
that there is a sequence ⟨𝛼𝑛 ∶ 𝑛 ∈ 𝜔⟩ such that the underlying set of each poset 𝑃𝑛
is exactly 𝛼𝑛 . For each condition 𝑝 ∈ 𝑃0 , the ordinal 𝜔-sequence ⟨𝜋0𝑛 (𝑝) ∶ 𝑛 ∈ 𝜔⟩
belongs to 𝑀𝜔 , since for each number 𝑘 ∈ 𝜔, the tail ⟨𝜋0𝑛 (𝑝) ∶ 𝑛 ≥ 𝑘⟩ is reconstructed
as ⟨𝜋𝑘𝑛 (𝜋0𝑘 (𝑝)) ∶ 𝑛 ≥ 𝑘⟩ in the model 𝑀𝑘 . Similarly, the set 𝑃𝜔 = {𝑞 ∈ ∏𝑛 𝑃𝑛 ∶ ∃𝑘 ∈
𝜔 ∀𝑛 ≥ 𝑘 𝑞(𝑛) = 𝜋𝑘𝑛 (𝑞(𝑘))} belongs to the model 𝑀𝜔 . For elements 𝑞0 , 𝑞1 ∈ 𝑃𝜔 let
𝑞1 ≤ 𝑞0 if for all but finitely many numbers 𝑛 ∈ 𝜔, 𝑞1 (𝑛) ≤ 𝑞0 (𝑛) in the poset 𝑃𝑛 , and
conclude that the poset ⟨𝑃𝜔 , ≤⟩ belongs to the model 𝑀𝜔 .
Define a function 𝜋0𝜔 ∶ 𝑃0 → 𝑃𝜔 by 𝜋0𝜔 (𝑝) = 𝑞 where 𝑞(𝑛) = 𝜋0𝑛 (𝑝), and a func-
tion 𝜉𝜔0 ∶ 𝑃𝜔 → 𝑃0 by 𝜉𝜔0 (𝑞) = 𝜉𝑘0 (𝑞(𝑘)) where 𝑘 ∈ 𝜔 is such that for all 𝑛 ≥ 𝑘,
𝜋𝑘𝑛 (𝑞(𝑘)) = 𝑞(𝑛). One can also similarly define maps 𝜋𝑛𝜔 ∶ 𝑃𝑛 → 𝑃𝜔 and 𝜉𝜔𝑛 ∶ 𝑃𝜔 → 𝑃𝑛 .
It is a matter of trivial diagram chasing to show that the maps form a commuting system
−1
of projections from 𝑃𝑛 to 𝑃𝜔 and moreover 𝜋𝑛𝜔 , 𝜉𝜔𝑛 ∈ 𝑀𝑛 . Thus, letting 𝐺𝜔 = 𝜉𝜔0 𝐺0 ,
one can conclude that 𝐺𝜔 ⊂ 𝑃𝜔 is a filter generic over 𝑀0 and therefore over 𝑀𝜔 . Also
−1
𝐺𝜔 ∈ ⋂𝑛 𝑀𝑛 [𝐺𝑛 ] since 𝐺𝜔 can be reconstructed in 𝑀𝑛 [𝐺𝑛 ] as 𝐺𝜔 = 𝜉𝜔𝑛 𝐺𝑛 . In conclu-
sion, 𝐺𝜔 ∈ ⋂𝑛 𝑀𝑛 [𝐺𝑛 ].
Finally, we have to prove that every element of the intersection ⋂𝑛 𝑀𝑛 [𝐺𝑛 ] belongs
to 𝑀𝜔 [𝐺𝜔 ]. This is where the diagonal distributivity of the original poset sequence is
used. Suppose that 𝜏 ∈ 𝑀0 is a 𝑃0 -name for a set of ordinals and 𝑝 ∈ 𝑃0 is a condition
forcing 𝜏 ∈ ⋂𝑛 𝑀𝑛 [𝐺𝑛 ]; we must produce a condition 𝑝′ ≤ 𝑝 and a 𝑃𝜔 -name 𝜏𝜔 ∈ 𝑀𝜔
such that 𝑝′ ⊩ 𝜏 = 𝜏𝜔 /𝐺𝜔 . Consider a strategy by Player I in the diagonalization game
in which he plays 𝑝𝑛 so that 𝑝0 ≤ 𝑝, 𝜏0 = 𝜏, and there is a 𝑃𝑛+1 -name 𝜏𝑛+1 ∈ 𝑀𝑛+1 such
that 𝑝𝑛 ⊩𝑃𝑛 𝜏𝑛 = 𝜏𝑛+1 /𝐺𝑛+1 . This is possible by the assumption on the name 𝜏. By
the diagonalization assumption, Player II has a counterplay with conditions 𝑞𝑛 ≤ 𝑝𝑛
such that there is a condition 𝑝′ ≤ 𝑝 for which 𝜋0𝑛 (𝑝) ≤ 𝑞𝑛 for all 𝑛 ∈ 𝜔. Let 𝜏𝜔 be the
𝑃𝜔 ↾ 𝜋0𝜔 (𝑝′ )-name defined by 𝑞 ⊩ 𝛼̌ ∈ 𝜏𝜔 just in case 𝜉𝜔0 (𝑞) ⊩𝑃0 𝛼̌ ∈ 𝜏. The name
𝜏𝜔 can be reconstructed in every model 𝑀𝑛 by the definition 𝑞 ⊩ 𝛼̌ ∈ 𝜏𝜔 just in case
𝜉𝜔𝑛 (𝑞) ⊩𝑃𝑛 𝛼̌ ∈ 𝜏𝑛 by the choice of the strategy for Player I in the diagonalization game.
As a result, 𝜏𝜔 ∈ 𝑀𝜔 . It is immediate from the definition of 𝜏𝜔 that 𝑝′ ⊩ 𝜏 = 𝜏𝜔 /𝐺𝜔 as
desired.
Now we are ready to construct the requisite well-orderings verifying the choice-
coherence of the models ⟨𝑀𝑛 [𝐺𝑛 ] ∶ 𝑛 ∈ 𝜔⟩. Let 𝜆 be an ordinal larger than the ranks
of all the posets 𝑃𝑛 for 𝑛 ∈ 𝜔. Let ≤ be a coherent well-ordering of 𝑉𝜆 ∩ 𝑀0 . We will
now describe a coherent well-ordering ≤′ of sets of rank < 𝜆 in the model 𝑀0 [𝐺0 ]. In
this well-ordering, the sets in 𝑀𝜔 [𝐺𝜔 ] come first, ordered by some well-ordering in the
model 𝑀𝜔 [𝐺𝜔 ]. The sets in 𝑀0 [𝐺0 ] ⧵ 𝑀1 [𝐺1 ] come next, well-ordered by their ≤-first
𝑃0 -name in the model 𝑀0 representing them. The sets in 𝑀1 [𝐺1 ] ⧵ 𝑀2 [𝐺2 ] come next
with a similar well-order, and so on. The coherence of the resulting well-ordering ≤′
is due to the fact that for each 𝑘 ∈ 𝜔, the sequence ⟨𝐺𝑛 ∶ 𝑛 ≥ 𝑘⟩ belongs to the model
𝑀𝑘 [𝐺𝑘 ].
(2) is much easier. Suppose that 𝜏 ∈ 𝑀0 is a 𝑃0 -name for an 𝜔-sequence of ordinals
in the model 𝑀𝜔 [𝐺𝜔 ] and 𝑝 ∈ 𝑃0 is a condition; we must find a condition 𝑟 ≤ 𝑝 and
an 𝜔-sequence 𝑧 ∈ 𝑀𝜔 such that 𝑟 ⊩ 𝜏 = 𝑧.̌ Consider a strategy for Player I in the
diagonal game in which he plays conditions 𝑝𝑛 ∈ 𝑃𝑛 and on the side produces 𝑃𝑛 -
names 𝜏𝑛 ∈ 𝑀𝑛 so that 𝑝0 ≤ 𝑝, 𝜏0 = 𝜏 and 𝑝𝑛 ⊩𝑃𝑛 𝜏𝑛 = 𝜏𝑛+1 evaluated by the
𝜋𝑛𝑛+1 -image of the generic filter on 𝑃𝑛 , and also 𝑝𝑛 decides the value 𝜏𝑛 (𝑛) to be some
ordinal 𝑧(𝑛). The assumptions on the name 𝜏 shows that this is a valid strategy. The
initial assumptions on the coherent sequence of posets show that this is not a winning
strategy, so there must be a play against it such that in the end there is a condition
𝑟 ≤ 𝑝 with 𝜋0𝑛 (𝑟) ≤ 𝑝𝑛 for all 𝑛 ∈ 𝜔. Let 𝜏𝑛 ∈ 𝑀𝑛 be the names produced during that
counterplay, and let 𝑧 be the 𝜔-sequence of ordinals obtained. The definitions show
that for all 𝑛 ∈ 𝜔, 𝜋0𝑛 (𝑟) ⊩𝑃𝑛 𝜏𝑛 = 𝑧.̌ It follows that 𝑧 ∈ 𝑀𝑛 for all 𝑛 ∈ 𝜔, and
therefore 𝑟, 𝑧 are as required in (2). □
The main feature of choice-coherent sequences of models we use later is the fol-
lowing theorem connecting them with orbit equivalence relations:
Theorem 4.3.6. Let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a generic choice-coherent sequence of models.
Let 𝐸 be an orbit equivalence relation on a Polish space 𝑋 with code in 𝑀𝜔 = ⋂𝑛 𝑀𝑛 . If
a virtual 𝐸-class is represented in 𝑀𝑛 for every 𝑛 ∈ 𝜔, then it is represented in 𝑀𝜔 .
Note that a virtual 𝐸-class is an equivalence class of 𝐸-pins. Thus, the theorem says
that if there are pairwise equivalent 𝐸-pins ⟨𝑃𝑛 , 𝜏𝑛 ⟩ ∈ 𝑀𝑛 for all 𝑛 ∈ 𝜔, then there is an
𝐸-pin equivalent to them in the intersection model.
Proof. Let Γ be a Polish group continuously acting on the space 𝑋, inducing the
equivalence relation 𝐸. Let 𝑑 be a compatible right-invariant metric on Γ. Let ⟨𝑃0 , 𝜏0 ⟩ ∈
𝑀0 be an 𝐸-pin which has an equivalent in the model 𝑀𝑛 for every 𝑛 ∈ 𝜔. Let 𝜆 be
a cardinal so large that for each 𝑛 ∈ 𝜔, 𝑀0 is a generic extension of 𝑀𝑛 by a poset of
cardinality smaller than 𝜆, and 𝑀𝑛 contains an 𝐸-pin on a poset of cardinality smaller
than 𝜆 equivalent to the pin ⟨𝑃0 , 𝜏0 ⟩.
Let 𝑃Γ be Cohen forcing on the Polish group Γ, with its name 𝛾gen ̇ for the generic
point. Let 𝛾 ∈ Γ be a Cohen-generic point, 𝐻 ⊂ 𝑃0 be a generic filter and 𝐾 ⊂ Coll(𝜔, 𝜆)
be a generic filter, mutually generic over 𝑀0 ; let 𝑥0 = 𝜏0 /𝐻. In the model 𝑀0 [𝛾, 𝐻, 𝐾],
form the model 𝑁 as the class of all sets hereditarily definable from 𝛾⋅𝑥0 and parameters
in 𝑀𝜔 . The model 𝑁 is an intermediate model of ZFC between 𝑀𝜔 and 𝑀0 [𝛾, 𝐻], so by
Fact 1.7.7, the model 𝑁 is a forcing extension of 𝑀𝜔 . We will argue that 𝑁 and 𝑀0 [𝐻]
are mutually generic extensions of 𝑀𝜔 .
First note that this will prove the theorem. Let 𝑄, 𝜏 ∈ 𝑀𝜔 be a poset and a name
and 𝐿 ⊂ 𝑄 be a filter generic over the model 𝑀0 [𝐻] such that 𝑀𝜔 [𝐿] = 𝑁 and 𝜏/𝐿 =
𝛾 ⋅ 𝑥0 . By the forcing theorem in the model 𝑀0 , there have to be conditions 𝑝 ∈ 𝐻 and
𝑞 ∈ 𝐿 such that ⟨𝑝, 𝑞⟩ ⊩ 𝜏0 𝐸 𝜏. It is immediate that 𝜏 as a name on 𝑄 ↾ 𝑞 is 𝐸-pinned,
and the 𝐸-pin ⟨𝑄 ↾ 𝑞, 𝜏⟩ is equivalent to ⟨𝑃0 , 𝜏0 ⟩. This confirms the conclusion of the
theorem.
To argue that 𝑁 and 𝑀0 [𝐻] are mutually generic extensions of 𝑀𝜔 , we use the
criterion of Proposition 1.7.9. In other words, if 𝑎 ∈ 𝑀0 [𝐻] and 𝑏 ∈ 𝑁 are disjoint
subsets of some ordinal 𝜅, we must find a set 𝑐 ∈ 𝑀𝜔 of ordinals such that 𝑎 ⊂ 𝑐
and 𝑏 ∩ 𝑐 = 0. Towards this end, move back to the model 𝑀0 . Suppose that 𝑂 ⊂ Γ
is a nonempty open set, 𝑝 ∈ 𝑃0 is a condition, 𝑎̇ is a 𝑃0 -name for a set of ordinals,
and 𝜙 is a formula with parameters in 𝑀𝜔 such that in the poset 𝑃Γ × 𝑃0 , ⟨𝑂, 𝑝⟩ ⊩
Coll(𝜔, 𝜆) ⊩ ∀𝛽 ∈ 𝑎̇ 𝜙(𝛽, 𝛾geṅ ⋅ 𝜏0 ) holds. Due to the definition of the model 𝑁, it will
be enough to find a set 𝑐 ∈ 𝑀𝜔 and a condition ⟨𝑂′ , 𝑝′ ⟩ ≤ ⟨𝑂, 𝑝⟩ which forces 𝑎̇ ⊂ 𝑐 ̌
and Coll(𝜔, 𝜆) ⊩ ∀𝛽 ∈ 𝑐 ̌ 𝜙(𝛽, 𝛾gen
̇ ⋅ 𝜏0 ) holds.
Finally, we are in a position to use some coherence arguments. Let ≺ be a coherent
well-ordering of 𝑀0 ∩𝑉𝜆 ; i.e. such that the restriction of ≺ to each 𝑀𝑛 belongs to 𝑀𝑛 . We
will use the ordering to perform some coherent constructions. A typical construction of
a coherent sequence (in the sense of Definition 4.2.1) proceeds by induction on 𝑛 ∈ 𝜔.
If ⟨𝑣𝑛 ∶ 𝑛 ∈ 𝜔⟩ is coherent, 𝑤0 ∈ 𝑀0 , and 𝜙 is some formula with parameters in 𝑀𝜔 ,
one can select the ≺-least 𝑤𝑛+1 ∈ 𝑀𝑛+1 such that 𝑀𝑛 ⊧ 𝜙(𝑣𝑛 , 𝑤𝑛 , 𝑤𝑛+1 ) if it exists;
then, the sequence ⟨𝑤𝑛 ∶ 𝑛 ∈ 𝜔⟩ is coherent. The routine details of these constructions
will be suppressed below.
Find a coherent sequence ⟨𝑃𝑛 , 𝜏𝑛 ∶ 𝑛 ∈ 𝜔⟩ of pairwise equivalent 𝐸-pins on posets
in 𝑉𝜆 starting with ⟨𝑃0 , 𝜏0 ⟩; i.e. for every number 𝑛 ∈ 𝜔 it is the case that 𝑃𝑛 × 𝑃𝑛+1 ⊩
𝜎𝑛 𝐸 𝜎𝑛+1 . Find a coherent sequence ⟨𝛾𝑛̇ ∶ 𝑛 ∈ 𝜔⟩ such that for each 𝑛 ∈ 𝜔, 𝛾𝑛̇ is a
𝑃𝑛 × 𝑃𝑛+1 -name for an element of the group Γ such that 𝜏𝑛 = 𝛾𝑛̇ ⋅ 𝜏𝑛+1 . Let 𝐷 ⊂ Γ be
a fixed countable dense set in the model 𝑀𝜔 , and let 𝛿0 ∈ 𝐷 and 𝜀 > 0 be such that
the open 𝑑-ball 𝐵(𝛿0 , 𝜀) ⊂ Γ is a subset of the open set 𝑂. Find a coherent sequence
⟨𝑝𝑛 , 𝛿𝑛 ∶ 𝑛 ∈ 𝜔⟩ such that 𝑝0 ≤ 𝑝, 𝑝𝑛 ∈ 𝑃𝑛 , 𝛿𝑛 ∈ 𝐷, and in the poset 𝑃𝑛 × 𝑃𝑛+1 ,
⟨𝑝𝑛 , 𝑝𝑛+1 ⟩ ⊩ 𝑑(𝛿𝑛 ⋅ 𝛾𝑛̇ , 𝛿𝑛+1 ) < 𝜀 ⋅ 2−𝑛−3 . Let 𝑂𝑛 = 𝐵(𝛿𝑛 , 𝜀/2). The point of these
definitions is the following claim:
Claim 4.3.7. Let 𝑛 > 0. The condition ⟨𝑝𝑖 ∶ 𝑖 ≤ 𝑛⟩ forces in the product ∏𝑖≤𝑛 𝑃𝑖 the
following:
(1) 𝑂𝑛 ⊂ 𝐵(𝛿0 , 𝜀) ⋅ 𝛾0̇ 𝛾1̇ . . . 𝛾𝑛−1
̇ ;
(2) 𝐵(𝛿0 , 𝜀/4) ⋅ 𝛾0̇ 𝛾1̇ . . . 𝛾𝑛−1
̇ ⊂ 𝑂𝑛 .
Proof. Use the right invariance of the metric 𝑑 to argue by induction on 𝑖 ∈

𝑛 that 𝑑(𝛿𝑖+1 , 𝛿0 𝛾0̇ 𝛾1̇ . . . 𝛾𝑖̇ ) is forced to be smaller than 𝜀 ⋅ Σ𝑗≤𝑖 2−𝑗−3 . In conclusion,
𝑑(𝛿𝑛 , 𝛿0 𝛾0̇ 𝛾1̇ . . . 𝛾𝑛−1
̇ ) is forced to be smaller than 𝜀/4. The two items then follow imme-
diately by the right invariance of the metric 𝑑 again. □
Now, for every number 𝑛 ∈ 𝜔, in the model 𝑀𝑛 form the set 𝑐𝑛 = {𝛽 ∈ 𝜅 ∶ in the
poset 𝑃Γ × 𝑃𝑛 , ⟨𝑂𝑛 , 𝑝𝑛 ⟩ ⊩ Coll(𝜔, 𝜆) ⊩ 𝜙(𝛽,̌ 𝛾gen
̇ ⋅ 𝜏𝑛 )}. Finally, let 𝑐 = lim sup𝑛 𝑐𝑛 =
{𝛽 ∈ 𝜅 ∶ ∃∞ 𝑛 𝛽 ∈ 𝑐𝑛 }. It is immediate that the sequence ⟨𝑐𝑛 ∶ 𝑛 ∈ 𝜔⟩ is coherent and
therefore the set 𝑐 belongs to the model 𝑀𝜔 . Let 𝑂′ = 𝐵(𝛿0 , 𝜀/4) and 𝑝′ = 𝑝0 . The
following two claims stated in the model 𝑀0 complete the proof of the theorem.
Claim 4.3.8. In the poset 𝑃0 , 𝑝′ ⊩ 𝑎̇ ⊂ 𝑐.̌
Proof. Let 𝑝″ ≤ 𝑝′ be a condition and 𝛽 ∈ 𝜅 an ordinal such that 𝑝″ ⊩ 𝛽 ̌ ∈ 𝑎.̇

It will be enough to show that for all 𝑛 > 0, 𝛽 ∈ 𝑐𝑛 . To this end, fix a number 𝑛 > 0
and let ⟨𝐻𝑖 ∶ 𝑖 ≤ 𝑛⟩ be a tuple of filters on the respective posets 𝑃𝑖 mutually generic
over the model 𝑀0 such that 𝑝𝑖 ∈ 𝐻𝑖 and moreover 𝑝″ ∈ 𝐻0 . Write 𝑥𝑖 = 𝜏𝑖 /𝐻𝑖 and
𝛾𝑖 = 𝛾𝑖̇ /𝐻𝑖 , 𝐻𝑖+1 ; so 𝑥0 = 𝛾0 𝛾1 . . . 𝛾𝑛−1 𝑥𝑛 .
−1 −1
Let 𝛾 ∈ 𝑂𝑛 be a point 𝑃Γ -generic over the model 𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛]. Let 𝛾′ = 𝛾𝛾𝑛−1 𝛾𝑛−2
−1 ′
. . . 𝛾0 . By the invariance of the meager ideal on Γ under right translations, 𝛾 ∈ Γ is a
point Cohen generic over the model 𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛]. By Claim 4.3.7(1), 𝛾′ ∈ 𝐵(𝛿0 , 𝜀) ⊂
𝑂; moreover, 𝛾 ⋅ 𝑥𝑛 = 𝛾′ ⋅ 𝑥0 .
Let 𝐾 ⊂ Coll(𝜔, 𝜆) be a filter generic over the model 𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛][𝛾]. The model
𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛][𝛾][𝐾] is a Coll(𝜔, 𝜆)-extension of both 𝑀0 [𝛾′ , 𝐻0 ] and 𝑀𝑛 [𝛾, 𝐻𝑛 ] by the
choice of 𝜆 and Fact 1.7.14. By the forcing theorem in the model 𝑀0 and the initial
assumptions on the name 𝑎̇ and the formula 𝜙, 𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛][𝛾][𝐾] ⊧ 𝜙(𝛽, 𝛾′ ⋅ 𝑥0 ). By
the forcing theorem in the model 𝑀𝑛 , the filter on 𝑃Γ × 𝑃𝑛 given by 𝛾, 𝐻𝑛 must contain
a condition forcing Coll(𝜔, 𝜆) ⊩ 𝜙(𝛽,̌ 𝛾 ⋅ 𝜏𝑛 ). However, 𝛾, 𝐻𝑛 were arbitrary gener-

ics meeting the condition ⟨𝑂𝑛 , 𝑝𝑛 ⟩, so it must be the case that this condition forces
Coll(𝜔, 𝜆) ⊩ 𝜙(𝛽,̌ 𝛾gen
̇ ⋅ 𝜏𝑛 ). This means that 𝛽 ∈ 𝑐𝑛 as required. □
Claim 4.3.9. In the poset 𝑃Γ × 𝑃0 , for every ordinal 𝛽 ∈ 𝑐, the condition ⟨𝑂′ , 𝑝′ ⟩ forces
Coll(𝜔, 𝜆) ⊩ 𝜙(𝛽,̌ 𝛾 ̇ ⋅ 𝜏0 ).
Proof. Find a number 𝑛 > 0 such that 𝛽 ∈ 𝑐𝑛 . Let 𝐻𝑖 ⊂ 𝑃𝑖 for 𝑖 ≤ 𝑛 be filters
mutually generic over 𝑀0 containing the conditions 𝑝𝑖 respectively, with 𝑝′ ∈ 𝐻0 .
Write 𝑥𝑖 = 𝜏𝑖 /𝐻𝑖 and 𝛾𝑖 = 𝛾𝑖̇ /𝐻𝑖 , 𝐻𝑖+1 ; so 𝑥0 = 𝛾0 𝛾1 . . . 𝛾𝑛−1 𝑥𝑛 .
Let 𝛾′ ∈ 𝑂′ be a point 𝑃Γ -generic over the model 𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛]. Let 𝛾 = 𝛾′ 𝛾0 𝛾1 ⋅
𝛾𝑛−1 ; by the invariance of the meager ideal on Γ under right translations, 𝛾 ∈ Γ is a point
Cohen generic over the model 𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛]. By Claim 4.3.7(2), 𝛾 ∈ 𝑂𝑛 ; moreover,
𝛾 ⋅ 𝑥 𝑛 = 𝛾 ′ ⋅ 𝑥0 .
Let 𝐾 ⊂ Coll(𝜔, 𝜆) be a filter generic over the model 𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛][𝛾]. The model
𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛][𝛾′ ][𝐾] is a Coll(𝜔, 𝜆)-extension of both 𝑀0 [𝛾′ , 𝐻0 ] and 𝑀𝑛 [𝛾, 𝐻𝑛 ] by
Fact 1.7.14. By the forcing theorem in the model 𝑀𝑛 and the definition of the set 𝑐𝑛 ,
𝑀0 [𝐻𝑖 ∶ 𝑖 ≤ 𝑛][𝛾′ ][𝐾] ⊧ 𝜙(𝛽, 𝛾 ⋅ 𝑥𝑛 ). By the forcing theorem in the model 𝑀0 , the filter
on 𝑃Γ × 𝑃0 given by 𝛾′ , 𝐻𝑛 must contain a condition forcing Coll(𝜔, 𝜆) ⊩ 𝜙(𝛽,̌ 𝛾gen
̇ ⋅ 𝜏0 ).
However, 𝛾′ , 𝐻0 were arbitrary meeting the condition ⟨𝑂′ , 𝑝′ ⟩, so it must be the case
that this condition forces Coll(𝜔, 𝜆) ⊩ 𝜙(𝛽,̌ 𝛾gen ̇ ⋅ 𝜏𝑛 ) as required. □
□
Example 4.3.10. Consider the equivalence relation 𝔼1 on 𝑋 = (2𝜔 )𝜔 ; it is well-
known not to be reducible to any orbit equivalence relation [54, Theorem 11.8.1]. The
conclusion of Theorem 4.3.6 fails for 𝔼1 . To see this, choose any partial order 𝑄 which
adds a new point 𝑦 ̇ ∈ 2𝜔 . Let 𝑃 be the full support product of 𝜔-many copies of 𝑄,
and let 𝑃𝑛 be the product of the copies of the copies of 𝑄 indexed by natural numbers
≥ 𝑛. The posets 𝑃𝑛 for 𝑛 ∈ 𝜔 naturally form a coherent sequence. Let 𝐺 ⊂ 𝑃 be a
generic filter, and for each 𝑛 ∈ 𝜔 let 𝐺𝑛 ⊂ 𝑃𝑛 be the restriction of 𝐺 to conditions in 𝑃𝑛 .
Theorem 4.3.5 shows that ⟨𝑉[𝐺𝑛 ] ∶ 𝑛 ∈ 𝜔⟩ is a choice-coherent sequence of models,
and that ⋂𝑛 𝑉[𝐺𝑛 ] contains no new reals compared to 𝑉. In 𝑉[𝐺𝑛 ], let 𝑥𝑛 ∈ 𝑋 be the
sequence defined by letting 𝑥𝑛 (𝑚) be the zero sequence if 𝑚 ∈ 𝑛 and the evaluation of
𝑦 ̇ by the 𝑛-th coordinate of the generic filter 𝐺 otherwise. It is clear that the points 𝑥𝑛 all
represent the same 𝔼1 -class, which is not represented in 𝑉 and therefore in ⋂𝑛 𝑉[𝐺𝑛 ].
As a final remark, in general it is necessary to consider virtual 𝐸-classes as opposed
to just 𝐸-classes in the statement of Theorem 4.3.6. To see this, start with the trivial
coherent sequence ⟨𝑀𝑛 = 𝑉 ∶ 𝑛 ∈ 𝜔⟩ and let 𝑃𝑛 be the countable support product
of copies of the poset Coll(𝜔, 2𝜔 ) indexed by natural numbers ≥ 𝑛, with the natural
projections from 𝑃𝑛 to 𝑃𝑚 added. This is a diagonally complete sequence of posets as in
Example 4.3.4, and by Theorem 4.2.8 it induces a choice-coherent sequence of models
⟨𝑀𝑛 [𝐺𝑛 ] ∶ 𝑛 ∈ 𝜔⟩ such that the model ⋂𝑛 𝑀𝑛 [𝐺𝑛 ] contains only ground model 𝜔-
sequences of ordinals. Now, every model 𝑀𝑛 [𝐺𝑛 ] contains an enumeration of the set
(2𝜔 ∩ 𝑉) by natural numbers, and all of these enumerations are 𝔽2 -related. Clearly,
there is no 𝔽2 -equivalent of them in the intersection model. Yet, there is a virtual 𝔽2 -
class related to these enumerations in the intersection model, and even in the ground
model 𝑉.
Part II
Balanced extensions
of the Solovay model
CHAPTER 5
Balanced Suslin forcing
5.1. Virtual conditions

We look at the class of Suslin forcings from an angle quite distinct from the stan-
dard treatment in [7]; in particular, the center of attention is on 𝜎-closed Suslin forcings
as opposed to c.c.c. or proper forcings adding reals. Recall that a preorder on a set is
just a binary transitive relation containing the diagonal on the set, and define:
Definition 5.1.1. A Suslin forcing is a preorder ⟨𝑃, ≤⟩ for which there is a Polish
space 𝑋 so that:
(1) 𝑃 is an analytic subset of 𝑋;
(2) the preorder relation ≤ is an analytic subset of 𝑋 2 ;
(3) the incompatibility relation {⟨𝑝0 , 𝑝1 ⟩ ∈ 𝑃 ∶ ∀𝑞 ∈ 𝑃 𝑞 ≰ 𝑝0 ∨ 𝑞 ≰ 𝑝1 } is an
analytic subset of 𝑋 2 .
There are two points regarding the terminology. We do not require a Suslin forcing to
be a partial order. That is, it does not have to satisfy the property 𝑝0 ≤ 𝑝1 ∧ 𝑝1 ≤ 𝑝0 →
𝑝0 = 𝑝1 . In fact, most Suslin forcings we use are preorders and probably cannot be
presented as Suslin partial orders. The associated preorder equivalence relation on 𝑃
connecting 𝑝0 with 𝑝1 if 𝑝0 ≤ 𝑝1 and 𝑝1 ≤ 𝑝0 , which is normally used to quotient out
a preorder to a partial order, may not be smooth or even pinned. In a nod to standard
usage, we still speak about posets, partial orderings etc. even in cases where the Suslin
presentation of the forcing is merely a preorder; no confusion can result.
Example 5.1.2. Consider the forcing 𝑃 of countable partial functions from 2𝜔 to 2

with the relation of reverse extension. As stated, it is not a Suslin forcing, since it is not
an analytic subset of a Polish space. To present it as a Suslin forcing, one has to make
an innocuous adjustment: 𝑃 is in fact the set of all functions from 𝜔 to 2𝜔 × 2 whose
range is a function, and order 𝑃 by setting 𝑞 ≤ 𝑝 if rng(𝑝) ⊆ rng(𝑞). This adjustment
results in a preorder as opposed to a partial order. Note that the associated preorder
equivalence relation is unpinned and bi-reducible with 𝔽2 in this case. Adjustments of
this type are performed in the book without mention.
We also do not require Suslin forcings to be separative. Recall that conditions 𝑝0 , 𝑝1 ∈

𝑃 are called inseparable if for every condition 𝑞 ≤ 𝑝0 , 𝑞 and 𝑝1 have a lower bound, and
vice versa, for every condition 𝑞 ≤ 𝑝1 , 𝑞 and 𝑝0 have a lower bound. The inseparability
relation is an equivalence. A preorder 𝑃 is separative if this equivalence relation is
the identity [51, Definition 14.8]. Again, a Suslin forcing may be presented as a Suslin
partial order, but not as a separative partial order, simply because the inseparability
equivalence relation is not smooth.
105
106 5. BALANCED SUSLIN FORCING
Example 5.1.3. Consider the forcing 𝑃 of infinite subsets of 𝜔 with the relation
of inclusion. This is a Suslin preorder which is in fact an ordering, but not a separa-
tive ordering. The inseparability equivalence relation is the modulo finite equality of
infinite subsets of 𝜔, which is bi-reducible with 𝔼0 .
In order to develop the theory of balanced forcing in full generality, we have to discuss
definable points in the completion of a Suslin forcing 𝑃.
Definition 5.1.4. Let ⟨𝑃, ≤⟩ be a Suslin forcing and let 𝐴0 , 𝐴1 ⊂ 𝑃 be analytic sets.
(1) We write Σ𝐴1 ≤ Σ𝐴0 for the statement ∀𝑝 ∈ 𝑃 ∀𝑝1 ∈ 𝐴1 𝑝 ≤ 𝑝1 → ∃𝑞 ≤
𝑝 ∃𝑝0 ∈ 𝐴0 𝑞 ≤ 𝑝0 . If 𝑝 ∈ 𝑃 then Σ𝐴1 ≤ 𝑝 stands for Σ𝐴1 ≤ Σ{𝑝};
(2) we also write Σ𝐴0 = Σ𝐴1 for the conjunction of Σ𝐴1 ≤ Σ𝐴0 and Σ𝐴0 ≤ Σ𝐴1 .
It is not difficult to see that the relation ≤ on analytic sets defined in this way is a
partial ordering. The notation suggests an interpretation of the ordering in the Boolean
completion [51, Corollary 14.12] of the separative quotient of 𝑃: Σ𝐴1 ≤ Σ𝐴0 holds just
in case the supremum of 𝐴1 is below the supremum of 𝐴0 in the completion. We will
have no opportunity to use the completion per se or the comparison of suprema of sets
which are not analytic. The following simple absoluteness fact will be used throughout
the book without mention.
Proposition 5.1.5. Let ⟨𝑃, ≤⟩ be a Suslin forcing. Let 𝐴0 , 𝐴1 ⊂ 𝑃 be analytic sets.
The statement Σ𝐴1 ≤ Σ𝐴0 has the same truth value in all forcing extensions.
Proof. The statement Σ𝐴1 ≤ Σ𝐴0 is defined as ∀𝑝 ∈ 𝑃 ∀𝑝1 ∈ 𝐴1 𝑝 ≤ 𝑝1 → ∃𝑞 ≤
𝑝 ∃𝑝0 ∈ 𝐴0 𝑞 ≤ 𝑝0 . Since the ordering ≤ on 𝑃 is analytic, this is a 𝚷12 statement and
the Shoenfield absoluteness applies to yield the conclusion of the proposition. □
Throughout the rest of the book, we will make use of virtual conditions in Suslin forc-
ings. Similar to virtual equivalence classes, these are conditions which may not exist in
the present model of set theory and appear only in some generic extension, yet we have
a sensible calculus for dealing with them in the ground model. We want the space of
virtual conditions not to depend on a particular presentation of a given Suslin forcing,
and to be rich enough to harvest certain critical features. This leads to the following
definitions.
Definition 5.1.6. Let ⟨𝑃, ≤⟩ be a Suslin forcing.
(1) A 𝑃-pair is a pair ⟨𝑄, 𝜏⟩ where 𝑄 is a partial ordering and 𝜏 is a 𝑄-name for
an analytic subset of 𝑃. If 𝑃 is clear from the context, we omit it from the
notation.
(2) If ⟨𝑄0 , 𝜏0 ⟩, ⟨𝑄1 , 𝜏1 ⟩ are 𝑃-pairs, we write ⟨𝑄1 , 𝜏1 ⟩ ≤ ⟨𝑄0 , 𝜏0 ⟩ if there is a 𝑄1 -name
𝜂 for a filter on 𝑄0 which is generic over 𝑉 and such that 𝑄1 ⊩ Σ𝜏1 ≤ Σ(𝜏0 /𝜂).
Clearly, the original ordering ≤ on 𝑃 naturally embeds into the ordering on pairs by
the map assigning to each element 𝑝 ∈ 𝑃 the pair ⟨𝑄, 𝜏⟩ where 𝑄 is the one-element
partial order and 𝜏 is the 𝑄-name for the set {𝑝}. Thus, there is no harm in denoting
both relations with the same symbol. If 𝑄 is a poset and 𝜏 is a 𝑄-name for an element
of 𝑃, we abuse the notation to write ⟨𝑄, 𝜏⟩ for the pair ⟨𝑄, 𝜎⟩ where 𝜎 is the 𝑄-name for
the singleton set containing only 𝜏 as element. It is not difficult to see that the relation
≤ on pairs is a pre-order. A couple of observations: given a pair ⟨𝑄, 𝜏⟩, a poset 𝑅, and a
condition 𝑞 ∈ 𝑄, we have ⟨𝑅 × 𝑄, 𝜏⟩ ≤ ⟨𝑄, 𝜏⟩ and also ⟨𝑄 ↾ 𝑞, 𝜏⟩ ≤ ⟨𝑄, 𝜏⟩. In addition,
5.1. VIRTUAL CONDITIONS 107
if ⟨𝑄0 , 𝜏0 ⟩, ⟨𝑄1 , 𝜏1 ⟩ are 𝑃-pairs, then the relation ⟨𝑄1 , 𝜏1 ⟩ ≤ ⟨𝑄0 , 𝜏0 ⟩ is upwards absolute
among all generic extensions.
Definition 5.1.7. Let ⟨𝑃, ≤⟩ be a Suslin forcing.
(1) A 𝑃-pair ⟨𝑄, 𝜏⟩ is a 𝑃-pin if 𝑄 × 𝑄 ⊩ Σ𝜏left = Σ𝜏right holds.
(2) Let ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ be 𝑃-pins. Define ⟨𝑄0 , 𝜏0 ⟩ ≡ ⟨𝑄1 , 𝜏1 ⟩ if 𝑄0 ×𝑄1 ⊩ Σ𝜏0 =
Σ𝜏1 .
(3) Virtual conditions of 𝑃 are the equivalence classes of ≡.
As an initial remark, since any two generic extensions are mutually generic with a
third, ⟨𝑄, 𝜏⟩ is a 𝑃-pin just in case in every forcing extension 𝑉[𝐻] and every pair of
filters 𝐺0 , 𝐺1 ⊂ 𝑄 in 𝑉[𝐻] separately generic over 𝑉, Σ𝜏/𝐺0 = Σ𝜏/𝐺1 holds. We need to
verify that the relation ≡ is in fact an equivalence relation.
Proposition 5.1.8. ≡ is an equivalence relation on 𝑃-pins.
Proof. It is immediate that ≡ is symmetric and reflexive. For the transitivity,
suppose that ⟨𝑄2 , 𝜏2 ⟩ ≡ ⟨𝑄1 , 𝜏1 ⟩ ≡ ⟨𝑄0 , 𝜏0 ⟩; we need to show that ⟨𝑄2 , 𝜏2 ⟩ ≡ ⟨𝑄0 , 𝜏0 ⟩
holds. Let 𝐺0 ⊂ 𝑄0 , 𝐺2 ⊂ 𝑄2 are mutually generic filters and 𝐴2 = 𝜏2 /𝐺2 and 𝜏0 /𝐺0 ; we
must show that 𝑉[𝐺0 , 𝐺2 ] ⊧ Σ𝐴2 = Σ𝐴0 . Let 𝐺1 ⊂ 𝑄1 be a filter generic over 𝑉[𝐺0 , 𝐺2 ]
and let 𝐴1 = 𝜏1 /𝐺1 . By the assumption, 𝑉[𝐺0 , 𝐺1 ] ⊧ Σ𝐴1 = Σ𝐴0 and 𝑉[𝐺1 , 𝐺2 ] ⊧ Σ𝐴2 =
Σ𝐴1 . By the Shoenfield absoluteness, 𝑉[𝐺0 , 𝐺1 , 𝐺2 ] ⊧ Σ𝐴2 = Σ𝐴1 = Σ𝐴0 , in particular
Σ𝐴2 = Σ𝐴0 . By another application of the Shoenfield absoluteness, the inequality
Σ𝐴2 = Σ𝐴0 transfers from 𝑉[𝐺0 , 𝐺1 , 𝐺2 ] to 𝑉[𝐺0 , 𝐺2 ]. □
Throughout the book, we denote virtual conditions of 𝑃 by symbols such as 𝑝0̄ , 𝑝1̄ .
The class of virtual conditions of 𝑃 is very large. One good way of organizing it is to
notice that the ordering ≤ on 𝑃-pairs quotients down to a natural ordering on virtual
conditions as in the following definition.
Definition 5.1.9. Let ⟨𝑃, ≤⟩ be a Suslin forcing and 𝑝0̄ , 𝑝1̄ be virtual conditions
of 𝑃. We write 𝑝1̄ ≤ 𝑝0̄ if there are 𝑃-pins ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ representing 𝑝0̄ and 𝑝1̄
respectively such that ⟨𝑄1 , 𝜏1 ⟩ ≤ ⟨𝑄0 , 𝜏0 ⟩.
The following proposition restates the definition in terms of generic extensions; it is
routine and left to the patient reader.
Proposition 5.1.10. ≤ is a preorder on virtual conditions of 𝑃. In addition, for
virtual conditions 𝑝0̄ , 𝑝1̄ the following are equivalent:
(1) 𝑝1̄ ≤ 𝑝0̄ ;
(2) for any (equivalently, some) 𝑃-pins ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ representing 𝑝0̄ and 𝑝1̄
respectively and every forcing extension 𝑉[𝐻] containing filters 𝐺0 ⊂ 𝑄0 and
𝐺1 ⊂ 𝑄1 separately generic over 𝑉, Σ(𝜏1 /𝐺1 ) ≤ Σ(𝜏0 /𝐺0 ) holds.
We frequently identify conditions with virtual conditions. A condition 𝑝 ∈ 𝑃 is iden-
tified with (the ≡-class of) the 𝑃-pin ⟨𝑄, 𝜏⟩ where 𝑄 is a one element poset and 𝜏 is
the 𝑄-name for the set {𝑝}. In a typical usage, 𝑝 ̄ is a virtual condition, 𝑉[𝐺] is some
forcing extension, and 𝑝 ∈ 𝑃 ∩ 𝑉[𝐺] is a condition in this extension. The expression
𝑝 ≤ 𝑝 ̄ is then interpreted in the model 𝑉[𝐺] as an inequality between the 𝑃-pin asso-
ciated with 𝑝 and the virtual condition 𝑝.̄ The latter becomes, literally speaking, the
unique ≡-class in 𝑉[𝐺] containing the 𝑃-pins in 𝑝 ̄ in the ground model. In view of
Proposition 5.1.5, the preordering of virtual conditions is absolute among all generic
extensions. The seemingly awkward calculus of virtual conditions is immediately clar-
ified with a couple of examples of familiar Suslin forcings.
Example 5.1.11. Let 𝑃 be the poset of all countable functions from 2𝜔 to 2, ordered
by reverse inclusion. Let 𝑓 be any function from 2𝜔 to 2, perhaps uncountable. Let
𝑄 = Coll(𝜔, 𝑓) and let 𝜏 be a 𝑄-name for the set of all conditions 𝑝 ∈ 𝑃 such that
𝑓 ⊂ 𝑝. The pair ⟨𝑄, 𝜏⟩ is a 𝑃-pin. It is clear that distinct functions 𝑓 generate distinct
virtual conditions in 𝑃. The ordering of the associated virtual conditions corresponds
to reverse inclusion of functions.
Example 5.1.12. Let 𝑃 be the poset of infinite subsets of 𝜔, ordered by inclusion.
Let 𝐹 be a nonprincipal filter on 𝜔. Let 𝑄 = Coll(𝜔, 𝐹) and let 𝜏 be a 𝑄-name for the set
of all conditions 𝑝 ∈ 𝑃 which diagonalize the filter 𝐹, i.e. ∀𝑎 ∈ 𝐹 𝑝⧵𝑎 is finite. The pair
⟨𝑄, 𝜏⟩ is a 𝑃-pin, since the valuation of 𝜏 does not depend on the choice of the generic
filter on 𝑄. It is not difficult to see that distinct nonprincipal filters generate distinct
virtual conditions. The ordering of the associated virtual conditions corresponds to
reverse inclusion of filters.
The above examples are quite special. The class of all virtual conditions is typically too
broad to allow any informative classification of all virtual conditions, as the following
proposition shows.
Proposition 5.1.13. Suppose that ⟨𝑃, ≤⟩ is a 𝜎-closed Suslin forcing such that below
any element 𝑝 ∈ 𝑃 there are two incompatible ones. Then the equivalence ≡ has proper
class many equivalence classes.
Proof. Let ℎ ∶ 2<𝜔 → 𝑃 be a function such that for every 𝑡 ∈ 𝜔<𝜔 , the conditions
ℎ(𝑡 0) and ℎ(𝑡⌢ 1) are incompatible and stronger than ℎ(𝑡). Let 𝑔 ∶ 𝜔 → 𝜔2 be a bijec-
⌢
tion. For every ordinal 𝛼, consider the Coll(𝜔, 𝛼) name 𝜏𝛼 for the set of all conditions
𝑝 ∈ 𝑃 such that for every 𝑛 ∈ 𝜔 there is (exactly one) string 𝑡(𝑝, 𝑛) ∈ 2𝑛 such that
𝑝 ≤ ℎ(𝑡), and the binary relation 𝑔″ {𝑛 ∈ 𝜔 ∶ 𝑡(𝑝, 𝑛 + 1)(𝑛) = 1} is isomorphic to 𝛼.
It is not difficult to see that the pair ⟨Coll(𝜔, 𝛼), 𝜏𝛼 ⟩ is a 𝑃-pin; in fact the evaluation of
𝜏𝛼 yields the same analytic set no matter what the generic filter on Coll(𝜔, 𝛼) is. The
𝑃-pins obtained in this way are ≡-inequivalent; in fact, for distinct ordinals 𝛼 ≠ 𝛽,
Coll(𝜔, 𝛼) × Coll(𝜔, 𝛽) ⊩ any condition in 𝜏𝛼 is incompatible with any condition in
𝜏𝛽 . □
In contrast to Proposition 5.1.13, virtual conditions in a certain class normally allow
a neat classification by natural combinatorial objects. These are the balanced virtual
conditions of the next section, which are central to the technology developed in this
book.
5.2. Balanced virtual conditions

We start with a key definition of a balanced pair.
Definition 5.2.1. Let ⟨𝑃, ≤⟩ be a Suslin forcing. Let 𝑄 be a poset and 𝜏 a 𝑄-
name for an analytic subset of 𝑃. We say that ⟨𝑄, 𝜏⟩ is a balanced pair in 𝑃 for all pairs
⟨𝑅0 , 𝜎0 ⟩, ⟨𝑅1 , 𝜎1 ⟩ ≤ ⟨𝑄, 𝜏⟩, it is the case that 𝑅0 × 𝑅1 ⊩ ∃𝑝0 ∈ 𝜎0 ∃𝑝1 ∈ 𝜎1 ∃𝑝 ∈ 𝑃 𝑝 ≤
𝑝0 , 𝑝1 .
5.2. BALANCED VIRTUAL CONDITIONS 109
Figure 5.2.1. A balanced virtual condition 𝑝 ̄ ≤ 𝑝.
Note that if 𝜎 is any 𝑅0 × 𝑅1 -name for a lower bound of Σ𝜎0 , Σ𝜎1 in the poset 𝑃, then the
pair ⟨𝑅0 × 𝑅1 , 𝜎⟩ is a common lower bound of the pairs ⟨𝑅0 , 𝜎0 ⟩, ⟨𝑅1 , 𝜎1 ⟩. The following
proposition restates the notion of a balanced pair in terms of the generic extension as
opposed to the forcing relation. This restatement is more natural than the original
definition, and it will be used throughout the book. See Figure 5.2.1.
Proposition 5.2.2. Let ⟨𝑃, ≤⟩ be a Suslin forcing. Let 𝑄 be a poset and 𝜏 a 𝑄-name
for an analytic subset of 𝑃. The following are equivalent:
(1) ⟨𝑄, 𝜏⟩ is a balanced pair;
(2) whenever 𝑉[𝐻0 ] and 𝑉[𝐻1 ] are mutually generic extensions, 𝐺0 , 𝐺1 ⊂ 𝑄 are
filters generic over the ground model in the respective extensions and 𝑝0 ≤ 𝜏/𝐺0 ,
𝑝1 ≤ 𝜏/𝐺1 are conditions in 𝑃 in the respective extensions 𝑉[𝐻0 ], 𝑉[𝐻1 ], then
𝑝0 , 𝑝1 are compatible in 𝑃.
Example 5.2.3. Let 𝑃 be the poset of countable functions from 2𝜔 to 2, ordered by
reverse inclusion. If 𝑓 ∶ 2𝜔 → 2 is a total function, then ⟨Coll(𝜔, 2𝜔 ), 𝑓⟩̌ is a balanced
pair. To see this, suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions and 𝑝0 ∈
𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ] are functions containing 𝑓 as a subset. By the product forcing
theorem (Fact 1.7.8), dom(𝑝0 ) ∩ dom(𝑝1 ) = 2𝜔 ∩ 𝑉 must hold. It follows that 𝑝0 ∪ 𝑝1
is a function and therefore a common lower bound of the conditions 𝑝0 , 𝑝1 . Note that
⟨Coll(𝜔, 2𝜔 ), 𝑓⟩̌ is a 𝑃-pin. Every partial function from 2𝜔 to 2 yields a 𝑃-pin as per
Example 5.1.11. However, only the 𝑃-pins associated with total functions are balanced,
as will become clear in Example 5.2.7 below.
Balanced pairs are used in all our consistency proofs via the following technical propo-
sition.
Proposition 5.2.4. Suppose that ⟨𝑃, ≤⟩ is a Suslin forcing, ⟨𝑄, 𝜏⟩ a balanced pair,
𝜅 is an inaccessible cardinal such that |𝑄| < 𝜅, 𝑧 ∈ 𝑉 is a parameter, and 𝜙 a formula
with two free variables. Then either 𝑄 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜏 ⊩𝑃 𝑊[𝐺]̇ ⊧ 𝜙(𝑧,̌ 𝐺)̇ or
𝑄 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜏 ⊩𝑃 𝑊[𝐺]̇ ⊧ ¬𝜙(𝑧,̌ 𝐺)̇ where 𝑊 is the symmetric Solovay model
derived from the first two steps of the iteration and 𝐺̇ is the 𝑃-name for the generic filter.
Proof. Suppose towards contradiction that the conclusion fails. Then, by the
homogeneity properties of Coll(𝜔, < 𝜅) (Fact 1.7.16) there must be pairs ⟨𝑅0 , 𝜎0 ⟩ and
⟨𝑅1 , 𝜎1 ⟩ below ⟨𝑄, 𝜏⟩ such that |𝑅0 |, |𝑅1 | < 𝜅, 𝜎0 , 𝜎1 are names for conditions in 𝑃, and
𝑅0 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎0 ⊩𝑃 𝑊[𝐺]̇ ⊧ 𝜙(𝑧,̌ 𝐺)̇ and 𝑅1 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎1 ⊩𝑃 𝑊[𝐺]̇ ⊧
¬𝜙(𝑧,̌ 𝐺). ̇ By the balance assumption on the pair ⟨𝑄, 𝜏⟩, 𝑅0 × 𝑅1 ⊩ 𝜎0 , 𝜎1 are compatible
in the poset 𝑃; let 𝜂 be an 𝑅0 ×𝑅1 -name for a lower bound. Let 𝐻0 ⊂ 𝑅0 and 𝐻1 ⊂ 𝑅1 be
filters mutually generic over 𝑉, let 𝐾 ⊂ Coll(𝜔, < 𝜅) be a filter generic over 𝑉[𝐻0 , 𝐻1 ],
and work in the model 𝑉[𝐻0 , 𝐻1 , 𝐾].
It follows from the homogeneity properties of the collapse poset again that the
model 𝑉[𝐻0 , 𝐻1 , 𝐾] is a Coll(𝜔, < 𝜅)-extension of both 𝑉[𝐻0 ] and 𝑉[𝐻1 ]. The cal-
culation of the model 𝑊 does not depend on the Coll(𝜔, < 𝜅)-generic filter. Writing
𝑝0 = 𝜎0 /𝐻0 and 𝑝1 = 𝜎1 /𝐻1 , the forcing theorem in the respective models 𝑉[𝐻0 ] and
𝑉[𝐻1 ] shows that in 𝑉[𝐻0 , 𝐻1 , 𝐾] 𝑝0 ⊩𝑃 𝑊[𝐺]̇ ⊧ 𝜙(𝑧,̌ 𝐺)̇ and 𝑝1 ⊩𝑃 𝑊[𝐺]̇ ⊧ ¬𝜙(𝑧,̌ 𝐺). ̇
However, the conditions 𝑝0 , 𝑝1 ∈ 𝑃 are compatible, 𝜂/𝐻0 , 𝐻1 being their lower bound.
This is a contradiction. □
The class of balanced pairs is greatly simplified by introducing the following equiva-
lence relation on it:
Definition 5.2.5. Let ⟨𝑃, ≤⟩ be a Suslin forcing. If ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ are balanced
pairs, we say that ⟨𝑄0 , 𝜏0 ⟩ ≡𝑏 ⟨𝑄1 , 𝜏1 ⟩ if for all pairs ⟨𝑅0 , 𝜎0 ⟩ ≤ ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑅1 , 𝜎1 ⟩ ≤
⟨𝑄1 , 𝜏1 ⟩ it is the case that 𝑅0 × 𝑅1 ⊩ ∃𝑝0 ∈ 𝜎0 ∃𝑝1 ∈ 𝜎1 ∃𝑝 ∈ 𝑃 𝑝 ≤ 𝑝0 , 𝑝1 .
Proposition 5.2.6. The relation ≡𝑏 is an equivalence on balanced pairs. Moreover,
if ⟨𝑄, 𝜏⟩ is a balanced pair and ⟨𝑅, 𝜎⟩ ≤ ⟨𝑄, 𝜏⟩, then the pair ⟨𝑅, 𝜎⟩ is balanced and ≡𝑏 -
related to ⟨𝑄, 𝜏⟩.
Proof. It is immediate that the relation ≡𝑏 is symmetric and contains the diago-
nal. To see the transitivity, suppose that ⟨𝑄0 , 𝜏0 ⟩ ≡𝑏 ⟨𝑄1 , 𝜏1 ⟩ ≡𝑏 ⟨𝑄2 , 𝜏2 ⟩ holds; it must
be shown that ⟨𝑄0 , 𝜏0 ⟩ ≡𝑏 ⟨𝑄2 , 𝜏2 ⟩ follows. To this end, let ⟨𝑅0 , 𝜎0 ⟩ and ⟨𝑅2 , 𝜎2 ⟩ be pairs
stronger than ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄2 , 𝜏2 ⟩ respectively. Use the the assumptions to find an
𝑅0 × 𝑄1 -name 𝜂 for a common lower bound of some conditions in 𝜎0 and 𝜏1 . Then
⟨𝑅0 × 𝑄1 , 𝜂⟩ ≤ ⟨𝑄1 , 𝜏1 ⟩. By the initial assumptions again, 𝑅0 × 𝑄1 × 𝑅2 ⊩ 𝜂 is compat-
ible with some condition in 𝜎2 . By a Mostowski absoluteness argument between the
𝑅0 × 𝑅2 -extension and the 𝑅0 × 𝑄1 × 𝑅2 -extension, 𝑅0 × 𝑅2 ⊩ ∃𝑝0 ∈ 𝜎0 ∃𝑝2 ∈ 𝜎2 ∃𝑝 ∈
𝑃 𝑝 ≤ 𝑝0 , 𝑝2 , proving the transitivity of ≡𝑏 . The second sentence of the proposition
follows directly from the definitions and the fact that ≤ is a preorder on pairs. □
Example 5.2.7. To elaborate on Example 5.2.3, let 𝑃 be the poset of countable
functions from 2𝜔 to 2, ordered by reverse inclusion. If ⟨𝑄, 𝜏⟩ is a balanced pair, then for
̌ ∈ dom(𝜏)
every point 𝑥 ∈ 2𝜔 in the ground model, it must be the case that 𝑄 forces 𝑓(𝑥)
and in fact 𝑄 has to decide the value of 𝜏(𝑥)̌ as well–otherwise it would be easy to
violate the balance of the pair. Let 𝑓 ∶ 2𝜔 → 2 be the total function given by ∀𝑥 ∈
2𝜔 𝑄 ⊩ 𝜏(𝑥)̌ = 𝑓(̌ 𝑥)̌ and note that ⟨𝑄, 𝜏⟩ ≤ ⟨Coll(𝜔, 2𝜔 ), 𝑓⟩,̌ so ⟨𝑄, 𝜏⟩ ≡𝑏 ⟨Coll(𝜔, 2𝜔 ), 𝑓⟩̌
by Proposition 5.2.6. Thus, the balanced classes for 𝑃 are exactly classified by total
functions from 2𝜔 to 2.
One of the main concerns of this book is the classification of balanced classes for var-
ious Suslin forcings ⟨𝑃, ≤⟩. The following theorem is the basic contribution in this
direction.
Theorem 5.2.8. Let ⟨𝑃, ≤⟩ be a Suslin forcing. Every ≡𝑏 -class contains a virtual
condition. The condition is unique up to virtual condition equivalence.
Proof. Let ⟨𝑄0 , 𝜏0 ⟩ be a balanced pair; by Proposition 5.2.6 we may assume that
𝜏0 is a name for a single element of 𝑃. Consider the poset 𝑄1 = Coll(𝜔, 𝒫(𝑄)) and the
name 𝜏1 for the analytic set {𝑝 ∈ 𝑃 ∶ for some filter 𝐺 ⊂ 𝑄 meeting all open dense sets
enumerated by the 𝑄1 -generic, 𝑝 = 𝜏/𝐺}. It is clear that ⟨𝑄1 , 𝜏1 ⟩ is a 𝑃-pin. We will first
show that the pair ⟨𝑄1 , 𝜏1 ⟩ is balanced and ≡𝑏 -related to ⟨𝑄0 , 𝜏0 ⟩.
To prove the balance, assume towards a contradiction that it fails, as witnessed
by some pairs ⟨𝑅0 , 𝜎0 ⟩, ⟨𝑅1 , 𝜎1 ⟩ ≤ ⟨𝑄1 , 𝜏1 ⟩. Passing to a condition in 𝑅0 and 𝑅1 and
strengthening the names 𝜎0 , 𝜎1 if necessary, we may assume that 𝜎0 , 𝜎1 are in fact names
for elements of the poset 𝑃 and that 𝑅0 × 𝑅1 ⊩ 𝜎0 , 𝜎1 are incompatible in the poset 𝑃.
Strengthening the pairs further if necessary, using the definition of the name 𝜏1 , we
may assume that ⟨𝑅0 , 𝜎0 ⟩, ⟨𝑅1 , 𝜎1 ⟩ ≤ ⟨𝑄0 , 𝜏0 ⟩ holds. At this point, the balance of the
pair ⟨𝑄0 , 𝜏0 ⟩ shows that 𝑅0 × 𝑅1 ⊩ 𝜎0 , 𝜎1 are compatible in the poset 𝑃, contradicting
the initial assumptions on 𝑅0 , 𝑅1 . The ≡𝑏 -equivalence of ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ is proved
in a similar way.
To show the uniqueness of the 𝑃-pin ⟨𝑄1 , 𝜏1 ⟩ up to virtual condition equivalence,
suppose that ⟨𝑄2 , 𝜏2 ⟩ is another 𝑃-pin which is an element of the ≡𝑏 -class of the bal-
anced class of ⟨𝑄0 , 𝜏0 ⟩; we must show that 𝑄1 × 𝑄2 ⊩ Σ𝜏1 = Σ𝜏2 . Suppose towards
contradiction that this fails. Then passing to conditions in 𝑄1 and 𝑄2 if necessary, we
may find a 𝑄1 × 𝑄2 -name 𝜎 for a condition in 𝑃 forced to be below some element of 𝜏1
and incompatible with all elements of 𝜏2 (or vice versa). As the pairs ⟨𝑄1 , 𝜏1 ⟩ and ⟨𝑄2 , 𝜏2 ⟩
are ≡𝑏 -related and ⟨𝑄1 × 𝑄2 , 𝜎⟩ ≤ ⟨𝑄1 , 𝜏1 ⟩, it must be the case that 𝑄1 × 𝑄2 × 𝑄2 ⊩ 𝜎
is compatible with some element of 𝜏2 as evaluated according to the generic on the
right copy of 𝑄2 . Looking at the two copies of 𝑄2 in the product, this contradicts the
assumption that ⟨𝑄2 , 𝜏2 ⟩ is a 𝑃-pin, i.e. 𝑄2 × 𝑄2 ⊩ Σ(𝜏2 )left = Σ(𝜏2 )right . □
Question 5.2.9. Let ⟨𝑃, ≤⟩ be a Suslin forcing. Is it necessarily the case that the
equivalence relation ≡𝑏 has only set many classes? Is it necessarily the case that every
balance class has a representative on a poset of cardinality smaller than ℶ𝜔1 ?
It is now time to state the central definition of this book.
Definition 5.2.10. Let 𝑃 be a Suslin forcing. 𝑃 is balanced if for every condition

𝑝 ∈ 𝑃 there is a balanced virtual condition below 𝑝.
A definition of this sort immediately raises a question: which Suslin forcings are bal-
anced? We should immediately douse the flames of entirely misguided hopes:
Proposition 5.2.11. The following Suslin forcings do not have any balanced virtual
conditions and therefore are not balanced:
(1) nonatomic c.c.c. posets;
(2) nonatomic tree posets;
(3) posets of the form 𝒫(𝜔)/𝐼 where 𝐼 is a countably separated Borel ideal on 𝜔.
Here, a tree poset on a Polish space 𝑋 is an analytic family of closed subsets of 𝑋 closed
under nonempty intersections with closures of basic open sets, ordered by inclusion.
Proof. For (1), suppose towards a contradiction that ⟨𝑃, ≤⟩ is a Suslin c.c.c. poset
and ⟨𝑄, 𝜏⟩ is a balanced pair. For every maximal antichain 𝐴 ⊂ 𝑃, its maximality is
a coanalytic statement and therefore absolute to the 𝑄-extension. Thus, 𝑄 ⊩ every
element of 𝜏 is compatible with some element of 𝐴. The balance of 𝜏 immediately
shows that there can be only one element of 𝐴 with which some condition of 𝜏 is com-
patible, and the largest condition in 𝑄 identifies this element. It follows that the set
{𝑝 ∈ 𝑃 ∶ 𝑄 ⊩ Σ𝜏 ≤ 𝑝}̌ is a filter on 𝑃 which meets all maximal antichains, an impossi-
bility in nonatomic posets.
For (2), suppose towards a contradiction that ⟨𝑃, ≤⟩ is a tree poset on a Polish space
𝑋 and ⟨𝑄, 𝜏⟩ is a balanced pair. For every basic open set 𝑂 ⊂ 𝑋, the statement 𝜏 ∩ 𝑂̄ ≠ 0
must be decided by the largest condition in 𝑄 by the balance of 𝜏. This decision cannot
be positive for two disjoint basic open subsets of 𝑋 by the balance of 𝜏 again. Thus, 𝜏
would have to be forced by 𝑄 to be a singleton (even a specific singleton in the ground
model), an impossibility in nonatomic tree posets.
For (3), suppose towards a contradiction that 𝐼 is a countably separated ideal on 𝜔
as witnessed by a countable separating set 𝐴 ⊂ 𝒫(𝜔), meaning that for every 𝑏 ∈ 𝐼 and
𝑐 ∉ 𝐼 there is 𝑎 ∈ 𝐴 such that 𝑏 ∩ 𝑎 = 0 and 𝑐 ∩ 𝑎 ∉ 𝐼. Suppose that ⟨𝑄, 𝜏⟩ is a balanced
pair in the poset 𝒫(𝜔)/𝐼; so 𝜏 is a name for an 𝐼-positive subset of 𝜔. By the balance of
𝜏, for every set 𝑎 ∈ 𝐴 it must be decided by the largest condition in 𝑄 whether 𝜏 ∩ 𝑎̌ ∈ 𝐼
or not. Let 𝐵 = {𝑎 ∈ 𝐴 ∶ 𝑄 ⊩ 𝜏 ∩ 𝑎̌ ∉ 𝐼}. Use the balance of the name 𝜏 to argue
that any intersection of finitely many elements of 𝐵 is an infinite set. Let 𝑏 ⊂ 𝜔 be an
infinite set such that for every 𝑎 ∈ 𝐵, 𝑏 ⧵ 𝑎 is finite. Use the density of the ideal 𝐼 to
argue that thinning out the set 𝑏 if necessary, we may assume that 𝑏 ∈ 𝐼. It is now
immediate that no set 𝑎 ∈ 𝐴 can separate the 𝐼-small set 𝑏 from the 𝐼-positive set 𝜏 in
the 𝑄-extension: if 𝑎 ∈ 𝐴 ⧵ 𝐵 then 𝜏 ∩ 𝑎 ∈ 𝐼 is forced, and if 𝑎 ∈ 𝐵 then 𝑏 ∩ 𝑎 ≠ 0. This
is a contradiction. □
Most balanced Suslin forcings used in this book are 𝜎-closed. There are 𝜎-closed posets
which are not balanced, such as the one which adds a maximal almost disjoint fam-
ily in 𝒫(𝜔) by countable approximations, cf. Theorem 14.1.1. There are some posets
which are balanced and in ZFC even collapse ℵ1 , cf. Theorem 8.8.2. Even such posets
are valuable; remember that they prove their worth in the choiceless symmetric Solo-
vay extension. The balanced status of certain posets is nonabsolute, see for example
Theorem 8.2.17 or 8.6.6. Thus, even though typically the balanced virtual conditions
correspond to traditional objects of combinatorial set theory, the balanced status is a
complicated matter. There is only one general preservation theorem, which is never-
theless extremely useful for obtaining consistency results:
Theorem 5.2.12. Let 𝑃 = ∏𝑛 𝑃𝑛 be a countable support product of Suslin forcing

notions. Balanced virtual conditions in 𝑃 are exactly classified by sequences ⟨𝑝𝑛̄ ∶ 𝑛 ∈ 𝜔⟩
where for every 𝑛 ∈ 𝜔, 𝑝𝑛̄ is a balanced virtual condition in 𝑃𝑛 .
Proof. On one hand, if ⟨𝑄𝑛 , 𝜏𝑛 ⟩ are balanced pairs for each 𝑛 ∈ 𝜔, the name
for the sequence ⟨𝜏𝑛 ∶ 𝑛 ∈ 𝜔⟩ in the product 𝑄 = ∏𝑛 𝑄𝑛 is balanced for the poset 𝑃
essentially by the definitions. The choice of the support in the product 𝑄 is immaterial.
On the other hand, if 𝑄 is a poset and 𝜏 = ⟨𝜏𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a balanced 𝑄-name for the
poset 𝑃, it must be the case that each of the names 𝜏𝑛 for 𝑛 ∈ 𝜔 is balanced for the
poset 𝑃𝑛 . It equally easy to see that equivalent balanced names for 𝑃 give equivalent
balanced names on each coordinate, and sequences of balanced names on the posets 𝑃𝑛
which are coordinatewise equivalent yield equivalent balanced names for the product
forcing. □
Corollary 5.2.13. The countable support product of balanced Suslin forcings is
balanced.
One issue that is constantly present in this book is the lack of absoluteness of the no-
tions surrounding balance. As long as Question 5.2.9 remains open, it will also be
necessary to relativize the definition of a balanced poset to 𝑉𝜅 where 𝜅 is an inacces-
sible cardinal. One may think that with suitable large cardinal hypothesis on 𝜅, one
could use reflection to show that relativization is unnecessary. The best result we have
in this direction is:
Proposition 5.2.14. Let ⟨𝑃, ≤⟩ be a Suslin forcing. Let 𝜅 be a Σ2 -reflecting cardinal.
The following are equivalent:
(1) 𝑃 is balanced;
(2) 𝑉𝜅 ⊧ 𝑃 is balanced.
Proof. The argument uses a simple absoluteness claim:
Claim 5.2.15. If 𝑀 is a transitive model of ZFC, ⟨𝑄, 𝜏⟩ is a pair in 𝑀, 𝑀 ⊧ ⟨𝑄, 𝜏⟩ is
balanced, and 𝒫(𝑄) ⊂ 𝑀, then the pair ⟨𝑄, 𝜏⟩ is balanced in 𝑉.
Proof. Work in 𝑉. Suppose that the conclusion fails, as witnessed by posets 𝑅0 , 𝑅1
and names 𝜎0 , 𝜎1 on 𝑅0 × 𝑄 and 𝑅1 × 𝑄 respectively. Take an elementary submodel 𝑁
of a large enough structure such that 𝑄 ⊂ 𝑁 and |𝑁| = |𝑄|. The posets 𝑅0 ∩ 𝑁, 𝑅1 ∩ 𝑁
and names 𝜎0 ∩ 𝑁 and 𝜎1 ∩ 𝑁 still witness the failure of of the balance of the pair ⟨𝑄, 𝜏⟩:
if 𝐺0 ⊂ (𝑅0 ∩ 𝑁) × 𝑄 and 𝐺1 ⊂ (𝑅1 ∩ 𝑁) × 𝑄 are mutually generic filters, 𝑝0 = 𝜎0 /𝐺0
and 𝑝1 = 𝜎1 /𝐺1 ∈ 𝑃, then 𝑁[𝐺0 , 𝐺1 ] ⊧ 𝑝0 , 𝑝1 ∈ 𝑃 are incompatible conditions by the
forcing theorem applied in the model 𝑁, and by the Mostowski absoluteness between
𝑁[𝐺0 , 𝐺1 ] and 𝑉[𝐺0 , 𝐺1 ], this is still true in 𝑉[𝐺0 , 𝐺1 ]. Now, the assumption 𝒫(𝑄) ⊂ 𝑀
shows that the posets 𝑅0 ∩ 𝑁, 𝑅1 ∩ 𝑁 and names 𝜎0 ∩ 𝑁 and 𝜎1 ∩ 𝑁 have isomorphic
copies in the model 𝑀, obtaining the failure of balance of the pair ⟨𝑄, 𝜏⟩ in 𝑀. □
Now, Claim 5.2.15 applied to 𝑀 = 𝑉𝜅 immediately yields the implication (2)→(1). For
the converse, suppose that 𝑃 is balanced, 𝑝 ∈ 𝑃, and find a balanced pair ⟨𝑄, 𝜏⟩ below
𝑝. We have to deal with the unseemly possibility that |𝑄| > 𝜅 holds. A brief review of
the definition of balance reveals that the statement “⟨𝑄, 𝜏⟩ is a balanced pair below 𝑝”
is Π1 . Applying the initial assumption on the cardinal 𝜅 we see that 𝑉𝜅 ⊧there is is a
balanced pair below 𝑝. Since the condition 𝑝 ∈ 𝑃 was arbitrary, (2) follows. □
5.3. Weakly balanced Suslin forcing

There is an interesting generalization of balanced Suslin forcing which can realize
additional effects in extensions of the symmetric Solovay model. The basic definitions
can be stated as a minor variation of the work done in the previous sections.
Definition 5.3.1. Let ⟨𝑃, ≤⟩ be a Suslin forcing. A pair ⟨𝑄, 𝜏⟩ is weakly balanced
if any pairs ⟨𝑅0 , 𝜎0 ⟩, ⟨𝑅1 , 𝜎1 ⟩ ≤ ⟨𝑄, 𝜏⟩ have a common lower bound in the ordering of
pairs.
It is immediate that every balanced pair is weakly balanced. Weakly balanced pairs are
equipped with a rather obvious equivalence.
Definition 5.3.2. Let 𝑃 be a Suslin forcing and ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ are weakly
balanced pairs. Say that the pairs are equivalent and write ⟨𝑄0 , 𝜏0 ⟩ ≡𝑤𝑏 ⟨𝑄1 , 𝜏1 ⟩ if any
pairs ⟨𝑅0 , 𝜎0 ⟩ ≤ ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑅1 , 𝜎1 ⟩ ≤ ⟨𝑄1 , 𝜏1 ⟩ have a common lower bound in the
ordering of pairs.
The weak balance and its associated equivalence are faithful extensions of the notion of
balance and its associated equivalence. This is the content of the following proposition.
Proposition 5.3.3. Let ⟨𝑃, ≤⟩ be a Suslin forcing.
(1) The relation ≡𝑤𝑏 is an equivalence relation on weakly balanced pairs;
(2) the class of balanced pairs is invariant under ≡𝑤𝑏 equivalence;
(3) the relations ≡𝑏 and ≡𝑤𝑏 coincide on balanced pairs.
Proof. (1) is immediate from the definitions. For (2), suppose towards a con-
tradiction that ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ are ≡𝑤𝑏 -equivalent pairs and ⟨𝑄0 , 𝜏0 ⟩ is balanced,
while ⟨𝑄1 , 𝜏1 ⟩ is not. The latter statement is witnessed by some pairs ⟨𝑅0 , 𝜎0 ⟩, ⟨𝑅1 , 𝜎1 ⟩ ≤
⟨𝑄1 , 𝜏1 ⟩. Passing to a condition in 𝑅0 and 𝑅1 if necessary, we may assume that 𝑅0 ×𝑅1 ⊩
Σ𝜎0 , Σ𝜎1 are incompatible in 𝑃.
Use the ≡𝑤𝑏 -assumption to find a lower bound ⟨𝑆0 , 𝜂0 ⟩ of ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑅0 , 𝜎0 ⟩, and
also a lower bound ⟨𝑆0 , 𝜂1 ⟩ of ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑅1 , 𝜎1 ⟩. By the balance of the pair ⟨𝑄0 , 𝜏0 ⟩ it
follows that 𝑆0 × 𝑆1 ⊩ Σ𝜂0 , Σ𝜂1 are compatible in 𝑃. The 𝑅0 -generic filter added by 𝑆0
and the 𝑅1 -generic filter added by 𝑆1 will be mutually generic in the 𝑆0 × 𝑆1 -extension
by Corollary 1.7.10 and the associated sums Σ𝜎0 , Σ𝜎1 will have a lower bound in the
𝑆0 × 𝑆1 -extension. This contradicts the initial assumptions on 𝑅0 , 𝑅1 .
For (3), it is clear that ≡𝑏 is a subset of ≡𝑤𝑏 on balanced pairs. For the opposite
inclusion, suppose towards a contradiction that ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ are balanced, ≡𝑤𝑏 -
equivalent, and ≡𝑏 -inequivalent pairs. Let ⟨𝑅0 , 𝜎0 ⟩ ≤ ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑅1 , 𝜎1 ⟩ ≤ ⟨𝑄1 , 𝜏1 ⟩
witness the ≡𝑏 -inequivalence. Passing to a condition in 𝑅0 and 𝑅1 , we may assume that
𝑅0 × 𝑅1 ⊩ Σ𝜎0 , Σ𝜎1 are incompatible in 𝑃. Use the initial assumptions to find a lower
bound ⟨𝑆, 𝜂⟩ of ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑅1 , 𝜏1 ⟩. Since the pair ⟨𝑄0 , 𝜏0 ⟩ is balanced, 𝑅0 × 𝑆 ⊩ Σ𝜎0 , Σ𝜂
are compatible in 𝑃. The 𝑅1 -generic filter introduced by 𝑆 is mutually generic with the
𝑅0 filter by Corollary 1.7.10 and the associated sums Σ𝜎0 , Σ𝜎1 will have a lower bound
in the 𝑅0 × 𝑆-extension. This contradicts the initial assumptions on 𝑅0 , 𝑅1 . □
Proposition 5.3.4. Let 𝑃 be a Suslin forcing. Every ≡𝑤𝑏 -class contains a virtual
condition. The virtual condition is unique up to ≡-equivalence.
Proof. Let ⟨𝑄0 , 𝜏0 ⟩ be a weakly balanced pair; strengthening 𝜏0 if necessary, we
may assume that 𝜏 is in fact a name for an element of 𝑃. Let 𝜅 be an ordinal such that
5.3. WEAKLY BALANCED SUSLIN FORCING 115
𝒫(𝑄) ⊂ 𝑉𝜅 , let 𝑄0 = Coll(𝜔, 𝑉𝜅 ) and let 𝜏1 be the 𝑄1 -name for the set {𝑝 ∈ 𝑃 ∶ there
is a filter 𝐺 ⊂ 𝑄0 𝐺 meeting all the dense subsets of 𝑄0 in 𝑉𝜅𝑉 such that 𝑝 = 𝜏0 /𝐺}.
It is clear that the pair ⟨𝑄1 , 𝜏1 ⟩ is a 𝑃-pin. We will show that the pair ⟨𝑄1 , 𝜏1 ⟩ is weakly
balanced and ≡𝑤𝑏 -related to ⟨𝑄1 , 𝜏1 ⟩.
For the weak balance, suppose that ⟨𝑅0 , 𝜎0 ⟩, ⟨𝑅1 , 𝜎1 ⟩ ≤ ⟨𝑄1 , 𝜏1 ⟩ are pairs. Strength-
ening the pairs if necessary, using the definition of the definition of 𝑄1 we may assume
that ⟨𝑅0 , 𝜎0 ⟩, ⟨𝑅1 , 𝜎1 ⟩ ≤ ⟨𝑄0 , 𝜏0 ⟩ holds. The weak balance of ⟨𝑄0 , 𝜏0 ⟩ then guarantees the
existence of a lower bound of the two pairs. The proof of ⟨𝑄0 , 𝜏0 ⟩ ≡𝑤𝑏 ⟨𝑄1 , 𝜏1 ⟩ is similar.
For the uniqueness part, suppose that ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ are 𝑃-pins which are
both ≡𝑤𝑏 -related to ⟨𝑄, 𝜏⟩; we must show that they are ≡-related. Suppose towards a
contradiction that this fails. Then, in the 𝑄1 × 𝑄0 -extension, there must be an element
𝑝 ∈ 𝑃 which is below some element of 𝜏0 and incompatible with any element of 𝜏1
(or vice versa). By a Mostowski absoluteness argument, this element 𝑝 will maintain
its incompatibility property in every further forcing extension. Let 𝜎0 be a 𝑄1 × 𝑄0 -
name for this element, let 𝜎1 be a 𝑄1 -name for any element of 𝜏1 , and observe that the
pairs ⟨𝑄1 × 𝑄0 , 𝜎0 ⟩ and ⟨𝑄1 , 𝜎1 ⟩ witness that the the pairs ⟨𝑄0 , 𝜏0 ⟩ and ⟨𝑄1 , 𝜏1 ⟩ are ≡𝑤𝑏 -
unrelated, contradicting the initial assumptions. □
Unlike balanced virtual conditions, weakly balanced virtual conditions can be actually
recognized in the ordering of virtual conditions by a natural first order property.
Proposition 5.3.5. Let 𝑃 be a Suslin forcing. Let ⟨𝑄, 𝜏⟩ be a 𝑃-pin. The following
are equivalent:
(1) ⟨𝑄, 𝜏⟩ is weakly balanced;
(2) ⟨𝑄, 𝜏⟩ is an atom in the ordering of virtual conditions.
Recall that an element 𝑝 ̄ of a partial order is an atom if every element compatible with
𝑝 ̄ is in fact above 𝑝.̄
Proof. For (1)→(2) direction, let ⟨𝑅, 𝜎⟩ be a 𝑃-pin which is not above ⟨𝑄, 𝜏⟩; we
must show that it is incompatible with ⟨𝑄, 𝜏⟩. Suppose towards a contradiction that
it is compatible, with a lower bound ⟨𝑆, 𝜒⟩. In the 𝑅 × 𝑄 extension, the inequality
Σ𝜏 ≤ Σ𝜎 must fail, so there is a 𝑅 × 𝑄-name 𝑝0̇ for an element of 𝑃 which is below Σ𝜏
but incompatible with Σ𝜎. There is an 𝑆 × 𝑅 × 𝑄-name 𝑝1̇ of 𝑃 which is below Σ𝜒, and
therefore also below Σ𝜎 and Σ𝜏. Use the weak balance of the pair ⟨𝑄, 𝜏⟩ to find, in some
generic extension, filters 𝐻0 × 𝐺0 ⊂ 𝑅 × 𝑄 and 𝐾1 × 𝐻1 × 𝐺1 ⊂ 𝑆 × 𝑅 × 𝑄 separately
generic over 𝑉 such that the conditions 𝑝0̇ /𝐻0 × 𝐺0 and 𝑝1̇ /𝐾1 × 𝐻1 × 𝐺1 are compatible
in 𝑃, with a lower bound 𝑝. Note that the sums Σ𝜎/𝐻0 and Σ𝜎/𝐻1 in the completion
of the poset 𝑃 must coincide, as ⟨𝑅, 𝜎⟩ is a 𝑃-pin. However, the condition 𝑝 should be
incompatible with the former and below the latter by the forcing theorem. This is a
contradiction.
For the (2)→(1) direction, suppose that ⟨𝑄, 𝜏⟩ is a 𝑃-pin which is an atom in the or-
dering of virtual conditions. To prove the weak balance, suppose that 𝑅0 , 𝑅1 are posets,
𝜎0 , 𝜎1 are 𝑅0 × 𝑄 and 𝑅1 × 𝑄-names for elements of 𝑃 stronger than 𝜏, and let ⟨𝑟0 , 𝑞0 ⟩
and ⟨𝑟1 , 𝑞1 ⟩ be conditions in the products. To find the instrumental generic filters, let
𝜅 be an ordinal such that 𝒫(𝑅0 × 𝑄) and 𝒫(𝑅1 × 𝑄) are both subsets of 𝑉𝜅 , and for
each index 𝑖 ∈ 2 consider the Coll(𝜔, 𝑉𝜅 )-name 𝜒𝑖 for analytic subsets of 𝑃 defined by
𝜒𝑖 = {𝑝 ∈ 𝑃 ∶ there is a filter 𝐺 ⊂ 𝑅0 × 𝑄 meeting all open dense subsets of 𝑅1 × 𝑄 in
𝑉𝜅𝑉 such that ⟨𝑟1 , 𝑞1 ⟩ ∈ 𝐺 and 𝑝 = 𝜎/𝐺}.
It is not difficult to see that ⟨Coll(𝜔, 𝑉𝜅 ), 𝜒0 ⟩ and ⟨Coll(𝜔, 𝑉𝜅 ), 𝜒1 ⟩ are both 𝑃-pins.
They are also both ≤ ⟨𝑄, 𝜏⟩ by their definitions. By the assumption on the 𝑃-pin ⟨𝑄, 𝜏⟩,
they must both be ≡-equivalent to ⟨𝑄, 𝜏⟩. This means that in the Coll(𝜔, 𝑉𝜅 )-extension,
there must be conditions 𝑝0 ∈ 𝜒0 and 𝑝1 ∈ 𝜒1 which are compatible in 𝑃. Reviewing
the definition of the names 𝜒0 and 𝜒1 , we get the filters 𝐺0 ⊂ 𝐻0 × 𝐾0 and 𝐺1 ⊂ 𝐻1 × 𝐾1
separately generic over 𝑉 such that ⟨𝑟0 , 𝑞0 ⟩ ∈ 𝐺0 , ⟨𝑟1 , 𝑞1 ⟩ ∈ 𝐺1 , and 𝜎0 /𝐺0 and 𝜎1 /𝐺1 are
compatible conditions in 𝑃 as desired. □
Finally, we record the central definition of this section.
Definition 5.3.6. A Suslin forcing 𝑃 is weakly balanced if below every condition
𝑝 ∈ 𝑃 there is a weakly balanced virtual condition stronger than 𝑝.
CHAPTER 6
Simplicial complex forcings
6.1. Basic concepts

Many examples of 𝜎-closed Suslin partially ordered sets in this book are presented
in the same way:
Definition 6.1.1. Let 𝑋 be a set.
(1) A set 𝒦 of finite subsets of 𝑋 is a simplicial complex if it is closed under subset;
(2) a set 𝐴 ⊂ 𝑋 is a 𝒦-set if [𝐴]<ℵ0 ⊂ 𝒦; it is maximal if it is not a proper subset
of another 𝒦-set;
(3) the poset 𝑃𝒦 ⊂ 𝑋 𝜔 consists of countable 𝒦-sets ordered by reverse inclusion;
̇ is the 𝑃𝒦 -name for the union of all sets in the generic filter.
(4) 𝐴𝑔𝑒𝑛
Unless specifically stated otherwise, we will tacitly assume that every singleton belongs
to 𝒦. When the simplicial context 𝒦 is understood from the context, we put 𝑃 = 𝑃𝒦
in this section. The poset 𝑃 is obviously 𝜎-closed. By an elementary density argument,
̇ is forced to be a maximal 𝒦-set. The poset 𝑃 can be naturally presented as
the set 𝐴𝑔𝑒𝑛
a Suslin forcing by replacing the countable 𝒦-sets with their enumerations by natural
numbers, and replacing the reverse inclusion ordering by reverse inclusion of ranges
of the enumerations. We will neglect this innocuous step in this section as it merely
complicates the notation.
Nearly every poset considered in this book can be presented as a poset of the form
𝑃𝒦 for a Borel simplicial complex 𝒦 on a Polish space 𝑋. To see this, for a poset 𝑄 let 𝒦
be the simplicial complex of the finite subsets of 𝑄 which have a common lower bound.
Under suitable assumptions on definability and existence of lower bounds (which are
invariably satisfied), the posets 𝑄 and 𝑃𝒦 are naturally forcing equivalent. However,
this point of view rarely brings any new insight. In this chapter, we deal with simplicial
complexes that are in some way algebraically natural, and such that their algebraic
structure leads to a classification of balanced virtual conditions.
6.2. Fragmented complexes

Many simplicial complexes in this chapter share a novel abstract regularity prop-
erty which enables the classification of balanced virtual conditions in Theorem 6.2.3
below.
Definition 6.2.1. A Borel simplicial complex 𝒦 on a Polish space 𝑋 is fragmented
if there are Polish spaces 𝑌 , 𝑍 and a Borel function 𝑓 ∶ 𝒦 → [𝑌 × 𝑍]ℵ0 such that
(1) for each 𝑎 ∈ 𝒦, 𝑓(𝑎) is a countable partial function from 𝑌 to 𝑍;
(2) 𝑏 ⊂ 𝑎 in 𝒦 implies 𝑓(𝑏) ⊂ 𝑓(𝑎);
(3) for any 𝑎, 𝑏 ∈ 𝒦, 𝑎 ∪ 𝑏 ∈ 𝒦 if and only if 𝑓(𝑎) ∪ 𝑓(𝑏) is a function.
117
118 6. SIMPLICIAL COMPLEX FORCINGS
The function 𝑓 is called a fragmentation. For any 𝒦-set 𝐴 ⊂ 𝑋, we write 𝑓(𝐴) =

⋃{𝑓(𝑏) ∶ 𝑏 ∈ [𝐴]<ℵ0 }.
Note that conditions 𝑝0 , 𝑝1 ∈ 𝑃𝒦 are compatible just in case 𝑓(𝑝0 ) ∪ 𝑓(𝑝1 ) is a function.
The Suslin forcings derived from fragmented simplicial complexes are balanced. The
following theorem provides a classification of balanced virtual conditions. In this gen-
erality, the classification is bound to be rather uninformative, and it has to be reviewed
in all specific cases to extract more useful information.
Definition 6.2.2. Let 𝒦 be a fragmented Borel simplicial complex on a Polish
space 𝑋, with a Borel fragmentation 𝑓 ∶ 𝒦 → [𝑌 × 𝑍]ℵ0 . A partial function 𝑔 ∶ 𝑌 → 𝑍
is a master function if in the Coll(𝜔, 2𝜔 )-extension, 𝑔 is inclusion maximal among all
functions 𝑓(𝑝) ↾ 𝑉 as 𝑝 ranges over all conditions in 𝑃𝒦 . For each master function 𝑔,
let 𝜎𝑔 be the Coll(𝜔, 2𝜔 )-name for the set of all conditions 𝑝 ∈ 𝑃 such that 𝑔 ⊂ 𝑓(𝑝).
Theorem 6.2.3. Let 𝒦 be a fragmented Borel simplicial complex on a Polish space
𝑋, with a Borel fragmentation 𝑓 ∶ 𝒦 → [𝑌 × 𝑍]ℵ0 . Let 𝑃 = 𝑃𝒦 .
(1) For every master function 𝑔, the pair ⟨Coll(𝜔, 2𝜔 ), 𝜎𝑔 ⟩ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a master function 𝑔 such that the balanced
pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 2𝜔 ), 𝜎𝑔 ⟩ are equivalent;
(3) distinct master functions yield inequivalent balanced pairs.
In particular, the poset 𝑃 is balanced.
Proof. For (1), let 𝑔 ∶ 𝑌 → 𝑍 be a master function. For each 𝑖 ∈ 2 let 𝑄𝑖 be a
poset and 𝜎𝑖 be a 𝑄𝑖 -name for a condition such that 𝑄𝑖 ⊩ 𝑔̌ ⊂ 𝑓(𝜎𝑖 ). We must show that
𝑄0 ×𝑄1 ⊩ 𝜎0 , 𝜎1 are conditions compatible in 𝑃. Note that by a Mostowski absoluteness
argument between the 𝑄0 -, 𝑄1 -, and Coll(𝜔, 2𝜔 )-extensions, 𝑄𝑖 ⊩ 𝑔̌ = 𝑓(𝜎𝑖 ) ↾ 𝑉 for
𝑖 = 0, 1. Let 𝐻0 ⊂ 𝑄0 and 𝐻1 ⊂ 𝑄1 be mutually generic filters and write 𝑝0 = 𝜎0 /𝐻0
and 𝑝1 = 𝜎1 /𝐻1 . Assume towards a contradiction that the conditions 𝑝0 , 𝑝1 ∈ 𝑃 are
incompatible, and let 𝑎0 ⊂ 𝑝0 and 𝑎1 ⊂ 𝑝1 be finite sets such that 𝑎0 ∪ 𝑎1 ∉ 𝒦. Then
𝑓(𝑎0 )∪𝑓(𝑎1 ) is not a function, and there must be a point 𝑦 ∈ dom(𝑓(𝑎0 ))∩dom(𝑓(𝑎1 ))
such that 𝑓(𝑎0 )(𝑦) ≠ 𝑓(𝑎1 )(𝑦). By the product forcing theorem, it must be the case that
𝑦 ∈ 𝑉. But then, 𝑦 ∈ dom(𝑔), so 𝑔(𝑦) = 𝑓(𝑎0 )(𝑦) = 𝑓(𝑎1 )(𝑦), contradicting the choice
of the sets 𝑎0 , 𝑎1 .
For (2), let ⟨𝑄, 𝜏⟩ be a balanced pair; strengthening if necessary, we may assume
that 𝜏 is in fact a name for a condition in the poset 𝑃. Replacing 𝑄 with 𝑄 × Coll(𝜔, 2𝜔 )
and strengthening 𝜏 further if necessary, we may assume that 𝑄 ⊩ ∀𝑝 ≤ 𝜏 𝑓(𝑝) ↾ 𝑉 =
𝑓(𝜏) ↾ 𝑉. Note that this property of 𝜏 will remain true in all further forcing extensions
by a Mostowski absoluteness argument. Let 𝑔 = {⟨𝑦, 𝑧⟩ ∈ (𝑌 × 𝑍) ∩ 𝑉 ∶ 𝑄 ⊩ 𝑓(𝜏)(𝑦)̌ =
̌ We claim that 𝑔 is a master function. Since clearly 𝑄 × Coll(𝜔, 2𝜔 ) ⊩ 𝜏 ≤ Σ𝜎𝑔 , this
𝑧}.
will prove (2) by reference to Proposition 5.2.6.
Claim 6.2.4. 𝑄 ⊩ 𝑔̌ = 𝑓(𝜏) ↾ 𝑉.
Proof. If this failed, then there would have to be a point 𝑦 ∈ 𝑌 and conditions
𝑞0 , 𝑞1 ∈ 𝑄 such that either 𝑞0 ⊩ 𝑦 ̌ ∈ dom(𝑓(𝜏)) and 𝑞1 ⊩ 𝑦 ̌ ∉ dom(𝑓(𝜏)), or 𝑞0 ⊩
𝑓(𝜏)(𝑦)̌ ∈ 𝑂0 and 𝑞1 ⊩ 𝑓(𝜏)(𝑦)̌ ∈ 𝑂1 . In either case, let 𝐺0 , 𝐺1 ⊂ 𝑄 be filters mutually
generic over 𝑉 and containing the respective conditions 𝑞0 , 𝑞1 . Write 𝑝0 = 𝜏/𝐺0 and
𝑝1 ∈ 𝜏/𝐺1 ∈ 𝑃 and use the balance assumption to argue that 𝑝0 , 𝑝1 are compatible
in 𝑃; in other words, 𝑝0 ∪ 𝑝1 is a 𝒦-set. Consider the two cases introduced above. In
6.2. FRAGMENTED COMPLEXES 119
the former case, 𝑦 ∈ dom(𝑝0 ) and 𝑦 ∉ dom(𝑝1 ), and then the common lower bound
of 𝑝0 , 𝑝1 violates the assumption on the maximality of 𝑝0 = 𝜏/𝐺0 . In the latter case,
𝑓(𝑝0 ) ∪ 𝑓(𝑝1 ) is not a function, violating the assumption that 𝑝0 ∪ 𝑝1 is a 𝒦-set. These
contradictions complete the proof of the claim. □
Suppose now towards a contradiction that 𝑔 is not a master function. Then there must
be a Coll(𝜔, 2𝜔 )-name 𝜎 such that Coll(𝜔, 2𝜔 ) ⊩ 𝑔̌ ⊂ 𝑓(𝜎) and 𝑔̌ ≠ 𝑓(𝜎) ↾ 𝑉. Let
𝐺0 ⊂ 𝑄 and 𝐺1 ⊂ Coll(𝜔, 2𝜔 ) be filters mutually generic over the ground model. Write
𝑝0 = 𝜏/𝐺0 and 𝑝1 = 𝜏/𝐺1 . By the product forcing theorem, dom(𝑓(𝑝0 ))∩dom(𝑓(𝑝1 )) ⊂
𝑉. By the claim, 𝑓(𝑝0 ) ∪ 𝑓(𝑝1 ) is a function. By the fragmentation property of the
function 𝑓, the conditions 𝑝0 , 𝑝1 are compatible in the poset 𝑃, and their lower bound
violates the assumption on the maximality of 𝑝0 = 𝜏/𝐺0 . This contradiction shows
that 𝑔 is a master function and completes the proof of (2).
(3) is immediate. The existence of master functions is not immediate, so the last
sentence of the theorem requires work. Suppose that 𝑝 ∈ 𝑃 is a condition. Let 𝜅 = |2𝜔 |
and let {𝑦𝛼 ∶ 𝛼 ∈ 𝜅} be an enumeration of the space 𝑌 . By transfinite recursion on
𝛼 ∈ 𝜔1 build build 𝒦-sets 𝐴𝛼 such that
• 𝑝 = 𝐴0 ⊂ 𝐴1 ⊂ . . . and |𝐴𝛼 | ≤ |𝛼| + ℵ0 ;
• for limit ordinals 𝛼 let 𝐴𝛼 = ⋃𝛽∈𝛼 𝐴𝛽 ;
• for every ordinal 𝛼 ∈ 𝜅, if Coll(𝜔, 2𝜔 ) forces the existence of a condition 𝑞 ∈ 𝑃
with 𝑓(𝐴𝛼 ) ⊂ 𝑓(𝑞) and 𝑦𝛼 ∈ dom(𝑓(𝑞)), then 𝑦 ∈ 𝑓(𝐴𝛼+1 ).
We have to indicate how the successor stage of the recursion is passed. Let 𝛼 ∈ 𝜅
be any ordinal and 𝜏 be a Coll(𝜔, 2𝜔 )-name for a condition in 𝑃 such that 𝑓(𝐴𝛼̌ ) ⊂
𝑓(𝜏) and 𝑦𝛼̌ ∈ dom(𝑓(𝜏)) is forced. Let 𝑀 be a countable elementary submodel of a
large structure containing 𝒦, 𝑓, 𝜏, 𝐴𝛼 and 𝑦𝛼 . Use Proposition 1.7.12 to find a perfect
collection {𝐺𝑧 ∶ 𝑧 ∈ 2𝜔 } of filters on Coll(𝜔, 2𝜔 ) mutually generic over the model 𝑀.
For each 𝑧 ∈ 2𝜔 let 𝑞𝑧 = 𝜏/𝐺𝑧 . We will find 𝑧 ∈ 2𝜔 such that 𝑓(𝑞𝑧 ) ∪ 𝑓(𝐴𝛼 ) is a
function. Since by the forcing theorem 𝑦𝛼 ∈ dom(𝑓(𝑞𝑧 )) holds, the recursion can then
successfully proceed with 𝐴𝛼+1 = 𝐴𝛼 ∪ 𝑞𝑧 .
For each 𝑧 ∈ 2𝜔 let 𝑐𝑧 = dom(𝑓(𝑞𝑧 )) ⧵ 𝑀 ⊂ 𝑌 . By the mutual genericity and the
product forcing theorem, if 𝑧0 , 𝑧1 ∈ 2𝜔 are distinct elements then 𝑐𝑧0 ∩ 𝑐𝑧1 = 0. Since
the set dom(𝑓(𝐴𝛼 )) ⊂ 𝑌 has cardinality ≤ |𝛼| + ℵ0 < |2𝜔 |, a counting argument yields
𝑧 ∈ 2𝜔 such that 𝑐𝑧 ∩ dom(𝑓(𝐴𝛼 )) = 0. We claim that 𝑓(𝑞𝑧 ) ∪ 𝑓(𝐴𝛼 ) is a function as
desired. To see this, let 𝑦 ∈ dom(𝑓(𝑞𝑧 )) be any point. If 𝑦 ∉ 𝑀 then 𝑦 ∉ dom(𝑓(𝐴𝛼 ))
by the choice of the point 𝑧. If 𝑦 ∈ 𝑀 and 𝑦 ∈ dom(𝑓(𝐴𝛼 )) then by the forcing theorem,
there must be a condition 𝑟 ∈ 𝐺𝑧 which forces 𝑦 ∈ dom(𝑞𝑧 ). Since 𝑓(𝐴𝛼̌ ) ⊂ 𝑓(𝜏) is
forced as well, it follows that 𝑟 ⊩ 𝑓(𝜏)(𝑦)̌ = 𝑓(𝐴𝛼̌ )(𝑦),
̌ so 𝑓(𝑞𝑧 )(𝑦) = 𝑓(𝐴𝛼 )(𝑦) holds by
the forcing theorem applied in 𝑀. In either case we see that 𝑓(𝑞𝑧 ) and 𝑓(𝐴𝛼 ) cannot
disagree at 𝑦, so 𝑓(𝑞𝑧 ) ∪ 𝑓(𝐴𝛼 ) is a function as desired.
At the end of the recursion, let 𝑔 = ⋃𝛼 𝑓(𝐴𝛼 ). First argue that 𝑔 is a master func-
tion. To this end, let 𝐺 ⊂ Coll(𝜔, 2𝜔 ) be a generic filter and move to 𝑉[𝐺]. There is
a condition 𝑞 ∈ 𝑃 such that 𝑔 ⊂ 𝑓(𝑞), namely 𝑞 = ⋃𝛼 𝐴𝛼 . In addition, if 𝑞 ∈ 𝑃 is a
condition such that 𝑔 ⊂ dom(𝑓(𝑞)) and 𝑦 ∈ dom(𝑓(𝑞)) ∩ 𝑉 is an arbitrary point, then
there is an ordinal 𝛼 ∈ 𝜅 such that 𝑦 = 𝑦𝛼 and then 𝑦 ∈ dom(𝑓(𝐴𝛼+1 )) ⊂ dom(𝑔)
holds by the third item of the recursion hypothesis. It follows that 𝑔 = 𝑓(𝑞) ∩ 𝑉, so 𝑔 is
indeed a master function. Finally, we have to see that Σ𝜎𝑔 ≤ 𝑝 is forced to hold in the
separative quotient of 𝑃. For this, note that the set 𝜎𝑔 is open and whenever a condition
𝑞 belongs to it then 𝑓(𝑝) ⊂ 𝑔 ⊂ 𝑓(𝑞), so the conditions 𝑝, 𝑞 are compatible in 𝑃. □
The class of fragmented simplicial complexes is rather broad and abstract. We now
present a long list of examples. The initial examples are grouped into two commonly
occurring classes. The classes are identified by the properties of the following natural
graph on the simplicial complex.
Definition 6.2.5. Let 𝒦 be a simplicial complex on a set 𝑋. Γ𝒦 is the graph on
𝒦 connecting sets 𝑎0 , 𝑎1 if 𝑎0 ∩ 𝑎1 = 0, 𝑎0 ∪ 𝑎1 ∉ 𝒦, and all proper subsets of 𝑎0 ∪ 𝑎1
belong to 𝒦.
Definition 6.2.6. A simplicial complex 𝒦 is locally countable if every set 𝑎 ∈ 𝒦
has only countably many Γ𝒦 -neighbors.
Theorem 6.2.7. Suppose that 𝒦 is a locally countable Borel simplicial complex on
a Polish space 𝑋. Then 𝒦 is fragmented and in the poset 𝑃 = 𝑃𝒦 ,
(1) for every maximal 𝒦-set 𝐴 ⊂ 𝑋, the pair ⟨Coll(𝜔, 𝐴), 𝐴⟩̌ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a maximal 𝒦-set 𝐴 ⊂ 𝑋 such that the
balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝐴), 𝐴⟩̌ are equivalent;
(3) distinct maximal 𝒦-sets yield inequivalent balanced pairs.
Proof. To identify the fragmentation, for each set 𝑎 ∈ 𝒦 let 𝑓(𝑎) be the countable
partial function from 𝒦 to 2 defined by 𝑓(𝑎)(𝑏) = 1 if 𝑏 ⊆ 𝑎 and 𝑓(𝑎)(𝑏) = 0 if there
is a set 𝑐 ⊆ 𝑎 such that {𝑏, 𝑐} ∈ Γ𝒦 . To show that 𝑓 is a fragmentation, suppose first
that 𝑎0 , 𝑎1 ∈ 𝒦 are sets and 𝑎0 ∪ 𝑎1 ∉ 𝒦. Let 𝑏 ⊂ 𝑎0 ∪ 𝑎1 be an inclusion-minimal
set which is not in 𝒦. Let 𝑏0 ⊂ 𝑎0 and 𝑏1 ⊂ 𝑎1 be disjoint sets such that 𝑏0 ∪ 𝑏1 = 𝑏.
It is immediate that 𝑓(𝑎0 )(𝑏0 ) = 1 and 𝑓(𝑎1 )(𝑏0 ) = 0; in other words, 𝑓(𝑎0 ) ∪ 𝑓(𝑎1 ) is
not a function. Suppose now that 𝑎0 , 𝑎1 ∈ 𝒦 are sets and 𝑎0 ∪ 𝑎1 ∈ 𝒦. To show that
𝑓(𝑎0 ) ∪ 𝑓(𝑎1 ) is a function, suppose for definiteness that 𝑏 ∈ 𝒦 is a set and 𝑓(𝑎0 )(𝑏0 ) =
1 holds, and argue that 𝑓(𝑎1 )(𝑏0 ) = 0 is impossible. By the definition of the function
𝑓, 𝑓(𝑎1 )(𝑏0 ) = 0 would mean that there is a set 𝑏1 ⊂ 𝑎1 such that {𝑏0 , 𝑏1 } ∈ 𝒦, in
particular 𝑏0 ∪ 𝑏1 ∉ 𝒦. Since 𝑏0 ⊂ 𝑎0 holds, we arrive at 𝑏0 ∪ 𝑏1 ⊂ 𝑎0 ∪ 𝑎1 ∈ 𝒦,
contradicting the closure of 𝒦 under subset.
Write Γ = Γ𝒦 . For (1), suppose that 𝐴 ⊂ 𝑋 is a maximal 𝒦-set and let 𝑔 = 𝑓(𝐴);
in view of Theorem 6.2.3(1), it is enough to show that 𝑔 is a master function. Suppose
towards a contradiction that in some extension, there is a condition 𝑝 ∈ 𝑃 such that
𝑔 ⊂ 𝑓(𝑝) and there is some 𝑎 ∈ 𝒦 ∩ 𝑉 such that 𝑎 ∈ dom(𝑓(𝑝)) ⧵ dom(𝑔). Then either
𝑎 ⊂ 𝑝 or there is 𝑏 ⊂ 𝑝 such that {𝑎, 𝑏} ∈ Γ. In the former case, 𝑎 ⊂ 𝐴 by maximality of
𝒦, so 𝑎 ∈ dom(𝑔). In the latter case, the set 𝑎 has only countably many Γ-neighbors,
and by the Mostowski absoluteness all of its neighbors are in 𝑉. In consequence, 𝑏 ∈ 𝑉
and 𝑏 ⊂ 𝐴 by the maximality of 𝐴, so 𝑎 ∈ dom(𝑔) again.
For (2), let 𝑔 be a master function. Write 𝐴 = ⋃{𝑎 ∈ dom(𝑔) ∶ 𝑔(𝑎) = 1}. We will
first argue that 𝐴 is a maximal 𝒦-set. Move to a generic extension in which there is a
condition 𝑝 ∈ 𝑃 such that 𝑔 ⊂ 𝑓(𝑝); strengthening the condition 𝑝 if necessary we may
assume that for each 𝑥 ∈ 𝑋 ∩ 𝑉 ⧵ 𝑝 there is a finite set 𝑏 ⊂ 𝑝 such that 𝑏 ∪ {𝑥} ∉ 𝒦.
Since 𝑝 is a 𝒦-set and 𝐴 ⊂ 𝑝, 𝐴 must be a 𝒦-set as well. Now let 𝑥 ∈ 𝑋 ∩ 𝑉 ⧵ 𝐴 be a
point. Since 𝑥 ∉ 𝐴, 𝑥 ∉ 𝑝 holds as well, and there must be an inclusion-minimal finite
set 𝑏 ⊂ 𝑝 such that 𝑏 ∪ {𝑥} ∉ 𝒦. Observe that {{𝑥}, 𝑏} ∈ Γ. Since {𝑥} has only countably
many Γ-neighbors, by the Mostowski absoluteness 𝑏 ⊂ 𝑉 follows. Now, 𝑏 ⊂ 𝑝, so
𝑓(𝑝)(𝑏) = 1, and by the maximality assumption on the master function 𝑔, 𝑔(𝑏) = 1. It
follows that 𝑏 ⊂ 𝐴, so 𝐴 is a maximal 𝒦-set.
Now, by (1), ⟨Coll(𝜔, 𝐴), 𝐴⟩̌ is a balanced pair. Also, Coll(𝜔, 2𝜔 ) ⊩ Σ𝜎𝑔 ≤ 𝐴̌ holds
by the definition of the set 𝐴. By Proposition 5.2.6, the balanced pairs ⟨Coll(𝜔, 𝐴), 𝐴⟩̌
and ⟨Coll(𝜔, 2𝜔 ), 𝜎𝑔 ⟩ are equivalent. The argument is concluded by a reference to The-
orem 6.2.3(2).
(3) is clear, and the last sentence follows from the fact that every 𝒦-set can be
extended to a maximal 𝒦-set by the Zorn–Kuratowski lemma. □
Locally countable simplicial complexes are typically designed to perform a certain co-
herent job on locally countable structures. We choose several representative examples
from a host of possibilities.
Example 6.2.8. Let 𝑋 be a Polish space and 𝐸 be a countable Borel equivalence re-
lation on 𝑋. Let 𝒦 be the simplicial complex of finite subsets of 𝑋 consisting of pairwise
𝐸-unrelated elements. The graph Γ𝒦 connects any pair of distinct 𝐸-related singletons
and contains no other edges; therefore, the simplicial complex 𝒦 is locally countable.
The poset 𝑃𝒦 adds an 𝐸-transversal. The balanced virtual conditions are classified by
𝐸-transversals by Theorem 6.2.7.
For the following example, recall the notion of a perfect matching of a graph; this is
just a set of edges such that each vertex gets exactly one edge in the set adjacent to it.
For a locally finite bipartite graph Γ, the existence of a perfect matching is equivalent
to Hall’s marriage condition [43]: for every finite set 𝑎 of vertices on one side of the
bipartition, the set of neighbors of 𝑎 has cardinality at least that of 𝑎.
Example 6.2.9. Let Γ be a locally finite bipartite Borel graph on a Polish space 𝑋
satisfying the Hall’s marriage condition; view Γ as a subset of [𝑋]2 . Let 𝒦 be the sim-
plicial complex of all finite subsets of Γ which can be completed to a perfect matching.
Then 𝒦 is a Borel locally countable simplicial complex: given a finite set 𝑎 ⊂ Γ, the
membership of 𝑎 in 𝒦 can be detected by checking all fragments of 𝑎 in the compo-
nents of Γ, which are countable. The balanced pairs are classified by maximal 𝒦-sets
which are precisely the perfect matchings of Γ.
For the following example, recall the notion of an end of an infinite connected graph
[41]. If the graph in question is in addition acyclic, an end can be identified with an
orientation of the graph in which every vertex gets exactly one edge flowing out of it.
Example 6.2.10. Let Γ be a locally finite acyclic Borel graph on a Polish space
𝑋 with all components infinite; view Γ as a symmetric subset of 𝑋 2 . Let 𝒦 be the
simplicial complex of all finite subsets 𝑎 ⊂ Γ such that for each Γ-path-connectedness
class 𝑐 ⊂ 𝑋 the set 𝑎 ∩ 𝑐2 can be extended to an end. It is immediate that 𝒦 is a Borel
locally countable simplicial complex. The balanced virtual conditions are classified
by maximal 𝒦-sets, which are orientations of the graph Γ in which every vertex has
exactly one point in its outflow.
Example 6.2.11. Let Γ be a locally countable Borel graph on a Polish space 𝑋 of
chromatic number ≤ 𝑛 for some finite 𝑛 ∈ 𝜔. Let 𝒦 be the simplicial complex of all
finite partial Γ-colorings by at most 𝑛 colors which can be completed to a total coloring
by at most 𝑛 colors. Then 𝒦 is a locally countable simplicial complex: given a finite
coloring 𝑎, the membership of 𝑎 in 𝒦 can be detected by checking all fragments of 𝑎
in components of Γ which are countable. The balanced pairs are classified by maximal
𝒦-sets which are precisely the total Γ-colorings.
The next class of examples is broader than the locally countable simplicial complexes.
Appropriately, the classification of balanced virtual conditions is more vague.
Definition 6.2.12. A Borel simplicial complex 𝒦 on a Polish space 𝑋 has Borel
coloring number ℵ1 if there is a Borel orientation of Γ𝒦 in which every vertex has count-
able outflow.
In particular, every locally countable Borel simplicial complex has Borel coloring num-
ber ℵ1 . Classification of balanced virtual conditions here uses the following notion.
Definition 6.2.13. Let 𝒦 be a simplicial complex on a set 𝑋. A 𝒦-set 𝐴 ⊂ 𝑋 is
weakly maximal if for every 𝑥 ∉ 𝐴 and every countable set 𝐵 ⊂ 𝑋 there is a finite set
𝑏 ⊂ 𝑋 ⧵ 𝐵 such that (𝐴 ∩ 𝐵) ∪ 𝑏 is a 𝒦-set while (𝐴 ∩ 𝐵) ∪ 𝑏 ∪ {𝑥} is not. For a weakly
maximal set 𝐴 ⊂ 𝑋 let 𝜏𝐴 be the Coll(𝜔, 2𝜔 )-name for the analytic set of conditions
𝑝 ∈ 𝑃𝒦 such that 𝐴 ⊂ 𝑋 and for all ground model points 𝑥 ∈ 𝑋 ⧵ 𝐴, 𝑝 ∪ {𝑥} is not a
𝒦-set.
In particular, every maximal 𝒦-set is weakly maximal. The opposite implication is far
from true, as Example 6.2.16 shows.
Theorem 6.2.14. Let 𝒦 be a Borel simplicial complex on a Polish space 𝑋 with Borel
coloring number ℵ1 . The complex 𝒦 is fragmented and in the poset 𝑃 = 𝑃𝒦 ,
(1) for every weakly maximal 𝒦-set 𝐴 ⊂ 𝑋, the pair ⟨Coll(𝜔, 2𝜔 ), 𝜏𝐴 ⟩ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a weakly maximal 𝒦-set 𝐴 ⊂ 𝑋 such that
the balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 2𝜔 ), 𝜏𝐴 ⟩ are equivalent;
(3) distinct weakly maximal 𝒦-sets yield inequivalent balanced pairs.
Proof. Write Γ = Γ𝒦 . Let Γ⃗ be a Borel orientation of the graph Γ in which each
vertex receives countable outflow. To identify the fragmentation, for each set 𝑎 ∈ 𝒦 let
𝑓(𝑎) be the countable partial function from 𝒦 to 2 defined by 𝑓(𝑎)(𝑏) = 1 if 𝑏 ⊆ 𝑎 and
𝑓(𝑎)(𝑏) = 0 if there is a set 𝑐 ⊆ 𝑎 such that ⟨𝑐, 𝑏⟩ ∈ Γ.⃗ To show that 𝑓 is a fragmentation,
suppose first that 𝑎0 , 𝑎1 ∈ 𝒦 are sets and 𝑎0 ∪ 𝑎1 ∉ 𝒦. Let 𝑏 ⊂ 𝑎0 ∪ 𝑎1 be an inclusion-
minimal set which is not in 𝒦. Let 𝑏0 ⊂ 𝑎0 and 𝑏1 ⊂ 𝑎1 be disjoint sets such that
𝑏0 ∪ 𝑏1 = 𝑏. Suppose for definiteness that ⟨𝑏0 , 𝑏1 ⟩ ∈ Γ.⃗ It is immediate that 𝑓(𝑎0 )(𝑏0 ) =
1 and 𝑓(𝑎1 )(𝑏0 ) = 0; in other words, 𝑓(𝑎0 ) ∪ 𝑓(𝑎1 ) is not a function. Suppose now
that 𝑎0 , 𝑎1 ∈ 𝒦 are sets and 𝑎0 ∪ 𝑎1 ∈ 𝒦. To show that 𝑓(𝑎0 ) ∪ 𝑓(𝑎1 ) is a function,
suppose for definiteness that 𝑏 ∈ 𝒦 is a set and 𝑓(𝑎0 )(𝑏0 ) = 1 holds, and argue that
𝑓(𝑎1 )(𝑏0 ) = 0 is impossible. By the definition of the function 𝑓, 𝑓(𝑎1 )(𝑏0 ) = 0 would
mean that there is a set 𝑏1 ⊂ 𝑎1 such that {𝑏0 , 𝑏1 } ∈ 𝒦, in particular 𝑏0 ∪ 𝑏1 ∉ 𝒦. Since
𝑏0 ⊂ 𝑎0 holds, we arrive at 𝑏0 ∪ 𝑏1 ⊂ 𝑎0 ∪ 𝑎1 ∈ 𝒦, contradicting the closure of 𝒦 under
subset.
For (1), we must first show that Coll(𝜔, 𝑋) ⊩ 𝜏𝐴 ≠ 0. By a Mostowski absoluteness
argument, it is just enough to produce some generic extension in which there is a 𝒦-
set 𝑝 ⊂ 𝑋 such that for all 𝑥 ∈ 𝑋 ∩ 𝑉, if 𝑥 ∈ 𝐴 then 𝑥 ∈ 𝑝 and if 𝑥 ∉ 𝐴 then 𝑝 ∪ {𝑥}
is not a 𝒦-set. To do this, let 𝑄 be the poset of nonstationary subsets of [𝑋]ℵ0 and let
𝑗 ∶ 𝑉 → 𝑀 be the 𝑄-name for the associated generic ultrapower. In particular, 𝑀 is an
𝜔-model of ZFC containing 𝑗″ 𝑋 as an element, represented by the identity function;
this set is forced to be countable in 𝑀. Now, consider a product of copies 𝑄𝑥 of 𝑄
indexed by elements 𝑥 ∈ 𝑋 ⧵ 𝐴, with mutually generic filters 𝐺𝑥 ⊂ 𝑄𝑥 and in the model
𝑉[𝐺𝑥 ∶ 𝑥 ∈ 𝑋 ⧵ 𝐴] consider the generic ultrapower embeddings 𝑗𝑥 ∶ 𝑉 → 𝑀𝑥 . By the
weak maximality of 𝐴 and elementarity, for each 𝑥 ∈ 𝑋 ⧵ 𝐴 there is a set 𝑐𝑥 ∈ 𝑀𝑥
disjoint from 𝑉 such that 𝐴 ∪ 𝑐𝑥 is a 𝒦-set, and 𝐴 ∪ 𝑐𝑥 ∪ {𝑥} is not. We claim that
𝑝 = 𝐴∪⋃𝑥 𝑐𝑥 is a 𝒦-set; this will complete the proof. Suppose towards a contradiction
that this is not the case, and find finite sets 𝑎 ⊂ 𝐴 and 𝑎𝑥 ⊂ 𝑐𝑥 for 𝑥 in some finite index
set 𝐼 such that 𝑎 ∪ ⋃𝑥 𝑎𝑥 ∉ 𝒦 and 𝑎𝑥 are inclusion-minimal possible. Let 𝑥0 be any
element of 𝐼 such that 𝑎𝑥0 ≠ 0, let 𝑏 = 𝑎𝑥0 , and let 𝑐 = 𝑎 ∪ ⋃{𝑎𝑥 ∶ 𝑥 ∈ 𝐼 ⧵ {𝑥0 }}. It
is clear that {𝑐, 𝑏} ∈ Γ. Let Γ⃗ be a Borel orientation of Γ with countable outflows, and
assume for definiteness that ⟨𝑐, 𝑏⟩ ∈ Γ.⃗ Write 𝑀 = 𝑉[𝐺𝑥 ∶ 𝑥 ∈ 𝑋 ⧵ (𝐴 ∪ {𝑥0 })]. By a
Mostowski absoluteness argument between 𝑀 and 𝑉[𝐺𝑥 ∶ 𝑥 ∈ 𝑋 ⧵ 𝐴], it must be the
⃗
case that 𝑏, along with all other points of the countable Γ-outflow of 𝑐, belongs to 𝑀,
so 𝑏 ∈ 𝑀 ∩ 𝑉[𝐺𝑥0 ] = 𝑉. This contradicts the initial choice of the sets 𝑎𝑥 ⊂ 𝑐𝑥 .
Now, for the balance part, suppose that 𝑉[𝐻0 ] and 𝑉[𝐻1 ] are mutually generic
extensions of 𝑉, and 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ] are conditions such that for all
𝑥 ∈ 𝑋∩𝑉, if 𝑥 ∈ 𝐴 then 𝑥 ∈ 𝑝0 and if 𝑥 ∉ 𝐴 then 𝑝0 ∪{𝑥} is not a 𝒦-set, and similarly for
𝑝1 . We must show that 𝑝0 ∪𝑝1 is a 𝒦-set. Suppose towards a contradiction that this fails,
and let 𝑎0 ⊂ 𝑝0 and 𝑎1 ⊂ 𝑝1 be finite sets such that 𝑎0 ∪𝑎1 ∉ 𝒦. Passing to an inclusion-
minimal example of this form if necessary, we may assume that {𝑎0 , 𝑎1 } ∈ Γ. Let Γ⃗
be a Borel orientation of Γ with countable outflows, and assume for definiteness that
⟨𝑎0 , 𝑎1 ⟩ ∈ Γ.⃗ By a Mostowski absoluteness argument between 𝑉[𝐻0 ] and 𝑉[𝐻0 , 𝐻1 ], it
⃗
must be the case that 𝑎1 , as much as all other points of the countable Γ-outflow of 𝑎0 ,
belongs to 𝑉[𝐻0 ], so 𝑎1 ∈ 𝑉[𝐻1 ] ∩ 𝑉[𝐻0 ] = 𝑉. It follows that 𝑎1 ⊂ 𝐴 ⊂ 𝑝0 , and this
contradicts the assumption that 𝑎0 ∪ 𝑎1 ∉ 𝒦.
For (2), let ⟨𝑄, 𝜏⟩ be a balanced pair; strengthening 𝜏 if necessary we may assume
that it is a 𝑄-name for a single 𝒦-set. Replacing 𝑄 with 𝑄×Coll(𝜔, 𝑋) and strengthening
the condition 𝜏 if necessary, we may assume that 𝑄 ⊩ ∀𝑥 ∈ 𝑋 𝑉 𝑥 ∈ 𝜏 or there is 𝑎 ⊂ 𝜏
such that {𝑥}∪𝑎 ∉ 𝒦. By a balance argument (Proposition 5.2.4), for each point 𝑥 ∈ 𝑋,
either 𝑄 ⊩ 𝑥̌ ∈ 𝜏 or 𝑄 ⊩ ∃𝑎 ⊂ 𝜏 {𝑥} ∪ 𝑎 ∉ 𝒦 holds. Let 𝐴 ⊂ 𝑋 be the set of all points
𝑥 ∈ 𝑋 for which the first option prevails. Then 𝑄 ⊩ 𝐴̌ = 𝜏 ∩ 𝑉 and therefore 𝐴 is a 𝒦-
set; in view of (1) and Proposition 5.2.6, it is enough to show that 𝐴 is a weakly maximal
𝒦-set. Let 𝑥 ∈ 𝑋 ⧵ 𝐴 and 𝑏 ⊂ 𝑋 be countable. Observe that 𝑄 ⊩ ∃𝑐 ⊂ 𝜏 {𝑥} ∪ 𝑐 ∉ 𝒦;
note that for such set 𝑐, (𝐴 ∩ 𝑏) ∪ (𝑐 ⧵ 𝑏) is still a 𝒦-set. Use the Mostowski absoluteness
argument to find a set 𝑐 with these properties in the ground model; this confirms that
𝐴 is a weakly maximal 𝒦-set.
Finally, (3) is obvious. For the last sentence, any condition 𝑝 ∈ 𝑃 can be extended
to a maximal 𝒦-set, which then represents a balanced virtual condition stronger than
𝑝 by (1). □
Example 6.2.15. Let 𝑋 be a Polish space and let 𝑓 ∶ 𝑋 → [𝑋]ℵ0 be a Borel set
mapping. Let 𝒦 be the simplicial complex on 𝑋 consisting of all finite 𝑓-free sets 𝑎 ⊂
𝑋. Note that the graph Γ𝒦 consists of all pairs {{𝑥}, {𝑦}} such that either 𝑥 ∈ 𝑓(𝑦) or
𝑦 ∈ 𝑓(𝑥). Let Γ𝒦⃗ be any Borel orientation of Γ𝒦 such that ⟨{𝑥}, {𝑦}⟩ ∈ Γ𝒦⃗ if 𝑦 ∈ 𝑓(𝑥). It
is immediate that every vertex in 𝒦 receives countable outflow. The poset The poset 𝑃𝒦
adds a maximal 𝑓-free set and Theorem 6.2.14 applies to classify the balanced virtual
conditions.
Example 6.2.16. Let 𝑋 be a Polish space, let Γ be a Borel graph on 𝑋 and let 𝑛 > 2
be a number. Let 𝒦 be the simplicial complex on Γ consisting of sets 𝑎 ⊂ Γ which
do not contain any clique on 𝑛 vertices. To analyze the graph Γ𝒦 , for 𝑎 ∈ 𝒦 write 𝑣𝑎
for the set of vertices mentioned in some edge in 𝑎; formally, 𝑣𝑎 = ⋃ 𝑎. Suppose that
{𝑎, 𝑏} ∈ Γ𝒦 ; we claim that either 𝑣𝑎 ⊆ 𝑣𝑏 or 𝑣𝑏 ⊆ 𝑣𝑎 holds. Indeed, by the minimality of
𝑎 ∪ 𝑏, the set 𝑣𝑎 ∪ 𝑣𝑏 has cardinality 𝑛. If there were vertices 𝑥 ∈ 𝑣𝑎 ⧵ 𝑣𝑏 and 𝑦 ∈ 𝑣𝑏 ⧵ 𝑣𝑎 ,
then the edge {𝑥, 𝑦} could not belong to 𝑎∪𝑏, so 𝑎∪𝑏 could not be a clique, contradicting
the initial assumptions on 𝑎 and 𝑏.
Let Γ𝒦⃗ be any Borel orientation of the graph Γ𝒦 such that ⟨𝑎, 𝑏⟩ ∈ Γ𝒦⃗ implies 𝑣𝑏 ⊆
𝑣𝑎 . It is immediate that each vertex 𝑎 ∈ 𝒦 has finite outflow. The poset 𝑃𝒦 adds a
maximal subgraph of Γ containing no clique on 𝑛 vertices and Theorem 6.2.14 applies
to classify the balanced virtual conditions.
In the last example, consider the case Γ = [𝑋]2 . The definition of a weakly maximal set
in this case shows that truly every 𝒦-set (including the empty set) is weakly maximal.
Thus there are possibly many more balanced virtual conditions in the case of complexes
with Borel coloring number ℵ1 than in the case of locally countable complexes.
Another large class of fragmented simplicial complexes comes from modular ma-
troids; it is introduced in Section 6.3 below.
6.3. Matroids
Many useful simplicial complexes are in fact matroids.
Definition 6.3.1. [2, Chapters VI and VII] Let 𝒦 be a simplicial complex on a set
𝑋. 𝒦 is a matroid if it has the exchange property: for any sets 𝑎, 𝑏 ∈ 𝒦, if |𝑏| > |𝑎| then
there is 𝑥 ∈ 𝑏 ⧵ 𝑎 such that 𝑎 ∪ {𝑥} ∈ 𝒦.
Note that if 𝒦 is a Borel simplicial complex on a Polish space 𝑋, then the statement that
𝒦 is a matroid is coanalytic and therefore absolute for all transitive models of ZFC. To
begin our treatment of matroids from forcing point of view, we record several standard
definitions of matroid theory.
Definition 6.3.2. Let 𝒦 be a matroid on a set 𝑋 and let 𝑎 ⊂ 𝑋 be a finite set.
(1) 𝚛𝚔(𝑎), the matroid rank of the set 𝑎, is the largest cardinality of a set 𝑏 ⊂ 𝑎 in
𝒦;
(2) 𝚌𝚕(𝑎), the matroid closure of the set 𝑎, is the set {𝑥 ∈ 𝑋 ∶ 𝚛𝚔(𝑎 ∪ 𝑥) = 𝚛𝚔(𝑎)}.
If the set 𝑎 is infinite, we let 𝚛𝚔(𝑎) = sup{𝚛𝚔(𝑏) ∶ 𝑏 ∈ [𝑎]<ℵ0 } (possibly an infinite
value, ∞) and 𝚌𝚕(𝑎) = ⋃{𝚌𝚕(𝑏) ∶ 𝑏 ∈ [𝑎]<ℵ0 }.
Note that the exchange property implies that all inclusion-maximal sets 𝑏 ⊂ 𝑎 in 𝒦
have the same cardinality. The exchange property also implies that the closure opera-
tion 𝚌𝚕 is idempotent: 𝚌𝚕(𝑎) = 𝚌𝚕(𝚌𝚕(𝑎)). The sets 𝑎 and 𝚌𝚕(𝑎) have the same rank. A
finite set 𝑎 ⊂ 𝑋 belongs to the matroid just in case that for every 𝑥 ∈ 𝑎, 𝑥 ∉ 𝚌𝚕(𝑎 ⧵ {𝑥}).
A common alternative axiomatization of matroids uses several properties of the clo-
sure operator and the language of pre-geometries. The axiomatization we choose to
use makes the complexity computations easier.
6.3. MATROIDS 125
The following definition records a class of matroids which is particularly well-

behaved from model-theoretic as well as balanced forcing point of view.
Definition 6.3.3. Let 𝒦 be a matroid on a set 𝑋.
(1) 𝒦 has countable closures if the matroid closure of any finite set is countable;
(2) 𝒦 is modular if for any finite sets 𝑎0 , 𝑎1 ⊂ 𝑋 and any 𝑥 ∈ 𝚌𝚕(𝑎0 ∪ 𝑎1 ) there
are elements 𝑥0 ∈ 𝚌𝚕(𝑎0 ) and 𝑥1 ∈ 𝚌𝚕(𝑎1 ) such that 𝑥 ∈ 𝚌𝚕(𝑥0 , 𝑥1 ).
An uneventful complexity calculation shows that if 𝒦 is a Borel matroid on a Polish
space 𝑋 then both items (1) and (2) above are ℿ12 statements and therefore absolute
among all forcing extensions by a Shoenfield absoluteness argument.
Theorem 6.3.4. Let 𝒦 be a Borel modular matroid with countable closures on a
Polish space 𝑋. Let 𝐵 ⊂ 𝑋 be a Borel set and write ℒ = 𝒦 ↾ 𝐵. Then ℒ is fragmented and
in the poset 𝑃 = 𝑃ℒ ,
(1) for every maximal ℒ-set 𝐴 ⊂ 𝐵, the pair ⟨Coll(𝜔, 𝐴), 𝐴⟩̌ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a maximal ℒ-set 𝐴 ⊂ 𝐵 such that the
balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝐴), 𝐴⟩̌ are equivalent;
(3) distinct maximal ℒ-sets yield inequivalent balanced pairs.
Proof. We start with a standard claim which does not depend on the modularity
assumption.
Claim 6.3.5. If 𝑎 ∈ 𝒦 is a set and 𝑥 ∈ 𝚌𝚕(𝑎) then there is inclusion-smallest set
𝑏 ⊆ 𝑎 such that 𝑥 ∈ 𝚌𝚕(𝑏).
Proof. Suppose towards contradiction that this fails. Then, there must be sets
𝑏0 , 𝑏1 ⊂ 𝑎 such that 𝑥 ∈ 𝚌𝚕(𝑏0 ) ∩ 𝚌𝚕(𝑏1 ) and 𝑥 ∉ 𝚌𝚕(𝑏0 ∩ 𝑏1 ). The latter condition
implies that (𝑏0 ∩ 𝑏1 ) ∪ {𝑥} ∈ 𝒦. Find an inclusion-maximal set 𝑐 ⊂ 𝑏1 ∪ {𝑥} in 𝒦
containing (𝑏0 ∩ 𝑏1 ) ∪ {𝑥}. By the exchange property, |𝑐| = |𝑏1 |, so there is a unique
element 𝑥1 ∈ 𝑏1 ⧵ 𝑐. By the idempotence of the closure operation, 𝑥1 ∈ 𝚌𝚕((𝑏0 ∪ 𝑏1 ) ⧵
{𝑥1 }). This contradicts the assumption that 𝑎 ∈ 𝒦 holds. □
For the fragmentation, for each 𝑎 ∈ 𝒦 let 𝑓(𝑎) be the function with domain 𝚌𝚕(𝑎)
which to each 𝑥 ∈ 𝚌𝚕(𝑎) assigns the inclusion smallest set 𝑏 ⊂ 𝑎 such that 𝑥 ∈ 𝚌𝚕(𝑏).
This is well-defined by the claim; we need to verify that 𝑓 is in fact a fragmentation of
𝒦. Suppose first that 𝑎0 , 𝑎1 ∈ 𝒦 are sets such that 𝑎0 ∪ 𝑎1 ∈ 𝒦. If 𝑥 ∈ 𝚌𝚕(𝑎0 ) ∩ 𝚌𝚕(𝑎1 )
is any element, then by the claim applied to 𝑎 = 𝑎0 ∪𝑎1 we conclude that the inclusion-
smallest set 𝑏 ⊂ 𝑎0 such that 𝑥 ∈ 𝚌𝚕(𝑏) is equal to the inclusion-smallest set 𝑏 ⊂ 𝑎1
such that 𝑥 ∈ 𝚌𝚕(𝑏) as it must be a subset of 𝑎0 ∩ 𝑎1 . It follows that 𝑓(𝑎0 ) ∪ 𝑓(𝑎1 ) is a
function. Suppose now that 𝑎0 , 𝑎1 ∈ 𝒦 are sets such that 𝑎0 ∪ 𝑎1 ∉ 𝒦. Find a point
𝑦 ∈ 𝑎1 ⧵ 𝑎0 such that 𝑦 ∈ 𝚌𝚕(𝑎0 ∪ (𝑎1 ⧵ {𝑦}). Use the modularity assumption to find
points 𝑥0 ∈ 𝚌𝚕(𝑎0 ) and 𝑥1 ∈ 𝚌𝚕(𝑎1 ⧵ (𝑎0 ∪ {𝑦})) such that 𝑦 ∈ 𝚌𝚕(𝑥0 , 𝑥1 ). The last
formula means that 𝚛𝚔(𝑥0 , 𝑥1 , 𝑦) < 3, so 𝑥0 ∈ 𝚌𝚕(𝑥1 , 𝑦) ⊂ 𝚌𝚕(𝑎1 ⧵ 𝑎0 ). It follows that
𝑓(𝑎0 )(𝑥0 ) ≠ 𝑓(𝑎1 )(𝑥0 ) as the former is a subset of 𝑎0 and the latter is a subset of 𝑎1 ⧵ 𝑎0 .
Thus, 𝑓(𝑎0 ) ∪ 𝑓(𝑎1 ) is not a function as required.
It immediately follows that ℒ is a fragmented simplicial complex as well; the re-
striction of 𝑓 to ℒ is a fragmentation for ℒ. Now, for (1), suppose that 𝐴 ⊂ 𝐵 is a
maximal ℒ-set. Let 𝑔 = 𝑓(𝐴); by Theorem 6.2.3 it will be enough to show that 𝑔 is a
master function. To this end, let 𝐶 = dom(𝑔). The maximality of the set 𝐴 implies that
𝐶 = 𝚌𝚕(𝐵), where the closure is taken in the matroid 𝒦. This means that no element
𝑥 ∈ (𝐵 ∩ 𝑉) ⧵ 𝐶 can appear in dom(𝑓(𝑝)) for any condition 𝑝 ∈ 𝑃 with 𝑔 ⊂ 𝑓(𝑝)) in
any generic extension. It follows immediately that 𝑔 is inclusion-maximal among all
functions 𝑓(𝑝) ↾ 𝑉 for 𝑝 ∈ 𝑃 in the Coll(𝜔, 2𝜔 )-extension. Thus, 𝑔 is a master function.
For (2), by Theorem 6.2.3 it is enough to consider the case where ⟨𝑄, 𝜏⟩ has the
form ⟨Coll(𝜔, 𝑋), 𝜏𝑔 ⟩ for some master function 𝑔. Let 𝐴 = ⋃ rng(𝑔) ⊂ 𝐵. In view of
(1) and Theorem 6.2.3(2), it is enough to show that 𝐴 ⊂ 𝐵 is a maximal ℒ-set. First
of all, 𝐴 ⊂ 𝐵 is indeed a 𝒦-set since the Coll(𝜔, 2𝜔 )-extension, it is a subset of any
condition 𝑝 ∈ 𝑃 for which 𝑔 ⊂ 𝑓(𝑝). Second, 𝐴 must be maximal. Otherwise, there
would be a point 𝑥 ∈ 𝐵 ⧵ 𝐴 such that 𝐴 ∪ {𝑥} is a 𝒦-set. It is not difficult to see that
the pair ⟨𝑥, {𝑥}⟩ would belong to 𝑓(𝐴 ∪ {𝑥}) but not to 𝑓(𝐴). This would contradict the
maximality demand on the function 𝑔.
(3) is clear. The balance of the poset 𝑃 follows from (1) and the fact that any ℒ-set
can be extended to a maximal ℒ-set by an application of the Zorn–Kuratowski lemma.
□
Example 6.3.6. (Linear matroid) Let 𝑋 be a Borel vector space over a countable
field Φ. Let 𝒦 be the simplicial complex of finite linearly independent subsets of 𝑋.
Then 𝒦 is a Borel modular matroid with countable closures, so fragmented by Theo-
rem 6.3.4. The forcing 𝑃𝒦 is balanced and the balanced virtual conditions are classified
by the bases of the space 𝑋.
Example 6.3.7. (Graphic matroid) Let 𝑋 be a Polish space, let Γ ⊂ [𝑋]2 be a Borel
graph on 𝑋, and let ℒ be the simplicial complex on Γ of finite acyclic subsets of Γ. Then
ℒ is a restriction of a modular matroid to a Borel set. To see this, view [𝑋]<ℵ0 as a Borel
Boolean group with the symmetric difference operation and a vector space over the
binary field. Note that for a finite set 𝑏 ⊂ [𝑋]<ℵ0 , the sum of all its elements in the
group is the set {𝑥 ∈ 𝑋 ∶ |{𝑎 ∈ 𝑏 ∶ 𝑥 ∈ 𝑎}| is odd}. Let 𝒦 be the simplicial complex of
linearly independent subsets of [𝑋]<ℵ0 . Then 𝒦 is a linear matroid as in Example 6.3.6
and ℒ = 𝒦 ↾ Γ. To see the latter equality, note that the sum of any cycle (viewed as a
set of edges) is empty, so a cycle is not linearly independent. On the other hand, the
sum of an acyclic finite set of edges cannot be empty as there are vertices which belong
to exactly one edge in the set; therefore, acyclic sets of edges are linearly independent.
As a result, the forcing 𝑃ℒ is balanced and the balanced virtual conditions are classified
by spanning acyclic subgraphs of Γ.
The final class of simplicial complexes investigated in this section deals with matroids
which are particularly simple from the descriptive set theoretic view. An important
point is that these matroids are not in general fragmented.
Definition 6.3.8. A simplicial complex 𝒦 on a Polish space 𝑋 is 𝐺𝛿 if it is a 𝐺𝛿

subset of [𝑋]<ℵ0 , where the latter set is equipped with the topology inherited from the
hyperspace 𝐾(𝑋) of compact subsets of 𝑋 with the Vietoris topology.
Theorem 6.3.9. Let 𝒦 be a 𝐺𝛿 matroid on a Polish space 𝑋. Write 𝑃 = 𝑃𝒦 .

(1) If 𝐴 ⊂ 𝑋 is a maximal 𝒦-set, then the pair ⟨Coll(𝜔, 𝐴), 𝐴⟩̌ is balanced in the
poset 𝑃;
6.3. MATROIDS 127
(2) whenever ⟨𝑄, 𝜏⟩ is a balanced pair in 𝑃 then there is a maximal 𝒦-set such that
the balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝐴), 𝐴⟩̌ are equivalent;
(3) distinct maximal 𝒦-sets yield inequivalent balanced pairs.
Proof. For (1), suppose that 𝑅0 ⊩ 𝜎0 ⊂ 𝑋 is a finite set such that 𝐴 ∪ 𝜎0 is a 𝒦-set,
and similarly for 𝑅1 , 𝜎1 ; we must show that 𝑅0 × 𝑅1 ⊩ 𝜎0 ∪ 𝜎1 ∈ 𝒦. Suppose towards a
contradiction that this fails; rearranging the names 𝜎0 , 𝜎1 and passing to a condition in
𝑅0 , 𝑅1 if necessary, we may assume that 𝑅0 ⊩ 𝜎0 ∩ 𝑉 = 0 and 𝑅0 × 𝑅1 ⊩ 𝜎0 ∪ 𝜎1 ∉ 𝒦.
Since the matroid 𝒦 is 𝐺𝛿 , Proposition 1.7.11 implies that there is a ground model set
𝑏 ∈ 𝒦 such that 𝑅0 ⊩ 𝜎0 ∪ 𝑏 ∉ 𝒦. Thus, 𝑅0 ⊩ ∃𝑥 ∈ 𝜎0 𝑥 ∈ 𝚌𝚕(𝑏 ̌ ∪ 𝜎0 ⧵ {𝑥}). Use the
maximality of the set 𝐴 ⊂ 𝑋 to find an inclusion-minimal finite set 𝑎 ⊂ 𝐴 such that
𝑏 ⊂ 𝚌𝚕(𝑎). By the idempotence of matroid closure, 𝑅0 ⊩ ∃𝑥 ∈ 𝜎0 𝑥 ∈ 𝚌𝚕(𝑎̌ ∪ 𝜎0 ⧵ {𝑥}).
This contradicts the initial assumption on the name 𝜎0 .
For (2), let ⟨𝑄, 𝜏⟩ be a balanced pair. Replacing 𝑄 with 𝑄 × Coll(𝜔, 𝑋) and strength-
ening 𝜏 if necessary, we may assume that 𝑄 ⊩ ∀𝑥 ∈ 𝑋 ∩ 𝑉 𝑥 ∈ 𝜏 or {𝑥} ∪ 𝜏 is not a
𝒦-set. By a balance argument (Proposition 5.2.4), for each 𝑥 ∈ 𝑋 it must be the case
that either 𝑄 ⊩ 𝑥̌ ∈ 𝜏 or 𝑄 ⊩ {𝑥}̌ ∪ 𝜏 is not a 𝒦-set. Let 𝐴 ⊂ 𝑋 be the set of those
points 𝑥 ∈ 𝑋 for which the former case prevails. Since 𝑄 ⊩ 𝜏 ≤ 𝐴,̌ in view of (1) and
Proposition 5.2.6 it will be enough to show that 𝐴 ⊂ 𝑋 is a maximal 𝒦-set.
Certainly, 𝐴 ⊂ 𝑋 is a 𝒦-set since it is forced to be a subset of a 𝒦-set 𝜏. Now
suppose that 𝐴 ⊂ 𝑋 is not maximal and pick a point 𝑥 ∉ 𝐴 such that 𝐴 ∪ {𝑥} is still a
𝒦-set. Passing to a condition of 𝑄 if necessary, we may find a finite set 𝑎 ⊂ 𝐴 and a
𝑄-name 𝜎 for a finite subset of 𝜏 such that 𝑄 forces 𝑥̌ ∈ 𝚌𝚕(𝑎̌ ∪ 𝜎) and 𝑥 ∉ 𝚌𝚕(𝑏) for any
proper subset 𝑏 ⊂ 𝑎∪𝜎. ̌ Let 𝜂 be a 𝑄-name for an inclusion-maximal subset of 𝑎∪{𝑥}∪𝜎
which is in 𝒦 and contains 𝑎 ∪ {𝑥}. Thus, 𝑄 forces 𝜂 ≠ 𝑎 ∪ {𝑥} ∪ 𝜎 and 𝜎 ⊂ 𝚌𝚕(𝜂) by the
exchange property of the matroid. Let 𝐻0 , 𝐻1 ⊂ 𝑄 be filters mutually generic over 𝑉
and write 𝑝0 = 𝜏/𝐻0 , 𝑏0 = 𝜎/𝐻0 , and 𝑐0 = 𝜂/𝐻0 , and similarly for 𝑝1 , 𝑏1 , 𝑐1 . It will be
enough to show that 𝑎 ∪ 𝑏0 ∪ 𝑏1 ∉ 𝒦, since this will contradict the initial assumption
of balance of the name 𝜏 and the resulting compatibility of conditions 𝑝0 , 𝑝1 ∈ 𝑃.
Note that 𝑥 ∈ 𝚌𝚕(𝑎 ∪ 𝑏0 ) holds. By the idempotence of the closure, it follows that
𝑏1 ⧵ 𝑐1 ⊂ 𝚌𝚕(𝑎 ∪ 𝑏0 ∪ 𝑐1 ) holds. Since 𝑎 ∪ 𝑏0 ∪ 𝑐1 is a proper subset of 𝑎 ∪ 𝑏0 ∪ 𝑏1 , this
shows that the latter set is not free and completes the proof of (2).
Finally, (3) is obvious. The last sentence of the theorem follows from a straigh-
forward application of the Kuratowski–Zorn lemma–every 𝒦-set can be extended to a
maximal 𝒦-set. □
Example 6.3.10. [48] (An algebraic matroid) Let 𝑋 be a Polish field over a count-
able subfield Φ. Consider the Borel simplicial complex 𝒦 of finite subsets of 𝑋 which
are algebraically free over Φ. Thus, a finite set 𝑎 ⊂ 𝑋 is not in 𝒦 just in case it is a
solution to a nontrivial polynomial with coefficients in 𝐹. There are only countably
many such polynomials and for each of them, the set of solutions is 𝐹𝜍 . Thus, the sim-
plicial complex 𝒦 is 𝐺𝛿 . The simplicial complex 𝒦 is well-known to be a matroid [77]
[85, Theorem 6.7.1]. As a result, the poset 𝑃𝒦 is balanced by Theorem 6.3.9. The poset
adds a transcendence basis to the field 𝑋 as the union of the generic filter.
6.4. Quotient variations

Many simplicial complex forcings are naturally connected with Borel equivalence
relations. One can define a quotient variation of fragmentation where the fragmenta-
tion function returns partial countable functions from one quotient space to another,
instead of countable functions from a Polish space to a Polish space. However, in the
quotient context, existence of the master functions is not guaranteed and closer analysis
of special cases is necessary. Rather than going through the rather abstract fragmen-
tation motions, we directly identify two general schemas for defining useful quotient
simplicial complexes and their associated posets: collapse posets for quotient cardinals
and uniformization posets for quotient spaces.
Definition 6.4.1. Let 𝐸, 𝐹 be Borel equivalence relations on Polish spaces 𝑋, 𝑌

with uncountably many classes each. Let 𝒦𝐸,𝐹 = 𝒦 be the simplicial complex on the
set (𝑋 × 𝑌 ) ∪ 𝑌 consisting of finite sets 𝑎 such that for all ⟨𝑥0 , 𝑦0 ⟩, ⟨𝑥1 , 𝑦1 ⟩ ∈ 𝑎, 𝑥1 𝐸 𝑥0
if and only if 𝑦1 𝐹 𝑦0 holds, and for all ⟨𝑥0 , 𝑦0 ⟩, 𝑦2 ∈ 𝑎, 𝑦0 𝐹 𝑦2 fails. Clearly, 𝒦 is an
(𝐸 × 𝐹) ∪ 𝐹-quotient complex. The associated poset 𝑃𝒦 is referred to as the 𝐸, 𝐹-collapse
poset.
If 𝐴 ⊂ (𝑋 × 𝑌 ) ∪ 𝑌 is a generic set, the part 𝐴 ∩ (𝑋 × 𝑌 ) is an injection from 𝑋/𝐸 to

𝑌 /𝐹, while the part 𝐴∩𝑌 is the complement of the range of 𝐴∩(𝑋 ×𝑌 ). Balanced virtual
conditions are neatly classified by injections from the virtual 𝐸-quotient space 𝑋 ∗∗ to
the virtual 𝐹-quotient space 𝑌 ∗∗ . Recall that every virtual 𝐸-class and every virtual 𝐹-
class are realized in the Coll(𝜔, ℶ𝜔1 ) extension by Theorem 2.5.6. If 𝑔 ∶ 𝑋 ∗∗ → 𝑌 ∗∗ is
an injection, let 𝜏𝑔 be the Coll(𝜔, ℶ𝜔1 )-name for the set of those elements 𝑝 ∈ 𝑃𝒦 such
that for each pair ⟨𝑐, 𝑑⟩ ∈ 𝑔, there is a pair ⟨𝑥, 𝑦⟩ ∈ 𝑝 such that 𝑥 ∈ 𝑋 is a realization of
the virtual 𝐸-class 𝑐 and 𝑦 ∈ 𝑌 is a realization of the virtual 𝐹-class 𝑑. Moreover, if 𝑑 is
a virtual 𝐹-class not in the range of 𝑔, then 𝑝 is required to contain an element 𝑦 ∈ 𝑌
which is a realization of the virtual 𝐹-class 𝑑.
Theorem 6.4.2. Let 𝐸, 𝐹 be Borel equivalence relations on respective Polish spaces

𝑋, 𝑌 with uncountably many classes. Let 𝑃 be the 𝐸, 𝐹-collapse poset.
(1) For every total injection 𝑔 ∶ 𝑋 ∗∗ → 𝑌 ∗∗ , the pair ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑔 ⟩ is a balanced
𝑃-pin;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a total injection 𝑔 ∶ 𝑋 ∗∗ → 𝑌 ∗∗ such the
pair ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑔 ⟩ is equivalent to ⟨𝑄, 𝜏⟩;
(3) distinct injections as in (1) yield inequivalent balanced pairs.
The poset 𝑃 is balanced if and only if 𝜆(𝐸) ≤ 𝜆(𝐹) holds.
Proof. Write 𝑅 = Coll(𝜔, ℶ𝜔1 ). For (1), the pair ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑔 ⟩ is clearly a
𝑃-pin. For the balance, let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be mutually generic extensions of the ground
model and 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ] be conditions in the analytic set 𝜏𝑔 /𝐻0 = 𝜏𝑔 /𝐻1 ;
we must show that 𝑝0 , 𝑝1 ∈ 𝑃 are compatible.
To see this, suppose for example that ⟨𝑥0 , 𝑦0 ⟩ ∈ 𝑝0 , ⟨𝑥1 , 𝑦1 ⟩ ∈ 𝑝1 , and 𝑥0 𝐸 𝑥1 ; we
must show that 𝑦0 𝐸 𝑦1 . By a mutual genericity argument, the points 𝑥0 , 𝑥1 must be
realizations of the same virtual 𝐸-class 𝑐 in the ground model. Since both 𝑝0 , 𝑝1 are
𝒦-sets, the definition of the name 𝜏𝑔 shows that both 𝑦0 , 𝑦1 must be realizations of the
virtual 𝐹-class 𝑔(𝑐) and therefore 𝑦0 𝐹 𝑦1 as desired.
6.4. QUOTIENT VARIATIONS 129
Similarly, if ⟨𝑥0 , 𝑦0 ⟩ ∈ 𝑝0 and 𝑦2 ∈ 𝑝1 , we need to show that 𝑦0 𝐹 𝑦2 fails. Suppose

towards a contradiction that 𝑦0 𝐹 𝑦2 holds. By a mutual genericity argument, the points
𝑦0 , 𝑦2 are representations of the same virtual 𝐹-class 𝑑 in the ground model. Now, if
𝑑 ∈ rng(𝑔) then 𝑝1 cannot be a 𝒦-set, and if 𝑑 ∉ rng(𝑔) then 𝑝0 cannot be a 𝒦-set.
There are no other options, and this contradiction completes the proof of (1).
For (2), let 𝑔 ∶ 𝑋 ∗∗ → 𝑌 ∗∗ be the collection of all pairs ⟨𝑐, 𝑑⟩ ∈ 𝑋 ∗∗ × 𝑌 ∗∗ so that
𝑅 × 𝑄 ⊩ ⟨𝑥, 𝑦⟩ ∈ 𝜏 for some realizations 𝑥, 𝑦 of the virtual classes 𝑐, 𝑑. It will be enough
to show that 𝑔 is a total injection from 𝑋 ∗∗ to 𝑌 ∗∗ and the pair ⟨𝑄, 𝜏⟩ is equivalent to
⟨𝑅, 𝜏𝑔 ⟩.
To see that dom(𝑔) = 𝑋 ∗∗ and 𝑔 is an injection, let 𝑐 ∈ 𝑋 ∗∗ be an arbitrary virtual
𝐸-class. Use the balance of the pair ⟨𝑄, 𝜏⟩ to show that there must be a unique virtual
𝐹-class 𝑑 ∈ 𝑌 ∗∗ such that 𝑅 × 𝑄 ⊩ ⟨𝑥, 𝑦⟩ ∈ 𝜏 for some realizations 𝑥, 𝑦 of the virtual
classes 𝑐, 𝑑. Use the balance of the pair ⟨𝑄, 𝜏⟩ again to show that for every virtual 𝐹-class
𝑑 ∈ 𝑌 ∗∗ , there either must be a virtual 𝐸-class 𝑐 ∈ 𝑋 ∗∗ such that 𝑅 × 𝑄 ⊩ ⟨𝑥, 𝑦⟩ ∈ 𝜏 for
some realizations 𝑥, 𝑦 of the virtual classes 𝑐, 𝑑, or it must be the case that 𝑅×𝑄 ⊩ 𝑦 ∈ 𝜏
for some realization 𝑦 of the virtual class 𝑑.
To see that ⟨𝑅, 𝜏𝑔 ⟩ is equivalent to ⟨𝑄, 𝜏⟩, strengthen 𝜏 if necessary so it is a name
for an actual element of 𝑃 and notice that in the 𝑅 × 𝑄 extension, 𝜏 ∈ 𝜏𝑔 holds. The
equivalence then follows from Proposition 5.2.6.
Finally, (3) is obvious and the last sentence immediately follows. □
Corollary 6.4.3. Let 𝐸, 𝐹 be Borel equivalence relations on respective Polish spaces

𝑋, 𝑌 with uncountably many classes. The 𝐸, 𝐹-collapse poset is balanced if and only if
𝜆(𝐸) ≤ 𝜆(𝐹).
The collapse posets exemplify an important phenomenon: a 𝜎-closed Suslin forcing

whose balanced status cannot be decided in ZFC. There are Borel equivalence relations
𝐸, 𝐹 for which the status of the inequality 𝜆(𝐸) ≤ 𝜆(𝐹) cannot be decided in ZFC (as
can be seen for example from the combination of Corollaries 2.5.18 and 2.5.15) and for
them the balanced status of the corresponding collapse forcing is undecidable as well.
Definition 6.4.4. Let 𝐸 ⊂ 𝐹 be Borel equivalence relations on a Polish space 𝑋.

Let 𝒦 = 𝒦𝐸,𝐹 be the simplicial complex of all finite sets 𝑎 ⊂ 𝑋 such that for 𝑥0 , 𝑥1 ∈ 𝑋,
𝑥0 𝐸 𝑥1 is equivalent to 𝑥0 𝐹 𝑥1 . We will refer to the associated poset 𝑃𝒦 as the 𝐸, 𝐹-
transversal poset.
It is immediate that the simplicial complex 𝒦𝐸,𝐹 is a Borel 𝐸-quotient complex. The
terminology comes from the examples below; the posets of this type are used to uni-
formize various relations in products of quotient spaces. The first order of business
is to classify balanced virtual conditions. Call a total function 𝑓 from the 𝐹-quotient
space to the virtual 𝐸-quotient space a virtual selection function if for every 𝐹-class 𝑐
the functional value 𝑓(𝑐) is a virtual 𝐸-class which is (forced to be) a subset of 𝑐. For a
virtual selection function 𝑓 let 𝜏𝑓 be the Coll(𝜔, ℶ𝜔1 )-name for the set of all conditions
𝑝 in the uniformization poset such that for each 𝐹-class 𝑐 represented in the ground
model, 𝑝 contains some point 𝑥 ∈ 𝑋 which is a realization of the virtual 𝐸-class 𝑓(𝑐).
It is not difficult to see that the pair ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑓 ⟩ is a 𝑃-pin.
Theorem 6.4.5. Let 𝐸 ⊂ 𝐹 be Borel equivalence relations on a Polish space 𝑋 and

suppose that 𝐹 is pinned. Let 𝑃 be the 𝐸, 𝐹-transversal poset. Then
(1) for every virtual selection function 𝑓, the pair ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑓 ⟩ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a virtual selection function 𝑓 such that the
pairs ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑓 ⟩ and ⟨𝑄, 𝜏⟩ are equivalent;
(3) distinct virtual selection functions yield nonequivalent balanced pairs.
Proof. To see (1), let 𝑉[𝐻0 ] and 𝑉[𝐻1 ] be mutually generic extensions of the
ground model and 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ] be conditions in the set 𝜏𝑓 /𝐻0 = 𝜏𝑓 /𝐻1 ;
we have to show that 𝑝0 , 𝑝1 ∈ 𝑃 are compatible. To this end, suppose that 𝑥0 ∈ 𝑝0 and
𝑥1 ∈ 𝑝1 are points; we must show that if 𝑥0 𝐹 𝑥1 then 𝑥0 𝐸 𝑥1 holds. A mutual gener-
icity argument shows that 𝑥0 , 𝑥1 are realizations of the same virtual 𝐹-class 𝑐. By the
definition of the name 𝜏𝑓 , it must be the case that 𝑥0 , 𝑥1 are both realizations of the
virtual 𝐸-class 𝑓(𝑐) and therefore 𝐸-related.
For (2), suppose that ⟨𝑄, 𝜏⟩ is a balanced pair. To find the total function 𝑓, let
𝑐 be an 𝐹-class. There must be a virtual 𝐸-class 𝑓(𝑐) such that 𝑄 ⊩ for some point
𝑥 ∈ 𝜏 ∩ 𝑐 ̇ 𝑥 is a realization of 𝑓(𝑐); otherwise, one could find conditions 𝑞0 , 𝑞1 ∈ 𝑄
and names for strengthenings 𝜏0 , 𝜏1 of 𝜏 and names 𝑥0̇ , 𝑥1̇ for elements of 𝑐 ̇ such that
⟨𝑞0 , 𝑞1 ⟩ ⊩𝑄×𝑄 ¬(𝑥0̇ )left 𝐹 (𝑥1̇ )right . This would violate the balance of the pair ⟨𝑄, 𝜏⟩
as ⟨𝑞0 , 𝑞1 ⟩ ⊩ 𝜏0 , 𝜏1 ∈ 𝑃 are incompatible conditions. Let 𝑓 ∶ 𝑐 ↦ 𝑑𝑐 be the resulting
function.
To see that ⟨𝑅, 𝜏𝑓 ⟩ is a balanced pair equivalent to ⟨𝑄, 𝜏⟩, strengthen 𝜏 if necessary to
ensure that 𝜏 is a name for an actual element of 𝑃, and observe that 𝑄 × Coll(𝜔, ℶ𝜔1 ) ⊩
𝜏 ∈ 𝜏𝑓 . The equivalence of the two balanced pairs then follows from Proposition 5.2.6.
Finally, (3) is obvious. The balance of the poset 𝑃 is now a trivial application of the
Axiom of Choice: every condition 𝑝 ∈ 𝑃 can be extended to a maximal set 𝐴 ⊂ 𝑋 such
that 𝐸 ↾ 𝐴 = 𝐹 ↾ 𝐴. Let 𝑓 be the function which to each 𝐹-class 𝑐 assigns the 𝐸-class
𝑐 ∩ 𝐴, and observe that the pair ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑓 ⟩ is balanced by (1) and is below 𝑝. □
Example 6.4.6. A poset introducing a transversal to a pinned Borel equivalence
relation 𝐹 on a Polish space 𝑋. Just let 𝐸 be the identity on the space 𝑋 and consider
the 𝐸, 𝐹-transversal poset. The generic set is an 𝐹-transversal. By Theorem 6.4.5, the
balanced virtual conditions are classified by 𝐹-transversals.
Example 6.4.7. A poset introducing a complete countable section to a pinned
Borel equivalence relation 𝐺 on a Polish space 𝑌 . Let 𝑋 = 𝑌 𝜔 and let 𝐵 ⊂ 𝑋 be the
Borel set of all elements 𝑥 ∈ 𝑋 whose range consists of pairwise 𝐺-related points. Let
𝐹 be the Borel equivalence relation on 𝑋 connecting points 𝑥0 , 𝑥1 if either they are
equal or else they are both in 𝐵 and their ranges are subsets of the same 𝐺-class. Let
𝐸 = 𝔽2 ∩ 𝐹. It is not difficult to check that 𝐸 ⊂ 𝐹 are Borel equivalence relations on
𝑋 and 𝐹 is pinned. Consider the associated 𝐸, 𝐹-transversal poset. The generic set is a
countable complete section of the relation 𝐸. In view of the fact that virtual 𝔽2 -classes
are classified by nonempty subsets of 𝑌 , Theorem 6.4.5 says that balanced virtual con-
ditions are classified by arbitrary sets 𝐴 ⊂ 𝑌 which have nonempty intersection with
every 𝐺-class.
Numerous examples of uniformization posets arise in the context of countable Borel
equivalence relations. If 𝐸 is a countable Borel equivalence relation on a Polish space
𝑌 and 𝑃 is a poset adding a choice of a structure of some type on each 𝐸-class with
countable approximations, then 𝑃 can be represented as a transversal poset in the sense
of Definition 6.4.4. The following example spells out the details.
Example 6.4.8. Let 𝐺 be a countable Borel equivalence relation on a Polish space
𝑌 . Let 𝐵 ⊂ 𝑌 𝜔 be a Borel set such that
(1) for every 𝑧 ∈ 𝐵, rng(𝑧) ⊂ 𝑌 consists of pairwise 𝐺-equivalent elements;
(2) for each 𝑦 ∈ 𝑌 there is 𝑧 ∈ 𝐵 such that rng(𝑧) ⊂ [𝑦]𝐺 .
Let 𝐸, 𝐹 be the equivalence relations on 𝑌 𝜔 defined by 𝑧0 𝐹 𝑧1 if 𝑧0 (0) 𝐺 𝑧1 (0), and
𝑧0 𝐸 𝑧1 if rng(𝑧0 ) = rng(𝑧1 ). The assumptions on the set 𝐵 show that 𝐸 ↾ 𝐵 ⊂ 𝐹 ↾
𝐵; clearly, 𝐹 is Borel reducible to 𝐺, so it is pinned. The 𝐸, 𝐹-transversal poset can
be viewed as a poset of all countable partial functions on the 𝐺-quotient space which
assign to each 𝐺-class 𝑐 a subset of it whose enumeration is in 𝐵, ordered by reverse
inclusion. Theorem 6.4.5 shows that the balanced virtual conditions are classified by
total functions on the 𝐺-quotient space which assign to each 𝐺-class 𝑐 a subset of it
whose enumeration is in 𝐵.
Example 6.4.9. Let 𝐺 be a countable Borel equivalence relation on a Polish space
𝑌 with all equivalence classes infinite. Let 𝑃 be the poset of all countable functions on
the 𝐺-quotient space assigning to each equivalence class a ℤ-ordering on it; the poset 𝑃
serves to introduce a (discontinuous) ℤ-action on 𝑌 such that 𝐺 is its orbit equivalence
relation. Example 6.4.8 casts 𝑃 as a transversal poset and classifies the balanced virtual
conditions.
Example 6.4.10. Let 𝑋 = ((2𝜔 )𝜔 )2 and consider the Borel set 𝐵 ⊂ 𝑋 consisting of
all pairs ⟨𝑦0 , 𝑦1 ⟩ ∈ 𝑋 such that rng(𝑥0 ) ∩ rng(𝑥1 ) = 0. Let 𝐹 be the equivalence relation
connecting points ⟨𝑦0 , 𝑦1 ⟩ and ⟨𝑧0 , 𝑧1 ⟩ if they are either equal or both in 𝐵 and 𝑦0 𝔽2
𝑧0 . Let 𝐸 be the equivalence relation 𝔽2 × 𝔽2 intersected with 𝐹. The resulting 𝐸, 𝐹-
transversal poset is designed to add a function assigning to each nonempty countable
set a single nonempty countable set disjoint from it. However, the equivalence relation
𝐹 is not pinned, so Theorem 6.4.5 does not apply to show that the uniformization poset
is balanced. Indeed, in ZF one can prove that existence of a maximal 𝒦𝐸,𝐹 -set implies
the existence of an 𝜔1 -sequence of pairwise distinct 𝔽2 -classes. To see this, let 𝐴 ⊂ 𝑋
be such a maximal set, suppose 𝑐0 ⊂ 2𝜔 is an arbitrary nonempty countable set, and by
transfinite recursion on 𝛼 ∈ 𝜔1 define 𝑐𝛼 as the unique nonempty countable set such
that for some enumerations 𝑦0 of ⋃𝛽∈𝛼 𝑐𝛽 and 𝑦1 of 𝑐𝛼 it is the case that ⟨𝑦0 , 𝑦1 ⟩ ∈ 𝐵.
It is clear that the sets 𝑐𝛼 for 𝛼 ∈ 𝜔1 are nonempty and pairwise disjoint and therefore
distinct. Finally, note (Theorem 9.1.1) that in balanced extensions of the symmetric
Solovay model there are no uncountable sequences of distinct equivalence classes of
Borel equivalence relations such as 𝔽2 .
If the larger equivalence relation 𝐹 in Definition 6.4.4 is not pinned, additional assump-
tions are necessary for the 𝐸, 𝐹-transversal poset to be balanced. One class of examples
of this type is captured by the following theorem. For Borel equivalence relations 𝐸 ⊂ 𝐹
on a Polish space 𝑋 write 𝑋𝐸∗∗ , 𝑋𝐹∗∗ to be their respective virtual quotient spaces. A func-
tion 𝑓 ∶ 𝑋𝐹∗∗ → 𝑋𝐸∗∗ is a virtual 𝐸, 𝐹-selection function if for every virtual 𝐹-class 𝑐, the
virtual 𝐸-class 𝑓(𝑐) is forced to be a subset of 𝑐. For each 𝐸, 𝐹-selection function 𝑓 let 𝜏𝑓
be the Coll(𝜔, ℶ𝜔1 )-name for the set of all countable subsets 𝑎 ⊂ 𝑋 such that for each
virtual 𝐹-class 𝑐, 𝑎 contains a realization of the virtual 𝐸-class 𝑓(𝑐).
Theorem 6.4.11. Let 𝐸 ⊂ 𝐹 be Borel equivalence relations on a Polish space 𝑋 such

that each 𝐹-class consists of countably many 𝐸-classes. Let 𝑃 be the 𝐸, 𝐹-transversal poset.
Then
(1) for every virtual 𝐸, 𝐹-selection function 𝑓 ∶ 𝑋𝐹∗∗ → 𝑋𝐸∗∗ , the ordered pair
⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑓 ⟩ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a virtual selection function 𝑓 such that the
balanced pairs ⟨𝑄, 𝜏⟩, ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑓 ⟩ are equivalent;
(3) distinct virtual selection functions yield nonequivalent balanced pairs.
Proof. The argument hinges on a simple claim of independent merit:
Claim 6.4.12. Let 𝑉[𝐻] be a generic extension of 𝑉, and in 𝑉[𝐻] let 𝑐 be an 𝐹-class
which is a realization of a ground model virtual 𝐹-class. Then 𝑐 is a union of realizations
of ground model virtual 𝐸-classes.
Proof. Suppose towards a contradiction that this fails. Then in 𝑉 there has to be
a poset 𝑃 and a 𝑃-name 𝜏 for an element of the space 𝑋 such that 𝜏 is 𝐹-pinned, but
below no condition of 𝑃 is 𝜏 𝐸-pinned. Let 𝑀 be a countable elementary submodel
of a large structure containing 𝐸, 𝐹, 𝑃, 𝜏 and use Proposition 1.7.12 to find a perfect
collection {𝑔𝑦 ∶ 𝑦 ∈ 2𝜔 } of filters on 𝑃 ∩𝑀 mutually generic over 𝑀. Let 𝑥𝑦 = 𝜏/𝑔𝑦 ∈ 𝑋.
For distinct binary sequences 𝑦, 𝑧 ∈ 2𝜔 , 𝑀[𝑔𝑦 , 𝑔𝑧 ] ⊧ 𝑥𝑦 𝐹 𝑥𝑧 and ¬𝑥𝑦 𝐸 𝑥𝑧 by the
forcing theorem applied in 𝑀. By the Mostowski absoluteness for the model 𝑀[𝑔𝑦 , 𝑔𝑧 ],
it follows that 𝑥𝑦 𝐹 𝑥𝑧 and ¬𝑥𝑦 𝐸 𝑥𝑧 holds in 𝑉. However, this means that the unique
𝐹-class of the points 𝑥𝑦 for 𝑦 ∈ 2𝜔 contains perfectly many pairwise 𝐸-unrelated points,
contradicting the initial assumptions on the equivalence relations 𝐸, 𝐹. □
Now, for (1) suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions containing
respective conditions 𝑝0 , 𝑝1 below 𝜏𝑓 ; we must show that 𝑝0 , 𝑝1 are compatible. This is
to say, 𝑝0 ∪ 𝑝1 is a 𝒦𝐸,𝐹 -set; in other words, if 𝑥0 ∈ 𝑝0 and 𝑥1 ∈ 𝑝1 are 𝐹-related points
then they are in fact 𝐸-related. To see this, by a mutual genericity argument 𝑥0 , 𝑥1 are
realizations of some virtual 𝐹-class 𝑐; by the definition of the virtual condition 𝜏𝑓 , they
must be realizations of the virtual 𝐸-class 𝑓(𝑐) and therefore must be 𝐹-related.
For (2), first use a balance argument (Proposition 5.2.4) and Claim 6.4.12 to argue
that for each virtual 𝐹-class 𝑐 there must be a unique virtual 𝐸-class 𝑑 which is forced to
be a subclass of 𝑐 and such that 𝑄 ⊩ 𝜏 contains a realization of 𝑑. Let 𝑓 ∶ 𝑋𝐹∗∗ → 𝑋𝐸∗∗ be
the function recording the correspondence 𝑐 ↦ 𝑑 and observe that 𝑄 × Coll(𝜔, ℶ𝜔1 ) ⊩
𝜏 ≤ 𝜏𝑓 holds. (2) then follows by a reference to Proposition 5.2.6.
Finally, (3) is obvious. The balance of the poset 𝑃 follows from the axiom of choice:
every condition 𝑝 ∈ 𝑃 can be extended to a virtual selection function by virtue of
Claim 6.4.12. □
Example 6.4.13. Let Γ be a Borel graph on a Polish space 𝑋 which contains no odd
length cycles such that the 𝐺-path connectedness equivalence relation 𝐹 on 𝑋 is Borel.
We wish to add a 2-coloring of the graph Γ. To this end, let 𝐸 be the Borel equivalence
relation on 𝑋 relating 𝑥 to 𝑦 if 𝑥 𝐸 𝑦 holds and some (equivalently, every) Γ-path from 𝑥
to 𝑦 is of even length. It is clear that every 𝐹-class consists of exactly two 𝐸-classes. The
𝐸, 𝐹-transversal poset selects exactly one 𝐸-class from each 𝐹-class and therefore adds
a bipartization of the graph Γ. Balanced virtual conditions are classified by functions

which select exactly one virtual 𝐸-class from each virtual 𝐹-class.
Example 6.4.14. Let 𝐹 be the 𝔽2 -equivalence relation on the space 𝑋 = (2𝜔 )𝜔 . Let
𝐸 be the equivalence relation on 𝑋 connecting points 𝑥0 and 𝑥1 if rng(𝑥0 ) = rng(𝑥1 )
and 𝑥0 (0) = 𝑥1 (0). Clearly, every 𝐹-class consists of only countably many 𝐸-classes.
An 𝐸, 𝐹-transversal can be viewed as a function which selects a single element from
each nonempty countable subset of 2𝜔 . It is instructive to inspect the balanced virtual
conditions provided by Theorem 6.4.11. An inspection reveals that a balanced virtual
condition is a function which to each nonempty subset of 𝑋 assigns one of its elements,
i.e. a selection function on 𝒫(𝑋). In consequence, the existence of balanced virtual
conditions for 𝑃 is in ZF equivalent to the statement that the space 2𝜔 can be well-
ordered.
CHAPTER 7
Ultrafilter forcings
Many applications of the axiom of choice rely on nonprincipal ultrafilters on 𝜔 and

their combinatorial properties. In this section, we will show that in several cases, natu-
ral attempts to add an ultrafilter result in balanced forcings and moreover the resulting
generic ultrafilter can be characterized in a simple way. The following definition and
proposition play a central role in several arguments.
Definition 7.0.1. Let 𝑈 be a nonprincipal ultrafilter on a set dom(𝑈). An infinite
set 𝑎 ⊂ dom(𝑈) in some forcing extension diagonalizes 𝑈 if for every 𝑏 ∈ 𝑈, 𝑎 ⧵ 𝑏 is
finite.
Proposition 7.0.2. Let 𝑈 be a nonprincipal ultrafilter on dom(𝑈). Suppose that
𝑄0 , 𝑄1 are posets and 𝜏0 , 𝜏1 are respective names for infinite subsets of dom(𝑈) which di-
agonalize 𝑈. Then 𝑄0 × 𝑄1 ⊩ 𝜏0 ∩ 𝜏1 is infinite.
Proof. The most appealing argument uses the general Proposition 1.7.9 on prod-
uct forcing extensions. Let 𝐻0 , 𝐻1 ⊂ 𝑄0 , 𝑄1 be mutually generic filters and let 𝑎0 =
𝜏0 /𝐻0 and 𝑎1 = 𝜏1 /𝐻1 . Suppose towards a contradiction that the intersection 𝑎0 ∩ 𝑎1 is
finite. By Proposition 1.7.9, there are sets 𝑏0 , 𝑏1 ⊂ dom(𝑈) in the ground model such
that 𝑎0 ⊂ 𝑏0 , 𝑎1 ⊂ 𝑏1 , and 𝑏0 ∩ 𝑏1 is finite. At most one of the sets 𝑏0 , 𝑏1 belongs to
the ultrafilter 𝑈. If, say, 𝑏0 ∉ 𝑈, then 𝜔 ⧵ 𝑏0 ∈ 𝑈, violating the assumption that 𝑎0
diagonalizes the ultrafilter 𝑈. □
7.1. A Ramsey ultrafilter

The most elementary attempt at adding a nonprincipal ultrafilter is the poset 𝑃 of
infinite subsets of 𝜔 ordered by inclusion. Here, the classification of balanced virtual
conditions is particularly appealing and simple.
Definition 7.1.1. Let 𝑈 be a nonprincipal ultrafilter on 𝜔. The symbol 𝜏𝑈 de-
notes the Coll(𝜔, 𝑈)-name for the analytic collection of all infinite sets 𝑎 ⊂ 𝜔 which
diagonalize the ultrafilter 𝑈.
Theorem 7.1.2. Let 𝑃 be the partial order of infinite subsets of 𝜔, ordered by inclu-
sion.
(1) The pair ⟨Coll(𝜔, 𝑈), 𝜏𝑈 ⟩ is a balanced virtual condition for 𝑃 for every non-
principal ultrafilter 𝑈 on 𝜔;
(2) If ⟨𝑄, 𝜏⟩ is a balanced pair for 𝑃, then there is a nonprincipal ultrafilter 𝑈 such
that ⟨𝑄, 𝜏⟩ is equivalent to ⟨Coll(𝜔, 𝑈), 𝜏𝑈 ⟩;
(3) distinct nonprincipal ultrafilters yield inequivalent balanced virtual conditions.
135
136 7. ULTRAFILTER FORCINGS
Proof. For (1), note that the pair in fact is a virtual condition: in Coll(𝜔, 𝑈), the
set 𝑈 is countable, so 𝜏𝑈 is an analytic subset of 𝑃, and the evaluation of 𝜏𝑈 does not
depend on the particular generic filter on the collapse poset. The balance of the pair
follows immediately from Proposition 7.0.2 applied to 𝑈.
For (2), first use the balance of the name 𝜏 to note that for every set 𝑎 ⊂ 𝜔, it must
be the case that either 𝑄 ⊩ 𝜏 ⊂ 𝑎̌ up to a finite set, or 𝑄 ⊩ 𝜏∩ 𝑎̌ is finite. Let 𝑈 be the set
of all 𝑎 ⊂ 𝜔 for which the first option occurs. It is immediate that 𝑈 is a nonprincipal
ultrafilter on 𝜔. The equivalence of ⟨𝑄, 𝜏⟩ with ⟨Coll(𝜔, 𝑈), 𝜏𝑈 ⟩ is immediately clear
from Proposition 7.0.2.
For (3), note that if 𝑈0 , 𝑈1 are distinct ultrafilters on 𝜔 then there is a set 𝑎 ⊂ 𝜔
such that 𝑎 ∈ 𝑈0 and 𝜔 ⧵ 𝑎 ∈ 𝑈1 . Thus the balanced names 𝜏𝑈0 and 𝜏𝑈1 represent
incompatible virtual conditions as the former is below 𝑎 and the other is below 𝜔 ⧵ 𝑎.
To prove the last sentence of the theorem, for any infinite set 𝑎 ⊂ 𝜔 there is a
nonprincipal ultrafilter 𝑈 containing 𝑎 as an element. A reference to item (1) then
completes the argument. □
7.2. Fubini powers of the Fréchet ideal

The most natural attempt to force an ultrafilter which is not a P-point with a 𝜎-
closed subset is encapsulated in the following definition.
Definition 7.2.1. For the duration of this section, write 𝐼 to be the ideal on 𝜔 × 𝜔
which is the Fubini product of the Fréchet ideal on 𝜔 with itself. That is, a set 𝑎 ⊂ 𝜔×𝜔
belongs to the ideal 𝐼 just in case 𝑎 has only finitely many infinite vertical sections. The
Fin×Fin poset 𝑃 is the partial order of 𝐼-positive sets, ordered by 𝑞 ≤ 𝑝 if 𝑞 ⧵ 𝑝 ∈ 𝐼.
It is not difficult to see that 𝑃 is a 𝜎-closed forcing; the sets in the generic filter on 𝑃 form
an ultrafilter disjoint from 𝐼. This ultrafilter, by virtue of the partition of the domain set
𝜔 × 𝜔 into the 𝐼-small vertical sections such that every transversal is again in 𝐼, is not a
P-point; its rich combinatorial properties were investigated for example in [12, 102].
It turns out that the poset 𝑃 is balanced, and the balanced virtual conditions allow
a simple classification. Let 𝜔∗ be the set of all nonprincipal ultrafilters on 𝜔. Let 𝑊 be
an ultrafilter on the set 𝜔 × 𝜔∗ which contains no set 𝑛 × 𝜔∗ for any number 𝑛 ∈ 𝜔.
Write 𝜏𝑊 for the name on Coll(𝜔, 𝒫(𝜔 × 𝜔∗ )) for the set of all conditions 𝑝 ∈ 𝑃 such
that there is a set {⟨𝑛𝑖 , 𝑈𝑖 ⟩ ∶ 𝑖 ∈ 𝜔} ⊂ (𝜔 × 𝜔∗ )𝑉 diagonalizing the ultrafilter 𝑊, the
numbers 𝑛𝑖 for 𝑖 ∈ 𝜔 are pairwise distinct, and the set 𝑝 ⊂ 𝜔 × 𝜔 has the following
property: only the vertical sections 𝑝𝑛𝑖 for some 𝑖 ∈ 𝜔 are nonempty, and each vertical
section 𝑝𝑛𝑖 is infinite and diagonalizes the ultrafilter 𝑈𝑖 .
Theorem 7.2.2. Let 𝑃 be the Fin×Fin poset.
(1) For every ultrafilter 𝑊 on the set 𝜔 × 𝜔∗ containing no set 𝑛 × 𝜔∗ for 𝑛 ∈ 𝜔, the
pair ⟨Coll(𝜔, 𝒫(𝜔 × 𝜔∗ )), 𝜏𝑊 ⟩ is balanced in 𝑃;
(2) for every balanced pair ⟨𝑄, 𝜎⟩ there is an ultrafilter 𝑊 on the set 𝜔 × 𝜔∗ , con-
taining no set 𝑛 × 𝜔∗ for 𝑛 ∈ 𝜔, such that the balanced pairs ⟨𝑄, 𝜎⟩ and
⟨Coll(𝜔, 𝒫(𝜔 × 𝜔∗ )), 𝜏𝑊 ⟩ are equivalent;
(3) distinct ultrafilters give rise to inequivalent balanced virtual conditions.
Proof. Towards (1), suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions
containing respective sets 𝑝0 , 𝑝1 ⊂ 𝜔×𝜔 such that there are sets 𝑎0 = {⟨𝑛0𝑖 , 𝑈𝑖0 ⟩ ∶ 𝑖 ∈ 𝜔}
7.2. FUBINI POWERS OF THE FRÉCHET IDEAL 137
and 𝑎1 = {⟨𝑛1𝑖 , 𝑈𝑖1 ⟩ ∶ 𝑖 ∈ 𝜔} in the respective models which diagonalize the ultrafilter
𝑊, and the vertical sections (𝑝0 )𝑛0 diagonalize the ultrafilter 𝑈𝑖0 for all 𝑖 ∈ 𝜔, and
𝑖
the vertical sections (𝑝1 )𝑛1 diagonalize the ultrafilter 𝑈𝑖1 for all 𝑖 ∈ 𝜔 as well. It will
𝑖
be enough to show that 𝑝0 , 𝑝1 are compatible in the poset 𝑃; i.e. the set 𝑝0 ∩ 𝑝1 has
infinitely many infinite vertical sections.
To this end, use Proposition 7.0.2 for the sets 𝑎0 , 𝑎1 and the ultrafilter 𝑊 to see
that 𝑎0 ∩ 𝑎1 is infinite. This means, that the set 𝑏 = {𝑛 ∈ 𝜔 ∶ ∃𝑈 ⟨𝑛, 𝑈⟩ ∈ 𝑎0 ∩ 𝑎1 } is
infinite. For each number 𝑛 ∈ 𝑏, the vertical sections (𝑝0 )𝑛 and (𝑝1 )𝑛 diagonalize the
same ultrafilter 𝑈 on 𝜔 for which ⟨𝑛, 𝑈⟩ ∈ 𝑎0 ∩ 𝑎1 holds. By another application of
Proposition 7.0.2, the set (𝑝0 )𝑛 ∩ (𝑝1 )𝑛 is infinite. It follows that 𝑝0 ∩ 𝑝1 ∉ 𝐼 as desired.
Towards (2), strengthen 𝜎 if necessary so that 𝜎 is a name for an actual single con-
dition in the poset 𝑃 as opposed to an analytic set of conditions. Replacing 𝑄 with a
poset collapsing the cardinality of 𝒫(𝜔)𝑉 to ℵ0 and strengthening the name 𝜎 if nec-
essary we may assume that 𝑄 forces that for every 𝑛 ∈ 𝜔, if the vertical section 𝜎𝑛 is
infinite, then for every set 𝑎 ⊂ 𝜔 in the ground model, either 𝜎𝑛 ⊂ 𝑎 or 𝜎𝑛 ∩ 𝑎 = 0
modulo finite. Let 𝑈𝑛̇ be the name for the set of all sets 𝑎 ⊂ 𝜔 in the ground model for
which the former alternative prevails; define 𝑈𝑛̇ = 0 if the vertical section 𝜎𝑛 is finite.
Passing to a condition in 𝑄 and strengthening 𝜎 again, we may assume that either 𝑄
forces that for all 𝑛 ∈ 𝜔 such that 𝜎𝑛 is infinite 𝑈𝑛̇ ∉ 𝑉 holds, or 𝑄 forces that for all
𝑛 ∈ 𝜔 such that 𝜎𝑛 is infinite 𝑈𝑛̇ ∈ 𝑉 holds.
Now, the former alternative is impossible as it contradicts the balance of the pair
⟨𝑄, 𝜏⟩. To see this, let 𝐻0 , 𝐻1 ⊂ 𝑄 be mutually generic filters and let 𝑝0 = 𝜎/𝐻0 and
𝑝1 = 𝜎/𝐻1 . To reach the contradiction, we will show that all vertical sections of 𝑝0 ∩ 𝑝1
are finite. Suppose not, and let 𝑛 ∈ 𝜔 be such that (𝑝0 )𝑛 ∩ (𝑝1 )𝑛 is infinite. Then
𝑈𝑛̇ /𝐻0 = 𝑈𝑛̇ /𝐻1 , which by the product forcing theorem implies that 𝑈𝑛̇ /𝐻0 ∈ 𝑉 and
violates the former alternative assumption.
Thus, the latter alternative prevails, and the set 𝜂 = {⟨𝑛, 𝑈𝑛̇ ⟩ ∶ 𝜎𝑛 is infinite} is
forced to be a subset of (𝜔 × 𝜔∗ )𝑉 . Strengthening 𝜎 again, we may assume that 𝑄 forces
that for every set 𝑏 ⊂ 𝜔 × 𝜔∗ in the ground model, either 𝜂 ⊂ 𝑏 or 𝜂 ∩ 𝑏 = 0 modulo
finite.
Claim 7.2.3. For every set 𝑏 ⊂ 𝜔 × 𝜔∗ , either 𝑄 ⊩ 𝜂 ⊂ 𝑏 ̌ modulo finite, or 𝑄 ⊩ 𝜂 ∩ 𝑏 ̌
is finite.
Proof. Suppose towards a contradiction that the conclusion fails for some set
𝑏 ⊂ 𝜔 × 𝜔∗ . Then, there must be conditions 𝑞0 , 𝑞1 ∈ 𝑄 forcing the former and lat-
ter alternative respectively. Let 𝐻0 , 𝐻1 ⊂ 𝑄 be mutually generic filters containing the
conditions 𝑞0 , 𝑞1 respectively. Write 𝑝0 = 𝜎/𝐻0 and 𝑝1 = 𝜎1 /𝐻1 ; we will reach a con-
tradiction by showing that all but finitely many vertical sections of the set 𝑝0 ∩ 𝑝1 are
finite, violating the balance assumption on 𝜎.
Write 𝑐0 = 𝜂/𝐻0 and 𝑐1 = 𝜂/𝐻1 . By the contradictory assumption, the intersection
𝑐0 ∩ 𝑐1 is finite. Let 𝑛 ∈ 𝜔 be a natural number which is not in the finite projection
of the set 𝑐0 ∩ 𝑐1 to 𝜔; we will show that (𝑝0 ∩ 𝑝1 )𝑛 is finite. Either (𝑝0 )𝑛 or (𝑝1 )𝑛 are
finite sets, in which case we are done, or both (𝑝0 )𝑛 and (𝑝1 )𝑛 are infinite. In the latter
case, there are ultrafilters 𝑈0 , 𝑈1 on 𝜔 in the ground model such that ⟨𝑛, 𝑈0 ⟩ ∈ 𝑐0 and
⟨𝑛, 𝑈1 ⟩ ∈ 𝑐1 . Since the number 𝑛 is not in the projection of 𝑐0 ∩ 𝑐1 to 𝜔, the ultrafilters
𝑈0 , 𝑈1 must be distinct. Since (𝑝0 )𝑛 diagonalizes 𝑈0 and (𝑝1 )𝑛 diagonalizes 𝑈1 , the
intersection (𝑝0 )𝑛 ∩ (𝑝1 )𝑛 must be finite in this case as well. □
Let 𝑊 be the set of all subsets of 𝑏 ⊂ 𝜔 × 𝜔∗ for which 𝑄 ⊩ 𝜂 ⊂ 𝑏 ̌ modulo finite;

by the claim, this is an ultrafilter on 𝜔 × 𝜔∗ . The definitions show that Coll(𝜔, 𝒫(𝜔 ×
𝜔∗ )) × 𝑄 ⊩ 𝜎 ∈ 𝜏𝐹 . Then, Proposition 5.2.6 shows that the balanced pairs ⟨𝑄, 𝜎⟩ and
⟨Coll(𝜔, 𝒫(𝜔 × 𝜔∗ )) are equivalent as desired.
Item (3) is immediate. For the last sentence, suppose that 𝑝 ∈ 𝑃 is a condition. Let
𝑎 = {𝑛 ∈ 𝜔 ∶ 𝑝𝑛 is infinite}; the set 𝑎 is infinite. For each 𝑛 ∈ 𝜔 let 𝑈𝑛 be a nonprincipal
ultrafilter on 𝜔 containing 𝑝𝑛 as an element. Let 𝑊 be a nonprincipal ultrafilter on the
set 𝜔 × 𝜔∗ containing the set {⟨𝑛, 𝑈𝑛 ⟩ ∶ 𝑛 ∈ 𝑎}. It is not difficult to see that the balanced
pair ⟨Coll(𝜔, 𝒫(𝜔 × 𝜔∗ )), 𝜏𝑊 ⟩ is below the condition 𝑝, proving the balance of the poset
𝑃. □
7.3. Ramsey sequences of structures

There is a family of forcings present in several papers concerning the Rudin–Keisler
order on ultrafilters with strong Ramsey-type properties [24]. The family is param-
etrized by sequences of structures tied by a partition property as in the following defi-
nition.
Definition 7.3.1. A Ramsey sequence of finite structures is a sequence 𝐴 = ⟨𝐴𝑛 ∶ 𝑛

∈ 𝜔⟩ of finite structures in the same language, with pairwise disjoint domains, such
that
(1) for every natural number 𝑛 ∈ 𝜔, 𝐴𝑛+1 contains an isomorphic copy of 𝐴𝑛 ;
(2) for every 𝑘 < 𝑛 ∈ 𝜔 there is 𝑚 > 𝑛 such that the structural Ramsey property
𝐴
𝐴𝑚 → (𝐴𝑛 )2 𝑘 holds.
For each Ramsey sequence 𝐴 = ⟨𝐴𝑛 ∶ 𝑛 ∈ 𝜔⟩ of finite structures, we will use the fol-
lowing notation. dom(𝐴) stands for ⋃𝑛 dom(𝐴𝑛 ). Given a number 𝑛 ∈ 𝜔, the symbol
𝐷𝑛 stands for the set of all finite sets 𝑑 such that for some 𝑚 ∈ 𝜔, 𝑑 ⊂ dom(𝐴𝑚 ) and
𝐴𝑚 ↾ 𝑑 is isomorphic to 𝐴𝑛 . For every set 𝑝 ⊂ dom(𝐴), the symbol 𝑝𝐴𝑛 stands for
𝒫(𝑝) ∩ 𝐷𝑛 . Each Ramsey sequence of finite structures has a natural 𝜎-closed poset
associated to it.
Definition 7.3.2. Let 𝐴 = ⟨𝐴𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a Ramsey sequence of finite structures.

Let 𝑃𝐴 denote the poset of all sets 𝑝 ⊂ dom(𝐴) such that 𝑝𝐴𝑛 is nonempty for each
𝑛 ∈ 𝜔. The ordering is defined by 𝑞 ≤ 𝑝 if 𝑞 ⊆ 𝑝 modulo finite.
It is not difficult to use the Ramsey property of the sequence 𝐴 to see that a generic filter
on 𝑃𝐴 is in fact an ultrafilter on dom(𝐴); the combinatorial properties of this generic
ultrafilter are the reason for the study of these posets in [8]. The posets of the form
𝑃𝐴 are balanced. The balanced virtual conditions are parametrized by sequences of
ultrafilters as opposed to single ultrafilters in the case of 𝒫(𝜔) modulo finite.
Definition 7.3.3. Let 𝐴 = ⟨𝐴𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a Ramsey sequence of finite structures.

An 𝐴-sequence of filters is a sequence ⟨𝐹𝑛 ∶ 𝑛 ∈ 𝜔⟩ such that
(1) for every number 𝑛 ∈ 𝜔, 𝐹𝑛 is a filter on the set 𝐷𝑛 ;
(2) for all numbers 𝑛, 𝑚 ∈ 𝜔 and every selection ⟨𝑎𝑖 ∶ 𝑖 ∈ 𝑛⟩ of sets in the respec-
tive filters 𝐹𝑖 for 𝑖 ∈ 𝑛, there is a set 𝑑 ∈ 𝐷𝑚 such that 𝑑𝐴𝑖 ⊂ 𝑎𝑖 holds for all
𝑖 ∈ 𝑛.
7.3. RAMSEY SEQUENCES OF STRUCTURES 139
If 𝐹 = ⟨𝐹𝑛 ∶ 𝑛 ∈ 𝜔⟩ is an 𝐴-sequence of ultrafilters, define the Coll(𝜔, 2𝜔 )-name 𝜏𝐹 for

the set of all conditions 𝑝 ∈ 𝑃 such that for every 𝑛 ∈ 𝜔 and every set 𝑎 ∈ 𝐹𝑛 , 𝑝𝐴𝑛 ⊂ 𝑎
modulo finite.
Theorem 7.3.4. Let 𝐴 = ⟨𝐴𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a Ramsey sequence of finite structures.
(1) For every 𝐴-sequence 𝐹 of ultrafilters, the pair ⟨Coll(𝜔, 2𝜔 ), 𝜏𝐹 ⟩ is balanced in
the poset 𝑃𝐴 ;
(2) for every balanced pair ⟨𝑄, 𝜎⟩ there is a 𝐴-sequence 𝐹 of ultrafilters such that
the balanced pairs ⟨𝑄, 𝜎⟩ and ⟨Coll(𝜔, 2𝜔 ), 𝜏𝐹 ⟩ are equivalent;
(3) distinct 𝐴-sequences of ultrafilters yield inequivalent balanced pairs.
In particular, the poset 𝑃𝐴 is balanced.
Proof. Write 𝑃 = 𝑃𝐴 . For the first item, it is necessary to argue that in fact
Coll(𝜔, 𝜏𝐹 ) ⊩ 𝜏𝐹 ≠ 0. To see this, work in the Coll(𝜔, 2𝜔 ) extension, for each num-
ber 𝑛 ∈ 𝜔 let 𝐷𝑛 = dom(𝐹𝑛 ) and fix an enumeration ⟨𝑎𝑛𝑖 ∶ 𝑖 ∈ 𝜔⟩ of all elements of 𝐹𝑛 .
By induction on 𝑛 ∈ 𝜔, repeatedly using item (2) of Definition 7.3.3 build sets 𝑑𝑛 ∈ 𝐷𝑛
𝐴 𝑗
such that for every 𝑖 ∈ 𝑛 the set 𝑑𝑛 𝑖 is a subset of ⋂𝑗∈𝑛 𝑎𝑖 . It is immediate that the
condition 𝑝 = ⋃𝑛 𝑑𝑛 ∈ 𝑃 is an element of 𝜏𝐹 .
For the balance, suppose that 𝑅0 , 𝑅1 are posets and 𝜎0 , 𝜎1 are their respective names
for conditions in 𝑃 such that 𝑅0 forces that for every 𝑛 ∈ 𝜔 and every set 𝑎 ∈ 𝐹𝑛 ,
𝐴
𝜎0 𝑛 ⊂ 𝑎 modulo finite holds, and similarly for 𝑅1 , 𝜎1 . We have to show that 𝑅0 × 𝑅1
forces the conditions 𝜎0 , 𝜎1 to be compatible in 𝑃, which is the same as to say that 𝑅0 ×𝑅1
forces the intersection 𝜎0 ∩ 𝜎1 to contain a copy of 𝐴𝑛 for every number 𝑛 ∈ 𝜔. To this
𝐴 𝐴
end, note that the sets 𝜎0 𝑛 and 𝜎1 𝑛 are forced to diagonalize the ultrafilter 𝐹𝑛 . By
Proposition 7.0.2, their intersection is forced to be infinite, in particular nonempty.
For the second item, we use a simple claim.
Claim 7.3.5. Let 𝑝 ∈ 𝑃 be a condition, 𝑛 ∈ 𝜔 be a number, and let 𝑎 ⊂ 𝐷𝑛 be a set.
Then there is 𝑞 ≤ 𝑝 such that either 𝑞𝐴𝑛 ⊂ 𝑎 or 𝑞𝐴𝑛 ∩ 𝑎 = 0.
𝐴
Proof. For each 𝑘 ∈ 𝜔 find a number 𝑚𝑘 ∈ 𝜔 such that 𝐴𝑚𝑘 → (𝐴𝑘 )2 𝑛 . Find
pairwise disjoint finite sets 𝑑𝑘 ⊂ 𝑝 in 𝐷𝑚𝑘 for each 𝑘 ∈ 𝜔. Use the partition property to
find sets 𝑑𝑘′ ⊂ 𝑑𝑘 such that 𝑑𝑘′ ∈ 𝐷𝑘 and (𝑑𝑘′ )𝐴𝑛 is either a subset of 𝑎 or disjoint from
𝑎. One of the options prevails for infinitely many numbers 𝑘. For definiteness, assume
that the set 𝑏 = {𝑘 ∈ 𝜔 ∶ (𝑑𝑘′ )𝐴𝑛 ⊂ 𝑎} is infinite. Let 𝑞 = ⋃𝑘∈𝑏 𝑑𝑘′ and observe that
𝑞 ≤ 𝑝 works. □
Now let ⟨𝑄, 𝜎⟩ be a balanced pair. Replacing 𝑄 with 𝑄 × Coll(𝜔, 2𝜔 ) and repeatedly
strengthening 𝑝 using the claim, we may assume that for every 𝑛 ∈ 𝜔 and every set
𝑎 ⊂ 𝐷𝑛 , 𝜎𝐴𝑛 is forced to be either a subset of 𝑎 or disjoint from 𝑎 modulo finite. By
a balance argument (Proposition 5.2.4), it must be the case that either 𝑄 ⊩ 𝜎𝐴𝑛 ⊂ 𝑎̌
modulo finite, or 𝑄 ⊩ 𝜎𝐴𝑛 ∩ 𝑎̌ = 0 modulo finite. Let 𝐹𝑛 be the collection of all sets
𝑎 ⊂ 𝐷𝑛 for which the former option prevails. It is clear that 𝐹𝑛 is an ultrafilter and
that 𝐹 = ⟨𝐹𝑛 ∶ 𝑛 ∈ 𝜔⟩ is an 𝐴-sequence. Since 𝑄 × Coll(𝜔, 2𝜔 ) ⊩ 𝜎 ∈ 𝜏𝐹 , by the
first item and Proposition 5.2.6 it must be the case that the balanced pairs ⟨𝑄, 𝜎⟩ and
⟨Coll(𝜔, 2𝜔 ), 𝜏𝐹 ⟩ are equivalent balanced pairs.
The third item is immediate. The last sentence of the theorem is not an entirely
formal consequence of the previous work. It needs the following application of the
axiom of choice.
Claim 7.3.6. Every 𝐴-sequence of filters can be extended to a 𝐴-sequence of ultrafil-

ters.
Proof. Order the 𝐴-sequences of filters by coordinatewise inclusion: 𝐹 ≤ 𝐺 if

for every 𝑛 ∈ 𝜔, 𝐹𝑛 ⊆ 𝐺𝑛 holds. It is immediate from the definitions that every ≤-
chain has an upper bound–the coordinatewise union of the 𝐴-sequences of filters in
the chain. By an application of Kuratowski–Zorn lemma, every 𝐴-sequence of filters
can be extended into a ≤-maximal one. It only remains to prove that any ≤-maximal
𝐴-sequence of filters is in fact a sequence of ultrafilters.
Let 𝐹 be a ≤-maximal 𝐴-sequence of filters, let 𝑛 ∈ 𝜔 be a number, and let 𝑏 ⊂ 𝐷𝑛
be a set; we claim that either 𝑏 or its complement belongs to 𝐹𝑛 . Suppose towards a
contradiction that neither is the case. By the maximality of 𝐹 it must be the case that
the sequences 𝐺0 , 𝐺 1 of filters obtained from 𝐹 by adding 𝑏 (or the complement of 𝑏,
respectively) to the filter 𝐹𝑛 are not 𝐴-sequences. This must be witnessed by some sets
⟨𝑎0𝑖 ∶ 𝑖 ∈ 𝑘⟩ and ⟨𝑎1𝑖 ∶ 𝑖 ∈ 𝑘⟩ for some number 𝑘 ∈ 𝜔 respectively, and some number
𝑚 ∈ 𝜔: these are sets in 𝐹𝑖 such that there is no 𝑑 ∈ 𝐷𝑚 such that for all 𝑖 ∈ 𝑘, 𝑖 ≠ 𝑛
𝑑𝐴𝑖 ⊂ 𝑎0𝑖 and 𝑑𝐴𝑛 ⊂ 𝑎0𝑛 ∩𝑏, and there is no 𝑑 ∈ 𝐷𝑚 such that for all 𝑖 ∈ 𝑘, 𝑖 ≠ 𝑛 𝑑𝐴𝑖 ⊂ 𝑎1𝑖
and 𝑑𝐴𝑛 ⊂ 𝑎1𝑛 ⧵ 𝑏. Since 𝐹 is a sequence of filters, for all 𝑖 ∈ 𝑘 𝑎0𝑖 ∩ 𝑎1𝑖 ∈ 𝐹𝑖 holds. Let
𝑚′ ∈ 𝜔 be a number such that 𝐴𝑚′ → (𝐴𝑚 )𝐴𝑛 holds. Since 𝐹 is a 𝐴-sequence, there is
𝑑′ ∈ 𝐷𝑚′ such that for all 𝑖 ∈ 𝑘, (𝑑′ )𝐴𝑖 ⊂ 𝑎0𝑖 ∩ 𝑎1𝑖 holds. Use the partition assumption
to find a a set 𝑑 ⊂ 𝑑′ in 𝐷𝑚 such that either 𝑑𝐴𝑛 ⊂ 𝑏 or 𝑑𝐴𝑛 ∩ 𝑏 = 0. The condition 𝑞
violates the choice of either the sets ⟨𝑎0𝑖 ∶ 𝑖 ∈ 𝑘⟩ or the sets ⟨𝑎1𝑖 ∶ 𝑖 ∈ 𝑘⟩. □
Now, suppose that 𝑝 ∈ 𝑃 is a condition. Consider the sequence 𝐹 of filters 𝐹𝑛 generated

by sets cofinite in 𝑝𝐴𝑛 . Clearly, 𝐹 is an 𝐴-sequence. By the claim, 𝐹 can be extended to
a 𝐴-sequence 𝐺 of ultrafilters. Then ⟨Coll(𝜔, 2𝜔 ), 𝜏𝐺 ⟩ is a balanced pair which is easily
seen to be below 𝑝 as required. □
For every Ramsey sequence 𝐴 = ⟨𝐴𝑛 ∶ 𝑛 ∈ 𝜔⟩, the poset 𝑃𝐴 introduces an ultrafilter on
the set 𝐷0 as the set of all subsets 𝑎 ⊂ 𝐷0 such that for some condition 𝑝 ∈ 𝑃 in the
generic ultrafilter, 𝑝𝐴0 ⊂ 𝑎. Claim 7.3.5 together with an obvious density argument
show that this formula indeed defines an ultrafilter 𝑈 on 𝐷0 , which will be referred to
as the 𝑃𝐴 -generic ultrafilter. It is clear that the generic filter on 𝑃𝐴 can be reconstructed
from 𝑈, and therefore the potential for confusion is minimal. The combinatorial and
Rudin–Keisler properties of the generic ultrafilter have been the main reason for the
study of the partial orders of the type 𝑃𝐴 [8]. It is not difficult to see that it is a P-point.
Example 7.3.7. Let 𝐴 be the sequence ⟨𝐴𝑛 ∶ 𝑛 ∈ 𝜔⟩ where 𝐴𝑛 is the linear order on
𝑛 many elements. The Ramsey theorem implies that this is in fact a Ramsey sequence
of structures. The 𝑃𝐴 -generic ultrafilter is a P-point which is weakly Ramsey and not a
Q-point [8, Theorem 4.9].
Example 7.3.8. Let 𝑘 ∈ 𝜔 and let 𝐴 be a sequence enumerating all ordered finite
graphs which contain no clique of cardinality 𝑘. The fact that this is a Ramsey sequence
of structures follows from [84]. The 𝑃𝐴 -generic ultrafilter is a P-point 𝑈 such that 𝑈 →
(𝑈, 𝑘)2 but not 𝑈 → (𝑈, 𝑘 + 1)2 [8, Theorem 4.11]
7.4. SEMIGROUP ULTRAFILTERS 141
7.4. Semigroup ultrafilters

In this section, we show that in a natural forcing connected with a countable semi-
group, balanced virtual conditions exist and are classified by idempotent ultrafilters.
This connects the theory of balanced forcing extensions with Ramsey theory and dy-
namics.
Definition 7.4.1. Let Γ be a countable semigroup. The poset 𝑃Γ is defined as
follows. The conditions of 𝑃Γ are elements of Γ𝜔 . The ordering is defined by 𝑞 ≤ 𝑝 if
there are nonempty finite sets 𝑎𝑛 ⊂ 𝜔 for all 𝑛 ∈ 𝜔 such that max(𝑎𝑛 ) < min(𝑎𝑛+1 )
and Π𝑚∈𝑎𝑛 𝑝(𝑚) = 𝑞(𝑛), where the products are always taken in the increasing order.
It is not difficult to see that given a condition in 𝑃Γ , shifting its entries to the left and/or
changing finitely many entries does not change the separative quotient equivalence
class of the condition. It follows that the separative quotient of 𝑃Γ is a 𝜎-closed poset.
The purpose of the poset 𝑃Γ is clear from the following definition and proposition.
Definition 7.4.2. Let 𝐴 be a collection of subsets of Γ. A sequence 𝑝 ∈ 𝑃Γ diag-
onalizes 𝐴 if for every set 𝑏 ∈ 𝐴 there is 𝑛 ∈ 𝜔 such that for every nonempty finite set
𝑎 ⊂ 𝜔 ⧵ 𝑛, Π𝑚∈𝑎 𝑝(𝑚) ∈ 𝑏 holds. The sequence 𝑝 ∈ 𝑃Γ sorts out 𝐴 if for every set 𝑏 ∈ 𝐴
there is 𝑛 ∈ 𝜔 such that for every nonempty finite set 𝑎 ⊂ 𝜔 ⧵ 𝑛, Π𝑚∈𝑎 𝑝(𝑚) ∈ 𝑏 holds,
or for every nonempty finite set 𝑎 ⊂ 𝜔 ⧵ 𝑛, Π𝑚∈𝑎 𝑝(𝑚) ∉ 𝑏 holds. If 𝑏 ∈ 𝐴 and the
former alternative occurs, we say that 𝑝 accepts 𝑏, if the latter alternative occurs then
𝑝 declines 𝑏.
Proposition 7.4.3. For every condition 𝑝 ∈ 𝑃Γ and every countable set 𝐴 ⊂ 𝒫(Γ),
there is a condition 𝑞 ≤ 𝑝 which sorts out 𝐴.
Proof. Let 𝐴 = {𝑏𝑛 ∶ 𝑛 ∈ 𝜔}. By induction on 𝑛 ∈ 𝜔 build a descending sequence
𝑝𝑛 of conditions in 𝑃Γ such that 𝑝 = 𝑝0 and for all 𝑛 ∈ 𝜔, for all nonempty finite sets
𝑎 ⊂ 𝜔 it is the case that ∏𝑚∈𝑎 𝑝𝑛+1 (𝑚) ∈ 𝑏𝑛 holds, or for all nonempty finite sets
𝑎 ⊂ 𝜔 it is the case that ∏𝑚∈𝑎 𝑝𝑛+1 (𝑚) ∈ 𝑏𝑛 holds. To perform the induction step,
use Hindman’s theorem on the partition 𝜋𝑛 of nonempty finite subsets of 𝜔 defined by
𝜋𝑛 (𝑎) = 1 if ∏𝑚∈𝑎 𝑝𝑛 (𝑚) ∈ 𝑏𝑛 holds.
In the end, let 𝑞 ∈ 𝑃Γ be defined by 𝑞(𝑛) = 𝑝𝑛 (𝑛) and observe that the conclusion
of the proposition is satisfied. □
Suppose that 𝐺 ⊂ 𝑃Γ is a generic filter. By Proposition 7.4.3 and a density argument,
the set 𝑈 ⊂ 𝒫(Γ) of all sets 𝑏 ⊂ Γ such that some condition 𝑝 ∈ 𝐺 accepts 𝑏, is an
ultrafilter. Also, 𝐺 can be recovered from 𝑈 as the set of all conditions 𝑝 ∈ 𝑃Γ such that
for all 𝑛 ∈ 𝜔, the set {∏𝑚∈𝑎 𝑝(𝑚) ∶ 𝑎 ⊂ 𝜔 is a nonempty finite set and min(𝑎) > 𝑛}
belongs to the ultrafilter 𝑈.
It turns out that balanced virtual conditions in the poset 𝑃Γ correspond to a well-
known concept from topological dynamics and Ramsey theory.
Definition 7.4.4. [45, Section 4.1] Let ⟨Γ, ⋅⟩ be a countable semigroup.
(1) For ultrafilters 𝑈0 , 𝑈1 on Γ, let 𝑈0 ⋅ 𝑈1 = {𝐴 ⊂ Γ ∶ {𝛾 ∈ Γ ∶ {𝛿 ∈ Γ ∶ 𝛾 ⋅ 𝛿 ∈
𝐴} ∈ 𝑈1 } ∈ 𝑈0 };
(2) an ultrafilter 𝑈 on Γ is an idempotent if 𝑈 ⋅ 𝑈 = 𝑈.
It turns out that ⋅ is a semi-continuous operation on the space 𝛽Γ of all ultrafilters on
Γ. The fundamental Ellis–Numakura theorem [45, Section 2.4] says that every closed
subsemigroup of 𝛽Γ contains an idempotent ultrafilter. The idempotent ultrafilters

have an alternative diagonalization description.
Proposition 7.4.5. Let 𝑈 be an ultrafilter on Γ. The following are equivalent:

(1) in Coll(𝜔, 𝒫(Γ)) extension there is a condition in 𝑃Γ diagonalizing 𝑈;
(2) for every countable subset of 𝑈, there is a condition in 𝑃Γ diagonalizing it;
(3) 𝑈 is an idempotent.
Proof. For the implication (1)→(2), if 𝑈 ′ ⊂ 𝑈 is a countable set, then in some

forcing extension there is a condition 𝑝 ∈ 𝑃 which diagonalizes 𝑈 and therefore 𝑈 ′ .
By a Mostowski absoluteness argument between the ground model and the forcing
extension, there must be a condition 𝑝 ∈ 𝑃 diagonalizing 𝑈 ′ .
For the implication (2)→(1), consider the partial order 𝑄 = [𝒫(𝑈)]ℵ0 modulo the
nonstationary ideal. Let 𝐺 ⊂ 𝑄 be a filter generic over 𝑉 and let 𝑗 ∶ 𝑉 → 𝑀 be the
generic ultrapower. Then 𝑀 is an 𝜔-model which is possibly illfounded. Moreover, 𝑀
contains the set 𝑗″ 𝑈 as the equivalence class of the identity function on [𝒫(𝑈)]ℵ0 , and
𝑀 ⊧ 𝑗″ 𝑈 ⊂ 𝑈 is a countable set by the Łoś theorem. Thus, if the ground model satisfies
(2), then by elementarity 𝑀 (and 𝑉[𝐺] as well) contains a condition 𝑝 ∈ 𝑃 which
diagonalizes 𝑗″ 𝑈 and therefore 𝑈. The existence of such a condition then transfers to
any Coll(𝜔, 𝒫(Γ)) extension of the ground model. This confirms (1).
(3) implies (2): this is the content of Galvin–Glazer theorem or its folkloric varia-
tion for countable sets, [45, Chapter 5]. Finally, the negation of (3) implies the nega-
tion of (2). To see this, if 𝑈 is not an idempotent, there must be a set 𝐴 ∈ 𝑈 such that
𝐴 ∉ 𝑈 ⋅ 𝑈. This means that the set 𝐵 = {𝛾 ∈ Γ ∶ {𝛿 ∈ Γ ∶ 𝛾 ⋅ 𝛿 ∉ 𝐴} ∈ 𝑈} belongs to 𝑈.
Consider the countable set including 𝐴, 𝐵, as well as all the sets 𝐶𝛾 = {𝛿 ∈ Γ ∶ 𝛾⋅𝛿 ∉ 𝐴}
for 𝛾 ∈ 𝐵; we will show that it cannot be diagonalized. Suppose towards a contradic-
tion that some condition 𝑝 ∈ 𝑃Γ does diagonalize it. This means that there is 𝑚0 ∈ 𝛾
such that for all 𝑘 > 𝑚 ≥ 𝑚0 , 𝑝(𝑚) ∈ 𝐵 and 𝑝(𝑚) ⋅ 𝑝(𝑘) ∈ 𝐴. There must be also
some 𝑘0 ∈ 𝜔 such that for all 𝑘 ≥ 𝑘0 , 𝑝(𝑘) ∈ 𝐶𝑝(𝑚0 ) . Then 𝑝(𝑚0 ) ⋅ 𝑝(𝑘0 ) should belong
simultaneously to 𝐴 and to the complement of 𝐴, which is a contradiction. □
Finally, the statement of the classification theorem for the balanced virtual conditions
in the poset 𝑃Γ is at hand.
Definition 7.4.6. Whenever ⟨Γ, ⋅⟩ is a countable semigroup and 𝑈 is an ultrafil-

ter on Γ, let 𝜏𝑈 denote the Coll(𝜔, 𝒫(Γ))-name for the (nonempty analytic) set of all
conditions diagonalizing 𝑈.
Theorem 7.4.7. Let ⟨Γ, ⋅⟩ be a countable semigroup.

(1) Whenever 𝑈 is an idempotent ultrafilter then ⟨Coll(𝜔, 𝒫(Γ)), 𝜏𝑈 ⟩ is a balanced
virtual condition;
(2) every balanced pair is equivalent to ⟨Coll(𝜔, 𝒫(Γ)), 𝜏𝑈 ⟩ for some idempotent ul-
trafilter 𝑈;
(3) distinct idempotent ultrafilters give rise to inequivalent balanced virtual condi-
tions.
In particular, the poset 𝑃Γ is balanced.
7.4. SEMIGROUP ULTRAFILTERS 143
Proof. For (1), note that by Proposition 7.4.5, 𝜏𝑈 is a name for a nonempty set jsut
in case 𝑈 is an idempotent ultrafilter. (1) then follows immediately from the following
claim:
Claim 7.4.8. Let 𝑈 be an ultrafilter on Γ and ⟨𝑄0 , 𝜏0 ⟩, ⟨𝑄1 , 𝜏1 ⟩ are posets and their
respective names for elements of 𝑃Γ diagonalizing 𝑈. Then 𝑄0 ×𝑄1 ⊩ 𝜏0 , 𝜏1 are compatible
in 𝑃Γ .
Proof. Let 𝑞0 ∈ 𝑄0 and 𝑞1 ∈ 𝑄1 be conditions and 𝑛 ∈ 𝜔 be a natural number. We
must find an element 𝛾 ∈ Γ and conditions 𝑞′0 ≤ 𝑞0 and 𝑞′1 ≤ 𝑞1 and finite nonempty
sets 𝑎0 , 𝑎1 ⊂ 𝜔 with minimum larger than 𝑛 such that 𝑞′0 ⊩ 𝛾 ̌ = Π𝑚∈𝑎0 𝜏0 (𝑚) and 𝑞′1 ⊩
𝛾 ̌ = Π𝑚∈𝑎1 𝜏1 (𝑚). The compatibility of 𝜏0 , 𝜏1 is then granted by a genericity argument.
Let 𝐴0 ⊂ Γ be the set of all 𝛾 ∈ Γ such that there exists a finite nonempty set 𝑎 ⊂ 𝜔
with minimum greater than 𝑛 and a condition 𝑞′ ≤ 𝑞0 in 𝑄0 forcing 𝛾 ̌ = Π𝑚∈𝑎 𝜏0 (𝑚).
Since 𝜏0 is forced to diagonalize 𝑈, it must be the case that 𝐴0 ∈ 𝑈. Similarly, let
𝐴1 ⊂ Γ be the set of all 𝛾 ∈ Γ such that there exists a finite nonempty set 𝑎 ⊂ 𝜔 with
minimum greater than 𝑛 and a condition 𝑞′ ≤ 𝑞1 in 𝑄1 forcing 𝛾 ̌ = Π𝑚∈𝑎 𝜏1 (𝑚). Since
𝜏1 is forced to diagonalize 𝑈, it must be the case that 𝐴1 ∈ 𝑈. Choose 𝛾 ∈ 𝐴0 ∩ 𝐴1 and
choose 𝑞′0 ≤ 𝑞0 , 𝑞′1 ≤ 𝑞1 and sets 𝑎0 , 𝑎1 witnessing the membership of 𝛾 in 𝐴0 , 𝐴1 . This
completes the proof. □
For (2), suppose that ⟨𝑄, 𝜏⟩ is a balanced pair. Without loss of generality we may
assume that 𝑄 collapses the size of 𝒫(Γ) ∩ 𝑉 to ℵ0 . Strengthening 𝜏 in the 𝑄-extension
repeatedly by an application of Proposition 7.4.3, we may assume that 𝜏 sorts out 𝒫(Γ)∩
𝑉. Let 𝜎 be the 𝑄-name for the collection of all sets in 𝒫(Γ) ∩ 𝑉 which 𝜏 accepts.
Claim 7.4.9. The membership of every set 𝐴 ⊂ Γ in 𝜎 is decided by the largest con-
dition in 𝑄.
Proof. If not, then there is a set 𝐴 ⊂ Γ and conditions 𝑞0 , 𝑞1 ∈ 𝑄 such that 𝑞0 ⊩
𝐴 ∈ 𝜎 and 𝑞1 ⊩ Γ ⧵ 𝐴̌ ∈ 𝜎. Plainly, the condition ⟨𝑞0 , 𝑞1 ⟩ forces in the product 𝑄 × 𝑄
̌
that 𝜏left , 𝜏right are conditions incompatible in 𝑃Γ , contradicting the balance assumption
on the name 𝜏. □
Let 𝑈 = {𝐴 ⊂ Γ ∶ 𝑄 ⊩ 𝐴̌ ∈ 𝜎}. This is an ultrafilter on Γ. By Proposition 7.4.5,
it is an idempotent ultrafilter. By Claim 7.4.8, the pair ⟨𝑄, 𝜏⟩ is equivalent to
⟨Coll(𝜔, 𝒫(Γ)), 𝜏𝑈 ⟩. (2) follows.
(3) is immediate. To prove the last sentence, note that for every condition 𝑝 ∈
𝑃Γ , the Ellis–Numakura theorem yields an idempotent ultrafilter 𝑈 such that for all
𝑛 ∈ 𝜔, the set {∏𝑚∈𝑎 𝑝(𝑚) ∶ 𝑎 ⊂ 𝜔 is a nonempty finite set and min(𝑎) > 𝑛} be-
longs to 𝑈. Then Coll(𝜔, 𝒫(Γ)) ⊩ Σ𝜏𝑈 ≤ 𝑝 by the definition of the ordering 𝑃Γ , so
⟨Coll(𝜔, 𝒫(Γ)), 𝜏𝑈 ⟩ is a balanced virtual condition below 𝑝. □
Example 7.4.10. Let Γ be the group of finite subsets of 𝜔 with the symmetric differ-
ence operation. Consider the poset 𝑃Γ below the natural initial condition 𝑝 ∈ Γ𝜔 which
assigns the singleton set {𝑛} to each number 𝑛 ∈ 𝜔. The generic ultrafilter added by the
poset is known as the stable ordered union ultrafilter as introduced in [11]. The stable
union ultrafilters are studied in many places in the literature, including the study of
the 𝑃Γ -extension of the symmetric Solovay model [23].
CHAPTER 8
Other forcings
In this chapter we gather partial orders which do not fit in the previous chapters.
8.1. Coloring graphs

Given a Polish space 𝑋 and a Borel hypergraph Γ ⊂ [𝑋]<ℵ0 , one can consider the
task of forcing a Γ-coloring 𝑐 ∶ 𝑋 → 𝜔. In principle, this is a very difficult task and
we do not have a general way of resolving it. A natural poset to consider is the poset
𝑃𝒦 where 𝒦 is the Borel simplicial complex on 𝑋 × 𝜔 consisting of finite partial Γ-
colorings. The basic disadvantage of this poset is that not all maximal 𝒦-sets are total
Γ-colorings, and there are elements of 𝑃𝒦 which cannot be extended to total Γ-colorings;
just consider a clique on 𝜔 + 1 and a partial countable coloring assigning the color 𝑛
to each number 𝑛 ∈ 𝜔. Thus, we have to restrict the posets 𝑃𝒦 in some way to get the
desired effect. This is not always straightforward, and the resulting posets are usually
not simplicial complex posets in the sense of Definition 6.1.1. The most natural attempt
is the following.
Definition 8.1.1. Let 𝑋 be a Polish space and let Γ ⊂ [𝑋]<ℵ0 be a Borel graph
on a Polish space 𝑋. The Γ-coloring forcing 𝑃Γ is the partially ordered set of all partial
countable functions 𝑝 ∶ 𝑋 → 𝜔 which can be extended to a Γ-coloring of the whole
space 𝑋. The ordering is that of reverse inclusion.
It is immediate that the poset 𝑃Γ , if nonempty, forces the union of the conditions in the
generic filter to be a total Γ-coloring with countably many colors. However, it is not at
all clear whether the poset 𝑃Γ is Suslin, 𝜎-closed, or balanced. In an interesting large
class of Borel graphs Γ, these questions have a smooth resolution. Recall that a graph
Γ on vertex set 𝑋 has coloring number 𝜅 if there is a well-ordering ≺ of 𝑋 such that for
each vertex 𝑥 ∈ 𝑋 the set {𝑦 ∈ 𝑋 ∶ 𝑦 ≺ 𝑥 and 𝑦 Γ 𝑥} has cardinality smaller than 𝜅
[28]. If Γ has coloring number 𝜅, then a straightforward transfinite recursion argument
yields a Γ-coloring of 𝑋 with 𝜅 or fewer colors. The coloring number looks like a very
complex notion especially in the case of infinite cardinals 𝜅, but in fact there is a simple
characterization of analytic graphs of uncountable coloring number [1].
Theorem 8.1.2. Let Γ be a Borel graph on a Polish space 𝑋 with countable coloring
number. Then 𝑃Γ contains a dense subset which is a Suslin ℵ0 -distributive poset. More-
over,
(1) for every total Γ-coloring 𝑐 ∶ 𝑋 → 𝜔 the pair ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a total coloring 𝑐 such that ⟨𝑄, 𝜏⟩ is equiv-
alent to ⟨Coll(𝜔, 𝑋), 𝑐⟩;̌
(3) distinct colorings yield inequivalent balanced virtual conditions.
In particular, the poset 𝑃Γ is balanced.
145
146 8. OTHER FORCINGS
Proof. Fix a well-ordering ≺ on the space 𝑋 such that for every element 𝑥 ∈ 𝑋,
the set {𝑦 ∈ 𝑋 ∶ 𝑦 ≺ 𝑥 and {𝑥, 𝑦} ∈ Γ} is finite. We start with a humble observation
which will be used in several places below.
Claim 8.1.3. Let 𝑀 be a countable elementary submodel of a large countable struc-
ture containing ≺. Then every 𝑦 ∈ 𝑋 ⧵ 𝑀 is Γ-connected with at most finitely many
elements of 𝑋 ∩ 𝑀.
Proof. Suppose that 𝑦 ∈ 𝑋 ⧵ 𝑀 is a point. Then for every 𝑥 ∈ 𝑀 ≺-greater than
𝑦, {𝑥, 𝑦} ∉ Γ holds: if {𝑥, 𝑦} ∈ Γ then 𝑦 belongs to the finite set of all points ≺-smaller
than 𝑥 and connected with 𝑥 and by elementarity it would have to belong to the model
𝑀, which is not the case. Thus, the only points of 𝑀 connected to 𝑦 in Γ are ≺-smaller
than 𝑦, and there are only finitely many points like that by the definitory property of
the ordering ≺. □
Let 𝑃 be the poset of all partial countable Γ-colorings 𝑝 ∶ 𝑋 → 𝜔 such that for all
points 𝑦 ∈ 𝑋 ⧵ dom(𝑝), the set {𝑥 ∈ dom(𝑝) ∶ {𝑥, 𝑦} ∈ Γ} is finite. The ordering on 𝑃
is that of reverse extension. The following two claims show that 𝑃 has the properties
required in the second sentence of the theorem.
Claim 8.1.4. 𝑃 is a Suslin ℵ0 -distributive poset.
Proof. We first need to show that the set of all (enumerations of) conditions in
𝑃 is Borel. Use Claim 8.1.3 to conclude that for every countable set 𝑎 ⊂ 𝑋, the set
𝑏 = {𝑦 ∈ 𝑋 ∶ ∃∞ 𝑥 ∈ 𝑎 {𝑥, 𝑦} ∈ Γ} is countable. By the Lusin–Novikov theorem,
there are Borel functions {𝑓𝑖 ∶ 𝑖 ∈ 𝜔} from 𝑋 𝜔 to 𝑋 such that for every 𝑧 ∈ 𝑋 𝜔 , the
list {𝑓𝑖 (𝑧) ∶ 𝑖 ∈ 𝜔} includes all points in 𝑋 which are Γ-connected with infinitely many
points of rng(𝑧). Now we can evaluate the complexity of the set of enumerations of
conditions in the poset 𝑃. A function 𝑟 ∶ 𝜔 → 𝑋 × 𝜔 is an enumeration of a condition
in 𝑃 just in case rng(𝑟) is a function and a Γ-coloring, and, writing 𝑠 ∶ 𝜔 → 𝑋 for the
first component function of 𝑟, for every 𝑖 ∈ 𝜔 if 𝑓𝑖 (𝑠) is Γ-connected to infinitely many
points in rng(𝑠), then 𝑓𝑖 (𝑠) ∈ rng(𝑠). This is a Borel condition.
To show that the poset 𝑃 is Suslin, note that two conditions 𝑝0 , 𝑝1 ∈ 𝑃 are com-
patible just in case they are compatible as functions: then 𝑝0 ∪ 𝑝1 will be their lower
bound. To argue for the ℵ0 -distributivity, let 𝑝 ∈ 𝑃 be a condition and let {𝐷𝑖 ∶ 𝑖 ∈ 𝜔}
be a countable collection of open dense subsets of 𝑃. To find a condition 𝑞 ≤ 𝑝 in the
intersection ⋂𝑖 𝐷𝑖 , let 𝑀 be a countable elementary submodel of a large structure con-
taining 𝑝, Γ, ≺ and {𝐷𝑖 ∶ 𝑖 ∈ 𝜔} and use the elementarity of 𝑀 to build a sequence 𝑝𝑖
for 𝑖 ∈ 𝜔 by recursion so that
• 𝑝 = 𝑝0 ≥ 𝑝1 ≥ 𝑝1 ≥ . . . are all conditions in 𝑀;
• 𝑝𝑖+1 ∈ 𝐷𝑖 and dom(𝑝𝑖+1 ) contains the 𝑖-th element of 𝑀 ∩ 𝑋 in some fixed
enumeration.
In the end, let 𝑞 = ⋃𝑖 𝑝𝑖 and use Claim 8.1.3 to argue that 𝑞 ∈ 𝑃 as desired. □
Claim 8.1.5. 𝑃 is a dense subset of 𝑃Γ .
Proof. It is first necessary to show that 𝑃 is a subset of 𝑃Γ . To this end, let 𝑝 ∈ 𝑃.
Let {𝑏𝑘 ∶ 𝑘 ∈ 𝜔} be a collection of pairwise disjoint infinite subsets of 𝜔 and 𝑐 ∶ 𝑋 → 𝜔
be a total Γ-coloring. Let 𝑑 ∶ 𝑋 → 𝜔 be the function defined as follows: 𝑑(𝑥) = 𝑝(𝑥) if
𝑥 ∈ dom(𝑝), and otherwise let 𝑑(𝑥) be the smallest number in 𝑏𝑐(𝑥) which is different
8.1. COLORING GRAPHS 147
from the finitely many numbers {𝑝(𝑦) ∶ 𝑦 ∈ dom(𝑝) and {𝑥, 𝑦} ∈ Γ}. It is not difficult
to verify that 𝑑 is a total Γ-coloring extending 𝑝, so 𝑝 ∈ 𝑃Γ .
For the density, suppose that 𝑝 ∈ 𝑃Γ is a condition. Let 𝑐 ∶ 𝑋 → 𝜔 be a total Γ-
coloring extending 𝑝. Let 𝑀 be a countable elementary submodel of a large structure
containing 𝑝, 𝑐, and ≺. By Claim 8.1.3, the set {𝑦 ∈ 𝑋 ∶ ∃∞ 𝑥 ∈ 𝑀 {𝑥, 𝑦} ∈ Γ} is a subset
of 𝑀. Thus, the function 𝑞 = 𝑐 ↾ 𝑀 is a condition in 𝑃 extending 𝑝 as desired. □
For the classification of the balanced virtual conditions, we need a claim:
Claim 8.1.6. Let 𝑅0 , 𝑅1 be posets and 𝜂0 , 𝜂1 be respective 𝑅0 - and 𝑅1 -names for ele-
ments of 𝑋 ⧵ 𝑉. Then
(1) 𝑅0 forces 𝜂0 to be Γ-connected with at most finitely many elements of the ground
model;
(2) 𝑅0 × 𝑅1 ⊩ {𝜂0 , 𝜂1 } ∉ Γ.
Proof. For the first item, suppose towards a contradiction that this fails as forced
by some condition 𝑟 ∈ 𝑅. Let 𝑀 be a countable elementary submodel of a large struc-
ture containing all relevant information, let 𝑔 ⊂ 𝑅0 ∩ 𝑀 be a filter generic over the
model 𝑀, and let 𝑦 = 𝜂0 /𝑔 ∈ 𝑋. By the forcing theorem, 𝑀[𝑔] satisfies that 𝑦 is Γ-
connected with infinitely many elements of 𝑋 ∩ 𝑀. By the Mostowski absoluteness for
the model 𝑀[𝑔], 𝑦 is indeed connected with infinitely many elements of 𝑀, and this
contradicts the conclusion of Claim 8.1.3.
For the second item, suppose towards a contradiction that this fails as forced by
some condition ⟨𝑟0 , 𝑟1 ⟩ in the product. Let 𝑀 ∈ 𝑁 be countable elementary submodels
of a large structure containing all relevant information. In the model 𝑁, there are filters
{𝑔𝑖 ∶ 𝑖 ∈ 𝜔} on the poset 𝑅0 ∩ 𝑀 which are mutually generic over the model 𝑀. By a
mutual genericity argument applied in 𝑀, the points 𝑥𝑖 = 𝜂0 /𝑔𝑖 ∈ 𝑋 are pairwise
distinct elements of 𝑁. Now, let ℎ ⊂ 𝑅1 ∩ 𝑀 be a filter generic over the model 𝑁
containing the condition 𝑟1 and let 𝑦 = 𝜂1 /ℎ ∈ 𝑋 ⧵ 𝑁. By the forcing theorem in 𝑀, it is
the case that 𝑀[𝐺𝑖 , ℎ] ⊧ {𝑥𝑖 , 𝑦} ∈ Γ for each 𝑖 ∈ 𝜔. By the Mostowski absoluteness for
the models 𝑀[𝑔𝑖 , ℎ], it is in fact the case that 𝑦 is Γ-connected with each 𝑥𝑖 for 𝑖 ∈ 𝜔.
This, however, contradicts Claim 8.1.3 applied to 𝑁. □
Now, for item (1) of the theorem, let 𝑐 ∶ 𝑋 → Γ be a total Γ-coloring. Note that
Coll(𝜔, 𝑋) ⊩ 𝑐 ̌ ∈ 𝑃 by Claim 8.1.6(1). To see that the pair ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ is balanced,
suppose that 𝑅0 , 𝑅1 are posets and 𝜎0 , 𝜎1 are 𝑅0 - and 𝑅1 -names for elements of 𝑃 ex-
tending 𝑐; we must show that the product 𝑅0 × 𝑅1 forces 𝜎0 , 𝜎1 to be compatible in 𝑃; in
other words, 𝜎0 ∪ 𝜎1 is a function and a Γ-coloring. To verify that 𝜎0 ∪ 𝜎1 is a function,
use the product forcing theorem to conclude that dom(𝜎0 ) ∩ dom(𝜎1 ) is forced to be a
subset of the ground model, and both 𝜎0 ↾ 𝑉 and 𝜎1 ↾ 𝑉 are forced to be equal to 𝑐.̌ To
see that 𝜎0 ∪ 𝜎1 is a Γ-coloring, use Claim 8.1.3(2). This completes the proof of (1).
To argue for item (2), suppose that ⟨𝑄, 𝜏⟩ is a balanced pair. Strengthening 𝜏 if nec-
essary we may assume that 𝑄 ⊩ 𝑋 ∩ 𝑉 ∈ dom(𝑝). By a balance argument (Propo-
sition 5.2.4), for each 𝑥 ∈ 𝑋 there must be a specific number 𝑐(𝑥) ∈ 𝜔 such that
𝑄 ⊩ 𝜏(𝑥)̌ = 𝑐(𝑥). It is not difficult to check that 𝑐 ∶ 𝑋 → 𝜔 is a total Γ-coloring
and 𝑄 × Coll(𝜔, 𝑋) ⊩ 𝜏 ≤ 𝑐.̌ (2) then follows from Proposition 5.2.6.
(3) is immediate. The last sentence now easily follows: if 𝑝 ∈ 𝑃Γ is a condition
then by the definition of 𝑃Γ it can be extended to a total Γ-coloring 𝑐 ∶ 𝑋 → 𝜔 which
then yields a balanced virtual condition below 𝑝 by (1). □
Example 8.1.7. Let 𝑛 ≤ 3 be a number, let 𝐷 ⊂ ℝ be a countable set of positive

reals converging to 0, and let Γ𝐷𝑛 be the graph connecting two points of ℝ𝑛 if their
distance belongs to 𝐷. The graph Γ𝐷𝑛 has countable coloring number by [65, Theorem
7], and therefore the poset 𝑃Γ𝐷𝑛 is balanced.
Example 8.1.8. Let 𝐷 ⊂ ℝ be a countable set of positive reals and consider the
graph Γ𝐷 connecting two points of the plane if their distance belongs to 𝐷. The graph Γ𝐷
does not contain an injective homomorphic copy of 𝐾2,𝜔1 ; by [28] it must have count-
able coloring number, so the poset 𝑃Γ𝐷 is balanced. If 𝐷 is the set of all positive rationals
then the graph contains infinite cliques, so its chromatic number is infinite. If 𝐷 is an
algebraically independent set, then it is not known whether the chromatic number is
finite or infinite; Bukh [15] conjectured the former.
8.2. Coloring hypergraphs

Chromatic numbers of hypergraphs offer additional challenges. We consider coloring
posets for hypergraphs with a certain degree of redundacy in their hyperedges.
Definition 8.2.1. Let 𝑚 ≥ 1 be a natural number. We say that a finitary Borel

hypergraph Γ ⊂ [𝑋]<ℵ0 on a Polish space 𝑋 has redundancy (at least) 𝑚 if for every
finite set 𝑏 ⊂ 𝑋, the set {𝑐 ∈ [𝑋]≤𝑚 ∶ 𝑏 ∪ 𝑐 ∈ Γ} is countable.
We first deal with hypergraphs of large redundancy. For them, the coloring poset is
very simple. We use the following definition.
Definition 8.2.2. Let 𝑚 ≥ 1 be a number and Γ ⊂ [𝑋]<ℵ0 be a Borel hypergraph

on a Polish space 𝑋 of redundancy 𝑚. We say that a set 𝑎 ⊂ 𝑋 is Γ-closed if for every
finite set 𝑏 ⊂ 𝑎 and every set 𝑐 ∈ [𝑋]≤𝑚 such that 𝑏 ∪ 𝑐 ∈ Γ, 𝑐 ⊂ 𝑎 holds.
As in Claim 8.1.4, the Lusin–Novikov theorem shows that the set of (enumerations
of) countable Γ-closed sets is Borel. In addition, every countable subset of 𝑋 can be
enlarged to a countable Γ-closed set.
Definition 8.2.3. Let Γ be a Borel hypergraph on a Polish space 𝑋 of arity 4 and

redundancy 2. The coloring poset for Γ is the poset 𝑃 consisting of countable partial
Γ-colorings 𝑝 such that dom(𝑝) ⊂ 𝑋 is a Γ-closed set. The ordering is that of reverse
inclusion.
As a simple but essential observation, note that if 𝑝 ∈ 𝑃 is a condition, 𝑎 ⊂ 𝑋 is a

countable Γ-closed set containing dom(𝑝) and 𝑞 ∶ 𝑎 → 𝜔 is a function such that 𝑝 ⊂ 𝑞
and 𝑞 ↾ 𝑎 ⧵ dom(𝑝) is an injection, then 𝑞 is a Γ-coloring and therefore 𝑞 ≤ 𝑝. A simple
genericity argument then shows that 𝑃 forces the union of the generic filter to be a total
Γ-coloring from 𝑋 to 𝜔.
Theorem 8.2.4. Let Γ be a Borel hypergraph on a Polish space 𝑋 of arity 4 and

redundancy 2. Its coloring poset 𝑃 is 𝜎-closed and Suslin and moreover,
(1) for every Γ-coloring 𝑐 ∶ 𝑋 → 𝜔, the pair ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜎⟩ there is a total Γ-coloring 𝑐 ∶ 𝑋 → 𝜔 such that the
balanced pairs ⟨𝑄, 𝜎⟩ and ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ are equivalent;
(3) distinct colorings yield inequivalent balanced pairs.
8.2. COLORING HYPERGRAPHS 149
The poset 𝑃 is balanced if and only if the chromatic number of Γ is countable. If the
Continuum Hypothesis holds then the poset 𝑃 is balanced.
We do not know if the coloring poset 𝑃 is balanced in ZFC in general.
Proof. It is immediate that 𝑃 is 𝜎-closed and Suslin. For (1), suppose that 𝑉[𝐺0 ],
𝑉[𝐺1 ] are mutually generic extensions of the ground model 𝑉 and 𝑝0 ∈ 𝑉[𝐺0 ] and
𝑝1 ∈ 𝑉[𝐺1 ] be conditions in 𝑃 stronger than 𝑐. Work in 𝑉[𝐺0 , 𝐺1 ]. Write 𝑑0 = dom(𝑝0 ),
𝑑1 = dom(𝑝1 ) and let 𝑑 be any countable Γ-closed set containing both 𝑑0 , 𝑑1 as subsets,
write 𝑑2 = 𝑑 ⧵ (𝑑0 ∪ 𝑑1 ), and let 𝑝 ∶ 𝑑 → 𝜔 be any function such that 𝑝0 ∪ 𝑝1 ⊂ 𝑝 and
𝑝 ↾ 𝑑2 is an injection. We need to check that 𝑝 ∈ 𝑃 holds.
To see this, first observe that 𝑝0 ∪𝑝1 is a function as dom(𝑝0 )∩dom(𝑝1 ) = 𝑋 ∩𝑉 by
the product forcing theorem and 𝑝0 ↾ 𝑉 = 𝑝1 ↾ 𝑉 = 𝑐. Thus, a function 𝑝 as above does
exist. Now, suppose that 𝑎 ⊂ 𝑑 is a hyperedge in Γ. If 𝑎 ∩ 𝑑2 contains more than one
element, then 𝑎 is not 𝑝-monochromatic as 𝑝 ↾ 𝑑2 is an injection. If 𝑎 ∩ 𝑑2 contains at
most one element, there must be an index 𝑖 ∈ 2 such that |𝑎 ∩ 𝑑𝑖 | ≥ 2; for definiteness,
assume that 𝑖 = 0. By the redundancy assumption, the set 𝐶 = {𝑏 ∈ Γ ∶ |𝑎 ∩ 𝑑0 | ⊂ 𝑏} is
countable; by a Shoenfield absoluteness argument with 𝑉[𝐺0 ], it is a subset of 𝑉[𝐺0 ].
As 𝑎 ∈ 𝐶, it follows that in fact 𝑎 ⊂ dom(𝑝0 ), so 𝑎 is not 𝑝-monochromatic since it is
not 𝑝0 -monochromatic as desired.
For (2), let ⟨𝑄, 𝜎⟩ be a balanced pair. Strengthening 𝑄 and 𝜎 if necessary, we may
assume that 𝜎 is in fact a name for a condition in 𝑃 and 𝑄 ⊩ ∀𝑥 ∈ 𝑋 ∩ 𝑉 𝑥 ∈ dom(𝜎).
By a balance argument (Proposition 5.2.4), for each ground model point 𝑥 ∈ 𝑋 there
must be a number 𝑐(𝑥) ∈ 𝜔 such that 𝑄 ⊩ 𝜎(𝑥)̌ = 𝑐(𝑥). It is immediate that 𝑐 ∶ 𝑋 → 𝜔
is a Γ-coloring and 𝑄 ⊩ 𝜎 ≤ 𝑐.̌ (2) then follows from Proposition 5.2.6.
(3) is obvious. We now show that 𝑃 is balanced if and only if Γ has countable
chromatic number. For one direction, if the chromatic number of Γ is uncountable,
then by (2) there are no balanced virtual conditions and 𝑃 is not balanced. For the
converse, suppose that 𝑑 ∶ 𝑋 → 𝜔 be a Γ-coloring and 𝑝 ∈ 𝑃 is a condition; we must
find a Γ-coloring extending 𝑝. To this end, let 𝐺 be the graph on 𝑋 ⧵dom(𝑝) connecting
points 𝑥0 , 𝑥1 if there is a hyperedge 𝑎 ∈ Γ containing both 𝑥0 , 𝑥1 and such that 𝑎 ∩
dom(𝑝) ≠ 0. The redundancy assumption together with the fact that dom(𝑝) ⊂ 𝑋 is
a countable set show that 𝐺 is a locally countable graph on 𝑋 ⧵ dom(𝑝); let 𝐸 be the
𝐺-path-connectedness equivalence relation. Let {𝑒𝑛 ∶ 𝑛 ∈ 𝜔} be a partition of 𝜔 into
countably many sets. The Axiom of Choice provides a function 𝑐 ∶ 𝑋 → 𝜔 such that
𝑝 ⊂ 𝑐, for all 𝑥 ∈ 𝑋 ⧵ dom(𝑝) 𝑐(𝑥) ∈ 𝑒𝑑(𝑥) and moreover, 𝑐 is an injection on each
𝐸-class. It will be enough to show that 𝑐 is a Γ-coloring. To see this, suppose that 𝑎 ⊂ 𝑋
is a hyperedge. If |𝑎 ∩ dom(𝑝)| ≥ 2 then 𝑎 ⊂ dom(𝑝) and 𝑐 ↾ 𝑎 is not constant as 𝑝 is
a Γ-coloring. if |𝑎 ∩ dom(𝑝)| = 1 then any two points in 𝑎 ⧵ dom(𝑝) are 𝐺-connected
and so 𝑐 ↾ 𝑎 is not constant either. Finally, if 𝑎 ∩ dom(𝑝) = 0 then 𝑐 ↾ 𝑎 is not constant
as 𝑑 is a Γ-coloring.
Finally, assume that CH holds; we must construct a Γ-coloring 𝑐 ∶ 𝑋 → 𝜔. To this
end, exhaust 𝑋 with a continuous increasing union ⋃𝛼∈𝜔 𝑑𝛼 of countable Γ-closed
1
sets such that 𝑑0 = 0. Let 𝑐 ∶ 𝑋 → 𝜔 be any function such that 𝑐 ↾ (𝑑𝛼+1 ⧵ 𝑑𝛼 ) is an
injection. Another application of the redundancy assumption shows that 𝑐 is in fact a
Γ-coloring. □
Example 8.2.5. Let Γ be the hypergraph on ℝ2 of arity 4 consisting of quadruples

which are vertices of a square. It is clear that for any pair of points there are only finitely
many squares such that both of these points are among their vertices. In this case, we
show that 𝑃 is balanced in ZFC as a result of Ceder [18] shows that the hypergraph Γ
has countable chromatic number in ZFC.
Hypergraphs of redundancy one are much more difficult to color. We isolate an inter-
esting subclass of them which allows a straightforward construction of an apparently
optimal coloring poset in arity three.
Definition 8.2.6. Let ⟨𝑋, ⋅⟩ be a Polish space with a Borel group operation. A
Borel hypergraph Γ ⊂ [𝑋]3 is circular if there is a finite family Φ of Borel automor-
phisms of ⟨𝑋, ⋅⟩ such that whenever {𝑥, 𝑥0 𝑥, 𝑥1 𝑥} ∈ Γ is a hyperedge then there is an
automorphism 𝜙 ∈ Φ such that 𝜙(𝑥0 ) = 𝑥1 . The automorphisms in the family Φ are
referred to as the circular automorphisms for Γ.
Note that for every finite family Φ of automorphisms there is the inclusion-largest hy-
pergraph for which Φ serves as the circular family, and this largest hypergraph is Borel.
While the choice of the circular automorphisms may not be unique, in our examples
there always is a clearly canonical choice.
Definition 8.2.7. Let ⟨𝑋, ⋅⟩ be a Polish space with a Borel group operation. Let Γ
be a circular Borel hypergraph with a finite family Φ of circular automorphisms. The
coloring poset 𝑃 is the poset of all countable partial functions 𝑝 ∶ 𝑋 → 𝜔 × 𝜔 such that
the domain of 𝑝 is a subgroup of 𝑋 closed under the circular automorphisms and their
inverses and 𝑝 is a Γ-coloring. The ordering is defined by 𝑞 ≤ 𝑝 if 𝑝 ⊂ 𝑞 and for every
right dom(𝑝)-coset 𝑒 ⊂ dom(𝑞) distinct from dom(𝑝), the set 𝑞″ 𝑒 ⊂ 𝜔×𝜔 has all vertical
sections finite.
The selection of 𝜔 × 𝜔 as the set of colors is just a convenience; the convenience is
exploited in the last clause of the definition. It is not difficult to see that if 𝑝 ∈ 𝑃 is
a condition, 𝑎 ⊂ 𝑋 is a countable subgroup closed under the circular automorphisms
and their inverses and containing dom(𝑝) as a subset, and 𝑞 ∶ 𝑎 → 𝜔 × 𝜔 is a function
extending 𝑝 such that 𝑞 ↾ (𝑎 ⧵ dom(𝑝)) is an injection whose range has all vertical
sections finite, then 𝑞 ∈ 𝑃 and 𝑞 ≤ 𝑝 both hold. A simple genericity argument then
shows that the union of the generic filter on the coloring poset is a total Γ-coloring
from 𝑋 to 𝜔 × 𝜔. The coloring poset is balanced and its balanced virtual conditions are
naturally classified by colorings:
Theorem 8.2.8. Let ⟨𝑋, ⋅⟩ be a Polish space with a Borel group operation. Let Γ be a
circular Borel hypergraph with a finite family Φ of circular automorphisms. Let 𝑃 be the
coloring poset. Then 𝑃 is a Suslin 𝜎-closed partial order and:
(1) for every total Γ-coloring 𝑐 ∶ 𝑋 → 𝜔 × 𝜔, the pair ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜎⟩ there is a total Γ-coloring 𝑐 ∶ 𝑋 → 𝜔 × 𝜔 such that
the balanced pairs ⟨𝑄, 𝜎⟩ and ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ are equivalent;
(3) distinct colorings yield inequivalent balanced pairs.
The poset 𝑃 is balanced if and only if the chromatic number of Γ is countable. If the
Continuum Hypothesis holds, the poset 𝑃 is balanced.
We do not know if the chromatic number of a circular Borel hypergraph is countable
in ZFC.
Proof. It is immediate that the relation ≤ on 𝑃 is a 𝜎-closed partial order. We have

to verify that ≤ and incompatibility are analytic relations. The case of ≤ is immediate
from the definitions. To show that incompatibility is an analytic relation, we prove the
following characterization which will be useful later:
Claim 8.2.9. Let 𝑝0 , 𝑝1 ∈ 𝑃 be conditions. Then 𝑝0 is compatible with 𝑝1 just in

case the following items occur in conjunction:
(1) 𝑝0 ∪ 𝑝1 is a function;
(2) for every index 𝑖 ∈ 2 and every right dom(𝑝𝑖 )-coset 𝑒 distinct from dom(𝑝𝑖 ), the
″
set 𝑝1−𝑖 𝑒 ⊂ 𝜔 × 𝜔 has all vertical sections finite.
Proof. It is immediate that the failure of any of the two items prevents the exis-
tence of a lower bound of the two conditions. Suppose then that the two items hold
in conjunction. Let 𝑑 ⊂ 𝑋 be any countable set closed under the circular functions
such that 𝑑0 = dom(𝑝0 ), 𝑑1 = dom(𝑝1 ) ⊂ 𝑑. Write 𝑑2 = 𝑑 ⧵ (𝑑0 ∪ 𝑑1 ) and choose an
enumeration 𝑑2 = {𝑥𝑛 ∶ 𝑛 ∈ 𝜔}. We first observe that for each 𝑛 ∈ 𝜔, each 𝑖 ∈ 2, and
each circular automorphism 𝜙 ∈ Φ, the set 𝑒𝑛𝑖𝜙 = {𝑦 ∈ 𝑑𝑖 ∶ 𝜙(𝑦𝑥𝑛−1 )𝑥𝑛 ∈ 𝑑1−𝑖 } is a
subset of a single right 𝑑1−𝑖 -coset. To see this, note that if 𝑦0 , 𝑦1 ∈ 𝑒𝑛𝑖𝜙 are points, then
𝜙(𝑦0 𝑦1−1 ) = (𝜙(𝑦0 𝑥𝑛−1 )𝑥𝑛 )(𝜙(𝑦1 𝑥𝑛−1 )𝑥𝑛 )−1 belongs to 𝑑1−𝑖 and so does 𝑦0 𝑦1−1 .
Now, let 𝑞 ∶ 𝑑 → 𝜔 × 𝜔 be a function extending 𝑝0 , 𝑝1 such that for each 𝑛 ∈ 𝜔
𝑞(𝑥𝑛 ) = ⟨𝑛, 𝑚⟩ where 𝑚 ∈ 𝜔 is any number which does not belong to the union of the
finite 𝑛-th vertical sections of the sets 𝑝𝑖″ 𝑒𝑛𝑖𝜙 for 𝑖 ∈ 2 and 𝜙 ∈ Φ. We have to check
that 𝑞 ∈ 𝑃 is a condition and 𝑞 ≤ 𝑝0 , 𝑝1 holds.
To see that 𝑞 ∈ 𝑃, we must show that there is no monochromatic triple in Γ. Let
{𝑦0 , 𝑦1 , 𝑦2 } ∈ Γ be a triple of elements of 𝑑. There are several cases.
Case 1. 𝑑0 contains at least two elements of the triple. Then the triple is a subset of
𝑑0 since 𝑑0 is closed under the circular automorphisms. In addition, the triple is not
𝑞 monochromatic since it is not 𝑝0 monochromatic. The case in which 𝑑1 contains at
least two elements of the triple is symmetric.
Case 2. The set 𝑑2 contains at least two elements of the triple. Then 𝑞 is not monochro-
matic on the triple since 𝑞 is an injection on 𝑑2 .
Case 3. The sets 𝑑0 , 𝑑1 , 𝑑2 each contain exactly one element of the triple. Suppose for
definiteness that 𝑦𝑖 ∈ 𝑑𝑖 holds for all 𝑖 ∈ 3. By the initial circularity assumptions, there
exist a number 𝑛 ∈ 𝜔 and a circular automorphism 𝜙 ∈ Φ such that 𝑦2 = 𝑥𝑛 and
𝑦1 = 𝜙(𝑦0 𝑥𝑛−1 )𝑥𝑛 . Then 𝑦0 ∈ 𝑒𝑛0𝜙 and 𝑞(𝑦2 ) ≠ 𝑞(𝑦0 ) = 𝑝0 (𝑦0 ).
To see that 𝑞 ≤ 𝑝0 , let 𝑒 ⊂ 𝑑 be a right 𝑑0 -coset distinct from 𝑑0 ; we must show
that the set 𝑞″ 𝑒 ⊂ 𝜔 × 𝜔 has all vertical sections finite. However, this set is covered by
the union of sets 𝑝1″ 𝑒 and 𝑞″ 𝑑2 , the first one of which has all vertical sections finite and
the vertical sections of the latter are singletons. The case 𝑞 ≤ 𝑝1 is symmetric. □
Towards (1) of the theorem, let 𝑐 ∶ 𝑋 → 𝜔×𝜔 be a total Γ-coloring. Let 𝑉[𝐺0 ], 𝑉[𝐺1 ]
be mutually generic extensions of 𝑉 and let 𝑝0 ∈ 𝑉[𝐺0 ] and 𝑝1 ∈ 𝑉[𝐺1 ] be conditions
in 𝑃 stronger than 𝑐. We must show that 𝑝0 , 𝑝1 are compatible in 𝑃. To this end, write
𝑑 = 𝑋 ∩𝑉, 𝑑0 = dom(𝑝0 ), and 𝑑1 = dom(𝑝1 ) and observe that for each 𝑖 ∈ 2, if 𝑒 is a left
𝑑𝑖 -coset then 𝑒∩𝑑1−𝑖 is a subset of a left 𝑑-coset. To see this, note that if 𝑦0 , 𝑦1 ∈ 𝑑1−𝑖 ∩𝑒
then 𝑦0 𝑦1−1 ∈ 𝑑0 ∩𝑑1 and 𝑑0 ∩𝑑1 = 𝑑 by the product forcing theorem. The compatibility
of 𝑝0 , 𝑝1 now follows immediately from Claim 8.2.9 and the assumption that 𝑝0 , 𝑝1 ≤ 𝑐.
For (2) of the theorem, suppose that ⟨𝑄, 𝜏⟩ is a balanced pair. Strengthening 𝜏
if necessary, we may assume that 𝑄 ⊩ (𝑋 ∩ 𝑉) ⊂ dom(𝜏). By a balance argument
(Proposition 5.2.4), for each point 𝑥 ∈ 𝑋 ∩ 𝑉 there is a pair 𝑐(𝑥) ∈ 𝜔 × 𝜔 such that
𝑄 ⊩ 𝜏(𝑥)̌ = 𝑐(𝑥). It is immediately clear that 𝑐 is a Γ-coloring. We claim that the bal-
anced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ are equivalent. To this end, it is enough to argue
that 𝑄 ⊩ 𝜏 ≤ 𝑐.̌ Suppose towards a contradiction that some condition 𝑞 ∈ 𝑄 forces
the opposite, i.e. that some vertical section of the 𝜏-image of some right 𝑋 ∩ 𝑉-coset is
infinite. Let 𝐺0 , 𝐺1 ⊂ 𝑄 be mutually generic filters meeting the condition 𝑞, and write
𝑝0 = 𝜏/𝐺0 and 𝑝1 = 𝜏/𝐺1 . To reach the contradiction with the balance of the pair
⟨𝑄, 𝜏⟩, argue that 𝑝0 , 𝑝1 are conditions incompatible in 𝑃. This follows immediately
from Claim 8.2.9 and the fact that 𝑝0 , 𝑝1 ≰ 𝑐.
(3) is immediate. We now show that the balance of 𝑃 is equivalent to the statement
that chromatic number of Γ is countable. First of all, if the chromatic number of Γ is
uncountable then there are no balanced virtual conditions by (2). For the converse, let
𝑑 ∶ 𝑋 → 𝜔 be an arbitrary Γ-coloring and 𝑝 ∈ 𝑃 be a condition. Let 𝐺 be the graph on
𝑋 ⧵ dom(𝑝) connecting points 𝑥0 , 𝑥1 if they are either in the same right dom(𝑝)-coset
or there is a hyperedge 𝑎 ∈ Γ containing both 𝑥0 and 𝑥1 and some point in dom(𝑝).
The redundancy assumption shows that 𝐺 is a locally countable graph. Let 𝐸 be the
𝐺-connectivity equivalence relation on 𝑋. Let 𝑒 ∶ 𝑋 ⧵ dom(𝑝) → 𝜔 be a function which
is an injection on each 𝐸-class. Define the map 𝑐 ∶ 𝑋 → 𝜔 × 𝜔 by setting 𝑐(𝑥) equal to
𝑝(𝑥) if 𝑥 ∈ dom(𝑝) and to ⟨𝑒(𝑥), 𝑑(𝑥)⟩ otherwise. We first argue that 𝑐 is a Γ-coloring.
Let 𝑎 ∈ Γ be a hyperedge. If 𝑎 ∩ dom(𝑝) = 0 then 𝑎 is not 𝑐-monochromatic as 𝑑 is a
Γ-coloring. If |𝑎 ∩ dom(𝑝)| = 1, then the two points in 𝑎 ⧵ dom(𝑝) are 𝐺-related and
therefore assigned different colors by 𝑐. If |𝑎 ∩ dom(𝑝)| ≥ 2 then 𝑎 ⊂ dom(𝑝) and 𝑎
is not 𝑐-monochromatic since it is not 𝑝-monochromatic. A review of the definitions
shows that Coll(𝜔, 𝑋) ⊩ 𝑐 ̌ ≤ 𝑝,̌ so 𝑐 is a balanced virtual condition below 𝑝.
Finally, suppose that CH holds, and work to find a Γ-coloring 𝑐 ∶ 𝑋 → 𝜔. Exhaust
𝑋 with a continuous increasing sequence of countable subgroups ⟨𝑎𝛼 ∶ 𝛼 ∈ 𝜔1 ⟩ which
are closed under the circular automorphisms and their inverses, so that 𝑎0 = 0. Let
𝑐 ∶ 𝑋 → 𝜔 × 𝜔 be a map such that for each ordinal 𝛼 ∈ 𝜔1 𝑐 ↾ (𝑎𝛼+1 ⧵ 𝑎𝛼 ) is an injection
whose range has all vertical sections finite. To show that 𝑐 is a Γ-coloring, let 𝑏 ∈ Γ be
a hyperedge and let 𝛼 be the smallest ordinal such that 𝑏 ⊂ 𝑎𝛼 . Then 𝛼 is a successor
of some ordinal 𝛽, the set 𝑏 contains at most one point in 𝑎𝛽 by the closure of 𝑎𝛽 on the
circular automorphisms, so 𝑏 is not monochromatic as 𝑐 ↾ 𝑎𝛼 ⧵ 𝑎𝛽 is an injection. □
In the following two examples, the hypergraphs under discussion have been shown to
have countable chomatic number in ZFC by Ceder [18].
Example 8.2.10. Let Γ be the hypergraph of arity three on 𝑋 = ℝ2 consisting

of vertices of equilateral triangles. Let Φ be the family of automorphisms of ⟨𝑋, +⟩
consisting of rotations by 𝜋/3 and by −𝜋/3. Then Φ witnesses that the hypergraph Γ is
circular.
Example 8.2.11. In general, let 𝜙 ∈ 𝐺𝐿(2, ℝ) be any linear automorphism of
⟨ℝ2 , +⟩ which does not have 1 as an eigenvalue. Then the hypergraph Γ on 𝑋 = ℝ2
consisting of triples {𝑥, 𝑥 + 𝑦, 𝑥 + 𝜙(𝑦)} for 𝑥 ∈ 𝑋 and 𝑦 ∈ 𝑋 ⧵ {0} is circular. To see this,
note that the automorphisms 𝜙, 𝜓(𝑦) = −𝜙(𝑦) + 𝑦 and 𝜒(𝑦) = −𝜙−1 (𝑦) + 𝑦 and their
inverses witness the circularity of Γ. This way, one can get for example hypergraphs
of triangles in the plane similar to a given triangle 𝑇 = {0, 𝑥, 𝑦} considering the auto-
morphism 𝜙 which is a composition of rotation and scalar multiplication and such that
𝜙(𝑥) = 𝑦.
Example 8.2.12. Let 𝑋 be a Borel vector space over a field of characteristic differ-
ent from two. Let Γ be the hypergraph on 𝑋 consisting of all triples {𝑥, 𝑥 + 𝑦, 𝑥 + 2𝑦}.
The circular automorphisms are the multiplication by two, division by two, and mul-
tiplication by minus one.
Example 8.2.13. A union of finitely many circular hypergraphs of arity three is

circular.
A very similar poset can produce a decomposition of the underlying space of a Borel
modular matroid 𝒦 into countably many 𝒦-sets. This elaborates on an old result of
Erdős and Kakutani [26]. W use the following terminology:
Definition 8.2.14. Let 𝒦 be a Borel simplicial complex on a Polish space 𝑋. A

total map 𝑐 from 𝑋 to a countable set is a 𝒦-decomposition if each 𝑐-monochromatic
finite subset of 𝑋 belongs to 𝒦.
The following technical definition plays a central role in the construction of a balanced
poset adding a 𝒦-decomposition.
Definition 8.2.15. Let 𝒦 be a Borel modular matroid with countable closures on

a Polish space 𝑋. For every matroid closed countable set 𝑎 ⊂ 𝑋, let 𝐸𝑎 be the countable
Borel equivalence relation on 𝑋 connecting 𝑥0 , 𝑥1 if 𝑥0 ∈ 𝚌𝚕(𝑎 ∪ {𝑥1 }) and 𝑥1 ∈ 𝚌𝚕(𝑎 ∪
{𝑥0 }).
The 𝐸𝑎 -equivalence classes come in two types: first, 𝑎 itself, and then sets of the form
𝚌𝚕(𝑎 ∪ {𝑥}) ⧵ 𝑎 for points 𝑥 ∉ 𝚌𝚕(𝑎). The transitivity of 𝐸𝑎 is a consequence of the
idempotence of matroid closure.
Definition 8.2.16. Let 𝒦 be a modular Borel matroid with countable closures

on a Polish space 𝑋. The 𝒦-decomposition forcing 𝑃 is the set of all functions 𝑝 such
that dom(𝑝) is a matroid closed countable subset of 𝑋, rng(𝑝) ⊂ 𝜔 × 𝜔, and every
monochromatic finite subset of dom(𝑝) is in 𝒦. The ordering is defined by 𝑞 ≤ 𝑝 if
𝑝 ⊂ 𝑞, and
(1) for every finite monochromatic set 𝑎 ⊂ dom(𝑞)⧵dom(𝑝), 𝚌𝚕(𝑎)∩dom(𝑝) = 0;
(2) for every 𝐸dom(𝑝) -class 𝑒 ⊂ dom(𝑞) distinct from dom(𝑝), the set {⟨𝑛, 𝑚⟩ ∈
𝜔 × 𝜔 ∶ there exists a monochromatic finite set 𝑎 ⊂ dom(𝑞) ⧵ dom(𝑝) with
homogeneous color ⟨𝑛, 𝑚⟩ such that 𝚌𝚕(𝑎) ∩ 𝑒 ≠ 0} has all vertical sections
finite.
It is not difficult to see that for every 𝑝 ∈ 𝑃 and every countable matroid closed set
𝑎 ⊂ 𝑋 with 𝑝 ⊂ 𝑎, any function 𝑞 ∶ 𝑎 → 𝜔 × 𝜔 which extends 𝑝 and such that
𝑞 ↾ 𝑎 ⧵ dom(𝑝) is an injection whose range has all vertical sections finite is in fact
a condition in 𝑃 stronger than 𝑝. A genericity argument then shows that 𝑃 adds a 𝒦-
decomposition of the space 𝑋. In fact, balanced virtual conditions are exactly classified
by 𝒦-decompositions, as per the following theorem.
Theorem 8.2.17. Let 𝒦 be a modular Borel matroid with countable closures on a

Polish space 𝑋. Let 𝑃 be the 𝒦-decomposition forcing. Then 𝑃 is a 𝜎-closed Suslin forcing
and:
(1) if 𝑐 ∶ 𝑋 → 𝜔 × 𝜔 is a 𝒦-decomposition, the pair ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ is balanced;
(2) if ⟨𝑄, 𝜏⟩ is a balanced pair, then there is a 𝒦-decomposition 𝑐 ∶ 𝑋 → 𝜔 × 𝜔 such
that the balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ are equivalent;
(3) distinct 𝒦-decompositions yield inequivalent balanced pairs.
If the Continuum Hypothesis holds then 𝑃 is balanced.
Proof. We must first verify that the relation ≤ is a Suslin forcing. The modularity
of the matroid makes appearance already here, in the following claim:
Claim 8.2.18. Let 𝑞 ≤ 𝑝 be conditions in 𝑃 and let 𝑎 ⊂ dom(𝑞) be a finite 𝑞-mono-

chromatic set. Then
(1) 𝚌𝚕(𝑎) ∩ dom(𝑝) = 𝚌𝚕(𝑎 ∩ dom(𝑝));
(2) 𝚌𝚕(𝑎) ⧵ dom(𝑝) ⊆ [𝚌𝚕(𝑎 ⧵ dom(𝑝))]𝐸dom(𝑝) .
Proof. The right-to-left inclusion of (1) is clear. For the left-to-right inclusion
of both items, let 𝑥 ∈ 𝚌𝚕(𝑎) be any point. The modularity of the matroid provides
points 𝑦0 ∈ 𝚌𝚕(𝑎 ∩ dom(𝑝)) and 𝑦1 ∈ 𝚌𝚕(𝑎 ⧵ dom(𝑝)) such that 𝑥 ∈ 𝚌𝚕({𝑦0 , 𝑦1 }). Since
dom(𝑝) is matroid closed, 𝑦0 ∈ dom(𝑝) holds and since 𝑞 ≤ 𝑝 and 𝑎 is monochromatic,
𝑦1 ∉ dom(𝑝) holds. It follows that 𝑦1 ∉ 𝚌𝚕(𝑦0 ) and the rank of the set {𝑦0 , 𝑦1 , 𝑥} is
precisely two.
For (1), if 𝑥 ∈ dom(𝑝) then (as dom(𝑝) is matroid closed) 𝑦1 ∉ 𝚌𝚕(𝑦0 , 𝑥) holds. It
follows that the rank of the set {𝑦0 , 𝑥} must be one, in other words 𝑥 ∈ 𝚌𝚕(𝑦0 ) holds
and (1) follows.
For (2), if 𝑥 ∉ dom(𝑝) then (as dom(𝑝) is matroid closed) {𝑦0 , 𝑥} ∈ 𝒦 holds, so
𝑦1 ∈ 𝚌𝚕(𝑦0 , 𝑥) and 𝑥 ∈ 𝚌𝚕(𝑦0 , 𝑦1 ) hold. The relation 𝑥 𝐸𝑝 𝑦1 follows, proving (2). □
For the transitivity, suppose that 𝑟 ≤ 𝑞 ≤ 𝑝 are conditions in 𝑃 and argue that 𝑟 ≤
𝑝 holds. For (1) of Definition 8.2.16, suppose that 𝑎 ⊂ dom(𝑟) ⧵ dom(𝑝) is a finite
monochromatic set and use the claim to argue that 𝚌𝚕(𝑎) ∩ dom(𝑞) = 𝚌𝚕(𝑎 ∩ dom(𝑞)),
which then is disjoint from dom(𝑝) as 𝑞 ≤ 𝑝. For (2) of Definition 8.2.16, first consider
the case of a 𝐸dom(𝑝) -class 𝑒 ⊂ dom(𝑞). Use (1) of Claim 8.2.18 to see that if 𝑎 ⊂
dom(𝑟) is a monochromatic set disjoint from dom(𝑝) such that 𝚌𝚕(𝑎) ∩ 𝑒 ≠ 0, then
𝚌𝚕(𝑎∩dom(𝑞))∩𝑒 ≠ 0 and deduce that (2) of Definition 8.2.16 holds for 𝑒 as 𝑞 ≤ 𝑝. Now
consider the case of a 𝐸dom(𝑝) -class 𝑒 disjoint from dom(𝑞). Such a class is a subset of a
single 𝐸dom(𝑞) -class 𝑒′ . For each finite 𝑟-monochromatic set 𝑎 ⊂ dom(𝑟) disjoint from
dom(𝑝) such that 𝚌𝚕(𝑎)∩𝑒 ≠ 0, use (2) of Claim 8.2.18 to see that 𝚌𝚕(𝑎⧵dom(𝑞))∩𝑒′ ≠ 0.
Deduce that (2) of Definition 8.2.16 holds for 𝑒 as 𝑟 ≤ 𝑞. The matroid closure of dom(𝑞)
implies that there are no other cases.
For the 𝜎-closure of the poset 𝑃, if ⟨𝑝𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a decreasing sequence of con-
ditions in the poset 𝑃, consider 𝑞 = ⋃𝑛 𝑝𝑛 . It is clear that 𝑞 ∈ 𝑃 is a condition. Now
let 𝑛 ∈ 𝜔 be arbitrary and argue that 𝑞 ≤ 𝑝𝑛 . To verify (1) of Definition 8.2.16, if
𝑎 ⊂ dom(𝑞) is a finite monochromatic set disjoint from dom(𝑝𝑛 ), then for some 𝑚 ≥ 𝑛
𝑎 ⊂ dom(𝑝𝑚 ) holds, therefore 𝚌𝚕(𝑎) ∩ dom(𝑝𝑛 ) = 0 holds as 𝑝𝑚 ≤ 𝑝𝑛 . To verify (2)
of Definition 8.2.16, let 𝑒 ⊂ dom(𝑞) be a 𝐸dom(𝑝𝑛 ) -class distinct from dom(𝑝𝑛 ). Then
there is 𝑚 ≥ 𝑛 such that 𝑒 ⊂ dom(𝑝𝑚 ). Now, whenever 𝑎 ⊂ dom(𝑞) is a monochro-

matic set disjoint from dom(𝑝𝑛 ) with 𝚌𝚕(𝑎) ∩ 𝑒 ≠ 0, then for some 𝑘 ≥ 𝑚 𝑎 ⊂ dom(𝑝𝑘 )
holds and 𝚌𝚕(𝑎 ∩ dom(𝑝𝑚 )) ∩ 𝑒 ≠ 0 holds as 𝑝𝑘 ≤ 𝑝𝑚 by (1) of Claim 8.2.18. (2) of
Definition 8.2.16 then holds for 𝑒 as 𝑝𝑚 ≤ 𝑝𝑛 .
For the Suslinity of the poset 𝑃, it is clear that 𝑃 is a Borel set and so is the relation
≤. We have to verify that compatibility of conditions is a Borel relation. This is the
content of the following claim, which will be used later.
Claim 8.2.19. Let 𝑝0 , 𝑝1 ∈ 𝑃 be conditions. Then 𝑝0 is compatible with 𝑝1 just in
case the following items occur in conjunction:
(1) 𝑝0 ∪ 𝑝1 is a function;
(2) for every index 𝑖 ∈ 2, for every finite 𝑝𝑖 -monochromatic set 𝑎 ⊂ dom(𝑝𝑖 ) ⧵
dom(𝑝1−𝑖 ) we have 𝚌𝚕(𝑎) ∩ dom(𝑝1−𝑖 ) = 0;
(3) for every index 𝑖 ∈ 2, for every 𝐸dom(𝑝𝑖 ) -class 𝑒 distinct from dom(𝑝𝑖 ), the set
{⟨𝑛, 𝑚⟩ ∈ 𝜔 ∶ there is a 𝑝1−𝑖 -monochromatic set 𝑎 ⊂ dom(𝑝1−𝑖 ) of color ⟨𝑛, 𝑚⟩
such that 𝚌𝚕(𝑎) ∩ 𝑒 ≠ 0} has all vertical sections finite.
Proof. It is immediate that the failure of any of the three items prevents the ex-
istence of a lower bound of the two conditions. Suppose then that the three items
hold in conjunction. Let 𝑑 ⊂ 𝑋 be any countable matroid closed set such that 𝑑0 =
dom(𝑝0 ), 𝑑1 = dom(𝑝1 ) ⊂ 𝑑. Write 𝑑2 = 𝑑 ⧵ (dom(𝑝0 ) ∪ dom(𝑝1 )). Let 𝑑2 = {𝑥𝑛 ∶ 𝑛 ∈
𝜔} be an enumeration. Let 𝑞 ∶ 𝑑 → 𝜔 be a function extending 𝑝0 , 𝑝1 and such that for
each 𝑥 ∈ 𝑑2 , 𝑞(𝑥𝑛 ) = ⟨𝑛, 𝑚⟩ for some number 𝑚 such that for no 𝑖 ∈ 2 and no 𝑝𝑖 -
monochromatic set 𝑎𝑖 ⊂ 𝑑𝑖 ⧵ 𝑑1−𝑖 with homogeneous color ⟨𝑛, 𝑚⟩ does 𝚌𝚕(𝑎) intersect
the 𝐸𝑑1−𝑖 -class of 𝑥𝑛 }. We have to check that 𝑞 ∈ 𝑃 is a condition and that 𝑞 ≤ 𝑝0 , 𝑝1
holds.
To see that 𝑞 ∈ 𝑃, let 𝑎 ⊂ 𝑑 be a 𝑞-monochromatic finite set; we must show that
𝑎 ∈ 𝒦 holds. This is clear if 𝑎 ⊂ 𝑑0 or 𝑎 ⊂ 𝑑1 as 𝑝0 , 𝑝1 ∈ 𝑃. If 𝑎 ⊂ 𝑑0 ∪ 𝑑1 while
𝑎 ⊄ 𝑑0 and 𝑎 ⊄ 𝑑1 and 𝑎 ∉ 𝒦 then by the modularity there would have to be a point
𝑥 ∈ 𝚌𝚕(𝑎 ∩ 𝑑0 ) ∩ 𝚌𝚕(𝑎 ⧵ 𝑑0 ). This is impossible by item (2) though. If 𝑎 ⊄ 𝑑0 ∪ 𝑑1 ,
then 𝑎 contains a unique point 𝑥 in 𝑑2 since 𝑞 ↾ 𝑑2 is an injection. By the previous
case, 𝑎 ∩ (𝑑0 ∪ 𝑑1 ) belongs to 𝒦. Thus, if 𝑎 ∉ 𝒦 then it must be the case that 𝑥 ∈
𝚌𝚕(𝑎 ∩ (𝑑0 ∪ 𝑑1 )). By the modularity assumption, there must be points 𝑦0 ∈ 𝚌𝚕(𝑎 ∩ 𝑑0 )
and 𝑦1 ∈ 𝚌𝚕(𝑎 ∩ 𝑑1 ⧵ 𝑑0 ) such that 𝑥 ∈ 𝚌𝚕({𝑦0 , 𝑦1 }). An inspection reveals that 𝑥 𝐸𝑑0 𝑦1
holds. By the choice of the function 𝑞, the colors of 𝑥 and the points in 𝑎 ∩ 𝑑1 ⧵ 𝑑0 must
differ. We have reached a contradiction in all cases, proving 𝑞 ∈ 𝑃.
Now we show that 𝑞 ≤ 𝑝0 ; the proof of 𝑞 ≤ 𝑝1 is symmetric. To verify item (1) of
Definition 8.2.16, let 𝑎 ⊂ 𝑑 ⧵ 𝑑0 be a monochromatic set. If 𝑎 ⊂ 𝑑1 , then 𝚌𝚕(𝑎) ∩ 𝑑0 ≠ 0
follows from (2) of the present claim. If 𝑎 ⊄ 𝑑1 , then 𝑎 contains exactly one point
𝑥 ∈ 𝑑2 as 𝑞 ↾ 𝑑2 is an injection. If 𝚌𝚕(𝑎) ∩ 𝑑0 were nonempty, let 𝑦 ∈ 𝑑0 be an element
of the intersection. Use the modularity of to find a point 𝑧 ∈ 𝚌𝚕(𝑎 ∩ 𝑑1 ) such that
𝑦 ∈ 𝚌𝚕(𝑥, 𝑧). Since 𝑥 ∉ 𝚌𝚕(𝑦), the rank of the set {𝑥, 𝑦, 𝑧} is precisely two, so 𝑥 𝐸𝑑0 𝑧.
By the definition of the map 𝑞, the color of 𝑥 cannot be equal to the homogeneous color
of 𝑎 ∩ 𝑑1 . A contradiction.
To verify item (2) of Definition 8.2.16, suppose that 𝑒 is an 𝐸𝑑0 -class distinct from
dom(𝑝0 ). The monochromatic finite sets 𝑎 ⊂ 𝑑 such that 𝚌𝚕(𝑎) ∩ 𝑒 is nonempty divide
into two classes. The first class consists of sets 𝑎 such that 𝑎 ∩ 𝑑2 ≠ 0; these must have
the homogeneous color from the set 𝑞″ 𝑑2 which is a graph of a function from 𝜔 to 𝜔.
The second class consists of sets 𝑎 such that 𝑎 ⊂ 𝑑1 . The set of colors attained by the
second class has all vertical sections finite by demand (3) of the present claim. (2) of
Definition 8.2.16 has been verified. □
For (1) of the theorem, let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be mutually generic extensions of 𝑉, and
let 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ] be conditions, both stronger than 𝑐. We must show that
𝑝0 , 𝑝1 are compatible; i.e. we need to verify the demands (1-3) of Claim 8.2.19. Item
(1) follows from the fact that 𝑐 ⊂ 𝑝0 ∩ 𝑝1 . Item (2) follows from the definition of the
partial order ≤ and the fact that 𝑝0 , 𝑝1 ≤ 𝑐. To verify (3), we need
Claim 8.2.20. 𝐸𝑑0 ↾ 𝑑1 = 𝐸𝑋∩𝑉 ↾ 𝑑1 and 𝐸𝑑1 ↾ 𝑑0 = 𝐸𝑋∩𝑉 ↾ 𝑑0 .
Proof. We deal with the first equality. The right-to-left inclusion is clear as 𝑋 ∩
𝑉 ⊂ 𝑑0 holds. For the left-to-right inclusion, let 𝑥, 𝑦 ∈ 𝑑1 be points and 𝑎 ⊂ 𝑑0 be
a finite set such that 𝑦 ∈ 𝚌𝚕(𝑎 ∪ {𝑥}); we must find a finite set 𝑏 ⊂ 𝑋 ∩ 𝑉 such that
𝑦 ∈ 𝚌𝚕(𝑏 ∪ {𝑥}). If 𝑦 ∈ 𝚌𝚕(𝑥) then we are done. Suppose then that 𝑦 ∉ 𝚌𝚕(𝑥). Use
the modularity of the matroid to find a point 𝑧 ∈ 𝚌𝚕(𝑎) such that 𝑦 ∈ 𝚌𝚕(𝑧, 𝑥). By the
exchange property of the matroid, 𝑧 ∈ 𝚌𝚕(𝑥, 𝑦) holds. As the matroid 𝒦 has countable
closures, 𝑧 ∈ 𝑉[𝐺1 ] holds. At the same time, as 𝑧 ∈ 𝚌𝚕(𝑎) and 𝑎 ⊂ 𝑑0 ⊂ 𝑉[𝐺0 ], 𝑧 ∈
𝑉[𝐺0 ] holds also. We conclude that 𝑧 ∈ 𝑉 by the product forcing theorem, completing
the proof. □
Now, demand (3) of Claim 8.2.19 follows from Claim 8.2.20 and the fact that 𝑝0 , 𝑝1 ≤ 𝑞
again. (1) of the theorem has been proved.
For (2) of the theorem, suppose that ⟨𝑄, 𝜏⟩ is a balanced pair. Strengthening 𝜏
if necessary, we may assume that 𝑄 ⊩ (𝑋 ∩ 𝑉) ⊂ dom(𝜏). By a balance argument
(Proposition 5.2.4), for each point 𝑥 ∈ 𝑋 ∩ 𝑉 there is a pair 𝑐(𝑥) ∈ 𝜔 × 𝜔 such that
𝑄 ⊩ 𝜏(𝑥)̌ = 𝑐(𝑥). It is immediately clear that all finite 𝑐-monochromatic sets belong
to 𝒦. We will show that the balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝑋), 𝑐⟩̌ are equivalent. To
this end, it is enough to argue that 𝑄 ⊩ 𝜏 ≤ 𝑐.̌ Suppose towards a contradiction that
some condition 𝑞 ∈ 𝑄 forces the opposite. Let 𝐺0 , 𝐺1 ⊂ 𝑄 be mutually generic filters
meeting the condition 𝑞, and write 𝑝0 = 𝜏/𝐺0 and 𝑝1 = 𝜏/𝐺1 . To reach the contradic-
tion with the balance of the pair ⟨𝑄, 𝜏⟩, argue that 𝑝0 , 𝑝1 are conditions incompatible
in 𝑃. This, however, is clear from Claim 8.2.19: one of the items (2, 3) has to fail as
𝑝0 ≰ 𝑐 fails.
(3) of the theorem is clear. For the last sentence, if CH holds and 𝑝 ∈ 𝑃 is a condi-
tion, let 𝑋 = ⋃𝛼∈𝜔 𝑎𝛼 be a continuous increasing union of countable matroid closed
1
subsets of 𝑋 such that dom(𝑝0 ) = 𝑎0 , and let 𝑐 ∶ 𝑋 → 𝜔 × 𝜔 be any map such that
𝑐 ↾ dom(𝑝) = 𝑝, rng(𝑐 ↾ 𝑋 ⧵ dom(𝑝)) ⊂ 𝜔 × 𝜔 has all vertical sections finite, and for
every countable ordinal 𝛼 the function 𝑐 ↾ 𝑎𝛼+1 ⧵ 𝑎𝛼 is an injection. We claim that
Coll(𝜔, 𝑋) ⊩ 𝑐 ̌ ≤ 𝑝 ̌ is a condition in 𝑃; the balance of 𝑐 then follows from (1).
To show that Coll(𝜔, 𝑋) ⊩ 𝑐 ̌ ∈ 𝑃, we have to argue that every finite monochro-
matic set is in 𝒦. Towards contradiction, assume that 𝑏 ⊂ 𝑋 is a finite monochromatic
set not in 𝒦. Let 𝛼 ∈ 𝜔1 be the largest ordinal such that 𝑏 ∩ 𝑎𝛼 ∈ 𝒦. Note that 𝛼 ≥ 0
since 𝑏 ∩ 𝑎0 is monochromatic, so in 𝒦 as 𝑝 ∈ 𝑃. By the maximality of the ordinal
𝛼 it must be the case that 𝑏 ∩ 𝑎𝛼+1 ⧵ 𝑎𝛼 ≠ 0. This latter set must contain exactly one
element (call it 𝑥) by the monochromaticity assumption. But then, 𝑥 ∉ 𝚌𝚕(𝑏 ∩ 𝑎𝛼 ) and
so 𝑏 ∪ {𝑥} ∈ 𝒦, contradicting the maximality of the ordinal 𝛼.
8.3. DISCONTINUOUS HOMOMORPHISMS 157
To show that Coll(𝜔, 𝑋) ⊩ 𝑐 ̌ ≤ 𝑝,̌ first verify (1) of Definition 8.2.16. Let 𝑏 ⊂ 𝑋 ⧵ 𝑎0
be a finite monochromatic set. Suppose towards contradiction that 𝚌𝚕(𝑏) ∩ 𝑎0 ≠ 0, and
let 𝛼 ∈ 𝜔1 be the largest ordinal such that 𝚌𝚕(𝑏∩𝑎𝛼 )∩𝑎0 = 0. By the monochromaticity,
there is precisely one element (call it 𝑥) in 𝑏 ∩ 𝑎𝛼+1 ⧵ 𝑎𝛼 . Let 𝑦 ∈ 𝚌𝚕(𝑏 ∩ 𝑎𝛼+1 ) ∩ 𝑎0 be
an arbitrary element. By the exchange property of the matroid, 𝑥 ∈ 𝚌𝚕((𝑏 ∩ 𝑎𝛼 ) ∪ {𝑦})
must hold. However, this is impossible as the latter set is a subset of 𝑎𝛼 while 𝑥 is not
an element of 𝑎𝛼 . To verify (2) of Definition 8.2.16, note that the map 𝑐 was chosen so
that rng(𝑐 ↾ 𝑋 ⧵ dom(𝑝)) ⊂ 𝜔 × 𝜔 has all vertical sections finite, which guarantees (2)
automatically. □
Example 8.2.21. Let 𝑋 be the (non-Polishable) group of finite subsets of an un-
countable Polish space 𝑌 with the symmetric difference operation. View 𝑋 as a vector
space over the binary field and let 𝒦 be the modular matroid of finite linearly indepen-
dent subsets of 𝑋, as spelled out in Example 6.3.7. Let 𝑐 ∶ 𝑋 → 𝜔 be a 𝒦-decomposition
of 𝑋. The restriction 𝑐 ↾ [𝑌 ]2 is a decomposition of the complete graph on 𝑌 into count-
ably many acyclic sets.
Example 8.2.22. Let 𝑋 = ℝ and let 𝒦 be the modular matroid of finite subsets
of 𝑋 linearly independent over ℚ. The 𝒦-decomposition is just a decomposition of ℝ
into countably many linearly independent pieces.
In both examples above, [26] shows that the existence of 𝒦-decompositions and there-
fore the balance of the decomposition posets is equivalent to the Continuum Hypoth-
esis.
8.3. Discontinuous homomorphisms

Another task which can be handled by balanced posets derived from simplicial
complexes is the adding of discontinuous homomorphisms between topological struc-
tures. In this section, we treat the case of Polish groups. The problem of the existence
of discontinuous homomorphisms from one Polish group to another has been stud-
ied for decades. In ZFC, some groups such as the unitary group [108] or the group of
homeomorphisms of the unit circle [90] cannot be homomorphically mapped to an-
other Polish group in a discontinuous way. In the ZF+DC context, the existence of dis-
continuous homomorphisms has interesting consequences: in general, it implies that
the chromatic number of the Hamming graph ℍ2 is 2 [89], for some specific groups it
implies the existence of a nonprincipal ultrafilter [103, Theorem 4.1], for the additive
groups of separable Banach spaces it implies the existence of an 𝔼0 -selector (Proposi-
tion 9.2.22). For an exposition, see [88]. In this section, we provide a balanced forcing
adding a discontinuous homomorphism of Polish groups in a certain common special
case.
Definition 8.3.1. Let Γ and Δ be Polish groups. The simplicial complex 𝒦(Γ, Δ)
on 𝑋 ×𝑌 consists of all finite sets 𝑎 ⊂ 𝑋 ×𝑌 which are subsets of a homomorphism from
𝑋 to 𝑌 . We will write 𝑃(Γ, Δ) for the associated Γ, Δ-homomorphism poset of countable
𝒦(Γ, Δ)-sets ordered by inclusion.
As was the case in Section 8.1, it seems to be difficult to evaluate the complexity of
the complex 𝒦(Γ, Δ) without having additional information on the nature of the two
groups. In this section, we will deal with a very special case which nevertheless resolves
some interesting problems.
Theorem 8.3.2. Let Γ, Δ be abelian Polish groups on respective Polish spaces 𝑋, 𝑌 .

Suppose that Δ is divisible. Then the poset 𝑃(Γ, Δ) is Suslin and
(1) for every homomorphism ℎ ∶ Γ → Δ, the pair ⟨Coll(𝜔, 𝑋 × 𝑌 ), ℎ⟩̌ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a homomorphism ℎ ∶ Γ → Δ such that
the pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝑋 × 𝑌 ), ℎ⟩̌ are equivalent;
(3) distinct homomorphisms yield inequivalent balanced virtual conditions.
In particular, the poset 𝑃(Γ, Δ) is balanced.
Proof. Write 𝒦 = 𝒦(Γ, Δ) and 𝑃 = 𝑃(Γ, Δ). For the Suslinness of 𝑃, it is enough
to argue that the simplicial complex 𝒦 is Borel. For that, note that a finite partial
function 𝑎 ⊂ 𝑋 × 𝑌 belongs to 𝒦 if and only if for every ℤ-combinations Σ𝑖 𝑛𝑖 𝛾𝑖 = Σ𝑗 𝑛𝑗 𝛾𝑗
of elements of 𝑃, it is the case that Σ𝑖 𝑛𝑖 𝑎(𝛾𝑖 ) = Σ𝑗 𝑛𝑗 𝑎(𝛾𝑗 ). The left-to-right implication
is clear, since the right hand side holds for every homomorphism from Γ to Δ. For
the right-to-left implication, note that the assumption on the right hand side implies
that 𝑎 can be extended to a homomorphism from the subgroup generated by dom(𝑎)
to Δ, which then can be extended to a homomorphism of all of Γ to Δ by the divisibility
assumption on Δ and Baer’s criterion [3].
For (1), suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions of the ground
model 𝑉 and 𝑎0 , 𝑎1 ∈ 𝒦 are finite functions in the respective models such that 𝑎0 ∪ ℎ
and 𝑎1 ∪ ℎ are 𝒦-sets. We need to show that 𝑎0 ∪ 𝑎1 ∈ 𝒦. Towards a contradiction,
suppose that this fails, and write 𝑎 = 𝑎0 ∪ 𝑎1 . By the work of the previous paragraph,
there must be ℤ-combinations Σ𝑖 𝑛𝑖 𝛾𝑖 = Σ𝑗 𝑛𝑗 𝛾𝑗 such that Σ𝑖 𝑛𝑖 𝑎(𝛾𝑖 ) ≠ Σ𝑗 𝑛𝑗 𝑎(𝛾𝑗 ). Note that
elements of both 𝑎0 , 𝑎1 must be used in these combinations. Rearranging the combi-
nations, we may assume that the left combination uses only elements from 𝑎0 and the
right one uses only elements of 𝑎1 . By the product forcing theorem, 𝛾 = Σ𝑖 𝑛𝑖 𝛾𝑖 = Σ𝑗 𝑛𝑗 𝛾𝑗
must belong to 𝑉. Since both 𝑎0 and 𝑎1 form a 𝒦-set with the homomorphism ℎ, the
outputs Σ𝑖 𝑛𝑖 𝑎(𝛾𝑖 ), Σ𝑗 𝑛𝑗 𝑎(𝛾𝑗 ) must both be equal to ℎ(𝛾), and therefore cannot be distinct,
a contradiction.
For (2), let ⟨𝑄, 𝜏⟩ be a balanced pair. Strengthening 𝜏 if necessary, we may assume
that for each point 𝛾 ∈ Γ ∩ 𝑉 𝑄 ⊩ 𝜏(𝛾)̌ ∈ dom(𝜏). Now, fix a point 𝛾 ∈ Γ. By a
balance argument (Proposition 5.2.4), for every basic open set 𝑂 ⊂ Δ it must be the
case that either 𝑄 ⊩ 𝜏(𝛾) ∈ 𝑂̇ or 𝑄 ⊩ 𝜏(𝛾) ∉ 𝑂.̇ This means that there is a single
point 𝛿(𝛾) ∈ Δ which is in the intersection of all open sets 𝑂 ⊂ Δ for which the former
option prevails; it must be the case that 𝑄 ⊩ 𝜏(𝛾) = 𝛿(𝛾). The function ℎ ∶ 𝛾 ↦ 𝛿(𝛾)
must be a homomorphism from Γ to Δ. Clearly 𝑄 ⊩ 𝜏 ≤ ℎ;̌ by Proposition 5.2.6, the
pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝑋 × 𝑌 ), ℎ⟩̌ are equivalent.
Finally, (3) is obvious. For the last sentence, note that every condition 𝑝 ∈ 𝑃 can
be extended to a homomorphism from Γ to Δ by the work of the first paragraph. □
Example 8.3.3. Suppose that Γ, Δ are abelian Polish groups, with Γ torsion free
and uncountable and Δ divisible–the case Γ = ℝ and Δ = ℝ/ℤ is of particular interest.
Then the poset 𝑃 = 𝑃(Γ, Δ) forces the generic homomorphism to be discontinuous. To
see this, let 𝑝 ∈ 𝑃 be a condition. Let ⟨𝛾𝑖 ∶ 𝑖 ≤ 𝜔⟩ be a sequence of elements of Γ which
are linearly independent over dom(𝑝) and such that lim 𝛾𝑖 = 𝛾𝜔 . Pick distinct elements
𝛿, 𝛿𝜔 and let 𝑞 = 𝑝 ∪ {⟨𝛾𝑖 , 𝛿⟩ ∶ 𝑖 ∈ 𝜔, ⟨𝛾𝜔 , 𝛿𝜔 ⟩}. It is immediate that 𝑞 is a 𝒦(Γ, Δ)-set,
and it forces 𝛾𝜔 to be a point of discontinuity of the generic homomorphism.
8.4. AUTOMORPHISMS OF 𝒫(𝜔) MODULO FINITE 159
8.4. Automorphisms of 𝒫(𝜔) modulo finite

Automorphisms of the Boolean algebra 𝒫(𝜔) modulo finite have been investigated
for decades. The simply definable ones are trivial [112] and the Proper Forcing Axiom
implies that all automorphisms of the algebra are trivial [96]. It turns out that there is
a natural balanced poset for adding a nontrivial automorphism of the Boolean algebra
𝐵 = 𝒫(𝜔) modulo finite.
Definition 8.4.1. The automorphism poset 𝑃 consists of pairs 𝑝 = ⟨𝐵𝑝 , 𝜋𝑝 ⟩ where
𝐵𝑝 ⊂ 𝐵 is a countable subalgebra and 𝜋𝑝 is an automorphism of 𝐵𝑝 . The ordering is
that of coordinatewise reverse inclusion.
The automorphism poset is clearly 𝜎-closed and Suslin. By a simple density argument,
it adds a nontrivial automorphism of the algebra 𝐵. This is an immediate consequence
of the following observation.
Fact 8.4.2. [9, Theorem 2.3] Let 𝐶 ⊂ 𝐵 be a countable algebra and 𝜋 ∶ 𝐶 → 𝐶 be
an automorphism. Let 𝜒 ∶ 𝐵 → 𝐵 be an automorphism. Then there is an automorphism
𝜂 ∶ 𝐵 → 𝐵 extending 𝜋 and not equal to 𝜒.
The balanced virtual conditions in the poset 𝑃 are naturally classified by automor-
phisms of the algebra 𝐵. Let 𝜋 ∶ 𝐵 → 𝐵 be such an automorphism, and consider the
Coll(𝜔, 𝐵)-name 𝜏𝜋 for the (set of all conditions stronger than the) condition ⟨𝐵𝑉 , 𝜋⟩̌ ∈
𝑃. The following theorem provides the key classification information.
Theorem 8.4.3. Let 𝑃 be the automorphism poset.
(1) For every automorphism 𝜋 of 𝐵, the pair ⟨Coll(𝜔, 𝐵), 𝜏𝜋 ⟩ is balanced in 𝑃;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is an automorphism 𝜋 of 𝐵 such that the
balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝐵), 𝜏𝜋 ⟩ are equivalent;
(3) distinct automorphisms yield inequivalent balanced virtual conditions.
Proof. Item (1) is actually the most demanding part. Suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ]
are mutually generic extensions of 𝑉, and 𝑝0 = ⟨𝐵0 , 𝜋0 ⟩ ∈ 𝑉[𝐻0 ] and 𝑝1 = ⟨𝐵1 , 𝜋1 ⟩ ∈
𝑉[𝐻1 ] are Boolean algebras extending 𝐵 𝑉 and automorphisms extending 𝜋 respec-
tively. Let 𝐶 be the subalgebra of 𝐵 𝑉 [𝐻0 ,𝐻1 ] generated by 𝐵0 ∪ 𝐵1 . We will find an
automorphism of 𝐶 extending 𝜋0 ∪ 𝜋1 , providing a common lower bound of the condi-
tions 𝑝0 , 𝑝1 .
Claim 8.4.4.
(1) If 𝑎0 ∈ 𝐵0 , 𝑎1 ∈ 𝐵1 and 𝑐 ∈ 𝐵 𝑉 are such that 𝑎0 ∧𝑎1 ≤ 𝑐, then 𝜋0 (𝑎0 )∧𝜋1 (𝑎1 ) ≤
𝜋(𝑐) holds;
(2) If 𝑎0 , 𝑏0 ∈ 𝐵0 and 𝑎1 , 𝑏1 ∈ 𝐵1 and 𝑎0 ∧ 𝑎1 ≤ 𝑏0 ∧ 𝑏1 , then 𝜋0 (𝑎0 ) ∧ 𝜋1 (𝑎1 ) ≤
𝜋0 (𝑏0 ) ∧ 𝜋1 (𝑏1 ) holds;
(3) If 𝑎0 , 𝑏0𝑖 for 𝑖 ∈ 𝑛 belong to 𝐵0 , 𝑎1 , 𝑏1𝑖 for 𝑖 ∈ 𝑛 belong to 𝐵1 , and 𝑎0 ∧ 𝑎1 ≤
⋁𝑖 (𝑏0𝑖 ∧ 𝑏1𝑖 ) holds, then 𝜋0 (𝑎0 ) ∧ 𝜋1 (𝑎1 ) ≤ ⋁𝑖 (𝜋0 (𝑏0𝑖 ) ∧ 𝜋1 (𝑏1𝑖 )) holds.
Proof. For (1), note that 𝑎0 − 𝑐 and 𝑎1 − 𝑐 are disjoint sets in the mutually generic
models 𝑉[𝐻0 ] and 𝑉[𝐻1 ], so by Proposition 1.7.9 there are ground model sets 𝑑0 , 𝑑1
such that 𝑎0 − 𝑐 ≤ 𝑑0 , 𝑎1 − 𝑐 ≤ 𝑑1 , and 𝑑0 ∧ 𝑑1 = 0. Then 𝜋0 (𝑎0 ) − 𝜋(𝑐) ≤ 𝜋(𝑑0 ) since
𝜋0 is an automorphism of 𝐵0 extending 𝜋. For the same reason 𝜋1 (𝑎1 ) − 𝜋(𝑐) ≤ 𝜋(𝑑1 )
holds; moreover, 𝜋(𝑑0 ) ∧ 𝜋(𝑑1 ) = 0 follows from the fact that 𝜋 is an automorphism.
For (2), the inequality 𝑎0 ∧ 𝑎1 ≤ 𝑏0 ∧ 𝑏1 yields (𝑎0 ∧ 𝑏0 ) ∧ (𝑎1 − 𝑏1 ) = 0. Since
𝑎0 ∧ 𝑏0 ∈ 𝑉[𝐻0 ] and 𝑎1 − 𝑏1 ∈ 𝑉[𝐻1 ] and the two extensions are mutually generic,
by Proposition 1.7.9 there has to be a ground model set 𝑐 ⊂ 𝜔 such that 𝑎0 ∧ 𝑏0 ≤ 𝑐
and 𝑐 ∧ (𝑎1 − 𝑏1 ) = 0. For the same reason, there is a ground model set 𝑑 ⊂ 𝜔 such
that 𝑎1 ∧ 𝑏1 ≤ 𝑑 and 𝑑 ∧ (𝑎0 − 𝑏0 ) = 0. The choice of 𝑐 shows that 𝑎0 ∧ 𝑎1 ≤ 𝑐 and
moreover 𝑎1 ∧ 𝑐 ≤ 𝑏1 ; for the same reason, 𝑎0 ∧ 𝑎1 ≤ 𝑑 and 𝑎0 ∧ 𝑑 ≤ 𝑏0 holds. In total,
writing 𝑒 = 𝑐 ∧ 𝑑, we have 𝑎0 ∧ 𝑎1 ≤ 𝑒, 𝑎0 ∧ 𝑒 ≤ 𝑏0 , and 𝑎1 ∧ 𝑒 ≤ 𝑏1 . By the first item,
𝜋0 (𝑎0 ) ∧ 𝜋1 (𝑎1 ) ≤ 𝜋(𝑒) follows. Moreover, since 𝜋0 and 𝜋1 are automorphisms, the
inequalities 𝜋0 (𝑎0 ) ∧ 𝜋(𝑒) ≤ 𝜋0 (𝑏0 ) and 𝜋1 (𝑎1 ) ∧ 𝜋(𝑒) ≤ 𝜋1 (𝑏1 ) hold. The conclusion
of (2) is then at hand.
For (3), for each nonempty set 𝑡 ⊂ 𝑛 let 𝑐𝑡 = ⋀𝑖∈𝑡 𝑏0𝑖 − ⋁𝑖∉𝑡 𝑏0𝑖 ; these are pairwise
disjoint sets in 𝑉[𝐻0 ]. Write also 𝑑𝑡 = ⋁𝑖∈𝑡 𝑏1𝑖 ; these are sets in 𝑉[𝐻1 ]. Now, 𝑎0 ∧ 𝑎1 ≤
⋁𝑡 𝑐𝑡 , and by (2) 𝜋0 (𝑎0 ) ∧ 𝜋1 (𝑎1 ) ≤ ⋁𝑡 𝜋0 (𝑐𝑡 ) holds. For each 𝑡 ⊂ 𝑛, 𝑎0 ∧ 𝑎1 ∧ 𝑐𝑡 ≤
𝑑𝑡 holds, and by (2) 𝜋0 (𝑎0 ) ∧ 𝜋1 (𝑎1 ) ∧ 𝜋0 (𝑐𝑡 ) ≤ 𝜋1 (𝑑𝑡 ) holds. The conclusion of (3)
follows. □
Now, express each element of the algebra 𝐶 as a disjunction of conjunctions of elements

of 𝐵0 and 𝐵1 , and define 𝜒(⋁𝑖 (𝑎0𝑖 ∧ 𝑎1𝑖 )) = ⋁𝑖 (𝜋0 (𝑎0𝑖 ) ∧ 𝜋1 (𝑎1𝑖 )) where each 𝑎0𝑖 ∈ 𝐵0
and each 𝑎1𝑖 ∈ 𝐵1 . Claim 8.4.4(3) shows that the definition of 𝜒(𝑐) does not depend
on the choice of the representation of the element 𝑐 ∈ 𝐶 as a disjunction of conjunc-
tions. The map 𝜒 ∶ 𝐶 → 𝐶 preserves ordering by (3) of Claim 8.4.4 and therefore is an
automorphism of the algebra 𝐶 as desired.
For item (2) of the theorem, extend 𝜏 if necessary so that 𝑄 ⊩ 𝜏 = ⟨𝐶, 𝜒⟩ for
some algebra 𝐶 containing 𝐵 𝑉 and some automorphism 𝜒 of 𝐶. By a balance argument
(Proposition 5.2.4), for each element 𝑏 ∈ 𝐵 there must be an element 𝜋(𝑏) ∈ 𝐵 such
that 𝑄 ⊩ 𝜒(𝑏)̌ = 𝜋(𝑏). It is immediate that 𝜋 is an automorphism of 𝐵 and 𝑄 ⊩
⟨𝐶, 𝜒⟩ ≤ ⟨𝐵 𝑉 , 𝜋⟩.
̌ Item (2) then follows from (1) and Proposition 5.2.6.
Finally, item (3) is obvious. For the last sentence, apply (1) with Fact 8.4.2. □
8.5. Kurepa families

The notion of a Kurepa family on a set is an old one [69]; it appears intermittently
in modern set theory [106], [25, Section 7]. In this section, we show how to force a
cofinal Kurepa family on a Polish space with a balanced poset.
Definition 8.5.1. Let 𝑋 be a set.

(1) A Kurepa family is a set 𝐴 ⊂ [𝑋]ℵ0 such that for every countable set 𝑏 ⊂ 𝑋,
the set {𝑎 ∩ 𝑏 ∶ 𝑎 ∈ 𝐴} is countable;
(2) the family is cofinal if for every countable set 𝑏 ⊂ 𝑋 there is a set 𝑎 ∈ 𝐴 such
that 𝑏 ⊂ 𝑎.
The main task of this section is to show how a cofinal Kurepa family for a given Polish
space can be added by balanced forcing.
Definition 8.5.2. Let 𝑋 be an uncountable Polish space. The Kurepa poset 𝑃 is a

poset of all countable sets 𝑝 ⊂ [𝑋]ℵ0 closed under finite intersections. The ordering is
defined by 𝑞 ≤ 𝑝 if 𝑝 ⊂ 𝑞 and for every 𝑎 ∈ 𝑞 and 𝑏 ∈ 𝑝, 𝑎 ∩ 𝑏 ∈ 𝑝.
8.5. KUREPA FAMILIES 161
Clearly the poset 𝑃 does not depend on the choice of the uncountable Polish space 𝑋
up to isomorphism. Clearly, 𝑃 is a 𝜎-closed Suslin forcing. If 𝐺 ⊂ 𝑃 is a generic filter,
then a simple genericity argument shows that ⋃ 𝐺 is a cofinal Kurepa family on 𝑋
which is closed under finite intersections. For every set 𝐴 ⊂ 𝒫(𝑋) closed under finite
intersections note that 𝐴̌ is a Coll(𝜔, 𝒫(𝑋))-name for an element of the Kurepa poset.
̌ is balanced, and all balanced
It turns out that if 𝑋 ∈ 𝐴 then the pair ⟨Coll(𝜔, 𝒫(𝜔)), 𝐴)⟩
pairs are up to equivalence of this form. This is the content of the following theorem.
Theorem 8.5.3. Let 𝑋 be an uncountable Polish space and let 𝑃 be the Kurepa poset
on 𝑋.
(1) If 𝐴 ⊂ 𝒫(𝑋) is a set closed under finite intersections and containing 𝑋 as an
element, then the pair ⟨Coll(𝜔, 𝒫(𝑋)), 𝐴⟩̌ is balanced.
(2) If ⟨𝑄, 𝜏⟩ is a balanced pair for 𝑃 then there is a set 𝐴 ⊂ 𝒫(𝑋) closed under
finite intersections and containing 𝑋 such that the balanced pairs ⟨𝑄, 𝜏⟩ and
⟨Coll(𝜔, 𝒫(𝑋)), 𝐴⟩̌ are equivalent.
(3) Distinct sets as in (1) yield inequivalent balanced virtual conditions.
Proof. For (1), fix a set 𝐴 ⊂ 𝒫(𝑋) closed under finite intersections and containing
the set 𝑋. Suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions of the ground
model 𝑉 in which the set 𝒫(𝑋) ∩ 𝑉 is countable. Suppose that 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈
𝑉[𝐻1 ] are conditions stronger than 𝐴; we must show that 𝑝0 , 𝑝1 ∈ 𝑃 are compatible,
in other words that 𝑝0 ∪ 𝑝1 ∈ 𝑃. To this end, let 𝑎0 ∈ 𝑝0 and 𝑎1 ∈ 𝑝1 be sets; we must
show that 𝑎0 ∩ 𝑎1 ∈ 𝑝0 ∩ 𝑝1 . To see this, first the product forcing theorem shows that
𝑎0 ∩ 𝑎1 ⊂ 𝑉 ∩ 𝑋 holds. Second, both sets 𝑎0 ∩ 𝑉 ∩ 𝑋 and 𝑎1 ∩ 𝑉 ∩ 𝑋 must belong to
𝐴, since 𝑉 ∩ 𝑋 ∈ 𝐴 and 𝐴 ≤ 𝑝0 , 𝑝1 . Since 𝐴 is closed under finite intersections, we see
that 𝑎0 ∩ 𝑎1 = (𝑎0 ∩ 𝑉) ∩ (𝑎1 ∩ 𝑉) ∈ 𝐴 ⊂ 𝑝0 ∩ 𝑝1 holds. Therefore, the conditions 𝑝0 , 𝑝1
are compatible as desired.
(2) is more challenging. Let ⟨𝑄, 𝜏⟩ be a balanced pair in the poset 𝑃. Without loss
of generality we may assume that 𝑄 ⊩ |𝒫(𝑋) ∩ 𝑉| = ℵ0 . Strengthening the condition
𝜏 repeatedly in the 𝑄-extension if necessary, we may assume that for each set 𝑎 ⊂ 𝑋
in the ground model, either 𝑎 ∈ 𝜏 or there is 𝑏 ∈ 𝜏 such that 𝑎 ∩ 𝑏 ∉ 𝜏. A balance
argument (Proposition 5.2.4) shows that for each set 𝑎 ⊂ 𝑋 in the ground model, the
largest condition in 𝑄 decides which alternative prevails. Let 𝐴 ⊂ 𝒫(𝑋) be a set of all
sets 𝑎 ⊂ 𝑋 for which the former alternative prevails. We will show that 𝐴 is a set closed
under finite intersections containing 𝑋, and 𝑄 ⊩ 𝐴̌ ≥ 𝜏. The desired equivalence of
⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝒫(𝑋)), 𝐴⟩̌ then follows from Proposition 5.2.6.
The closure of the set 𝐴 under finite intersections follows immediately from the
fact that 𝑄 forces 𝜏 to be closed under finite intersections. To see that 𝑋 ∈ 𝐴 holds,
suppose towards a contradiction that it fails; so there must be a 𝑄-name 𝜎 for a subset
of 𝑋 such that 𝑄 ⊩ 𝜎 ∈ 𝜏 and 𝜎 ∩ 𝑉 ∉ 𝜏. Strengthen the name 𝜏 if necessary to contain
a set which contains 𝑋 ∩ 𝑉 as a subset, and let 𝜂 be a 𝑄-name for such a set in 𝜏. Let
𝐻0 , 𝐻1 ⊂ 𝑄 be mutually generic filters, let 𝑝0 = 𝜏/𝐻0 and 𝑝1 = 𝜏/𝐻1 , and let 𝑎0 = 𝜂/𝐻0
and 𝑎1 = 𝜎/𝐻1 . By a mutual genericity argument, 𝑎0 ∩𝑎1 = (𝑎0 ∩𝑉)∩(𝑎1 ∩𝑉) = 𝑎1 ∩𝑉.
It follows that 𝑎0 ∩ 𝑎1 ∉ 𝑝1 , so 𝑝0 , 𝑝1 are incompatible conditions in 𝑃, contradicting
the balance assumption.
Finally, to show that 𝑄 ⊩ 𝜏 ≤ 𝐴,̌ suppose towards a contradiction that this fails.
Passing to a condition in 𝑄 if necessary we may find a set 𝑏 ∈ 𝐴 and a 𝑄-name 𝜎 such
that 𝑄 ⊩ 𝜎 ∈ 𝜏 and 𝜎 ∩ 𝑏 ̌ ∉ 𝐴.̌ Now proceed similarly to the previous paragraph.
Strengthen the name 𝜏 if necessary to contain a set which contains 𝑋 ∩ 𝑉 as a subset,
and let 𝜂 be a 𝑄-name for such a set in 𝜏. Let 𝐻0 , 𝐻1 ⊂ 𝑄 be mutually generic filters, let
𝑝0 = 𝜏/𝐻0 and 𝑝1 = 𝜏/𝐻1 , and let 𝑎0 = 𝜂/𝐻0 and 𝑎1 = 𝜎/𝐻1 . By a mutual genericity
argument, 𝑎0 ∩ 𝑏 ∩ 𝑎1 = (𝑎0 ∩ 𝑏) ∩ (𝑎1 ∩ 𝑏) = 𝑎1 ∩ 𝑏. Now, if 𝑎1 ∩ 𝑏 ∈ 𝑉, then 𝑎1 ∩ 𝑏 ∈ 𝐴,
contradicting the choice of the name 𝜎. Thus, it must be the case that 𝑎1 ∩ 𝑏 ∉ 𝑉, and
by a mutual genericity argument 𝑎1 ∩ 𝑏 ∉ 𝑉[𝐻0 ]. It follows that 𝑎0 ∩ 𝑏 ∩ 𝑎1 ∉ 𝑝0 , so
𝑝0 , 𝑝1 are incompatible conditions in 𝑃, contradicting the balance assumption.
Finally, (3) is obvious. The balance of the poset 𝑃 follows from (1): if 𝑝 ∈ 𝑃 is a
condition then ⟨Coll(𝜔, 𝑋), 𝑝 ∪ {𝑋 ∩ 𝑉}⟩ is a balanced pair below 𝑝. □
8.6. Set mappings

In this section, we develop posets for adding interesting set mappings. Let 𝑛 ∈ 𝜔.
A set mapping (of arity 𝑛) on a set 𝑋 is just a function 𝑓 ∶ [𝑋]𝑛 → 𝒫(𝑋) such that
𝑓(𝑎) ∩ 𝑎 = 0 holds for every set 𝑎 ∈ [𝑋]𝑛 . A free set for 𝑓 is a set 𝑏 ⊂ 𝑋 such that
𝑓(𝑎) ∩ 𝑏 = 0 holds for all 𝑎 ∈ [𝑏]𝑛 . Set mappings without large free sets have been
studied by Erdős, Hajnal, Komjáth, [27, 40, 68] and others. The guiding light of the
investigation is a well-known old result Kuratowski and Sierpiński:
Fact 8.6.1. [39] For every number 𝑛 ≥ 2, 2ℵ0 ≤ ℵ𝑛−1 holds if and only if there is a
set mapping 𝑓 ∶ [2𝜔 ]𝑛 → [2𝜔 ]<ℵ0 without a free set of cardinality 𝑛 + 1.
It is possible to add such mappings on Polish spaces by balanced forcing. We start with
an interesting limiting result.
Proposition 8.6.2. (ZF+DC) Let 𝑋 be an uncountable Polish space. If there is a
set mapping 𝑓 ∶ [𝑋]2 → [𝑋]<ℵ0 without a free triple, then there is a countable-to-one
function from 𝑋 to 𝜔1 .
Proof. For each 𝑥 ∈ 𝑋 let 𝑀𝑥 be the model of sets hereditarily ordinally definable
from 𝑥 and 𝑓. Let ≤ be the pre-ordering on the space 𝑋 defined by 𝑦 ≤ 𝑥 if 𝑦 ∈ 𝑀𝑥 .
First, we claim that ≤ is linear. To prove it, suppose towards a contradiction that
𝑥0 , 𝑥1 ∈ 𝑋 are ≤-incomparable elements. Let 𝑥2 ∈ 𝑋 be an ordinally definable point
which does not belong to the finite set 𝑓(𝑥0 , 𝑥1 ). Then 𝑥1 ∉ 𝑓(𝑥0 , 𝑥2 ) since 𝑥1 is not
definable from 𝑥0 , and 𝑥0 ∉ 𝑓(𝑥1 , 𝑥2 ) since 𝑥0 is not definable from 𝑥1 . Thus, the set
{𝑥0 , 𝑥1 , 𝑥2 } is a free triple for 𝑓, contradicting the initial choice of 𝑓.
Second, we claim that if 𝑦 < 𝑥 are points in 𝑋 then 𝑀𝑥 ⊧ 𝑀𝑦 ∩ 𝑋 is a countable
set. Suppose towards a contradiction that this fails. Working in the model 𝑀𝑥 , let 𝑁
be a countable elementary submodel of a large structure containing 𝑥, 𝑦 and 𝑓 ↾ 𝑀𝑥 .
Since 𝑀𝑦 contains uncountably many reals from the point of view of 𝑀𝑥 , there is a
point 𝑥0 ∈ 𝑀𝑦 ⧵ 𝑁. Let 𝑥1 ∈ 𝑀𝑦 ∩ 𝑁 be any point which does not belong to 𝑓(𝑥, 𝑥0 ).
As in the first paragraph, {𝑥, 𝑥0 , 𝑥1 } is a free triple for 𝑓, contradicting the initial choice
of 𝑓.
The proof now breaks into two cases.
Case 1. There is a point 𝑥 such that 𝑀𝑥 contains uncountably many elements of 𝑋.
By the previous two paragraphs, 𝑀𝑥 contains all points of 𝑋. As 𝑀𝑥 is a model of ZFC
8.6. SET MAPPINGS 163
containing 𝑓 as an element, by Fact 8.6.1 we conclude that 𝑀𝑥 contains an injection

𝑀
from 𝑋 to 𝜔1 𝑥 = 𝜔1 . This proves the proposition in this case.
𝑀
Case 2. Case 1 fails. In this case, let ℎ be the map on 𝑋 defined by ℎ(𝑥) = 𝜔1 𝑥 .
By the failure of Case 1, the range of ℎ is a subset of 𝜔1 . It is also a countable-to-one
map. Suppose towards a contradiction that for some ordinal 𝛼 ∈ 𝜔1 , the set 𝐴 = {𝑦 ∈
𝑋 ∶ ℎ(𝑦) = 𝛼} is uncountable. Let 𝑥 ∈ 𝐴 be any point, and use the case assumption
to find 𝑦 ∈ 𝐴 such that 𝑥 ∉ 𝑀𝑦 . By the linearity of ≺, it follows that 𝑦 < 𝑥. By the
previous work, the reals of 𝑀𝑦 are a countable set in 𝑀𝑥 , violating the assumption that
the two models have the same 𝜔1 . The proposition follows in this case as well. □
Proposition 8.6.2 and Corollary 9.1.2 show that we cannot hope to use a balanced forc-
ing to produce a set mapping with finite values with no free triple, as such a mapping
yields an uncountable sequence of 𝔽2 -classes. However, other options for set mappings
are achievable in balanced extensions.
Definition 8.6.3. Let 𝑋 be an uncountable Polish space. The fat set mapping
forcing is the poset 𝑃 of all functions 𝑝 such that for some countable set 𝑑(𝑝) ⊂ 𝑋,
𝑝 ∶ [𝑑(𝑝)]2 → 𝒫(𝑑(𝑝)) is a set mapping without free triples. The ordering is defined by
𝑞 ≤ 𝑝 if 𝑑(𝑝) ⊂ 𝑑(𝑞) and 𝑝 ⊂ 𝑞.
It is clear that 𝑃 is a 𝜎-closed Suslin forcing. The union of the 𝑃-generic set is a set
mapping with countable values and no free triples.
Theorem 8.6.4. Let 𝑃 be the fat set mapping forcing.

(1) If 𝑓 ∶ [𝑋]2 → 𝒫(𝑋) is any set mapping without free triples, then the pair
⟨Coll(𝜔, 𝑋), 𝑓⟩̌ is balanced;
(2) if ⟨𝑄, 𝜏⟩ is any balanced pair, there is a set mapping 𝑓 ∶ [𝑋]2 → 𝒫(𝑋) without
free triples such that the balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝑋), 𝑓⟩̌ are equiva-
lent;
(3) distinct set mappings on 𝑋 without free triples yield inequivalent balanced pairs.
Proof. For (1), it is clear that Coll(𝜔, 𝑋) ⊩ 𝑓 ̌ ∈ 𝑃 is a condition. Let 𝑉[𝐺0 ]

and 𝑉[𝐺1 ] be mutually generic extensions of 𝑉, and let 𝑝0 ∈ 𝑉[𝐺0 ], 𝑝1 ∈ 𝑉[𝐺1 ] be
conditions containing 𝑓 as a subset. To find a lower bound of 𝑝0 , 𝑝1 in 𝑉[𝐺0 , 𝐺1 ], let 𝑝
be the function defined by 𝑑(𝑝) = 𝑑(𝑝0 ) ∪ 𝑑(𝑝1 ), 𝑝0 ∪ 𝑝1 ⊂ 𝑝, and if {𝑥0 , 𝑥1 } ⊂ 𝑑(𝑝) is
a pair such that 𝑥0 ∈ 𝑑(𝑝0 ) ⧵ 𝑉 and 𝑥1 ∈ 𝑑(𝑝1 ) ⧵ 𝑉 then 𝑝(𝑥0 , 𝑥1 ) = 𝑑(𝑝) ⧵ {𝑥0 , 𝑥1 }. We
must show that 𝑝 is a common lower bound of 𝑝0 , 𝑝1 .
First of all, 𝑝0 ∪ 𝑝1 is indeed a function, since any pair 𝑎 in dom(𝑝0 ) ∩ dom(𝑝1 )
is already in the ground model 𝑉 by the product forcing theorem, and then 𝑝0 (𝑎) =
𝑝1 (𝑎) = 𝑓(𝑎). Second, we must verify that 𝑝 has no free triple. Let 𝑏 ⊂ 𝑑(𝑝) be a triple.
If 𝑏 ⊂ 𝑑(𝑝0 ) or 𝑏 ⊂ 𝑑(𝑝1 ) holds, then 𝑏 is not free because 𝑝0 , 𝑝1 contain no free triples.
Otherwise, 𝑏 can be listed as {𝑥0 , 𝑥1 , 𝑥2 } such that 𝑥0 ∈ 𝑑(𝑝0 ) ⧵ 𝑉 and 𝑥1 ∈ 𝑑(𝑝1 ) ⧵ 𝑉;
then 𝑥2 ∈ 𝑝(𝑥0 , 𝑥1 ) by the definition of 𝑝 and 𝑏 is not free either.
For (2), let ⟨𝑄, 𝜏⟩ be a balanced pair. Strengthening 𝑄 and 𝜏 if necessary, we may
assume that 𝑄 ⊩ 𝑉 ∩ 𝑋 ⊂ 𝑑(𝜏) holds. By a balance argument (Proposition 5.2.4), for
any points 𝑥0 , 𝑥1 , 𝑦 ∈ 𝑋 in the ground model, 𝑄 ⊩ 𝑦 ̌ ∈ 𝜏(𝑥0̌ , 𝑥1̌ ) or 𝑄 ⊩ 𝑦 ̌ ∉ 𝜏(𝑥0̌ , 𝑥1̌ )
holds. Let 𝑓 ∶ [𝑋]2 → 𝒫(𝑋) be the function defined by 𝑦 ∈ 𝑓(𝑥0 , 𝑥1 ) if the former
alternative in the previous sentence prevails. It is clear that 𝑓 contains no free triple
since 𝜏 is forced to contain none. Thus, it will be enough to show that 𝑄 ⊩ 𝑓 ̌ ⊂ 𝜏.
Suppose towards a contradiction that this fails. Then there must be a condition
𝑞 ∈ 𝑄 and points 𝑥0 , 𝑥1 ∈ 𝑋 such that 𝑞 ⊩ 𝜏(𝑥0̌ , 𝑥1̌ ) ≠ 𝑓(̌ 𝑥0̌ , 𝑥1̌ ). Let 𝐺0 , 𝐺1 ⊂ 𝑄
be mutually generic filters containing the condition 𝑞 and let 𝑝0 = 𝜏/𝐺0 , 𝑝1 = 𝜏/𝐺1 .
By the initial choice of the function 𝑓, there must be points 𝑦0 , 𝑦1 ∈ 𝑋 ⧵ 𝑉 such that
𝑦0 ∈ 𝑝0 (𝑥0 , 𝑥1 ) and 𝑦1 ∈ 𝑝1 (𝑥0 , 𝑥1 ). By the product forcing theorem, 𝑦0 ∉ 𝑉[𝐺1 ]
and 𝑦1 ∉ 𝑉[𝐺0 ] holds. Thus, 𝑝0 (𝑥0 , 𝑥1 ) ≠ 𝑝1 (𝑥0 , 𝑥1 ) and 𝑝0 , 𝑝1 are incompatible,
contradicting the balance of the pair ⟨𝑄, 𝜏⟩.
(3) is obvious. For the last sentence, suppose that 𝑝 ∈ 𝑃 is a condition. Consider
the set mapping 𝑓 ∶ [𝑋]2 → 𝒫(𝑋) defined by 𝑓(𝑥0 , 𝑥1 ) = 𝑝(𝑥0 , 𝑥1 ) if both 𝑥0 , 𝑥1 ∈ 𝑋
belong to 𝑑(𝑝), and 𝑓(𝑥0 , 𝑥1 ) = 𝑋 ⧵ {𝑥0 , 𝑥1 } otherwise. It is not difficult to check that
𝑓 is a set mapping without free triples. By item (1), 𝑓 represents a balanced virtual
condition below 𝑝. □
Definition 8.6.5. Let 𝑋 be an uncountable Polish space. A thin set mapping
forcing is a poset 𝑃 of all functions 𝑝 such that for some countable set 𝑑(𝑝) ⊂ 𝑋,
𝑝 ∶ [𝑑(𝑝)]3 → [𝑑(𝑝)]<ℵ0 is a set mapping without a free quadruple. The ordering is
defined by 𝑞 ≤ 𝑝 if 𝑑(𝑝) ⊂ 𝑑(𝑞) and 𝑝 ⊂ 𝑞.
Theorem 8.6.6. Let 𝑃 be the thin set mapping forcing.
(1) If 𝑓 ∶ [𝑋]3 → [𝑋]<ℵ0 is any set mapping without free quadruples, then
⟨Coll(𝜔, 𝑋), 𝑓⟩̌ is a balanced pair;
(2) if ⟨𝑄, 𝜏⟩ is any balanced pair, there is a set mapping 𝑓 ∶ [𝑋]3 → [𝑋]<ℵ0 with-
out free quadruples such that the balanced pairs ⟨Coll(𝜔, 𝑋), 𝑓⟩̌ and ⟨𝑄, 𝜏⟩ are
equivalent;
(3) distinct set mappings on 𝑋 without free quadruples yield inequivalent balanced
pairs.
In particular, the poset 𝑃 is balanced if and only if 2ℵ0 ≤ ℵ2 .
Proof. For (1), it is clear that Coll(𝜔, 𝑋) ⊩ 𝑓 ̌ ∈ 𝑝 holds. For the balance, sup-
pose that 𝑉[𝐺0 ], 𝑉[𝐺1 ] are mutually generic extensions and 𝑝0 ∈ 𝑉[𝐺0 ], 𝑝1 ∈ 𝑉[𝐺1 ]
are conditions extending 𝑓. To construct the lower bound 𝑝 of 𝑝0 , 𝑝1 , in the model
𝑉[𝐺0 , 𝐺1 ] choose an enumeration {𝑧𝑛 ∶ 𝑛 ∈ 𝜔} of 𝑑(𝑝0 ) ∪ 𝑑(𝑝1 ). Let 𝑝 be the function
on [𝑑(𝑝0 ) ∪ 𝑑(𝑝1 )]3 containing 𝑝0 ∪ 𝑝1 such that, whenever {𝑥0 , 𝑥1 , 𝑥2 } ∉ dom(𝑝0 ) ∪
dom(𝑝1 ), 𝑝(𝑥0 , 𝑥1 , 𝑥2 ) = {𝑧𝑛 ∶ 𝑛 ∈ 𝑚} ⧵ {𝑥0 , 𝑥1 , 𝑥2 } for the least 𝑚 ∈ 𝜔 such that
{𝑥0 , 𝑥1 , 𝑥2 } ⊂ {𝑧𝑛 ∶ 𝑛 ∈ 𝑚}. We must show that 𝑝 is a lower bound of 𝑝0 , 𝑝1 .
First of all, 𝑝0 ∪ 𝑝1 is indeed a function, since any pair 𝑎 in dom(𝑝0 ) ∩ dom(𝑝1 )
is already in the ground model 𝑉 by the product forcing theorem, and then 𝑝0 (𝑎) =
𝑝1 (𝑎) = 𝑓(𝑎). Second, we must verify that 𝑝 has no free quadruple. Let 𝑏 ⊂ 𝑑(𝑝) be a
quadruple. If 𝑏 ⊂ 𝑑(𝑝0 ) or 𝑏 ⊂ 𝑑(𝑝1 ) holds, then 𝑏 is not free because 𝑝0 , 𝑝1 contain no
free qudruples. Otherwise, 𝑏 can be listed as {𝑥0 , 𝑥1 , 𝑥2 , 𝑥3 } such that 𝑥0 ∈ 𝑑(𝑝0 ) ⧵ 𝑉,
𝑥1 ∈ 𝑑(𝑝1 ) ⧵ 𝑉 and 𝑥2 is enumerated after 𝑥3 ; then 𝑥3 ∈ 𝑝(𝑥0 , 𝑥1 , 𝑥2 ) by the definition
of 𝑝 and 𝑏 is not free either.
The proof of (2) is literally copied from the proof of Theorem 8.6.4(2). (3) is obvious.
For the last sentence, if 2ℵ0 > ℵ2 then by Fact 8.6.1 and (2) there are no balanced virtual
conditions and 𝑃 is not balanced. On the other hand, suppose that 2ℵ0 ≤ ℵ2 holds, and
let 𝑝 ∈ 𝑃 be a condition. To produce a balanced virtual condition stronger than 𝑝, let
8.7. SATURATED MODELS ON QUOTIENT SPACES 165
𝑔 ∶ [𝑋]3 → [𝑋]<ℵ0 be a set mapping without a free set of cardinality 4. Enumerate the
set 𝑑(𝑝) by ⟨𝑥𝑖 ∶ 𝑖 ∈ 𝜔⟩ and let 𝑓 ∶ [𝑋]3 → [𝑋]<ℵ0 be a function defined by 𝑓(𝑎) = 𝑝(𝑎)
if 𝑎 ⊂ 𝑑(𝑝), 𝑓(𝑎) = 𝑔(𝑎) if 𝑎 ∩ 𝑑(𝑝) = 0, and 𝑓(𝑎) = 𝑔(𝑎) ∪ {𝑥𝑖 ∶ 𝑖 ∈ 𝑛} where 𝑛 is the
smallest number such that 𝑥𝑛 ∈ dom(𝑎), for sets 𝑎 such that 𝑎 ⊄ 𝑑(𝑝) and 𝑎∩𝑑(𝑝) ≠ 0.
It is not difficult to see that 𝑓 is a set mapping without a free set of cardinality 4 such
that 𝑝 ⊂ 𝑓; therefore, by (1) it represents a balanced virtual condition stronger than
𝑝. □
8.7. Saturated models on quotient spaces

One can use quotient simplicial complex forcings to add structures to the various
quotient spaces as long as the structures satisfy a well-known amalgamation property
from model theory. We will first review the definitions. For first order structures 𝑀, 𝑁
in the same language, recall that a map 𝜋 ∶ 𝑀 → 𝑁 is a Σ0 -embedding if it is an injec-
tion from dom(𝑀) to dom(𝑁) which transports all relations and functions of 𝑀 to the
corresponding relations and functions in 𝑁.
Definition 8.7.1. [34] A Fraissé class is a class ℱ of finite structures in a fixed
finite first order language such that
(1) ℱ is closed under isomorphism and under induced substructures;
(2) (joint embedding property) whenever 𝑁0 , 𝑁1 ∈ ℱ are structures then there is
𝑀 ∈ ℱ containing both 𝑁0 , 𝑁1 as induced substructures;
(3) (amalgamation) whenever 𝑀, 𝑁0 , 𝑁1 ∈ ℱ are structures and 𝜋0 ∶ 𝑀 → 𝑁0
and 𝜋1 ∶ 𝑀 → 𝑁1 are Σ0 -embeddings, then there is a structure 𝐾 ∈ ℱ and
Σ0 -embeddings 𝜒0 ∶ 𝑁0 → 𝐾 and 𝜒1 ∶ 𝑁1 → 𝐾 such that 𝜒0 ∘ 𝜋0 = 𝜒1 ∘ 𝜋1 .
We will tacitly assume that our Fraissé classes contain arbitrarily large finite structures.
Fraissé classes are prominent in model theory [47, Theorems 5.3.3 and 5.3.5], Ramsey
theory [24, 83], and topological dynamics [60, 120]. The classes we can handle satisfy
a well-known stronger version of amalgamation:
Definition 8.7.2. A Fraissé class ℱ satisfies strong amalgamation if for whenever
𝑀, 𝑁0 , 𝑁1 ∈ ℱ are structures and 𝜋0 ∶ 𝑀 → 𝑁0 and 𝜋1 ∶ 𝑀 → 𝑁1 are Σ0 -embeddings,
then there is a structure 𝐾 ∈ ℱ and Σ0 -embeddings 𝜒0 ∶ 𝑁0 → 𝐾 and 𝜒1 ∶ 𝑁1 → 𝐾
such that 𝜒0 ∘ 𝜋0 = 𝜒1 ∘ 𝜋1 , and rng(𝜒0 ) ∩ rng(𝜒1 ) = (𝜒0 ∘ 𝜋)″ 𝑀.
Definition 8.7.3. Let ℱ be a Fraissé class in a finite relational language.
(1) An ℱ-structure is a structure 𝑀 in the same language as ℱ such that for every
finite set 𝑎 ⊂ dom(𝑀), 𝑀 ↾ 𝑎 ∈ ℱ;
(2) Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. The 𝐸, ℱ-Fraissé
poset 𝑃 consists of conditions 𝑝 where 𝑝 is an ℱ-structure whose domain is a
countable subset of the quotient space 𝑋/𝐸. The ordering is defined by 𝑞 ≤ 𝑝
if dom(𝑝) ⊂ dom(𝑞) and 𝑝 = 𝑞 ↾ dom(𝑝).
It is obvious that the poset 𝑃 introduces a ℱ-structure on the space 𝑋/𝐸, denoted by
𝑀̇ gen . It is not difficult, but at the same time also not particularly natural, to describe
the poset 𝑃(ℱ, 𝐸) as a quotient simplicial complex poset: the vertices of the simplicial
complex 𝒦 will be finite ℱ-structures on the 𝐸-quotient space, and a finite set 𝑎 of
vertices belongs to 𝒦 if all structures in 𝑎 are induced substructures of a single finite
ℱ-structure on the 𝐸-quotient space. It is obvious that the posets 𝑃(ℱ, 𝐸) and 𝑃𝒦 are
naturally co-dense; however, we will never use the simplicial complex presentation of
𝑃(ℱ, 𝐸). To describe balanced virtual conditions in the poset 𝑃(ℱ, 𝐸), suppose that 𝑀 is
an ℱ-structure on the virtual 𝐸-quotient space 𝑋 ∗∗ . Let 𝜏𝑀 be a Coll(𝜔, ℶ𝜔1 )-name for
the condition 𝜋″ 𝑀 where 𝜋 is the map from the virtual space (𝑋 ∗∗ )𝑉 to the 𝐸-quotient
space of the extension which maps each virtual class to its realization. Theorem 2.5.6
provides the necessary assurance that the map 𝜋 is well-defined and its range is a count-
able set.
Theorem 8.7.4. Let ℱ be a Fraissé class in a finite relational language which sat-
isfies strong amalgamation. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋.
Then in the 𝐸, ℱ-Fraissé poset 𝑃,
(1) for every ℱ-structure 𝑀 on 𝑋 ∗∗ , the pair ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑀 ⟩ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a ℱ-structure 𝑀 on 𝑋 ∗∗ such that the pairs
⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑀 ⟩ and ⟨𝑄, 𝜏⟩ are equivalent;
(3) distinct ℱ-structures on 𝑋 ∗∗ yield inequivalent balanced virtual conditions.
In particular, 𝑃 is balanced.
Proof. For (1), suppose that 𝑀 is a ℱ-structure on 𝑋 ∗∗ . Let 𝑅0 , 𝑅1 be arbitrary

posets and 𝜎0 , 𝜎1 are respective 𝑅0 × Coll(𝜔, ℶ𝜔1 )- and 𝑅1 × Coll(𝜔, ℶ𝜔1 )-names for
elements of 𝑃 such that in the respective posets 𝜎0 ≤ 𝜏𝑀 and 𝜎1 ≤ 𝜏 is forced. Let 𝐻0 , 𝐻1
be mutually generic filters on the respective posets and let 𝑝 = 𝜏𝑀 /𝐻0 , 𝑝0 = 𝜎0 /𝐻0 and
𝑝1 = 𝜎1 /𝐻1 ; we need to show that 𝑝0 , 𝑝1 are compatible in the poset 𝑃.
For this, first note that by the mutual genericity, dom(𝑝0 )∩dom(𝑝1 ) = dom(𝑝). By
the assumption on the names 𝜎0 , 𝜎1 it is the case that 𝑝0 ↾ dom(𝑝) = 𝑝1 ↾ dom(𝑝) = 𝑝.
Write 𝑐 = dom(𝑝0 )∪dom(𝑝1 ). By the strong amalgamation property of the Fraissé class
ℱ, for each finite set 𝑎 ⊂ 𝑐 there is a structure 𝑁𝑎 ∈ ℱ such that dom(𝑁𝑎 ) = 𝑎 and
writing 𝑎0 = 𝑎 ∩ dom(𝑝0 ) and 𝑎1 ∩ dom(𝑝1 ), 𝑁𝑎 ↾ 𝑎0 = 𝑝0 ↾ 𝑎0 and 𝑁1 ↾ 𝑎1 = 𝑝1 ↾ 𝑎1
both hold. Let 𝑈 be an ultrafilter on [𝑐]<ℵ0 such that for each finite set 𝑎 ⊂ 𝑐 the set
{𝑏 ∶ 𝑎 ⊂ 𝑏} is in the ultrafilter 𝑈. Let 𝑁 be the structure on 𝑐 which is the 𝑈-integral of
the structures 𝑁𝑎 . It is immediate that 𝑁 ↾ dom(𝑝0 ) = 𝑝0 and 𝑁 ↾ 𝑝1 = 𝑝1 ; the closure
of the Fraissé class under substructures shows that 𝑁 is a ℱ-structure. It is the desired
lower bound of the conditions 𝑝0 , 𝑝1 .
For (2), note that for each relation 𝑅 in the language of the Fraissé class ℱ and
every tuple 𝑎 of virtual 𝐸-classes, it must be the case that either 𝑄 ⊩ 𝜏 ⊩ 𝑎 belongs to
the relation 𝑅 in the generic structure 𝑀̇ gen , or 𝑄 ⊩ 𝜏 ⊩ 𝑎 does not to the relation 𝑅 in
the generic structure 𝑀̇ gen by the balance of the pair ⟨𝑄, 𝜏⟩. Let 𝑀 be the structure on
the virtual 𝐸-quotient space consisting of those tuples for which the former alternative
occurs. It is immediate that 𝑄 × Coll(𝜔, ℶ𝜔1 ) ⊩ 𝜏 ≤ 𝜏𝑀 in the separative quotient of
the poset 𝑃. The equivalence of the two pairs follows from Proposition 5.2.6.
Now, (3) is obvious. For the last sentence, suppose that 𝑝 ∈ 𝑃 is a condition.
For each finite set 𝑎 ⊂ 𝑋 ∗∗ , choose a structure 𝑁𝑎 ∈ ℱ such that dom(𝑁𝑎 ) = 𝑎 and
𝑁𝑎 ↾ (dom(𝑝) ∩ 𝑎) = 𝑝 ↾ (dom(𝑝) ∩ 𝑎). Let 𝑈 be an ultrafilter on [𝑋 ∗∗ ]<ℵ0 such that for
each finite set 𝑎 ⊂ 𝑋 ∗∗ the set {𝑏 ∶ 𝑎 ⊂ 𝑏} is in the ultrafilter 𝑈. Let 𝑁 be the structure on
𝑋 ∗∗ which is the 𝑈-integral of the structures 𝑁𝑎 . It is immediate that 𝑁 ↾ dom(𝑝) = 𝑝;
the closure of the Fraissé class under substructures shows that 𝑁 is a ℱ-structure. The
pair ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑁 ⟩ is a balanced virtual condition below 𝑝. □
8.7. SATURATED MODELS ON QUOTIENT SPACES 167
Example 8.7.5. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. Let

𝑃 be the poset of all linear orderings on countable subsets of the 𝐸-quotient space.
The poset is designed to add a linear ordering on the quotient space. Since the Fraissé
class of finite linear orderings has the strong amalgamation property, the poset 𝑃 is bal-
anced, and its balanced virtual conditions are classified by linear orders on the virtual
𝐸-quotient space.
𝑃 be the poset of all tournaments on countable subsets of the 𝐸-quotient space. The
poset is designed to add a tournament on the quotient space. Since the Fraissé class of
finite tournaments has the strong amalgamation property, the poset 𝑃 is balanced, and
its balanced virtual conditions are classified by tournaments on the virtual 𝐸-quotient
space.
The Fraissé posets can be viewed as a particularly well-behaved subclass of a signifi-
cantly larger class obtained from standard amalgamation constructions in model the-
ory.
Definition 8.7.7. Let 𝑇 be a complete first-order theory in countable language,
with infinite models. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. The
poset 𝑃𝑇𝐸 consists of structures 𝑝 satisfying the theory 𝑇 whose domain is a countable
subset of the 𝐸-quotient space. The ordering is that of elementary substructure: 𝑞 ≤ 𝑝
if the domain of 𝑝 is a subset of the domain of 𝑞, and 𝑝 is an elementary substructure
of 𝑞.
It is immediate that the union of the structures in the generic filter is a countably sat-
urated model of the theory 𝑇 on the 𝐸-quotient space. To classify the balanced virtual
conditions, we use the following definition.
Definition 8.7.8. A 𝑇-balanced theory is a complete consistent theory 𝑆 in the
language of 𝑇 plus a constant for each virtual 𝐸-class which contains 𝑇 and asserts than
no elements other than the virtual 𝐸-class constants are algebraic over those constants.
If 𝑇 is understood from the context, we omit it.
Note that the theory 𝑆 may not be first-order as it requires infinite disjunctions in-
dexed by the virtual 𝐸-classes. Now suppose that 𝑆 is a balanced theory. Let 𝜏𝑆 be the
Coll(𝜔, ℶ𝜔1 )-name for the set of all countable models 𝑝 ∈ 𝑃𝑇𝐸 such that dom(𝑝) con-
tains the set 𝑝0 of realizations of all ground model virtual 𝐸-classes and 𝑝 ⊧ 𝑆. It is not
difficult to see that 𝜏𝑆 is a name for an analytic, nonempty, and open subset of the poset
𝑃𝑇𝐸 .
Theorem 8.7.9. Let 𝑇 be a complete first-order theory in countable language, with
infinite models. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋.
(1) For every balanced theory 𝑆, the pair ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑆 ⟩ is balanced in 𝑃𝑇𝐸 ;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a balanced theory 𝑆 such that the balanced
pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑆 ⟩ are equivalent;
(3) distinct balanced theories yield inequivalent balanced pairs.
In particular, the poset 𝑃𝑇𝐸 is balanced.
Proof. For (1), suppose that 𝑆 is a balanced theory, 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually
generic extensions of the ground model, and 𝑝0 , 𝑝1 ∈ 𝑃𝑇𝐸 are conditions in the re-
spective models in the set given by the name 𝜏𝑆 . We must show that there is a model
𝑞 ∈ 𝑃𝑇𝐸 in which both models 𝑝0 , 𝑝1 of 𝑇 are elementary. Note that dom(𝑝0 )∩dom(𝑝1 )
is exactly the set of all realizations of ground model virtual 𝐸-classes by the mutual
genericity assumption. Use the algebraicity clause of Definition 8.7.8 and a textbook
amalgamation theorem [47, Theorem 5.3.5] to conclude that in 𝑉[𝐻0 , 𝐻1 ] there is a
countable model 𝑞 of 𝑇 and elementary embeddings 𝑗0 ∶ 𝑝0 → 𝑞 and 𝑗1 ∶ 𝑝1 → 𝑞
such that 𝑗0 , 𝑗1 coincide on the set 𝑟 of realizations of virtual 𝐸-classes from the ground
model, and the sets 𝑗0″ (𝑝0 ⧵ 𝑟) and 𝑗1″ (𝑝1 ⧵ 𝑟) are disjoint. It is easy to see that such
a model 𝑞 can be realized in such a way that its domain is a set of 𝐸-classes and the
embeddings 𝑗0 , 𝑗1 are both identity maps. Then 𝑞 is the sought lower bound of the
conditions 𝑝0 , 𝑝1 .
For (2), let ⟨𝑄, 𝜎⟩ be a balanced pair. Strengthening the name 𝜎 and the poset 𝑄 if
necessary, we may assume that 𝜎 is in fact a name for a single element of 𝑃𝑇𝐸 as op-
posed to an analytic subset of 𝑃𝑇𝐸 and that 𝜎 is forced to contain the realization of every
virtual 𝐸-class in the ground model. By a balance argument (Proposition 5.2.4), for ev-
ery formula 𝜙(𝑥)⃗ and every tuple 𝑐 ⃗ of virtual 𝐸-classes of the same length as 𝑥,⃗ it must
be the case that either 𝑄 ⊩ 𝜎 ⊧ 𝜙(𝑐)⃗ or 𝑄 ⊩ 𝜎 ⊧ ¬𝜙(𝑐).⃗ Let 𝑆 be the set of all formulas
and tuples of virtual 𝐸-classes 𝜙(𝑐)⃗ for which the former option prevails. We need to
show that 𝑆 is a balanced theory and the balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑆 ⟩ are
equivalent.
Claim 8.7.10. 𝑄 forces that no element of 𝜎 which is not a realization of a virtual
𝐸-class is algebraic over a tuple of virtual 𝐸-classes from the ground model.
Proof. Suppose towards a contradiction that this fails, and let 𝑞 ∈ 𝑄 be a condi-
tion, let 𝜂 be a 𝑄-name for an element of 𝜎 which is not a realization of a virtual 𝐸-class,
and let 𝜙 be a formula, 𝑐 ⃗ a tuple of virtual 𝐸-classes and 𝑛 ∈ 𝜔 be a natural number such
that 𝑞 ⊩ 𝜎 ⊧ there are precisely 𝑛 many 𝑥 such that 𝜙(𝑥, 𝑐)⃗ holds, and 𝜂 is one of them.
Let 𝐻0 , 𝐻1 ⊂ 𝑄 be mutually generic filters over the ground model, both containing 𝑞,
and let 𝑝0 = 𝜎/𝐻0 and 𝑝1 = 𝜎/𝐻1 . We will show that 𝑝0 , 𝑝1 have no lower bound in
the poset 𝑃𝑇𝐸 , reaching a contradiction with the balance assumption on the pair ⟨𝑄, 𝜎⟩.
Suppose then that 𝑞 is such a lower bound. By elementaricity, 𝑞 must see exactly
𝑛 many solutions to 𝜙(𝑥, 𝑐),⃗ and all solutions in 𝑝0 and in 𝑝1 are solutions in 𝑞. Now,
𝑝0 already sees 𝑛 many solutions, and 𝜂/𝐻1 is another solution in 𝑝1 which does not
belong to 𝑝0 or even to 𝑉[𝐻0 ]. Thus, 𝑞 in fact sees at least 𝑛 + 1 many solutions,a
contradiction. □
It follows that 𝑆 is a balanced theory, and also that Coll(𝜔, ℶ𝜔1 ) × 𝑄 ⊩ 𝜎 ∈ 𝜏𝑆 . The
equivalence of the balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, ℶ𝜔1 ), 𝜏𝑆 ⟩ then follows from Propo-
sition 5.2.6.
(3) is obvious. For the last sentence, suppose that 𝑝 ∈ 𝑃𝑇𝐸 is a condition–a count-
able model of the theory 𝑇. By the upwards Löwenheim–Skolem theorem, there is a
model 𝑀 of the theory 𝑇 on the virtual 𝐸-quotient space in which 𝑝 is an elementary
submodel. Let 𝑆 be the diagram of 𝑀 and observe that 𝑆 is a balanced theory and its
corresponding balanced virtual condition is below 𝑝. □
Example 8.7.11. Let 𝑇 be the theory of dense linear orders without endpoints.
The notion of algebraicity is trivial in the theory 𝑇, and 𝑇 has elimination of quantifiers.
It follows that the balanced theories are exactly the linear orders on the set of virtual
𝐸-classes. This should be compared to Example 8.7.5.
8.8. NON-DC VARIATIONS 169
8.8. Non-DC variations

All of the partial orders exhibited so far are either 𝜎-closed or ℵ0 -distributive, and
therefore their corresponding extensions of the symmetric Solovay model satisfy DC,
the Axiom of Dependent Choices. This is normaly viewed as highly desirable, as DC
is a key tool for developing mathematical analysis and descriptive set theory as we
know them today. However, balanced forcing can be used to generate extensions of
the symmetric Solovay model in which DC fails. We include one striking example.
Definition 8.8.1. Let 𝑋 be an uncountable Polish space. The finite-countable forc-
ing 𝑃 associated with 𝑋 consists of pairs 𝑝 = ⟨𝑎𝑝 , 𝑏𝑝 ⟩ where 𝑎𝑝 ⊂ 𝑋 is a finite set, 𝑏𝑝 ⊂ 𝑋
is a countable set, and 𝑎𝑝 ∩ 𝑏𝑝 = 0. The ordering is that of coordinatewise reverse in-
clusion.
The finite-countable forcing is rather worthless in the ZFC context. The lack of control
over the finite part means that it collapses ℵ1 . Namely, for every sequence ⟨𝑥𝛼 ∶ 𝛼 ∈ 𝜔1 ⟩
of distinct points of 𝑋, the set {𝛼 ∈ 𝜔1 ∶ ⟨{𝑥𝛼 }, 0⟩ belongs to the generic filter on 𝑃} is
forced to be cofinal in 𝜔1 of ordertype 𝜔. However, the finite-countable poset provides
a particularly easy answer to an old question of Woodin: is there a Suslin forcing which
is not c.c.c. and has no perfect antichain? The finite-countable poset is not c.c.c. as it
collapses ℵ1 . On the other hand, it does satisfy ℵ2 -c.c. in ZFC, so by a straightforward
absoluteness argument cannot contain a perfect antichain. This should be contrasted
with the convoluted answer to Woodin’s question given in [52].
In the ZF+DC context, the finite-countable poset is much better behaved, as is
clear from the following theorem. The generic filter will add a partition of the space 𝑋
into two sets, one of which does not contain an infinite countable subset and the other
contains no perfect subset. Such a partition clearly violates DC.
In order to classify the balanced virtual conditions in the finite-countable poset, we
need a piece of notation. Whenever 𝑎 ⊂ 𝑋 is a finite set, let 𝜏𝑎 be the Coll(𝜔, 𝑋)-name
for a condition in the poset 𝑃 which is the pair ⟨𝑎, (𝑋 ∩ 𝑉) ⧵ 𝑎⟩.
Theorem 8.8.2. Let 𝑋 be a Polish space and 𝑃 the associated finite-countable forc-
ing.
(1) For every finite set 𝑎 ⊂ 𝑋, the pair ⟨Coll(𝜔, 𝑋), 𝜏𝑎 ⟩ is balanced in 𝑃;
(2) for every balanced pair ⟨𝑄, 𝜏⟩ there is a finite set 𝑎 ⊂ 𝑋 such that the balanced
pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝑋), 𝜏𝑎 ⟩ are equivalent;
(3) distinct finite sets yield inequivalent balanced pairs.
Proof. For (1), suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions of the
ground model 𝑉 and 𝑝0 = ⟨𝑎0 , 𝑏0 ⟩ ∈ 𝑉[𝐻0 ] and 𝑝1 = ⟨𝑎1 , 𝑏1 ⟩ ∈ 𝑉[𝐻1 ] are conditions
stronger than 𝑝 = ⟨𝑎, 𝑋 ∩𝑉 ⧵𝑎⟩. We have to show that 𝑝0 , 𝑝1 are compatible, which is to
say that 𝑎0 ∩ 𝑏1 = 𝑎1 ∩ 𝑏0 = 0 holds. Suppose towards a contradiction that for example
𝑥 ∈ 𝑎0 ∩ 𝑏1 is a point. By the product forcing theorem, 𝑥 ∈ 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉. If
𝑥 ∈ 𝑎 then 𝑥 ∈ 𝑏1 is impossible as 𝑝1 ≤ 𝑝, and if 𝑥 ∉ 𝑎 then 𝑥 ∈ 𝑎0 is impossible as
𝑝0 ≤ 𝑝. A contradiction!
For (2), let 𝜏 = ⟨𝑎,̇ 𝑏⟩̇ where 𝑎,̇ 𝑏 ̇ are 𝑄-names for disjoint subsets of 𝑋. A balance
argument (Proposition 5.2.4) show that for each point 𝑥 ∈ 𝑋, either 𝑄 ⊩ 𝑥̌ ∈ 𝑎̇ or 𝑄 ⊩
𝑥̌ ∈ 𝑏.̇ Let 𝑎 ⊂ 𝑋 be the set of all points 𝑥 ∈ 𝑋 for which the first alternative prevails. It
is immediate that 𝑎 is a finite set and 𝑄 × Coll(𝜔, 𝑋) ⊩ 𝜏 ≤ 𝜏𝑎 . Proposition 5.2.6 shows

then that the balanced pairs ⟨𝑄, 𝜏⟩ and ⟨Coll(𝜔, 𝑋), 𝜏𝑎 ⟩ are equivalent, proving (2). (3)
is immediate and so is the balance of the forcing 𝑃. □
8.9. Side condition forcings

Attempts to force uncountable subsets of Polish spaces with a lack of internal struc-
ture often converge to a kind of a side condition poset. Posets of this kind are not cov-
ered by the previous sections. In this section, we outline several examples.
Definition 8.9.1. Let 𝑋 be a Polish space. Let 𝐹(𝑋) denote the Effros Borel space
of all closed subsets of 𝑋 [58, Section 12.C]. Let 𝐼 ⊂ 𝐹(𝑋) be a Borel set such that
⋃ 𝐼 = 𝑋 and 𝐼 is not a countable union of elements of 𝐼. The poset 𝑃𝐼 consists of pairs
𝑝 = ⟨𝑎𝑝 , 𝑏𝑝 ⟩ where 𝑎𝑝 ⊂ 𝑋 and 𝑏𝑝 ⊂ 𝐼 are countable sets. The ordering on 𝑃𝐼 is defined
by 𝑞 ≤ 𝑝 if 𝑎𝑝 ⊂ 𝑎𝑞 , 𝑏𝑝 ⊂ 𝑏𝑞 , and (⋃ 𝑏𝑝 ) ∩ 𝑎𝑞 ⧵ 𝑎𝑝 = 0.
It is immediate that 𝑃𝐼 is a 𝜎-closed Suslin forcing. It is designed to add an uncountable
set which has countable intersection with every element of 𝐼. For the classification of
balanced virtual conditions, whenever 𝑎 ⊂ 𝑋 is a set, write 𝜏𝑎 for the Coll(𝜔, 𝑋)-name
for the pair ⟨𝑎,̌ 𝑏⟩̇ where 𝑏 ̇ is the name for the set of all ground model coded sets in 𝐼.
Theorem 8.9.2. Let 𝑋 be a Polish space and let 𝐼 ⊂ 𝐹(𝑋) be a Borel set such that
⋃ 𝐼 = 𝑋. Then
(1) for every set 𝑎 ⊂ 𝑋, the pair ⟨Coll(𝜔, 𝑋), 𝜏𝑎 ⟩ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜎⟩ there is a set 𝑎 ⊂ 𝑋 such that the pairs ⟨𝑄, 𝜎⟩ and
⟨Coll(𝜔, 𝑋), 𝜏𝑎 ⟩ are equivalent;
(3) distinct subsets of 𝑋 yield nonequivalent balanced pairs.
In particular, the poset 𝑃𝐼 is balanced.
Proof. Towards (1), unraveling the definitions, it is sufficient show the following.
Suppose that 𝑅0 , 𝑅1 are posets and 𝜎0 , 𝜎1 are respective names for countable subsets of
𝑋 such that 𝑅0 ⊩ 𝜎0 ∩ ⋃(𝐼 ∩ 𝑉) = 0 and 𝑅1 ⊩ 𝜎1 ∩ ⋃(𝐼 ∩ 𝑉) = 0; then 𝑅0 × 𝑅1 ⊩
𝜎0 ∩ ⋃(𝐼 ∩ 𝑉[𝐺1̇ ]) = 0 and 𝜎1 ∩ ⋃(𝐼 ∩ 𝑉[𝐺0̇ ]) = 0 where 𝐺0̇ , 𝐺1̇ are the respective
product names for the generic filters on the 0th and 1st coordinate.
This, however, is immediate. We will show that 𝑅0 ×𝑅1 ⊩ 𝜎0 ∩⋃(𝐼∩𝑉[𝐺1̇ ]) = 0; the
proof of the other assertion is symmetric. Suppose towards a contradiction that 𝜂 is an
𝑅0 -name for an element of 𝜎0 , 𝜒 is an 𝑅1 -name for an element of 𝐼, and ⟨𝑟0 , 𝑟1 ⟩ ∈ 𝑅0 ×𝑅1
is a condition forcing that 𝜂 ∈ 𝜒 holds. Let 𝑀 be a countable elementary submodel of
a large structure containing all objects named so far, let 𝑔1 ⊂ 𝑅1 ∩ 𝑀 be a filter generic
over 𝑀 containing the condition 𝑟1 , and let 𝐹 = 𝜒/𝑔1 . Since 𝐹 is a closed set in 𝐼 ∩ 𝑉,
there must be a basic open set 𝑂 ⊂ 𝑋 and a condition 𝑟0′ ≤ 𝑟0 such that 𝑂 ∩ 𝐹 = 0
and 𝑟0′ ⊩𝑅0 𝜂 ∈ 𝑂.̇ By the genericity of the filter 𝑔1 and the forcing theorem applied in
the model 𝑀, there must be a condition 𝑟1′ ≤ 𝑟1 such that 𝑟1′ ⊩𝑅1 𝑂 ∩ 𝜒 = 0. Clearly,
⟨𝑟0′ , 𝑟1′ ⟩ ⊩ 𝜂 ∉ 𝜒, contradicting the initial choice of ⟨𝑟0 , 𝑟1 ⟩.
Towards (2), let ⟨𝑄, 𝜎⟩ be a balanced pair; enlarging the poset 𝑄 if necessary we may
assume that 𝑄 collapses the size of the ground model continuum to ℵ0 ; strengthening
the condition 𝜎 we may assume that 𝑏𝜍 is forced to contain all ground model coded
elements of 𝐼. By a balance argument (Proposition 5.2.4), for every point 𝑥 ∈ 𝑋 it is the
case that either 𝑄 ⊩ 𝑥̌ ∈ 𝑎𝜍 or 𝑄 ⊩ 𝑥̌ ∉ 𝑎𝜍 . Let 𝑎 ⊂ 𝑋 be the set of all those elements of
8.9. SIDE CONDITION FORCINGS 171
𝑋 for which the former alternative prevails. We will show that 𝑄 ×Coll(𝜔, 𝑋) ⊩ 𝜎 ≤ 𝜏𝑎 ,
which implies the equivalence of 𝜎 and 𝜏𝑎 by Proposition 5.2.6.
To prove the inequality 𝜎 ≤ 𝜏𝑎 , it is enough to show that 𝑄 ⊩ (𝑎𝜍 ⧵𝑉)∩(⋃(𝐼∩𝑉)) =
0. Suppose towards a contradiction that this fails, and let 𝑞 ∈ 𝑄 be a condition, 𝜂 be a
𝑄-name for an element of 𝑎𝜍 ⧵ 𝑉 and 𝐹 ∈ 𝐼 ∩ 𝑉 be a closed set such that 𝑞 ⊩ 𝜂 ∈ 𝐹.̇
Let 𝐺0 , 𝐺1 ⊂ 𝑄 be mutually generic filters containing the condition 𝑞. By a mutual
genericity argument, the point 𝜂/𝐺0 does not belong to 𝑎𝜍/𝐺1 , while it does belong to 𝐹
and 𝐹 ∈ 𝑏𝜍/𝐺1 . This means the conditions 𝜎/𝐺0 , 𝜎/𝐺1 are incompatible in 𝑃, violating
the balance assumption on ⟨𝑄, 𝜎⟩.
Finally, (3) is immediate from the assumption that 𝑋 = ⋃ 𝐼. The balance of the
forcing 𝑃𝐼 is now immediate from (1). □
Example 8.9.3. Let 𝑋 = 2𝜔 , let Γ be the graph connecting points 𝑥, 𝑦 ∈ 𝑋 if the
least number such that 𝑥(𝑛) ≠ 𝑦(𝑛) is even. Let 𝐼 be the collection of closed Γ-cliques
and closed Γ-anticliques. The poset 𝑃𝐼 adds a generic uncountable set on which every
Γ-clique or anticlique is countable. This exhibits a balanced extension in which OCA
fails, cf. Example 12.2.20.
Example 8.9.4. Let 𝑋 = 𝜔𝜔 and let 𝐼 be the collection {𝑥 ≤ 𝑦 ∶ 𝑥 ∈ 𝑋} for all
functions 𝑦 ∈ 𝜔𝜔 , where ≤ is the everywhere domination ordering on 𝜔𝜔 . The poset
𝑃𝐼 adds a dominating subset of 𝜔𝜔 which has only countably many elements below any
given function 𝑦 ∈ 𝜔𝜔 . In a rather different language, Shelah [94] showed that in the
𝑃𝐼 -extension of the Solovay model every set is Lebesgue measurable and there is a set
without the Baire property. We address this extension in Section 14.3.
In the case when 𝐼 is the collection of closed nowhere dense subsets of 𝑋, there is a more
sophisticated variation of the poset 𝑃𝐼 . For a natural number 𝑛 ∈ 𝜔, a set 𝑠 ⊂ (2𝜔 )𝑛 ,
and a partial function ℎ ∶ 𝑛 → 2𝜔 write 𝑠ℎ = {𝑔 ∈ (2𝜔 )𝑛⧵dom(ℎ) ∶ ℎ ∪ 𝑔 ∈ 𝑠}.
Definition 8.9.5. The Lusin poset 𝑃 is the partial order of all pairs 𝑝 = ⟨𝑎𝑝 , 𝑏𝑝 ⟩
where 𝑎𝑝 ⊂ 2𝜔 is a countable 𝔼0 -invariant set and 𝑏𝑝 is a countable set of pairs ⟨𝑠, 𝑎⟩
where 𝑠 ⊂ (2𝜔 )𝑛 is a closed nowhere dense subset of (2𝜔 )𝑛 for some 𝑛 ∈ 𝜔, 𝑎 ⊂ 𝑎𝑝 is an
𝔼0 -invariant set, and for each partial function ℎ ∶ 𝑛 → 𝑎𝑝 ⧵ 𝑎 whose range consists of
pairwise non-𝔼0 -related elements, if dom(ℎ) = 𝑛 then ℎ ∉ 𝑠, and if dom(ℎ) ≠ 𝑛 then
the set 𝑠ℎ is nowhere dense in the space (2𝜔 )𝑛⧵dom(ℎ) . The order is that of coordinate-
wise reverse inclusion.
It is not difficult to check that 𝑃 is a 𝜎-closed Suslin forcing. The poset 𝑃 is designed
a generic subset of 2𝜔 which is the union of the first coordinates of all consitions in
the generic filter. The generic set is forced to be an 𝔼0 -invariant Lusin subset of 2𝜔 –
an uncountable set which intersects every nowhere dense set in a countable set. The
generic set has a similar property in all finite powers though, and in Example 12.2.21 it
serves an even more refined purpose. The balance of 𝑃 is an immediate consequence
of the following classification theorem. For any 𝔼0 -invariant set 𝑎 ⊂ 2𝜔 , let 𝜏𝑎 be the
Coll(𝜔, 2𝜔 )-name for the condition ⟨𝑎,̌ 𝑏⟩ ∈ 𝑃 where 𝑏 is the set of all pairs ⟨𝑠, 𝑎⟩ where
𝑠 is a ground model coded closed nowhere dense subset of (2𝜔 )𝑛 in the ground model
for some 𝑛 ∈ 𝜔.
Theorem 8.9.6. Let 𝑃 be the Lusin poset.
(1) For every 𝔼0 -invariant set 𝑎 ⊂ 𝑋, the pair ⟨Coll(𝜔, 𝑋), 𝜏𝑎 ⟩ is balanced;
(2) for every balanced pair ⟨𝑄, 𝜎⟩ there is a set 𝑎 ⊂ 𝑋 such that the pairs ⟨𝑄, 𝜎⟩ and
⟨Coll(𝜔, 𝑋), 𝜏𝑎 ⟩ are equivalent;
(3) distinct subsets of 𝑋 yield nonequivalent balanced pairs.
Proof. Write 𝑆 = Coll(𝜔, 2𝜔 ). For (1), let 𝑅0 , 𝑅1 be posets and 𝜎0 , 𝜎1 be 𝑅0 × 𝑆

and 𝑅1 × 𝑆-names respectively such that 𝑅0 × 𝑆 ⊩ 𝜎0 ≤ 𝜏𝑎 and 𝑅1 × 𝑆 ⊩ 𝜎1 ≤ 𝜏𝑎 .
Let 𝐺0 ⊂ 𝑅0 × 𝑆 and 𝐺1 ⊂ 𝑅1 × 𝑆 be mutually generic filters; we must show that the
conditions 𝑝0 = 𝜎0 /𝐺0 , 𝑝1 = 𝜎1 /𝐺1 ∈ 𝑃 are compatible.
To this end, write 𝑝0 = ⟨𝑎0 , 𝑏0 ⟩ and 𝑝1 = ⟨𝑎1 , 𝑏1 ⟩. Let 𝑛 ∈ 𝜔, let 𝑠 ∈ (2𝜔 )𝑛 be a
nowhere dense set, let ⟨𝑎, 𝑠⟩ ∈ 𝑏0 ∪ 𝑏1 be a pair, and let ℎ ∶ 𝑛 → 𝑎0 ∪ 𝑎1 be a partial
function whose range consists of pairwise non-𝔼0 -related elements of (𝑎0 ∪ 𝑎1 ) ⧵ 𝑎. We
must show that either (if dom(ℎ) = 𝑛) ℎ ∉ 𝑠, or (if dom(ℎ) ≠ 𝑛) the set 𝑠ℎ is nowhere
dense.
For definiteness assume that ⟨𝑎, 𝑠⟩ ∈ 𝑏0 . Let ℎ0 = ℎ ∩ 𝑉[𝐺0 ] and ℎ1 = ℎ ⧵ ℎ0 . Since
𝑝0 ∈ 𝑃 holds, the set 𝑠ℎ0 is nowhere dense. By the Kuratowski–Ulam theorem, the set
𝑡 = {𝑘 ∈ (2𝜔 )dom(ℎ1 ) ∶ 𝑠ℎ0 ∪𝑘 is somewhere dense} is meager and in the model 𝑉[𝐺0 ].
Now, the function ℎ1 is product-Cohen generic over 𝑉 by the definition of the name
𝜏𝑎 . By a mutual genericity argument, ℎ1 is also product-Cohen generic over 𝑉[𝐺0 ] and
therefore does not belong to the set 𝑡. Thus the set 𝑠ℎ0 ∪ℎ1 is nowhere dense as required.
For (2), suppose that ⟨𝑄, 𝜎⟩ is a balanced pair. Strengthening the poset 𝑄 or the
condition 𝜎 repeatedly, we may assume that 𝑄 ⊩ 2𝜔 ∩ 𝑉 is countable, and
• for each 𝑥 ∈ 2𝜔 in 𝑉 either 𝑥 ∈ 𝑎𝜍 or for no extension 𝑝 ≤ 𝜎 it is the case

that 𝑥 ∈ 𝑎𝑝 ;
• for each 𝑛 ∈ 𝜔 and each closed nowhere dense set 𝑠 ⊂ (2𝜔 )𝑛 in the ground
model, either ⟨(𝑎𝜍 ∩ 𝑉), 𝑠⟩ ∈ 𝑏𝜍 or for no extension 𝑝 ≤ 𝜎 it is the case that
⟨(𝑎𝜍 ∩ 𝑉), 𝑠⟩ ∈ 𝑏𝑝 ;
• for each 𝑛 ∈ 𝜔 and each closed nowhere dense set 𝑠 ⊂ (2𝜔 )𝑛 in the ground
model there is 𝑎 such that ⟨𝑎, 𝑠⟩ ∈ 𝑏𝜍 .
By a balance argument (Proposition 5.2.4), for each 𝑥 ∈ 2𝜔 in the ground model, either
𝑄 forces the first clause of the first item to prevail for 𝑥,̌ or 𝑄 forces the second clause
of the first item to prevail for 𝑥.̌ Let 𝑎 ⊂ 2𝜔 be the set of all points for which the first
option prevails; we will show that 𝑄 × 𝑆 ⊩ 𝜎 ≤ 𝜏𝑎 , showing that the balanced pairs
⟨𝑄, 𝜎⟩ and ⟨Coll(𝜔, 2𝜔 ), 𝜏𝑎 ⟩ are equivalent by Proposition 5.2.6. To see the inequality, it
is only necessary to show that the second clause of the second item above is impossible
for any closed nowhere dense set 𝑠 ⊂ (2𝜔 )𝑛 in the ground model. Suppose towards a
contradiction that the second clause occurs. This can only happen if there is a 𝑄-name
ℎ ̇ such that 𝑄 forces ℎ ̇ ∶ 𝑛 → 2𝜔 to be a partial map such that rng(ℎ) consists of pairwise
non-𝔼0 -equivalent, non-ground model elements of 𝑎𝜍 such that either (if dom(ℎ) = 𝑛)
ℎ ∈ 𝑠 or (if dom(ℎ) ≠ 𝑛) the set 𝑠ℎ contains a nonempty open set. In either case, let
𝐺0 , 𝐺1 ⊂ 𝑄 be mutually generic filters, and use the third item to find a set 𝑎 ∈ 𝑉[𝐺0 ]
such that ⟨𝑎, 𝑠⟩ ∈ 𝑏𝜍/𝐺0 . Then by mutual genericity the set rng(ℎ/𝐺 ̇ 1 ) consists of points
which are not in 𝑎. This means that the conditions 𝜎/𝐺0 , 𝜎/𝐺1 are incompatible in 𝑃,
contradicting the balance assumption on the pair ⟨𝑄, 𝜎⟩.
8.10. WEAKLY BALANCED VARIATIONS 173
(3) is immediate. For the last sentence, if 𝑝 ∈ 𝑃 is a condition, it is not difficult to

see that 𝑆 forces 𝑝 ̌ to be compatible with 𝜏𝑎𝑝 . The name for a lower bound is a balanced
virtual condition below 𝑝. □
8.10. Weakly balanced variations

There are a number of restrictions on balanced extensions of the Solovay model–
Corollaries 9.1.2, 9.1.5 or Theorems 14.1.1 or 14.2.1 are good examples. Transcending
these restrictions requires reaching for a weakly balanced forcing. The weakly bal-
anced arguments are invariably more complicated than the balanced ones, and we
never obtain a classification of weakly balanced classes. We include two examples
reminiscent of the side condition forcings of Section 8.9. The first poset adds an in-
jection from the 𝐸-quotient space to the 𝔼0 -quotient space, where 𝐸 is any given Borel
equivalence relation on a Polish space. For a pinned equivalence relation 𝐸 this is
possible to do with a balanced forcing, see Theorem 6.4.2; in the general case, this is
impossible to do with balanced forcing. For example, the inequality |𝔽2 | ≤ |𝔼0 | implies
in ZF that there is an 𝜔1 -sequence of 𝔼0 -classes by Proposition 9.1.4, and in balanced
forcing extensions of the symmetric Solovay model such sequences do not occur by
Corollary 9.1.3.
Definition 8.10.1. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. The
Lusin collapse forcing 𝑃𝐸 is the poset of all triples 𝑝 = ⟨𝑎𝑝 , 𝑏𝑝 , 𝑓𝑝 ⟩ where ⟨𝑎𝑝 , 𝑏𝑝 ⟩ is a
condition in the Lusin forcing of Definition 8.9.5, and 𝑓𝑝 is an injection from the 𝐸-
space to the set of 𝔼0 -classes represented in 𝑎𝑝 . The order is that of coordinatewise
reverse inclusion.
It is not difficult to see that 𝑃 is a 𝜎-closed Suslin forcing and if 𝐺 ⊂ 𝑃 is a generic fil-
ter then 𝑓 = ⋃𝑝∈𝐺 𝑓𝑝 is a total injection from the 𝐸-quotient space to the 𝔼0 -quotient
space. It is instructive to view the poset 𝑃𝐸 as a natural two-step iteration. The first step
is the (balanced) Lusin poset of Definition 8.9.5 adding a subset 𝐴 of the 𝔼0 -quotient
space. In the second step, an injection of the 𝐸-quotient space into 𝐴 is added by
straightforward countable approximations. The projection from 𝑃𝐸 into the Lusin poset
is given by the projection of conditions in 𝑝 into the first two coordinates.
Theorem 8.10.2. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. The
Lusin collapse forcing of |𝐸| to |𝔼0 | is weakly balanced.
Proof. Write 𝑃 = 𝑃𝐸 . Let 𝑝 ∈ 𝑃 be a condition; we must find a virtual weakly
balanced virtual condition 𝑝 ̄ ≤ 𝑝. Let 𝑝 ̄ = ⟨Coll(𝜔, 2𝜔 ), ⟨𝑎𝑝̌ , 𝑏,̌ 𝑓𝑝̌ ⟩⟩ where 𝑏 is the set
of all pairs ⟨𝑎𝑝 , 𝑠⟩ where 𝑠 ⊂ (2𝜔 )𝑛 is a closed nowhere dense set coded in the ground
model for some 𝑛 ∈ 𝜔. It is immediate that 𝑝 ̄ is a virtual condition; it will be enough
to show that 𝑝 ̄ is weakly balanced.
Before we proceed, we must fix some notation and terminology. Let 𝑉[𝐺] be a
generic extension of 𝑉, and in 𝑉[𝐺] let 𝑓 be a function from the virtual 𝐸-quotient
space to the quotient 𝔼0 -space. If 𝑀 is an intermediate model of ZF between 𝑉 and
𝑉[𝐺], write 𝑓|𝑀 for the following set. Let ≫ be the smallest ordinal such that in 𝑀,
every 𝐸-pin is equivalent to an 𝐸-pin of set-theoretic rank smaller than ≫; such an
ordinal exists since by Theorem 2.5.6 there are only set many virtual 𝐸-classes in 𝑉[𝐺].
Let 𝑓|𝑀 be the set of all pairs ⟨⟨𝑄, 𝜏⟩, 𝑦⟩ such that ⟨𝑄, 𝜏⟩ ∈ 𝑀 is an 𝐸-pin of rank smaller
than ≫, 𝑦 ∈ 2𝜔 , and for some virtual 𝐸-class 𝑐 ∈ dom(𝑓), 𝑦 ∈ 𝑓(𝑐) and ⟨𝑄, 𝜏⟩ ∈ 𝑐.
The transfinite analysis of 𝑓 is the sequence of models 𝑀𝛼 of ZF given by the recursive
formula 𝑀𝛼 = 𝑉(⟨𝑓|𝑀𝛽 ∶ 𝛽 ∈ 𝛼⟩); note that always 𝑀0 = 𝑉 and the models 𝑀𝛼 form
an inclusion-increasing sequence. The function 𝑓 has a heart if there is an ordinal 𝛼
such that
• for every ordinal 𝛽 ∈ 𝛼 and every 𝐸-pin ⟨𝑄, 𝜏⟩ ∈ 𝑀𝛽 there is a class 𝑐 ∈
dom(𝑓) with ⟨𝑄, 𝜏⟩ ∈ 𝑐;
• for every virtual 𝐸-class 𝑐 ∈ dom(𝑓), if 𝑐 ∩ 𝑀𝛼 ≠ 0 then 𝑐 ∩ ⋃𝛽∈𝛼 𝑀𝛽 ≠ 0.
Note that once such an ordinal 𝛼 is reached then 𝑀𝛿 = 𝑀𝛼 for all ordinals 𝛿 ≥ 𝛼. If
the function 𝑓 has a heart, then the least ordinal 𝛼 as above is its depth; as a matter of
convention, we end the transfinite analysis at this ordinal. The heart of 𝑓 is the pair
⟨𝑀, ℎ⟩ where 𝑀 = 𝑀𝛼 and ℎ = 𝑓|𝑀.
We apply the above transfinite analysis also to conditions in 𝑃. Any 𝐸-class 𝑐 will
be identified with the virtual 𝐸-class of all 𝐸-pins ⟨𝑄, 𝜏⟩ such that for some (all) 𝑥 ∈ 𝑐,
𝑄 ⊩ 𝜏 𝐸 𝑥;̌ thus, a partial function on the 𝐸-quotient space is viewed as a partial
function on the virtual 𝐸-quotient space. The heart of a condition in 𝑃 is the heart
of its last coordinate. The following two key claims control the behavior of hearts of
conditions below 𝑝.̄
Claim 8.10.3. Every condition 𝑞 ∈ 𝑃 can be strengthened in some generic extension

to a condition 𝑟 ≤ 𝑞 which has a heart.
Proof. Let 𝑉[𝐺] be a generic extension of 𝑉, and let 𝑞 ∈ 𝑉[𝐺] be a condition in

𝑃. Work in 𝑉[𝐺]. By transfinite recursion on 𝛽 ≤ 𝜔1 define a finite support iteration
⟨𝑅𝛽 ∶ 𝛽 ≤ 𝜔1 , 𝑄𝛽̇ ∶ 𝛽 < 𝜔1 ⟩ of c.c.c. forcings and 𝑅𝛽 -names 𝜏𝛽 so that 𝑅𝛽 forces the
following:
• 𝜏0 = 0, ≫∈ 𝛽 implies 𝜏≫ ⊂ 𝜏𝛽 , and if 𝛽 is limit then 𝜏𝛽 = ⋃≫∈𝛽 𝜏≫ ;
• 𝜏𝛽 is a partial function from the virtual 𝐸-quotient space to the 𝔼0 -quotient
space which has a heart ⟨𝑀𝛽 , 𝜏𝛽 |𝑀𝛽 ⟩ of depth 𝛽 and dom(𝜏𝛽 ) contains exactly
those virtual 𝐸-classes represented in dom(𝜏𝛽 |𝑀𝛽 );
• 𝑄𝛽̇ is the finite support product of copies of Cohen forcing on 2𝜔 indexed
by all the virtual 𝐸-classes in 𝑀𝛽 which are not represented in ⋃ 𝑀̇ ≫
≫∈𝛽
and do not belong to dom(𝑓𝑞 ), and 𝜏𝛽+1 is the function 𝜏𝛽 together with the
function sending each virtual 𝐸-class in 𝑀𝛽 as above to the 𝔼0 -class of the
corresponding Cohen real, and sending every virtual 𝐸-class in 𝑀𝛽 which is
in dom(𝑓𝑞 ) to the 𝔼0 -class indicated by 𝑓𝑞 .
Write 𝑅 = 𝑅𝜔1 . Let 𝐻 ⊂ 𝑅 be a filter generic over 𝑉[𝐺]; thus, the models 𝑉[𝐺] and
𝑉[𝐺][𝐻] have the same 𝜔1 . In 𝑉[𝐺][𝐻], write 𝑓𝛽 = 𝜏𝛽 /𝐻 for all 𝛽 ≤ 𝜔1 and 𝑓 = 𝑓𝜔1 .
Consider the transfinite analysis ⟨𝑀𝛽 ∶ 𝛽 ∈ 𝜔1 ⟩ of 𝑓, starting with 𝑀0 = 𝑉. Since
the function 𝑓𝑞 is countable, a counting argument shows that there has to be an ordi-
nal 𝛽 ∈ 𝜔1 such that every virtual 𝐸-class represented in 𝑀𝛽+1 and in dom(𝑓𝑞 ) is al-
ready represented in 𝑀𝛽 . Thus, the transfinite analysis of the function 𝑓𝑞 ∪ 𝑓𝛽 equals to
⟨𝑀≫ ∶ ≫≤ 𝛽⟩ and ⟨𝑀𝛽 , 𝑓𝛽 |𝑀𝛽 ⟩ is its heart. Consider the triple ⟨𝑎𝑞 ∪rng(𝑓𝛽 ), 𝑏𝑞 , 𝑓𝑞 ∪𝑓𝛽 ⟩.
It is not difficult to see that it induces a virtual condition in 𝑃 stronger than 𝑞. In a suit-
able generic extension, it turns into a condition 𝑟 ≤ 𝑞 with heart ⟨𝑀𝛽 , 𝑓𝛽 |𝑀𝛽 ⟩. □
Claim 8.10.4. Let 𝑟 ≤ 𝑝 ̄ be a condition in 𝑃 in some generic extension such that the
heart of 𝑟 is ⟨𝑀, ℎ⟩. Then
(1) the theory of the model 𝑀 with parameters in 𝑉 and the parameter ℎ depends
only on the depth of 𝑟;
(2) every real in 𝑀 belongs to some 𝑉[𝑏] where 𝑏 is a finite subset of ⋃ rng(ℎ).
Proof. Fix an ordinal 𝛼. It turns out that the hearts of conditions ≤ 𝑝 ̄ of depth 𝛼
are all generated in the same way. Work in 𝑉. By transfinite recursion on 𝛽 ≤ 𝛼 define
a finite support iteration ⟨𝑅𝛽 ∶ 𝛽 ≤ 𝛼, 𝑄𝛽̇ ∶ 𝛽 < 𝛼⟩ of c.c.c. forcings and 𝑅𝛽 -names 𝜏𝛽 so
that 𝑅𝛽 forces the following:
• 𝜏0 = 0, ≫∈ 𝛽 implies 𝜏≫ ⊂ 𝜏𝛽 , and if 𝛽 is limit then 𝜏𝛽 = ⋃≫∈𝛽 𝜏≫ ;
• 𝜏𝛽 is a partial function from the virtual 𝐸-quotient space to the 𝔼0 -quotient
space which has a heart ⟨𝑀𝛽 , 𝜏𝛽 |𝑀𝛽 ⟩ of depth 𝛽 and dom(𝜏𝛽 ) contains exactly
those virtual 𝐸-classes represented in dom(𝜏𝛽 |𝑀𝛽 );
• if 𝛽 = 0 then 𝑄0 is the finite support product of copies of Cohen forcing on
2𝜔 indexed by all the virtual 𝐸-classes in 𝑀0 = 𝑉 which do not belong to
dom(𝑓𝑝 ), and 𝜏1 is the function 𝑓𝑝 together with the function sending each
virtual 𝐸-class in 𝑉 as above to the 𝔼0 -class of the corresponding Cohen real;
• if 𝛽 > 0 then 𝑄𝛽̇ is the finite support product of copies of Cohen forcing
on 2𝜔 indexed by all the virtual 𝐸-classes in 𝑀𝛽 which are not represented
in ⋃≫∈𝛽 𝑀̇ ≫ , and 𝜏𝛽+1 is the function 𝜏𝛽 together with the function sending
each virtual 𝐸-class in 𝑀𝛽 as above to the 𝔼0 -class of the corresponding Cohen
real.
The 𝑅𝛼 -generic function is the function assigning to every virtual 𝐸-class represented
in ⋃𝛽∈𝛼 𝑀𝛽 the Cohen real assigned to it by one of the iterands. Now suppose that
𝑟 ≤ 𝑝 ̄ is a condition in 𝑃 in some generic extension 𝑉[𝐺] with heart ⟨𝑀, ℎ⟩ of depth 𝛼.
Note that dom(ℎ) is some collection of virtual 𝐸-classes and rng(ℎ) is some collection
of 𝔼0 -classes. Let 𝑆 be the poset which with finite approximations adds a function 𝑔̇
such that dom(𝑔)̇ = dom(ℎ) and for every virtual 𝐸-class 𝑐 ∈ dom(ℎ), 𝑔(𝑐) ̇ ∈ ℎ(𝑐). It
turns out that 𝑆 forces 𝑔̇ to be an 𝑅𝛼 -generic function over 𝑉 and the intersection 𝑉[𝑔]∩
̇
𝑉[𝐺] contains only those reals which belong to some 𝑉[𝑏] where 𝑏 is a finite subset of
⋃ rng(ℎ). This statement is proved by a routine, if verbose, transfinite induction on 𝛼
and we leave it to the patient reader.
Finally, for (1) argue that for every formula 𝜙, 𝑀 ⊧ 𝜙 if and only if 𝑉 ⊧ 𝑅𝛼 ⊩ 𝑀𝛼 ⊧
𝜙; the latter statement depends on 𝛼 only. For (2), argue that 𝑀 ⊂ 𝑉[𝐺] ∩ 𝑉[𝑔]. ̇ This
concludes the proof of the claim. □
The following claim just restates the information from the previous claim in a form
that will be useful later.
Claim 8.10.5. Let 𝑟 ≤ 𝑝 ̄ be a condition in 𝑃 in some generic extension with heart

⟨𝑀, ℎ⟩. Then
(1) every 𝐸-class in dom(𝑓𝑟 ) is either a realization of a virtual 𝐸-class in dom(ℎ) or
it is not a realization of any virtual 𝐸-class in 𝑀;
(2) every finite tuple 𝑐 of pairwise 𝔼0 -unrelated elements of 𝑎𝑟 ⧵ ⋃ rng(ℎ) is product
Cohen-generic over 𝑀.
Proof. The first item is an immediate consequence of the definition of the heart.
For the second item, we use the fact that 𝑟 ≤ 𝑝.̄ Let 𝑛 = |𝑐|. Every closed nowhere
dense subset 𝑠 ⊂ (2𝜔 )𝑛 in the model 𝑀 belongs to some model 𝑉[𝑑] where 𝑑 is a finite
tuple of pairwise 𝔼0 -unrelated elements of ⋃ rng(ℎ) ⧵ ⋃ rng(𝑓𝑝 )) by Claim 8.10.4(2).
By the choice of the virtual condition 𝑝,̄ the tuple 𝑐∪𝑑 is product Cohen-generic over 𝑉,
and by the product forcing theorem 𝑐 ∉ 𝑠. We have just shown that 𝑐 does not belong to
any closed nowhere dense subset of (2𝜔 )𝑛 in the model 𝑀; that is, 𝑐 is product Cohen-
generic over 𝑀. □
Finally, we are ready to conclude the proof of Theorem 8.10.2. Let 𝑄0 , 𝑄1 be posets in
𝑉, with names 𝜎0 , 𝜎1 for conditions in 𝑃 stronger than 𝑝.̄ We must find, in some generic
extension, filters 𝐺0 ⊂ 𝑄0 and 𝐺1 ⊂ 𝑄1 separately generic over the ground model such
that the conditions 𝜎0 , 𝜎1 are compatible in 𝑃. By Claim 8.10.3, we may assume that
𝑄0 ⊩ 𝜎0 has heart of depth 𝛼̌ 0 and 𝑄1 ⊩ 𝜎1 has heart of depth 𝛼̌ 1 . For definiteness,
assume that 𝛼0 ≤ 𝛼1 . Move to some forcing extension (such as the 𝑄1 -extension) where
there is a condition 𝑟 ≤ 𝑝 ̄ with a heart of depth 𝛼1 . Let 𝑀𝛽 be the models arising in the
transfinite analysis of 𝑟, and let 𝑁0 = 𝑀𝛼0 , ℎ0 = 𝑓𝑟 |𝑁0 and 𝑁1 = 𝑀𝛼1 , ℎ1 = 𝑓𝑟 |𝑁1 . Thus,
⟨𝑁1 , ℎ1 ⟩ is a heart of the condition 𝑟; note that ⟨𝑁0 , ℎ0 ⟩ is also a heart of a condition
≤ 𝑝,̄ namely the condition obtained from 𝑟 by restricting the function 𝑓𝑟 to the set of
𝐸-classes which are realizations of the virtual classes in dom(ℎ0 ).
Note that in the model 𝑁0 , there exists a poset 𝑆0 and a name 𝜂0 for a filter on 𝑄0
generic over 𝑉 such that 𝑆0 forces the heart of 𝜎0 /𝜂0 to be ⟨𝑁0 , ℎ0 ⟩. This occurs because
this statement is true in the heart of 𝜎0 and the theory of the hearts depends only on the
height by Claim 8.10.4(1). Similarly, in the model 𝑁1 there exists a poset 𝑆1 and a name
𝜂1 for a filter on 𝑄1 generic over 𝑉 such that 𝑆1 forces the heart of 𝜎1 /𝜂1 to be ⟨𝑁1 , ℎ1 ⟩.
Let 𝐻0 ⊂ 𝑆0 and 𝐻1 ⊂ 𝑆1 be filters mutually generic over the model 𝑁1 . Let 𝐺0 = 𝜂0 /𝐻0
and 𝐺1 = 𝜂1 /𝐻1 ; we claim that the conditions 𝜎0 /𝐺0 and 𝜎1 /𝐺1 are compatible in 𝑃 as
desired.
To see this, write 𝜎0 /𝐺0 = ⟨𝑎0 , 𝑏0 , 𝑓0 ⟩ and 𝜎1 /𝐺1 = ⟨𝑎1 , 𝑏1 , 𝑓1 ⟩. To show that these
two conditions are compatible, we must argue that ⟨𝑎0 , 𝑏0 ⟩ and ⟨𝑎1 , 𝑏1 ⟩ are compati-
ble as conditions in the Lusin forcing, and then show that 𝑓0 ∪ 𝑓1 is an injection from
𝔼-quotient space to the 𝔼0 -space. The compatibility in the Lusin forcing is nearly iden-
tical to the proof of Theorem 8.9.6(1) and we omit it. To show that 𝑓0 ∪ 𝑓1 is an injection
from the 𝐸-quotient space to the 𝔼0 -quotient space, suppose that 𝑐0 ∈ dom(𝑓0 ) and 𝑐1 ∈
dom(𝑓1 ) are 𝐸-classes and work to prove the equivalence 𝑓0 (𝑐0 ) = 𝑓1 (𝑐1 ) ↔ 𝑐0 = 𝑐1 . By
Claim 8.10.5(1) there are two cases:
• 𝑐0 is a realization of a virtual 𝐸-class 𝑑 ∈ dom(ℎ0 ). Then 𝑓0 (𝑐0 ) = ℎ0 (𝑑) =

ℎ1 (𝑑) and either 𝑐1 = 𝑐0 in which case 𝑓1 (𝑐1 ) = ℎ1 (𝑑) = 𝑓0 (𝑐0 ), or 𝑐1 ≠ 𝑐0 and
then 𝑓1 (𝑐1 ) ≠ ℎ1 (𝑑) since the function 𝑓1 is an injection.
• 𝑐0 is not a realization of a virtual 𝐸-class in 𝑁0 . By a mutual genericity argu-
ment then, 𝑐0 is not an 𝐸-class represented in the model 𝑁1 [𝐻1 ]; in particu-
lar 𝑐0 ≠ 𝑐1 . By Claim 8.10.5(2), the 𝔼0 -class 𝑓0 (𝑐0 ) consists of points Cohen
generic over 𝑁0 . By a mutual genericity argument it must be distinct from
the 𝔼0 -classes in 𝑁1 [𝐻1 ]; in particular, 𝑓0 (𝑐0 ) ≠ 𝑓1 (𝑐1 ).
This completes the proof. □

The following poset introduced in [74] adds an infinite maximal disjoint family, a task
impossible to perform with balanced forcing by Theorem 14.1.1. It yields a model of
ZF+DC where there is an infinite MAD family and every set of reals is Lebesgue mea-
surable by Example 14.3.6.
Definition 8.10.6. The MAD forcing 𝑃 consists of all pairs 𝑝 = ⟨𝑎𝑝 , 𝑏𝑝 ⟩ such that
𝑎𝑝 ⊂ [𝜔]ℵ0 is an infinite countable almost disjoint family, and 𝑏𝑝 is a countable set of
pairs ⟨𝑠, 𝑎⟩ such that 𝑠 is a partition of 𝜔 into finite sets and 𝑎 ⊂ 𝑎𝑝 is a countable set.
Moreover, for every pair ⟨𝑠, 𝑎⟩ ∈ 𝑏𝑝 and every finite set 𝑑 ⊂ 𝑎𝑝 ⧵ 𝑎, there are infinitely
many sets 𝑒 ∈ 𝑠 such that ⋃ 𝑑 ∩ 𝑒 = 0. The set 𝑃 is ordered by coordinatewise reverse
inclusion.
It is clear that the MAD forcing is Suslin and 𝜎-closed. The union of the first coordinates
of conditions in the generic filter is forced to be a maximal almost disjoint family by an
elementary density argument.
Theorem 8.10.7. The MAD forcing is weakly balanced.
Proof. Suppose that 𝑝 ∈ 𝑃 is a condition, and write 𝑏 = 𝑏𝑝 ∪ {⟨𝑠, 𝑎𝑝 ⟩ ∶ 𝑠 is a
ground model partition of 𝜔 into finite sets}. It is clear that for any poset 𝑄 collapsing
the size of the continuum to ℵ0 , 𝑄 ⊩ ⟨𝑎𝑝̌ , 𝑏⟩̌ is a condition in 𝑃 stronger than 𝑝. It will
̌ is weakly balanced in 𝑃.
be enough to show that the pair ⟨𝑄, ⟨𝑎𝑝̌ , 𝑏⟩⟩
To this end, suppose that 𝑅0 , 𝑅1 are partial orders and 𝜎0 , 𝜎1 are respective 𝑅0 -
and 𝑅1 -names for conditions in 𝑃 extending ⟨𝑎𝑝 , 𝑏⟩; We must produce, in some generic
extension, filters 𝐻0 ⊂ 𝑅0 and 𝐻1 ⊂ 𝑅1 separately generic over the ground model such
that the conditions 𝜎0 /𝐻0 and 𝜎1 /𝐻1 are compatible in 𝑃. The following claim is key.
Claim 8.10.8. For every 𝑖 ∈ 2, the following holds. Whenever 𝑟 ∈ 𝑅𝑖 is a condition,
𝑚 ∈ 𝜔 is a number, and 𝜂𝑗 for 𝑗 ∈ 𝑚 are names for elements of 𝑎𝜍𝑖 ⧵ 𝑎𝑝 , there is a number
𝑛 ∈ 𝜔 such that for every 𝑘 ∈ 𝜔 there is a strengthening of 𝑟 forcing ⋃𝑗∈𝑚 𝜂𝑗 ∩ [𝑛, 𝑘) = 0.
Proof. For definiteness let 𝑖 = 0. Suppose towards a contradiction that the claim
fails for a condition 𝑟 ∈ 𝑅0 and names 𝜂𝑗 for 𝑗 ∈ 𝑚. Then, there is a partition 𝑠 of 𝜔
into finite intervals such that 𝑟 ⊩ ⋃𝑗∈𝑏 𝜂𝑗 ∩ 𝑏 ≠ 0 for every 𝑏 ∈ 𝑠. This shows that
𝑟 ⊩ 𝜎0 ≰ ⟨𝑎𝑝 , 𝑏⟩, contradicting the initial assumptions. □
Let 𝑉[𝐾] be a generic extension collapsing a sufficiently large cardinal and work in
𝑉[𝐾]. An inductive application of the claim makes it possible to find filters 𝐻0 ⊂ 𝑅0
and 𝐻1 ⊂ 𝑅1 separately generic over the ground model, and a partition 𝜔 = ⋃𝑗 𝑐𝑗 of 𝜔
into finite sets such that, writing 𝜎0 /𝐻0 = ⟨𝑎0 , 𝑏0 ⟩ and 𝜎1 /𝐻1 = ⟨𝑎1 , 𝑏1 ⟩, we have:
• for every 𝑥 ∈ 𝑎0 ⧵ 𝑎𝑝 , 𝑥 ⊆ ⋃{𝑐𝑗 ∶ 𝑗 even} up to finitely many exceptions
and similarly for every 𝑥 ∈ 𝑎1 ⧵ 𝑎𝑝 , 𝑥 ⊆ ⋃{𝑐𝑗 ∶ 𝑗 odd} up to finitely many
exceptions;
• for every infinite collection 𝑠 ∈ 𝑉[𝐻0 ] of pairwise disjoint subsets of 𝜔, there
is 𝑒 ∈ 𝑠 which is a subset of some 𝑐𝑗 for 𝑗 even, and similarly for every infinite
collection 𝑠 ∈ 𝑉[𝐻1 ] of pairwise disjoint subsets of 𝜔, there is 𝑒 ∈ 𝑠 which is
a subset of some 𝑐𝑗 for 𝑗 odd.
We claim that the filters work as required. This is clearly the same as showing that the
pair ⟨𝑎0 ∪ 𝑎1 , 𝑏0 ∪ 𝑏1 ⟩ belongs to 𝑃, since then it is a lower bound of both ⟨𝑎0 , 𝑏0 ⟩ and
⟨𝑎1 , 𝑏1 ⟩. First of all, the first item above immediately shows that 𝑎0 ∪ 𝑎1 is an almost
disjoint family. To confirm the “moreover” demand in the definition of the poset 𝑃 for
the pair ⟨𝑎0 ∪ 𝑎1 , 𝑏0 ∪ 𝑏1 ⟩, suppose that ⟨𝑠, 𝑎⟩ ∈ 𝑏0 ∪ 𝑏1 ; for definiteness assume that
⟨𝑠, 𝑎⟩ ∈ 𝑏0 . Let 𝑑 ⊂ (𝑎0 ∪ 𝑎1 ) ⧵ 𝑎 be a finite set; we must produce infinitely many 𝑒 ∈ 𝑠
such that ⋃ 𝑑 ∩ 𝑒 = 0.
Write 𝑑0 = 𝑑 ∩ 𝑎0 and 𝑑1 = 𝑑 ⧵ 𝑑0 . Since the pair ⟨𝑎0 , 𝑏0 ⟩ is a condition in the
poset 𝑃, there are infinitely many sets 𝑒 ∈ 𝑠 such that ⋃ 𝑑0 ∩ 𝑒 = 0. By the second
item above, there must be infinitely many 𝑒 ∈ 𝑠 such that ⋃ 𝑑0 ∩ 𝑒 = 0 and 𝑒 ⊂ 𝑐𝑗 for
some even number 𝑗 ∈ 𝜔. By the first item above, there must be infinitely many sets 𝑒
among them such that ⋃ 𝑑1 ∩ 𝑒 = 0. For all such 𝑒 ∈ 𝑠, it is the case that ⋃ 𝑑 ∩ 𝑒 = 0.
This completes the proof. □
The definition of the MAD forcing may seem odd, since it skips the most obvious
choice: the poset 𝑄 of all infinite countable almost disjoint families ordered by reverse
inclusion. However, the following remains open:
Question 8.10.9. Is the poset 𝑄 weakly balanced?
CHAPTER 9
Preserving cardinalities
9.1. The well-ordered divide

The main feature of the balanced Suslin forcings is that they do not add any well-
ordered sequences of elements of the symmetric Solovay model. In particular, balanced
extensions of the Solovay model are barren in the sense of [23, 44]. This has a number
of cardinality corollaries for the resulting extensions. The following theorem is stated
in terms of Convention 1.7.18.
Theorem 9.1.1. In all cofinally balanced extensions of the symmetric Solovay model
𝑊, every well-ordered sequence of elements of 𝑊 belongs to 𝑊.
Proof. Let 𝑃 be a Suslin forcing. Let 𝜅 be an inaccessible cardinal such that 𝑃 is

balanced cofinally below 𝜅. Let 𝑊 be a symmetric Solovay model derived from 𝜅 and
work in 𝑊. For a formula 𝜙 of the language of set theory, element 𝑦 ∈ 2𝜔 , and a set
𝑣 ∈ 𝑉, write 𝑢(𝜙, 𝑦, 𝑣) for the unique set 𝑥 such that 𝑊 ⊧ 𝜙(𝑥, 𝑦, 𝑣) if such a unique 𝑥
exists; otherwise, write 𝑢(𝜙, 𝑦, 𝑣) = 0. Suppose towards a contradiction that there exist
a condition 𝑝 ∈ 𝑃, an ordinal 𝛼 and a 𝑃-name 𝜏 such that 𝑝 forces 𝜏 to be an 𝛼-sequence
of elements of 𝑊 which does not belong to 𝑊. The name 𝜏 is definable from some
real parameter 𝑧 ∈ 2𝜔 and some elements of the ground model. Find an intermediate
model 𝑉[𝐾] which is an extension of the ground model by a poset of cardinality smaller
than 𝜅 such that 𝑝, 𝑧 ∈ 𝑉[𝐾] and 𝑃 is balanced in 𝑉[𝐾].
Work in 𝑉[𝐾]. Let 𝑝 ̄ be a balanced virtual condition in 𝑃 below 𝑝. Since in 𝑊, 𝜏
is forced not to belong to 𝑊, there must be in 𝑉[𝐾] an ordinal 𝛽 ∈ 𝛼, and a poset 𝑅 of
cardinality smaller than 𝜅, 𝑅-names 𝜎0 , 𝜎1 for conditions in 𝑃 stronger than 𝑝,̄ 𝑅-names
𝜂0 , 𝜂1 for elements of 2𝜔 , ground model elements 𝑣0 , 𝑣1 , and formulas 𝜙0 , 𝜙1 such that
𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ the following:
• 𝜎0 ⊩𝑃 𝜏(𝛽)̌ = 𝑢(𝜙0 , 𝜂0 , 𝑣0 );
• 𝜎1 ⊩𝑃 𝜏(𝛽)̌ = 𝑢(𝜙1 , 𝜂1 , 𝑣1 );
• 𝑢(𝜙0 , 𝜂0 , 𝑣0 ) ≠ 𝑢(𝜙1 , 𝜂1 , 𝑣1 ).
Working in the model 𝑊, let 𝐻0 , 𝐻1 ⊂ 𝑅 be mutually generic filters, and for bits 𝑏, 𝑐 ∈ 2
let 𝑝𝑏𝑐 = 𝜎𝑏 /𝐻𝑐 ∈ 𝑃 and 𝑦𝑏𝑐 = 𝜂𝑏 /𝐻𝑐 ∈ 2𝜔 . By the third item above, in the model
𝑉[𝐾][𝐻0 , 𝐻1 ] there must be a bit 𝑐 ∈ 2 such that Coll(𝜔, < 𝜅) ⊩ 𝑢(𝜙0 , 𝑦00 , 𝑣0 ) ≠
𝑢(𝜙1 , 𝑦1𝑐 , 𝑣1 ). The conditions 𝑝00 , 𝑝1𝑐 ∈ 𝑃 are compatible in 𝑊 by the balance of the
condition 𝑝,̄ with a lower bound 𝑞 ∈ 𝑃. Since 𝑊 is the symmetric Solovay extension
of the model 𝑉[𝐾][𝐻0 ], the forcing theorem applied with that model yields that 𝑞 ⊩
𝜏(𝛽)̌ = 𝑢(𝜙0 , 𝜂0 , 𝑣0 ). Since 𝑊 is the symmetric Solovay extension of 𝑉[𝐾][𝐻1 ], the forc-
ing theorem applied with 𝑉[𝐾][𝐻1 ] yields that 𝑞 ⊩ 𝜏(𝛽)̌ = 𝑢(𝜙1 , 𝑦1𝑐 , 𝑣1 ). Finally, since
𝑊 is the symmetric Solovay extension of 𝑉[𝐾][𝐻0 ][𝐻1 ], 𝑢(𝜙0 , 𝑦00 , 𝑣0 ) ≠ 𝑢(𝜙1 , 𝑦1𝑐 , 𝑣1 )
179
180 9. PRESERVING CARDINALITIES
̌ an im-
holds in 𝑊. Thus, the condition 𝑞 forces two distinct values to the name 𝜏(𝛽),
possibility. □
Corollary 9.1.2. In a cofinally balanced extension of a symmetric Solovay model,
there is no transfinite uncountable sequences of pairwise distinct Borel sets of bounded
rank.
Proof. Since cofinally balanced extensions add no countable sequences of ele-
ments of the Solovay model 𝑊 by Theorem 9.1.1, all Borel sets in 𝑊[𝐺] belong to 𝑊
and have the same Borel rank there as in 𝑊[𝐺]. Thus, an uncountable sequence of
distinct Borel sets of bounded Borel rank in 𝑊[𝐺] would have to belong to 𝑊 by The-
orem 9.1.1 again. However, there are no such sequences in the Solovay model 𝑊 by a
result of Stern [100]. □
Corollary 9.1.3. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. In
cofinally balanced extensions of the symmetric Solovay model, ℵ1 ≰ |𝐸| holds.
Proof. An 𝜔1 -sequence of distinct 𝐸-classes would constitute an 𝜔1 -sequence of
distinct Borel sets of Borel rank bounded by the rank of 𝐸. Such sequences are ruled
out by the previous corollary. □
Corollary 9.1.3 guarantees that in balanced extensions of the symmetric Solovay model,
the Friedman–Stanley jump divide (see Definition 2.3.3) is preserved. This follows
from a humble ZF result of independent interest.
Proposition 9.1.4. (ZF) Let 𝑋 be a set and 𝐸 an equivalence relation on 𝑋 with all
classes countable. If |[𝑋]ℵ0 | ≤ |𝐸| then |ℍℂ| ≤ |𝐸|.
Proof. Let 𝑔 be an injection from the set of all countable subsets of 𝑋 to 𝐸-classes.
Define a function ℎ from the collection of hereditarily countable sets to 𝐸-classes by ∈-
recursion: ℎ(𝑎) = 𝑔(⋃ ℎ″ 𝑎). By induction on the minimum of the rank 𝑎 and 𝑏 argue
that 𝑎 ≠ 𝑏 implies that ℎ(𝑎) ≠ ℎ(𝑏). Thus the function ℎ is an injection and the
statement of the proposition follows. □
Corollary 9.1.5. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. In
cofinally balanced extensions of a symmetric Solovay model, |𝐸 + | ≰ |𝐸| holds.
Proof. Suppose towards a contradiction that |𝐸 + | ≤ |𝐸| holds in the extension.
The proposition yields |ℍℂ| ≤ |𝐸|. Clearly, ℵ1 ≤ |ℍℂ| holds in ZF, and the concatena-
tion of the cardinal inequalities contradicts the conclusion of Corollary 9.1.3. □
If one wishes to add well-ordered sequences of some objects in the Solovay model
and maintain control, it is possible to use weakly balanced forcing. The following the-
orem, stated in terms of Convention 1.7.18, shows that there will be no uncountable
sequences of reals in the resulting extension.
Theorem 9.1.6. In weakly balanced extensions of the symmetric Solovay model 𝑊,
every set of ordinals belongs to 𝑊.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing such that 𝑃
is weakly balanced below 𝜅. Let 𝑊 be the symmetric Solovay model derived from 𝜅
and work in the model 𝑊. Let 𝑝 ∈ 𝑃 be a partial order and let 𝜏 be a 𝑃-name for a
set of ordinals; we have to find a strengthening of the condition 𝑝 which decides the
9.1. THE WELL-ORDERED DIVIDE 181
membership of every ordinal in the set 𝜏. To this end, note that both 𝑝, 𝜏 are definable
from a parameter 𝑧 ∈ 2𝜔 and some parameters in the ground model.
Let 𝑉[𝐾] be an intermediate generic extension obtained by a poset of cardinality
smaller than 𝜅 such that 𝑧 ∈ 𝑉[𝐾]. Working in the model 𝑉[𝐾], let 𝑝 ̄ be a weakly
balanced virtual condition in the poset 𝑃, below the condition 𝑃. We claim that for
every ordinal 𝛼, it is the case that Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ decides in 𝑃 the membership of the
ordinal 𝛼̌ in the set 𝜏. Suppose towards a contradiction that this is not the case. Then
there must be an ordinal 𝛼, posets 𝑅0 , 𝑅1 of cardinality smaller than 𝜅, and 𝑅0 - and
𝑅1 -names 𝜎0 and 𝜎1 for elements of 𝑝 stronger than 𝑝 ̄ such that 𝑅0 ⊩ Coll(𝜔, < 𝜅) ⊩
𝜎0 ⊩ 𝛼̌ ∉ 𝜏 and 𝑅1 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎1 ⊩ 𝛼̌ ∈ 𝜏.
Work in 𝑊 again. Use the weak balance of 𝑝 ̄ to find filters 𝐻0 ⊂ 𝑅0 and 𝐻1 ⊂ 𝑅1
separately generic over 𝑉[𝐾] such that the conditions 𝑝0 = 𝜎0 /𝐻0 and 𝑝1 = 𝜎1 /𝐻1 are
compatible in 𝑃. Since 𝑊 is a symmetric Solovay extension of both models 𝑉[𝐾][𝐻0 ]
and 𝑉[𝐾][𝐻1 ], 𝑝0 ⊩ 𝛼̌ ∉ 𝜏 and 𝑝1 𝛼̌ ∈ 𝜏. Thus, the common lower bound of 𝑝0 , 𝑝1
must force two contradictory statements, which is impossible. □
It is impossible to strengthen the conclusion of Theorem 9.1.6 to sequences of ele-
ments of the Solovay model. For any Borel equivalence relation 𝐸 on a Polish space 𝑋,
Theorem 8.10.2 produces a weakly balanced extension of the symmetric Solovay model
in which |𝐸| ≤ 𝔼0 . In the natural case 𝐸 = 𝔽2 , Proposition 9.1.4 applied in the resulting
model shows that |ℍℂ| ≤ |𝔼0 | there, in particular there is an 𝜔1 -sequence of 𝔼0 -classes.
Note that the conclusion of Corollary 9.1.5 fails as well in the model.
As the last remark in this section, many preservation theorems in this book can
be combined since the various properties of the posets concerned are preserved under
product. In view of the many mutual consistency results concerning ZFC such as those
contained in [114], one can ask for example whether there can be Σ21 sentences 𝜙0 and
𝜙1 such that both ZF+DC+𝜙0 and ZF+DC+𝜙1 are consistent with the statement 𝜓 as-
serting the nonexistence of an uncountable sequence of pairwise distinct reals, while
ZF+DC+𝜙0 +𝜙1 implies ¬𝜓. The following two examples provide an affirmative an-
swer, in the second case 𝜙0 +𝜙1 even implies that the reals are well-ordered in ordertype
𝜔1 .
Example 9.1.7. Let 𝜙0 be the statement “there is an uncountable sequence of 𝔼0 -
classes” and let 𝜙1 be the statement “there is an 𝔼0 -transversal”. The conjunction 𝜓∧𝜙0
holds in the abovementioned weakly balanced extension of the Solovay model. The
conjunction 𝜓 ∧ 𝜙1 holds in the balanced extension of the Solovay model adding an 𝔼0 -
transversal with countable approximations by Corollary 9.1.2. Finally, the conjunction
𝜙0 ∧ 𝜙1 immediately implies ¬𝜓 in ZF. This example shows that a product of a balanced
and a weakly balanced forcing is not necessarily weakly balanced.
Example 9.1.8. Let 𝜙0 be the statement “there is a decomposition of ℝ into count-
ably many sets, each of which is linearly independent over ℚ (a Hamel decomposition)”.
Let 𝑋 = (2𝜔 )𝜔 and let 𝐴 ⊂ 𝑋 be the set of all 𝑥 ∈ 𝑋 such that Turing reducibility lin-
early orders rng(𝑥). Let 𝐸 = 𝔽2 ↾ 𝐴 and let 𝜙1 be the statement “|𝐸| ≤ |2𝜔 |”. The
theories ZF+DC+𝜙0 and ZF+DC+𝜙1 are separately consistent with 𝜓, but the theory
ZF+DC+𝜙0 +𝜙1 implies that the reals are well-ordered in ordertype 𝜔1 .
Proof. Let 𝑃0 be the Hamel decomposition forcing of Definition 8.2.16 applied
with the matroid of finite subsets of ℝ linearly independent over ℚ. It is balanced if
CH holds by Theorem 8.2.17, so by Theorem 9.1.1 the 𝑃0 -extension of the symmetric

Solovay model contains a Hamel decomposition of ℝ while it does not contain any
uncountable sequence of pairwise distinct reals. Let 𝑃1 be the collapse poset of 𝐸 to 2𝜔
of Definition 6.4.1. Since the virtual 𝐸-classes are classified by subsets of 2𝜔 linearly
ordered by Turing reducibility and each such set can have size at most ℵ1 , it follows
that 𝜆(𝐸) = 2ℵ1 and by Theorem 6.4.2 the poset 𝑃1 is balanced if 2ℵ0 = 2ℵ1 holds. By
Theorem 9.1.1, the 𝑃1 extension of the symmetric Solovay model satisfies |𝐸| ≤ |2𝜔 |
while it does not contain any uncountable sequence of pairwise distinct reals. Note
that the posets 𝑃0 , 𝑃1 are balanced under incompatible assumptions additional to ZFC,
and as a result ZFC proves that the product 𝑃0 × 𝑃1 is not balanced.
Now, argue in the theory ZF+DC+𝜙0 +𝜙1 . Let 𝑐 ∶ ℝ → 𝜔 be a Hamel decompo-
sition, and let 𝑓 be an injection from the 𝐸-quotient space to 2𝜔 . Let 𝑀 be the model
of sets hereditarily ordinally definable from the parameters 𝑐, 𝑓. As is well-known, 𝑀
is a model of ZFC. Since 𝑐 ↾ 𝑀 ∈ 𝑀 is a Hamel decomposition in 𝑀, by an old result
of Erdős and Kakutani [26] 𝑀 satisfies CH. The argument will be complete if we show
that 2𝜔 ⊂ 𝑀.
We first show that 𝑀 contains uncountably many reals. Suppose towards a contra-
diction that this fails. Working in 𝑀, write 𝜅 = 𝜔1𝑀 and find an uncountable sequence
⟨𝑥𝛼 ∶ 𝛼 ∈ 𝜅⟩ of elements of 2𝜔 which is increasing in the Turing reducibility order.
Consider the injective map 𝑔 ∶ 𝒫(𝜅) ∩ 𝑀 → 2𝜔 defined by 𝑔(𝑏) = 𝑓({𝑥𝛼 ∶ 𝛼 ∈ 𝑏});
note that the definition is enabled by the initial contradictory assumption. The map 𝑔
is definable, therefore belongs to 𝑀 and in 𝑀, it witnesses 2ℵ1 ≤ 2ℵ0 , in contradiction
with the Continuum Hypothesis.
Now, we are ready to show that ℝ ⊂ 𝑀. Suppose that 𝑥 ∈ ℝ is a point. Since
𝑀 contains uncountably many elements of ℝ, there must be distinct points 𝑦0 , 𝑦1 ∈
ℝ ∩ 𝑀 such that 𝑐(𝑥 − 𝑦0 ) = 𝑐(𝑥 − 𝑦1 ) = 𝑛 for some number 𝑛 ∈ 𝜔. There cannot
be any other point 𝑥′ ∈ 2𝜔 such that 𝑐(𝑥′ − 𝑦0 ) = 𝑐(𝑥′ − 𝑦1 ) = 𝑛, because the set
{𝑥 − 𝑦0 , 𝑥 − 𝑦1 , 𝑥′ − 𝑦0 , 𝑥′ − 𝑦1 } would be monochromatic and linearly dependent: its
alternating sum equals to 0. Thus, 𝑥 is defined by the demand 𝑐(𝑥−𝑦0 ) = 𝑐(𝑥−𝑦1 ) = 𝑛,
so it is an element of 𝑀 as desired. □
9.2. The smooth divide

A basic result in the theory of analytic equivalence relations says that there is no
Borel reduction from 𝔼0 to the identity on 2𝜔 . A basic concern of our theory then
is when |𝔼0 | > |2𝜔 | holds in balanced extensions of the symmetric Solovay model.
The take home lesson of this section is that if 𝑃 is a balanced Suslin forcing whose
balanced virtual conditions are naturally organized into a compact Hausdorff space,
then in the 𝑃-extension of the symmetric Solovay model, |𝔼0 | > |2𝜔 | indeed holds.
There are other ways to preserve the inequality |𝔼0 | > |2𝜔 | discussed in Chapter 11,
but the compactness arguments are the most elegant and cover a lot of ground.
Definition 9.2.1. A Suslin forcing 𝑃 is compactly balanced if there is a definable

compact Hausdorff topology 𝑇 on the set 𝐵 of all ≡𝑏 -equivalence classes of balanced
virtual conditions such that
(1) for every 𝑝 ∈ 𝑃 the set {𝑝 ̄ ∈ 𝐵 ∶ 𝑝 ̄ ≤ 𝑝} ⊂ 𝐵 is nonempty and 𝑇-closed.
9.2. THE SMOOTH DIVIDE 183
Moreover, if 𝑉[𝐻0 ] ⊂ 𝑉[𝐻1 ] are generic extensions of 𝑉 then

2. for every balanced virtual condition 𝑝0̄ ∈ 𝑉[𝐻0 ] there is a balanced virtual
condition 𝑝1̄ ∈ 𝑉[𝐻1 ] such that 𝑝1̄ ≤ 𝑝0̄ holds;
3. the relation {⟨𝑝0̄ , 𝑝1̄ ⟩ ∈ 𝐵 𝑉 [𝐻0 ] ×𝐵 𝑉 [𝐻1 ] ∶ 𝑝1̄ ≤ 𝑝0̄ } is closed in 𝑇 𝑉 [𝐻0 ] ×𝑇 𝑉 [𝐻1 ]
as computed in 𝑉[𝐻1 ].
The definition may seem to be obscure at the first reading, but it is fully justified by
the natural compact Hausdorff topologies present in the examples. One rather (inten-
tionally) unclear feature is the definability of the topology 𝑇. It is central in that oth-
erwise the definition would have no content and the key item (3) could not be stated
without it. The definition is allowed to have real parameters. However, the nature of
the definition of 𝑇 is left undetermined. In the examples, the topology 𝑇 is typically
nonseparable, and the compact Hausdorff space ⟨𝐵, 𝑇⟩ can be in principle very com-
plicated. The following theorem is the main result of this section. Its statement uses
Convention 1.7.18.
Theorem 9.2.2. In compactly balanced extensions of the symmetric Solovay model,

|𝔼0 | > |2𝜔 | holds.
The proof uses a technical tool which has been studied in its own right: the Vitali
forcing, also called 𝔼0 -forcing in [54, Section 10.9] or in [115, Section 4.7.1], where it
was isolated for the first time. To define it, consider the 𝜎-ideal 𝐼 on 2𝜔 generated by
the Borel partial 𝔼0 -transversals, and let 𝑄 be the poset of Borel 𝐼-positive sets ordered
by inclusion. As with every poset of this form, 𝑄 adds a generic point in 2𝜔 –the unique
point which belongs to all Borel sets in the generic filter [115, Proposition 2.1.2].
Fact 9.2.3. Let 𝑄 be the Vitali forcing and let 𝐺 ⊂ 𝑄 be a generic filter. Then
(1) [115, Theorem 4.7.3] every real in 𝑉[𝐺] is the image of the generic point 𝑥gen
under a ground model Borel function (𝑄 is proper);
(2) [97, Proposition 4.5] for every set 𝑎 ⊂ 𝜔 in 𝑉[𝐺], either 𝑎 or its complement
contain a ground model infinite set (𝑄 adds no independent reals);
(3) [117, Theorem 2.11] every real definable in 𝑉[𝐺] from [𝑥gen ]𝔼0 and ground
model parameters belongs to the ground model.
Proof of Theorem 9.2.2. Let 𝜅 be an inaccessible cardinal. Suppose that 𝑃 is

a Suslin forcing such that 𝑃 is compactly balanced below 𝜅. Let 𝑊 be a symmetric
Solovay model derived from 𝜅 and work in 𝑊. Towards a contradiction, assume that
𝑝 ∈ 𝑃 is a condition and 𝜏 is a 𝑃-name for an injection from the 𝔼0 -classes to 2𝜔 .
Both 𝑝, 𝜏 are definable from some real parameter 𝑧 ∈ 2𝜔 . Let 𝑉[𝐾] be an intermediate
generic extension of 𝑉 obtained by a forcing of cardinality smaller than 𝜅 such that
𝑧 ∈ 𝑉[𝐾] holds, and work in the model 𝑉[𝐾].
Let 𝑄0 be the poset of infinite subsets of 𝜔, ordered by inclusion. Let 𝑄1 be the
Vitali forcing. Let ⟨𝑈, 𝑦⟩ be an object 𝑄0 × 𝑄1 -generic over the model 𝑉[𝐾]; that is,
𝑈 is an ultrafilter on 𝜔 and 𝑦 ∈ 2𝜔 is a point. By the 𝜎-closure of 𝑄0 , the models
𝑉[𝐾] and 𝑉[𝐾][𝑈] have the same reals, in particular they evaluate the definition of
the Vitali forcing in the same way, so 𝑦 is a Vitali-generic point over 𝑉[𝐾][𝑈] by the
product forcing theorem. By Fact 9.2.3(2), and a genericity argument, the ultrafilter 𝑈
still generates an ultrafilter on 𝜔 in the model 𝑉[𝐾][𝑈][𝑦].
Now, work in the model 𝑉[𝐾][𝑈]. Let 𝑝0̄ ≤ 𝑝 be a balanced virtual condition
below 𝑝. Let also 𝜒 be any 𝑄1 -name for a balanced virtual condition in 𝑃 in the model
𝑉[𝐾][𝑈][𝑦] below 𝑝0̄ . This is possible by (2) of Definition 9.2.1. Note that the model
𝑉[𝐾][𝑈][𝑦] has more reals than 𝑉[𝐾][𝑈]; thus, the balance of the condition 𝑝0̄ does not
necessarily transfer from 𝑉[𝐾][𝑈] to 𝑉[𝐾][𝑈][𝑦] and 𝑝0̄ may have to be improved in a
nontrivial way to get a balanced virtual condition in 𝑉[𝐾][𝑈][𝑦]. For each 𝑛 ∈ 𝜔, let
𝑦𝑛 ∈ 2𝜔 be the binary sequence obtained from 𝑦 by replacing its first 𝑛 entries by 0. Note
that for each 𝑛 ∈ 𝜔, 𝑦𝑛 is still 𝑄1 -generic over 𝑉[𝐾][𝑈] since the ideal 𝐼 defining the
poset 𝑄1 is shift invariant, and 𝑉[𝐾][𝑈][𝑦] = 𝑉[𝐾][𝑈][𝑦𝑛 ]. In the model 𝑉[𝐾][𝑈][𝑦],
let 𝑝1̄ be the 𝑈-limit of the sequence 𝜒/𝑦𝑛 for 𝑛 ∈ 𝜔. By (3) of Definition 9.2.1, it is the
case that 𝑝1̄ ≤ 𝑝0̄ ≤ 𝑝. Note also that the definition of 𝑝1̄ does not depend on 𝑦 per
se, but only on the 𝔼0 -class of 𝑦. The treatment divides into two cases according to the
fate of the value 𝜏([𝑦]𝔼0 ) as forced by 𝑝1̄ , and a contradiction is reached in each case.
Case 1. In the model 𝑉[𝐾][𝑈][𝑦], there is no point 𝑢 ∈ 2𝜔 such that Coll(𝜔, < 𝜅) ⊩
𝑝1̄ ⊩𝑃 𝜏([𝑦]𝔼0 ) = 𝑢.̌ In such a case, there have to be disjoint basic open subsets 𝑂0 , 𝑂1
of 2𝜔 , posets 𝑅0 , 𝑅1 of cardinality smaller than 𝜅, and respective 𝑅0 , 𝑅1 -names 𝜎0 , 𝜎1 for
conditions in 𝑃 stronger than 𝑝 ̄ such that 𝑅0 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜏([𝑦]𝔼0 ) ∈ 𝑂0 ,
and similarly for subscript 1. In the model 𝑊, let 𝐻0 ⊂ 𝑅0 and 𝐻1 ⊂ 𝑅1 be filters mutu-
ally generic over the model 𝑉[𝐾][𝑈][𝑦] and consider the conditions 𝜎0 /𝐻0 , 𝜎1 /𝐻1 ∈ 𝑃.
By the balance of the condition 𝑝1̄ , the conditions 𝜎0 /𝐻0 , 𝜎1 /𝐻1 are compatible. The
forcing theorem applied in both models 𝑉[𝐾][𝑈][𝑦][𝐻0 ] and 𝑉[𝐾][𝑈][𝑦][𝐻1 ] now says
that in 𝑊, their lower bound forces 𝜏([𝑦]𝔼0 ) to belong simultaneously to 𝑂0 and to 𝑂1 ,
an impossibility.
Case 2. There is a point 𝑢 ∈ 2𝜔 in 𝑉[𝐾][𝑈][𝑦] such that Coll(𝜔, < 𝜅) ⊩ 𝑝1̄ ⊩𝑃
𝜏([𝑦]𝔼0 ) = 𝑢.̌ This point 𝑢 is clearly unique, and since 𝑝1̄ is definable from [𝑦]𝔼0 , so is
𝑢. By Fact 9.2.3(3), 𝑢 ∈ 𝑉[𝐾][𝑈] holds. Working in 𝑉[𝐾][𝑈], let 𝑞 ∈ 𝑄1 be a condition
forcing Coll(𝜔, < 𝜅) ⊩ 𝑝1̄ ⊩𝑃 𝜏([𝑥gen ]𝔼0 ) = 𝑢,̌ where 𝑥gen is the 𝑄1 -name for its
generic point. Let 𝐻0 , 𝐻1 ⊂ 𝑄 be filters mutually generic over 𝑉[𝐾][𝑈] containing
the condition 𝑞. Let 𝑦0 , 𝑦1 ∈ 2𝜔 be the respective generic points; observe that 𝑦0 , 𝑦1
are not 𝔼0 -related by mutual genericity. Write also 𝑝0 = 𝑝1̄ /𝐻0 and 𝑝1 = 𝑝1̄ /𝐻1 .
These are two virtual conditions in 𝑃 strengthening 𝑝0̄ . By the balance of 𝑝0̄ , they
are compatible in the poset 𝑃. Then, in the model 𝑊, their lower bound forces that
𝜏([𝑦0̌ ]𝔼0 ) = 𝜏([𝑦1̌ ]𝔼0 ) = 𝑢.̌ This contradicts the assumption that 𝜏 was forced to be an
injection. □
Example 9.2.4. Let 𝑃 be the poset of 𝒫(𝜔) modulo finite. By Theorem 7.1.2, the
balanced virtual conditions are classified by nonprincipal ultrafilters on 𝜔. Equip the
set of balanced classes by the topology of the remainder 𝛽𝜔. It is immediate that the
topology witnesses the fact that 𝑃 is compactly balanced.
Corollary 9.2.5.
(1) [22] Let 𝑃 be the poset 𝒫(𝜔) modulo finite. In the 𝑃-extension of the symmetric
Solovay model, |𝔼0 | > |2𝜔 |.
(2) [22] It is consistent relative to an inaccessible cardinal that ZF+DC holds, there
is a Ramsey ultrafilter on 𝜔, yet |𝔼0 | > |2𝜔 |.
Example 9.2.6. Let 𝐴 be a Ramsey sequence of finite structures and 𝑃𝐴 the asso-
ciated 𝜎-closed poset as in Definition 7.3.1. Theorem 7.3.4 provides a classification of
the balanced virtual conditions: they correspond to Ramsey sequences of ultrafilters

on the respective domain sets 𝐷𝑛 for 𝑛 ∈ 𝜔. Sequences of ultrafilters of this type form
a closed subset of the product ∏𝑛 𝐷𝑛∗ of the respective compact sequences of ultrafil-
ters, so form a compact Hausdorff space. Claim 7.3.6 confirms the extension property
Definition 9.2.1(2). It follows that the poset 𝑃𝐴 is compactly balanced.
The conjunction of Examples 9.2.6 and 7.3.8 now yields the following:
Corollary 9.2.7. Let 𝑘 ∈ 𝜔 be a number.
(1) Let 𝑃 be the poset 𝑃𝐴 where 𝐴 is a sequence enumerating all finite ordered graphs
with no clique of cardinality 𝑘. In the 𝑃-extension of the symmetric Solovay
model, |𝔼0 | > |2𝜔 |.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, there is an
ultrafilter 𝑈 on 𝜔 such that 𝑈 → (𝑈, 𝑘)2 and 𝑈 6→ (𝑈, 𝑘 + 1)2 , yet |𝔼0 | > |2𝜔 |.
Example 9.2.8. Let 𝑃 be the Fin×Fin poset of Definition 7.2.1. The poset 𝑃 is
compactly balanced.
Proof. The balanced virtual conditions of 𝑃 were classified in Theorem 7.2.2.
They correspond to ultrafilters on 𝜔 × 𝜔∗ which do not contain the set 𝑛 × 𝜔∗ for any
number 𝑛 ∈ 𝜔. Thus, the space of balanced virtual conditions is naturally organized
into a definable compact Hausdorff space. It is necessary to verify the conditions (2, 3)
of Definition 9.2.1. Let 𝑉[𝐻0 ] ⊂ 𝑉[𝐻1 ] be generic extensions.
We first evaluate the complexity of the order between the balanced virtual condi-
tions in 𝑉[𝐻0 ] and 𝑉[𝐻1 ]. Consider the partial map 𝑓 ∶ (𝜔 × 𝜔∗ )𝑉 [𝐻1 ] → (𝜔 × 𝜔∗ )𝑉 [𝐻0 ]
defined by 𝑓(𝑛, 𝑈) = ⟨𝑛, 𝑈 ∩ 𝑉[𝐻0 ]⟩; if 𝑈 ∩ 𝑉[𝐻0 ] ∉ 𝑉[𝐻0 ], the functional value is left
undefined. Unraveling the definitions, a balanced virtual condition in 𝑉[𝐻0 ] corre-
sponding to an ultrafilter 𝑊0 on 𝜔 × 𝜔∗ is weaker than the balanced virtual condition in
𝑉[𝐻1 ] corresponding to some ultrafilter 𝑊1 on 𝜔 × 𝜔∗ just in case for every set 𝐴 ∈ 𝑊0 ,
the set 𝑓−1 𝐴 belongs to 𝑊1 . In view of the topology on the ultrafilter spaces, this is a
closed relation.
To see that every balanced virtual condition in 𝑉[𝐻0 ] can be extended to a balanced
virtual condition in 𝑉[𝐻1 ], suppose that 𝑊0 is an ultrafilter on 𝜔 × 𝜔∗ in the model
𝑉[𝐻0 ]. Considering the function 𝑓 from the previous paragraph, it is obvious that the
collection {𝑓−1 𝐴 ∶ 𝐴 ∈ 𝑊0 } of subsets of 𝜔 × 𝜔∗ in the model 𝑉[𝐻1 ] has the finite
intersection property, and therefore can be extended to an ultrafilter 𝑊1 . The ultrafilter
𝑊1 corresponds to a balanced virtual condition in the model 𝑉[𝐻1 ] stronger than the
one corresponding to 𝑊0 . □
Corollary 9.2.9.
(1) Let 𝑃 be the Fin×Fin poset of Definition 7.2.1. In the 𝑃-extension of the symmet-
ric Solovay model, |𝔼0 | > |2𝜔 |.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, there is
an ultrafilter 𝑈 on 𝜔 which is a weak P-point but not a P-point, yet |𝔼0 | > |2𝜔 |.
We refer the reader to [12] for the definition of a weak P-point and the proof that the
Fin×Fin poset adds one, as well as some other combinatorial properties of the Fin×Fin-
generic ultrafilter which may be difficult to replicate in the Ramsey ultrafilter model.
The previous proofs heavily depend on the specific initial ideal on a countable set that
we use to force a generic ultrafilter disjoint from it. This brings up a general question:
Question 9.2.10. Is there a Borel ideal 𝐼 on 𝜔 such that ZF+DC proves that exis-
tence of a nonprincipal ultrafilter disjoint from 𝐼 implies |𝔼0 | ≤ |2𝜔 |?
Example 9.2.11. Let ℱ be a Fraissé class in a finite relational language with strong
amalgamation. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. Let 𝑃(ℱ, 𝐸)
be the poset of Definition 8.7.3 for adding a ℱ-structure to the 𝐸-quotient space. Then
𝑃(ℱ, 𝐸) is compactly balanced: its balanced virtual conditions are classified by ℱ-
structures on the virtual quotient space 𝑋 ∗∗ , which form a compact subspace of
𝒫([𝑋 ∗∗ ]𝑛 ) where 𝑛 corresponds to the maximum arity of the relations in the language
for ℱ. It is easy to verify that the demands of Definition 9.2.1 are satisfied with the
inherited topology.
Corollary 9.2.12. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋.
(1) Let 𝑃 be the linearization poset for 𝐸 of Example 8.7.5. In the 𝑃-extension of the
symmetric Solovay model, |𝔼0 | > 2𝜔 .
(2) it is consistent relative to an inaccessible cardinal that ZF+DC holds, the 𝐸-
quotient space can be linearly ordered, yet |𝔼0 | > |2𝜔 |.
Another class of examples stems from posets which select a single structure on each
𝐸-class from a compact class of structures, where 𝐸 is a countable Borel equivalence
relation.
Example 9.2.13. Let 𝑋 be a Polish space and let Γ be a locally finite bipartite Borel
graph on 𝑋 satisfying the Hall’s marriage condition. Consider the poset 𝑃 adding a
perfect Γ-matching as in Example 6.2.9. The balanced virtual conditions are classified
by perfect matchings. The set of perfect matchings is naturally viewed as a compact
subset of 𝒫(Γ). It is not difficult to check that the inherited compact topology satisfies
the demands of Definition 9.2.1.
Corollary 9.2.14. Let 𝑋 be a Polish space and let Γ be a locally finite bipartite Borel
graph on 𝑋 satisfying Hall’s marriage condition.
(1) Let 𝑃 be the complete matching poset for Γ. In the 𝑃-extension of the symmetric
Solovay model, |𝔼0 | > |2𝜔 |.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, Γ has a
perfect matching, yet |𝔼0 | > |2𝜔 |.
Example 9.2.15. Let 𝑋 be a Polish space and let Γ be a Borel, acyclic, locally finite
graph on 𝑋 in which every vertex has degree at least 2; view Γ as a symmetric subset of
𝑋 2 . Consider the poset 𝑃 of Example 6.2.10, adding an orientation of Γ in which every
vertex has exactly one point in its outflow, or in other words which selects an end to
each connected component of Γ. Balanced virtual conditions are classified by all such
orientations, which form a compact subset of 𝒫(Γ). It is not difficult to check that the
inherited compact topology satisfies the demands of Definition 9.2.1.
This example is somewhat singular in that it is the only compactly balanced poset for
which we are able to confirm that it introduces some new cardinal inequalities between
quotient cardinals. Namely, writing 𝐸 for the Γ-path-connectedness equivalence rela-
tion, in the 𝑃-extension of the symmetric Solovay model |𝐸| ≤ |𝔼0 | must hold. To see
this, consider the equivalence relation 𝐹 on the set 𝐷 ⊂ 𝑋 𝜔 of all sequences consist-
ing of pairwise 𝐸-equivalent points, making two such sequences 𝑥0⃗ , 𝑥1⃗ 𝐹-equivalent if
some tail of 𝑥0⃗ is equal to some tail of 𝑥1⃗ . It is not difficult to see that 𝐹 is a hypersmooth
equivalence relation [54, Theorem 8.3.1] with all classes countable, so by a standard re-
sult [54, Theorem 8.1.1], 𝐹 is Borel reducible to 𝔼0 . Consider the 𝑃-generic orientation
Γ⃗ of the graph Γ; each vertex has exactly one point in its outflow. For each point 𝑥 ∈ 𝑋
let ℎ(𝑥) = ⟨𝑥𝑖 ∶ 𝑖 ∈ 𝜔⟩ where 𝑥0 = 𝑥 and 𝑥𝑖+1 is the unique point in the Γ-outflow ⃗ of
𝑥𝑖 . Then ℎ is a (non-Borel) reduction of 𝐸 to 𝐹, so in the 𝑃-extension |𝐸| ≤ |𝐹| ≤ |𝔼0 |
holds.
Corollary 9.2.16. Let 𝑋 be a Polish space and let Γ be a Borel, acyclic, locally finite
bipartite Borel graph on 𝑋 in which every vertex has degree at least 2.
(1) Let 𝑃 be the poset selecting an end to each connected component of Γ. In the
𝑃-extension of the symmetric Solovay model, |𝔼0 | > |2𝜔 |.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, there is a
function assigning exactly one end to each connected component of Γ, yet |𝔼0 | >
|2𝜔 |.
Example 9.2.17. Let 𝑛 ∈ 𝜔 be a number, let 𝑋 be a Polish space and let Γ be a
locally countable Borel graph on 𝑋 such that every finite subgraph of Γ has chromatic
number ≤ 𝑛. Consider the poset 𝑃 adding a Γ-coloring by 𝑛 colors as described in
Example 6.2.11. The balanced virtual conditions are classified by total Γ-colorings by
≤ 𝑛-colors; these form a compact subset of 𝑛𝑋 . It is not difficult to see that the inherited
compact product topology satisfies the demands of Definition 9.2.1.
Corollary 9.2.18. Let 𝑋 be a Polish space and let Γ be a locally countable Borel
graph on 𝑋 such that each finite subset of Γ has chromatic number ≤ 𝑛 for some fixed
number 𝑛 ∈ 𝜔.
(1) Let 𝑃 be the coloring poset for Γ. In the 𝑃 extension of the symmetric Solovay
model, |𝔼0 | > |2𝜔 |.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, Γ has
chromatic number ≤ 𝑛, yet |𝔼0 | > |2𝜔 |.
Question 9.2.19. Is there a Borel graph 𝐺 on a Polish space 𝑋 such that each
finite subgraph of 𝐺 has chromatic number ≤ 𝑛, and ZF+DC proves that if 𝐺 has finite
chromatic number then |𝔼0 | ≤ |2𝜔 |?
Example 9.2.20. Let Γ, Δ be abelian Polish groups, with Δ divisible and compact.
Let 𝑃(Γ, Δ) be the poset adding a homomorphism from Γ to Δ as isolated in Defini-
tion 8.3.1. As proved in Theorem 8.3.2, its balanced virtual conditions are classified
by homomorphisms from Γ to Δ. The space of homomorphisms is a closed subset of
ΔΓ equipped with the product topology. It is not difficult to see that the demands of
Definition 9.2.1 are met. Let us elaborate on the extension property (2). If ℎ ∶ Γ → Δ
is a homomorphism in some generic extension 𝑉[𝐻0 ] then it can be extended to a ho-
momorphism in any larger forcing extension 𝑉[𝐻1 ] by the divisibility of Δ and Baer’s
criterion [3]. Note that the group Δ remains abelian and divisible in all generic exten-
sions by Mostowski absoluteness.
Corollary 9.2.21. Let Γ, Δ be Polish abelian groups, with Γ uncountable and tor-
sion free, and Δ divisible and compact.
(1) In the 𝑃(Γ, Δ) extension of the symmetric Solovay model, |𝔼0 | > |2𝜔 |.
discontinuous homomorphism from Γ to Δ, yet |𝔼0 | > |2𝜔 |.
Proof. Recall from Example 8.3.3 that the generic homomorphism added by the
poset 𝑃(Γ, Δ) is discontinuous. Other than that, the corollary follows from Theorem
9.2.2. □
The assumption that Δ be compact cannot be dropped entirely from the statement of
the corollary by the following observation which elaborates on the results of [75]:
Proposition 9.2.22. (ZF+DC) Let 𝑌 , 𝑍 be Banach spaces. If there is a discontinu-

ous homomorphism ℎ ∶ 𝑌 → 𝑍 then there is an 𝔼0 -transversal, in particular |𝔼0 | ≤ |2𝜔 |.
Proof. The discontinuity of the homomorphism and the DC assumption yield a

sequence ⟨𝑦𝑛 ∶ 𝑛 ∈ 𝜔⟩ of elements of 𝑌 such that |𝑦𝑛 | > Σ𝑚>𝑛 |𝑦𝑚 | and |ℎ(𝑦𝑛+1 )| >
2|ℎ(𝑦𝑛 )|. Now, for every 𝑥 ∈ 2𝜔 let 𝑔(𝑥) = Σ{𝑦𝑛 ∶ 𝑥(𝑛) = 1} ∈ 𝑌 . Let 𝑑 ⊂ 2𝜔 be any 𝔼0 -
class. The homomorphism assumptions on ℎ show that the function 𝑔 ↾ 𝑑 is injective
and also, the norms of the points in (ℎ∘𝑔)″ 𝑑 diverge to infinity. Thus, 𝑑 contains a finite
subset of points whose ℎ ∘ 𝑔-images have the smallest possible norm, and one can let
𝑥𝑑 ∈ 𝑑 be the lexicographically smallest point in 𝑑 the norm of whose ℎ ∘ 𝑔-image is as
small as possible. The set {𝑥𝑑 ∶ 𝑑 is an 𝔼0 -class} is an 𝔼0 -transversal. □
Example 9.2.23. The Kurepa poset 𝑃 on a Polish space 𝑋 of Definition 8.5.2 is

compactly balanced. To see this, equip 2𝑋 , identified with 𝒫(𝑋), with the usual prod-
uct topology, refer to Theorem 8.5.3 to argue that the balanced virtual conditions are
classified by subsets of 𝒫(𝑋) closed under intersections and containing 𝑋, and observe,
that sets of this type form a closed and therefore compact subset of 𝒫(𝑋). The proper-
ties (1-3) of Definition 9.2.1 are easily verified for this topology.
Corollary 9.2.24. Let 𝑋 be a Polish space.

(1) In the Kurepa poset extension of the symmetric Solovay model, |𝔼0 | > |2𝜔 |.
Kurepa family on 𝑋, yet |𝔼0 | > |2𝜔 |.
As a final remark in this section, the consistency results obtained here can be combined
using the countable support product. The balanced virtual conditions in a countable
product of posets are simply sequences of balanced virtual conditions in each coordi-
nate (Theorem 5.2.12). A product of Hausdorff compact spaces is Hasudorff compact
again; thus, a product of countably many compactly balanced forcings with full sup-
port is compactly balanced again. However, the machinery of Chapter 11 (which can
also be used to show that the smooth divide is preserved in certain extensions) seems
to be incompatible with the compactly balanced approach.
9.3. The turbulent divide

We wish to transfer the ergodicity theorem 3.3.5 to cardinal inequalities in generic
extensions of the Solovay model. The following variation of balance will be central in
this effort.
9.3. THE TURBULENT DIVIDE 189
Definition 9.3.1. Let 𝑃 be a Suslin forcing.

(1) A virtual condition 𝑝 ̄ in 𝑃 is placid if in every ambient forcing extension, for
every pair 𝑉[𝐻0 ], 𝑉[𝐻1 ] of generic extensions of 𝑉 such that 𝑉[𝐻0 ]∩𝑉[𝐻1 ] =
𝑉, any two conditions 𝑝0 , 𝑝1 ≤ 𝑝 ̄ in the respective models 𝑉[𝐻0 ], 𝑉[𝐻1 ] are
compatible in 𝑃.
(2) The poset 𝑃 is placid if below every condition 𝑝 ∈ 𝑃 there is a virtual condition
𝑝 ̄ ≤ 𝑝 which is placid.
As an initial example, consider the poset 𝑃 of countable functions from 2𝜔 to 2 ordered
by reverse inclusion. Its balanced virtual conditions are classified by total functions
from 2𝜔 to 2. It turns out that every such a virtual condition 𝑝 ̄ is placid. If 𝑉[𝐻0 ]
and 𝑉[𝐻1 ] are generic extensions such that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 and 𝑝0 ∈ 𝑉[𝐻0 ] and
𝑝1 ∈ 𝑉[𝐻1 ] are conditions stronger than 𝑝,̄ then 𝑝0 ∪𝑝1 is a function since dom(𝑝0 )⧵𝑉
and dom(𝑝1 ) ⧵ 𝑉 are disjoint sets and the functions 𝑝0 , 𝑝1 agree on the entries from 𝑉.
Therefore, the conditions 𝑝0 , 𝑝1 are compatible as desired.
Placid posets share many preservation properties. To state the main cardinality
preserving result of this section, we use a standard parlance.
Definition 9.3.2. (ZF) The phrase “the turbulent divide is preserved” denotes
the following statement: Let 𝐸 be an analytic equivalence relation on a Polish space
induced as an orbit equivalence relation of a turbulent Polish group action. Let 𝐹 be a
virtually placid analytic equivalence relation on a Polish space. Then |𝐸| ≰ |𝐹|.
The following theorem is stated using the standard Convention 1.7.18.
Theorem 9.3.3. In cofinally placid extensions of the symmetric Solovay model, the
turbulent divide is preserved.
Proof. Let Γ be a Polish group, turbulently acting on a Polish space 𝑋, resulting
in the equivalence relation 𝐸. Let 𝐹 be a virtually placid orbit equivalence relation on
a Polish space 𝑌 . Let 𝑃 be a Suslin forcing and let 𝜅 be an inaccessible cardinal such
that 𝑃 is cofinally placid below 𝜅. Let 𝑊 be a symmetric Solovay model derived from 𝜅
and work in the model 𝑊. Suppose towards a contradiction that there exist a 𝑃-name
𝜏 and a condition 𝑝 ∈ 𝑃 forcing 𝜏 to be an injection from the 𝐸-quotient space to the
𝐹-quotient space. The condition 𝑝 as well as the name 𝜏 must be definable from some
ground model parameters together with a parameter 𝑧 ∈ 2𝜔 . Use the assumptions to
find an intermediate model 𝑉[𝐾], which is obtained from 𝑉 by a poset of cardinality
smaller than 𝜅, contains 𝑧 and in which the poset 𝑃 is placid.
Work in the model 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be a virtual condition in 𝑃 which is weakly
placid. Let 𝑃𝑋 be the poset for adding a Cohen point of the space 𝑋. That is, 𝑃𝑋 is the
poset of all nonempty open subsets of 𝑋 ordered by inclusion, adding a point 𝑥̇ ∈ 𝑋.
There must be a poset 𝑅 of cardinality smaller than 𝜅 and 𝑃𝑋 ×𝑅-names 𝜎 for an element
of the poset 𝑃 stronger than 𝑝 ̄ and 𝜂 for an element of 𝑌 such that 𝑃𝑋 × 𝑅 ⊩ Coll(𝜔, <
𝜅) ⊩ 𝜎 ⊩𝑃 𝜏([𝑥]̇ 𝐸 ) = [𝜂]𝐹 . There are two cases.
Case 1. There is a nonempty open set 𝑂 ⊂ 𝑋 and a condition 𝑟 ∈ 𝑅 such that the name
𝜂 is 𝐹-pinned below ⟨𝑂, 𝑟⟩. In this case, let 𝑥0 , 𝑥1 ∈ 𝑋 and 𝐻0 , 𝐻1 ⊂ 𝑅 be points in 𝑂 and
filters on 𝑅 containing 𝑟 mutually generic over the model 𝑉[𝐾]. Let 𝑝0 = 𝜎/𝑥0 , 𝐻0 ∈
𝑃 ∩ 𝑉[𝐾][𝑥0 ][𝐻0 ] and 𝑝1 = 𝜎/𝑥1 , 𝐻1 ∈ 𝑃 ∩ 𝑉[𝐾][𝑥1 ][𝐻1 ] and let 𝑦0 = 𝜂/𝑥0 , 𝐻0 and
𝑦1 = 𝜂/𝑥1 , 𝐻1 .
The points 𝑥0 , 𝑥1 ∈ 𝑋 are mutually Cohen generic, and since their respective 𝐸-
classes are meager, it must be the case that they are unrelated. By the case assumption,
the points 𝑦0 , 𝑦1 ∈ 𝐹 are 𝐹-related. By the balance of the condition 𝑝,̄ the conditions
𝑝0 , 𝑝1 are compatible in the poset 𝑃. Now, the forcing theorem applied in the model
𝑉[𝐾] shows that in the model 𝑊, the lower bound of 𝑝0 , 𝑝1 forces in 𝑃 that 𝜏([𝑥0 ]𝐸 )
and 𝜏([𝑥1 ]𝐸 ) are both equal to [𝑦0 ]𝐹 , contradicting the injectivity assumption on 𝜏.
Case 2. Case 1 fails. This is to say that 𝜂 is forced not to be a realization of any 𝐹-pinned
class of 𝑉[𝐾]. Let 𝑃Γ be the Cohen poset on the Polish group Γ and let 𝑥0 ∈ 𝑋 and 𝛾 ∈ Γ
be points mutually generic for 𝑃𝑋 , 𝑃Γ over the model 𝑉[𝐾], and write 𝑥1 = 𝛾 ⋅ 𝑥0 .
Since the action of the group is a continuous open map from Γ × 𝑋 to 𝑋, the
point 𝑥1 is 𝑃𝑋 -generic over the model 𝑉[𝐾] by Proposition 3.1.1 applied in 𝑉[𝐾]. By
Theorem 3.2.2, 𝑉[𝐾][𝑥0 ] ∩ 𝑉[𝐾][𝑥1 ] = 𝑉[𝐾] holds. Let 𝐻0 , 𝐻1 ⊂ 𝑅 be filters mu-
tually generic over the model 𝑉[𝐾][𝛾, 𝑥0 ]. By the mutual genericity, 𝑉[𝐾][𝑥0 ][𝐻0 ] ∩
𝑉[𝐾][𝑥1 ][𝐻1 ] = 𝑉[𝐾] holds. Write 𝑝0 = 𝜎/(𝑥0 , 𝐻0 ) and 𝑝1 = 𝜎/(𝑥1 , 𝐻1 ), and also
𝑦0 = 𝜂/(𝑥0 , 𝐻0 ) and 𝑦1 = 𝜂/(𝑥1 , 𝐻1 ).
By their initial choice, the points 𝑥0 , 𝑥1 ∈ 𝑋 are 𝐸-related. By the virtual placidity
assumption on the equivalence relation 𝐹, the points 𝑦0 , 𝑦1 ∈ 𝑌 are not 𝐹-related: if
they were, they would be realizations of some virtual 𝐹-class in 𝑉[𝐾], contradicting the
case assumption. By the placidity assumption on the virtual condition 𝑝,̄ the conditions
𝑝0 , 𝑝1 have a common lower bound. Now, the forcing theorem applied in 𝑉[𝐾] shows
that in the model 𝑊, the lower bound of 𝑝0 , 𝑝1 forces in 𝑃 that 𝜏([𝑥0 ]𝐸 ) must be equal
simultaneously to [𝑦0 ]𝐹 and [𝑦1 ]𝐹 . This is a contradiction, as 𝜏 is forced to be a function.
□
Other preservation properties of placid forcings are proved in Section 12.3 and in Sec-
tion 12.2, based on the observation (Theorem 12.2.8) that placid forcings are included
in the much wider class of Bernstein balanced forcings.
It is now time to provide a long but not exhaustive list of examples with their as-
sociated corollaries.
Example 9.3.4. Suppose that 𝒦 is a fragmented Borel simplicial complex on a
Polish space 𝑋. The poset 𝑃 = 𝑃𝒦 is placid and every balanced virtual condition is
placid. To see this, revisit the proof of Theorem 6.2.3 and note that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉
was the only feature used of mutually generic extensions 𝑉[𝐻0 ], 𝑉[𝐻1 ].
The following corollaries use the fragmented simplicial complexes identified in Exam-
ples 6.3.6 and 6.3.7.
Corollary 9.3.5. Let 𝑋 be a Borel vector space over a countable field Φ.
(1) Let 𝑃 be the poset of countable subsets of 𝑋 linearly independent over Φ, ordered
by reverse inclusion–Example 6.3.6. In the 𝑃-extension of the symmetric Solovay
model, the turbulent divide is preserved.
(2) It is consistent relatively to an inaccessible cardinal that ZF+DC holds, 𝑋 has a
basis, yet the turbulent divide is preserved.
Corollary 9.3.6. Let Γ be a Borel graph on a Polish space 𝑋.
(1) Let 𝑃 be the poset of acyclic countable subsets of Γ, ordered by reverse inclusion–
Example 6.3.7. In the 𝑃-extension of the symmetric Solovay model, the turbulent
divide is preserved.
9.3. THE TURBULENT DIVIDE 191
(2) It is consistent relatively to an inaccessible cardinal that ZF+DC holds, Γ con-

tains a maximal acyclic subgraph, yet the turbulent divide is preserved.
Example 9.3.7. Suppose that 𝐸, 𝐹 are Borel virtually placid equivalence relations
on the respective Polish spaces 𝑋, 𝑌 . Suppose that 𝜆(𝐸) ≤ 𝜆(𝐹). Then the 𝐸, 𝐹-collapse
poset of Definition 6.4.1 is placid, and every balanced virtual condition is placid.
Example 9.3.8. Suppose that 𝐸 ⊂ 𝐹 are Borel equivalence relations on a Pol-
ish spaces 𝑋, with 𝐹 placid. The 𝐸, 𝐹-transversal poset of Definition 6.4.4 is placid,
and every balanced virtual condition is placid. In particular, if 𝐹 is a countable Borel
equivalence relation, the poset for adding an 𝐹-transversal is placid.
Proof. The proof of Theorem 6.4.5 uses only one consequence of mutual generic-
ity: the two mutually generic extensions 𝑉[𝐻0 ], 𝑉[𝐻1 ] do not share any 𝐹-class which
is not represented in the ground model. In the case of a placid equivalence relation 𝐸,
this is implied by the assumption that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 by the definition of placid-
ity. □
Corollary 9.3.9. Suppose that 𝐸 is a Borel placid equivalence relation on a Polish
space 𝑋.
(1) In the extension of the symmetric Solovay model by the transversal poset for 𝐸
of Example 6.4.6, the turbulent divide is preserved.
(2) It is consistent relatively to an inaccessible cardinal that ZF+DC holds, 𝐸 has a
transversal, yet the turbulent divide is preserved.
The posets which select a structure on each 𝐸-class for a countable Borel equivalence
relation 𝐸 are placid by Example 9.3.8, resulting in many corollaries of the following
kind.
Corollary 9.3.10. Suppose that 𝐸 is a countable Borel equivalence relation on a
Polish space 𝑋 with infinite classes.
(1) In the extension of the symmetric Solovay model by the ℤ-action poset of Exam-
ple 6.4.9, the turbulent divide is preserved.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, 𝐸 is an
orbit equivalence of a (discontinuous) action of ℤ, yet the turbulent divide is
preserved.
Example 9.3.11. The circular hypergraph coloring posets of Definition 8.2.7 are
placid (under CH) and every balanced virtual condition is placid. To see this, revisit
the proof of Theorem 8.2.8 and note that 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 was the only feature used
of mutually generic extensions 𝑉[𝐻0 ], 𝑉[𝐻1 ].
Corollary 9.3.12. Let Γ be a circular hypergraph of arity three on a Polish space
𝑋.
(1) In the extension of the symmetric Solovay model by the Γ-coloring poset of Defi-
nition 8.2.7, the turbulent divide is preserved;
(2) it is consistent relative to an inaccessible cardinal that ZF+DC holds, the chro-
matic number of Γ is countable, yet the turbulent divide is preserved.
Example 9.3.13. Let 𝑋 be a Borel vector space over a countable field Φ and let 𝑃
be the associated Hamel decomposition forcing of Definition 8.2.16. Then, under CH,
𝑃 is placid and every balanced virtual condition is placid. To see this observe that the
proof of Theorem 8.2.17 used only the consequence 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 for mutually
generic filters 𝐻0 , 𝐻1 .

(1) In the extension of the symmetric Solovay model by the Hamel decomposition
poset, the turbulent divide is preserved;
(2) it is consistent relatively to an inaccessible cardinal that ZF+DC holds, there
is a decomposition of 𝑋 into countably many pieces, each of which is linearly
independent, yet the turbulent divide is preserved.
Example 9.3.15. Suppose that ℱ is a Fraissé class of structures in finite relational

language, with strong amalgamation. Let 𝐸 be a virtually placid equivalence relation
on a Polish space 𝑋. Let 𝑃 be the poset for adding an ℱ-structure on the quotient
space 𝑋 with countable approximations of Definition 8.7.3. Then 𝑃 is placid, and every
balanced virtual condition is placid.
Corollary 9.3.16. Let 𝐸 be a Borel virtually placid equivalence relation on a Polish

space 𝑋.
(1) In the extension of the symmetric Solovay model by the linearization poset for 𝐸
of Example 8.7.5, the turbulent divide is preserved;
(2) it is consistent relatively to an inaccessible cardinal that ZF+DC holds, the 𝐸-
quotient space is linearly ordered, yet the turbulent divide is preserved.
Example 9.3.17. Suppose that 𝑋 is a Polish space and 𝑃 is the Kurepa poset on it
as isolated in Definition 8.5.2. Then 𝑃 is placid, and every balanced virtual condition is
placid. To see this observe that the proof of Theorem 8.5.3 used only the consequence
𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉 for mutually generic filters 𝐻0 , 𝐻1 .

(1) In the extension of the symmetric Solovay model by the Kurepa poset, the turbu-
lent divide is preserved;
(2) it is consistent relatively to an inaccessible cardinal that ZF+DC holds, there is
a Kurepa family on 𝑋, yet the turbulent divide is preserved.
We conclude this section with several non-examples.
Example 9.3.19. Let 𝐸 be the equivalence relation on 2𝜔 connecting sets 𝑥, 𝑦 if

1
Σ{ ∶ 𝑛 ∈ 𝑥Δ𝑦} is finite. 𝐸 is a Borel orbit equivalence relation of a turbulent Polish
𝑛+1
group action; it is well-known to be pinned. Let 𝑃 be the poset of countable partial
𝐸-transversals ordered by reverse inclusion. The poset 𝑃 is balanced by Theorem 6.4.2,
but not placid: in fact, it is designed to collapse the turbulent divide as it forces |𝐸| ≤
|2𝜔 |.
Example 9.3.20. Let 𝑋 be an uncountable Polish field and 𝐹 ⊂ 𝑋 be a count-

able subfield. The poset 𝑃 of countable subsets of 𝑋 which are algebraically indepen-
dent over 𝐹, with the reverse inclusion ordering is balanced. It is not placid by The-
orem 12.3.12 below. We do not know if in the 𝑃-extension of the symmetric Solovay
model, the turbulent divide is preserved.
9.4. THE ORBIT DIVIDE 193
Example 9.3.21. The poset 𝑃 of infinite subsets of 𝜔 ordered by inclusion is bal-

anced. It is not placid by Theorem 12.2.3 below. We do not know if in the 𝑃-extension
of the symmetric Solovay model, the turbulent divide is preserved.
9.4. The orbit divide

It is well-known that 𝔼1 is not Borel reducible to any orbit equivalence relation
[54, Theorem 11.8.1]. It is then tempting to think that in many models which we study,
|𝔼1 | cannot be smaller than |𝐸| where 𝐸 is an orbit equivalence relation. This question is
with some success addressed in the present section. The following definition connects
coherent sequences of generic extensions of Section 4.3 with Suslin forcings.
Definition 9.4.1. Let 𝑃 be a Suslin forcing. A nest below a condition 𝑝 ∈ 𝑃 is
a choice-coherent sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ of generic extensions of 𝑉 and a sequence
⟨𝑝𝑛̄ ∶ 𝑛 ≤ 𝜔⟩ so that
(1) 2𝜔 ∩ 𝑀𝑛 ≠ 2𝜔 ∩ 𝑀𝑛+1 for all 𝑛 ∈ 𝜔;
(2) 𝑝0̄ ≤ 𝑝1̄ ≤ ⋯ ≤ 𝑝𝜔̄ ≤ 𝑝 where 𝑝𝑛̄ for each 𝑛 ∈ 𝜔 is a balanced virtual
condition in 𝑀𝑛 and 𝑝𝜔̄ is a balanced virtual condition in the intersection
model 𝑀𝜔 = ⋂𝑛 𝑀𝑛 .
See Figure 9.4.1. The relation ≤ above refers to the natural ordering of virtual condi-
tions as in Definition 5.1.9; it is absolute throughout all forcing extensions and so it
does not matter in which model we evaluate it. Note that the virtual condition 𝑝𝑛+1 ̄
will be balanced in 𝑀𝑛+1 , but in a typical case loses its balance in the model 𝑀𝑛 .
Definition 9.4.2. Let 𝑃 be a Suslin forcing. The poset 𝑃 is nested balanced if it
has a nest below every condition.
As a simple initial example, let 𝑃 be the poset of all countable functions from 2𝜔 to
2, ordered by reverse inclusion. Its balanced virtual conditions are classified by total
functions from 2𝜔 to 2. Now, let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a coherent sequence of models and
𝑝 ∈ 𝑀𝜔 = ⋂𝑛 𝑀𝑛 be a condition in 𝑃. Then the functions 𝑝𝑛̄ ∈ 𝑀𝑛 for 𝑛 ≤ 𝜔 obtained
in the model 𝑀𝑛 from 𝑝 by extending it by zero values at every possible point 𝑥 ∈ 2𝜔
correspond to balanced virtual conditions in every model 𝑀𝑛 and 𝑝 ≥ 𝑝𝜔̄ ≥ ⋯ ≥ 𝑝1̄ ≥
𝑝0̄ .
To state the results of this section succintly, we establish a standard parlance.
Definition 9.4.3. (ZF) The phrase “orbit divide is preserved” denotes the follow-
ing statement. Let 𝐸 be an orbit equivalence relation on a Polish space induced as an
orbit equivalence relation of a Polish group action. Then |𝔼1 | ≰ |𝐸|.
The central theorem can now be stated easily using Convention 1.7.18.
Theorem 9.4.4. In nested balanced extensions of the symmetric Solovay model, the
orbit divide is preserved.
Proof. Suppose that 𝑌 is a Polish space, Γ is a Polish group and Γ continuously
acts on 𝑌 , inducing an orbit equivalence relation 𝐸. Suppose that 𝜅 is an inaccessible
cardinal and 𝑃 is a Suslin forcing which is nested balanced below 𝜅. Suppose also that
𝑊 is a symmetric Solovay model derived from 𝜅 and in 𝑊, 𝜏 is a 𝑃-name and 𝑝 ∈ 𝑃
is a condition forcing 𝜏 to be a function from the 𝔼1 -quotient space to the 𝐸-quotient
M0
M1
M2
M3
Figure 9.4.1. A nest of models and balanced virtual conditions.
space. We must find a stronger condition and two distinct 𝔼1 classes which are forced
by the stronger condition to be mapped to the same 𝐸-class.
The objects Γ, 𝑌 , 𝑝 and 𝜏 are all definable in the model 𝑊 from parameters in the
ground model plus a parameter 𝑧 ∈ 2𝜔 . Use the assumptions to find an intermediate
forcing extension 𝑉[𝐾] by a poset of cardinality smaller than 𝜅 such that 𝑧 ∈ 𝑉[𝐾]
and 𝑉[𝐾] has a nest below 𝑝. Still working in 𝑊, find the nest. This is a sequence
⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ of generic extensions of 𝑉[𝐾] together with a sequence ⟨𝑝𝑛̄ ∶ 𝑛 ≤ 𝜔⟩ of
balanced virtual conditions below 𝑝 satisfying the demands of Definition 9.4.1.
Use the coherence of the sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ to find a well-ordering ≺ of 2𝜔 in
𝑀0 such that for each 𝑛 ∈ 𝜔, ≺↾ 𝑀𝑛 ∈ 𝑀𝑛 holds. Let 𝑧𝑛 ∈ 2𝜔 be the ≺-least element
of 𝑀𝑛 ⧵ 𝑀𝑛+1 for every 𝑛 ∈ 𝜔 and let 𝑥𝑛 ∈ 𝑋 = (2𝜔 )𝜔 be the point such that 𝑥𝑛 (𝑚)
is the zero binary sequence if 𝑚 < 𝑛 and 𝑥𝑛 (𝑚) = 𝑧𝑚 if 𝑚 ≥ 𝑛; thus 𝑥𝑛 ∈ 𝑀𝑛 . The
points 𝑥𝑛 ∈ 𝑋 for 𝑛 ∈ 𝜔 are pairwise 𝔼1 -equivalent; at the same time, they have no
𝔼1 -equivalent in the model 𝑀𝜔 = ⋂𝑛 𝑀𝑛 , since none of the points 𝑧𝑛 belong to 𝑀𝜔 .
By the forcing theorem, for each number 𝑛 ∈ 𝜔, in the model 𝑀𝑛 there must be
a poset 𝑅𝑛 of cardinality smaller than 𝜅, an 𝑅𝑛 -name 𝜎𝑛 for a condition in 𝑃 stronger
than 𝑝𝑛̄ and an 𝑅𝑛 -name 𝜂𝑛 for an element of 𝑌 such that 𝑅𝑛 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎𝑛 ⊩𝑃
𝜏([𝑥𝑛̌ ]𝔼1 ) = [𝜂𝑛 ]𝐸 .
Claim 9.4.5. For 𝑛 ∈ 𝜔, the pair ⟨𝑅𝑛 , 𝜂𝑛 ⟩ is an 𝐸-pin.
Proof. If this failed for some number 𝑛 ∈ 𝜔, then in the model 𝑊 there would
be filters 𝐻0 , 𝐻1 ⊂ 𝑅𝑛 mutually generic over the model 𝑀𝑛 such that the points 𝑦0 =
𝜎𝑛 /𝐻0 , 𝑦1 = 𝜎𝑛 /𝐻1 ∈ 𝑌 are 𝐸-unrelated. Let 𝑝0 = 𝜎𝑛 /𝐻0 and 𝑝1 = 𝜎𝑛 /𝐻1 be conditions
in the poset 𝑃; they are compatible by the balance of 𝑝𝑛̄ . By the forcing theorem applied
in the models 𝑀𝑛 [𝐻0 ] and 𝑀𝑛 [𝐻1 ], their lower bound forces in 𝑃 that 𝜏([𝑥𝑛̌ ]𝔼1 ) is equal
simultaneously to [𝑦0̌ ]𝐸 and [𝑦1̌ ]𝐸 . This is impossible. □
Claim 9.4.6. For 𝑛 ∈ 𝑚 ∈ 𝜔, the 𝐸-pins ⟨𝑅𝑛 , 𝜂𝑛 ⟩ and ⟨𝑅𝑚 , 𝜂𝑚 ⟩ are equivalent.
Proof. If this failed for some numbers 𝑛 ∈ 𝑚 ∈ 𝜔, then in the model 𝑊 there
would be filters 𝐻0 ⊂ 𝑅𝑛 , 𝐻1 ⊂ 𝑅𝑚 mutually generic over the model 𝑀𝑛 such that
the points 𝑦0 = 𝜎𝑛 /𝐻0 , 𝑦1 = 𝜎𝑚 /𝐻1 ∈ 𝑌 are 𝐸-unrelated. Let 𝑝0 = 𝜎𝑛 /𝐻0 and 𝑝1 =
𝜎𝑚 /𝐻1 be conditions in the poset 𝑃; they are compatible by the balance of 𝑝𝑚 ̄ since
𝑝0 ≤ 𝑝𝑛̄ ≤ 𝑝𝑚 ̄ by demand (2) of Definition 9.4.1. By the forcing theorem applied in
the models 𝑀𝑛 [𝐻0 ] and 𝑀𝑚 [𝐻1 ], their lower bound forces in 𝑃 that 𝜏([𝑥𝑛̌ ]𝔼1 ) = [𝑦0̌ ]𝐸
̌ ]𝔼1 ) = [𝑦1̌ ]𝐸 . This is impossible since 𝑥𝑛 𝔼1 𝑥𝑚 holds.
and 𝜏([𝑥𝑚 □
By Theorem 4.3.6, there is an 𝐸-pin ⟨𝑅, 𝜂⟩ ∈ 𝑀𝜔 which is equivalent to all the
pins ⟨𝑅𝑛 , 𝜂𝑛 ⟩ for 𝑛 ∈ 𝜔. Still in 𝑀𝜔 , find a poset 𝑄 generating the model 𝑀0 , a 𝑄-
name 𝑥̇ for the sequence 𝑥0 , and a 𝑄-name 𝑅̇ 0 for the poset 𝑅0 (strictly speaking, we
also need 𝑄-names for 𝜎0 and 𝜂0 ). By the forcing theorem, there must be a condition
𝑞 ∈ 𝑄 which forces the following: 𝑥̇ has no 𝔼1 -equivalent in 𝑀𝜔 , 𝑅̇ 0 ⊩ 𝜎0 ≤ 𝑝𝜔̄
and 𝑅̌ × 𝑅̇ 0 ⊩ 𝜂 𝐸 𝜂0 . Note that the last statement means that the name 𝜂0 is 𝐸-
pinned on the iteration 𝑄 ↾ 𝑞 ∗ 𝑅̇ 0 . In the model 𝑊, let 𝐻0 , 𝐻1 ⊂ 𝑄 ↾ 𝑞 ∗ 𝑅̇ 0 be filters
mutually generic over the model 𝑀𝜔 , and write 𝑝0 = 𝜎0 /𝐻0 , 𝑝1 = 𝜎0 /𝐻1 , 𝑥0̄ = 𝑥/𝐻 ̇ 0,
𝑥1̄ = 𝑥/𝐻
̇ 1 , 𝑦0 = 𝜂0 /𝐻0 and 𝑦1 = 𝜂0 /𝐻1 . The balance of the virtual condition 𝑝𝜔̄
implies that 𝑝0 , 𝑝1 ∈ 𝑃 are compatible conditions. Since 𝔼1 is a pinned equivalence
relation, the points 𝑥0̄ , 𝑥1̄ ∈ 𝑋 are 𝔼1 -unrelated. Since the name 𝜂0 was pinned on the
iteration 𝑄 ↾ 𝑞 ∗ 𝑅̇ 0 , the points 𝑦0 , 𝑦1 are 𝐸-related. In total, in the model 𝑊, the lower
bound of the conditions 𝑝0 , 𝑝1 forces that 𝜏([𝑥0̄ ]𝔼1 ) = 𝜏([𝑥1̄ ]𝔼1 ) = [𝑦0 ]𝐸 , completing
the proof. □
It turns out that one large class of nested balanced posets has already been isolated in
Definition 9.2.1:
Example 9.4.7. Every compactly balanced Suslin forcing is nested balanced.
Proof. Let 𝑃 be a compactly balanced Suslin forcing and 𝑝 ∈ 𝑃 be a condition. Let
⟨𝑈, 𝑥𝑛 ∶ 𝑛 ∈ 𝜔⟩ be generic for the product of 𝒫(𝜔) modulo finite with the full support
product of countably many copies of Sacks forcing. Let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be the sequence
of models determined by 𝑀𝑛 = 𝑉[𝑈, 𝑦𝑚 ∶ 𝑚 ≥ 𝑛]; this is a choice-coherent sequence
by Theorem 4.3.5 or Example 4.3.4 applied in the model 𝑉[𝑈]. We will produce a
descending sequence of balanced virtual conditions as required by Definition 9.4.1.
It is well known [97] that the Sacks real product adds no independent reals, and
therefore, by a genericity argument, 𝑈 generates an ultrafilter on 𝜔 in the model 𝑀0 .
The generating set of 𝑈 is present already in the model 𝑀𝜔 = ⋂𝑛 𝑀𝑛 . For each number
𝑛 ∈ 𝜔, use the extension property (2) of Definition 9.2.1 repeatedly to find a sequence
⟨𝑝(𝜔,
̄ 𝑛), 𝑝(𝑚,
̄ 𝑛) ∶ 𝑚 ≤ 𝑛⟩ such that each 𝑝(𝜔, ̄ 𝑛) is a balanced virtual condition in
𝑀𝜔 , each 𝑝(𝑚,̄ 𝑛) is a balanced virtual condition in the model 𝑀𝑚 , and 𝑝 ≥ 𝑝(𝜔,
̄ 𝑛) ≥
𝑝(𝑛,
̄ 𝑛) ≥ 𝑝(𝑛 ̄ − 1, 𝑛) ≥ 𝑝(𝑛 ̄ − 2, 𝑛) ≥ ⋯ ≥ 𝑝(0, ̄ 𝑛); also, demand that each virtual
condition 𝑝(𝑚, ̄ 𝑛) is selected to be ≺-minimal where ≺ in 𝑀0 is some coherent well-
ordering of the set of virtual conditions on 𝑃. It is not difficult to see that the resulting
system is coherent in the sense that for each 𝑛 ≤ 𝜔, the system ⟨𝑝(𝑚, 𝑘) ∶ 𝑚 = 𝜔 and
𝑘 ∈ 𝜔 or 𝑘 ≥ 𝑚 ≥ 𝑛⟩ belongs to the model 𝑀𝑛 .
Finally, use the compactness of the space of balanced virtual conditions to define
𝑝𝑛̄ for 𝑛 ≤ 𝜔 to be the 𝑈-limit of the sequence ⟨𝑝(𝑛, ̄ 𝑘) ∶ 𝑘 ≥ 𝑛⟩. Each 𝑝𝑛̄ is a bal-
anced virtual condition in the model 𝑀𝑛 . The closedness demands (1) and (3) of Defi-
nition 9.2.1 imply that 𝑝𝑚 ̄ ≤ 𝑝𝑛̄ ≤ 𝑝 whenever 𝑚 ≤ 𝑛 ≤ 𝜔. It follows that the sequence
⟨𝑝𝑛̄ ∶ 𝑛 ≤ 𝜔⟩ is as required in Definition 9.4.1. □
Corollary 9.4.8.
(1) Let 𝑃 be the poset of infinite subsets of 𝜔 ordered by inclusion. In the 𝑃-extension
of the symmetric Solovay model, the orbit divide is preserved.
Ramsey ultrafilter on 𝜔, and the orbit divide is preserved.
Proof. This is a conjunction of Example 9.2.4 and Theorem 9.4.4. □
Question 9.4.9. Is there a Borel (or even 𝐹𝜍 ) ideal 𝐼 on 𝜔 such that the existence
of an ultrafilter disjoint from 𝐼 implies in ZF+DC that |𝔼1 | ≤ |𝐸| for some orbit equiv-
alence relation 𝐸?
(1) In the extension of the Solovay model by the 𝐸-linearization poset of Exam-
ple 8.7.5, the orbit divide is preserved.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, the 𝐸-
quotient space is linearly ordered, and the orbit divide is preserved.
Proof. This is just a conjunction of Example 8.7.5, Example 9.2.11 and Theo-
rem 9.4.4. □
Corollary 9.4.11. Let Γ, Δ be abelian Polish groups, with Γ uncountable and
torsion-free and Δ compact, nontrivial, and divisible.
(1) Let 𝑃(Γ, Δ) be the poset of Definition 8.3.1. In the 𝑃(Γ, Δ)-extension of the sym-
metric Solovay model, the orbit divide is preserved.
discontinuous homomorphism from Γ to Δ, the orbit divide is preserved.
Question 9.4.12. Does the existence of a discontinuous homomorphism from ℝ
to ℝ imply in ZF+DC that |𝔼1 | ≤ |𝐸| holds for some orbit equivalence relation 𝐸, or for
𝐸 = 𝔽2 in particular? That 𝔼1 has a countable complete section?
(1) In the extension of the Solovay model by the Kurepa poset of Definition 8.5.2, the
orbit divide is preserved.

Kurepa family on 𝑋, and the orbit divide is preserved.
Another group of nested balanced posets is obtained from orbit equivalence relations:
Example 9.4.14. Let 𝐸 ⊂ 𝐹 be Borel equivalence relations on a Polish space 𝑋

such that 𝐹 is pinned and Borel reducible to an orbit equivalence relation. Let 𝑃 be the
𝐸, 𝐹-transversal poset of Definition 6.4.4. Then 𝑃 is nested balanced.
Proof. By Theorem 6.4.5, the balanced virtual conditions are classified by func-
tions selecting, for each 𝐹-class, a single virtual 𝐸-class which is forced to be a subset
of the 𝐹-class. Let 𝑝 ∈ 𝑃 be a condition. To find a nest below 𝑝, consider any choice-
coherent sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ consisting of generic extensions of the ground model
such that for every 𝑛 ∈ 𝜔, 2𝜔 ∩ 𝑀𝑛 ⧵ 𝑀𝑛+1 ≠ 0–the choice-coherent sequence of mod-
els obtained from the infinite product of Sacks reals will do. Let ≺ be a coherent well-
ordering of the space 𝑋. To find a coherent sequence of balanced virtual conditions,
in the model 𝑀0 consider the function 𝑓 on the 𝐹-quotient space defined as follows:
if 𝑐 is an 𝐹-class mentioned in 𝑝, let 𝑓(𝑐) be the 𝐸-class 𝑑 ⊂ 𝑐 which 𝑝 selects. If 𝑐 is
a class represented in 𝑀𝜔 but not mentioned in 𝑝, then let 𝑓(𝑐) be the 𝐸-class of the
≺-first representative of 𝑐 in the model 𝑀𝜔 . If 𝑛 ∈ 𝜔 is the largest number such that 𝑐
is represented in 𝑀𝑛 , then let 𝑓(𝑐) be the 𝐸-class of the ≺-first representative of 𝑐 in the
model 𝑀𝑛 . Now, by Theorem 4.3.6, this defines the function 𝑓 on all 𝐹-equivalence
classes represented in 𝑀0 . It is also clear that for each 𝑛 ≤ 𝜔, 𝑓 ↾ 𝑀𝑛 ∈ 𝑀𝑛 . For each
𝑛 ≤ 𝜔, let 𝑝𝑛̄ be the virtual balanced virtual condition in the model 𝑀𝑛 associated with
the function 𝑓 ↾ 𝑀𝑛 by Theorem 6.4.5. The system ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔, 𝑝𝑛̄ ∶ 𝑛 ≤ 𝜔⟩ is the
sought nest below 𝑝. □
Corollary 9.4.15. Let 𝐸 be a Borel pinned orbit equivalence relation on a Polish

space 𝑋.
(1) Let 𝑃 be the transversal poset of Example 6.4.6. In the 𝑃-extension of the sym-
metric Solovay model, the orbit divide is preserved.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, 𝐸 has a
transversal, and the orbit divide is preserved.
The posets selecting a structure on each 𝐸-class for a countable Borel equivalence re-
lation 𝐸 are always nested balanced by virtue of Example 9.4.14. The following is a
sample corollary.
Corollary 9.4.16. Let 𝐸 be a countable Borel equivalence relation on a Polish space

𝑋, with all orbits infinite.
(1) Let 𝑃 be the ℤ-action poset of Example 6.4.9. In the 𝑃-extension of the symmetric
Solovay model, the orbit divide is preserved.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, 𝐸 is in-
duced as an orbit equivalence relation of a discontinuous ℤ-action, and the orbit
divide is preserved.
The determination of the nested balanced status of the posets adding a maximal 𝒦-set
for a Borel fragmented simplicial complex 𝒦 is much more challenging. The ultimate
limitation is the surprising Corollary 9.4.34 below, showing in ZF+DC that if ℝ has a
Hamel basis, then 𝔼1 has a complete countable section, and therefore |𝔼1 | ≤ |𝔽2 | holds.
Thus, we have to resort to partial results.
Example 9.4.17. Let 𝒦 be a Borel simplicial complex on a Polish space 𝑋 of Borel
coloring number ℵ1 as in Definition 6.2.12. The poset 𝑃 = 𝑃𝒦 is nested balanced.
Proof. Let 𝑝 ∈ 𝑃 be a condition. Replacing 𝒦 with the simplicial complex of all
finite sets 𝑎 ⊂ 𝑋 such that 𝑝 ∪ 𝑎 is a 𝒦-set if necessary, we may and will assume that
𝑝 = 0. Let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a choice-coherent sequence of generic extensions. We will
show that there is a sequence ⟨𝑝𝑛̄ ∶ 𝑛 ∈ 𝜔⟩ of balanced virtual conditions satisfying the
demands of Definition 9.4.1. For notational reasons, put 𝑀𝜔+1 = 0.
Let ≺ be a coherent well-ordering of 𝒫(𝑋). For each number 𝑛 ≤ 𝜔, in the model
𝑀𝑛 form the collection ℒ𝑛 = {𝑎 ⊂ 𝑋 ∩ 𝑀𝑛 ⧵ 𝑀𝑛+1 ∶ 𝑎 is finite and in no generic
extension there exists a set 𝑏 ∈ 𝒦 such that 𝑏 ∩ 𝑀𝑛 = 0 and 𝑎 ∪ 𝑏 ∉ 𝒦}. Note that ℒ𝑛 is
a simplicial complex and a subset of 𝒦. Let 𝐵𝑛 ∈ 𝑀𝑛 be the ≺-first maximal ℒ𝑛 -set. Let
𝐴𝑛 = ⋃𝑚≥𝑛 𝐵𝑚 . Clearly, the set 𝐴𝑛 belongs to the model 𝑀𝑛 . We will argue that in the
model 𝑀𝑛 , the set 𝐴𝑛 ⊂ 𝑋 is a weakly maximal 𝒦-set in the sense of Definition 6.2.13.
Then, the sequence of balanced virtual conditions 𝑝𝑛̄ given by the sets 𝐴𝑛 forms the
required nest by Theorem 6.2.14. This is where the Borel coloring assumption is used.
First of all, the set 𝐴𝑛 ⊂ 𝑋 is indeed a 𝒦-set. To see this, assume towards a contra-
diction that it is not. Find an inclusion-minimal finite set 𝑐 ⊂ 𝐴𝑛 which is not in 𝒦, and
a maximal number 𝑚 ≥ 𝑛 such that 𝑎 = 𝑐 ∩ 𝑀𝑚 ⧵ 𝑀𝑚+1 ≠ 0. Then, 𝑎 ≠ 𝑐 must hold as
𝑎 ⊂ 𝐵𝑚 and 𝑎 ∈ 𝒦 holds. By the inclusion-minimal choice of 𝑐, 𝑏 = 𝑐 ⧵ 𝑎 ∈ 𝒦 holds
as well. Clearly, in the model 𝑀𝑚 , 𝑏 witnesses the fact that 𝑎 ∉ ℒ𝑚 , contradicting the
fact that 𝑎 ⊂ 𝐵𝑚 .
To prove the weak maximality of each set 𝐴𝑛 , suppose that 𝑥 ∈ 𝑋 is a point not
in 𝐴𝑛 , and find the number 𝑚 ≤ 𝜔 such that 𝑥 ∈ 𝑀𝑚 ⧵ 𝑀𝑚+1 . Since 𝑥 ∉ 𝐵𝑚 holds,
there have to be a finite set 𝑎 ⊂ 𝐵𝑚 , a poset 𝑄 ∈ 𝑀𝑚 and a 𝑄-name 𝜏 for an element
of 𝒦 such that 𝑀𝑚 ⊧ 𝑄 ⊩ 𝜏 ∩ 𝑀𝑚 = 0 and 𝑎̌ ∪ {𝑥}̌ ∪ 𝜏 ∉ 𝒦. It will be enough to
show that 𝑀𝑛 ⊧ 𝑄 ⊩ 𝐴𝑛̌ ∪ 𝜏 is a 𝒦-set. Suppose towards a contradiction that this fails,
and let 𝐻 ⊂ 𝑄 be a filter generic over 𝑀𝑛 , let 𝑏 = 𝜏/𝐻, and let 𝑏0 ⊂ 𝐴𝑛 and 𝑏1 ⊂ 𝑏
be inclusion-minimal finite sets such that 𝑏0 ∪ 𝑏1 ∉ 𝒦. Note that 𝜏 is a name for a
set of new points in 𝑋, so 𝑏1 ∩ 𝑀𝑛 = 0. Let 𝑘 ≥ 𝑛 be a maximal number such that
𝑏0 ∩ 𝑀𝑘 ⧵ 𝑀𝑘+1 is nonempty. Let 𝑏2 = 𝑏0 ∩ 𝑀𝑘 ⧵ 𝑀𝑘+1 and 𝑏3 = (𝑏0 ∪ 𝑏1 ) ⧵ 𝑀𝑘 , so
that 𝑏2 ∪ 𝑏3 = 𝑏0 ∪ 𝑏1 . It is immediate that in the model 𝑀𝑘 , 𝑏3 witnesses the fact that
𝑏2 ∉ ℒ, contradicting the fact that 𝑏2 ⊂ 𝐵𝑘 . □
The following two corollaries use the concepts and posets developed in Example 6.2.15
and 6.2.16.
Corollary 9.4.18. Let 𝑋 be an uncountable Polish space and 𝑓 ∶ 𝑋 → [𝑋]ℵ0 be a
Borel set mapping.
(1) Let 𝑃 be the poset of countable 𝑓-free sets ordered by reverse inclusion. In the
𝑃-extension of the symmetric Solovay model, the orbit divide is preserved.
maximal 𝑓-free set and the orbit divide is preserved.
Corollary 9.4.19. Let 𝑋 be an uncountable Polish space, let Γ be a Borel graph on

𝑋 and let 𝑛 ∈ 𝜔 be a number.
(1) Let 𝑃 be the poset of countable 𝐾𝑛 -free subsets of Γ ordered by reverse inclusion.
In the 𝑃-extension of the symmetric Solovay model, the orbit divide is preserved.
maximal 𝐾𝑛 -free subset of Γ and the orbit divide is preserved.
Example 9.4.20. Let 𝑋 be a Polish space and let 𝐺 be a Borel graph on 𝑋. Let 𝒦 be
the Borel simplicial complex on 𝐺 of finite acyclic subsets of 𝐺, and let 𝑃 = 𝑃𝒦 . Then
𝑃 is nested balanced.
Proof. Let 𝑄𝑚 for each 𝑚 ∈ 𝜔 be the countable support product of ℵ1 many

Sacks posets, and for each 𝑛 ∈ 𝜔 let 𝑅𝑛 be the countable support product Π𝑚≥𝑛 𝑄𝑚 ,
with the natural projection maps. Let 𝐻0 ⊂ 𝑅0 be a generic filter, and for each 𝑛 ∈ 𝜔
let 𝐻𝑛 = 𝐻 ∩ 𝑅𝑛 . By Example 4.3.4 and Theorem 4.3.5, the sequence ⟨𝑉[𝐻𝑛 ] ∶ 𝑛 ∈ 𝜔⟩
is a choice-coherent sequence of models of ZFC; write 𝑀𝑛 = 𝑉[𝐻𝑛 ] and 𝑀𝜔 = ⋂𝑛 𝑀𝑛 .
In view of Example 6.3.7, to complete the proof it will be enough, given an arbitrary
condition 𝑝 ∈ 𝑃 ∩ 𝑉, to find sets 𝐴𝑚 ⊂ 𝐺 for 𝑚 ≤ 𝜔 forming an inclusion-descending
sequence such that 𝑝 ⊂ 𝐴𝜔 and 𝑀𝑚 ⊧ 𝐴𝑚 ⊂ 𝐺 is a maximal acyclic subset of 𝐺 for
every 𝑚 ≤ 𝜔.
Write 𝑋𝜔 = 𝑋 ∩ 𝑀𝜔 , and for each 𝑚 < 𝑛 write 𝑋𝑚𝑛 = 𝑋𝜔 ∪ (𝑋 ∩ 𝑀𝑚 ⧵ 𝑀𝑛 ). The
following elusive claim is the main reason for the choice of the posets 𝑄𝑚 .
Claim 9.4.21. Let 𝑙 < 𝑚 < 𝑛 be natural numbers and 𝑥0 , 𝑥1 ∈ 𝑋𝑚𝑛 be vertices. If
𝑥0 , 𝑥1 are connected by a path in the graph 𝐺 ↾ 𝑋𝑙𝑛 , then they are connected by a path in
the graph 𝐺 ↾ 𝑋𝑚𝑛 .
Proof. It will be enough to show that if 𝑥0 , 𝑥1 are connected by a path in the graph
𝐺 ↾ 𝑋𝑙𝑛 whose vertices except for 𝑥0 , 𝑥1 all belong to 𝑋𝑙𝑚 , then they are connected by a
path in the graph 𝐺 ↾ 𝑋𝑚𝑛 . To this end, work in 𝑀𝑚 and let 𝐴 = {𝑎 ∈ [𝑋]<ℵ0 ∶ there
is a 𝐺-path connecting 𝑥0 , 𝑥1 using only the vertices in 𝑎}.
The set 𝐴 ⊂ [𝑋]<ℵ0 is Borel. It cannot be punctured by a countable set by a
Mostowski absoluteness argument: in the model 𝑀𝑙 there is a 𝐺-path between 𝑥0 , 𝑥1
using no vertices in 𝑀𝑚 and therefore no vertices in any given countable set in 𝑀𝑚 . By
[17, Theorem 21] applied in the model 𝑀𝑚 , there is a perfect set 𝐵 ⊂ 𝐴 in the model 𝑀𝑚
consisting of pairwise disjoint sets. By the properness of 𝑄𝑚 , there is a countable set 𝑐
of Sacks reals added by the filter 𝐻𝑚 such that 𝐵 has a code in the model 𝑉[𝑐] ⊂ 𝑀𝑚 .
Since the poset 𝑄𝑚 is a product of uncountably many copies of Sacks forcing, in 𝑀𝑚
there has to be an element 𝑎 ∈ 𝐵 which does not belong to the model 𝑀𝑛 [𝑐] ⊂ 𝑀𝑚 .
Since the sets in 𝐵 are pairwise disjoint, every element of 𝑎 would reconstruct 𝑎 over
the model 𝑀𝑛 [𝑐]. Therefore, no element of 𝑎 belongs to the model 𝑀𝑛 [𝑐]; in particular,
𝑎 ∩ 𝑀𝑛 = 0 and 𝑎 yields the desired 𝐺-path between 𝑥0 and 𝑥1 using only vertices in
𝑋𝑚𝑛 . □
Let ≺ be a coherent well-ordering of all subsets of 𝐺 in 𝑀0 . Let 𝐴𝜔 ⊂ 𝐺 be a

maximal acyclic subset of 𝐺 in the model 𝑀𝜔 such that 𝑝 ⊂ 𝐴𝜔 . For each 𝑚 ∈ 𝜔, let
𝐴𝑚𝑚+1 ∈ 𝑀𝑚 be the ≺-first set in the model 𝑀𝑚 which is a maximal acyclic subset of
𝐺 ↾ 𝑋𝑚𝑚+1 and extends 𝐴𝜔 .
Now, by induction on 𝑛−𝑚, for 𝑚 < 𝑛 define 𝐴𝑚𝑛 ∈ 𝑀𝑚 to be the ≺-first set in the
model 𝑀𝑚 which is a maximal acyclic subset of 𝐺 ↾ 𝑋𝑚𝑛 and extends both 𝐴𝑚+1,𝑛 and
𝐴𝑚,𝑛−1 . To see that this is possible, simultaneously argue by induction on 𝑛 − 𝑚 that
if 𝑚 ≤ 𝑚′ < 𝑛′ ≤ 𝑛 then 𝐴𝑚′ 𝑛′ ⊂ 𝐴𝑚𝑛 and moreover, the set 𝐴𝑚+1,𝑛 ∪ 𝐴𝑚,𝑛−1 does not
contain a cycle. The former statement follows easily by induction. The latter statement
requires the claim. A putative cycle 𝑐 ⊂ 𝐴𝑚+1,𝑛 ∪ 𝐴𝑚,𝑛−1 has to contain some edges
from both sets by the acyclicity induction hypothesis. Choose an inclusion-maximal
contiguous part 𝑑 ⊂ 𝑐 of the cycle consisting of edges in 𝐴𝑚,𝑛−1 ⧵ 𝐴𝑚+1,𝑛 . The end-
nodes of 𝑑, denote them by 𝑥0 , 𝑥1 , must be distinct because the cycle must use some
edges from the set 𝐴𝑚+1,𝑛 as well. It must also be the case that 𝑥0 , 𝑥1 ∈ 𝑋𝑚,𝑛−1 ∩
𝑋𝑚+1,𝑛 = 𝑋𝑚+1,𝑛−1 . The path 𝑑 connects the nodes 𝑥0 , 𝑥1 in the graph 𝐺 ↾ 𝑋𝑚,𝑛−1 ;
by the claim then, they have to be connected by a path in the graph 𝐺 ↾ 𝑋𝑚+1,𝑛−1 as
well, and therefore by a path 𝑒 in the set 𝐴𝑚+1,𝑛−1 . Then 𝑒 ∪ 𝑑 forms a cycle in the set
𝐴𝑚,𝑛−1 , violating the induction hypothesis.
In the end, let 𝐴𝑚 = ⋃𝑛>𝑚 𝐴𝑚𝑛 . It is clear from the coherence of the well-ordering
≺ that 𝐴𝑚 ∈ 𝑀𝑚 . The construction also guarantees that 𝑀𝑚 ⊧ 𝐴𝑚 ⊂ 𝐺 is a maximal
acyclic subset, and 𝑚 < 𝑛 implies 𝐴𝑛 ⊂ 𝐴𝑚 . The proof is complete. □
Corollary 9.4.22. Let 𝑋 be a Polish space and let 𝐺 be a Borel graph on 𝑋.
(1) Let 𝑃 be the poset of countable acyclic subsets of 𝐺 ordered by reverse inclusion.
In the 𝑃-extension of the symmetric Solovay model, the orbit divide is preserved;
(2) it is consistent relative to an inaccessible cardinal that ZF+DC holds, 𝐺 has a
maximal acyclic subset, and the orbit divide is preserved.
Coloring posets introduced Section 8.1 are typically nested balanced for nearly trivial
reasons.
Example 9.4.23. Let Γ be a Borel graph on a Polish space 𝑋 of countable coloring
number. The coloring poset 𝑃 = 𝑃Γ of Definition 8.1.1 is nested balanced.
Proof. We identify 𝑃 with its dense Suslin subset identified in Theorem 8.1.2. Let
𝑝 ∈ 𝑃 be a condition, and let ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a nontrivial choice coherent sequence
of generic extensions of 𝑉, with 𝑀𝜔 = ⋂𝑛 𝑀𝑛 . We will produce a decreasing sequence
⟨𝑝 ̄ ∶ 𝑛 ≤ 𝜔⟩ of balanced virtual conditions below 𝑝 for the respective models 𝑀𝑛 . Let
⟨𝑎𝑛 ∶ 𝑛 ≤ 𝜔⟩ be a recursive sequence of pairwise disjoint infinite subsets of 𝜔.
Claim 9.4.24. Fix 𝑛 ≤ 𝜔. In the model 𝑀𝑛 , there is a total Γ coloring 𝑑 ∶ 𝑋 → 𝜔
which extends 𝑝 and at all points 𝑥 ∈ 𝑋 ⧵ dom(𝑝), 𝑑(𝑥) ∈ 𝑎𝑛 .
Proof. Work in 𝑀𝑛 . Fix a coloring 𝑒 ∶ 𝑋 → 𝜔. Let 𝑎𝑛 = ⋃𝑖 𝑏𝑖 be a partition of
𝑎𝑛 into infinitely many infinite sets. Let 𝑑 ∶ 𝑋 → 𝜔 be a function such that 𝑝 ⊂ 𝑑 and
for all 𝑥 ∉ 𝑋 ⧵ dom(𝑝), 𝑑(𝑥) is a number in 𝑏𝑒(𝑥) which is not one of the finitely many
colors {𝑝(𝑦) ∶ ⟨𝑥, 𝑦⟩ ∈ Γ}. This is the desired coloring. □
Let ≺ be a coherent wellordering of 𝒫(𝑋 × 𝜔), and for each 𝑛 ≤ 𝜔 let 𝑑𝑛 be the ≺-
least coloring as in the claim in the model 𝑀𝑛 . Finally, in the model 𝑀0 , define a map
𝑐 ∶ 𝑋 → 𝜔 as follows: 𝑐(𝑥) = 𝑑𝑛 (𝑥) if 𝑥 ∉ dom(𝑝) and 𝑛 ≤ 𝜔 is the largest number such
that 𝑥 ∈ 𝑀𝑛 , and 𝑐(𝑥) = 𝑝(𝑥) if 𝑥 ∈ dom(𝑝). It is not difficult to check that 𝑐 is a Γ-
coloring extending 𝑝. Moreover, the coherence of the well-ordering ≺ guarantees that
for each 𝑛 ≤ 𝜔, 𝑐 ↾ 𝑀𝑛 ∈ 𝑀𝑛 holds. In each model 𝑀𝑛 for 𝑛 ≤ 𝜔, the coloring 𝑐 ↾ 𝑀𝑛 is
associated with a balanced virtual condition 𝑝𝑛̄ for the poset 𝑃Γ by Theorem 8.1.2. The
sequence ⟨𝑝𝑛̄ ∶ 𝑛 ≤ 𝜔⟩ is as desired. □
Corollary 9.4.25. Let Γ be the graph on ℝ2 connecting points 𝑥0 , 𝑥1 if they have a
nonzero rational distance.
(1) In the 𝑃Γ -extension of the symmetric Solovay model, the orbit divide is preserved.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, the chro-
matic number of Γ is countable, and the orbit divide is preserved.
Example 9.4.26. Let Γ be a Borel circular hypergraph of arity three on a Polish
space 𝑋 as in Definition 8.2.6. Let 𝑃 be the associated coloring poset of Definition 8.2.7.
The poset 𝑃 is nested balanced.
Proof. Let 𝑝 ∈ 𝑃 be any condition. Let ⟨𝑀𝑛 ∶ 𝑛 ≤ 𝜔⟩ be a generic choice-coherent
sequence such that for every 𝑛 ∈ 𝜔, the set 2𝜔 ∩ 𝑀𝑛 ⧵ 𝑀𝑛+1 is nonempty, and in
all models the Continuum Hypothesis holds. Let ≺ be a coherent well-ordering of all
functions from 𝑋 to 𝜔. Use the last part of Theorem 8.2.8 in each model 𝑀𝑛 to show
that in 𝑀𝑛 , there is a Γ-coloring extending 𝑝 such that all points not in dom(𝑝) get a
color in the set 𝜔 × {𝑛 + 1} (or in 𝜔 × {0} if 𝑛 = 𝜔). Let 𝑑𝑛 be the ≺-least such coloring.
Now, working in 𝑀𝑛 , let 𝑐𝑛 ∶ 𝑋 → 𝜔 be the map defined by 𝑐𝑛 (𝑥) = 𝑑𝜔 (𝑥) if 𝑥 ∈ 𝑀𝜔 ,
and 𝑐𝑛 (𝑥) = 𝑑𝑚 (𝑥) if 𝑥 ∈ 𝑀𝑚 ⧵ 𝑀𝑚+1 .
We claim that 𝑐𝑛 is a Γ-coloring. To see this, suppose that {𝑥0 , 𝑥1 , 𝑥2 } ∈ Γ is a triple.
Let 𝑚 ≤ 𝜔 be the largest index such that one of the points, say 𝑥0 , is in 𝑀𝑚 . If all three
points are in 𝑀𝑚 ⧵ 𝑀𝑚+1 then the triple is not monochromatic as 𝑑𝑚 is a Γ-coloring in
𝑀𝑚 . If the other two points are in 𝑀𝑘 ⧵𝑀𝑘+1 for some 𝑘 < 𝑚, then the triple is again not
monochromatic: either 𝑥0 ∈ dom(𝑝) and then the failure of monochromaticity follows
from the assumption that 𝑑𝑘 is a Γ-coloring in 𝑀𝑘 , or 𝑥0 ∉ dom(𝑝) and then 𝑐𝑛 (𝑥0 ) ∈
𝑎𝑚 and 𝑐𝑛 (𝑥1 ) ∈ 𝑎𝑘 and the sets 𝑎𝑚 , 𝑎𝑘 are disjoint. The circularity assumption implies
that no other cases are possible.
Now, it is not difficult to see that ⟨𝑐𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a coherent sequence of total Γ-
colorings in their respective models. A total Γ-coloring is a balanced virtual condition
for 𝑃 by Theorem 8.2.8. Finally, 𝑝 ≥ 𝑐𝜔 ≥ ⋯ ≥ 𝑐2 ≥ 𝑐1 ≥ 𝑐0 holds in the poset 𝑃. Thus,
⟨𝑀𝑛 , 𝑐𝑛 ∶ 𝑛 ≤ 𝜔⟩ is the required nest below the condition 𝑝. □
Corollary 9.4.27. Let Γ be the hypergraph on ℝ2 of all triples which form the set
of vertices of an equilateral triangle.
(1) Let 𝑃 be the coloring poset for Γ as in Example 8.2.10. In the 𝑃-extension of the
symmetric Solovay model, the orbit divide is preserved;
(2) it is consistent relative to an inaccessible cardinal that ZF+DC holds, chromatic
number of Γ is countable, and the orbit divide is preserved.
Example 9.4.28. Let 𝑋 be an uncountable Polish space. Let 𝑃 be the thin set
mapping forcing on 𝑋 of Definition 8.6.5. Then 𝑃 is nested balanced.
sequence such that for every 𝑛 ∈ 𝜔, the set 2𝜔 ∩ 𝑀𝑛 ⧵ 𝑀𝑛+1 is nonempty, and in
all models the Continuum Hypothesis holds. Let ≺ be a coherent well-ordering of all
mappings from [𝑋]2 to [𝑋]<ℵ0 . Use the Continuum Hypothesis assumption to argue
that in each model 𝑀𝑛 for 𝑛 ≤ 𝜔 there is a set mapping from 𝑋 2 to [𝑋]<ℵ0 without a
free set of size three [39]. Let 𝑐𝑛 be the ≺-least such set mapping in 𝑀𝑛 . Now, in the
model 𝑀0 define the set mapping 𝑑 ∶ [𝑋]3 → [𝑋]<𝜔 by setting 𝑑(𝑎) equal to 𝑝(𝑎) if
𝑎 ⊂ dom(𝑝) and to ⋃𝑥∈𝑎 𝑐𝑛 (𝑎 ⧵ {𝑥}) ∪ 𝑒(𝑎)) ⧵ 𝑎 if 𝑎 ⊄ 𝑝. Here 𝑛 ≤ 𝜔 is the largest
number such that 𝑎 ⊂ 𝑀𝑛 and 𝑒(𝑎) ⊂ dom(𝑝) is the set of all elements 𝑦 ∈ dom(𝑝)
indexed before some element of 𝑎 ∩ dom(𝑝) in some fixed enumeration of dom(𝑝) in
𝑀𝜔 .
It is immediate that 𝑑𝑛 = 𝑑 ↾ 𝑀𝑛 ∈ 𝑀𝑛 holds for all 𝑛 ≤ 𝜔. In view of The-
orem 8.6.6, it is enough to show that the set mapping 𝑑 has no free quadruples. Let
𝑏 ⊂ 𝑋 be a quadruple. There are several cases. If 𝑏 ⊂ dom(𝑝) then 𝑏 is not free as 𝑝
has no free quadruples. If 4 > |𝑏 ∩ dom(𝑝)| ≥ 2 then 𝑏 is not free because of the 𝑒-term
of the definition of 𝑑. If |𝑏 ∩ dom(𝑝)| ≤ 1, then then 𝑏 is not free because of the 𝑐𝑛 -term
of the definition of 𝑑 where 𝑛 ≥ 𝜔 is the largest number such that 𝑏 ⊂ 𝑀𝑛 . Just pick
𝑥 ∈ 𝑏 such that 𝑥 ∈ 𝑀𝑛 ⧵ ⋃𝑚∈𝑛 𝑀𝑚 , observe that the set 𝑏 ⧵ {𝑥} is not free for 𝑐𝑛 and
so 𝑏 is not free for 𝑑. This completes the proof. □
Corollary 9.4.29. Let 𝑋 be an uncountable Polish space.
(1) Let 𝑃 be the thin set mapping forcing on 𝑋 of Definition 8.6.5. In the 𝑃-extension
of the symmetric Solovay model, the orbit divide is preserved;
(2) it is consistent relative to an inaccessible cardinal that ZF+DC holds, there is a
set mapping from [𝑋]3 to [𝑋]<ℵ0 without free quadruples, and the orbit divide
is preserved.
Example 9.4.30. Let 𝑃 be the automorphism poset of Section 8.4. Then 𝑃 is nested
balanced.
sequence such that for every 𝑛 ∈ 𝜔, the set 2𝜔 ∩𝑀𝑛 ⧵𝑀𝑛+1 is nonempty. Working in the
model 𝑀𝜔 , use Proposition 8.4.2 to find a Borel automorphism 𝜋 of the algebra 𝒫(𝜔)
modulo finite extending 𝑝. It is immediate from Theorem 8.4.3 that ⟨𝑀𝑛 , 𝜋𝑀𝑛 ∶ 𝑛 ≤ 𝜔⟩
is the required nest below the condition 𝑝. □
Corollary 9.4.31.
(1) Let 𝑃 be the automorphism poset of Section 8.4. In the 𝑃-extension of the sym-
metric Solovay model, the orbit divide is preserved;
(2) it is consistent relative to an inaccessible cardinal that ZF+DC holds, there is a
nontrivial automorphism of the algebra 𝒫(𝜔) modulo finite, and the orbit divide
is preserved.
Now it is time to show that the existence of certain combinatorial objects implies that
the orbit divide breaks. In the following theorem and corollaries, we neglect the real
parameter necessary to define the Polish spaces in question. For the rest of the section,
put 𝑋 = (2𝜔 )𝜔 .
Theorem 9.4.32. (ZF) Suppose that there exist a Polish space 𝑌 and a set 𝐴 ⊂ 𝑌
such that the preordering ≤ on 𝑋, defined by 𝑥1 ≤ 𝑥0 if 𝑥1 ∈ 𝐿[𝑥0 , 𝐴], is well-founded.
Then there is a countable complete section for 𝔼1 .
Proof. For each point 𝑥 ∈ 𝑋 and each number 𝑚 ∈ 𝜔, write 𝑥⧵𝑚 for the element
of 𝑋 defined by (𝑥 ⧵ 𝑚)(𝑛) = 𝑥(𝑛) if 𝑛 ≥ 𝑚, and (𝑥 ⧵ 𝑚)(𝑛) = 𝜔 × {0} if 𝑚 < 𝑛. For
each number 𝑚 ∈ 𝜔 write 𝑀𝑚 (𝑥) for the model 𝐿[𝑥 ⧵ 𝑚, 𝐴]. By the well-foundedness
assumption, there must be 𝑛 ∈ 𝜔 such that for all 𝑚 ≥ 𝑛 the models 𝑀𝑚 (𝑥) are the
same. Note that if 𝑥0 , 𝑥1 ∈ 𝑋 are 𝔼1 -related points, the stable value of the models
𝑀𝑚 (𝑥0 ) and 𝑀𝑚 (𝑥1 ) is the same. We would like to define the complete section 𝐷 ⊂ 𝑋
by setting 𝑥 ∈ 𝐷 if 𝑥 belongs to ⋂𝑚 𝑀𝑚 (𝑥). The stabilization feature shows that 𝐷 has
nonempty intersection with each 𝔼1 -class. However, a more precise definition of the
complete section is necessary to make the conclusion that the intersection with each
𝔼1 -class is countable.
Observe first that by a standard condensation argument the model 𝑀𝑚 (𝑥) is a
model of ZFC+CH, and its constructibility ordering orders its elements of 𝑋 in order-
𝑀 (𝑥)
type 𝜔1 𝑚 . For natural numbers 𝑛 ≤ 𝑚 ∈ 𝜔 define 𝜌𝑛𝑚 (𝑥) to be the index of 𝑥 ⧵ 𝑛
in the constructibility well-ordering of 𝑀𝑚 (𝑥) if 𝑥 ⧵ 𝑛 ∈ 𝑀𝑚 (𝑥), and let 𝜌𝑛𝑚 (𝑥) = 0
otherwise. Let 𝛼(𝑥) = lim sup𝑛 sup𝑚≥𝑛 𝜌𝑛𝑚 (𝑥), which amounts to the eventual con-
stant value of the ordinals sup𝑚≥𝑛 𝜌𝑛𝑚 (𝑥). The definition of the ordinal 𝛼(𝑥) does not
depend on the choice of 𝑥 within its equivalence class by the stabilization assumption.
Also, 𝛼(𝑥) is a countable ordinal. To see this, work in the model 𝑀0 (𝑥) and evaluate the
𝑀 (𝑥)
ordinal 𝛼(𝑥) there. Since 𝑀0 (𝑥) is a model of choice, its 𝜔1 is regular, so 𝛼(𝑥) ∈ 𝜔1 0 .
𝑀 (𝑥)
Since 𝜔1 0 ≤ 𝜔1 , the countability of 𝛼(𝑥) follows.
Finally, let 𝐶 = {𝑥 ∈ 𝑋 ∶ ∃𝑛 𝑥 = 𝑥 ⧵ 𝑛 and for all 𝑚 ≥ 𝑛, 𝑥 ⧵ 𝑛 ∈ 𝑀𝑚 (𝑥) and
𝜌𝑛𝑚 (𝑥) ≤ 𝛼(𝑥)}. To see that the set 𝐶 meets every 𝔼1 class in a nonempty countable
set, let 𝑧 ∈ 𝑋 be arbitrary. The definition of the ordinal 𝛼(𝑧) shows that there is a
number 𝑛 ∈ 𝜔 such that for all 𝑚 ≥ 𝑛, 𝑧 ⧵ 𝑛 ∈ 𝑀𝑚 (𝑧) and is enumerated by stage 𝛼(𝑧)
there; clearly, letting 𝑥 = 𝑧 ⧵ 𝑛 we get 𝑥 ∈ 𝐶 ∩ [𝑧]𝔼1 . Also, note that 𝐶 ∩ [𝑧]𝔼1 ⊂ {𝑥 ∈
𝑋 ∶ ∃𝑛 𝑥 ∈ 𝑀𝑛 (𝑧) and the index of 𝑥 in the constructibility well-ordering of 𝑀𝑛 (𝑧) is
≤ 𝛼(𝑧)} and observe that the latter set is countable as the ordinal 𝛼(𝑧) is countable. □
In particular, in ZF the existence of an acyclic decomposition implies |𝔼1 | ≤ |𝔽2 |.
Corollary 9.4.33. (ZF) Let 𝑌 be an uncountable Polish space. If there is a decom-
position of [𝑌 ]2 into countably many acyclic graphs then 𝔼1 has a countable complete
section.
Proof. Let 𝑐 ∶ [𝑌 ]2 → 𝜔 be the acyclic decomposition. Fix a countable basis for
the space 𝑌 and let 𝐴 = {⟨𝑧0 , 𝑧1 , 𝑂, 𝑚⟩ ∶ 𝑧0 , 𝑧1 ∈ 𝑍 are distinct points, 𝑂 ⊂ 𝑌 is a basic
open set, 𝑚 ∈ 𝜔, and there is 𝑦 ∈ 𝑂 such that 𝑐(𝑦, 𝑧0 ) = 𝑐(𝑦, 𝑧1 ) = 𝑚}. Let ≤ be the
preordering on 𝑋 defined by 𝑥1 ≤ 𝑥0 if 𝑥1 ∈ 𝐿[𝑥0 , 𝐴]. In view of Theorem 9.4.32 it will
be enough to show that ≤ is well-founded.
𝐿[𝑥,𝐴]
To do this, consider the map 𝜋 ∶ 𝑋 → 𝜔1 defined by 𝜋(𝑥) = 𝜔1 . It will be
enough to show that 𝑥1 < 𝑥0 implies 𝜋(𝑥1 ) ∈ 𝜋(𝑥0 ). Suppose towards contradiction
that this fails for some 𝑥1 < 𝑥0 , and write 𝑀1 = 𝐿[𝑥1 , 𝐴] and 𝑀0 = 𝐿[𝑥0 , 𝐴]. Since 𝑀1
𝑀 𝑀
is a class of 𝑀0 , it must be the case that 𝜔1 1 ≤ 𝜔1 0 ; by the contradictory assumption,
the equality in fact prevails. Thus, in the model 𝑀0 the set 𝑌 ∩ 𝑀1 is an uncountable
proper subset of 𝑌 ∩ 𝑀0 . Let 𝑦 ∈ 𝑌 ∩ (𝑀1 ⧵ 𝑀0 ) be an arbitrary point.
By a counting argument in the model 𝑀0 there must be a number 𝑚 ∈ 𝜔 and
distinct points 𝑧0 , 𝑧1 ∈ 𝑌 ∩ 𝑀1 such that 𝑐(𝑦, 𝑧0 ) = 𝑐(𝑦, 𝑧1 ) = 𝑚. If 𝑦 ∈ 𝑌 was the
unique point satisfying these equalities then it can be constructed from 𝐴 and the points
𝑧0 , 𝑧1 ; as such, it would belong to the model 𝑀1 , which is not the case. Thus, there is
a point 𝑦′ ∈ 𝑌 distinct from 𝑦 such that 𝑐(𝑦′ , 𝑧0 ) = 𝑐(𝑦′ , 𝑧1 ) = 𝑚. However, then
the 4-cycle consisting of edges connecting the vertices 𝑧0 , 𝑦, 𝑧1 , 𝑦′ , 𝑧0 in this order is
monochromatic, a contradiction. □
In addition, in ZF the existence of a Hamel basis for ℝ over ℚ implies |𝔼1 | ≤ |𝔽2 |.
Corollary 9.4.34. (ZF) Let 𝑌 be an uncountable Polish vector space over a count-
able field Φ. If there is a basis for 𝑌 over Φ then there is a countable complete section for
𝔼1 .
Proof. Let 𝑑 be an invariant complete metric on 𝑌 . Let 𝐵 ⊂ 𝑌 be a basis for 𝑌
over Φ. Let 𝐴 = {⟨𝑦, 𝑂𝑖 ∶ 𝑖 ∈ 𝑘⟩ ∶ 𝑦 ∈ 𝑌 , 𝑂𝑖 ⊂ 𝑌 are basic open sets and there are points
𝑦𝑖 ∈ 𝑂𝑖 ∩ 𝑏 such that 𝑦 is a linear combination of 𝑦𝑖 ∶ 𝑖 ∈ 𝑘 with nonzero coefficients in
Φ}. Define a preordering on the space 𝑋 by setting 𝑥1 ≤ 𝑥0 if 𝑥1 ∈ 𝐿[𝑥0 , 𝐴]. It will be
enough to show that the preordering ≤ is well-founded. A reference to Theorem 9.4.32
then concludes the proof.
Suppose towards a contradiction that the ordering ≤ is ill-founded. The first order
of business is to produce a sequence ⟨𝑥𝑛 ∶ 𝑛 ∈ 𝜔⟩ such that for each 𝑚 ∈ 𝜔, ⟨𝑥𝑛 ∶ 𝑛 ≥
𝑚⟩ ∈ 𝐿[𝑥𝑚 , 𝐴, 𝐵] and 𝑥𝑚 ∉ 𝐿[𝑥𝑚+1 , 𝐴, 𝐵]. To do this, let 𝑥0 ∈ 𝑋 be any element such
that there is a strictly decreasing infinite sequence in ≤ below 𝑥0 , and by recursion
define 𝑥𝑛+1 ∈ 𝑋 to be the first (in the constructibility ordering of 𝐿[𝑥𝑛 , 𝐴, 𝐵]) point in
𝐿[𝑥𝑛 , 𝐴, 𝐵] such that 𝑥𝑛 ∉ 𝐿[𝑥𝑛+1 , 𝐴, 𝐵] and there is a strictly decreasing sequence in
≤ below 𝑥𝑛+1 . The point here is that the ordering is defined in an absolute way, and its
well-foundedness is absolute into the models concerned.
Write 𝑀𝑛 for the model 𝐿[𝑥𝑛 , 𝐴, 𝐵] and 𝑀𝜔 for ⋂𝑛 𝑀𝑛 . As an initial observation,
note that the set 𝐵 ∩ 𝑀𝑛 is a basis in 𝑀𝑛 : for every 𝑦 ∈ 𝑌 ∩ 𝑀𝑛 , the unique linear
combination of elements of 𝐵 with nonzero coefficients yielding 𝑦 can be constructed
from 𝑦 and 𝐴, so belongs to 𝑀𝑛 . Now, by recursion on 𝑖 ∈ 𝜔 build points 𝑦𝑖 ∈ 𝑌 and
numbers 𝑛𝑖 ∈ 𝜔 so that 𝑛0 = 0 and for every 𝑖 ∈ 𝜔, 𝑦𝑖 ∈ 𝑀𝑛𝑖 is the first point in the
constructibility well-ordering of 𝑀𝑛𝑖 which is within 𝑑-distance 2−𝑖 of the zero element
of 𝑌 and does not belong to 𝑀𝑛𝑖 +1 . Such a point must exist since the 2−𝑖 -neighborhood
of the zero element is an uncountable open subset of the Polish space 𝑌 , and 𝑀𝑛𝑖 +1 does
not contain all reals of 𝑀𝑛𝑖 . The point 𝑦𝑖 is expressed as a unique linear combination
𝜙𝑖 of elements of 𝐵 ∩ 𝑀𝑛𝑖 . Finally, let 𝑛𝑖+1 ∈ 𝜔 be the first number 𝑛 greater than 𝑛𝑖
such the linear combination 𝜙𝑖 uses no elements of the set 𝑀𝑛 ⧵ 𝑀𝜔 .
Note that for each 𝑖 ∈ 𝜔 the sequence ⟨𝑦𝑗 , 𝑛𝑗 ∶ 𝑗 ≥ 𝑖⟩ belongs to the model 𝑀𝑛𝑖 . Let
𝑧𝑖 = Σ𝑗≥𝑖 𝑦𝑗 = lim𝑘 Σ𝑘≥𝑗≥𝑖 𝑦𝑘 . The limit exists as the metric 𝑑 is invariant and complete
and the points 𝑦𝑖 converge to zero sufficiently fast. It is also clear that 𝑧𝑖 ∈ 𝑀𝑛𝑖 , and
𝑧𝑖 − 𝑧𝑖+1 = 𝑦𝑖 . Since 𝑧𝑖+1 ∈ 𝑀𝑛𝑖+1 and 𝑦𝑖 ∉ 𝑀𝑛𝑖+1 both hold, we conclude that 𝑧𝑖 ∉
𝑀𝑛𝑖+1 holds.
Now, the point 𝑧0 ∈ 𝑌 can be expressed as a linear combination 𝜓 of elements of
𝐵 ∩ 𝑀0 . Let 𝑖 ∈ 𝜔 be a number so large that the combination 𝜓 uses no elements of
𝑀𝑛𝑖 ⧵ 𝑀𝜔 . Observe that 𝑧𝑖 = 𝑧0 − Σ𝑗<𝑖 𝑦𝑗 and the linear combinations from 𝐵 yielding
the points 𝑦𝑗 for 𝑗 ∈ 𝑖 use no elements of 𝑀𝑛𝑖 ⧵ 𝑀𝜔 . In other words, the point 𝑧𝑖 ∈ 𝑀𝑛𝑖
can be expressed as a linear combination of elements of 𝐵 ⧵ 𝑀0 which uses no elements
of 𝑀𝑛𝑖 ⧵ 𝑀𝜔 . This combination (after cancellations) is unique as 𝐵 is a basis, and it uses
only elements of 𝑀𝑛𝑖 since 𝐵 ∩ 𝑀𝑛𝑖 is a basis in 𝑀𝑛𝑖 . Thus, it uses only elements of 𝑀𝜔 ,
so 𝑧𝑖 ∈ 𝑀𝜔 . This contradicts the last sentence of the previous paragraph. □
Note that the Polish assumption on the vector space 𝑌 is necessary in Corollary 9.4.34.
One can consider the (non-Polishable) group 𝑌 of finite subsets of 2𝜔 equipped with
the symmetric difference operation as a vector space over the binary field. This vector
9.5. THE 𝔼𝐾𝜍 DIVIDE 205
space has a basis in ZF, namely the set of all singletons. Thus, the existence of the
basis for this particular vector space does not imply in ZF the existence of a complete
countable section for 𝔼1 .
9.5. The 𝔼𝐾𝜍 divide

Recall that 𝔼𝐾𝜍 is the equivalence relation on the space of all functions in 𝜔𝜔 point-
wise dominated by the identity function, connecting functions 𝑥0 , 𝑥1 if the function
𝑥0 − 𝑥1 is bounded. The central position of this equivalence relation is documented by
the fact that it is 𝐾𝜍 , and that every 𝐾𝜍 -equivalence relation is Borel reducible to it by a
result of Rosendal [87]. It is well-known that the equivalence relation 𝔼𝜔 0 is not Borel
reducible to 𝔼𝐾𝜍 [54, Lemma 6.1.1], and among the equivalence relations classifiable
by countable structures, it even has a central place in this regard. In this section, we
show that in certain extensions of the symmetric Solovay model, this non-reducibility
result is translated to a cardinality preservation result. The reader should note that in
ZF, the inequality |𝔼0 | ≤ |2𝜔 | implies |𝔼𝜔 𝜔 𝜔 𝜔
0 | ≤ |(2 ) | = |2 |, and therefore preserving
the 𝔼𝐾𝜍 -divide is strictly more difficult than preserving the smooth divide.
The preservation of the relation |𝔼𝜔 0 | ≰ |𝔼𝐾𝜍 | uses the following generalization of
mutual genericity motivated by Proposition 1.7.9.
Definition 9.5.1. Let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be generic extensions in some ambient ex-
tension of 𝑉. We say that the pair 𝑉[𝐻0 ], 𝑉[𝐻1 ] is pod generic if
(1) for every ordinal 𝛼, 𝑉𝛼 ∩ 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] ∈ 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ];
(2) for any disjoint sets 𝑎0 ∈ 𝑉[𝐻0 ] and 𝑎1 ∈ 𝑉[𝐻1 ] which are subsets of 𝑉[𝐻0 ]∩
𝑉[𝐻1 ], there are disjoint sets 𝑏0 , 𝑏1 ∈ 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] such that 𝑎0 ⊂ 𝑏0 and
𝑎1 ⊂ 𝑏1 .
The pod is the intersection 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ].
It is not hard to see that the first item implies that the intersection 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ]
is a model of ZF, since it is weakly universal and closed under the Gödel functions
[51, Theorem 13. 9]. If the intersection is in fact a model of ZFC, then the extensions
𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic over it by Proposition 1.7.9. However, we will be
interested exactly in the situations where the intersection fails to satisfy even DC. The
following is a simple observation which will be critical later.
Proposition 9.5.2. Let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be a pod generic pair of extensions. Every
𝔼𝐾𝜍 -class represented in both 𝑉[𝐻0 ], 𝑉[𝐻1 ] is represented in 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ].
Proof. Let 𝑥0 ∈ 𝑉[𝐻0 ] and 𝑥1 ∈ 𝑉[𝐻1 ] be points in 𝜔𝜔 below the identity func-
tion which are 𝔼𝐾𝜍 -related. Find a natural number 𝑚 ∈ 𝜔 such that for all 𝑘 ∈ 𝜔,
|𝑥0 (𝑘) − 𝑥1 (𝑘)| ≤ 𝑚. Let 𝑎0 ⊂ 𝜔 × 𝜔 be the set 𝑥0 , and let 𝑎1 ⊂ 𝜔 × 𝜔 be the set
{⟨𝑘, 𝑙⟩ ∶ |𝑙 − 𝑥1 (𝑘)| > 𝑚}. Thus, 𝑎0 ∈ 𝑉[𝐻0 ] and 𝑎1 ∈ 𝑉[𝐻1 ] are disjoint sets, and
therefore can be separated by some disjoint sets 𝑏0 , 𝑏1 ⊂ 𝜔 × 𝜔 in 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] by
the mutual genericity assumption. The vertical sections of the set 𝑏0 are all nonempty
and the function 𝑦 ∈ 2𝜔 , which for each 𝑛 ∈ 𝜔 indicates the smallest element of the
vertical section (𝑏0 )𝑛 , belongs to 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ]. Since 𝑦 ∩ 𝑎1 = 0, it must be the case
that 𝑦 is 𝔼𝐾𝜍 -related to both 𝑥0 , 𝑥1 as desired. □
The conclusion of the proposition fails for such simple pinned equivalence relations as
𝔼𝜔
0 , and this is exactly the point exploited in this section. We will need a notion of pod
balance.
Definition 9.5.3. A Suslin forcing 𝑃 is pod balanced if for every pod generic pair
𝑉[𝐻0 ], 𝑉[𝐻1 ] and every pair of conditions 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ], if 𝑝0 , 𝑝1 ∈
𝑃 are incompatible, then there are analytic sets 𝐴0 , 𝐴1 ⊂ 𝑃 coded in 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ]
such that Σ𝐴0 , Σ𝐴1 are incompatible in 𝑃 and 𝑝0 , Σ𝐴0 are compatible and 𝑝1 , Σ𝐴1 are
compatible.
Theorem 9.5.4. In compactly balanced, pod balanced extensions of the symmetric
Solovay model, |𝔼𝜔
0 | ≰ |𝔼𝐾𝜍 | holds.
Proof. The main technical tool used in the proof is the countable support prod-
uct 𝑄 of countably many copies of the Vitali forcing introduced for the proof of Theo-
rem 9.2.2. We first study the product 𝑄 in its own right.
Fact 9.5.5. The poset 𝑄 is proper, bounding, and adds no independent reals.
Proof. The first two assertions are well-known, and follow for example from [117,
Theorem 5.6] or [115, Theorem 5.2.6]. The third assertion is more difficult. It can be
derived from the work of [97, Section 4], and it appears explicitly in the forthcoming
[118]. □
The poset 𝑄 is designed to add an interesting model of ZF. In the 𝑄-extension, let
⟨𝑥𝑛 ∶ 𝑛 ∈ 𝜔⟩ be the sequence of points Vitali-generic over the ground model added
by the product 𝑄. Let 𝐴 ⊂ 𝜔 × 2𝜔 be the relation consisting of all pairs ⟨𝑛, 𝑥⟩ such that
𝑥 is 𝐸0 -related to 𝑥𝑛 . For each number 𝑛 ∈ 𝜔, let 𝑀𝑛 be the model of all sets hereditar-
ily definable from 𝑥𝑚 for 𝑚 ∈ 𝑛, 𝐴, and some parameters in the ground model. Also,
let 𝑀 be the model of all sets hereditarily definable from the set 𝐴 and its elements, and
parameters in the ground model. We have the following:
Claim 9.5.6.
(1) 𝑀0 ⊂ 𝑀1 ⊂ 𝑀2 ⊂ ⋯ ⊂ 𝑀;
(2) the sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ belongs to 𝑀;
(3) every set of ordinals in 𝑀 belongs to ⋃𝑛 𝑀𝑛 ;
(4) the model 𝑀 does not contain any uniformization of the set 𝐴.
Note also that the models 𝑀𝑛 satisfy the axiom of choice, while the model 𝑀 fails even
DC, as item (3) shows. See Figure 9.5.1
Proof. The first item follows directly from the definitions of the models 𝑀𝑛 and
𝑀: if 𝑚 ∈ 𝑛 ∈ 𝜔 are numbers then there are fewer definitions of elements of the
model 𝑀𝑚 than of elements of the model 𝑀𝑛 , and certainly fewer than the definitions
of elements the model 𝑀. For (2), the sequence ⟨𝑀𝑛 ∶ 𝑛 ∈ 𝜔⟩ is definable from the
set 𝐴, since in the definition of the model 𝑀𝑛 it certainly does not matter which 𝔼0 -
equivalents of the points 𝑥𝑚 for 𝑚 ∈ 𝑛 one uses as the parameters. For (3), any defini-
tion of a set of ordinals in the model 𝑀 uses only finitely many parameters, and then
must belong to the model 𝑀𝑛 for a number 𝑛 large enough so that the parameters of
the definition are definable from 𝑥𝑚 for 𝑚 ∈ 𝑛, the set 𝐴, and some elements of the
ground model.
V[H0]
V[H1]
M3
M2
M1
V0
Figure 9.5.1. A pod at work.
Lastly, for (4), return to the ground model and assume towards a contradiction
that some condition in 𝑄 forces (4) to fail. Then, in the poset 𝑄, there exist a condition
𝑞, numbers 𝑛, 𝑘 ∈ 𝜔 and a formula 𝜙 such that 𝑞 forces that the formula 𝜙 uses only
parameters 𝑥𝑚 ̇ for 𝑚 ∈ 𝑛, 𝐴, and some parameters in the ground model, it defines a
uniformization 𝑦 of the set 𝐴, and 𝑦(𝑛) agrees with 𝑥𝑛̇ from 𝑘 on. Let ⟨𝑥𝑚 ∶ 𝑚 ∈ 𝜔⟩
be a 𝑄-generic sequence of points meeting the condition 𝑞. By a basic analysis of the
Vitali forcing in [115, Section 4.7.1], there is also a point 𝑥𝑛′ ∈ 2𝜔 𝔼0 -related to 𝑥𝑛
which differs from 𝑥𝑛 at some point past 𝑘 and such that ⟨𝑥𝑚 ∶ 𝑚 ≠ 𝑛, 𝑥𝑛′ ⟩ is a 𝑄-
generic sequence meeting the condition 𝑞. Applying the forcing theorem to the two
sequences ⟨𝑥𝑚 ∶ 𝑚 ∈ 𝜔⟩ and ⟨𝑥𝑚 ∶ 𝑚 ≠ 𝑛, 𝑥𝑛′ ⟩, we see that the formula 𝜙 should
define a uniformization 𝑦 of the set 𝐴 such that 𝑦(𝑛) is equal to both 𝑥𝑛 and 𝑥𝑛′ beyond
𝑘. This is impossible though as the two sequences 𝑥𝑛 , 𝑥𝑛′ do differ at some point past
𝑘. □
Now, towards the proof of the theorem. Write 𝐸 = 𝔼𝜔 0 and 𝐹 = 𝔼𝐾𝜍 . Let 𝜅 be an
inaccessible cardinal. Let 𝑃 be a Suslin forcing which is compactly balanced and pod
balanced below 𝜅. Let 𝑊 be a symmetric Solovay model derived from 𝜅 and work in
the model 𝑊. Let 𝑝 ∈ 𝑃 be a condition and 𝜏 be a 𝑃-name such that 𝑝 forces 𝜏 to be a
function from the 𝐸-quotient space to the 𝐹-quotient space. We must find a condition
𝑞 ≤ 𝑝 and distinct 𝐸-classes which are forced by 𝑞 to have the same 𝜏-image.
The condition 𝑝 and the name 𝜏 must be definable from a parameter 𝑧 ∈ 2𝜔 and
additional parameters from the ground model. Let 𝑉[𝐾] be an intermediate forcing ex-
tension obtained by a poset of cardinality smaller than 𝜅 such that 𝑧 ∈ 𝑉[𝐾]. Working
in the model 𝑉[𝐾], let 𝑄0 be the poset 𝒫(𝜔) modulo finite, and let 𝑄1 be the product of
countably many copies of the Vitali forcing as discussed in the preamble of the present
proof. Let ⟨𝑈, 𝑥𝑛 ∶ 𝑛 ∈ 𝜔⟩ be objects generic over 𝑉[𝐾] for the poset 𝑄0 × 𝑄1 ; in par-
ticular, 𝑈 is an ultrafilter on 𝜔, and ⟨𝑥𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a sequence of points in 2𝜔 . Since
the poset 𝑄0 is 𝜎-closed, the models 𝑉[𝐾] and 𝑉[𝐾][𝑈] compute the poset 𝑄1 in the
same way and the poset 𝑄1 is proper in both. As a consequence, 𝑉[𝐾][𝑈][𝑥𝑛 ∶ 𝑛 ∈ 𝜔]
is a 𝑄1 -extension of 𝑉[𝐾][𝑈] and 2𝜔 ∩ 𝑉[𝐾][𝑈][𝑥𝑛 ∶ 𝑛 ∈ 𝜔] = 2𝜔 ∩ 𝑉[𝐾][𝑥𝑛 ∶ 𝑛 ∈ 𝜔]
holds. Since (Fact 9.5.5) the poset 𝑄1 adds no independent reals, a density argument
shows that 𝑈 generates an ultrafilter in the model 𝑉[𝐾][𝑈][𝑥𝑛 ∶ 𝑛 ∈ 𝜔].
Let 𝐴 ⊂ 𝜔 × 2𝜔 be the relation consisting of all pairs ⟨𝑛, 𝑥⟩ such that 𝑥 is 𝔼0 -related
to 𝑥𝑛 . In the model 𝑉[𝐾][𝑈][𝑥𝑛 ∶ 𝑛 ∈ 𝜔] form the models 𝑀𝑛 of all sets hereditarily
definable from parameters 𝑥𝑚 for 𝑚 ∈ 𝑛, 𝐴, and parameters in the model 𝑉[𝐾][𝑈], and
let 𝑀 be the model of all sets hereditarily definable from the set 𝐴 and its elements and
some other parameters in 𝑉[𝐾][𝑈]. Note that by Vopěnka’s theorem [51, page 249], the
sequence ⟨𝑥𝑛 ∶ 𝑛 ∈ 𝜔⟩ is generic over the model 𝑀 and the forcing adding it restores
the axiom of choice in its generic extension of 𝑀.
The following claim makes a critical use of the compact balance assumption.
Claim 9.5.7. In the model 𝑀:
(1) there is a sequence ⟨𝑝𝑛̄ ∶ 𝑛 ∈ 𝜔⟩ such that each 𝑝𝑛̄ is a balanced virtual condi-
tion for 𝑀𝑛 , and 𝑝 ≥ 𝑝0̄ ≥ 𝑝1̄ ≥ 𝑝2̄ ≥ . . . ;
(2) any sequence as in (1) must have a lower bound.
Proof. Start with item (1). Working in 𝑉[𝐾][𝑈], fix 𝑅𝑛 -names 𝜒𝑛 so that 𝑅𝑛 is
the product of the first 𝑛-many copies of the Vitali forcing in the product 𝑄1 and 𝜒𝑛 is a
name for a balanced virtual condition stronger than 𝑝 and than all 𝜒𝑚 for 𝑚 ∈ 𝑛. This
is possible by Definition 9.2.1(2). Now, in the model 𝑉[𝐾][𝑈][𝑥𝑛 ∶ 𝑛 ∈ 𝜔] for each
𝑖
𝑛 ∈ 𝜔 let 𝑝𝑛̄ be the 𝑈-limit of the sequence ⟨𝜒𝑛 /⟨𝑥𝑚 ∶ 𝑚 ∈ 𝑛⟩ ∶ 𝑖 ∈ 𝜔⟩ in the compact
𝑖
space of balanced virtual conditions in the model 𝑀𝑛 , where 𝑥𝑚 ∈ 2𝜔 is the binary
sequence obtained from 𝑥𝑚 by replacing its first 𝑖 many entries with 0. The limit exists
since 𝑈 generates an ultrafilter in all models 𝑀𝑛 . The balanced virtual conditions 𝑝𝑛̄
for 𝑛 ∈ 𝜔 form a decreasing sequence by Definition 9.2.1(3). Also, the definition of the
limit does not depend on the sequence ⟨𝑥𝑛 ∶ 𝑛 ∈ 𝜔⟩ but only on the set 𝐴, and therefore
⟨𝑝𝑛̄ ∶ 𝑛 ∈ 𝜔⟩ ∈ 𝑀 as desired.
Item (2) is somewhat trickier. Let 𝑁 be some generic extension of 𝑀 which restores
the axiom of choice. In the model 𝑁, let 𝐵 be the compact Hausdorff space of balanced
virtual conditions for 𝑃. For each number 𝑛 ∈ 𝜔, consider the set 𝐶𝑛 = {𝑝 ̄ ∈ 𝐵 ∶ 𝑝 ̄ ≤
𝑝𝑛̄ }. This is a nonempty and closed subset of 𝐵 by Definition 9.2.1(2) and (3). Since the
closed sets 𝐶𝑛 for 𝑛 ∈ 𝜔 form a decreasing sequence, a compactness argument shows
that the set ⋂𝑛 𝐶𝑛 is nonempty. Any of its elements is the required lower bound of the
sequence ⟨𝑝𝑛̄ ∶ 𝑛 ∈ 𝜔⟩. □
Work in the model 𝑀. By the forcing theorem, there exist a poset 𝑅 of rank < 𝜅
restoring the axiom of choice, an 𝑅-name 𝜎 for a condition in the poset 𝑃 stronger than
all the balanced virtual conditions 𝑝𝑛̄ for 𝑛 ∈ 𝜔 and an 𝑅-name 𝜂 for an element of 𝜔𝜔
such that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜏([𝑦]𝐸 ) = [𝜂]𝐹 for all functions 𝑦 uniformizing
the relation 𝐴. The following claim uses the pod balance assumption.
Claim 9.5.8. There exist a condition 𝑟 ∈ 𝑅 and a point 𝑢 ∈ 𝜔𝜔 ∩ 𝑀 such that
𝑟 ⊩ 𝜂 𝐹 𝑢.̌
Proof. Suppose towards a contradiction that this fails. Let 𝐻0 , 𝐻1 ⊂ 𝑅 be filters
mutually generic over the model 𝑀. Observe that the models 𝑀[𝐻0 ], 𝑀[𝐻1 ] form a
pod generic pair over the pod 𝑀: if 𝑎0 ∈ 𝑀[𝐻0 ] and 𝑎1 ∈ 𝑀[𝐻1 ] are disjoint sets of
ordinals, they must be separated by disjoint sets 𝑏0 , 𝑏1 of ordinals in the model 𝑀 by
the mutual genericity over 𝑀 and Proposition 1.7.9.
Now, let 𝑝0 = 𝜎/𝐻0 , 𝑢0 = 𝜂/𝐻0 , 𝑝1 = 𝜎/𝐻1 and 𝑢1 = 𝜂/𝐻1 . Note that for every
condition 𝑝 ̂ ∈ 𝑃 ∩ 𝑀, either both 𝑝0 , 𝑝1 are below 𝑝 ̂ or both 𝑝0 , 𝑝1 are incompatible
with 𝑝.̂ This occurs because by Claim 9.5.6, there is a number 𝑛 ∈ 𝜔 such that 𝑝 ̂ ∈ 𝑀𝑛 ,
the virtual condition 𝑝𝑛̄ is either below 𝑝 ̂ or incompatible with it by its balance, and
𝑝0 , 𝑝1 ≤ 𝑝𝑛̄ . By the pod balance of the poset 𝑃, the conditions 𝑝0 , 𝑝1 have a lower bound
in the poset 𝑃. By the forcing theorem in 𝑀 and the initial contradictory assumption,
𝑢0 , 𝑢1 are not 𝐹-related to any element of 𝑀. By Proposition 9.5.2, 𝑢0 cannot be 𝐹-
related to 𝑢1 . Thus, the lower bound of 𝑝0 , 𝑝1 would have to force the unique 𝐸-class
of all uniformizations of the set 𝐴 to be mapped by 𝜏 simultaneously to [𝑢0 ]𝐹 and to
[𝑢1 ]𝐹 , which is impossible. □
Now, the claim together with the forcing theorem means that there exist a natural
number 𝑛 ∈ 𝜔, a point 𝑢 ∈ 𝑀𝑛 in 𝜔𝜔 and in the model 𝑀𝑛 a poset 𝑆 of cardinality
smaller than 𝜅, an 𝑆-name 𝜒 for a condition in the poset 𝑃 stronger than 𝑝𝑛̄ and an
𝑆-name 𝜉 for an element of (2𝜔 )𝜔 which is not 𝐸-related to any point in 𝑀𝑛 , such that
𝑆 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜒 ⊩𝑃 𝜏([𝜉]𝐸 ) = [𝑢]̌ 𝐹 . Namely, the poset 𝑆 is a remainder of the
iteration of 𝑄 and 𝑅 after the first 𝑛-many 𝑄-generic reals are added. Let 𝐻0 , 𝐻1 ⊂ 𝑆
be filters mutually generic over the model 𝑀𝑛 = 𝑉[𝐾][𝑈][𝑥𝑚 ∶ 𝑚 ∈ 𝑛] and write
𝑝0 = 𝜒/𝐻0 , 𝑦0 = 𝜉/𝐻0 , 𝑝1 = 𝜒/𝐻1 , and 𝑦1 = 𝜉/𝐻1 . By the balance of the virtual con-
dition 𝑝𝑛̄ , the conditions 𝑝0 , 𝑝1 have a lower bound. Since the equivalence relation 𝐸
is pinned, the points 𝑦0 , 𝑦1 are not 𝐸-related. By the forcing theorem, the lower bound
of the conditions 𝑝0 , 𝑝1 forces 𝜏([𝑦0 ]𝐸 ) = 𝜏([𝑦1 ]𝐸 ) = [𝑢]𝐹 . This shows that 𝜏 cannot be
an injection and completes the proof of the theorem. □
Example 9.5.9. The poset 𝑃 = 𝒫(𝜔) modulo finite is compactly balanced and pod
balanced. Compact balance was proved in Example 9.2.4. Towards the pod balance,
suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] is a pod generic pair of extensions and 𝑝0 , 𝑝1 ∈ 𝑃 are in-
compatible conditions in the respective models, i.e. almost disjoint subsets of 𝜔. By
the mutual genericity there exist almost disjoint sets 𝑝0′ , 𝑝1′ ∈ 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] of natural
numbers such that 𝑝0 ⊂ 𝑝0′ and 𝑝1 ⊂ 𝑝1′ . These sets as conditions in 𝑃 exemplify the
pod balance.
Corollary 9.5.10.
(1) Let 𝑃 = 𝒫(𝜔) modulo finite. Then in the 𝑃-extension of the symmetric Solovay
model, |𝔼𝜔
0 | ≰ |𝔼𝐾𝜍 | holds.

nonprincipal ultrafilter on 𝜔, yet |𝔼𝜔 0 | ≰ |𝔼𝐾𝜍 |.
Example 9.5.11. Let 𝒦 be a fragmented Borel simplicial complex on a Polish space

𝑋. The poset 𝑃 = 𝑃𝒦 is pod balanced. To see this, let 𝑓 be a Borel fragmentation func-
tion, assigning to each 𝑎 ∈ 𝒦 a countable partial function from 𝑌 to 𝑍, where 𝑌 and
𝑍 are Polish spaces. Suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] is a pod generic pair and 𝑝0 ∈ 𝑉[𝐻0 ],
𝑝1 ∈ 𝑉[𝐻1 ] are incompatible conditions in 𝑃. It must be the case that 𝑓(𝑝0 ) ∪ 𝑓(𝑝1 ) is
not a function. In other words, there exist a point 𝑦 ∈ dom(𝑓(𝑝0 )) ∩ dom(𝑓(𝑝1 )) and
pairwise disjoint basic open sets 𝑂0 , 𝑂1 ⊂ 𝑍 such that 𝑓(𝑝0 )(𝑦) ∈ 𝑂0 and 𝑓(𝑝1 )(𝑦) ∈
𝑂1 . By the mutual genericity, the point 𝑌 belongs to the pod. Let 𝐴0 = {𝑝 ∈ 𝑃 ∶ 𝑦 ∈
dom(𝑓(𝑝)) ∧ 𝑓(𝑝)(𝑦) ∈ 𝑂0 } and 𝐴1 = {𝑝 ∈ 𝑃 ∶ 𝑦 ∈ dom(𝑓(𝑝)) ∧ 𝑓(𝑝)(𝑦) ∈ 𝑂1 }. These
are analytic subsets of 𝑃 coded in the pod. By the definitory properties of the fragmen-
tation 𝑓, Σ𝐴0 and Σ𝐴1 are incompatible elements of the completion of 𝑃. In addition,
𝑝0 ≤ Σ𝐴0 and 𝑝1 ≤ Σ𝐴1 holds. This completes the proof of the example.
All locally countable simplicial complexes are fragmented by Theorem 6.2.7 and in
turn, many posets associated with locally countable simplicial complexes are com-
pactly balanced. We get for example the following.
Corollary 9.5.12. Let Γ be a Borel locally finite graph on a Polish space 𝑋 satisfying
the Hall’s marriage condition.
(1) Let 𝑃 be the poset adding a perfect matching to Γ with countable approxima-
tions. Then in the 𝑃-extension of the symmetric Solovay model, |𝔼𝜔 0 | ≰ |𝔼𝐾𝜍 |
holds.
perfect matching, yet |𝔼𝜔0 | ≰ |𝔼𝐾𝜍 |.
Example 9.5.13. Let 𝑃 be the poset adding a linear ordering on the 𝔼𝐾𝜍 -quotient
space as in Example 8.7.5. Then the poset 𝑃 is compactly balanced and pod balanced.
Compact balance was proved in Example 9.2.11. For the pod balance, suppose that
𝑉[𝐻0 ], 𝑉[𝐻1 ] is a pod generic pair of extensions, and 𝑝0 ∈ 𝑉[𝐻0 ], 𝑝1 ∈ 𝑉[𝐻1 ] are
incompatible conditions. Passing to stronger conditions if necessary, we may assume
that 𝑝0 , 𝑝1 are linear orders on some subsets of the 𝔼𝐾𝜍 -quotient space. The only way
they can fail to be compatible is that there are 𝔼𝐾𝜍 -classes 𝑐, 𝑑 represented in both
𝑉[𝐻0 ], 𝑉[𝐻1 ] such that ⟨𝑐, 𝑑⟩ ∈ 𝑝0 and ⟨𝑑, 𝑐⟩ ∈ 𝑝1 . In view of Proposition 9.5.2, 𝑐, 𝑑 are
represented in 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ], so the conditions 𝑝0′ = {⟨𝑐, 𝑑⟩} and 𝑝1′ = {⟨𝑑, 𝑐⟩} belong
to 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] and exemplify the pod balance.
Corollary 9.5.14.
(1) Let 𝑃 be the 𝔼𝐾𝜍 -linearization poset. Then in the 𝑃-extension of the symmetric
Solovay model, |𝔼𝜔 0 | ≰ |𝔼𝐾𝜍 | holds.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, the 𝔼𝐾𝜍 -
quotient space is linearly ordered, yet |𝔼𝜔0 | ≰ |𝔼𝐾𝜍 |.
Example 9.5.15. Let Γ, Δ be abelian Polish groups, with Δ divisible. Let 𝑃 be the
poset for adding a discontinuous homomorphism from Δ to Γ as in Definition 8.3.1.
Then the poset 𝑃 is compactly balanced and pod balanced. Compact balance was
proved in Example 9.2.20. For the pod balance, suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] is a pod
generic pair of extensions, and 𝑝0 ∈ 𝑉[𝐻0 ], 𝑝1 ∈ 𝑉[𝐻1 ] are incompatible conditions.
9.6. THE PINNED DIVIDE 211
Passing to stronger conditions if necessary, we may assume that Γ ∩ 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] ⊂

dom(𝑝0 ), dom(𝑝1 ) holds. Since Γ ∩ 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] is a subgroup of Γ, the only way
how 𝑝0 , 𝑝1 can fail to be compatible is that there is a point 𝛾 ∈ 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] with
𝑝0 (𝛾) ≠ 𝑝1 (𝛾). Let 𝑂0 , 𝑂1 ⊂ Δ be basic open sets separating the values 𝑝0 (𝛾) and 𝑝1 (𝛾)
and let 𝐴0 = {𝑞 ∈ 𝑃 ∶ 𝛾 ∈ dom(𝑞) and 𝑞(𝑥) ∈ 𝑂0 } and 𝐴1 = {𝑞 ∈ 𝑃 ∶ 𝛾 ∈ dom(𝑞) and
𝑞(𝑥) ∈ 𝑂1 }. Clearly, 𝐴0 , 𝐴1 ⊂ 𝑃 are analytic sets coded in 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ], the sums
Σ𝐴0 , Σ𝐴1 are incompatible in 𝑃, and 𝑝0 ≤ Σ𝐴0 and 𝑝1 ≤ Σ𝐴1 holds.
Corollary 9.5.16. Let Γ, Δ be abelian Polish groups, with Δ divisible.
(1) Let 𝑃 be the homomorphism poset. Then in the 𝑃-extension of the symmetric
Solovay model, |𝔼𝜔 0 | ≰ |𝔼𝐾𝜍 | holds.
discontinuous homomorphism from Γ to Δ, yet |𝔼𝜔 0 | ≰ |𝔼𝐾𝜍 |.
This section leaves perhaps more questions open than it resolves. We content ourselves
with quoting one glaring case:
Question 9.5.17. Does the conclusion of Theorem 9.5.4 stay in force if the as-
sumption of pod balance on 𝑃 is dropped?
9.6. The pinned divide

No unpinned equivalence relation can be reduced by a Borel function to a pinned
one, see Fact 2.3.2. This feature persists to the cardinality computations in balanced
extensions of the choiceless Solovay model, with a small proviso.
Theorem 9.6.1. Let 𝐸, 𝐹 be Borel equivalence relations on respective Polish spaces
𝑋, 𝑌 , 𝐸 pinned and 𝐹 unpinned. In balanced extensions of a symmetric Solovay model
derived from an inaccessible limit of inaccessibles, |𝐹| ≰ |𝐸| holds.
We do not know if the increase in the large cardinal strength of the large cardinal hy-
pothesis is necessary. We do know though that one has to consider Suslin forcings
which are balanced everywhere below 𝜅 as opposed to just cofinally balanced. This is
clear from Example 9.6.2 below.
Proof. Let 𝜅 be an inaccessible cardinal which is a limit of inaccessibles. Let 𝑃
be a Suslin forcing which is balanced below 𝜅. Let 𝑊 be the symmetric Solovay model
derived from 𝜅 and work in the model 𝑊. Towards a contradiction, suppose that 𝑝 ∈ 𝑃
is a condition and 𝜏 a 𝑃-name for an injection from 𝐹-classes to 𝐸-classes. Both 𝑝, 𝜏
are definable from some parameter 𝑧 ∈ 2𝜔 and parameters in the ground model. The
assumptions imply that there exist an inaccessible cardinal 𝜆 < 𝜅 of 𝑉 and a filter
𝐾 ⊂ Coll(𝜔, < 𝜆) generic over 𝑉 such that 𝑧 ∈ 𝑉[𝐾].
Work in the model 𝑉[𝐾]. The balanced assumption on the poset 𝑃 implies that
there is a balanced virtual condition 𝑝 ̄ ≤ 𝑝 in 𝑃. Theorem 2.7.1 shows that 𝐸 is pinned
in 𝑉[𝐾] and therefore has at most 𝔠 = ℵ1 many virtual classes, while Theorem 2.5.11
shows that 𝐹 has at least 2ℵ1 many virtual classes. This is where the stronger large
cardinal assumption is used. The argument splits into two cases:
Case 1. For every poset 𝑅 of cardinality smaller than 𝜅, every 𝑅-name for a condition
𝜎 ≤ 𝑝 ̄ in the poset 𝑃, every 𝐹-pinned 𝑅-name 𝜂 for an element of 𝑋 and every 𝑅-name
𝜒 for an element of 𝑋 such that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜏([𝜂]𝐹 ) = [𝜒]𝐸 , the name 𝜒
is 𝐸-pinned.
In this case, by a counting argument with the virtual 𝐸- and 𝐹-classes, it must be
the case that there are posets 𝑅0 , 𝑅1 and respective names 𝜎0 , 𝜂0 , 𝜒0 and 𝜎1 , 𝜂1 , 𝜒1 on
̄ 1 , 𝜒1 ⟩ holds while
them such that 𝜂0 , 𝜂1 are 𝐹-pinned, 𝜒0 , 𝜒1 are 𝐸-pinned, ⟨𝑅0 , 𝜒0 ⟩𝐸⟨𝑅
̄ 1 , 𝜂1 ⟩ fails, and 𝑅0 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎0 ⊩𝑃 𝜏([𝜂0 ]𝐹 ) = [𝜒0 ]𝐸 and 𝑅1 ⊩
⟨𝑅0 , 𝜂0 ⟩𝐹⟨𝑅
Coll(𝜔, < 𝜅) ⊩ 𝜎1 ⊩𝑃 𝜏([𝜂1 ]𝐹 ) = [𝜒1 ]𝐸 . Let 𝐻0 ⊂ 𝑅0 , 𝐻1 ⊂ 𝑅1 be filters generic over
𝑉[𝐾], and write 𝑝0 = 𝜎0 /𝐻0 ∈ 𝑃, 𝑝1 = 𝜎1 /𝐻1 ∈ 𝑃, 𝑥0 = 𝜒0 /𝐻0 ∈ 𝑋, 𝑥1 = 𝜒1 /𝐻1 ∈ 𝑋,
and 𝑦0 = 𝜂/𝐻0 ∈ 𝑌 and 𝑦1 = 𝜂1 /𝐻1 ∈ 𝑌 . The balance of the virtual condition 𝑝 ̄ in 𝑃
implies that 𝑝0 , 𝑝1 are compatible in 𝑃, and the pinned assumptions imply that 𝑥0 𝐸 𝑥1
holds and 𝑦0 𝐹 𝑦1 fails. Since 𝑊 is the symmetric Solovay extension of both models
𝑉[𝐾][𝐻0 ] and 𝑉[𝐾][𝐻1 ], the forcing theorem in these two models implies that in 𝑊,
the common lower bound of 𝑝0 , 𝑝1 in 𝑃 forces 𝜏([𝑦0̌ )𝐹 ) = [𝑥0̌ ]𝐸 and 𝜏([𝑦1̌ ]𝐹 ) = [𝑥1̌ ]𝐸 .
This contradicts the assumption that 𝜏 is forced to be an injection.
Case 2. Case 1 fails. Then, there has to be poset 𝑅 of cardinality smaller than 𝜅, an
𝑅-name for a condition 𝜎 ≤ 𝑝 ̄ in the poset 𝑃, an 𝐹-pinned 𝑅-name 𝜂 for an element
of 𝑋 and an 𝑅-name 𝜒 for an element of 𝑋 such that the name 𝜒 is not 𝐸-pinned and
𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜏([𝜂]𝐹 ) = [𝜒]𝐸 . In such a case, there exist filters 𝐻0 , 𝐻1 ⊂ 𝑅
mutually generic over 𝑉[𝐾] such that the points 𝑥0 = 𝜒/𝐻0 , 𝑥1 = 𝜒/𝐻1 ∈ 𝑋 are 𝐸-
unrelated. Let 𝑝0 = 𝜎/𝐻0 , 𝑝1 = 𝜎/𝐻1 , and let 𝑦0 = 𝜂/𝐻0 , 𝑦1 = 𝜂/𝐻1 ∈ 𝑌 . The balance
of the virtual condition 𝑝 ̄ implies that the conditions 𝑝0 , 𝑝1 ∈ 𝑃 are compatible, and
the pinned assumptions imply that 𝑦0 𝐹 𝑦1 holds. Since 𝑊 is the symmetric Solovay
extension of both models 𝑉[𝐾][𝐻0 ] and 𝑉[𝐾][𝐻1 ], the forcing theorem in these two
models implies that in 𝑊, the common lower bound of 𝑝0 , 𝑝1 in 𝑃 forces 𝜏([𝑦0̌ ]𝐹 ) =
[𝑥0̌ ]𝐸 and 𝜏([𝑦1̌ ]𝐹 ) = [𝑥1̌ ]𝐸 . This contradicts the assumption that 𝜏 is forced to be a
function. □
Example 9.6.2. Let 𝐴 ⊂ 𝑋 = (2𝜔 )𝜔 be the set of all elements 𝑥 ∈ 𝑋 such that
rng(𝑥) is linearly ordered by Turing reducibility, and let 𝐸 = 𝔽2 ↾ 𝐴. Note that the
𝐸-quotient space is classified by subsets of 2𝜔 which are linearly ordered by Turing
reducibility. There are uncountable sets of this form, and therefore 𝐸 is unpinned. At
the same time, such sets have size at most ℵ1 , so the virtual 𝐸-quotient space has size
2ℵ1 .
Now, let 𝑃 be the collapse of 𝐸 to |2𝜔 |. The poset 𝑃 is balanced if and only if
2 = 2ℵ1 by Theorem 6.4.2; in particular, it is cofinally balanced below any inac-
ℵ0
cessible cardinal. Thus, the 𝑃-extension of the Solovay model is a cofinally balanced
extension in which the (in ZFC) unpinned equivalence relation 𝐸 has the same cardi-
nality as 2𝜔 .
CHAPTER 10
Uniformization
The question whether various forms of uniformization hold in the models within
purview of this book is one of the more slippery issues we set out to resolve.
10.1. Tethered Suslin forcing

In order to prove all forms of uniformization in a clean sweep, the following defi-
nition will be central.
Definition 10.1.1. Let 𝑃 be a Suslin forcing and 𝜆 be an infinite cardinal. The
poset 𝑃 is 𝜆-tethered if whenever 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions of 𝑉
and 𝑝0 ∈ 𝑉[𝐻0 ], 𝑝1 ∈ 𝑉[𝐻1 ] are incompatible conditions, then there are incompatible
virtual conditions 𝑝0′ , 𝑝1′ ∈ 𝑉 represented on posets of cardinality smaller than 𝜆 such
that 𝑝0 , 𝑝0′ are compatible and 𝑝1 , 𝑝1′ are compatible. The poset 𝑃 is tethered if it is
𝜆-tethered for some cardinal 𝜆.
As the simplest initial example, consider the poset 𝑃 of countable functions from 2𝜔
to 2, ordered by reverse inclusion. If 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions of
𝑉 and 𝑝0 ∈ 𝑉[𝐻0 ], 𝑝1 ∈ 𝑉[𝐻1 ] are incompatible conditions, then there exists a point
𝑥 ∈ dom(𝑝0 ) ∩ dom(𝑝1 ) such that 𝑝0 (𝑥) ≠ 𝑝1 (𝑥). By the product forcing theorem, it
must be the case that 𝑥 ∈ 𝑉 holds. Then, let 𝑝0′ = {⟨𝑥, 𝑝0 (𝑥)⟩} and 𝑝1′ = {⟨𝑥, 𝑝1 (𝑥)⟩}
and observe that 𝑝0′ , 𝑝1′ ∈ 𝑉 work as required in the definition of tether.
One immediate corollary of tether is that it places an upper bound on the number
of balanced classes, which we do not know how to obtain in general.
Proposition 10.1.2. Let 𝑃 be a Suslin forcing and 𝜆 be an infinite cardinal. If 𝑃 is
𝜆
𝜆-tethered then there are at most 22 many balanced classes.
Proof. Let 𝐴 be the set of all virtual conditions of 𝑃 represented on posets of car-
dinality smaller than 𝜆. It is a matter of elementary cardinal arithmetic to conclude
that |𝐴| ≤ 2𝜆 . Whenever 𝑝 ̄ is a balanced virtual condition, write 𝐵𝑝̄ = {𝑞 ∈ 𝐴 ∶ 𝑝 ̄ ≤ 𝑞}.
Note that for each 𝑞 ∈ 𝐴, if 𝑞 ∈ 𝐵𝑝̄ then 𝑝 ̄ ≤ 𝑞 and if 𝑞 ∉ 𝐵𝑝̄ then 𝑝,̄ 𝑞 are incompatible.
To prove the proposition, it will be enough to show that the set 𝐵𝑝̄ characterizes the
balanced virtual condition 𝑝.̄
Now suppose that 𝑝0̄ , 𝑝1̄ are balanced virtual conditions such that 𝐵𝑝0̄ = 𝐵𝑝1̄ ; de-
note the common value by 𝐵 and work to show that 𝑝0̄ = 𝑝1̄ . To this end, suppose
that 𝑅0 , 𝑅1 are arbitrary posets, 𝐻0 ⊂ 𝑅0 and 𝐻1 ⊂ 𝑅1 are mutually generic filters and
𝑝0 ∈ 𝑉[𝐻0 ], 𝑝1 ∈ 𝑉[𝐻1 ] are conditions below 𝑝0̄ , 𝑝1̄ respectively. In view of the def-
inition of the equivalence of balanced pairs, it will be enough to show that 𝑝0 , 𝑝1 are
compatible. However, if they were incompatible, by the tether assumption there would
have to be incompatible virtual conditions 𝑝0′ , 𝑝1′ ∈ 𝐴 such that 𝑝0′ , 𝑝0 are compatible
213
214 10. UNIFORMIZATION
and 𝑝1′ , 𝑝1 are compatible. By the note from the previous paragraph, it must be the case
that 𝑝0′ , 𝑝1′ ∈ 𝐵 holds. But then, 𝑝0′ , 𝑝1′ are not incompatible because 𝑝0̄ , 𝑝1̄ are both
their common lower bounds. □
Not every tethered poset must be balanced. As the simplest example of this phenome-
non, use the poset 𝑃 of finite maps from 2𝜔 to 2, ordered by reverse inclusion. The poset
𝑃 is ℵ0 -tethered by the same argument as our initial example above. It is not balanced
as the restriction of the 𝑃-generic function to any ground model infinite countable set
does not belong to the ground model.
Within the class of tethered forcings, the classes of balanced and weakly balanced
posets coincide. This is immediately clear from the following proposition.
Proposition 10.1.3. Let 𝑃 be a Suslin tethered poset. Let 𝑄 be a poset and 𝜏 a 𝑄-
name for an element of 𝑃. Then the pair ⟨𝑄, 𝜏⟩ is balanced if and only if it is weakly
balanced.
Proof. The forward implication is immediate from the definitions and does not
use any tether assumption. For the reverse direction, suppose that the pair ⟨𝑄, 𝜏⟩ is
weakly balanced. Let ⟨𝑅, 𝜎⟩ be a 𝑃-pin. The weak balance of ⟨𝑄, 𝜏⟩ shows that either
𝑅 × 𝑄 ⊩ 𝜏 ≤ 𝜎 or 𝑅 × 𝑄 ⊩ 𝜏 is incompatible with 𝜎 in the separative quotient of
𝑃. Thus, if 𝑆 is any poset, 𝐺0 × 𝐻0 , 𝐺1 × 𝐻1 ⊂ 𝑆 × 𝑄 are filters mutually generic over
𝑉, and 𝑝0 ≤ 𝜏/𝐻0 and 𝑝1 ≤ 𝜏/𝐻1 are conditions in the respective models 𝑉[𝐺0 , 𝐻0 ]
and 𝑉[𝐺1 , 𝐻1 ], then 𝑝0 , 𝑝1 cannot be separated by any virtual conditions in the ground
model. The tether assumption on the poset 𝑃 then shows that the conditions 𝑝0 , 𝑝1 are
compatible. By the definitions, in the ground model the pair ⟨𝑄, 𝜏⟩ is balanced. □
As the last remark, we note that the class of 𝜆-tethered forcings for any fixed cardi-
nal 𝜆 ≥ ℵ0 and the class of tethered forcings are both closed under countable product.
Thus, many uniformization theorems in this chapter can be combined.
10.2. Uniformization theorems

In this section, we prove several preservation theorems for tethered forcing. They
all use a technical proposition we state first.
Proposition 10.2.1. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a poset tethered
cofinally balanced below 𝜅. Let 𝑊 be the symmetric Solovay model derived from 𝜅. Let
𝐺 ⊂ 𝑃 be a filter generic over 𝑊. In the model 𝑊[𝐺], let 𝑎 be any set of ordinals and let
𝑀 be the model of all sets hereditarily definable from parameters in 𝑉 and the additional
parameters 𝑎, 𝐺. Then
(1) 𝑀 is a generic extension of 𝑉 by a poset of cardinality smaller than 𝜅;
(2) there is a balanced virtual condition in 𝑀 whose realization belongs to the filter
𝐺.
Proof. As 𝑀 is a model of ZFC, it belongs to 𝑊 by Theorem 9.1.1 by the cofinal
balance assumption on the poset 𝑃. Viewed from 𝑊, it is a subset of a generic extension
of the ground model by a poset of cardinality smaller than 𝜅 by the basic properties of
the Solovay model (Fact 1.7.16(3)). By basic forcing theory [51, Corollary 15.42] 𝑀 is
itself a generic extension of the ground model by a poset of cardinality smaller than 𝜅.
This verifies item (1).
10.2. UNIFORMIZATION THEOREMS 215
For item (2), use the tether assumption to find a cardinal 𝜆 ∈ 𝜅 such that 𝑀 ⊧ 𝑃
is 𝜆-tethered. Working in 𝑀, let 𝐷 be the set of all virtual conditions in 𝑃 represented
on posets of cardinality smaller than 𝜆. In 𝑊[𝐺], let 𝐶 ⊂ 𝐷 be the set of all virtual
conditions in the set 𝐷 whose realization belongs to the generic filter 𝐺. The set 𝐶 has
just been defined from the ordinal 𝜆 and the ultrafilter 𝐺, so 𝐶 ∈ 𝑀. By the genericity
of the filter 𝐺, there must be a condition 𝑝 ∈ 𝐺 which is below all conditions in 𝐶 and
incompatible with all the conditions in 𝐷 ⧵ 𝐶. By the forcing theorem, in 𝑀 there have
to be a poset 𝑄 of cardinality less than 𝜅 and a 𝑄-name 𝜏 for a condition in 𝑃 such that
𝑄 forces 𝜏 to be below all conditions in 𝐶 and incompatible with all conditions in 𝐷 ⧵ 𝐶,
and such that there is a filter 𝐻 ⊂ 𝑄 generic over the model 𝑀 with 𝑝 = 𝜏/𝐻. We claim
that in the model 𝑀, the pair ⟨𝑄, 𝜏⟩ is balanced.
To see this, suppose towards a contradiction that 𝑅0 , 𝑅1 are posets and 𝐾0 × 𝐻0 ⊂
𝑅0 × 𝑄 and 𝐾1 × 𝐻1 ⊂ 𝑅1 × 𝑄 are filters mutually generic over the model 𝑀 and 𝑝0 , 𝑝1
are conditions in the respective models below 𝜏/𝐻0 and 𝜏/𝐻1 respectively. We must
show that 𝑝0 , 𝑝1 are compatible. This, however, is immediately clear from the 𝜆-tether
assumption and the fact that for every virtual condition 𝑝 ̄ on 𝑃 represented on a poset
of cardinality less than 𝜆 and for every 𝑖 ∈ 2, 𝑝 ̄ ≥ 𝑝𝑖 ↔ 𝑝 ̄ ∈ 𝐶 and 𝑝 ̄ is incompatible
with 𝑝𝑖 if and only if 𝑝 ̄ ∉ 𝐶.
Still working in the model 𝑀, let 𝑝 ̄ be a balanced virtual condition in the balance
class of ⟨𝑄, 𝜎⟩, obtained from Theorem 5.2.8. Clearly, the filter 𝐺 contains a realization
of it. □
All theorems below are stated using Convention 1.7.18. In the first theorem, we show
that sets whose vertical sections are 𝐸-classes for a suitably regular equivalence relation
𝐸 can be uniformized.
Definition 10.2.2. Let 𝐸 be an equivalence relation on a Polish space 𝑋.
𝐸-uniformization is the statement: if 𝐵 ⊂ 2𝜔 × 𝑋 is a set whose vertical sections are
𝐸-classes, then there is a function 𝑓 ⊂ 𝐵 such that for every 𝑦 ∈ 2𝜔 , if 𝐵𝑦 ≠ 0 then 𝑓(𝑦)
is defined (and is an element of 𝐵𝑦 ).
Theorem 10.2.3. Let 𝐸 be a pinned Borel equivalence relation on a Polish space 𝑋.
In tethered, cofinally balanced extensions of the symmetric Solovay model, 𝐸-uniformiz-
ation holds.
To parse the statement of the theorem correctly, note that 𝑃 needs to be tethered in all
forcing extensions and balanced only in cofinally many forcing extensions below the
inaccessible cardinal which gives rise to the symmetric Solovay model.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing which is bal-

anced cofinally below 𝜅 and tethered below 𝜅. Let 𝑊 be a symmetric Solovay model
derived from 𝜅. Let 𝑝 ∈ 𝐺 be a condition and let 𝜏 be a 𝑃-name for a subset of 2𝜔 × 𝑋
such that each vertical section of 𝜏 is a single 𝐸-class. Let 𝑧 ∈ 2𝜔 be a point such that
both 𝑝, 𝜏 are definable from 𝑧 and a ground model parameter. Let 𝐺 ⊂ 𝑃 be a filter
generic over 𝑊, containing the condition 𝑝, and work in 𝑊[𝐺]. Write 𝐵 = 𝜏/𝐺. Let
𝑦 ∈ 2𝜔 be an arbitrary point and let 𝑀𝑦 be the model of all sets hereditarily definable
from 𝐺, 𝑦, and parameters in the ground model. By Proposition 10.2.1, there is a bal-
anced virtual condition 𝑝 ̄ in 𝑀𝑦 whose realization belongs to the filter 𝐺. Necessarily,
𝑝 ̄ ≤ 𝑝.
In the model 𝑀𝑦 , we will show that Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩𝑃 𝜏𝑦 ∩ 𝑀𝑦 ≠ 0. Once this

is done, the set 𝐵 can be uniformized by the set of all pairs ⟨𝑦, 𝑥⟩ such that 𝑥 ∈ 𝑀𝑦 is
the first point in the canonical well-ordering of the model 𝑀𝑦 which belongs to 𝐵𝑦 .
To prove the forcing statement in the previous paragraph, suppose towards a con-
tradiction that it fails. Move to the model 𝑀𝑦 . There have to be a poset 𝑅 of cardinality
smaller than 𝜅 and 𝑅-names 𝜎 for a condition in 𝑃 stronger than 𝑝 ̄ and 𝜂 for an element
of 𝑋 which has no 𝐸-equivalent in the model 𝑀𝑦 such that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃
⟨𝑦,̌ 𝜂⟩ ∈ 𝜏. In 𝑊, let 𝐻0 , 𝐻1 ⊂ 𝑅 be filters mutually generic over the model 𝑀𝑦 . Write
𝑝0 = 𝜎/𝐻0 , 𝑝1 = 𝜎/𝐻1 , 𝑥0 = 𝜂/𝐻0 and 𝑥1 = 𝜂/𝐻1 . The balance of the condition 𝑝 ̄
implies that 𝑝0 , 𝑝1 ∈ 𝑃 are compatible conditions with a lower bound 𝑞. The pinned
assumption on the equivalence relation implies that 𝑥0 , 𝑥1 ∈ 𝑋 are not 𝐸-related.
Since 𝑊 is also a symmetric Solovay extension of both 𝑀𝑦 [𝐻0 ] and 𝑀𝑦 [𝐻1 ], the
forcing theorem applied in these two models implies that 𝑞 ⊩ 𝑥0̌ , 𝑥1̌ ∈ 𝜏𝑦 . This is
impossible as 𝜏 is forced to be an 𝐸-class and 𝑥0 , 𝑥1 are not 𝐸-related. □
Theorem 10.2.3 is the strongest possible result of its kind, as the following observation
shows.
Theorem 10.2.4. Let 𝐸 be an unpinned Borel equivalence relation on a Polish space
𝑋. Then 𝐸-uniformization fails in balanced extensions of the Solovay model.
Proof. Let 𝑊[𝐺] be a balanced extension of the Solovay model and work in 𝑊[𝐺].
For each parameter 𝑧 ∈ 2𝜔 write 𝑀𝑧 for the model of all sets hereditarily definable from
parameters in 𝑉 and additional parameters 𝐺 and 𝑧. The model 𝑀𝑧 is well-ordered and
therefore by Theorem 9.1.1, it is a well-ordered subclass of 𝑊 and an extension of 𝑉
by a poset of cardinality smaller than 𝜅. The Borel equivalence relation 𝐸 is unpinned
in 𝑀𝑧 by Theorem 2.7.1. By Theorem 2.6.3, 𝑀𝑧 ⊧there is a nontrivial 𝐸-pinned name
on the poset Coll(𝜔, 𝜔1 ). Note that (𝒫(𝜔1 ))𝑀𝑧 is a countable set in 𝑊. Thus, one can
successfully define the set 𝐵 ⊂ 2𝜔 × 𝑋 by setting ⟨𝑧, 𝑥⟩ ∈ 𝐵 if there is a filter 𝑔 ⊂
𝑀
Coll(𝜔, 𝜔1 𝑧 ) generic over 𝑀𝑧 such that 𝜏𝑧 /𝑔 𝐸 𝑥, where 𝜏𝑧 is the first 𝐸-unpinned
name in the canonical well-ordering of the model 𝑀𝑧 . Every vertical section of the set
𝐵 then consists of precisely one 𝐸-equivalence class.
To see that the set 𝐵 cannot be uniformized, note that every 𝑃-name in the model
𝑊 is definable from a real parameter and some additional parameters in the ground
model, and therefore every element of 𝑊[𝐺] is definable from a real parameter, the
generic filter 𝐺, and some additional parameters in the ground model. Thus, if 𝑓 ∶ 2𝜔 →
𝑋 is a putative uniformization of the set 𝐵, one can find a real parameter 𝑧 ∈ 2𝜔 such
that 𝑓 is definable from 𝑧, 𝐺 and some elements of the ground model. Then 𝑓(𝑧) should
be an element of the model 𝑀𝑧 by the definition of the model 𝑀𝑧 . At the same time,
the vertical sections 𝐵𝑧 contains no elements of 𝑀𝑧 by the definition of the set 𝐵. □
As the second uniformization result, we prove that a strong version of the
countable-to-one uniformization statement holds in the extensions of the Solovay
model by tethered balanced forcings.
Definition 10.2.5. Let 𝐸 be an equivalence relation on a Polish space 𝑋. 𝐸-well-
orderable uniformization is the statement: if 𝐸 is a Borel equivalence relation on a Pol-
ish space 𝑋 and 𝐵 ⊂ 2𝜔 × 𝑋 is a set, then the following are equivalent:
(1) for every 𝑦 ∈ 2𝜔 , 𝐵𝑦 is a union of a well-orderable collection of 𝐸-classes;
(2) 𝐵 = ⋃𝛼 𝐵𝛼 where for each ordinal 𝛼, 𝐵𝛼 ⊂ 2𝜔 × 𝑋 is a set whose vertical

sections are either empty or 𝐸-classes and the variable 𝛼 ranges over ordinals.
Clearly, only the implication (1)→(2) has nontrivial content. As a very special case, one
can consider a set 𝐵 ⊂ 2𝜔 × 𝑋 with all vertical sections countable and 𝐸 the identity
on 𝑋. Then (2) yields in particular a function uniformizing the set 𝐵: for each 𝑦 with
𝐵𝑦 nonempty find the least 𝛼 = 𝛼𝑦 for which the vertical section (𝐵𝛼 )𝑦 is nonempty
and then let 𝑓(𝑦) = 𝑥 for the unique 𝑥 ∈ 𝑋 such that ⟨𝑦, 𝑥⟩ ∈ 𝐵𝛼𝑦 . This is the familiar
countable-to-one uniformization.
Theorem 10.2.6. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. In teth-

ered, cofinally balanced extensions of the symmetric Solovay model, 𝐸-well-orderable uni-
formization holds.

anced cofinally below 𝜅 and tethered below 𝜅. Let 𝑊 the symmetric Solovay model
derived from 𝜅. In the model 𝑊, let 𝑝 ∈ 𝑃 be a condition and 𝜏 be a 𝑃-name such that
𝑝 ⊩ 𝜏 ⊂ 2𝜔 × 𝑋 is a set whose vertical sections are well-orderable unions of 𝐸-classes.
Let 𝑧 ∈ 2𝜔 be a parameter such that 𝑝, 𝜏 are both definable from 𝑧 and some additional
ground model parameters. Let 𝐺 ⊂ 𝑃 be a generic filter meeting the condition 𝑝 and
let 𝐵 = 𝜏/𝐺. Work in the model 𝑊[𝐺].
Fix a point 𝑦 ∈ 2𝜔 and consider the model 𝑀𝑦 of all sets hereditarily definable from
parameters 𝑦, 𝑧, 𝐺 and parameters in the ground model. We claim that the vertical
section 𝐵𝑦 consists of realizations of virtual 𝐸-classes of the model 𝑀𝑦 . Once this is
proved, one can decompose the set 𝐵 into the union 𝐵 = ⋃𝛼 𝐵𝛼 by setting ⟨𝑦, 𝑥⟩ ∈ 𝐵𝛼 if
⟨𝑦, 𝑥⟩ ∈ 𝐵 and 𝑥 belongs to the realization of 𝛼-th virtual 𝐸-class in 𝑀𝑦 in the canonical
well-ordering of the model 𝑀𝑦 .
To this end, use Proposition 10.2.1 to argue that there is a balanced virtual condi-
tion 𝑝 ̄ in the model 𝑀𝑦 such that its realization belongs to the generic filter 𝐺. Nec-
essarily 𝑝 ̄ ≤ 𝑝 must hold. Now, move to the model 𝑀𝑦 and argue that in this model,
Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩𝑃 𝜏𝑦̌ consists of realizations of virtual 𝐸-classes of the model 𝑀𝑦 .
The proof of the theorem is then concluded by an appeal to the forcing theorem applied
in 𝑀𝑦 .
Suppose towards a contradiction that the forcing statement in the previous para-
graph fails and work in 𝑀𝑦 . In view of Corollary 9.1.3, there exist a poset 𝑅0 of cardinal-
ity less than 𝜅, an 𝑅0 -name 𝜂 for an element of 𝑋 𝜔 and an 𝑅0 -name 𝜎0 for an element
of 𝑃 stronger than 𝑝 ̄ such that 𝑅0 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎0 ⊩𝑃 ∀𝑥 ∈ 𝑋 ⟨𝑦,̌ 𝑥⟩ ∈ 𝜂 ↔ ∃𝑖 𝑥 𝐸
𝜂(𝑖). Also there must be a poset 𝑅1 of cardinality smaller than 𝜅, an 𝑅1 -name 𝜒 for an
element of 𝑋 which is forced not to realize any virtual 𝐸-class in 𝑀𝑦 , and an 𝑅1 -name
𝜎1 for a condition in 𝑃 stronger than 𝑝 ̄ such that 𝑅1 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎1 ⊩ ⟨𝑦,̌ 𝜒⟩ ∈ 𝜏.
Working in 𝑊, let 𝐻0 ⊂ 𝑅0 and 𝐻1 ⊂ 𝑅1 be filters mutually generic over 𝑉, let
𝑢 = 𝜂/𝐻0 ∈ 𝑋 𝜔 , 𝑥 = 𝜒/𝐻1 ∈ 𝑋, 𝑝0 = 𝜎0 /𝐻0 ∈ 𝑃 and 𝑝1 = 𝜎1 /𝐻1 ∈ 𝑃. The balance
of the condition 𝑝 ̄ implies that 𝑝0 , 𝑝1 are compatible conditions in the poset 𝑃 with a
lower bound 𝑞. The choice of the name 𝜒 implies that 𝑥 is not 𝐸-related to any element
on the sequence 𝑢. Since 𝑊 is a symmetric Solovay extension of the model 𝑀𝑦 [𝐻0 ],
the forcing theorem applied in that model says that 𝑞 ⊩ 𝜏 = [rng(𝑢)]𝐸 . Since 𝑊 is a
symmetric Solovay extension of the model 𝑀𝑦 [𝐻1 ], the forcing theorem applied in that
model says that 𝑞 ⊩ 𝑥̌ ∈ 𝜏. Since 𝑥 ∉ [rng(𝑢)]𝐸 , this is a contradiction. □
As the last uniformization result, we prove that a strong version of Saint Raymond
uniformization holds in generic extensions of the Solovay model by tethered balanced
forcing.
Definition 10.2.7. Let 𝐼 be a downward closed collection of closed subsets of a
Polish space 𝑋. 𝐼-Saint Raymond uniformization is the following statement: for every
set 𝐵 ⊂ 2𝜔 × 𝑋, the following are equivalent:
(1) for every 𝑦 ∈ 2𝜔 , 𝐵𝑦 is a union of a well-ordered collection of sets in 𝐼;
(2) 𝐵 = ⋃𝛼 𝐵𝛼 where for each ordinal 𝛼 and each 𝑦 ∈ 2𝜔 , the vertical section
(𝐵𝛼 )𝑦 ⊂ 𝑋 is closed and belongs to 𝐼.
As in the previous theorem, only the (1)→(2) implication has content. In the case of
𝐼 =the collection of singletons (plus the empty set), we can again derive the familiar
countable-to-one uniformization as a very special case. The following theorem is stated
using Convention 1.7.18.
Theorem 10.2.8. Let 𝐼 be an analytic collection of closed subsets of a Polsh space
𝑋. In tethered, cofinally balanced extensions of the symmetric Solovay model, the 𝐼-Saint-
Raymond uniformization holds.
anced cofinally below 𝜅 and tethered below 𝜅. Let 𝑊 be the symmetric Solovay model
derived from 𝜅 and work in 𝑊. Let 𝑝 ∈ 𝑃 be a condition and 𝜏 a 𝑃-name for a subset
of 2𝜔 × 𝑋 whose vertical sections are well-ordered unions of sets in 𝐼. Let 𝑧 ∈ 2𝜔 be a
parameter such that 𝑝, 𝜏 are both definable from 𝑧 and some additional ground model
parameters. Let 𝐺 ⊂ 𝑃 be a generic filter meeting the condition 𝑝 and let 𝐵 = 𝜏/𝐺.
Work in 𝑊[𝐺]. Fix a point 𝑦 ∈ 2𝜔 and consider the model 𝑀𝑦 of sets hereditarily
definable from parameters 𝐺, 𝑧, 𝑦 and parameters in the ground model. We claim that
every nonempty vertical section 𝐵𝑦 is a union of sets in 𝐼 which are coded in the model
𝑀𝑦 . Once this is proved, one can decompose the set 𝐵 into the union 𝐵 = ⋃𝛼 𝐵𝛼 by
setting ⟨𝑦, 𝑥⟩ ∈ 𝐵𝛼 if ⟨𝑦, 𝑥⟩ ∈ 𝐵 and 𝑥 belongs to the 𝛼-th set in 𝐼 in the model 𝑀𝑦 in the
canonical well-ordering of the model 𝑀𝑦 , and this 𝛼-th set is a subset of 𝐵.
To prove this, first use Proposition 10.2.1 to find a balanced virtual condition 𝑝 ̄ in
𝑀𝑦 whose realization belongs to the generic filter 𝐺. Work in the model 𝑀𝑦 and argue
that Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩𝑃 𝜏𝑦 is a union of a collection of ground model coded elements
of 𝐼. By the forcing theorem applied in the model 𝑀𝑦 , this will complete the proof.
To prove the forcing statement in the previous paragraph, work in 𝑀𝑦 . Suppose
towards a contradiction that it fails. By the assumptions on the name 𝜏, there must
be a poset 𝑅0 of cardinality smaller than 𝜅 and 𝑅0 -name 𝜂 for a countable sequence of
elements of 𝐼 and an 𝑅0 -name 𝜎0 for a condition in 𝑃 stronger than 𝑝 ̄ such that 𝑅0 ⊩
Coll(𝜔, < 𝜅) ⊩ 𝜎0 ⊩𝑝 ⟨𝑦,̌ 𝑥⟩ ∈ 𝜂 ↔ ∃𝑖 𝑥 ∈ 𝜂(𝑖). By the contradictory assumption, there
also must be a poset 𝑅1 of cardinality smaller than 𝜅 and 𝑅1 -name 𝜒 for an element of
𝑋 and an 𝑅1 -name 𝜎1 for a condition in 𝑃 stronger than 𝑝 ̄ such that 𝑅1 ⊩ Coll(𝜔, <
𝜅) ⊩ 𝜎1 ⊩ ⟨𝑦,̌ 𝜒⟩ ∈ 𝜏 and 𝜒 does not belong to any element of 𝐼 which belongs to 𝑀𝑦
and is a subset of 𝜏𝑦̌.
Move to the model 𝑊. Let 𝐻0 , 𝐻1 ⊂ 𝑅0 , 𝑅1 be filters mutually generic over 𝑀𝑦 ,
and let 𝑝0 = 𝜎0 /𝐻0 and 𝑝1 = 𝜎1 /𝐻1 . By the balance of the condition 𝑝,̄ 𝑝0 , 𝑝1 ∈
𝑃 are compatible conditions with a lower bound 𝑞 ∈ 𝑃. Let 𝑥 = 𝜒/𝐻1 ∈ 𝑋. The
contradiction is now reached by a split into cases.
Case 1. There exist a condition 𝑟 ∈ 𝐻1 and a closed set 𝐶 ∈ rng(𝜂/𝐻0 ) such that
the ground model closed set 𝐷 = 𝑋 ⧵ ⋃{𝑂 ∶ 𝑂 ⊂ 𝑋 is a basic open set such that
𝑟 ⊩ 𝜒 ∉ 𝑂} is a subset of 𝐶. By the closure of the collection 𝐼 under subsets, 𝐷 ∈ 𝐼
holds; by the definition of the set 𝐷, 𝑥 ∈ 𝐷 holds. Now, 𝑊 is the symmetric Solovay
extension of both models 𝑀𝑦 [𝐻0 ] and 𝑀𝑦 [𝐻1 ]. The forcing theorem applied in 𝑀𝑦 [𝐻0 ]
shows that 𝑊 ⊧ 𝑞 ⊩ 𝐷 ⊂ 𝐶 ⊂ 𝜏. The forcing theorem applied in 𝑀𝑦 [𝐻1 ] shows that
𝑊 ⊧ 𝑞 ⊩ 𝑥̌ ∈ 𝐷 and 𝑥̌ belongs to no ground model closed set in 𝐼 which is a subset of
𝜏𝑦 . Thus, the same condition 𝑞 forces two contradictory statements.
Case 2. Case 1 fails. Then, by the mutual genericity of the filters 𝐻0 , 𝐻1 it must be the
case that 𝑥 ∉ ⋃ rng(𝜂/𝐻0 ). Now, 𝑊 is the symmetric Solovay extension of both models
𝑀𝑦 [𝐻0 ] and 𝑀𝑦 [𝐻1 ]. The forcing theorem applied in 𝑀𝑦 [𝐻0 ] shows that 𝑊 ⊧ 𝑞 ⊩
𝜏𝑦 = ⋃ rng(𝜂/𝐻0 ). The forcing theorem applied in 𝑀𝑦 [𝐻1 ] shows that 𝑊 ⊧ 𝑞 ⊩ 𝑥̌ ∈
𝜏𝑦 ⧵ ⋃ rng(𝜂/𝐻0 ). So again, the same condition 𝑞 forces two contradictory statements.
The proof is complete. □
There are also consequences of tether which have apparently nothing to do with uni-
formization. The following theorem is stated using Convention 1.7.18.
Theorem 10.2.9. In 𝜎-closed, balanced, ℵ0 -tethered extensions of a symmetric Solo-

vay model there are no tournaments on the 𝔽2 -quotient space.
The 𝜎-closure demand can be relaxed to include the formally not 𝜎-closed posets of
Section 8.1; we omit the details. The role of ℵ0 -tether is less clear. The linearization
poset on the 𝔽2 -quotient space of Example 8.7.5 is 𝜎-closed, balanced, and adds a tour-
nament, so clearly some additional assumption beyond the closure and balance is nec-
essary. However, ℵ0 -tether is not preserved under taking a regular subposet, while the
conclusion of the theorem is. Thus, there is a room for improvement in the statement
of the theorem.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing which is 𝜎-

closed, and balanced and ℵ0 -tethered below 𝜅. Let 𝑊 be a symmetric Solovay model
derived from 𝜅 and work in 𝑊. Suppose towards a contradiction that 𝑝 ∈ 𝑃 is a condi-
tion and 𝜏 is a 𝑃-name such that 𝑝 ⊩ 𝜏 is a tournament on the 𝔽2 -quotient space. Both
𝑝, 𝜏 must be definable from some real parameter 𝑧 ∈ 2𝜔 and some parameters in the
ground model. Let 𝑉[𝐾] is an intermediate extension by a poset of size < 𝜅 such that
𝑧 ∈ 𝑉[𝐾].
Work in the model 𝑉[𝐾] for a moment. Let 𝑝 ̄ ≤ 𝑝 be a balanced virtual condition
in the poset 𝑃 in 𝑉[𝐾]. Let 𝜆 < 𝜅 be a cardinal such that 𝑝 ̄ is represented on a poset
of size < 𝜆, let 𝑄0 be the finite support product of copies of Coll(𝜔, 𝜆) indexed by 𝜆+
with finite product of copies of the Cohen forcing indexed by 2 × 𝜆+ . for any ordinal
𝛼 ∈ 𝜆+ write 𝑄0𝛼 for the part of the product indexed by ordinals below 𝛼. Let 𝜂0 and 𝜂1
be the 𝑄0 -names for the sets of Cohen generic reals indexed by {0} × 𝜆+ and {1} × 𝜆+
respectively. In the 𝑄0 -extension of 𝑉[𝐾] consider the poset 𝑄1 which is the poset 𝑃 of
conditions which are stronger than some realization of 𝑝.̄ Let 𝑄 denote the iteration
𝑄0 ∗ 𝑄1̇ , and let 𝜒 be a 𝑄-name for the virtual condition in 𝑃 consisting of all conditions
in 𝑃 stronger than all conditions in the generic filter on 𝑄1̇ .
Claim 10.2.10. 𝑄 forces 𝜒 to be a balanced virtual condition in 𝑃 below 𝑝.̄

Proof. Let 𝐺 ⊂ 𝑄0 and 𝐻 ⊂ 𝑄1 be generic filters over 𝑉[𝐾] and work in

𝑉[𝐾][𝐺][𝐻]. First, use the 𝜎-closure assumption on 𝑃 to conclude that in fact 𝜒/𝐺 ∗ 𝐻
is forced to be a nonzero virtual condition. In some further collapse extension, the fil-
ter 𝐻 contains a cofinal countable sequence, which then has a lower bound and that
lower bound will be a condition below 𝜒/𝐺 ∗ 𝐻.
Second, use the tether assumption to conclude that 𝜒/𝐺 ∗ 𝐻 is a balanced virtual
condition. Observe that by a genericity argument with the filter 𝐻, for every analytic
subset 𝐴 ⊂ 𝑃 coded in the 𝑉[𝐾][𝐺0 ], 𝐻 contains a condition which is either below
some element of 𝐴 or incompatible with all elements of 𝐴. Since the poset 𝑃 (so 𝑄1
as well) is 𝜎-closed in 𝑉[𝐾][𝐺], it does not add any new analytic subsets of 𝑃. As a
result, it is forced that 𝜒/𝐺 ∗ 𝐻 is either stronger than or incompatible with any given
virtual condition in 𝑃 in the model 𝑉[𝐾][𝐺][𝐻] carried by a poset of size < ℵ0 (i.e. an
analytic subset of 𝑃). The balance of 𝜒/𝐺 ∗ 𝐻 immediately follows from the definition
of ℵ0 -tether. □
Since 𝜒 is forced to be balanced, we also have 𝑄 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜒 decides the

statement ⟨𝜂0 , 𝜂1 ⟩ ∈ 𝜏. Let 𝑞 ∈ 𝑄 be a condition such that 𝑞 ⊩𝑄 Coll(𝜔, < 𝜅) ⊩ 𝜒 ⊩𝑃
⟨𝜂0 , 𝜂1 ⟩ ∈ 𝜏 (or vice versa). Let 𝑞 = ⟨𝑞0 , 𝑞1̇ ⟩ be a breakdown of the condition 𝑞 in the
iteration 𝑄0 ∗ 𝑄1̇ . Use the 𝜆+ -c.c. of the poset 𝑄0 to find an ordinal 𝛼 ∈ 𝜆+ such that 𝑞0
is a condition in 𝑄0𝛼 and 𝑞1̇ is a 𝑄0𝛼 -name.
Claim 10.2.11. There are filters 𝐺0 , 𝐺1 ⊂ 𝑄0 which are separately generic over 𝑉[𝐾]
such that
(1) 𝐺0 ∩ 𝑄0𝛼 and 𝐺1 ∩ 𝑄0𝛼 are mutually generic over 𝑉[𝐾], both containing 𝑞;
(2) 𝑉[𝐾][𝐺0 ] = 𝑉[𝐾][𝐺1 ]
(3) 𝜂0 /𝐺0 = 𝜂1 /𝐺1 and 𝜂1 /𝐺0 = 𝜂0 /𝐺1 .
Proof. Let 𝐼 = 𝜆 ∪ (2 × 𝜆). Consider any bijection 𝜋 ∶ 𝐼 → 𝐼 such that 𝜋″ 𝜆 = 𝜆.

Such a bijection induces an automorphism of the poset 𝑄 and the class of 𝑄-names,
which by an abuse of notation we denote by 𝜋 again. If in addition we assume that
𝜋″ {0} × 𝜆 = {1} × 𝜆 and 𝜋″ {1} × 𝜆 = 𝜋{0} × 𝜆, then the automorphism switches the
names 𝜂0 and 𝜂1 . If in addition we assume that 𝜋″ 𝛼 is disjoint from 𝛼 and 𝜋″ (2 × 𝛼) is
disjoint from 2 × 𝛼, then the conditions 𝑞, 𝜋(𝑞) are compatible. Let 𝐺0 ⊂ 𝑄0 be a filter
generic over 𝑉[𝐾] meeting the lower bound of 𝑞 and 𝜋(𝑞), and let 𝐺1 = (𝜋−1 )″ 𝐺0 . The
filters 𝐺0 , 𝐺1 are as required. □
Now, let 𝐺0 , 𝐺1 be filters as in the claim. Let 𝐴0 = 𝜂0 /𝐺0 = 𝜂1 /𝐺1 and 𝐴1 = 𝜂1 /𝐺0 =
𝜂0 /𝐺1 . The conditions 𝑝0 = 𝑞/𝐺 ̇ 0 and 𝑝1 = 𝑞/𝐺̇ 1 are compatible in the poset 𝑃 by
(1), and their lower bound must exist in the model 𝑉[𝐾][𝐺0 ] = 𝑉[𝐾][𝐺1 ]. Let 𝐻 ⊂ 𝑃
be a filter generic over 𝑉[𝐾][𝐺0 ] meeting that lower bound and consider the balanced
virtual condition 𝑝 ̄ = 𝜒/𝐺0 ∗ 𝐻, which is equal to 𝜒/𝐺1 ∗ 𝐻. Now, since the filter
𝐺0 ∗ 𝐻 ⊂ 𝑄 contains the condition 𝑞, the forcing theorem shows that in the model 𝑊,
𝑝 ̄ ⊩ ⟨𝐴0̌ , 𝐴1̌ ⟩ ∈ 𝜏. By the same argumentation, since the filter 𝐺1 ∗ 𝐻 ⊂ 𝑄 contains the
condition 𝑞, the forcing theorem shows that in the model 𝑊, 𝑝 ̄ ⊩ ⟨𝐴1̌ , 𝐴0̌ ⟩ ∈ 𝜏. This is
a contradiction concluding the proof. □
10.3. EXAMPLES 221
10.3. Examples
In this section we present several examples of tethered and untethered partial
orders. In all affirmative examples below, the conclusion is that in view of Theo-
rems 10.2.3, 10.2.6, and 10.2.8, the extensions of the symmetric Solovay model by the
posets in question satisfy the pinned uniformization, the well-orderable uniformiza-
tion, and the Saint Raymond uniformization.
We start with simplicial complex posets which naturally live on Polish spaces as
opposed to quotient spaces.
𝑋. The poset 𝑃 = 𝑃𝒦 is ℵ0 -tethered.
Proof. Let 𝑓 be a Borel fragmentation function, assigning to each 𝑎 ∈ 𝒦 a count-
able partial function from 𝑌 to 𝑍, where 𝑌 and 𝑍 are Polish spaces. Suppose that
𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions of 𝑉 and 𝑝0 ∈ 𝑉[𝐻0 ], 𝑝1 ∈ 𝑉[𝐻1 ] are
incompatible conditions in 𝑃. It must be the case that 𝑓(𝑝0 )∪𝑓(𝑝1 ) is not a function. In
other words, there must be a point 𝑦 ∈ dom(𝑓(𝑝0 )) ∩ dom(𝑓(𝑝1 )) and pairwise disjoint
basic open sets 𝑂0 , 𝑂1 ⊂ 𝑍 such that 𝑓(𝑝0 )(𝑦) ∈ 𝑂0 and 𝑓(𝑝1 )(𝑦) ∈ 𝑂1 . By the product
forcing theorem, 𝑦 ∈ 𝑌 ∩ 𝑉 holds. Let 𝐴0 = {𝑝 ∈ 𝑃 ∶ 𝑦 ∈ dom(𝑓(𝑝)) ∧ 𝑓(𝑝)(𝑦) ∈ 𝑂0 }
and 𝐴1 = {𝑝 ∈ 𝑃 ∶ 𝑦 ∈ dom(𝑓(𝑝)) ∧ 𝑓(𝑝)(𝑦) ∈ 𝑂1 }. These are analytic subsets of 𝑃
coded in the ground model. By the definitory properties of the fragmentation 𝑓, Σ𝐴0
and Σ𝐴1 are incompatible elements of the completion of 𝑃. In addition, 𝑝0 ≤ Σ𝐴0 and
𝑝1 ≤ Σ𝐴1 holds. This completes the proof of the example. □
Example 10.3.2. Let 𝒦 be a 𝐺𝛿 -matroid on a Polish space 𝑋 as in Definition 6.3.8.
Then the poset 𝑃 = 𝑃𝒦 is ℵ0 -tethered.
Proof. Suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions of 𝑉 and 𝑝0 ∈
𝑉[𝐻0 ], 𝑝1 ∈ 𝑉[𝐻1 ] are incompatible conditions. Expanding the models 𝑉[𝐻0 ], 𝑉[𝐻1 ]
and strengthening the conditions 𝑝0 , 𝑝1 if necessary, we may assume that for every
point 𝑥 ∈ 𝑋 ∩ 𝑉, either 𝑥 ∈ 𝑝0 or 𝑝0 ∪ {𝑥} is not a 𝒦-set, and similarly for 𝑝1 .
Let 𝑞0 = 𝑝0 ∩𝑉 and 𝑞1 = 𝑝1 ∩𝑉. There are several cases. If 𝑞0 ≠ 𝑞1 , with say a point
𝑥 ∈ 𝑞0̄ ⧵ 𝑞1 , then let 𝐴0 = {𝑞 ∈ 𝑃 ∶ 𝑥 ∈ 𝑞} and 𝐴1 = {𝑞 ∈ 𝑃 ∶ ∃𝑎 ∈ [𝑞]<ℵ0 𝑎 ∪ {𝑥} ∉ 𝒦}.
It is clear that both sets 𝐴0 , 𝐴1 ⊂ 𝑃 are analytic and their suprema Σ𝐴0 and Σ𝐴1 are
incompatible in 𝑃, and 𝑝0 ≤ Σ𝐴0 and 𝑝1 ≤ Σ𝐴1 . Suppose then that 𝑞0 = 𝑞1 , denote
the common value 𝑝 ̄ and use the product forcing theorem to show that 𝑝 ̄ ∈ 𝑉 holds.
Suppose first that 𝑝 ̄ is not a maximal 𝒦-set. Then there must be 𝑥 ∈ 𝑋 ⧵ 𝑝 ̄ such that
𝑝 ̄ ∪ {𝑥} is a 𝒦-set and inclusion-minimal finite sets 𝑎0 ⊂ 𝑝0 and 𝑎1 ⊂ 𝑝1 such that
𝑎0 ∪ {𝑥} ∉ 𝒦 and 𝑎1 ∪ {𝑥} ∉ 𝒦. By the assumption on 𝑥, 𝑎0 ⊄ 𝑉 and 𝑎1 ⊄ 𝑉 must
hold. Let 𝑏 = 𝑎0 ∩ 𝑎1 and let 𝑂0 , 𝑂1 ⊂ 𝑋 be basic open sets separating the nonempty
sets 𝑎0 ⧵ 𝑏 and 𝑎1 ⧵ 𝑏; note that 𝑏 ∈ 𝑉 holds by the product forcing theorem. Let
𝐴0 = {𝑞 ∈ 𝑃 ∶ 𝑏 ⊂ 𝑞 and there is a finite set 𝑐 ⊂ 𝑞 ∩ 𝑂0 such that 𝑏 ∪ 𝑐 ∪ {𝑥} ∉ 𝒦} and
𝐴1 = {𝑞 ∈ 𝑃 ∶ 𝑏 ⊂ 𝑞 and there is a finite set 𝑐 ⊂ 𝑞∩𝑂0 such that 𝑏∪𝑐∪{𝑥} ∉ 𝒦}. Clearly,
𝐴0 , 𝐴1 ⊂ 𝑃 are analytic sets coded in the ground model, Σ𝐴0 and Σ𝐴1 are incompatible
in 𝑃 by the exchange property of the matroid 𝒦, and 𝑝0 ≤ Σ𝐴0 and 𝑝1 ≤ Σ𝐴1 .
We come to the last case, where 𝑝 ̄ is a maximal 𝒦-set in the ground model. This
is impossible though: 𝑝 ̄ is then a balanced virtual condition in 𝑃 by Theorem 6.3.9,
𝑝0 ≤ 𝑝 ̄ and 𝑝1 ≤ 𝑝,̄ so 𝑝0 , 𝑝1 must be compatible by the balance of 𝑝.̄ This contradicts
the initial choice of 𝑝0 , 𝑝1 . □
Example 10.3.3. Let Γ be a Borel graph on a Polish space 𝑋 of countable coloring

number. The Γ-coloring poset 𝑃 of Definition 8.1.1 is ℵ0 -tethered.
Proof. We identify 𝑃 with its Suslin dense subset isolated in Theorem 8.1.2. Sup-
pose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions of 𝑉 and 𝑝0 ∈ 𝑉[𝐻0 ], 𝑝1 ∈
𝑉[𝐻1 ] are incompatible conditions. Expanding the models 𝑉[𝐻0 ], 𝑉[𝐻1 ] and strength-
ening the conditions 𝑝0 , 𝑝1 if necessary, we may assume that for every point 𝑥 ∈ 𝑋 ∩ 𝑉,
𝑥 ∈ dom(𝑝0 ) and 𝑥 ∈ dom(𝑝1 ) both hold.
Let 𝑞0 = 𝑝0 ↾ 𝑉 and 𝑞1 = 𝑝1 ↾ 𝑉. Suppose first that 𝑞0 ≠ 𝑞1 . Then there must be a
point 𝑥 ∈ 𝑉 and distinct numbers 𝑛0 , 𝑛1 ∈ 𝜔 such that 𝑞0 (𝑥) = 𝑛0 and 𝑞1 (𝑥) = 𝑛1 . Let
𝐴0 = {𝑞 ∈ 𝑃 ∶ 𝑥 ∈ dom(𝑞) ∧ 𝑞(𝑥) = 𝑛0 } and 𝐴1 = {𝑞 ∈ 𝑃 ∶ 𝑥 ∈ dom(𝑞) ∧ 𝑞(𝑥) = 𝑛1 }.
Clearly, 𝐴0 , 𝐴1 ⊂ 𝑃 are analytic sets coded in the ground model, Σ𝐴0 and Σ𝐴1 are
incompatible in 𝑃 and 𝑝0 ≤ Σ𝐴0 and 𝑝1 ≤ Σ𝐴1 .
Now suppose that 𝑞0 = 𝑞1 and work towards a contradiction. Write 𝑝 ̄ for the
common value and note that by the product forcing theorem, 𝑝 ̄ ∈ 𝑉 holds. Now 𝑝 ̄ is a
balanced virtual condition in 𝑃 by Theorem 8.1.2, 𝑝0 ≤ 𝑝 ̄ and 𝑝1 ≤ 𝑝,̄ so 𝑝0 , 𝑝1 must
be compatible by the balance of 𝑝.̄ This contradicts the initial choice of 𝑝0 , 𝑝1 . □
Example 10.3.4. Let Γ, Δ be abelian Polish groups, with Δ divisible. The homo-
morphism poset of Definition 8.3.1 is ℵ0 -tethered.
Proof. Suppose that 𝑉[𝐻0 ], 𝑉[𝐻1 ] are mutually generic extensions of 𝑉 and 𝑝0 ∈
𝑉[𝐻0 ], 𝑝1 ∈ 𝑉[𝐻1 ] are incompatible conditions. Expanding the models 𝑉[𝐻0 ], 𝑉[𝐻1 ]
and strengthening the conditions 𝑝0 , 𝑝1 if necessary, we may assume that for every
point 𝛾 ∈ Γ ∩ 𝑉, 𝛾 ∈ dom(𝑝0 ) and Γ ∈ dom(𝑝1 ) both hold.
Let 𝑞0 = 𝑝0 ↾ 𝑉 and 𝑞1 = 𝑝1 ↾ 𝑉. Suppose first that 𝑞0 ≠ 𝑞1 . Then there must
be a point 𝛾 ∈ 𝑉 and disjoint basic open sets 𝑂0 , 𝑂1 ⊂ Δ such that 𝑝0 (𝛾) ∈ 𝑂0 and
𝑝1 (𝛾) ∈ 𝑂1 . Let 𝐴0 = {𝑞 ∈ 𝑃 ∶ 𝛾 ∈ dom(𝑞) ∧ 𝑞(𝛾) ∈ 𝑂0 } and 𝐴1 = {𝑞 ∈ 𝑃 ∶ 𝛾 ∈
dom(𝑞) ∧ 𝑞(𝛾) = 𝑂1 }. Clearly, 𝐴0 , 𝐴1 ⊂ 𝑃 are analytic sets coded in the ground model,
Σ𝐴0 and Σ𝐴1 are incompatible in 𝑃 and 𝑝0 ≤ Σ𝐴0 and 𝑝1 ≤ Σ𝐴1 .
Now suppose that 𝑞0 = 𝑞1 and work towards a contradiction. Write 𝑝 ̄ for the
common value and note that by the product forcing theorem, 𝑝 ̄ ∈ 𝑉 holds. Now 𝑝 ̄ is a
balanced virtual condition in 𝑃 by Theorem 8.3.2, 𝑝0 ≤ 𝑝 ̄ and 𝑝1 ≤ 𝑝,̄ so 𝑝0 , 𝑝1 must
be compatible by the balance of 𝑝.̄ This contradicts the initial choice of 𝑝0 , 𝑝1 . □
The following two examples deal with quotient simplicial complex posets.
such that every 𝐹-class consists of countably many 𝐸-classes. The 𝐸, 𝐹-transversal
poset 𝑃 of Definition 6.4.4 is tethered.
Proof. We will show that 𝑃 is 𝜆-tethered where 𝜆 = ℶ𝜔1 . Let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be
mutually generic extensions of the ground model 𝑉, and let 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈
𝑉[𝐻1 ] be incompatible conditions in 𝑃. There must be elements 𝑥0 ∈ 𝑝0 and 𝑥1 ∈ 𝑝1
which are 𝐹-related but not 𝐸-related. In view of Proposition 2.1.7, the points 𝑥0 , 𝑥1
must both be realizations of a virtual 𝐹-class in 𝑉 and by Claim 6.4.12 there are virtual
𝐸-classes 𝑑0 ≠ 𝑑1 in 𝑉 such that 𝑥0 is a realization of 𝑑0 and 𝑥1 is a realization of 𝑑1 .
In 𝑉, let 𝑝0′ = {𝑞 ∈ 𝑃 ∶ 𝑞 contains some realization of the virtual 𝐸-class 𝑑0 } and
′
𝑝1 = {𝑞 ∈ 𝑃 ∶ 𝑞 contains some realization of the virtual 𝐸-class 𝑑1 }. These are vir-
tual conditions on the posets which carry the virtual 𝐸-classes 𝑑0 , 𝑑1 , and these are of
10.3. EXAMPLES 223
cardinality smaller than 𝜆 by Theorem 2.5.6. In addition, 𝑝0′ , 𝑝1′ are incompatible, and
𝑝0 ≤ 𝑝0′ and 𝑝1 ≤ 𝑝1′ as required. □
The following example covers all posets which associate a structure to each 𝐺-class
where 𝐺 is a countable Borel equivalence relation on a Polish space, as in Example 6.4.8.
Example 10.3.6. Let 𝑋 be a Polish space and let 𝐸 ⊂ 𝐹 be Borel equivalence
relations on 𝑋 such that 𝐹 is pinned and for each 𝐹-equivalence class 𝐶 ⊂ 𝑋, 𝐸 ↾ 𝐶 is
smooth. Then the 𝐸, 𝐹-transversal poset 𝑃 of Definition 6.4.4 is ℵ0 -tethered.
Proof. Let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be mutually generic extensions of the ground model 𝑉,
and let 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ] be incompatible conditions in 𝑃. There must
be elements 𝑥0 ∈ 𝑝0 and 𝑥1 ∈ 𝑝1 which are 𝐹-related but not 𝐸-related. Since the
equivalence relation 𝐹 is pinned, there must be a point 𝑥 ∈ 𝑋 ∩ 𝑉 which is 𝐹-related to
both 𝑥0 , 𝑥1 . By the initial assumptions on 𝐸, 𝐹, in the ground model there also must be a
Borel map ℎ ∶ [𝑥]𝐹 → 2𝜔 reducing 𝐸 to the identity. Since ℎ(𝑥0 ) ≠ ℎ(𝑥1 ), there must be
distinct binary strings 𝑠0 , 𝑠1 ∈ 2𝑛 for some 𝑛 ∈ 𝜔 such that 𝑠0 ⊂ ℎ(𝑥0 ) and 𝑠1 ⊂ ℎ(𝑥1 ).
Let 𝐴0 = {𝑞 ∈ 𝑃 ∶ 𝑝 ∩ ℎ−1 [𝑠0 ] ≠ 0} and 𝐴1 = {𝑞 ∈ 𝑃 ∶ 𝑝 ∩ ℎ−1 [𝑠1 ] ≠ 0}. It is clear that
𝐴0 , 𝐴1 are analytic subsets of 𝑃 coded in the ground model, Σ𝐴0 is incompatible with
Σ𝐴1 in 𝑃, and 𝑝0 ≤ Σ𝐴0 and 𝑝1 ≤ Σ𝐴1 as required. □
Example 10.3.7. Let ℱ be a Fraissé class in a finite relational language with strong
amalgamation. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. Then the
𝐸, ℱ-Fraissé poset 𝑃 of Definition 8.7.3 is tethered. In addition, if 𝐸 is pinned, then 𝑃
is ℵ0 -tethered.
Proof. Start with the general case. Let 𝜆 = ℶ𝜔1 . We will show that the poset 𝑃
is 𝜆-tethered. For brevity, assume that ℱ has just one relational symbol of its language
of some finite arity 𝑛 ∈ 𝜔. Thus, a condition 𝑝 ∈ 𝑃 is just a single 𝑛-ary relation on a
countable set dom(𝑝) which respects the equivalence 𝐸, and such that its 𝐸-quotient is
a ℱ-structure. Let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be mutually generic extensions of the ground model
𝑉 and 𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ] be incompatible conditions. In view of the strong
amalgamation assumption, there must be 𝑛-tuples 𝑥0⃗ and 𝑥1⃗ in dom(𝑝0 ) and dom(𝑝1 )
respectively such that for each 𝑖 ∈ 𝑛, 𝑥0⃗ (𝑖) 𝐸 𝑥1⃗ (𝑖) holds, and 𝑥0⃗ ∈ 𝑝0 and 𝑥1⃗ ∉ 𝑝1 (or
vice versa). By Proposition 2.1.7, there is an 𝑛-tuple 𝑑 ⃗ of virtual 𝐸-classes in 𝑉 such that
⃗
for each 𝑖 ∈ 𝑛, 𝑥0⃗ (𝑖), 𝑥1⃗ (𝑖) are realizations of 𝑑(𝑖). Let 𝑝0′ = {𝑞 ∈ 𝑃 ∶ dom(𝑞) contains
⃗
an 𝑛-tuple 𝑥⃗ which is a realization of 𝑑 and 𝑥⃗ ∈ 𝑞} and 𝑝1′ = {𝑞 ∈ 𝑃 ∶ dom(𝑞) contains
an 𝑛-tuple 𝑥⃗ which is a realization of 𝑑 ⃗ and 𝑥⃗ ∉ 𝑝}. These are virtual conditions on
the posets which carry the virtual 𝐸-classes on the tuple 𝑑,⃗ and these are of cardinality
smaller than 𝜆 by Theorem 2.5.6. In addition, 𝑝0′ , 𝑝1′ are incompatible, and 𝑝0 ≤ 𝑝0′
and 𝑝1 ≤ 𝑝1′ as required.
The case of a pinned equivalence relation 𝐸 proceeds in the same way, noting that
in this case the𝐸-quotient space and the virtual 𝐸-quotient space coincide. □
The ultrafilter posets typically do satisfy the tether demands.
Example 10.3.8. The poset 𝑃 of all infinite subsets of 𝜔 ordered by inclusion is
ℵ0 -tethered.
Proof. Let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be mutually generic extensions of 𝑉, containing the re-
spective conditions 𝑝0 , 𝑝1 ∈ 𝑃 which are incompatible in 𝑃. Removing finitely many
numbers from each, we may assume that in fact 𝑝0 ∩ 𝑝1 = 0. By Proposition 1.7.9,

there are disjoint sets 𝑝0′ , 𝑝1′ ⊂ 𝜔 in the ground model such that 𝑝0 ⊂ 𝑝0′ and 𝑝1 ⊂ 𝑝1′ .
These sets as conditions in 𝑃 exemplify the tether of the poset 𝑃. □
Example 10.3.9. Let 𝐴 be a Ramsey sequence of finite structures. The poset 𝑃 =
𝑃𝐴 of Definition 7.3.2 is ℵ0 -tethered.
Proof. We use the terminology of Section 7.3. In particular, the sequence 𝐴 is
written as ⟨𝐴𝑛 ∶ 𝑛 ∈ 𝜔⟩ of structures on pairwise disjoint sets. Let 𝑛 ∈ 𝜔 be a natural
number. Write 𝐷𝑛 for the set of all copies of 𝐴𝑛 which are a subset of some 𝐴𝑚 for
𝑚 ≥ 𝑛.
Let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be mutually generic extensions of the ground model 𝑉, and let
𝑝0 ∈ 𝑉[𝐻0 ] and 𝑝1 ∈ 𝑉[𝐻1 ] be incompatible conditions in 𝑃. Expanding the models
and strengthening the conditions if necessary, by Claim 7.3.5 we may assume that for
𝐴 𝐴
each 𝑛 ∈ 𝜔 and each set 𝑏 ⊂ 𝐷𝑛 in the ground model, either 𝑝0 𝑛 ⊂ 𝑏 or 𝑝0 𝑛 ∩ 𝑏 = 0
modulo finite, and similarly for subscript 1. Let (𝐹𝑛 )0 be the set of all ground model
elements of 𝒫(𝐷𝑛 ) for which the first option prevails, and similarly for subscript 1.
Suppose first that there is a number 𝑛 ∈ 𝜔 for which (𝐹𝑛 )0 ≠ (𝐹𝑛 )1 . For definite-
ness, suppose that there is some set 𝑏 ∈ (𝐹𝑛 )0 ⧵ (𝐹𝑛 )1 . Then let 𝑝0′ = {𝑝 ∈ 𝑃 ∶ 𝑝𝐴𝑛 ⊂ 𝑏
modulo finite} and 𝑝1′ = {𝑝 ∈ 𝑃 ∶ 𝑝𝐴𝑛 ∩ 𝑏 = 0 modulo finite}. The sets 𝑝0′ , 𝑝1′ ⊂ 𝑃 are
analytic and coded in the ground model. Also, clearly Σ𝑝0′ , Σ𝑝1′ are incompatible in 𝑃,
and 𝑝0 ≤ Σ𝑝0′ and 𝑝1 ≤ Σ𝑝1′ as desired.
Now suppose that the sets (𝐹𝑛 )0 , (𝐹𝑛 )1 are equal for all 𝑛 ∈ 𝜔. Write 𝐹𝑛 for their
common value. The product forcing theorem shows that 𝐹𝑛 ∈ 𝑉 and even ⟨𝐹𝑛 ∶ 𝑛 ∈
𝜔⟩ ∈ 𝑉. It is not difficult to check that it is an 𝐴-sequence of ultrafilters. Theorem 7.3.4
then shows that it yields a balanced virtual condition 𝑝,̄ and 𝑝0 , 𝑝1 ≤ 𝑝.̄ Since 𝑝0 , 𝑝1 ≤
𝑝,̄ the balance of 𝑝 ̄ shows that 𝑝0 , 𝑝1 are compatible conditions, contradicting the initial
choice of 𝑝0 , 𝑝1 . □
Example 10.3.10. Let ⟨Γ, ⋅⟩ be a countable semigroup. The poset 𝑃 = 𝑃(Γ) of
Section 7.4 is ℵ0 -tethered.
Proof. We adopt the terminology of Section 7.4. Let 𝑉[𝐻0 ], 𝑉[𝐻1 ] be mutually
generic extensions of 𝑉, containing the respective conditions 𝑝0 , 𝑝1 ∈ 𝑃 which are
incompatible in 𝑃. By Proposition 7.4.3, extending the models and strengthening the
conditions if necessary, we may assume that both 𝑝0 , 𝑝1 sort out the set 𝒫(𝜔) ∩ 𝑉. Let
𝑞0 = {𝑎 ⊂ Γ ∶ 𝑎 ∈ 𝑉 and 𝑝0 accepts 𝑎} and 𝑞1 = {𝑎 ⊂ Γ ∶ 𝑎 ∈ 𝑉 and 𝑝1 accepts 𝑎}.
Suppose first that 𝑞0 ≠ 𝑞1 , and for definiteness assume that there is a set 𝑎 ∈ 𝑞0 ⧵𝑎1 .
Let 𝑝0′ = {𝑞 ∈ 𝑃 ∶ 𝑞 accepts 𝑎} and 𝑝1′ = {𝑞 ∈ 𝑃 ∶ 𝑞 declines 𝑎}. It is clear that 𝑝0′ , 𝑝1′ ⊂ 𝑃
are analytic sets coded in 𝑉, Σ𝑝0′ , Σ𝑝1′ are incompatible, and 𝑝0 ≤ Σ𝑝0′ , 𝑝1 ≤ Σ𝑝1′ .
Suppose now that 𝑞0 = 𝑞1 and work towards a contradiction. Denote the common
value by 𝑝 ̄ and use the product forcing theorem to see that 𝑝 ̄ ∈ 𝑉. Since the conditions
𝑝0 , 𝑝1 sort out 𝒫(Γ) ∩ 𝑉, 𝑝 ̄ is an ultrafilter. In 𝑉, Proposition 7.4.5 then shows that 𝑝 ̄ is
an idempotent ultrafilter, and by Theorem 7.4.7, it yields a balanced virtual condition
in the poset 𝑃. Since 𝑝0 , 𝑝1 ≤ 𝑝,̄ the balance of 𝑝 ̄ shows that 𝑝0 , 𝑝1 are compatible
conditions, contradicting the initial choice of 𝑝0 , 𝑝1 . □
Finally, we include two examples of balanced posets which are not tethered.
10.3. EXAMPLES 225
Example 10.3.11. Let 𝐸 be a non-smooth Borel pinned equivalence relation on

a Polish space 𝑋. The collapse poset 𝑃 of |𝐸| to 2𝜔 of Definition 6.4.1 is not tethered.
Countable-to-one uniformization fails in the resulting extension of the symmetric Solo-
vay model.
Proof. We prove the last sentence. The poset 𝑃 is balanced by the pinned as-
sumption on 𝐸 and Theorem 6.4.2. In the 𝑃-extension of the symmetric Solovay model,
|𝐸| ≤ |2𝜔 | holds by the definition of the poset 𝑃. In addition, |𝔼0 | ≤ |𝐸| holds by the
Glimm–Effros dichotomy as 𝐸 is assumed to be non-smooth. In sum, |𝔼0 | ≤ |2𝜔 | holds,
as witnessed by some function 𝑔 ∶ 2𝜔 → 2𝜔 . In addition, Corollary 11.5.8 shows that in
the 𝑃-extension of the symmetric Solovay model, 𝔼0 has no transversal, and therefore
the function 𝑔 has no left inverse. This feature of 𝑔 stands witness to the failure of the
countable-to-one uniformization. □
Example 10.3.12. Let 𝐸 be a pinned Borel equivalence relation with uncountably
many uncountable classes on a Polish space 𝑋. The poset 𝑃 of Example 6.4.7 adding a
complete countable section to 𝐸 is not tethered. In the 𝑃-extension of the symmetric
Solovay model, the countable-to-one uniformization fails.
Proof. We prove the last sentence. View 𝑃 is the poset of all countable sets 𝑝 ⊂ 𝑋
ordered by 𝑝1 ≤ 𝑝0 if 𝑝1 ∩ [𝑝0 ]𝐸 = 𝑝0 . Let 𝜎 be the 𝑃-name for the union of the generic
filter, which is a countable complete 𝐸-section. We will show that the set (𝑋 × 𝜎) ∩ 𝐸 ⊂
𝑋 ×𝑋 is forced not to have a uniformization in the 𝑃-extension of the symmetric Solovay
model.
Let 𝜅 be an inaccessible cardinal. Let 𝑊 be a symmetric Solovay model derived
from 𝜅 and work in 𝑊. Towards contradiction, assume that 𝑝 ∈ 𝑃 is a condition and
𝜏 is a 𝑃-name such that 𝑝 ⊩ 𝜏 is a uniformization of (𝑋 × 𝜎) ∩ 𝐸. Let 𝑧 ∈ 2𝜔 be a
point such that both 𝑝 and 𝜏 are definable from parameters in the ground model and
an additional parameter 𝑧. Let 𝑉[𝐾] be an intermediate generic extension by a poset
of cardinality smaller than 𝜅 containing 𝑧 and work in 𝑉[𝐾].
Let 𝑥 ⊂ 𝑋 be a point such that [𝑥]𝐸 is an uncountable 𝐸-class containing no ele-
ments of 𝑝. Let ℎ ∶ 2𝜔 → [𝑥]𝐸 be a continuous injection. Let 𝑄 be the Cohen poset on
2𝜔 , with its associated name 𝑦𝑔𝑒𝑛̇ for a generic point in 2𝜔 . Let 𝑝 ̄ be a 𝑄-name for the
″
̇ ]𝔼0 ∪ (𝑋 ⧵ [𝑝 ∪ {𝑥}]𝐸 ⊂ 𝑋. This set defines a balanced virtual condition
set 𝑝 ∪ ℎ [𝑦𝑔𝑒𝑛
below 𝑝 by Theorem 6.4.5. By a balance argument (Proposition 5.2.4), there must be
an infinite binary sequence 𝑡 ∈ 2𝜔 with only finitely many unit entries and a condition
𝑞 ∈ 𝑄 such that 𝑞 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩ 𝜏(𝑥)̌ = ℎ(𝑦𝑔𝑒𝑛 ̇ + 𝑡). Let 𝑦0 , 𝑦1 ∈ 2𝜔 be distinct
𝔼0 -related points in 𝑞 generic over 𝑉[𝐾]. Note that the models 𝑉[𝐾][𝑦0 ] and 𝑉[𝐾][𝑦1 ]
coincide, and so do the sets 𝑝/𝑦 ̄ 0 and 𝑝/𝑦̄ 1 . As a result, in the model 𝑊 the common
value of these sets forces in 𝑃 that 𝜏(𝑥) is simultaneously equal to ℎ(𝑦0 +𝑡) and ℎ(𝑦1 +𝑡),
which is impossible. □
There are also partial orders where we are unable to decide the status of their tether,
such as the Fin×Fin poset of Definition 7.2.1.
CHAPTER 11
Locally countable structures
This chapter introduces a methodology for proving that certain models of ZF plus
DC we produce do not contain locally countable structures of certain type. In particu-
lar, we learn how to produce models of ZF+DC which contain locally countable struc-
tures of one type but not of another type. The whole enterprise should be viewed as a
parallel to the extensive field of descriptive set theory of locally countable structures.
There are many striking similarities present, and many others are sure to be found in
the future.
11.1. Central objects and notions

In this section, we introduce certain basic locally countable graphs and hyper-
graphs and the associated concerns of the descriptive set theory of locally countable
structures. Some of the critical issues deal with the comparison of chromatic and Borel
chromatic numbers of various analytic hypergraphs on Polish spaces. An analytic hy-
pergraph on a Polish space 𝑋 is a set 𝐺 ⊂ [𝑋]<ℵ0 which is an analytic subset of the hy-
perspace 𝐾(𝑋) with the Vietoris topology. The elements of a hypergraph are referred to
as hyperedges. Thus, our hypergraphs contain finite hyperedges only–they are finitary;
it may occur though that there is no fixed 𝑛 ∈ 𝜔 (arity) such that 𝐺 ⊂ [𝑋]𝑛 . As a matter
of convention, our hypergraphs contain no singleton sets. A graph is a hypergraph of
arity 2. If 𝐺, 𝐻 are hypergraphs on respectve spaces 𝑋, 𝑌 , a function ℎ ∶ 𝑋 → 𝑌 is a
homomorphism if the ℎ-image of any 𝐺-hyperedge is an 𝐻-hyperedge. An anticlique
is a set 𝑎 ⊂ 𝑋 such that [𝑎]<ℵ0 ∩ 𝐺 = 0. The chromatic number of 𝐺 is the smallest
cardinality of a set of anticliques covering the whole space 𝑋. Since we are working
in the choiceless context, where cardinalities are not well-ordered, we distinguish only
between countable and uncountable chromatic number and different values of count-
able chromatic numbers.
Most of the central analytic hypergraphs in this section are in fact products of hy-
pergraphs on finite or countable domain. The following definition explains the typical
construction.
Definition 11.1.1. Let ⟨𝑎𝑛 , 𝐻𝑛 , 𝑡𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a sequence such that 𝑎𝑛 is a non-

empty countable (often finite) set, 𝐻𝑛 is a hypergraph on 𝑎𝑛 and 𝑡𝑛 ∈ ∏𝑚∈𝑛 𝑎𝑚 are
finite strings such that the set {𝑡𝑛 ∶ 𝑛 ∈ 𝜔} is dense in ⋃𝑛 ∏𝑚∈𝑛 𝑎𝑚 . Let 𝑋 = ∏𝑛 𝑎𝑛
and define:
(1) (the skew product) ∏𝑛 𝐻𝑛 , 𝑡𝑛 is the hypergraph on 𝑋 containing all sets 𝑏 ⊂ 𝑋
such that for some 𝑛 ∈ 𝜔, ∀𝑚 ≠ 𝑛 ∀𝑥0 , 𝑥1 ∈ 𝑏 𝑥0 (𝑚) = 𝑥1 (𝑚), ∀𝑥 ∈ 𝑏 𝑡𝑛 ⊂ 𝑥,
and {𝑥(𝑛) ∶ 𝑥 ∈ 𝑏} ∈ 𝐻𝑛 ;
227
228 11. LOCALLY COUNTABLE STRUCTURES
(2) (the product) ∏𝑛 𝐻𝑛 is the hypergraph on 𝑋 containing all sets 𝑏 ⊂ 𝑋 such

that for some 𝑛 ∈ 𝜔, ∀𝑚 ≠ 𝑛 ∀𝑥0 , 𝑥1 ∈ 𝑏 𝑥0 (𝑚) = 𝑥1 (𝑚), and {𝑥(𝑛) ∶ 𝑥 ∈
𝑏} ∈ 𝐻𝑛 .
In all cases, the sets 𝑎𝑛 are implicit in the notation. The definition of the product (as
opposed to the skew product) does not depend on the strings 𝑡𝑛 . Among the product
graphs, the Hamming graphs are prominent.
Definition 11.1.2. Let 𝑛 ≥ 2 be a natural number. ℍ𝑛 , the Hamming graph on 𝑛𝜔 ,
is the product of infinitely many cliques of cardinality 𝑛. ℍ<𝜔 , the diagonal Hamming
graph on the space ∏𝑛 (𝑛 + 1), is the product of cliques of all possible nonzero finite
cardinalities. Finally, ℍ𝜔 , the Hamming graph on 𝜔𝜔 , is the product of infinitely many
cliques on 𝜔.
Skew products are useful as minimal examples of various phenomena. One standard
example is the uncountable Borel chromatic number of graphs:
Definition 11.1.3. Let 𝐺 be an analytic hypergraph on a Polish space 𝑋. 𝐺 has
countable Borel chromatic number if there are Borel 𝐺-anticliques 𝐵𝑛 ⊂ 𝑋 for 𝑛 ∈ 𝜔
such that 𝑋 = ⋃𝑛 𝐵𝑛 .
Definition 11.1.4. For each 𝑛 ∈ 𝜔, let 𝑎𝑛 = 2, let 𝐻𝑛 be the graph on 𝑎𝑛 contain-
ing only the whole set 𝑎𝑛 as an edge and let 𝑡𝑛 ∈ 2𝑛 be a string such that {𝑡𝑛 ∶ 𝑛 ∈ 𝜔} ⊂
2<𝜔 is dense. The graph 𝔾0 is defined as ∏𝑛 𝐻𝑛 , 𝑡𝑛 .
Fact 11.1.5. (The 𝔾0 -dichotomy [61])(ZF+DC) For every analytic graph 𝐺 on a
Polish space 𝑋, exactly one of the following occurs:
(1) the Borel chromatic number of 𝐺 is countable;
(2) there is a continuous map from 2𝜔 to 𝑋 which is a homomorphism of 𝔾0 to 𝐺.
Uncountable chromatic numbers of locally countable graphs can be used in ZF+DC to
rule out seemingly unrelated phenomena. The following humble proposition will be
useful at several points of this book:
Proposition 11.1.6. (ZF+DC) If the chromatic number of 𝔾0 is greater than two
then
(1) there is no linear ordering of the 𝔼0 -quotient space;
(2) |𝔼0 | ≰ |2𝜔 |;
(3) there is no discontinuous homomorphism between Polish groups.
Proof. For the first item, consider the equivalence relation 𝐸 on 2𝜔 connecting
points 𝑥, 𝑦 ∈ 2𝜔 if they differ in a finite, even number of entries. Then 𝐸 ⊂ 𝔼0 ; as a
subset of a hyperfinite equivalence relation, it is itself hyperfinite and therefore Borel
reducible to 𝔼0 [54, Theorem 8.1.1]. Now, suppose that the 𝔼0 -quotient space is linearly
orderable; then so is the 𝐸-quotient space, and one can define the function 𝑐 ∶ 2𝜔 → 2
by setting 𝑐(𝑥) = 0 if among the two 𝐸-classes which constitute the 𝔼0 -class of 𝑥, 𝑥
belongs to the smaller one in the fixed linear ordering of the 𝔼-quotient space. It is not
difficult to show that 𝑐 is a 𝔾0 -coloring with two colors.
The second item follows from the first, since the inequality |𝔼0 | ≤ |2𝜔 | yields a
linear ordering on the 𝔼0 -space by simply pulling back the usual lexicographical order
on 2𝜔 to the 𝔼0 -quotient space via the assumed injection from the 𝔼0 -quotient space
11.1. CENTRAL OBJECTS AND NOTIONS 229
to 2𝜔 . The third item is much harder. [89] constructs, in ZF+DC, a coloring of the
Hamming graph ℍ2 (a superset of the 𝔾0 -graph) with two colors from the assumption
that there is a discontinuous homomorphism between Polish groups. □
It is not difficult to extend the 𝔾0 -dichotomy to arbitrary finitary analytic hypergraphs,

see Fact 11.1.8. In this generality, one has to allow for uncountably many basis hyper-
graphs, which are nevertheless easy to describe:
Definition 11.1.7. Suppose that ⟨𝑎𝑛 , 𝐻𝑛 , 𝑡𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a sequence such that each

𝑎𝑛 is a a finite set of cardinality at least two, 𝐻𝑛 is the hypergraph on it containing 𝑎𝑛
as its only hyperedge, and 𝑡𝑛 ∈ ∏𝑚∈𝑛 𝑎𝑚 is a string such that the set {𝑡𝑛 ∶ 𝑛 ∈ 𝜔} is
dense in ⋃𝑛 ∏𝑚∈𝑛 𝑎𝑚 . Then the hypergraph ∏𝑛 𝐻𝑛 , 𝑡𝑛 on ∏𝑛 𝑎𝑛 is called a principal
skew product.
Any standard proof (such as that of [61] or [82]) of the 𝔾0 -dichotomy (Fact 11.1.5) read-
ily generalizes to yield the following dichotomy. Details of the routine generalization
are left to the patient reader.
Fact 11.1.8. (ZF+DC) Let 𝐺 be a finitary analytic hypergraph on a Polish space 𝑋.

Exactly one of the following occurs:
(1) the Borel chromatic number of 𝐺 is countable;
(2) there exist a principal skew product and a continuous homomorphism of it to
the hypergraph 𝐺.
In this chapter, we will also use more involved variations of the uncountable Borel
chromatic number.
Definition 11.1.9. Let 𝐺 be an analytic finitary hypergraph on a Polish space

𝑋. The hypergraph 𝐺 has Borel 𝜎-bounded chromatic number if there are Borel sets
𝐵𝑛 ⊂ 𝑋 for 𝑛 ∈ 𝜔 such that 𝑋 = ⋃𝑛 𝐵𝑛 and for every 𝑛 ∈ 𝜔, every finite subset of 𝐵𝑛
has 𝐺-chromatic number less than 𝑛 + 2.
It is immediate that countable Borel chromatic number implies Borel 𝜎-bounded chro-
matic number. The opposite implication does not holds as the following examples
show.
Example 11.1.10. The Hamming graph ℍ2 has uncountable Borel chromatic

number by Fact 11.1.5 but it does have Borel 𝜎-bounded chromatic number. To see
this, observe that it contains no odd length cycles and therefore ℍ2 on each finite sub-
set of 2𝜔 has chromatic number 2. The sequence 𝐵𝑛 defined by 𝐵1 = 2𝜔 and 𝐵𝑛 = 0 for
all 𝑛 ≠ 1 exemplifies the Borel 𝜎-bounded chromatic number of ℍ2 .
Example 11.1.11. The diagonal Hamming graph ℍ<𝜔 does not have Borel
𝜎-bounded chromatic number. To see this, by the Baire category theorem it is enough
to show that any non-meager Borel subset of 𝑋 = ∏𝑛 (𝑛 + 1) contains arbitrarily large
finite ℍ<𝜔 -cliques. Thus, let 𝐵 ⊂ 𝑋 be non-meager Borel and let 𝑚 ∈ 𝜔 be a number.
Let 𝑡 be a finite string of natural numbers such that 𝐵 is comeager in 𝑡 and |𝑡| = 𝑛 > 𝑚.
A simple construction yields a point 𝑥 ∈ 𝑋 such that 𝑡 ⊂ 𝑥 and for every 𝑖 ∈ 𝑛 the
point 𝑥𝑖 , obtained from 𝑥 by rewriting its 𝑛-th entry with 𝑖, belongs to the set 𝐵. Since
the set {𝑥𝑖 ∶ 𝑖 ∈ 𝑛} ⊂ 𝐵 is an ℍ<𝜔 -clique, the argument is complete.
The class of analytic finitary hypergraphs which do not have Borel 𝜎-bounded chro-
matic number has a simple basis.
Definition 11.1.12. Let ⟨𝑎𝑛 , 𝐻𝑛 , 𝑡𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a sequence such that 𝑎𝑛 is a non-
empty finite set, 𝐻𝑛 is a hypergraph on 𝑎𝑛 of chromatic number > 𝑛, 𝑡𝑛 ∈ ∏𝑚∈𝑛 𝑎𝑚 ,
and the set {𝑡𝑛 ∶ 𝑛 ∈ 𝜔} is dense in ⋃𝑛 ∏𝑚∈𝑛 𝑎𝑛 . The skew product ∏𝑛 𝐻𝑛 , 𝑡𝑛 is then
called a large skew product and the product ∏𝑛 𝐻𝑛 is called a large product.
A straightforward Baire category argument as in Example 11.1.11 shows that a large
skew product does not have Borel 𝜎-bounded chromatic number. The following fact is
proved in the same way as the 𝔾0 -dichotomy, and we omit the standard argument.
Fact 11.1.13. Let 𝐺 be a finitary analytic hypergraph on a Polish space 𝑋. Exactly
one of the following occurs:
(1) 𝐺 has Borel 𝜎-bounded chromatic number;
(2) there is a large skew product 𝐻 on a Polish space 𝑌 and a continuous homo-
morphism ℎ ∶ 𝑌 → 𝑋 of 𝐻 to 𝐺.
Many interesting natural examples of hypergraphs which do not have Borel 𝜎-bounded
chromatic number actually have a stronger property encapsulated in the following def-
initions.
Definition 11.1.14. Let 𝑎 be a finite set and 𝐺 be a hypergraph on 𝑎. The frac-
tional chromatic number of 𝐺 is the maximum of all numbers Σ𝑣∈𝑎 𝑓(𝑣) where 𝑓 ∶ 𝑎 →
[0, 1] ranges over all functions such that Σ𝑣∈𝑏 𝑓(𝑣) ≤ 1 for all 𝐺-anticliques 𝑏 ⊂ 𝑎.
A word about the terminology is in order. In fractional graph theory [91], the fractional
chromatic number is typically defined for graphs only. In the graph context, the def-
inition above corresponds to the fractional clique number of 𝐺, which is equal to the
standard fractional chromatic number of 𝐺 by a linear programming duality argument
[91, Section 3.1]. In order to maintain coherent terminology, we neglect this important
but for our ends irrelevant point. A trivial restatement of the fractional chromatic num-
ber will be used below: it is the largest real number 𝑟 such that there is a probability
measure on 𝑎 in which every 𝐺-anticlique has mass ≤ 1/𝑟.
Note that the fractional chromatic number is no greater than the chromatic num-
ber. Just as in the case of the chromatic number, if 𝐺0 , 𝐺1 are hypergraphs on 𝑎0 , 𝑎1
respectively and ℎ ∶ 𝑎0 → 𝑎1 is a homomorphism of 𝐺0 to 𝐺1 then the fractional chro-
matic number of 𝐺1 is not smaller than the fractional chromatic number of 𝐺0 . The
following examples further elucidate the relationship between the chromatic number
and its fractional counterpart.
Example 11.1.15. For every 𝑛 ∈ 𝜔 let 𝐺𝑛 be the graph on [𝑛]2 connecting pairs
𝑎, 𝑏 if the smaller element of 𝑎 is equal to the larger element of 𝑏 or vice versa. Then the
chromatic numbers of 𝐺𝑛 tend to infinity with 𝑛, but the fractional chromatic numbers
remain bounded by 4.
For the former statement, note that if 𝑛 is such that 𝑛 → (3)2𝑚 then the chromatic
number of 𝐺𝑛 is greater than 𝑚: if [𝑛]2 = ⋃𝑖∈𝑚 𝐵𝑖 , then by the Ramsey property of 𝑛
there is 𝑖 ∈ 𝑚 and a triple 𝑐 ⊂ 𝑛 such that [𝑐]2 ⊂ 𝐵𝑖 ; however, [𝑐]2 clearly contains a
𝐺-edge.
For the latter statement, suppose that 𝜇 is a probability measure on [𝑛]2 , and let
𝜆 be the normalized counting measure on 𝒫(𝑛). Let 𝐵 = {⟨𝑎, 𝑥⟩ ∈ [𝑛]2 × 𝒫(𝑛) ∶ 𝑥
11.1. CENTRAL OBJECTS AND NOTIONS 231
contains the smaller number in 𝑎 but not the larger number in 𝑎}. The vertical sections
of 𝐵 have 𝜆-mass 1/4, so by the Fubini theorem there must be a horizontal section 𝐵 𝑥
whose 𝜇-mass is ≥ 1/4. It is not difficult to check that 𝐵 𝑥 is a 𝐺-anticlique.
Example 11.1.16. Let 𝜀 > 0 be a fixed real number. For each 𝑛 ∈ 𝜔, let 𝐺𝑛 be the
graph on 2𝑛 which connects 𝑥, 𝑦 if the set {𝑚 ∈ 𝑛 ∶ 𝑥(𝑚) = 𝑦(𝑚)} has size at most 𝜀𝑛.
The fractional chromatic numbers of 𝐺𝑛 tend to infinity with 𝑛. To see this, consider
the normalized counting measure 𝜇𝑛 on 2𝑛 , the normalized Hamming metric 𝑑𝑛 on 2𝑛 ,
and the concentration of measure results for the Hamming cubes [86, Theorem 4.3.19]:
for every 𝛿 > 0 there is a number 𝑘 ∈ 𝜔 such that for every 𝑛 ≥ 𝑘 and every set 𝑏 ⊂ 2𝑛
of 𝜇𝑛 -mass greater than 𝛿, the 𝜀/2-neighborhood of 𝑏 in 2𝑛 in the sense of the metric 𝑑𝑛
has mass greater than 1/2. For each such number 𝑛 ∈ 𝜔, every set 𝑏 ⊂ 2𝑛 of 𝜇𝑛 -mass
greater than 𝛿 contains a 𝐺𝑛 -edge. To produce the edge, consider the automorphism
𝜋𝑛 ∶ 2𝑛 → 2𝑛 defined by 𝜋𝑛 (𝑥)(𝑚) = 1 − 𝑥(𝑚). The set 𝜋″ 𝑏 has 𝜇-mass greater than
𝛿 again. The 𝜀/2-neighborhoods of the sets 𝑏 and 𝜋″ 𝑏 in the sense of the metric 𝑑𝑛
have both 𝜇𝑛 mass greater than 1/2 and therefore intersect. It follows that there must
be points 𝑥 ∈ 𝑏 and 𝑦 ∈ 𝜋″ 𝑏 with 𝑑𝑛 (𝑥, 𝑦) ≤ 𝜀𝑛, and then 𝑥, 𝜋−1 𝑦 are 𝐺𝑛 -connected
elements of the set 𝑏.
Example 11.1.17. For every 𝑛 ∈ 𝜔, let 𝐻𝑛 be the hypergraph on 𝑛 of arity 3 consist-
ing of all arithmetic progressions of length 3. Then the fractional chromatic numbers
of 𝐻𝑛 tend to infinity with 𝑛–just consider the normalized counting measure on 𝑛 and
the density van der Waerden’s theorem [101].
Definition 11.1.18. Let 𝐺 be an analytic finitary hypergraph on a Polish space
𝑋. We say that 𝐺 has Borel 𝜎-bounded fractional chromatic number if there are Borel
sets 𝐵𝑛 ⊂ 𝑋 such that 𝑋 = ⋃𝑛 𝐵𝑛 and for each 𝑛 ∈ 𝜔, the hypergraph 𝐺 has fractional
chromatic number less than 𝑛 + 2 on every finite set 𝑎 ⊂ 𝐵𝑛 .
Clearly, Borel 𝜎-bounded chromatic number implies Borel 𝜎-bounded fractional chro-
matic number but the opposite implication fails. The most natural class of Borel graphs
exemplifying the distinction is the following:
Example 11.1.19. Let 𝐸 be a Borel non-smooth equivalence relation on a Polish
space 𝑋. Let 𝑄 be the poset of all pairs 𝑞 = ⟨𝑎𝑞 , 𝑏𝑞 ⟩ of finite subsets of 𝑋 such that
(𝑎𝑞 × 𝑏𝑞 ) ∩ 𝐸 = 0; the ordering is that of coordinatewise reverse inclusion. Let 𝐺 be
the graph connecting two conditions in 𝑄 if they are incompatible. Then 𝐺 does not
have Borel 𝜎-bounded chromatic number, yet it does have Borel 𝜎-bounded fractional
chromatic number.
Proof. To show that 𝐺 does not have Borel 𝜎-bounded chromatic number, first
use the Glimm–Effros dichotomy to find a Borel reduction ℎ ∶ 2𝜔 → 𝑋 of 𝔼0 to 𝐸. For
𝔼0 -unrelated points 𝑦0 , 𝑦1 ∈ 2𝜔 let 𝑟(𝑦0 , 𝑦1 ) = ⟨{ℎ(𝑦0 )}, {ℎ(𝑦1 )}⟩ and note that 𝑟(𝑦0 , 𝑦1 ) ∈
𝑄. By the Baire category theorem, it will be enough, for any Borel nonmeager set 𝐵 ⊂
2𝜔 × 2𝜔 and every 𝑛 ∈ 𝜔, to produce a finite subset 𝑏 ⊂ 𝐵 such that the chromatic
number of 𝐺 on 𝑞″ 𝑏 is greater than 𝑛. To this end, let 𝑡0 , 𝑡1 ∈ 2<𝜔 be two binary strings
of the same length such that 𝐵 ⊂ [𝑡0 ] × [𝑡1 ] is comeager. Let 𝑘 ∈ 𝜔 be a number such
that 𝑘 → (3)2𝑛 . A simple construction yields points 𝑦𝑖 ∈ 2𝜔 for 𝑖 ∈ 𝑘 such that for any
⌢ ⌢
𝑖 ∈ 𝑗 ∈ 𝑘, ⟨𝑡0 𝑦𝑖 , 𝑡1 𝑦𝑗 ⟩ ∈ 𝐵 holds. It will be enough to show that the graph 𝐺 on the
⌢ ⌢
set 𝑐 = {𝑞(𝑡0 𝑦𝑖 , 𝑡1 𝑦𝑗 ) ∶ 𝑖 ∈ 𝑗 ∈ 𝑘} has chromatic number greater than 𝑛. To see this,
suppose that 𝑐 = ⋃𝑚∈𝑛 𝑑𝑚 . By the choice of the number 𝑘, there exist 𝑚 ∈ 𝑛 and
numbers 𝑖0 ∈ 𝑖1 ∈ 𝑖2 such that any pair of them gives rise to a condition in the set 𝑑𝑚 .
⌢ ⌢ ⌢ ⌢
Now note that the conditions 𝑟(𝑡0 𝑦𝑖0 , 𝑡1 𝑦𝑖1 ) and 𝑟(𝑡0 𝑦𝑖1 , 𝑡1 𝑦𝑖2 ) are incompatible in 𝑄,
so form a 𝐺-edge.
To show that 𝐺 has Borel 𝜎-bounded fractional chromatic number, let 𝐵𝑛 = {𝑞 ∈
𝑄 ∶ |𝑎𝑞 ∪ 𝑏𝑞 | ≤ 𝑛}, observe that the set 𝐵𝑛 is Borel and 𝑄 = ⋃𝑛 𝐵𝑛 , and argue that for
every finite set 𝑐 ⊂ 𝐵𝑛 , the fractional chromatic number on 𝐺 on 𝑐 is ≤ 2𝑛 . Indeed,
assume that 𝜇 is any probability measure on the set 𝑐; we will produce a set of 𝜇-mass
≥ 2−𝑛 consisting of pairwise compatible conditions, i.e. a 𝐺-anticlique. To do this, let
𝑒 be the finite set of all 𝐸-classes with nonempty intersection with ⋃𝑞∈𝑐 (𝑎𝑞 ∪ 𝑏𝑞 ) and
let 𝜆 be the normalized counting measure on 𝒫(𝑒). Let 𝐴 = {⟨𝑞, 𝑢⟩ ∈ 𝑐 × 𝒫(𝑒) ∶ 𝑎𝑞 ⊂
⋃ 𝑢 ∧ 𝑏𝑞 ∩ ⋃ 𝑢 = 0}. Since 𝑐 ⊂ 𝐵𝑛 , all vertical sections of the set 𝐴 have 𝜆-mass
≥ 2−𝑛 . By the Fubini theorem, there is a horizontal section of 𝐴 of 𝜇-mass ≥ 2−𝑛 . This
horizontal section is the desired 𝐺-anticlique of 𝜇-mass ≥ 2−𝑛 . □
Example 11.1.11 actually shows that the diagonal Hamming graph does not have Borel
𝜎-bounded fractional chromatic number, since the density of a clique of cardinality 𝑛 is
𝑛. Many other examples arise from various density versions of Ramsey-type theorems.
Example 11.1.20. Suppose that ℤ acts in a Borel, free and measure-preserving

way on a Polish probability measure space ⟨𝑋, 𝜇⟩. Let 𝐺 be the Borel hypergraph on 𝑋
of arity 3 containing a triple {𝑥, 𝑦, 𝑧} if there is 𝑛 ∈ 𝜔 such that 𝑛 ⋅ 𝑥 = 𝑦 and 𝑛 ⋅ 𝑦 = 𝑧.
The hypergraph 𝐺 does not have Borel 𝜎-bounded fractional chromatic number.
Proof. Suppose towards a contradiction that 𝑋 = ⋃𝑛 𝐵𝑛 is a decomposition of 𝑋

into Borel sets witnessing the Borel 𝜎-bounded fractonal chromatic number of 𝐺. Pick
𝑛 ∈ 𝜔 and 𝜀 > 0 such that 𝜇(𝐵𝑛 ) > 𝜀. Use the density version of van der Waerden
theorem [101] to find a number 𝑚0 ∈ 𝜔 such that in every subset of 𝑚0 of cardinality
> 𝑚0 /𝑛, one of the classes contains an arithmetic progression of length three. Use the
density van der Waerden theorem again to find a number 𝑚1 such that every subset of
𝑚1 of size > 𝜀𝑚1 contains an arithmetic progression of length 𝑚0 . Let 𝐶 ⊂ 𝑚1 × 𝑋
be the set 𝐶 = {⟨𝑖, 𝑥⟩ ∶ 𝑥 ∈ 𝑖 ⋅ 𝐵𝑛 }. As every vertical section of the set 𝐶 has 𝜇-mass
> 𝜀, by the Fubini theorem there must be a point 𝑥 ∈ 𝑋 such that the horizontal
section 𝐶 𝑥 ⊂ 𝑚1 contains more than 𝜀𝑚1 many numbers, so an arithmetic progression
{𝑖 + 𝑗𝑘 ∶ 𝑘 ∈ 𝑚0 } for some choice of 𝑖, 𝑘 as well. Let 𝑥𝑗 = (−𝑖 − 𝑗𝑘) ⋅ 𝑥 for 𝑗 ∈ 𝑚1
and note that {𝑥𝑗 ∶ 𝑗 ∈ 𝑚0 } ⊂ 𝐵𝑛 holds. By the choice of 𝑚0 , the fractional chromatic
number of 𝐺 on the set {𝑥𝑗 ∶ 𝑗 ∈ 𝑚0 } is larger than 𝑛, contradicting the choice of the
set 𝐵𝑛 . □
The class of analytic finitary hypergraphs which do not have Borel 𝜎-bounded frac-
tional chromatic number has a simple basis.
Definition 11.1.21. Suppose that ⟨𝑎𝑛 , 𝐻𝑛 , 𝑡𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a sequence such that 𝑎𝑛

is a nonempty finite set, 𝐻𝑛 is a hypergraph on 𝑎𝑛 such that every 𝐻𝑛 -anticlique has
fewer than |𝑎𝑛 |/(𝑛 + 2) many elements, and 𝑡𝑛 ∈ ∏𝑚∈𝑛 𝑎𝑚 and the set {𝑡𝑛 ∶ 𝑛 ∈ 𝜔}
is dense in ⋃𝑛 ∏𝑚∈𝑛 𝑎𝑛 . The skew product ∏𝑛 𝐻𝑛 , 𝑡𝑛 is then called a large measured
skew product.
11.2. DEFINABLE CONTROL 233
A straightforward Baire category argument shows that a large measured skew product
does not have Borel 𝜎-bounded fractional chromatic number. The following fact is
proved in the same way as the 𝔾0 -dichotomy, and we omit the standard argument.
Fact 11.1.22. Let 𝐺 be a finitary analytic hypergraph on a Polish space 𝑋. Exactly
one of the following occurs:
(1) 𝐺 has Borel 𝜎-bounded fractional chromatic number;
(2) there is a large measured skew product 𝐻 on a Polish space 𝑌 and a continuous
homomorphism ℎ ∶ 𝑌 → 𝑋 of 𝐻 to 𝐺.
We now include two definitions and related dichotomies which deal with the clique
number of Borel graphs.
Definition 11.1.23. Let 𝐺 be an analytic graph on a Polish space 𝑋. We say that
𝐺 has Borel 𝜎-bounded clique number if there are Borel sets 𝐵𝑛 ⊂ 𝑋 for 𝑛 ∈ 𝜔 such that
no 𝐵𝑛 contains a 𝐺-clique of size 𝑛 + 2.
Fact 11.1.24. Let 𝐺 be an analytic graph on a Polish space 𝑋. Exactly one of the
following occurs:
(1) 𝐺 has Borel 𝜎-bounded clique number;
(2) there is a continuous homomorphism from a skew product of infinitely many
cliques of increasing finite size to 𝐺.
Definition 11.1.25. Let 𝐺 be an analytic graph on a Polish space 𝑋. We say that
𝐺 has Borel 𝜎-finite clique number if there are Borel sets 𝐵𝑛 ⊂ 𝑋 for 𝑛 ∈ 𝜔 such that no
𝐵𝑛 contains an infinite 𝐺-clique.
Fact 11.1.26. Let 𝐺 be an analytic graph on a Polish space 𝑋. Exactly one of the
following occurs:
(1) 𝐺 has Borel 𝜎-finite clique number;
(2) there is a continuous homomorphism from a skew product of infinitely many
infinite cliques to 𝐺.
Finally, we state a dichotomy for analytic hypergraphs of infinite, countable arity.
Definition 11.1.27. Let 𝑋 be the dense 𝐺𝛿 subspace of 𝜔𝜔 consisting of all func-
tions 𝑥 ∈ 𝜔𝜔 such that for infinitely many 𝑛 ∈ 𝜔, 𝑥(𝑛) > 𝑥(𝑚) for all 𝑚 ∈ 𝑛. Let
{𝑠𝑛 ∶ 𝑛 ∈ 𝜔} be a collection of finite strings of natural numbers such that 𝑠𝑛 ∈ 𝜔𝑛
and {𝑠𝑛 ∶ 𝑛 ∈ 𝜔} ⊂ 𝜔<𝜔 is dense. Define the hypergraph 𝔾𝜔 to consist of all tuples
⟨𝑥𝑚 ∶ 𝑚 ∈ 𝜔⟩ such that there is 𝑛 ∈ 𝜔 such that each 𝑠𝑛 is an initial segment of all
points 𝑥𝑚 , 𝑥𝑚 (𝑛) = 𝑚 holds for all 𝑚, and the tails 𝑥𝑚 ↾ (𝑛, 𝜔) are the same for all
𝑚 ∈ 𝜔.
Fact 11.1.28. [75] Let 𝐺 be an analytic hypergraph on a Polish space 𝑌 of countable
arity. Exactly one of the following occurs:
(1) 𝐺 has countable chromatic number;
(2) there is a continuous homomorphism of 𝔾𝜔 to 𝐺.
11.2. Definable control

This section is devoted to the class of apparently the softest balanced Suslin exten-
sions one can find: those in which the balanced virtual conditions can be found in an
easily definable way.
Definition 11.2.1. Let 𝑃 be a Suslin forcing. We say that 𝑃 is definably balanced if

for each condition 𝑝 ∈ 𝑃 there is a balanced virtual condition 𝑝 ̄ ≤ 𝑝 which is definable
from a real parameter.
The following results are stated using Convention 1.7.18. The first theorem shows that
definably balanced forcings preserve uncountable chromatic number of infinitary an-
alytic hypergraphs. This should be compared with the conclusion of Theorem 11.3.6.
Theorem 11.2.2. In definably balanced extensions of the symmetric Solovay model,

whenever Γ is an analytic hypergraph of countable arity on a Polish space 𝑋 of uncount-
able Borel chromatic number, then Γ has uncountable chromatic number.
Proof. In view of the dichotomy for analytic hypergraphs (Fact 11.1.28), it is

enough to prove the theorem for Γ = 𝔾𝜔 where 𝔾𝜔 is the hypergraph of Definition
11.1.27. Let 𝑋 be the domain Polish space of Γ and {𝑠𝑛 ∶ 𝑛 ∈ 𝜔} be the collection of
finite strings of natural numbers from which Γ is defined.
Suppose that 𝜅 is an inaccessible cardinal. Suppose that 𝑃 is a Suslin forcing such
that 𝑃 is definably balanced below 𝜅. Let 𝑊 be the symmetric Solovay model derived
from 𝜅 and work in 𝑊. Let 𝑝 ∈ 𝑃 be a condition and let 𝜏 be a 𝑃-name for a func-
tion from 𝑋 to 𝜔; we must find a Γ-edge ⟨𝑥𝑚 ∶ 𝑚 ∈ 𝜔⟩, a number 𝑘 ∈ 𝜔 and some
strengthening of the condition 𝑝 which forces 𝜏(𝑥𝑚 ̌ ) = 𝑘 ̌ for all 𝑚 ∈ 𝜔. The condition
𝑝 as well as the name 𝜏 are defined from some parameters in the ground model and
perhaps an additional parameter 𝑧 ∈ 2𝜔 . Find an intermediate extension 𝑉[𝐾] of the
ground model using a poset of cardinality smaller than 𝜅 such that 𝑧 ∈ 𝑉[𝐾], and work
in the model 𝑉[𝐾].
Let 𝑄 be the product of uncountably many copies of Cohen forcing on 𝜔𝜔 , indexed
by countable ordinals. Let 𝐻 ⊂ 𝑄 be a filter generic over 𝑉[𝐾] and work in 𝑉[𝐾][𝐻].
It is well-known that the filter 𝐻 is specified by a sequence ⟨𝑥𝛼 ∶ 𝛼 ∈ 𝜔1 ⟩ of Cohen
generic points in 𝑋. Moreover, for each ordinal 𝛼 ∈ 𝜔1 , writing 𝑉[𝐾][𝐻𝛼 ] for the
model 𝑉[𝐾][⟨𝑥𝛽 ∶ 𝛽 ≠ 𝛼⟩], the point 𝑥𝛼 ∈ 𝑋 is 𝑅-generic over 𝑉[𝐾][𝐻𝛼 ] where 𝑅 is the
Cohen forcing on 𝜔𝜔 , viewed as the poset of finite strings of natural numbers ordered
by reverse extension. By the definable balance assumption on 𝑃, there is an element
𝑣 ∈ 2𝜔 and a definition of a balanced virtual condition 𝑝 ̄ ≤ 𝑝 using 𝑣 as a parameter. By
a c.c.c. argument with the poset 𝑄, there is an ordinal 𝛼 ∈ 𝜔1 such that 𝑣 ∈ 𝑉[𝐾][𝐻𝛼 ].
Work in the model 𝑉[𝐾][𝐻𝛼 ].
Let 𝑥𝑔𝑒𝑛
̇ be the 𝑅-name for the generic point in 𝑋. By a balance argument (Propo-
sition 5.2.4), there must be a condition 𝑟 ∈ 𝑅 and a number 𝑘 ∈ 𝜔 such that 𝑟 ⊩
Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩ 𝜏(𝑥𝑔𝑒𝑛 ̇ ) = 𝑘.̌ Let 𝑥 ∈ 𝜔𝜔 be a point 𝑅-generic over 𝑉[𝐾][𝐻𝛼 ]
such that 𝑟 ⊂ 𝑥. Use a genericity argument to find a number 𝑚 ∈ 𝜔 large enough that
𝑠𝑚 is an initial segment of 𝑥 and 𝑟 ⊂ 𝑟𝑚 . For each number 𝑛 ∈ 𝜔 let 𝑥𝑛 ∈ 𝑋 be the
point obtained from 𝑥 by overwriting its 𝑚-th entry with 𝑛. Thus, each point 𝑥𝑛 is 𝑅-
generic over 𝑉[𝐾][𝐻𝛼 ], extends 𝑟, and 𝑉[𝐾][𝐻𝛼 ][𝑥] = 𝑉[𝐾][𝐻𝛼 ][𝑥𝑛 ]. The evaluation
of the definition of 𝑝 ̄ ≤ 𝑝 yields the same balanced virtual condition in these identical
models. By the forcing theorem, in the model 𝑊 𝑝 ̄ ⊩𝑃 𝜏(𝑥𝑛̌ ) = 𝑘 ̌ must hold for every
number 𝑛. In view of the fact that the sequence ⟨𝑥𝑛 ∶ 𝑛 ∈ 𝜔⟩ is a Γ-hyperedge, the
proof is complete. □
11.2. DEFINABLE CONTROL 235
Among many other consequences of definable balance, we prove only one: in defin-
ably balanced extensions of the Solovay model, cardinalities of quotient spaces of cer-
tain countable Borel equivalence relations are preserved in a precise sense. In fact,
we cannot prove any theorem to this effect in any other circumstance beside definable
balance. The conclusion should be compared with Corollary 11.3.15.
Theorem 11.2.3. Let Γ be a non-amenable countable group, acting on 𝑋 = 2Γ by

left shift, inducing an orbit equivalence relation 𝐸. In definably balanced extensions of
the symmetric Solovay model, |𝐸| ≰ |𝔼0 |.
Proof. As a preamble to the proof, let 𝜇 be the usual Borel probability measure
on 2Γ . We will need the following standard fact.
Claim 11.2.4. Let 𝐵 ⊂ 𝑋 be a Borel 𝜇-positive set and ℎ ∶ 𝐵 → 2𝜔 be a Borel map.

Then
(1) either there is a group element 𝛾 ∈ Γ such that the set {𝑥 ∈ 𝐵 ∶ 𝛾 ⋅ 𝑥 ∈ 𝐵 ∧
¬ℎ(𝑥) 𝔼0 ℎ(𝛾 ⋅ 𝑥)} is 𝜇-positive; or
(2) there is a point 𝑦 ∈ 2𝜔 such that the set ℎ−1 {𝑦} is 𝜇-positive.
Proof. Suppose that the first item fails. Then, for each group element 𝛾 ∈ Γ the
set 𝐶𝛾 = {𝑥 ∈ 𝐵 ∶ 𝛾⋅𝑥 ∈ 𝐵∧¬ℎ(𝑥) 𝔼0 ℎ(𝛾⋅𝑥)} is 𝜇-null, so the Borel set 𝐵0 = 𝐵⧵⋃𝛾 𝐶𝛾 ⊂
𝑋 is 𝜇-positive. Note that ℎ ↾ 𝐵0 is a homomorphism of 𝐸 to 𝔼0 . The homomorphism
can be extended to one whose domain is all of 𝑋. To see this, put 𝑘(𝑥) = ℎ(𝑥) if 𝑥 ∈ 𝐵0 ,
𝑘(𝑥) = ℎ(𝛾 ⋅ 𝑥) where 𝛾 is the first element of Γ such that 𝛾 ⋅ 𝑥 ∈ 𝐵0 if 𝑥 ∈ [𝐵0 ]𝐸 ⧵ 𝐵0 ,
and ℎ(𝑥) = 𝑧 for some fixed 𝑧 ∈ 2𝜔 if 𝑥 ∉ [𝐵0 ]𝐸 .
Now, by [46, Theorem A4.1] there is an 𝔼0 -class whose 𝑘-preimage has 𝜇-mass one.
By a 𝜎-additivity argument, there must be a point 𝑦 ∈ 2𝜔 in this 𝔼0 -class such that the
set 𝑘−1 {𝑦} ∩ 𝐵0 is 𝜇-positive. This confirms the second item and proves the claim. □
Suppose now that 𝜅 is an inaccessible cardinal. Suppose that 𝑃 is a Suslin forcing such
that 𝑃 is definably balanced below 𝜅. Let 𝑊 be the symmetric Solovay model derived
from 𝜅 and work in 𝑊. Let 𝑝 ∈ 𝑃 be a condition and let 𝜏 be a 𝑃-name for a function
from the quotient 𝐸-space to the quotient 𝔼0 -space; we must find distinct 𝐸-classes and
condition stronger than 𝑝 forcing 𝜏 to map the two 𝐸-classes to the same 𝔼0 -class. The
condition 𝑝 as well as the name 𝜏 are defined from some parameters in the ground
model and perhaps an additional parameter 𝑧 ∈ 2𝜔 . Find an intermediate extension
𝑉[𝐾] of the ground model using a poset of cardinality smaller than 𝜅 such that 𝑧 ∈
𝑉[𝐾], and work in the model 𝑉[𝐾].
Let 𝑌 = 𝑋 𝜔1 be the product space and let 𝜈 be the Borel probability measure on
𝑌 obtained as the product of ℵ1 many copies of 𝜇. Let 𝑄 be the random algebra asso-
ciated with 𝜈 [35, 254J, Volume 2]. Let 𝐻 ⊂ 𝑄 be a filter generic over 𝑉[𝐾] and work
in 𝑉[𝐾][𝐻]. It is well-known that the filter 𝐻 is specified by a sequence ⟨𝑥𝛼 ∶ 𝛼 ∈ 𝜔1 ⟩
of points in 𝑋. Moreover, for each ordinal 𝛼 ∈ 𝜔1 , writing 𝑉[𝐾][𝐻𝛼 ] for the model
𝑉[𝐾][⟨𝑥𝛽 ∶ 𝛽 ≠ 𝛼⟩], the point 𝑥𝛼 ∈ 𝑋 is 𝑅-generic over 𝑉[𝐾][𝐻𝛼 ] where 𝑅 is the poset
of 𝜇-positive Borel subsets of 𝑋 ordered by inclusion. By the definable balance assump-
tion on 𝑃, there exist an element 𝑣 ∈ 2𝜔 and a definition of a balanced virtual condition
𝑝 ̄ ≤ 𝑝 using 𝑣 as a parameter. By a c.c.c. argument with the poset 𝑄, there is an ordinal
𝛼 ∈ 𝜔1 such that 𝑣 ∈ 𝑉[𝐾][𝐻𝛼 ]. Work in the model 𝑉[𝐾][𝐻𝛼 ].
Let 𝑥𝑔𝑒𝑛
̇ be the 𝑅-name for the generic point in 𝑋. By a balance argument (Propo-
sition 5.2.4), there must be a condition 𝐵 ∈ 𝑅 and an 𝑅-name 𝜂 for an element of 2𝜔
such that 𝐵 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩ 𝜏([𝑥𝑔𝑒𝑛 ̇ ]𝐸 ) = [𝜂]𝔼0 . Strengthening the condition 𝐵
if necessary we may find a continuous function ℎ ∶ 𝐵 → 2𝜔 such that 𝐵 ⊩ 𝜂 = ℎ(𝑥𝑔𝑒𝑛 ̇ ).
As per Claim 11.2.4, there are two options.
Case 1. There is a group element 𝛾 ∈ Γ such that the set 𝐶 = {𝑥 ∈ 𝐵 ∶ 𝛾 ⋅ 𝑥 ∈
𝐵 ∧ ¬ℎ(𝑥) 𝔼0 ℎ(𝛾 ⋅ 𝑥)} is 𝜇-positive. In such a case, let 𝑥 ∈ 𝐶 be a point 𝑅-generic
over 𝑉[𝐾][𝐻𝛼 ]. Since the measure 𝜇 is invariant under the action, the point 𝛾 ⋅ 𝑥 ∈ 𝑋
is a point 𝑅-generic over 𝑉[𝐾][𝐻𝛼 ] as well, and 𝑉[𝐾][𝐻][𝑥] = 𝑉[𝐾][𝐻][𝛾 ⋅ 𝑥]. The
evaluation of the definition of 𝑝 ̄ ≤ 𝑝 yields the same balanced virtual condition in these
two equal models. By the forcing theorem, in the model 𝑊, the condition 𝑝 ̄ forces in
the poset 𝑃 that 𝜏([𝑥]𝐸 ) = [ℎ(𝑥)]𝔼0 and 𝜏([𝛾 ⋅ 𝑥]𝐸 ) = [ℎ(𝛾 ⋅ 𝑥)]𝔼0 . However, the left
hand sides of these equations are equal while the right hand sides are not by the case
assumption. This is a contradiction showing that Case 1 is in fact impossible.
Case 2. There is a point 𝑦 ∈ 2𝜔 such that the set 𝐶 = ℎ−1 {𝑦} is 𝜇-positive. Let 𝑥 ∈ 𝐶
be a point 𝑅-generic over 𝑉[𝐾][𝐻𝛼 ]. By a simple density argument, the set 𝐷 = {𝑢 ∈
2Γ ∩ 𝑉[𝐾][𝐻𝛼 ] ∶ 𝑢 + 𝑥 ∈ 𝐶} is uncountable in 𝑉[𝐾][𝐻𝛼 ][𝑥], where + is coordinatewise
binary addition on 2Γ . Let 𝑢 ∈ 𝐷 be point such that 𝑢+𝑥 is not 𝐸-related to 𝑥. Since the
measure 𝜇 is invariant under coordinatewise binary addition of 𝑢, it follows that the
point 𝑢 + 𝑥 ∈ 𝐶 is also 𝑅-generic over 𝑉[𝐾][𝐻𝛼 ]; clearly 𝑉[𝐾][𝐻𝛼 ][𝑥] = 𝑉[𝐾][𝐻𝛼 ][𝑢 +
𝑥]. The evaluation of the definition of 𝑝 ̄ ≤ 𝑝 yields the same balanced virtual condition
in these two equal models. By the forcing theorem, in the model 𝑊, the condition 𝑝 ̄
forces in the poset 𝑃 that 𝜏([𝑥]̌ 𝐸 ) = [𝑦]̌ 𝔼0 and 𝜏([𝑢 + 𝑥]𝐸 ) = [𝑦]̌ 𝔼0 . Now, the right hand
sides of these equations are equal by the case assumption while the left hand hand sides
are not by the choice of 𝑢 ∈ 2Γ . It follows that 𝑝 ̄ forces 𝜏 not to be an injection from
the 𝐸-quotient space to the 𝔼0 -quotient space as required. □
Example 11.2.5. Let 𝑃 be the partial ordering introducing a nontrivial automor-
phism of the algebra 𝒫(𝜔) modulo finite as in Section 8.4. As proved in Theorem 8.4.3,
the balanced virtual conditions are classified precisely by automorphisms of the alge-
bra. At the same time, every condition ( an automorphism of a countable subalgebra)
can be extended into a total automorphism which is trivial, i.e. generated by a bijection
between cofinite subsets of 𝜔 [9, Theorem 2.3]. Such a total automorphism is clearly
definable from a real.
Corollary 11.2.6.
(1) Let 𝑃 be the poset for adding a nontrivial automorphism of the algebra 𝒫(𝜔)
modulo finite of Section 8.4. In the 𝑃-extension of the Solovay model, there is no
discontinuous homomorphism between Polish groups.
nontrivial automorphism of 𝒫(𝜔) modulo finite, and there is no discontinuous
homomorphism between Polish groups.
Proof. The poset 𝑃 is definably balanced by Example 11.2.5. It is clearly 𝜎-closed,
so in the 𝑃-extension of the Solovay model, ZF+DC holds. By Theorem 11.2.2, in the
𝑃-extension the chromatic number of the Hamming graph ℍ2 is uncountable.. By a
ZF+DC result of [89], this abstractly implies that there are no discontinuous homo-
morphisms between Polish groups. □
11.3. CENTERED CONTROL 237
Example 11.2.7. Let 𝐸 be a pinned Borel equivalence relation on a Polish space

𝑋. The poset 𝑃 of Example 6.4.7 adding a countable complete section of 𝐸 is definably
balanced. To see this, present 𝑃 as the poset of countable sets 𝑝 ⊂ 𝑋 ordered by 𝑝1 ≤ 𝑝0
if 𝑝1 ∩ [𝑝0 ]𝐸 = 𝑝0 , ordered by reverse inclusion. The balanced virtual conditions are
classified by subsets of 𝑋 which have nonempty intersection with every 𝐸-class. For
every condition 𝑝 ∈ 𝑃 one can easily produce a balanced virtual condition below 𝑝–
one option is the balanced virtual condition 𝑝 ̄ ≤ 𝑝 associated with the set 𝑝 ∪ 𝑋 ⧵ [𝑝]𝐸 .
Corollary 11.2.8. Let 𝐸 be a pinned Borel equivalence relation on a Polish space
𝑋. Let Γ be a non-amenable countable group acting on 2Γ by shift, inducing a countable
Borel orbit equivalence relation 𝐹.
(1) Let 𝑃 be the partial ordering adding a countable complete section to 𝐸. In the
𝑃-extension of the symmetric Solovay model, |𝐹| ≰ |𝔼0 | holds.
complete countable section, yet |𝐹| ≰ |𝔼0 |.
The following examples are stated without their attendant corollaries.
Example 11.2.9. Let 𝑃 be the poset of Section 8.5 adding a cofinal Kurepa family
on a fixed Polish space 𝑋. For every condition 𝑝 ∈ 𝑃 (a countable set of countable
subsets of 𝑋 closed under intersection) one can find a balanced virtual condition 𝑝 ̄ ≤ 𝑝
represented by the pair ⟨Coll(𝜔, 𝑋), 𝜏⟩ where 𝜏 is the name for the condition obtained
from 𝑝 by adding the set 𝑋 ∩ 𝑉. This is indeed a balanced pair as proved in Theo-
rem 8.5.3, and it is definable from a real.
Example 11.2.10. Let 𝑃 be the poset of Definition 8.6.3 adding a function 𝑓 ∶ [𝑋]2
→ [𝑋]ℵ0 without a free triple. Theorem 8.6.4 shows that every set mapping from [𝑋]2
to 𝒫(𝑋) without a free triple yields a balanced virtual condition. Now, given a condition
𝑝 ∈ 𝑃, one can consider the set mapping 𝑔 ∶ [𝑋]2 → 𝒫(𝑋) defined by letting 𝑔(𝑥, 𝑦) be
𝑝(𝑥, 𝑦) if {𝑥, 𝑦} ∈ dom(𝑝) and 𝑋 ⧵ {𝑥, 𝑦} otherwise. It is not difficult to see that 𝑔 yields
a definable balanced virtual condition below 𝑝.
Example 11.2.11. Let Γ be the clopen graph on 2𝜔 connecting points 𝑥0 ≠ 𝑥1
if the smallest number 𝑛 such that 𝑥0 (𝑛) ≠ 𝑥1 (𝑛) is even. Let 𝑃 be the partial order
of Example 12.2.20 forcing a failure of OCA by adding an uncountable subset of 2𝜔
containing no uncountable Γ-clique or Γ-anticlique. For every condition 𝑝 ∈ 𝑃 (which
is a pair ⟨𝑎𝑝 , 𝑏𝑝 ⟩ where 𝑎𝑝 ⊂ 2𝜔 is a countable set and 𝑏𝑝 is a countable collection of
closed Γ-cliques and closed Γ-anticliques) one can find a balanced virtual condition 𝑝 ̄ ≤
𝑝 represented by the pair ⟨Coll(𝜔, 2𝜔 ), 𝜏⟩ where 𝜏 is the name for the pair ⟨𝑎𝑝 , 𝑏𝑝̄ ⟩ where
𝑏𝑝̄ is the set of all closed Γ-cliques and all closed Γ-anticliques coded in the ground
model. This is indeed a balanced pair below 𝑝 as shown in Example 12.2.20 and it is
definable from a real.
11.3. Centered control

In this section, we provide technology for preserving uncountable chromatic num-
bers for arbitrary analytic finitary hypergraphs. The method requires a brief preamble
describing a familiar variation of c.c.c. for partial orders.
Definition 11.3.1. Let 𝑄 be a partial order. A set 𝐴 ⊂ 𝑄 is centered if every finite
subset of 𝐴 has a common lower bound in 𝑄.
Definition 11.3.2. Let 𝑅 be a Suslin forcing. We say that 𝑅 is Suslin-𝜎-centered if

𝑅 = ⋃𝑛 𝐴𝑛 where each 𝐴𝑛 is a centered analytic set.
It is obvious that a Suslin-𝜎-centered poset is c.c.c. because no centered set can contain
incompatible conditions. We need a small variation of a familiar finite support iteration
preservation theorem.
Proposition 11.3.3. Let 𝑅 be a Suslin-𝜎-centered poset and let 𝑄 be its finite support
iteration of length 𝜔1 . There is a parameter 𝑧 ∈ 2𝜔 such that 𝑄 is covered by sets each of
which is centered and definable from 𝑧 and an ordinal parameter.
Proof. We start with a general claim which will be re-used several times later.
Let 𝑅 be any Suslin forcing, let 𝑅 = ⋃𝑛 𝐴𝑛 be a cover by countably many analytic sets.
Let 𝑄 be the finite support iteration of 𝑅 of length 𝜔1 . For every finite partial function
𝑔 ∶ 𝜔1 → 𝜔 let 𝐵𝑔 = {𝑞 ∈ 𝑄 ∶ supp(𝑞) = dom(𝑔) and ∀𝛼 ∈ dom(𝑔) 𝑞 ↾ 𝛼 ⊩ 𝑞(𝛼) ∈
𝐴𝑔(𝛼) }.
Claim 11.3.4. For every condition 𝑞 ∈ 𝑄 there exist a finite partial function 𝑔 ∶ 𝜔1 →
𝜔 and a condition stronger than 𝑞 in the set 𝐵𝑔 .
Proof. This argument is standard. First, use a Shoenfield absoluteness argument

to prove that 𝑅 = ⋃𝑛 𝐴𝑛 holds in every forcing extension. Now, to find 𝑞′ ≤ 𝑞 and 𝑔,
by induction on 𝑛 ∈ 𝜔 build conditions 𝑞𝑛 , ordinals 𝛼𝑛 ∈ 𝜔1 and numbers 𝑚𝑛 ∈ 𝜔 so
that
• 𝑞 = 𝑞0 ≥ 𝑞 1 ≥ 𝑞 2 ≥ . . . ;
• 𝛼0 = max(dom(𝑞)) and 𝛼𝑛+1 = max(dom(𝑞𝑛+1 )) ∩ 𝛼𝑛 ;
• ∀𝛽 ∉ 𝛼𝑛 𝑞𝑛 (𝛽) = 𝑞𝑛+1 (𝛽) and 𝑞𝑛+1 ↾ 𝛼𝑛 ⊩ 𝑞(𝛼𝑛 ) ∈ 𝐴𝑚𝑛 .
This is easily done. Once 𝑞𝑛 , 𝛼𝑛 are known, just find a condition 𝑞 ̄ in the iteration
𝑄 ↾ 𝛼𝑛 up to 𝛼𝑛 and a number 𝑚𝑛 ∈ 𝜔 such that 𝑞 ̄ ≤ 𝑞𝑛 ↾ 𝛼𝑛 and 𝑞 ̄ ⊩ 𝑞𝑛 (𝛼) ∈ 𝐴𝑚𝑛 .
Let 𝑞𝑛+1 = 𝑞 ̄ ∪ 𝑞𝑛 ↾ [𝛼𝑛 , 𝜔1 ), 𝛼𝑛+1 = max dom(𝑞𝑛+1 ) ∩ 𝛼𝑛 , and continue the induction.
By a well-foundedness argument, the process has to stop at some 𝑛 ∈ 𝜔. The only way
it can stop is that dom(𝑞𝑛+1 ) ∩ 𝛼𝑛 = 0. For such number 𝑛 ∈ 𝜔, it is clear that 𝑞𝑛+1 ≤ 𝑞
is a condition in the set 𝐵𝑔 where 𝑔 is the function such that 𝑔(𝛼𝑖 ) = 𝑚𝑖 for all 𝑖 ≤ 𝑛. □
Now, to the specific situation of the proposition. Let 𝑅 = ⋃𝑛 𝐴𝑛 be a cover by

analytic centered sets. Let 𝑧 ∈ 2𝜔 be a parameter defining 𝑅 and the cover. Note that
each of the sets 𝐴𝑛 remains centered and 𝑅 = ⋃𝑛 𝐴𝑛 holds in every forcing extension
by Shoenfield absoluteness. For each finite partial function 𝑔 ∶ 𝜔1 → 𝜔 let 𝐵𝑔 = {𝑞 ∈
𝑄 ∶ supp(𝑞) = dom(𝑔) and ∀𝛼 ∈ 𝑎 𝑞 ↾ 𝛼 ⊩ 𝑞(𝛼) ∈ 𝐴𝑔(𝛼) }. These sets are definable
from 𝑧 and an ordinal parameter, and their union is dense in 𝑄 by Claim 11.3.4. Thus,
it is enough to verify that each set 𝐵𝑔 is centered.
If 𝑛 ∈ 𝜔 and 𝑞𝑖 for 𝑖 ∈ 𝑛 are conditions in 𝐵𝑔 , by induction on the ordinal 𝛼 ∈
dom(𝑔) find 𝑄 ↾ 𝛼-names 𝜂𝛼 for conditions in 𝑅 which are (forced to be) the lower
bound of 𝑞𝑖 (𝛼) for all 𝑖 ∈ 𝑛. This is possible as the analytic set 𝐴𝑔(𝛼) ⊂ 𝑅 is centered.
In the end, the sequence ⟨𝜂𝛼 ∶ 𝛼 ∈ dom(𝑔)⟩ is a lower bound of the conditions 𝑞𝑖 for
𝑖 ∈ 𝑛 as required. □
Finally, we are in a position to speak about balanced forcing.

Definition 11.3.5. Let 𝑃 be a Suslin forcing. We say that 𝑃 is balanced with cen-
tered control if for every condition 𝑝 ∈ 𝑃 there exist a parameter 𝑧 ∈ 2𝜔 and a pair
⟨𝑄, 𝜎⟩ definable from parameter 𝑧 such that
(1) 𝑄 is a poset and 𝜎 is a 𝑄-name;
(2) 𝑄 ⊩ 𝜎 is a balanced virtual condition in 𝑃 below 𝑝;
(3) 𝑄 is covered by sets each of which is centered and definable from 𝑧 and an
ordinal parameter.
Theorem 11.3.6. Let Γ be a finitary analytic hypergraph of uncountable Borel chro-
matic number. In extensions of the symmetric Solovay model by balanced posets with
centered control, Γ has uncountable chromatic number.
Proof. As a preliminary consideration, it is clear from Fact 11.1.8 that it is
enough to consider the case of Γ which is a principal skew product as in Definition
11.1.7. Let ⟨𝑎𝑛 , 𝐻𝑛 , 𝑡𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a sequence such that 𝐻𝑛 = {𝑎𝑛 } and Γ = ∏𝑛 𝐻𝑛 , 𝑡𝑛 .
Write 𝑋 = ∏𝑛 𝑎𝑛 ; the set 𝑋 is equipped with the usual compact Polish topology.
Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing such that 𝑃 is balanced
with centered control below 𝜅. Let 𝑊 be a symmetric Solovay model derived from 𝜅
and work in 𝑊. Let 𝜏 be a 𝑃-name and 𝑝 ∈ 𝑃 be a condition forcing 𝜏 to be a coloring
from 𝑋 to 𝜔. We must find a Γ-hyperedge 𝑒 ∈ Γ and a condition stronger than 𝑝 which
forces 𝑒 to be monochromatic in 𝜏.
The condition 𝑝 and the name 𝜏 are definable from some parameter 𝑧0 ∈ 2𝜔 and
some other parameters in the ground model. Let 𝑉[𝐾0 ] be an intermediate extension
obtained by a forcing of cardinality smaller than 𝜅 such that 𝑧 ∈ 𝑉[𝐾0 ]. Work in 𝑉[𝐾0 ].
Let 𝑃𝑋 be the Cohen forcing with the space 𝑋, with its name 𝑥𝑔𝑒𝑛 ̇ for the generic point
of the space 𝑋. View 𝑃𝑋 as the poset of all functions 𝑠 such that dom(𝑠) ∈ 𝜔 and for
all 𝑛 ∈ dom(𝑠), 𝑠(𝑛) ∈ 𝑎𝑛 holds; the ordering is that of reverse extension. Let 𝑅 be the
product of 𝜔1 many copies of 𝑃𝑋 , and let 𝐻 ⊂ 𝑅 be a filter generic over 𝑉[𝐾0 ]. By the
initial assumptions on the poset 𝑃, in the model 𝑉[𝐾0 ][𝐻] there is a parameter 𝑧1 ∈ 2𝜔
defining a pair ⟨𝑄, 𝜎⟩ as in Definition 11.3.5. By a c.c.c. argument with the poset 𝑅, the
name for the parameter 𝑧1 depends on only countably many coordinates of the product
𝑅. Fix a coordinate of the product 𝑅 on which the name for 𝑧1 does not depend, let 𝐾1
be the filter obtained from 𝐻 by disregarding this coordinate, and work in the model
𝑉[𝐾0 ][𝐾1 ].
Note that the model 𝑉[𝐾0 ][𝐻] is a 𝑃𝑋 -generic extension of 𝑉[𝐾0 ][𝐾1 ]. By a balance
argument (Proposition 5.2.4) with the virtual condition 𝜎, it must be the case that 𝑃𝑋 ⊩
𝑄̇ ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 decides the value of 𝜏(𝑥𝑔𝑒𝑛 ̇ ). Let ⟨𝑠, 𝑞⟩̇ be a condition in the
iteration 𝑃𝑋 ∗ 𝑄̇ and 𝑚 ∈ 𝜔 be a number such that ⟨𝑠, 𝑞⟩̇ ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜏(𝑥𝑔𝑒𝑛 ̇ ) = 𝑚.̌
Use the centeredness assumptions on the poset 𝑄 and strengthen the condition 𝑠 if
necessary to find a specific definition for a centered set 𝐶 ⊂ 𝑄 such that 𝑠 ⊩ 𝑞 ̇ ∈ 𝐶.
Strengthening the condition 𝑠 further if necessary, we may assume that 𝑠 = 𝑡𝑛 for some
Let 𝑥 ∈ 𝑋 be a point 𝑃𝑋 -generic over the model 𝑉[𝐾0 ][𝐾1 ] and work in the model
𝑉[𝐾0 ][𝐾1 ][𝑥]. For each index 𝑖 ∈ 𝑎𝑛 , let 𝑥𝑖 be the function obtained from 𝑥 by replacing
its 𝑛-th entry with 𝑖. Thus, each 𝑥𝑖 ∈ 𝑋 is a point 𝑃𝑋 -generic over 𝑉[𝐾0 ][𝐾1 ] and
the model 𝑉[𝐾0 ][𝐾1 ][𝑥𝑖 ] is equal to 𝑉[𝐾0 ][𝐾1 ][𝑥]. Consider the poset 𝑄 in the model
𝑉[𝐾0 ][𝐾1 ][𝑥]. Observe that the evaluation of the definition of 𝑄 and the centered set
𝐶 does not depend on 𝑥 or any 𝑥𝑖 for 𝑖 ∈ 𝑎𝑛 .
The conditions 𝑞𝑖 = 𝑞/𝑥 ̇ 𝑖 for 𝑖 ∈ 𝑎𝑛 all belong to the centered set 𝐶, and thus have
a common lower bound. Let 𝐺 ⊂ 𝑄 be a filter containing this common lower bound
and work in the model 𝑉[𝐾0 ][𝐾1 ][𝑥][𝐺]. Let 𝑝 ̄ be the balanced virtual condition 𝜎/𝐺.
Let 𝑖 ∈ 𝑎𝑛 be an arbitrary index. By the forcing theorem applied with 𝑥𝑖 and 𝐺, we
conclude that Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩ 𝜏(𝑥𝑖̌ ) = 𝑚.̌ By the forcing theorem, in the model 𝑊,
𝑝 ̄ ⊩ {𝑥𝑖̌ ∶ 𝑖 ∈ 𝑎𝑛 } is a 𝜏-monochromatic hyperedge in the hypergraph Γ. This completes
the proof. □
Now we attend to the task of producing interesting definably centered control posets.
All of our examples will be finite support iterations of Suslin-𝜎-centered posets of length
𝜔1 . Accordingly, the arguments consist of two stages. In the regularity stage, we pro-
duce a definable, definably centered poset 𝑅 with a name 𝜏 for a virtual condition in
𝑃. In the amalgamation stage, we show that 𝑅 can be iterated with finite support in
length 𝜔1 , yielding a definably centered iteration 𝑄 and 𝑄-names 𝜏𝛼 for 𝛼 ∈ 𝜔1 for
virtual conditions in 𝑃, and we show that these virtual conditions can be amalgamated
into a balanced virtual condition which can extend any condition 𝑝 ∈ 𝑃 specified be-
forehand.
Our first example is motivated by a ZF+DC result of [20]: for every Borel locally
finite graph on a Polish space 𝑋, if the chromatic number of 𝐺 is ≤ 𝑛, then there exist
a meager set 𝐵 ⊂ 𝑋 and a decomposition of the set 𝑋 ⧵ 𝐵 into 2𝑛 − 1 many Borel
𝐺-anticliques. We have:
Example 11.3.7. Let 𝐺 be a Borel locally finite graph on a Polish space 𝑋 of chro-
matic number 𝑛. Let 𝐸 be the 𝐺-path connectivity equivalence relation on 𝑋. Let 𝑃 be
the poset of countable functions 𝑝 assigning to each 𝐸-class represented in the domain
of 𝑝 a 𝐺-coloring of the class with 2𝑛 − 1 many colors, ordered by reverse inclusion.
Then 𝑃 is a balanced Suslin forcing with centered control.
Proof. Recall that the balanced virtual conditions for 𝑃 are classified by functions
which to each 𝐸-class assign a 𝐺-coloring on that 𝐸-class–Example 6.4.8. Thus, we
strive for a definably centered poset adding such a function by a definable name.
In the regularity stage of the proof, let 𝑅 consist of finite partial 𝐺-colorings 𝑟 from
𝑋 to 2𝑛 − 1 satisfying the boundary condition: for every 𝑥 ∈ dom(𝑟), if there is 𝑦 ∈
𝑋 ⧵ dom(𝑟) such that {𝑥, 𝑦} ∈ 𝐺, then 𝑟(𝑥) ∉ 𝑛. The ordering on 𝑅 is that of reverse
inclusion. Let 𝜏 be the 𝑅-name for the union of the generic filter on 𝑅.
Claim 11.3.8.
(1) The poset 𝑅 is Suslin and Suslin-𝜎-centered;
(2) 𝑅 forces 𝜏 ∶ 𝑋 ∩ 𝑉 → 2𝑛 − 1 to be a 𝐺-coloring with domain 𝑋 ∩ 𝑉.
Proof. For the first item, it is not difficult to see that the poset 𝑅 is Suslin. To
show that 𝑅 is Suslin-𝜎-centered, call a pair ⟨𝑜, 𝑓⟩ a descriptor of a condition 𝑟 ∈ 𝑅 if 𝑜
is a finite collection of basic open subsets of 𝑋 such that each point 𝑥 ∈ dom(𝑟) belongs
to exactly one set in 𝑂 ∈ 𝑜 which moreover contains no other points 𝐺-connected to
some element of dom(𝑟) besides possibly 𝑥, each set in 𝑜 contains exactly one point
in dom(𝑟), and 𝑓 is a function with domain 𝑜 such that for every open set 𝑂 ∈ 𝑜,
𝑓(𝑂) = 𝑟(𝑥) for the unique element 𝑥 ∈ dom(𝑟) ∩ 𝑂. It is not difficult to see that there
are only countably many available descriptors, each condition 𝑟 ∈ 𝑅 has at least one,
and for each descriptor ⟨𝑜, 𝑓⟩ the set 𝐴 = {𝑟 ∈ 𝑅 ∶ ⟨𝑜, 𝑓⟩ is a descriptor of 𝑟} is analytic
and centered. For the centeredness, it is not difficult to see that if 𝑎 ⊂ 𝐴 is a finite set
then ⋃ 𝑎 is a 𝐺-coloring. The coloring ⋃ 𝑎 also satisfies the boundary condition: if
⟨𝑥 ∈ dom(⋃ 𝑎) and 𝑦 ∈ 𝑋 ⧵ dom(⋃ 𝑎), are 𝐺-connected, then 𝑥 ∈ 𝑟 for some 𝑟 ∈ 𝑎,
so 𝑟(𝑥) ∉ 𝑛 by the boundary condition for 𝑟. Thus, ⋃ 𝑎 ∈ 𝑅 is a common lower bound
of the set 𝑎. This completes the proof of (1).
For the second item, it is necessary to show that if 𝑟 ∈ 𝑅 is a condition and 𝑥 ∈ 𝑋 is
a point, then there is a condition 𝑠 ≤ 𝑟 such that 𝑥 ∈ dom(𝑠). To this end, let 𝑎2 , 𝑎3 , 𝑎4 ⊂
𝑋 be the finite sets of all points 𝑦 ∈ 𝑋 which have 𝐺-distance from dom(𝑟) ∪ {𝑥} smaller
than 2, 3, 4 respectively. Let 𝑐 ∶ 𝑎4 → 2𝑛−1 be a 𝐺-coloring extending 𝑟 which uses only
colors in 𝑛 on 𝑎4 ⧵ dom(𝑟); such a coloring exists by the chromatic number assumption
on 𝐺 and the boundary condition on 𝑟 ∈ 𝑅. Let 𝑑 ∶ 𝑎4 → 2𝑛 − 1 be the map defined
by 𝑑(𝑦) = 𝑐(𝑦) if 𝑦 ∈ 𝑎2 , 𝑑(𝑦) = 0 if 𝑐(𝑦) = 0, and 𝑑(𝑦) = 𝑐(𝑦) + 𝑛 − 1 otherwise. An
inspection reveals that 𝑑 is a 𝐺-coloring. Now, let 𝑎 = 𝑎3 ∪ {𝑦 ∈ 𝑎4 ∶ ∃𝑧 ∈ 𝑎3 𝑑(𝑧) =
0 ∧ {𝑧, 𝑦} ∈ 𝐺} and let 𝑠 = 𝑑 ↾ 𝑎.
By the definitions, 𝑠 is a partial 𝐺-coloring extending 𝑟 and 𝑥 ∈ dom(𝑠). We have
to show that 𝑠 satisfies the boundary condition. Suppose that points 𝑦 ∈ 𝑎 and 𝑧 ∉ 𝑎
form a 𝐺-edge. Then 𝑦 ∉ 𝑎2 since 𝑎3 ⊂ 𝑎. Thus, 𝑑(𝑦) = 0 or 𝑑(𝑦) ∉ 𝑛. The former case
is impossible: in it, 𝑦 ∈ 𝑎3 must hold by the definition of the set 𝑎, and this implies that
𝑧 ∈ 𝑎 by the definition of the set 𝑎. The necessity of the latter case shows that 𝑠 ∈ 𝑅
holds as desired. □
We are ready for the amalgamation stage of the proof. Let 𝑄 be the finite support it-
eration of the poset 𝑅 of length 𝜔1 . Claim 11.3.8(1) and Proposition 11.3.3 show that
the poset 𝑄 is definably centered. For each ordinal 𝛼 ∈ 𝜔1 let 𝜏𝛼 be the 𝑄-name for the
coloring obtained by the 𝛼-th iterand in 𝑄, and let 𝑀𝛼 be the 𝑄-name for the generic
extension obtained by the first 𝛼-many stages of the iteration. Let 𝜎 be the 𝑄-name
for the amalgamation of the maps 𝜏𝛼 : for every point 𝑥 ∈ 𝑋, 𝜎(𝑥) = 𝜏𝛼 (𝑥) where 𝛼
is the first ordinal 𝛼 ∈ 𝜔1 such that 𝑥 ∈ 𝑀𝛼 holds. By a c.c.c. argument with 𝑄, 𝜎 is
a name for a total map from 𝑋 to 2𝑛 − 1. Since the graph 𝐺 is locally finite, for any
edge {𝑥, 𝑦} ∈ 𝐺 and any ordinal 𝛼 ∈ 𝜔1 , 𝑥 ∈ 𝑀𝛼 ↔ 𝑦 ∈ 𝑀𝛼 holds. This means that
𝜎(𝑥) = 𝜏𝛼 (𝑥) and 𝜎(𝑦) = 𝜏𝛼 (𝑦) for the same ordinal 𝛼 ∈ 𝜔1 and 𝜎 is a name for a total
𝐺-coloring.
Now, suppose that a condition 𝑝 ∈ 𝑃 in the ground model is prescribed. Let 𝜎𝑝 be
the 𝑄-name for a total function on the 𝐸-quotient space which to each 𝐸-class 𝑐 assigns
the coloring 𝑝(𝑐) if 𝑐 ∈ dom(𝑝) and the coloring 𝜎 ↾ 𝑐 if 𝑐 ∉ dom(𝑐). This is a definable
𝑄-name; 𝑄 ⊩ 𝜎𝑝 is a balanced virtual condition by Theorem 6.4.5. □
Corollary 11.3.9. Let 𝐺 be a locally finite Borel graph on a Polish space 𝑋 of fi-
nite chromatic number 𝑛. Let 𝐻 be a finitary analytic hypergraph of uncountable Borel
chromatic number.
(1) Let 𝐸 be the 𝐺-path connectivity equivalence relation on 𝑋. Let 𝑃 be the poset
of all partial 𝐺-colorings 𝑝 with 2𝑛 − 1 many colors such that dom(𝑝) is an
𝐸-invariant set, ordered by reverse inclusion. In the 𝑃-extension of the Solovay
model, the chromatic number of 𝐻 is uncountable.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds and the
chromatic number of 𝐺 is ≤ 2𝑛 − 1 and the chromatic number of 𝐻 is uncount-
able.
Our second example shows how to turn a given countable Borel equivalence relation
into an orbit equivalence relation of a (discontinuous) action of ℤ, without changing
uncountable chromatic numbers of analytic hypergraphs.
Example 11.3.10. Let 𝐸 be a countable Borel equivalence relation on a Polish
space 𝑋 with all classes infinite. The uniformization poset 𝑃 of Example 6.4.9 of count-
able functions assigning a ℤ-ordering to each 𝐸-class in the domain, ordered by reverse
inclusion, has centered control.
Proof. Recall that the balanced virtual conditions in 𝑃 are classified by functions
which to each 𝐸-class assign an ordering on that 𝐸-class isomorphic to ℤ by Exam-
ple 6.4.8. Thus, we strive to construct a definably centered poset 𝑄 which adds such a
function via a definable name.
Start with the regularity stage of the proof. Let 𝑅 consist of finite sets 𝑟 ⊂ 𝐸 such
that, viewing 𝑟 as a directed graph on 𝑋, each vertex has 𝑟-outflow ≤ 1 and 𝑟-inflow
≤ 1 and 𝑟 is acyclic. The ordering on 𝑅 is that of reverse inclusion. Let 𝜏 be the 𝑅-name
for the union of the generic filter.
Claim 11.3.11.
(1) 𝑅 is a Suslin, Suslin-𝜎-centered poset;
(2) 𝑅 forces 𝜏 to be a directed graph which on each 𝐸-class in 𝑉 is isomorphic to the
successor graph on ℤ.
Proof. The second item follows from a straightforward density argument. For
the first item, it is easy to oberve that 𝑅 is Suslin. To show that 𝑅 is Suslin-𝜎-centered,
use the Feldman–Moore theorem to find a countable group Γ acting on 𝑋 in a Borel
way such that 𝐸 is the resulting orbit equivalence relation. For any condition 𝑟 ∈ 𝑅,
write 𝑣𝑟 ⊂ 𝑋 for the set of all points mentioned in one of the edges in 𝑟, and say that
a pair ⟨𝑜, 𝑓⟩ is a descriptor of 𝑟 if 𝑜 is a finite collection of pairwise disjoint subsets of
𝑋, each point 𝑥 ∈ 𝑣𝑟 belongs to exactly one open set in 𝑜, each open set in 𝑜 contains
exactly one point of 𝑣𝑟 , and 𝑓 is a partial function from 𝑜 × 𝑜 to Γ such that 𝑓(𝑂0 , 𝑂1 )
equals to some element 𝛾 ∈ Γ such that 𝛾 ⋅ 𝑥0 = 𝑥1 whenever 𝑥0 , 𝑥1 are the unique
points in 𝑣𝑟 ∩ 𝑂0 and 𝑣𝑟 ∩ 𝑂1 and ⟨𝑣0 , 𝑣1 ⟩ ∈ 𝑟. It is not difficult to see that there are
only countably many available descriptors, each condition in 𝑅 has one, and for each
descriptor ⟨𝑜, 𝑓⟩, the set 𝐴 = {𝑟 ∈ 𝑅 ∶ ⟨𝑜, 𝑓⟩ is a descriptor of 𝑟} is analytic and centered.
This completes the proof of the claim. □
The amalgamation stage of the proof proceeds just like in Example 11.3.7. Let 𝑄 be
the finite support iteration of the poset 𝑅 of length 𝜔1 . Claim 11.3.11(1) and Proposi-
tion 11.3.3 show that the poset 𝑄 is definably centered. For each ordinal 𝛼 ∈ 𝜔1 let 𝜏𝛼
be the 𝑄-name for the directed graph obtained by the 𝛼-th iterand in 𝑄, and let 𝑀𝛼 be
the 𝑄-name for the generic extension obtained by the first 𝛼-many stages of the itera-
tion. Let 𝜎 be the 𝑄-name for the amalgamation of the graphs 𝜏𝛼 : for any pair of points
𝑥0 , 𝑥1 ∈ 𝑋, ⟨𝑥0 , 𝑥1 ⟩ ∈ 𝜎 ↔ ⟨𝑥0 , 𝑥1 ⟩ ∈ 𝜏𝛼 where 𝛼 is the first ordinal 𝛼 ∈ 𝜔1 such that
𝑥0 , 𝑥1 ∈ 𝑀𝛼 holds. By a c.c.c. argument with 𝑄 and the countability of the equivalence
relation 𝐸, 𝜎 is a name for a directed graph which is isomorphic to the successor graph
on ℤ on every 𝐸-class.
Now, suppose that a condition 𝑝 ∈ 𝑃 in the ground model is prescribed. Let 𝜎𝑝 be
the 𝑄-name for a total function on the 𝐸-quotient space which to each 𝐸-class 𝑐 assigns
the ordering 𝑝(𝑐) if 𝑐 ∈ dom(𝑝) and the transitive closure of the directed graph 𝜎 ↾ 𝑐
if 𝑐 ∉ dom(𝑐). This is a definable 𝑄-name; 𝑄 ⊩ 𝜎𝑝 is a balanced virtual condition by
Theorem 6.4.5 and Example 6.4.9. □
Corollary 11.3.12. Let 𝐸 be a countable Borel equivalence relation on a Polish

space 𝑋 with all classes infinite. Let 𝐻 be a finitary analytic hypergraph of uncountable
Borel chromatic number.
(1) Let 𝑃 be the poset of Example 6.4.9. In the 𝑃-extension of the Solovay model, the
chromatic number of 𝐻 is uncountable.
orbit equivalence relation of a ℤ-action, yet the chromatic number of 𝐻 is un-
countable.
Our third example shows that it is possible to collapse the cardinality of quotient of any
pinned Borel equivalence relation down to |𝔼0 | without changing uncountable chro-
matic numbers of analytic hypergraphs.

𝑋. The collapse poset of |𝐸| to |𝔼0 | as in Definition 6.4.1 has centered control.
Proof. Note that by Theorem 6.4.2 the balanced virtual conditions in the poset
𝑃 are classified by injections from the 𝐸-quotient space to the 𝔼0 -quotient space. This
observation guides the construction.
Start with the regularity stage of the proof. Let 𝑅 be the poset of all conditions 𝑟
such that for some number 𝑛(𝑟), 𝑟 ∶ 𝑋 → 2𝑛(𝑟) is a finite partial function. The ordering
is defined by 𝑠 ≤ 𝑟 if dom(𝑟) ⊂ dom(𝑠), for every 𝑥 ∈ dom(𝑟) 𝑟(𝑥) ⊂ 𝑠(𝑥), and for all
𝑥 𝐸 𝑦 in dom(𝑟) and all 𝑚 ∈ 𝑛(𝑠) ⧵ 𝑛(𝑟) 𝑠(𝑥)(𝑚) = 𝑠(𝑦)(𝑚). Let 𝜏 be the 𝑅-name for the
coordinatewise union of the generic filter.
Claim 11.3.14.
(1) 𝑅 is a Suslin, Suslin-𝜎-centered poset;
(2) 𝑅 forces 𝜏 to be a function from 𝑋 ∩ 𝑉 to 2𝜔 ⧵ 𝑉 such that for all 𝑥0 ∩ 𝑥1 ∈ 𝑋 ⧵ 𝑉,
𝑥0 𝐸 𝑥1 ↔ 𝜏(𝑥0 ) 𝔼0 𝜏(𝑥1 ).
Proof. The second item follows from a straightforward density argument. For the
first item, the Suslinity of 𝑅 is immediate. To argue that 𝑅 is Suslin-𝜎-centered, call a
pair ⟨𝑜, 𝑓⟩ a descriptor of a condition 𝑟 ∈ 𝑅 if 𝑜 is a finite collection of basic open subsets
of 𝑋 such that each point in dom(𝑟) belongs to one set in 𝑜 and each set in 𝑜 contains
exactly one point in dom(𝑟), and 𝑓 is a function with domain 𝑜 such that for every open
set 𝑂 ∈ 𝑜, 𝑓(𝑂) = 𝑟(𝑥) for the unique element 𝑥 ∈ dom(𝑟) ∩ 𝑂. It is not difficult to see
that there are only countably many available descriptors, each condition 𝑟 ∈ 𝑅 has at
least one, and for each descriptor ⟨𝑜, 𝑓⟩ the set 𝐴 = {𝑟 ∈ 𝑅 ∶ ⟨𝑜, 𝑓⟩ is a descriptor of 𝑟}
is analytic and centered. This completes the proof. □
Now we are ready for the amalgamation stage of the proof. Let 𝑄 be the finite support
iteration of the poset 𝑅 of length 𝜔1 . Claim 11.3.14 and Proposition 11.3.3 show that
the poset 𝑄 is definably centered. For each ordinal 𝛼 ∈ 𝜔1 let 𝜏𝛼 be the 𝑄-name for the
function obtained by the 𝛼-th iterand in 𝑄, and let 𝑀𝛼 be the 𝑄-name for the generic
extension obtained by the first 𝛼-many stages of the iteration. To amalgamate the maps
𝜏𝛼 for 𝛼 ∈ 𝜔1 , let 𝜎 be the 𝑄-name for a map from the 𝐸-quotient space to the 𝔼0 -
quotient space defined by 𝜎(𝑐) = 𝑑 if for the smallest ordinal 𝛼 ∈ 𝜔1 such that 𝑀𝛼
contains some representative 𝑥 ∈ 𝑐, 𝑑 = [𝜏𝛼 (𝑥)]𝔼0 holds. First note that the choice
of the representative 𝑥 ∈ 𝑀𝛼 is irrelevant by Claim 11.3.14(2), so the map 𝜎 is well-
defined. Second, the map 𝜎 is an injection. To see this, suppose that 𝑐0 , 𝑐1 are distinct
𝐸-classes, and 𝛼0 , 𝛼1 ∈ 𝜔1 are the smallest ordinals such that 𝑐0 , 𝑐1 have representatives
𝑥0 , 𝑥1 ∈ 𝑋 in the models 𝑀𝛼0 and 𝑀𝛼1 respectively. If 𝛼0 = 𝛼1 then 𝜏𝛼0 (𝑥0 ) 𝔼0 𝜏𝛼0 (𝑥1 )
fails by Claim 11.3.14(2). It follows that 𝜎(𝑐0 ) ≠ 𝜎(𝑐1 ) holds. If 𝛼0 ≠ 𝛼1 then note that
𝜎(𝑐0 ) ∈ 𝑀𝛼0 +1 ⧵ 𝑀𝛼0 and 𝜎(𝑐1 ) ∈ 𝑀𝛼1 +1 ⧵ 𝑀𝛼1 holds by Claim 11.5.7(2) again, so the
two 𝔼0 classes must be distinct in this case as well.
Finally, suppose that 𝑝 ∈ 𝑃 is a condition in the ground model. To amalgamate
the injection 𝜎 with 𝑝, consider the 𝑄-name for a map 𝜎𝑝 which takes the same values
as 𝑝 on the 𝐸-classes in dom(𝑝) and the same values as 𝜎 on the 𝐸-classes which do not
belong to dom(𝑝). It is not difficult to see that 𝜎𝑝 yields a balanced virtual condition
stronger than 𝑝 via Theorem 6.4.2. □
𝑋. Let 𝐻 be a finitary analytic hypergraph of uncountable Borel chromatic number.
(1) Let 𝑃 be the collapse poset of |𝐸| to |𝔼0 | as in Definition 6.4.1. In the 𝑃-extension
of the Solovay model, the chromatic number of 𝐻 is uncountable.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, |𝐸| ≤ |𝔼0 |,
yet the chromatic number of 𝐻 is uncountable.
11.4. Linked control

Certain independence results exploit the difference in arity of a given problem; typ-
ically, they require a countable coloring of a hypergraph of a higher arity while adding
no such coloring for hypergraphs of lower arity. This section shows how to preserve
the uncountable chromatic number of analytic graphs, while possibly adding a color-
ing for hypergraphs of arity 3 and higher. We need a brief preamble, elaborating on a
standard variation of centeredness in partial orders.
Definition 11.4.1. Let 𝑄 be a poset. A set 𝐴 ⊂ 𝑄 is linked if any two conditions
in 𝑄 are compatible.
Definition 11.4.2. Let 𝑅 be a Suslin forcing. We say that 𝑅 is Suslin-𝜎-linked if
there are linked analytic sets 𝐴𝑛 ⊂ 𝑅 for 𝑛 ∈ 𝜔 such that ⋃𝑛 𝐴𝑛 .
It is clear that every Suslin-𝜎-linked poset is c.c.c. since no linked set contains incom-
patible conditions. The following is a small variation on a standard finite support iter-
ation preservation theorem.
Proposition 11.4.3. Let 𝑅 be a Suslin-𝜎-linked poset and let 𝑄 be its finite support
iteration of length 𝜔1 . There is a parameter 𝑧 ∈ 2𝜔 such that 𝑄 is covered by sets each of
which is linked and definable from 𝑧 and an ordinal parameter.
Proof. Let 𝑅 = ⋃𝑛 𝐴𝑛 be a cover by analytic linked sets. Note that each of the
sets 𝐴𝑛 remains linked and 𝑅 = ⋃𝑛 𝐴𝑛 holds in every forcing extension by Shoenfield
absoluteness. Let 𝑧 ∈ 2𝜔 be a parameter defining 𝑅 and the cover. For each finite
partial function 𝑔 ∶ 𝜔1 → 𝜔 let 𝐵𝑔 = {𝑞 ∈ 𝑄 ∶ supp(𝑞) = dom(𝑔) and ∀𝛼 ∈ 𝑎 𝑞 ↾ 𝛼 ⊩
𝑞(𝛼) ∈ 𝐴𝑔(𝛼) }. In view of Claim 11.3.4 it is enough to show that each set 𝐵𝑔 is linked.
11.4. LINKED CONTROL 245
If 𝑞0 , 𝑞1 for 𝑖 ∈ 𝑛 are conditions in 𝐵𝑔 , by induction on the ordinal 𝛼 ∈ dom(𝑔)

find 𝑄 ↾ 𝛼-names 𝜂𝛼 for conditions in 𝑅 which are (forced to be) the lower bound of
𝑞0 (𝛼), 𝑞1 (𝛼). This is possible as the analytic set 𝐴𝑔(𝛼) ⊂ 𝑅 is linked. In the end, the
sequence ⟨𝜂𝛼 ∶ 𝛼 ∈ dom(𝑔)⟩ is a lower bound of the conditions 𝑞0 , 𝑞1 as required. □
Finally, we are ready to consider balanced posets.
Definition 11.4.4. Let 𝑃 be a Suslin forcing. We say that 𝑃 is balanced with linked
control if for every condition 𝑝 ∈ 𝑃 there is a parameter 𝑧 ∈ 2𝜔 and a pair ⟨𝑄, 𝜎⟩
definable from parameter 𝑧 such that
(3) 𝑄 is covered by sets each of which is linked and definable from 𝑧 and an or-
dinal parameter.
Theorem 11.4.5. Let Γ be an analytic graph of uncountable Borel chromatic num-
ber. In generic extensions of the symmetric Solovay model by balanced posets with linked
control, Γ has uncountable chromatic number.
enough to consider the case of Γ = 𝔾0 . Let ⟨𝑎𝑛 , 𝐻𝑛 , 𝑡𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a sequence such
that for each 𝑛 ∈ 𝜔, 𝑎𝑛 = 𝐻𝑛 = 2 and Γ = ∏𝑛 𝐻𝑛 , 𝑡𝑛 . Write 𝑋 = ∏𝑛 𝑎𝑛 ; the set 𝑋 is
equipped with the usual compact Polish topology.
from 𝑋 to 𝜔. We must find a Γ-edge 𝑒 ∈ Γ and a condition stronger than 𝑝 which forces
𝑒 to be monochromatic in 𝜏.
𝑉[𝐾0 ][𝐾1 ].
̇
iteration 𝑃𝑋 ∗ 𝑄 and 𝑚 ∈ 𝜔 be a number such that ⟨𝑠, 𝑞⟩̇ ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜏(𝑥𝑔𝑒𝑛 ̇ )=
𝑚.̌ Use the linkedness assumptions on the poset 𝑄 and strengthen the condition 𝑠 if
necessary to find a specific definition for a linked set 𝐶 ⊂ 𝑄 such that 𝑠 ⊩ 𝑞 ̇ ∈ 𝐶.
Strengthening the condition 𝑠 further if necessary, we may assume that 𝑠 = 𝑡𝑛 for some
𝑉[𝐾0 ][𝐾1 ][𝑥]. For each index 𝑖 ∈ 2, let 𝑥𝑖 be the function obtained from 𝑥 by replacing
𝑉[𝐾0 ][𝐾1 ][𝑥]. Observe that the evaluation of the definition of 𝑄 and the centered set
𝐶 does not depend on 𝑥 or any 𝑥𝑖 for 𝑖 ∈ 2.
The conditions 𝑞𝑖 = 𝑞/𝑥̇ 𝑖 for 𝑖 ∈ 2 both belong to the linked set 𝐶, and thus have
a common lower bound. Let 𝐺 ⊂ 𝑄 be a filter containing this common lower bound
and work in the model 𝑉[𝐾0 ][𝐾1 ][𝑥][𝐺]. Let 𝑝 ̄ be the balanced virtual condition 𝜎/𝐺.
By the forcing theorem applied with 𝑥𝑖 and 𝐺, we conclude that Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩
𝜏(𝑥0̌ ) = 𝜏(𝑥1̌ ) = 𝑚.̌ By the forcing theorem, in the model 𝑊, 𝑝 ̄ ⊩ {𝑥0̌ , 𝑥1̌ } is a 𝜏-
monochromatic edge in the graph Γ. This completes the proof. □
Our first example is motivated by a result of Marks and Unger [79] which found
perfect matchings with the Baire property in many Borel bipartite graphs. In order to
do this, they isolated the following strengthening of the well-known Hall’s condition
of [43]. Recall that Hall’s condition on a Borel bipartite graph 𝐺 demands every finite
set 𝑎 of vertices on any side of the bipartition to have at least |𝑎| many neighbors in the
graph; Hall’s theorem says that for every bipartite graph, Hall’s condition is equivalent
to the existence of a perfect matching. The Marks–Unger condition makes the search
for perfect matchings somewhat easier.
Definition 11.4.6. Let 𝐺 be a locally finite bipartite Borel graph on a Polish space
𝑋. We say that 𝐺 satisfies the Marks–Unger condition if there is a real number 𝜀 > 0
such that for every finite set 𝑎 ⊂ 𝑋 on one side of the bipartition, the number of 𝐺-
neighbors of 𝑎 is at least (1 + 𝜀)|𝑎|.
Example 11.4.7. Let 𝐺 be a locally finite bipartite Borel graph on a Polish space 𝑋
satisfying the Marks–Unger condition. Let 𝐸 be the 𝐺-path-connectedness equivalence
relation on 𝑋. Let 𝑃 be the poset of all countable functions assigning to each 𝐸-class
in the domain a 𝐺-perfect matching on it, ordered by reverse inclusion. Then 𝑃 has
linked control.
Proof. The word matching in this proof always refers to 𝐺-matching. Recall that
the balanced virtual conditions of 𝑃 are classified by total functions on the 𝐸-quotient
space which to each 𝐸-class assign a perfect matching on it by Example 6.4.8. Thus, we
strive to produce a definably linked poset which adds such a function via a definable
name.
In the regularity stage of the proof, consider the poset 𝑅 of all finite 𝐺-matchings
which can be extended to a perfect matching, ordered by reverse inclusion. Let 𝜏 be
the 𝑅-name for the union of the generic filter.
Claim 11.4.8.
(1) 𝑅 is a Suslin, Suslin-𝜎-linked poset;
(2) 𝑅 forces 𝜏 to be a perfect matching on the set of ground model points of 𝑋.
Proof. The second item is proved by a straightforward density argument. For the
first item, we start with the Suslinity of 𝑅. For a condition 𝑟 ∈ 𝑅, write 𝑣𝑟 ⊂ 𝑋 for the
set of all points 𝑥 ∈ 𝑋 which appear in one of the edges in 𝑟. It is clear that a finite
set 𝑟 ⊂ 𝐺 belongs to 𝑅 if it is a matching, and it can be extended to a perfect matching
on [𝑣𝑟 ]𝐸 . By Hall’s theorem [43], this is equivalent to the statement that 𝐺 restricted
to [𝑣𝑟 ]𝐸 ⧵ 𝑣𝑟 satisfies Hall’s condition, which is a Borel statement. Clearly, conditions
𝑟0 , 𝑟1 ∈ 𝑅 are compatible just in case 𝑟0 ∪ 𝑟1 ∈ 𝑅, which is a Borel statement again.
For the Suslin-𝜎-linked property, fix a rational number 𝜀 > 0 witnessing the Marks–
Unger property of the graph 𝐺. For a condition 𝑟 ∈ 𝑅 say that a pair ⟨𝑜, 𝑔⟩ is a descriptor
if 𝑜 is a finite collection of pairwise disjoint basic open subsets of 𝑋, every element of
𝑣𝑟 belongs to exactly one element of 𝑜, each element of 𝑜 contains exactly one ele-
ment of 𝑣𝑟 , and writing 𝑛𝑟 = |𝑣𝑟 |, for every point 𝑥 ∈ 𝑋 which is within 𝐺-distance
max{2, 4𝑛𝑟 𝜀−1 } of some point in 𝑣𝑟 in the graph 𝐺, either 𝑥 ∈ 𝑣𝑟 or 𝑥 ∉ ⋃ 𝑜. In addi-
tion, 𝑔 is a graph on 𝑜 connecting open sets 𝑂0 , 𝑂1 ∈ 𝑜 if the unique points 𝑥0 ∈ 𝑂0 ∩ 𝑣𝑟
and 𝑥1 ∈ 𝑂1 ∩ 𝑣𝑟 are connected in 𝑟.
It is clear that there are only countably many available descriptors, every condition
in 𝑟 has a descriptor by the local finiteness assumption on the graph 𝐺, and for each
pair ⟨𝑜, 𝑔⟩ the set 𝐴𝑜,𝑔 = {𝑟 ∈ 𝑅 ∶ ⟨𝑜, 𝑔⟩ is a descriptor of 𝑟} is Borel. We must show that
the set 𝐴𝑜,𝑔 ⊂ 𝑅 is linked.
Let 𝑟0 , 𝑟1 ∈ 𝐴𝑜,𝑔 be arbitrary conditions and write 𝑣0 = 𝑣𝑟0 , 𝑣1 = 𝑣𝑟1 , 𝑛 = |𝑣0 | = |𝑣1 |.
It is immediate that 𝑟0 ∪ 𝑟1 is a matching. To show that 𝑟0 ∪ 𝑟1 ∈ 𝑅, we must verify that
the graph 𝐺 restricted to 𝑋 ⧵ (𝑣0 ∪ 𝑣1 ) has a perfect matching. To verify Hall’s condition,
let 𝑎 ⊂ [𝑣0 ∪ 𝑣1 ]𝐸 ⧵ (𝑣0 ∪ 𝑣1 ) be a finite set on one side of the bipartition of the graph
𝐺; we must show that the set of neighbors of 𝑎 which are not in 𝑣0 ∪ 𝑣1 has size at least
|𝑎|.
Case 1. There are vertices 𝑥0 ∈ 𝑣0 ⧵ 𝑣1 and 𝑥1 ∈ 𝑣1 ⧵ 𝑣0 and a 𝐺 2 -path from 𝑥0 to
𝑥1 consisting of points in 𝑎. The path has to contain at least 2𝑛𝜀−1 many points by the
definition of a descriptor; thus, |𝑎| > 2𝑛𝜀−1 holds. By the Marks–Unger property on
the graph 𝐺 the set of neighbors of 𝑎 has size at least (1 + 𝜀)|𝑎| of which at most 2𝑛
many belong to 𝑣0 ∪ 𝑣1 . As a result, the set 𝑎 has at least (1 + 𝜀)|𝑎| − 𝜀|𝑎| = |𝑎| many
neighbors which do not belong to 𝑣0 ∪ 𝑣1 .
Case 2. Case 1 fails. Then one can find a partition 𝑎 = 𝑎0 ∪ 𝑎1 such that no point in 𝑋
has a 𝐺-neighbor in 𝑎0 and a 𝐺-neighbor in 𝑎1 , and no point in 𝑣1 ⧵𝑣0 has a neighbor in
𝑎0 , and no vertex in 𝑣0 ⧵ 𝑣1 has a neighbor in 𝑎1 . Since 𝑟0 ∈ 𝑅 holds, 𝑎0 can be matched
without using the vertices in 𝑣0 since 𝑟0 ∈ 𝑅; the matching will use no vertices in 𝑣1 by
the choice of 𝑎0 . Similarly, 𝑎1 can be matched without using vertices in 𝑣0 ∪ 𝑣1 . The
two matchings do not clash by the first demand on the sets 𝑎0 and 𝑎1 , and together
they yield |𝑎|-many neighbors of the set 𝑎 which are not in 𝑣0 ∪ 𝑣1 . □
The amalgamation stage follows Example 11.3.7 verbatim, with a reference to Propo-
sition 11.3.3 replaced with Proposition 11.4.3. □
Corollary 11.4.9. Let 𝐺 be a locally finite Borel bipartite graph on a Polish space
𝑋 satisfying the Marks–Unger condition. Let 𝐻 be an analytic graph on a Polish space of
uncountable Borel chromatic number.
(1) Let 𝐸 be the 𝐺-path-connectedness equivalence relation on 𝑋. Let 𝑃 be the poset
of all countable functions assigning to each 𝐸-class in the domain a 𝐺-perfect
matching on it, ordered by reverse inclusion. In the 𝑃-extension of the Solovay
perfect 𝐺-matching, and the chromatic number of 𝐻 is uncountable.
Other partial orders have linked control because of redundancy of certain hyper-
graphs as in Definition 8.2.1. We include a couple of instructive examples.
Example 11.4.10. Let 𝐸 be a countable Borel equivalence relation on a Polish

space 𝑋. Let Γ ⊂ [𝑋]3 be a Borel hypergraph such that every hyperedge consists
of pairwise 𝐸-related elements, and for every two points 𝑥0 , 𝑥1 ∈ 𝑋 the set {𝑥2 ∈
𝑋 ∶ {𝑥0 , 𝑥1 , 𝑥2 } ∈ Γ} is finite. Let 𝑃 be the poset of countable functions on the 𝐸-
quotient space which assign to each 𝐸-class in the domain a total Γ-coloring with 𝜔-
colors on that class, ordered by reverse inclusion. The poset 𝑃 has linked control.
Proof. Recall that the balanced virtual conditions are classified by total functions
on the 𝐸-quotient space which to each 𝐸-class assign a total Γ-coloring on the class–
Example 6.4.8. Thus, we strive to produce a definably linked poset which adds such a
function via a definable name.
In the regularity stage of the proof, let 𝑅 be the poset of all finite Γ-colorings, or-
dered by reverse inclusion. Let 𝜏 be the 𝑅-name for the union of the generic filter on
𝑅.
Claim 11.4.11.
(2) 𝑅 forces 𝜏 to be a Γ-coloring on the set of ground model elements of 𝑋.
Proof. The second item is proved by a straightforward density argument. For the
first item, it is immediate that the poset 𝑅 is Suslin. For the Suslin 𝜎-linkedness, for
every condition 𝑟 ∈ 𝑅 say that a pair ⟨𝑜, 𝑓⟩ is a descriptor of 𝑟 if 𝑜 is a finite collection
of pairwise disjoint basic open subsets of 𝑋, every point in dom(𝑟) belongs to exactly
one set in 𝑜 and every open set in 𝑜 contains exactly one point in dom(𝑟), and whenever
𝑥0 , 𝑥1 ∈ dom(𝑟) are distinct points and 𝑥2 ∈ 𝑋 is a point such that {𝑥0 , 𝑥1 , 𝑥2 } ∈ Γ, then
either 𝑥2 ∈ dom(𝑟) or else 𝑥2 ∉ ⋃ 𝑜. In addition, we require 𝑓(𝑂) = 𝑟(𝑥) whenever
𝑂 ∈ 𝑜 and 𝑥 is the unique point in dom(𝑟) ∩ 𝑂.
It is clear that there are only countably many available descriptors. The local finite-
ness assumption on the hypergraph Γ shows that each condition 𝑟 has at least one de-
scriptor. For each pair ⟨𝑜, 𝑓⟩ the set 𝐴𝑜,𝑓 = {𝑟 ∈ 𝑅 ∶ ⟨𝑜, 𝑓⟩ is a descriptor of 𝑟} is a Borel
subset of 𝑅. Thus, it will be enough to show that the set 𝐴𝑜,𝑓 is linked. Let 𝑟0 , 𝑟1 ∈ 𝐴𝑜,𝑓
be conditions. Clearly, 𝑟0 ∪ 𝑟1 is a function; we have to show that it is a Γ-coloring.
suppose that {𝑥0 , 𝑥1 , 𝑥2 } ∈ dom(𝑟0 ∪ 𝑟1 ) is a hyperedge. Two points of this hyperedge
must belong to the domain of one of the conditions; for definiteness, assume 𝑥0 , 𝑥1 ∈
dom(𝑟0 ). Since ⟨𝑜, 𝑓⟩ is a descriptor of 𝑟0 , it follows that 𝑥2 ∈ dom(𝑟0 ) or 𝑥2 ∉ ⋃ 𝑜. In
the former case, 𝑟0 ↾ {𝑥0 , 𝑥1 , 𝑥2 } is not constant as 𝑟0 ∈ 𝑅, so 𝑟0 ∪ 𝑟1 ↾ {𝑥0 , 𝑥1 , 𝑥2 } is not
constant as desired. The latter case is impossible as then 𝑥2 ∉ dom(𝑟0 ∪ 𝑟1 ) ⊂ ⋃ 𝑜. The
proof is complete. □
The amalgamation stage follows Example 11.3.7 verbatim, with a reference to Propo-
sition 11.3.3 replaced with Proposition 11.4.3. □
Corollary 11.4.12. Let ℤ act in a Borel free way on a Polish space 𝑋 and let Γ be
the hypergraph containing a triple {𝑥0 , 𝑥1 , 𝑥2 } if there is 𝑛 ∈ ℤ such that 𝑛 ⋅ 𝑥0 = 𝑥1 and
𝑛 ⋅ 𝑥1 = 𝑥2 . Let 𝐻 be an analytic graph of uncountable Borel chromatic number.
(1) Let 𝑃 be the poset of countable functions choosing a Γ-coloring on each orbit,
ordered by reverse extension. In the 𝑃-extension of the Solovay model, the chro-
matic number of 𝐻 is uncountable;
(2) it is consistent relative to an inaccessible cardinal that ZF+DC holds and the
chromatic number of Γ is countable while the chromatic number of 𝐻 is un-
countable.
The assumption that Γ be a locally countable hypergraph appears necessary in the pre-
vious example. Without it, the difficulties in the amalgamation stage (as in the end
of the proof of Example 11.3.7) appear unsurmountable. To prove a theorem about
non-locally countable hypergraphs, we need to increase the redundancy of Γ as in the
following example.
Example 11.4.13. Let Γ ⊂ [𝑋]4 be a Borel hypergraph on a Polish space 𝑋 such
that for every two points 𝑥0 , 𝑥1 ∈ 𝑋, the set of all hyperedges containing both 𝑥0 and 𝑥1
is finite. Let 𝑃 be the coloring poset of Definition 8.2.3. The poset 𝑃 has linked control.
Proof. Recall that the balanced virtual conditions are classified by total Γ-
colorings from 𝑋 to 𝜔–Theorem 8.2.4 Thus, we strive to produce a definably linked
poset which adds such a coloring via a definable name.
In the regularity stage of the proof, let Δ ⊂ [𝑋]3 be the hypergraph on 𝑋 of all
triples {𝑥0 , 𝑥1 , 𝑥2 } such that there is a point 𝑥3 ∈ 𝑋 with {𝑥0 , 𝑥1 , 𝑥2 , 𝑥3 } ∈ Γ. By the
Lusin–Novikov theorem [58, Theorem 18.10], Δ is indeed a Borel set. Let 𝑅 be the
poset of all finite Δ-colorings, ordered by reverse inclusion. Let 𝜏 be the 𝑅-name for the
union of the generic filter on 𝑅. The proof of the following claim follows Claim 11.4.11
verbatim.
Claim 11.4.14.
(2) 𝑅 forces 𝜏 to be a Δ-coloring on the set of ground model elements of 𝑋.
In the amalgamation stage of the proof, the extra redundancy of the hypergraph Γ
comes into play. Let 𝑄 be the finite support iteration of the poset 𝑅 of length 𝜔1 .
Claim 11.4.14 and Proposition 11.4.3 show that the poset 𝑄 is definably linked. For
each ordinal 𝛼 ∈ 𝜔1 let 𝜏𝛼 be the 𝑄-name for the function obtained by the 𝛼-th iterand
in 𝑄, and let 𝑀𝛼 be the 𝑄-name for the generic extension obtained by the first 𝛼-many
stages of the iteration. To amalgamate the maps 𝜏𝛼 for 𝛼 ∈ 𝜔1 , let 𝜎 be the 𝑄-name for
a map from 𝑋 to 𝜔 defined by 𝜎(𝑥) = 𝜏𝛼 (𝑥) where 𝛼 ∈ 𝜔1 is the smallest ordinal such
that 𝑥 ∈ 𝑀𝛼 . We first show that 𝜎 is a name for Γ-coloring.
In the 𝑄-extension, let 𝑒 ∈ Γ be a hyperedge. Let 𝛼 ∈ 𝜔1 be the smallest ordinal
such that 𝑒 ⊂ 𝑀𝛼 . By the redundancy assumption on the hypergraph Γ, it follows
that the set 𝑒 ∩ ⋃𝛽∈𝛼 𝑀𝛽 can have cardinality at most one. In other words, the set
𝑒 ∩ 𝑀𝛼 ⧵ ⋃𝛽∈𝛼 𝑀𝛽 has cardinality at least three and therefore contains a subset 𝑑 ⊂ 𝑒
such that 𝑑 ∈ Δ. Then 𝜎 ↾ 𝑑 = 𝜏𝛼 ↾ 𝑑, so 𝑑 and 𝑒 are not 𝜎-monochromatic.
As a final step in the proof, we have to show that the coloring 𝜎 can be amalgamated
with any given condition 𝑝 ∈ 𝑃 in the ground model. Indeed, define the (name for a)
map 𝜎𝑝 ∶ by setting 𝜎𝑝 (𝑥) equal to 𝑝(𝑥) if 𝑥 ∈ dom(𝑝) and 𝜎(𝑥) otherwise. It is not
difficult to use the redundancy of Γ as in the previous paragraph to show that 𝜎 is a
Γ-coloring extending 𝑝 as desired. □
Corollary 11.4.15. Let Γ be the hypergraph on ℝ2 consisting of vertices of squares.

Let 𝐻 be an analytic graph of uncountable Borel chromatic number.
(1) Let 𝑃 be the Γ-coloring poset as in Definition 8.2.3. In the 𝑃-extension of the
Solovay model, the chromatic number of 𝐻 is uncountable;
chromatic number of Γ is countable while the chromatic number of 𝐻 is un-
countable.
11.5. Measured control

In this section, we provide a way for preserving chromatic numbers of hypergraphs
which do not have Borel 𝜎-bounded fractional chromatic number. The method requires
a brief preamble dealing with a familiar feature of c.c.c. forcings.
Definition 11.5.1. Let 𝑄 be a poset and 𝐴 ⊂ 𝑄 be a set. We say that 𝐴 is measured

if there is a positive real number 𝜀 > 0 such that for every finite collection {𝑞𝑖 ∶ 𝑖 ∈ 𝑛}
(possibly listed with repetitions) of conditions in 𝐴, there is a set 𝑏 ⊂ 𝑛 such that |𝑏| ≥
𝜀𝑛 and the conditions 𝑞𝑖 for 𝑖 ∈ 𝑏 have a common lower bound.
Definition 11.5.2. Let 𝑅 be a Suslin forcing. We say that 𝑅 is Suslin-𝜎-measured

if 𝑅 = ⋃𝑛 𝐴𝑛 where each 𝐴𝑛 ⊂ 𝑅 is a measured analytic set.
In particular, every Suslin-𝜎-measured poset is c.c.c. as no measured set can contain

an infinite antichain. The following is a variation on a standard c.c.c. iteration preser-
vation theorem.
Proposition 11.5.3. Let 𝑅 be a Suslin-𝜎-measured poset and let 𝑄 be its finite sup-
port iteration of length 𝜔1 . There is a parameter 𝑧 ∈ 2𝜔 such that 𝑄 is covered by sets each
of which is measured and definable from 𝑧 and an ordinal parameter.
Proof. Let 𝑅 = ⋃𝑛 𝐴𝑛 be a cover by analytic measured sets. Let 𝑧 ∈ 2𝜔 be a

parameter defining 𝑅 and the cover. Note that each of the sets 𝐴𝑛 remains measured
(with the same witnessing real number) and 𝑅 = ⋃𝑛 𝐴𝑛 holds in every forcing ex-
tension by Shoenfield absoluteness. For each finite partial function 𝑔 ∶ 𝜔1 → 𝜔 let
𝐵𝑔 = {𝑞 ∈ 𝑄 ∶ dom(𝑞) = dom(𝑔) and ∀𝛼 ∈ 𝑎 𝑞 ↾ 𝛼 ⊩ 𝑞(𝛼) ∈ 𝐴𝑔(𝛼) }. In view of
Claim 11.3.4, it is enough to verify that each set 𝐵𝑔 is measured. To do this, for each
𝛼 ∈ dom(𝑔) let 𝜀𝛼 > 0 be a positive real number witnessing the measured property of
the set 𝐴𝑔(𝛼) . Let 𝜀 = ∏𝛼∈dom(𝑔) 𝜀𝛼 . It is straightforward to verify that the number 𝜀
witnesses the measured property of the set 𝐵𝑔 . □
Finally, we are ready to work on balanced partial orders.
Definition 11.5.4. Let 𝑃 be a Suslin forcing. We say that 𝑃 is balanced with mea-
sured control if for every condition 𝑝 ∈ 𝑃 there is a parameter 𝑧 ∈ 2𝜔 and a pair ⟨𝑄, 𝜎⟩
(3) 𝑄 is covered by sets each of which is measured and definable from 𝑧 and an
ordinal parameter.
11.5. MEASURED CONTROL 251
Theorem 11.5.5. Let Γ be a finitary analytic hypergraph which does not have Borel
𝜎-bounded fractional chromatic number. In generic extensions of the symmetric Solovay
model by balanced posets with measured control, Γ has uncountable chromatic number.

enough to consider the case of Γ which is a large measured skew product as in Def-
inition 11.1.21. Let ⟨𝑎𝑛 , 𝐻𝑛 , 𝑡𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a sequence such that 𝐻𝑛 is a hypegraph on
|𝑎 |
the finite set 𝑎𝑛 such that every 𝐻𝑛 -anticlique has fewer than 𝑛 elements, and write
𝑛+2
Γ = ∏𝑛 𝐻𝑛 , 𝑡𝑛 . Write 𝑋 = ∏𝑛 𝑎𝑛 ; the set 𝑋 is equipped with the usual compact Polish
topology.
with measured control below 𝜅. Let 𝑊 be a symmetric Solovay model derived from 𝜅
from 𝑋 to 𝜔. We must find a Γ-hyperedge 𝑒 ∈ Γ and a condition stronger than 𝑝 which
forces 𝑒 to be monochromatic in 𝜏.
be the filter obtained from 𝐻 by disregarding that coordinate, and work in the model
𝑉[𝐾0 ][𝐾1 ].
̇
iteration 𝑃𝑋 ∗ 𝑄 and 𝑚 ∈ 𝜔 be a number such that ⟨𝑠, 𝑞⟩̇ ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜏(𝑥𝑔𝑒𝑛 ̇ )=
𝑚.̌ Use the measured assumptions on the poset 𝑄 and strengthen the condition 𝑠 if
necessary to find a specific definition for a measured set 𝐶 ⊂ 𝑄 such that 𝑠 ⊩ 𝑞 ̇ ∈ 𝐶.
Strengthening the condition 𝑠 further if necessary, we may assume that it identifies a
rational number 𝜀 > 0 witnessing the measured property of the set 𝐶 and that 𝑠 = 𝑡𝑛
for some number 𝑛 ∈ 𝜔 with 𝜀(𝑛 + 2) > 1.
𝑉[𝐾0 ][𝐾1 ][𝑥]. Observe that the evaluation of the definition of 𝑄 and the measured set
𝐶 does not depend on 𝑥 or any 𝑥𝑖 for 𝑖 ∈ 𝑎𝑛 .
The conditions 𝑞𝑖 = 𝑞/𝑥 ̇ 𝑖 for 𝑖 ∈ 𝑎𝑛 all belong to the measured set 𝐶. Thus, there
|𝑎 |
is a set 𝑏 ⊂ 𝑎𝑛 of cardinality at least 𝜀|𝑎𝑛 | > 𝑛 such that the set {𝑞𝑖 ∶ 𝑖 ∈ 𝑏} has
𝑛+2
a lower bound in 𝑄. Let 𝐺 ⊂ 𝑄 be a filter containing this lower bound and work in
the model 𝑉[𝐾0 ][𝐾1 ][𝑥][𝐺]. By the initial assumptions on the hypergraph Γ, there is
a 𝐻𝑛 -hyperedge 𝑐 ⊂ 𝑏. Let 𝑝 ̄ be the balanced virtual condition 𝜎/𝐺. Let 𝑖 ∈ 𝑐 be
an arbitrary index. By the forcing theorem applied with 𝑥𝑖 and 𝐺, we conclude that
Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩ 𝜏(𝑥𝑖̌ ) = 𝑚.̌ By the forcing theorem, in the model 𝑊, 𝑝 ̄ ⊩ {𝑥𝑖̌ ∶ 𝑖 ∈
𝑐} is a 𝜏-monochromatic hyperedge in the hypergraph Γ. This completes the proof. □
Theorem 11.5.6. Let 𝐸 be a pinned Borel equivalence relation on a Polish space 𝑋.
The collapse poset 𝑃 of |𝐸| to |2𝜔 | of Definition 6.4.1 has measured control.
Proof. Recall that the balanced virtual conditions in the poset 𝑃 are classified by
injections from the 𝐸-quotient space to 2𝜔 by Theorem 6.4.2. Thus, we need to find a
definably measured poset adding such an injection via a definable name.
In the regularity stage of the proof, let 𝑅 be the poset of all finite functions 𝑟 such
that dom(𝑟) ⊂ 𝑋, rng(𝑟) ⊂ 2𝑛 for some number 𝑛 = 𝑛(𝑟) ∈ 𝜔, and for all 𝑥0 , 𝑥1 ∈
dom(𝑟), 𝑥0 𝐸 𝑥1 implies 𝑟(𝑥0 ) = 𝑟(𝑥1 ). The ordering is defined by 𝑠 ≤ 𝑟 if dom(𝑟) ⊂
dom(𝑠) and for all 𝑥 ∈ dom(𝑟), 𝑟(𝑥) ⊂ 𝑠(𝑥). Let 𝜏 be the coordinatewise union of the
generic filter.
Claim 11.5.7.
(1) 𝑅 is a Suslin, Suslin-measured poset.
(2) 𝑅 ⊩ 𝜏 ∶ 𝑋 ∩ 𝑉 → 2𝜔 ⧵ 𝑉 is a function such that for all 𝑥0 , 𝑥1 ∈ 𝑋 ∩ 𝑉,
𝑥0 𝐸 𝑥1 ↔ 𝜏(𝑥0 ) = 𝜏(𝑥1 ).
first item, it is immediate that 𝑅 is a Suslin forcing. To verify the Suslin-𝜎-measured
property of 𝑅, consider the function 𝑚 ∶ 𝑅 → (0, 1] defined by 𝑚(𝑟) = 2−𝑛𝑘 where 𝑛 ∈
𝜔 is such that rng(𝑟) ⊂ 2𝑛 , and 𝑘 ∈ 𝜔 is such that dom(𝑞) has nonempty intersection
with exactly 𝑘 many 𝐸-classes. For each positive rational number 𝜀 > 0 let 𝐴𝜀 = {𝑟 ∈
𝑅 ∶ 𝑚(𝑞) > 𝜀}. Since the sets 𝐴𝜀 ⊂ 𝑅 are all analytic and 𝑅 = ⋃𝜀 𝐴𝜀 , it is enough to
show, given 𝜀 > 0 and a finite sequence ⟨𝑟𝑖 ∶ 𝑖 ∈ 𝑗⟩ of elements of the set 𝐴𝜀 , there is
a set 𝑏 ⊂ 𝑗 of size greater than 𝜀𝑗 such that the conditions 𝑟𝑖 for 𝑖 ∈ 𝑏 have a common
lower bound.
To this end, let 𝑎 be the set of all 𝐸-classes with nonempty intersection with
⋃𝑖 dom(𝑟𝑖 ). Let 𝜇 be the usual probability measure on 2𝜔 and let 𝜆 be the product
measure on 𝑌 = (2𝜔 )𝑎 . Define the set 𝐵 ⊂ 𝑗 × 𝑌 as the set of all pairs ⟨𝑖, 𝑦⟩ such that
∀𝑥 ∈ dom(𝑟𝑖 ) 𝑟𝑖 (𝑥) ⊂ 𝑦([𝑥]𝐸 ). By the definition of the function 𝑚, the vertical sections
𝐵𝑖 have 𝜆-mass > 𝜀 each. By the Fubini theorem applied to the counting measure on 𝑗
and 𝜆, there must be a point 𝑦 ∈ 𝑌 such that the horizontal section 𝐵 𝑦 has size greater
than 𝜀𝑗. It is easy to check that the set {𝑟𝑖 ∶ 𝑖 ∈ 𝐵 𝑦 } has a common lower bound in 𝑅. □
For the amalgamation stage of the proof, let 𝑄 be the finite support iteration of the
poset 𝑅 of length 𝜔1 . Claim 11.5.7(1) and Proposition 11.5.3 show that the poset 𝑄 is
definably measured. For every ordinal 𝛼 ∈ 𝜔1 let 𝑀𝛼 be the 𝑄-name for the model
obtained after the initial segment of the iteration of length 𝛼, and let 𝜏𝛼 be the function
obtained from the 𝛼-th iterand. To amalgamate the maps 𝜏𝛼 for 𝛼 ∈ 𝜔1 , let 𝜎 be the 𝑄-
name for a map from the 𝐸-quotient space to 2𝜔 defined by 𝜎(𝑐) = 𝑦 if for the smallest
ordinal 𝛼 ∈ 𝜔1 such that 𝑀𝛼 contains some representative 𝑥 ∈ 𝑐, 𝜏𝛼 (𝑥) = 𝑦 holds. First
note that the choice of the representative 𝑥 ∈ 𝑀𝛼 is irrelevant by Claim 11.5.7(2), so the
map 𝜎 is well-defined. Second, the map 𝜎 is an injection. To see this, suppose that 𝑐0 , 𝑐1
11.5. MEASURED CONTROL 253
are distinct 𝐸-classes, and 𝛼0 , 𝛼1 ∈ 𝜔1 are the smallest ordinals such that 𝑐0 , 𝑐1 have
representatives 𝑥0 , 𝑥1 ∈ 𝑋 in the models 𝑀𝛼0 and 𝑀𝛼1 respectively. If 𝛼0 = 𝛼1 then
𝜏𝛼0 (𝑥0 ) ≠ 𝜏𝛼0 (𝑥1 ) by Claim 11.5.7(2). It follows that 𝜎(𝑐0 ) ≠ 𝜎(𝑐1 ) holds. If 𝛼0 ≠ 𝛼1
then note that 𝜎(𝑐0 ) ∈ 𝑀𝛼0 +1 ⧵ 𝑀𝛼0 and 𝜎(𝑐1 ) ∈ 𝑀𝛼1 +1 ⧵ 𝑀𝛼1 holds by Claim 11.5.7(2)
again, so the two binary sequences must be distinct in this case as well.
Finally, suppose that 𝑝 ∈ 𝑃 is a condition in the ground model. To amalgamate
the injection 𝜎 with 𝑝, consider the 𝑄-name for a map 𝜎𝑝 which takes the same values
as 𝑝 on the 𝐸-classes in dom(𝑝) and the same values as 𝜎 on the 𝐸-classes which do not
belong to dom(𝑝). It is not difficult to see that 𝜎𝑝 yields a balanced virtual condition
stronger than 𝑝 via Theorem 6.4.2. □
Corollary 11.5.8. Let 𝑃 be the collapse poset of 𝔼0 to 2𝜔 of Definition 6.4.1.

(1) In the 𝑃-extension of the Solovay model, the chromatic number of the diagonal
Hamming graph is uncountable;
(2) it is consistent relative to an inaccessible cardinal that ZF+DC holds and |𝔼0 | ≤
|2𝜔 |, yet the chromatic number of the diagonal Hamming graph is uncountable;
in particular, there is no 𝔼0 -transversal.
Note that the collapse does change some chromatic numbers to their lowest possible
value; for example, it forces the chromatic number of 𝔾0 to be equal to two, by Propo-
sition 11.1.6. The following example shows a somewhat more dramatic case of this
behavior, as the graph in question does not have Borel 𝜎-bounded chromatic number.
Example 11.5.9. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. Let 𝑄

be the poset of all pairs 𝑞 = ⟨𝑎𝑞 , 𝑏𝑞 ⟩ of finite subsets of 𝑋 such that (𝑎𝑞 × 𝑏𝑞 ) ∩ 𝐸 = 0;
the ordering is that of coordinatewise reverse inclusion. Let 𝐺 be the graph connecting
two conditions in 𝑄 if they are incompatible. Then in ZF, |𝐸| ≤ |2𝜔 | if and only if the
chromatic number of 𝐺 is countable.
Note that the graph 𝐺 does not have Borel 𝜎-bounded chromatic number as soon as the
equivalence relation 𝐸 is non-smooth as per Example 11.1.19. In particular, there is a
Borel graph which does not have Borel 𝜎-bounded chromatic number, yet the collapse
of |𝔼0 | to |2𝜔 | forces countable chromatic number to it.
Proof. For the left-to-right direction, let ℎ ∶ 𝑋 → 2𝜔 be a reduction of 𝐸 to the

identity on 2𝜔 . For every 𝑛 ∈ 𝜔 and every set 𝑐 ⊂ 2𝑛 let 𝐵𝑐 = {𝑞 ∈ 𝑄 ∶ ∀𝑥 ∈ 𝑎𝑞 ℎ(𝑥) ↾
𝑛 ∈ 𝑐 ∧ ∀𝑥 ∈ 𝑏𝑞 ℎ(𝑥) ↾ 𝑛 ∉ 𝑐}. Since the function ℎ is 𝐸-invariant, the sets 𝐵𝑐 ⊂ 𝑄 are
𝐺-anticliques. Now, if 𝑞 ∈ 𝑄 is a condition, there is 𝑛 ∈ 𝜔 such that for all 𝑥0 ∈ 𝑎𝑞 and
𝑥1 ∈ 𝑏𝑞 , ℎ(𝑥0 ) ↾ 𝑛 ≠ ℎ(𝑥1 ) ↾ 𝑛. Thus, writing 𝑐 = {ℎ(𝑥) ↾ 𝑛 ∶ 𝑥 ∈ 𝑎𝑞 }, we conclude
that 𝑞 ∈ 𝐵𝑐 . It follows that 𝑄 = ⋃𝑐 𝐵𝑐 is a cover of 𝑄 by countably many 𝐺-anticliques.
For the right-to-left direction, let 𝑄 = ⋃𝑛 𝐵𝑛 be a cover of 𝑄 by 𝐺-anticliques. For
each 𝑛 ∈ 𝜔, let 𝐴𝑛 = [⋃𝑞∈𝐵 𝑎𝑞 ]𝐸 and let ℎ ∶ 𝑋 → 2𝜔 be the function defined by
𝑛
ℎ(𝑥)(𝑛) = 0 if 𝑥 ∈ 𝐴𝑛 . We claim that this is a reduction of 𝐸 to the identity on 2𝜔 ,
thus inducing the desired inequality |𝐸| < |2𝜔 |. To see this, let 𝑥0 , 𝑥1 ∈ 𝑋 be arbitrary
points. If 𝑥0 𝐸 𝑥1 holds then ℎ(𝑥0 ) = ℎ(𝑥1 ) since the sets 𝐴𝑛 are 𝐸-invariant. On the
other hand, if 𝑥0 𝐸 𝑥1 fails, then 𝑞 = ⟨{𝑥0 }, {𝑥1 }⟩ is a condition in 𝑄 and there must
be 𝑛 such that 𝑞 ∈ 𝐵𝑛 . It is not difficult to see that then ℎ(𝑥0 )(𝑛) = 0 ≠ ℎ(𝑥1 )(𝑛), so
ℎ(𝑥0 ) ≠ ℎ(𝑥1 ). □
11.6. Ramsey control

In this section, we provide a way for preserving chromatic numbers of graphs
which do not have Borel 𝜎-bounded clique number. As in the previous sections, we
need a brief preamble dealing with a rather standard variation of centeredness for par-
tial orders, which should be compared to [99, Definition 3].
Definition 11.6.1. Let 𝑄 be a poset and 𝐴 ⊂ 𝑄 be a set. We say that 𝐴 is Ramsey
if for every 𝑚 ∈ 𝜔 there is 𝑛 ∈ 𝜔 such that for every collection {𝑞𝑖 ∶ 𝑖 ∈ 𝑛} (possibly
listed with repetitions) of conditions in 𝐴, there is a set 𝑏 ⊂ 𝑛 such that |𝑏| ≥ 𝑚 and
the conditions 𝑞𝑖 for 𝑖 ∈ 𝑏 have a common lower bound.
Definition 11.6.2. Let 𝑅 be a Suslin forcing. 𝑅 is Suslin-𝜎-Ramsey if there are
analytic sets 𝐴𝑛 for 𝑛 ∈ 𝜔 such that each 𝐴𝑛 is a Ramsey subset of 𝑅 and 𝑅 = ⋃𝑛 𝐴𝑛 .
In particular, a Suslin-𝜎-Ramsey poset must be c.c.c. as no Ramsey set contains an in-
finite antichain. We need a variation of a standard finite support iteration preservation
theorem.
Proposition 11.6.3. Let 𝑅 be a Suslin, Suslin-𝜎-Ramsey poset. Let 𝑄 be the finite
support iteration of 𝑅 of length 𝜔1 . Then there is 𝑧 ∈ 2𝜔 such that 𝑄 can be covered by
sets each of which is Ramsey and definable from 𝑧 and an ordinal parameter.
Proof. Let 𝑅 = ⋃𝑛 𝐴𝑛 be a cover of 𝑅 by countably many analytic Ramsey sets. A
straightforward Shoenfield absoluteness argument shows that every analytic Ramsey
piece 𝐴𝑛 as above remains Ramsey and 𝑅 = ⋃𝑛 𝐴𝑛 holds in every forcing extension.
In fact, whenever 𝑘, 𝑚 ∈ 𝜔 are numbers such that any set of 𝑚 many elements of 𝐴𝑛
contains a subset of cardinality 𝑘 with a common lower bound, then these numbers
keep the same property in every forcing extension.
Let 𝑄 be the finite support iteration of 𝑅 of length 𝜔1 . For each finite partial func-
tion 𝑔 ∶ 𝜔1 → 𝜔 let 𝐵𝑔 = {𝑞 ∈ 𝑄 ∶ dom(𝑞) = dom(𝑔) and ∀𝛼 ∈ 𝑎 𝑞 ↾ 𝛼 ⊩ 𝑞(𝛼) ∈ 𝐴𝑔(𝛼) }.
In view of Claim 11.3.4, it is enough to verify that each set 𝐵𝑔 is Ramsey. To see this,
let 𝑚 ∈ 𝜔 be given. By downward recursion on 𝛼 ∈ dom(𝑔) find natural numbers 𝑛𝛼
such that for every collection {𝑟𝑖 ∶ 𝑖 ∈ 𝑛𝛼 } of conditions in 𝐴𝑔(𝛼) there is a set 𝑏 ⊂ 𝑛𝛼
of size 𝑛𝛽 such that the collection {𝑟𝑖 ∶ 𝑖 ∈ 𝑏} has a common lower bound in 𝑅. Here,
𝛽 is either the first element of dom(𝑔) larger than 𝛼, or in case 𝛼 = max(dom(𝑔)) use
𝑚 instead of 𝑛𝛽 . Finally, let 𝑛 = 𝑛min(dom(𝑔)) . It is straightforward to verify that the
number 𝑛 witnesses the fact that the set 𝐵𝑔 is Ramsey for 𝑚. □
Finally, we are ready to work on balanced partial orders.
Definition 11.6.4. Let 𝑃 be a Suslin forcing. We say that 𝑃 is balanced with Ram-
sey control if for every condition 𝑝 ∈ 𝑃 there is a parameter 𝑧 ∈ 2𝜔 and a pair ⟨𝑄, 𝜎⟩
(3) 𝑄 is covered by sets each of which is Ramsey and definable from 𝑧 and an
ordinal parameter.
Theorem 11.6.5. Let Γ be a finitary analytic graph which does not have Borel 𝜎-
bounded clique number. In generic extensions of the symmetric Solovay model by bal-
anced posets with Ramsey control, Γ has uncountable chromatic number.
11.6. RAMSEY CONTROL 255

enough to consider the case of Γ which is a skew product of infinitely many cliques
as in Definition 11.1.1 (1). Let ⟨𝑎𝑛 , 𝐻𝑛 , 𝑡𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a sequence such that the sizes
of the finite sets grow to infinity, 𝐻𝑛 is a clique on 𝑎𝑛 , and Γ = ∏𝑛 𝐻𝑛 , 𝑡𝑛 . Write
𝑋 = ∏𝑛 𝑎𝑛 ; the set 𝑋 is equipped with the usual compact Polish topology.
𝑉[𝐾0 ][𝐾1 ].
necessary to find a specific definition for a Ramsey set 𝐶 ⊂ 𝑄 such that 𝑠 ⊩ 𝑞 ̇ ∈ 𝐶.
Strengthening the condition 𝑠 further if necessary, we may assume that it identifies
some number 𝑘 ∈ 𝜔 such that any collection of 𝑘 many elements in 𝐶 contains two
compatible conditions, and 𝑠 = 𝑡𝑛 for some number 𝑛 ∈ 𝜔 such that |𝑎𝑛 | ≥ 𝑘.
𝑉[𝐾0 ][𝐾1 ][𝑥]. Observe that the evaluation of the definition of 𝑄 and the Ramsey set 𝐶
does not depend on 𝑥 or any 𝑥𝑖 for 𝑖 ∈ 𝑎𝑛 .
The conditions 𝑞𝑖 = 𝑞/𝑥 ̇ 𝑖 for 𝑖 ∈ 𝑎𝑛 all belong to the Ramsey set 𝐶, and thus there
are distinct indices 𝑖, 𝑗 ∈ 𝑎𝑛 such that 𝑞𝑖 , 𝑞𝑗 have a common lower bound. Let 𝐺 ⊂ 𝑄
be a filter meeting this common lower bound and work in the model 𝑉[𝐾0 ][𝐾1 ][𝑥][𝐺].
Let 𝑝 ̄ be the balanced virtual condition 𝜎/𝐺. By the forcing theorem applied with 𝑥𝑖 and
𝐺, we conclude that Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩ 𝜏(𝑥𝑖̌ ) = 𝜏(𝑥𝑗̌ ) = 𝑚.̌ By the forcing theorem, in
the model 𝑊, 𝑝 ̄ ⊩ {𝑥𝑖̌ , 𝑥𝑗̌ } is a 𝜏-monochromatic edge in the graph Γ. This completes
the proof. □
Theorem 11.6.6. Let 𝑛 ≥ 2 be a number. Let Γ be a Borel graph on a Polish space

𝑋 containing no injective homomorphic image of 𝐾𝑛,𝑛 . Let 𝑃 be the coloring poset of Def-
inition 8.1.1. The poset 𝑃 is balanced with Ramsey control.
Proof. The balanced virtual conditions of 𝑃 are classified by total Γ-colorings by

Theorem 8.1.2. Thus, we must produce a definable poset 𝑄 which is covered by de-
finable Ramsey sets and adds (via a definable name 𝜎𝑝 ) a total Γ-coloring extending a
given condition 𝑝 ∈ 𝑃. As usual, the work is divided into two stages.
In the regularity stage, consider the poset 𝑅 of partial finite Γ-colorings 𝑟 ∶ 𝑋 → 𝜔,
ordered by reverse inclusion; also, let 𝜏 be the 𝑅-name for the union of the generic filter.
Claim 11.6.7.
(1) 𝑅 is a Suslin, Suslin-𝜎-Ramsey poset;
(2) 𝑅 forces 𝜏 to be a Γ-coloring with domain 𝑋 ∩ 𝑉.
first item, it is clear that 𝑅 is Suslin. To show that 𝑅 is Suslin-𝜎-Ramsey, for a number
𝑚 ∈ 𝜔 let 𝐴𝑚 = {𝑟 ∈ 𝑅 ∶ |dom(𝑟)| ≤ 𝑚 and rng(𝑟) ⊂ 𝑚}. Clearly, the sets 𝐴𝑚 are all
Borel and 𝑅 = ⋃𝑚 𝐴𝑚 . It will be enough to prove that each number 𝑚 ∈ 𝜔, the set
𝐴𝑚 ⊂ 𝑅 is Ramsey.
Let 𝑘 ∈ 𝜔 be an arbitrary number greater than both 2𝑛 and 𝑚. We have to find
𝑙 ∈ 𝜔 such that every set {𝑟𝑖 ∶ 𝑖 ∈ 𝑙} ⊂ 𝐴𝑚 contains a subset of size 𝑘 with a common
lower bound. We will show that any number 𝑙 such that 𝑙 → (𝑘)22𝑚2 +1 works. To see
this, let {𝑟𝑖 ∶ 𝑖 ∈ 𝑙} ⊂ 𝐴𝑚 be a set. Let ≺ be any linear ordering of the space 𝑋, for each
𝑖, 𝑢 ∈ 𝜔 write 𝑥𝑖ᵆ for the 𝑢-th element of dom(𝑟𝑖 ) in the ordering ≺ if it exists, and define
a partition 𝜋 ∶ [𝑙]2 → (𝑚 × 𝑚 × 2) ∪ {∞} by requiring the following. If 𝑖 ∈ 𝑗 ∈ 𝑙 and
𝜋(𝑖, 𝑗) = ⟨𝑢, 𝑣, 0⟩ then 𝑥𝑖ᵆ = 𝑥𝑗𝑣 and 𝑟𝑖 (𝑥𝑖ᵆ ) ≠ 𝑟𝑗 (𝑥𝑗𝑣 ); if 𝜋(𝑖, 𝑗) = ⟨𝑢, 𝑣, 1⟩ then 𝑥𝑖ᵆ Γ 𝑥𝑗𝑣
and 𝑟𝑖 (𝑥𝑖ᵆ ) = 𝑟𝑗 (𝑥𝑗𝑣 ); and if 𝜋(𝑖, 𝑗) = ∞ then no 𝑢, 𝑣 as in the previous items can be
found.
Use the Ramsey property of the number 𝑙 to find a set 𝑎 ⊂ 𝑙 of size 𝑘 which is homo-
geneous for the partition 𝜋. It is enough to argue that the set {𝑟𝑖 ∶ 𝑖 ∈ 𝑎} has a common
lower bound. To see this, inquire about the homogeneous partition value achieved. It
cannot be of the form ⟨𝑢, 𝑣, 0⟩ where 𝑢 ≠ 𝑣 because then there are irreconcilable candi-
dates for 𝑥𝑖ᵆ where 𝑖 is the second element of 𝑎. It cannot be of the form ⟨𝑢, 𝑣, 0⟩ where
𝑢 = 𝑣 because then the colors 𝑟𝑖 (𝑥𝑖ᵆ ) for 𝑖 ∈ 𝑎 must be all distinct while there are only 𝑚
colors available. The homogeneous partition value cannot be of the form ⟨𝑢, 𝑣, 1⟩ since
then the points 𝑥𝑖ᵆ where 𝑖 ranges over the first 𝑛 many elements of 𝑎, and 𝑥𝑗𝑣 where 𝑗
ranges over the second 𝑛-many elements of 𝑎, form an injective homomorphic copy of
𝐾𝑛,𝑛 in Γ, contradicting the initial assumptions on Γ. Thus, the homogeneous color is
∞, which precisely says that ⋃𝑖∈𝑎 𝑟𝑖 is a function which is a Γ-coloring and therefore a
common lower bound of the conditions 𝑟𝑖 for 𝑖 ∈ 𝑎. □
The amalgamation stage of the proof is more demanding than in the previous sec-
tions. Let 𝑄 be the finite support iteration of 𝑅 of length 𝜔1 . By Claim 11.6.7(1) and
Proposition 11.6.3, this is a definably Ramsey poset. For each countable ordinal 𝛼 ∈ 𝜔1 ,
let 𝑀𝛼 be the 𝑄-name for the model obtained after the first 𝛼-many stages of the iter-
ation and 𝜏𝛼 ∶ 𝑋 ∩ 𝑀𝛼 → 𝜔 be the name for the Γ-coloring obtained from the 𝛼-th
11.6. RAMSEY CONTROL 257
iterand. We need a claim:

Claim 11.6.8. For every ordinal 𝛼 ∈ 𝜔1 and every point 𝑥 ∈ 𝑀𝛼 ⧵ ⋃𝛽∈𝛼 𝑀𝛽 , the set
𝑎𝑥 = {𝑦 ∈ ⋃𝛽∈𝛼 𝑀𝛽 ∶ {𝑥, 𝑦} ∈ Γ} has cardinality smaller than 𝑛.
Proof. If this failed, there would be a specific ordinal 𝛽 such that the set 𝑏 = {𝑦 ∈
𝑀𝛽 ∶ {𝑥, 𝑦} ∈ Γ} has cardinality at least 𝑛. But then, the set 𝑐 = {𝑧 ∈ 𝑋 ∶ ∀𝑦 ∈ 𝑏 {𝑦, 𝑧} ∈
Γ} has size smaller than 𝑛 by the initial assumption on the graph Γ. The set 𝑐 ⊂ 𝑋 is
Borel with a code in 𝑀𝛽 , so all of its elements belong to 𝑀𝛽 by a Mostowski absoluteness
argument. However, 𝑥 ∈ 𝑐 holds, and this contradicts the initial assumptions on the
point 𝑥. □
The claim makes it possible to amalgamate the (names for) colorings 𝜏𝛼 for 𝛼 ∈ 𝜔1
to a total coloring. Let ⟨𝑎𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a recursive partition of 𝜔 into infinite sets.
Now, by transfinite recursion on 𝛼 define a (name for a) map 𝜎𝛼 ∶ 𝑀𝛼 → 𝜔 by setting
𝜎𝛼 (𝑥) = 𝜎𝛽 (𝑥) if 𝑥 ∈ 𝑀𝛽 for some 𝛽 ∈ 𝛼, and otherwise 𝜎𝛼 (𝑥) is the least number
𝑚 ∈ 𝑎𝜏𝛼 (𝑥) such that for no ordinal 𝛽 ∈ 𝛼 and no point 𝑦 ∈ 𝑀𝛽 Γ-connected to 𝑥
𝜎𝛽 (𝑦) = 𝑚 holds. This gives a correct definition of a map from 𝑋 to 𝜔 by Claim 11.6.8.
By induction on 𝛼 ∈ 𝜔1 it can be also proved that 𝜎𝛼 is a Γ-coloring: no monochromatic
edge can lead from a point in 𝑀𝛼 ⧵ ⋃𝛽∈𝛼 𝑀𝛽 to a point in ⋃𝛽∈𝛼 𝑀𝛽 by the definition
of the map 𝜎𝛼 . There is also no monochromatic edge between two points in the set
𝑀𝛼 ⧵ ⋃𝛽∈𝛼 𝑀𝛽 since 𝜏𝛼 is a Γ-coloring.
Thus, the map 𝜎 = ⋃𝛼 𝜎𝛼 is a total Γ-coloring definable from the sequence of
partial colorings 𝜏𝛼 for 𝛼 ∈ 𝜔1 . Finally, the coloring 𝜎 can be amalgamated with any
initial condition 𝑝 ∈ 𝑃 by a process similar to the previous paragraph, which we leave
to the patient reader. □
Example 11.6.9. Let 𝐷 ⊂ ℝ be a Borel set algebraically independent over ℚ, con-
sisting of positive reals. Let Γ be the graph on 𝑋 = ℝ2 connecting two points if their
Euclidean distance belongs to 𝐷. The graph Γ does not contain an injective homomor-
phic copy of 𝐾𝑛,𝑛 for some large number 𝑛 [66, Theorem 1].
An application of Theorems 11.6.5 and 11.6.6 now yields the following.
Corollary 11.6.10. Let 𝐷 ⊂ ℝ be a Borel set algebraically independent over ℚ,
consisting of positive reals. Let Γ be the graph on 𝑋 = ℝ2 connecting two points if their
Euclidean distance belongs to 𝐷.
(1) Let 𝑃 be the coloring poset of Definition 8.1.1. In the 𝑃-extension of the Solovay
model, the diagonal Hamming graph ℍ<𝜔 has uncountable chromatic number;
matic number of Γ is countable and the chromatic number of ℍ<𝜔 is uncount-
able.
Example 11.6.11. Let 𝑋 be a Polish group and 𝐶 ⊂ 𝑋 be a Borel set such that
there is a number 𝑚 ∈ 𝜔 such that any 𝑚 distinct points lie on at most one right shift
of the set 𝐶. (Think of a circle in ℝ2 passing through the origin and 𝑚 = 3.) Let Γ be
the graph on 𝑋 connecting points 𝑥, 𝑦 if 𝑥𝑦−1 ∈ 𝐶 or 𝑦𝑥−1 ∈ 𝐶. Let 𝑛 ∈ 𝜔 be a number
such that, in the Hungarian arrow notation, (𝑛) → (𝑚). Then Γ does not contain an
𝑛 𝑚
injective homomorphic copy of 𝐾𝑛,𝑛 .
A standard Baire category argument shows that the graph Γ has uncountable Borel
chromatic number just in case the set 𝐶 ⊂ 𝑋 accumulates around the unit element of
the group 𝑋.
Proof. Suppose towards a contradiction that 𝑎, 𝑏 ⊂ 𝑋 are disjoint finite sets of
size 𝑛 such that 𝑎 × 𝑏 ⊂ Γ. Let 𝑑 ⊂ 𝑎 × 𝑏 be the set of all pairs ⟨𝑥, 𝑦⟩ such that 𝑥𝑦−1 ∈ 𝐶.
By the Ramsey assumption on 𝑛, there are sets 𝑎′ ⊂ 𝑎 and 𝑏′ ⊂ 𝑏 of size 𝑚 such that
𝑎′ × 𝑏′ is either a subset of 𝑑 or disjoint from 𝑑. In the former case, all points of 𝑎′ lie
on the shift 𝐶 ⋅ 𝑦 for every 𝑦 ∈ 𝑏′ , and by the initial assumption on the set 𝐶 the set 𝑏′
must be a singleton. In the latter case, all points of 𝑏′ lie on the shift 𝐶 ⋅ 𝑥 for all 𝑥 ∈ 𝑎′ ,
and by the initial assumption on the set 𝐶 the set 𝑎′ must be a singleton. In both cases
we have reached a contradiction. □
Corollary 11.6.12. Let 𝐶 ⊂ ℝ2 be a circle passing through the origin. Let Γ be the
graph on ℝ2 connecting points 𝑥, 𝑦 if 𝑥 − 𝑦 ∈ 𝐶 or 𝑦 − 𝑥 ∈ 𝐶.
model, the diagonal Hamming graph ℍ<𝜔 has uncountable chromatic number;
matic number of Γ is countable and the chromatic number of ℍ<𝜔 is uncount-
able.
11.7. Liminf control

In this section, we provide a way for preserving chromatic numbers of graphs
which do not have Borel 𝜎-finite clique number. As usual, we need a brief preamble
dealing with a rather standard variation of centeredness. The variation in question has
been used in several contexts to guarantee that various posets do not add dominating
reals [1, 81]; we will use it for a different purpose.
Definition 11.7.1. Let 𝑄 be a poset and 𝐴 ⊂ 𝑄 be a set. We say that 𝐴 is liminf-
centered if for every collection {𝑞𝑖 ∶ 𝑖 ∈ 𝜔} (possibly listed with repetitions) of condi-
tions in 𝐴, there is a condition (a liminf-bound) 𝑞 ∈ 𝑄 such that each strengthening of
𝑞 is compatible with 𝑞𝑖 for infinitely many indices 𝑖 ∈ 𝜔.
Definition 11.7.2. Let 𝑅 be a Suslin forcing. We say that 𝑅 is Suslin-𝜎-liminf-
centered if 𝑅 = ⋃𝑛 𝐴𝑛 where each 𝐴𝑛 ⊂ 𝑅 is a liminf-centered analytic set.
In particular, every Suslin-𝜎-liminf-centered poset is c.c.c. since no liminf-centered
poset can contain an infinite antichain.
Proposition 11.7.3. Let 𝑅 be a Suslin-𝜎-liminf-centered poset and let 𝑄 be its finite
support iteration of length 𝜔1 . There is a parameter 𝑧 ∈ 2𝜔 such that 𝑄 is covered by sets
each of which is liminf-centered and definable from 𝑧 and an ordinal parameter.
Proof. Let 𝑅 = ⋃𝑛 𝐴𝑛 be a cover by analytic liminf-centered sets. We first show
that each of the sets 𝐴𝑛 remains liminf-centered and 𝑅 = ⋃𝑛 𝐴𝑛 holds in every forcing
extension; this is somewhat more slippery than in previous sections. First note that the
poset 𝑅 remains c.c.c. in all forcing extensions by [50]. Now, the statement that a given
analytic set 𝐴 ⊂ 𝑅 is liminf-centered is equivalent to the following: for every sequence
11.7. LIMINF CONTROL 259
⟨𝑟𝑖 ∶ 𝑖 ∈ 𝜔⟩ of conditions in 𝐴, the set of all conditions which are compatible with only
finitely many elements of the sequence is not predense. Provided that 𝑅 is c.c.c., this
translates to the following: for every sequence ⟨𝑟𝑖 ∶ 𝑖 ∈ 𝜔⟩ of conditions in 𝐴, for every
sequence ⟨𝑠𝑗 ∶ 𝑗 ∈ 𝜔⟩ of conditions in 𝑅 and every function 𝑓 ∈ 𝜔𝜔 either there are
𝑗 ∈ 𝜔 and 𝑖 > 𝑓(𝑗) such that 𝑠𝑗 , 𝑟𝑖 are compatible, or there is a condition 𝑠 ∈ 𝑅 which is
incompatible with conditions 𝑠𝑗 for all 𝑗 ∈ 𝜔. This is a 𝚷12 -statement. An application
of the Shoenfield absoluteness now shows that in every generic extension, each set 𝐴𝑛
for 𝑛 ∈ 𝜔 remains liminf-centered and 𝑅 = ⋃𝑛 𝐴𝑛 as desired.
Let 𝑄 be the finite support iteration of the poset 𝑅. For each finite partial function
𝑔 ∶ 𝜔1 → 𝜔, the set 𝐵𝑔 = {𝑞 ∈ 𝑄 ∶ supp(𝑞) = dom(𝑔) and for all 𝛼 ∈ supp(𝑞), 𝑞 ↾
𝛼 ⊩ 𝑞(𝛼) ∈ 𝐴𝑔(𝛼) } ⊂ 𝑄. In view of Claim 11.3.4, it is enough to verify that each set
𝐵𝑔 is liminf-centered. Let {𝑞𝑖 ∶ 𝑖 ∈ 𝜔} ⊂ 𝐵𝑔 be an infinite set. To find a liminf-bound,
by induction on the ordinal 𝛼 ∈ dom(𝑔) find 𝑄 ↾ 𝛼-names 𝜂𝛼 such that ⟨𝜂𝛽 ∶ 𝛽 ∈
𝛼 ∩ dom(𝑔)⟩ is in 𝑄 ↾ 𝛼 a liminf-bound of the conditions {𝑞𝑖 ↾ 𝛼 ∶ 𝑖 ∈ 𝜔}, so it forces
that the set 𝜒𝛼 = {𝑖 ∈ 𝜔 ∶ 𝑞𝑖 ↾ 𝛼 belongs to the generic filter} is infinite. Moreover,
we require that 𝜂𝛼 is forced to be a condition in 𝑅 which forces the set {𝑖 ∈ 𝜒𝛼 ∶ 𝑞𝑖 (𝛼)
belongs to the generic filter} to be infinite. This is possible as the analytic set 𝐴𝑔(𝛼) ⊂ 𝑅
is liminf-centered. In the end, the sequence ⟨𝜂𝛼 ∶ 𝛼 ∈ dom(𝑔)⟩ is a liminf-bound of the
conditions 𝑞𝑖 for 𝑖 ∈ 𝜔 as required. □
Finally, we are in a position to talk about balanced forcing.
Definition 11.7.4. Let 𝑃 be a Suslin forcing. We say that 𝑃 is balanced with liminf
control if for every condition 𝑝 ∈ 𝑃 there is a parameter 𝑧 ∈ 2𝜔 and a pair ⟨𝑄, 𝜎⟩
(3) 𝑄 is covered by sets each of which is liminf-centered and definable from 𝑧
and an ordinal parameter.
Theorem 11.7.5. Let Γ be a finitary analytic graph which does not have Borel 𝜎-
finite clique number. In generic extensions of the symmetric Solovay model by balanced
posets with liminf control, Γ has uncountable chromatic number.
enough to consider the case of Γ which is a skew product of infinite cliques. Let
⟨𝑎𝑛 , 𝐻𝑛 , 𝑡𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a sequence such that each set 𝑎𝑛 is countably infinite and 𝐻𝑛 is
a clique on 𝑎𝑛 , and write Γ = ∏𝑛 𝐻𝑛 , 𝑡𝑛 . Write 𝑋 = ∏𝑛 𝑎𝑛 ; the set 𝑋 is equipped with
the usual compact Polish topology.
with measured control below 𝜅. Let 𝑊 be a symmetric Solovay model derived from 𝜅
𝑉[𝐾0 ][𝐾1 ].
necessary to find a specific definition for a liminf-centered set 𝐶 ⊂ 𝑄 such that 𝑠 ⊩
𝑞 ̇ ∈ 𝐶. Strengthening the condition 𝑠 further if necessary, we may assume that 𝑠 = 𝑡𝑛
for some number 𝑛 ∈ 𝜔.
𝑉[𝐾0 ][𝐾1 ][𝑥]. For each index 𝑖 ∈ 𝑎𝑛 , let 𝑥𝑖 be the function obtained from 𝑥 by re-
placing its 𝑛-th entry with 𝑖. Thus, each 𝑥𝑖 ∈ 𝑋 is a point 𝑃𝑋 -generic over 𝑉[𝐾0 ][𝐾1 ]
and the model 𝑉[𝐾0 ][𝐾1 ][𝑥𝑖 ] is equal to 𝑉[𝐾0 ][𝐾1 ][𝑥]. Consider the poset 𝑄 in the
model 𝑉[𝐾0 ][𝐾1 ][𝑥]. Observe that the evaluation of the definition of 𝑄 and the liminf-
centered set 𝐶 does not depend on 𝑥 or any 𝑥𝑖 for 𝑖 ∈ 𝑎𝑛 .
The conditions 𝑞𝑖 = 𝑞/𝑥 ̇ 𝑖 for 𝑖 ∈ 𝑎𝑛 all belong to the liminf-centered set 𝐶. Thus,
there must be distinct indices 𝑖, 𝑗 ∈ 𝑎𝑛 such that the conditions 𝑞𝑖 , 𝑞𝑗 have a common
lower bound in 𝑄. Let 𝐺 ⊂ 𝑄 be a filter meeting this common lower bound and work
in the model 𝑉[𝐾0 ][𝐾1 ][𝑥][𝐺]. Let 𝑝 ̄ be the balanced virtual condition 𝜎/𝐺. Let 𝑖 ∈ 𝑐
be an arbitrary index. By the forcing theorem applied with 𝑥𝑖 and 𝐺, we conclude that
Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩ 𝜏(𝑥𝑖̌ ) = 𝜏(𝑥𝑗̌ ) = 𝑚.̌ By the forcing theorem, in the model 𝑊,
𝑝 ̄ ⊩ {𝑥𝑖̌ , 𝑥𝑗̌ } is a 𝜏-monochromatic edge in the graph Γ. This completes the proof. □
Theorem 11.7.6. Let 𝑛 ∈ 𝜔 be a number. Let Γ be a Borel graph on a Polish space
→
𝑋 containing no injective homomorphic image of either 𝐾𝜔,𝜔 or 𝐾𝑛,𝜔1 for some number
𝑛 ∈ 𝜔. Let 𝑃 be the coloring poset of Definition 8.1.1. The poset 𝑃 is balanced with liminf
control.
Proof. The balanced virtual conditions of 𝑃 are classified by total Γ-colorings by
Theorem 8.1.2. Thus, we must produce a definable poset 𝑄 which is covered by de-
finable Ramsey sets and adds (via a definable name 𝜎𝑝 ) a total Γ-coloring extending a
given condition 𝑝 ∈ 𝑃. As usual, the work is divided into two stages.
In the regularity stage, consider the poset 𝑅 of partial finite Γ-colorings 𝑟 ∶ 𝑋 → 𝜔,
ordered by reverse inclusion; also, let 𝜏 be the 𝑅-name for the union of the generic filter.
Claim 11.7.7.
(1) 𝑅 is a Suslin, Suslin-𝜎-liminf-centered poset;
(2) 𝑅 forces 𝜏 to be a Γ-coloring with domain 𝑋 ∩ 𝑉.
Proof. The second item follows from a straightforward genericity argument. For
the first item, it is easy to see that 𝑅 is a Suslin forcing. To show that 𝑅 is Suslin-𝜎-liminf-
centered, for each number 𝑛 ∈ 𝜔 let 𝐴𝑛 = {𝑟 ∈ 𝑅 ∶ |dom(𝑟)| < 𝑛 and rng(𝑟) ⊂ 𝑛}. It
11.7. LIMINF CONTROL 261
is clear that each set 𝐴𝑛 is Borel and 𝑅 = ⋃𝑛 𝐴𝑛 . Assume that one of the sets 𝐴𝑛 is
→
not liminf-centered and work to produce an injective homomorphism from 𝐾𝜔,𝜔 to Γ.
This will prove the claim.
Suppose that {𝑟𝑖 ∶ 𝑖 ∈ 𝜔} is a collection of conditions in 𝐴𝑛 without a liminf-bound.
Let 𝑟 ̄ ∈ 𝑅 be inclusion-maximal such that 𝑟 ̄ ⊂ 𝑟𝑖 holds for infinitely many 𝑖 ∈ 𝜔;
thinning out the original collection if necessary, we may assume that 𝑟 ̄ ⊂ 𝑟𝑖 holds for
all 𝑖 ∈ 𝜔. Thinning out even further, we may assume that the sets dom(𝑟𝑖 ⧵ 𝑟) for 𝑖 ∈ 𝜔
are pairwise disjoint.
By recursion on 𝑗 ∈ 𝜔 build conditions 𝑠𝑗 ∈ 𝑅 such that
• 𝑟 ̄ ⊂ 𝑠𝑗 ;
• for all 𝑥 ∈ ⋃𝑘∈𝑗 dom(𝑠𝑘 ⧵ 𝑟)̄ ∪ ⋃𝑘∈𝑗 dom(𝑟𝑘 ⧵ 𝑟), ̄ 𝑠𝑗 (𝑥) > 𝑛;
• for all but finitely many numbers 𝑖 ∈ 𝜔, 𝑠𝑗 ∪ 𝑟𝑖 ∉ 𝑅.
This is possible as the collection {𝑟𝑖 ∶ 𝑖 ∈ 𝜔} has no liminf-bound. Note that the first
and third item imply that for a given 𝑗 ∈ 𝜔, for all but finitely many numbers 𝑖 ∈ 𝜔
there are elements 𝑥 ∈ dom(𝑠𝑗 ) and 𝑦 ∈ dom(𝑟𝑖 ⧵ 𝑟)̄ such that 𝑥 Γ 𝑦 and 𝑠𝑗 (𝑥) = 𝑟𝑖 (𝑦)
both hold. In addition, the point 𝑥 ∈ 𝑋 cannot belong to ⋃𝑘∈𝑗 dom(𝑠𝑘 )∪⋃𝑘∈𝑗 dom(𝑟𝑘 )
by the second item.
Now, let ≺ be any linear ordering of the space 𝑋. For numbers 𝑗, 𝑚 write 𝑥(𝑗, 𝑚)
for the 𝑚-th element of dom(𝑠𝑗 ) ⧵ ⋃𝑘∈𝑗 dom(𝑠𝑘 ) ∪ ⋃𝑘∈𝑗 dom(𝑟𝑘 ) in the ordering ≺.
Similarly, write 𝑦(𝑖, 𝑚) for the 𝑚-th element of dom(𝑟𝑖 ) in the ordering ≺. Let 𝑈 be a
nonprincipal ultrafilter on 𝜔. For each 𝑗 ∈ 𝜔 there are numbers ℎ𝑗 , 𝑔𝑗 ∈ 𝜔 such that
the set 𝑎𝑗 = {𝑖 ∈ 𝜔 ∶ 𝑥(𝑗, ℎ𝑗 ) Γ 𝑦(𝑖, 𝑔𝑗 )} belongs to the ultrafilter 𝑈. Also, there exist a set
𝑑 ⊂ 𝜔 in 𝑈 and a number 𝑔 ∈ 𝜔 such that for all 𝑗 ∈ 𝑑, 𝑔𝑗 = 𝑔 holds. Now by recursion
on 𝑘 ∈ 𝜔 define an increasing sequence of numbers 𝑗𝑘 so that 𝑗𝑘 ∈ 𝑑∩⋂𝑙∈𝑘 𝑎𝑗𝑙 . Finally,
define the map 𝜋 ∶ 2 × 𝜔 → 𝑋 by 𝜋(0, 𝑘) = 𝑥(𝑗2𝑘 , ℎ𝑗2𝑘 ) and 𝜋(1, 𝑘) = 𝑦(𝑗2𝑘+1 , 𝑔). It is
not difficult to see that 𝜋 is an injective homomorphism of 𝐾𝜔,𝜔 →
to Γ. □
The amalgamation stage follows almost word by word the argument in Theorem 11.6.6.
□
Example 11.7.8. The graph ℍ<𝜔 does not contain an injective homomorphic copy
of 𝐾2,𝜔 , since for any point 𝑥, its ℍ<𝜔 -neighbors form a sequence converging to 𝑥; there-
fore, any two distinct points can have only finitely many common neighbors.
Corollary 11.7.9. Let Γ be the graph ℍ<𝜔 .
(1) Let 𝑃 be the coloring poset for Γ as in Definition 8.1.1. In the 𝑃-extension of the
Solovay model, the graph ℍ𝜔 has uncountable chromatic number. In particular,
there is no 𝔼0 -transversal;
chromatic number of ℍ<𝜔 is countable and the chromatic number of ℍ𝜔 is un-
countable.
Example 11.7.10. Let 𝑟 ⃗ be a sequence of positive real numbers converging to zero.
Let Γ be the graph on 𝑋 = ℝ2 connecting two points if their Euclidean distance is on
the sequence 𝑟.⃗ The graph Γ does not contain an injective homomorphic copy of 𝐾3,𝜔 :
if 𝑥0 , 𝑥1 ∈ 𝑋 are distinct points and 𝜀 > 0 is some real number, then there are only
finitely many points in the plane which are Γ-connected to both and of > 𝜀-distance
to both. Now, if 𝑥0 , 𝑥1 , 𝑥2 ∈ 𝑋 are distinct points and 𝜀 > 0 is smaller than half of the
minimum distance between two of the three, we see that every point of the plane is at
a distance > 𝜀 from two of the three, so there are only finitely many points Γ-connected
to all three.
Corollary 11.7.11. Let 𝑟 ⃗ be a sequence of positive real numbers converging to zero.
Let Γ be the graph on 𝑋 = ℝ2 connecting two points if their Euclidean distance is on the
sequence 𝑟.⃗
model, the graph ℍ𝜔 has uncountable chromatic number;
matic number of Γ is countable and the chromatic number of ℍ𝜔 is uncountable.
11.8. Compactly balanced posets

In this section we prove an additional preservation property of compactly balanced
posets of Definition 9.2.1 which concerns locally countable structures.
Definition 11.8.1. Let 𝐺 be an analytic finitary hypergraph on a Polish space 𝑋.
The hypergraph is actionable if there is a countable group Γ acting on 𝑋 such that all
hyperedges of 𝐺 consist of pairwise orbit-related elements and for every 𝛾 ∈ Γ, 𝛾⋅𝐺 = 𝐺.
The following theorem is stated using Convention 1.7.18. Recall that a finitary hyper-
graph is one all of whose hyperedges are finite.
Theorem 11.8.2. Let 𝐺 be an analytic, finitary, actionable hypergraph on a Polish
space 𝑋 which does not have Borel 𝜎-bounded chromatic number. Then in compactly
balanced extensions of the Solovay model, 𝐺 has uncountable chromatic number.
The actionable assumption is necessary, see Example 11.8.11. The main difference
between the general and actionable hypergraphs we exploit is the following routine
strengthening of Fact 11.1.13; instead of skew products we can deal with the usual
product.
Fact 11.8.3. Let 𝐺 be a finitary analytic actionable hypergraph on a Polish space 𝑋.
Exactly one of the following occurs:
(1) 𝐺 has Borel 𝜎-bounded chromatic number;
(2) there exist a large product 𝐻 on a Polish space 𝑌 and a continuous homomor-
phism ℎ ∶ 𝑌 → 𝑋 of 𝐻 to 𝐺.
Proof of Theorem 11.8.2. In view of Fact 11.8.3, it is enough to prove the theo-
rem for large product hypergraphs. Thus, let ⟨𝑎𝑛 , 𝐻𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a sequence such that
for every 𝑛 ∈ 𝜔, 𝐻𝑛 is a hypergraph on the finite set 𝑎𝑛 , and |𝑎𝑛 | ≥ 2 and the chromatic
number of 𝐻𝑛 is at least 𝑛, and assume that 𝐺 is in fact the product hypergraph ∏𝑛 𝐻𝑛
on the space 𝑌 = ∏𝑛 𝑎𝑛 . With a large product of this form, we associate the poset 𝑅
of all functions 𝑟 with domain 𝜔 such that for every 𝑛 ∈ 𝜔, 𝑟(𝑛) ⊂ 𝑎𝑛 is a nonempty set
and the chromatic numbers of 𝐻𝑛 on 𝑟(𝑛) are unbounded as 𝑛 tends to infinity. The
ordering on 𝑅 is that of coordinatewise inclusion. Clearly, the poset 𝑅 adds a point
11.8. COMPACTLY BALANCED POSETS 263
̇
𝑦𝑔𝑒𝑛 ∈ 𝑌 defined by 𝑦𝑔𝑒𝑛 ̇ (𝑛) is the only element of the set ⋂{𝑟(𝑛) ∶ 𝑟 belongs to the
generic filter}. The following claim is key.
Claim 11.8.4. The poset 𝑅 is proper, bounding, and adds no independent reals.
Proof. The first two assertions of the claim are standard and proved by the usual
fusion arguments. The last assertion is the heart of the present proof. Suppose that
𝑟 ∈ 𝑅 is a condition and 𝜏 is an 𝑅-name for a subset of 𝜔; we have to find a condition
𝑠 ≤ 𝑟 and an infinite set 𝑐 ⊂ 𝜔 such that 𝑠 ⊩ 𝑐 ̌ ⊂ 𝜏 or 𝑐 ̌ ∩ 𝜏 = 0. Strengthening the
condition 𝑟 if necessary, a standard fusion argument will yield a continuous function
𝑓 ∶ ∏𝑛 𝑟(𝑛) → 𝒫(𝜔) such that 𝑟 ⊩ 𝜏 = 𝑓(̇ 𝑦𝑔𝑒𝑛 ̇ ).
Now, let 𝐵 ⊂ ∏𝑛 𝑟(𝑛) × 𝜔 be the Borel set given by ⟨𝑦, 𝑛⟩ ∈ 𝐵 if 𝑛 ∈ 𝑓(𝑦) holds. For
each number 𝑛 ∈ 𝜔 define a function 𝜇𝑛 on 𝒫(𝑎𝑛 ) by letting 𝜇𝑛 (𝑏) be the chromatic
number of the hypergraph 𝐻𝑛 restricted to 𝑏. Thus, 𝜇𝑛 is a submeasure on 𝑎𝑛 and the
numbers 𝜇𝑛 (𝑎𝑛 ) tend to infinity. A partition result [97, Theorem 1.4] applied with an
infinite subsequence of the sets 𝑟(𝑛) and the submeasures 𝜇𝑛 shows that there exist a
condition 𝑠 ≤ 𝑟 and an infinite set 𝑐 ⊂ 𝜔 such that either ∏𝑛 𝑠(𝑛) × 𝑐 ⊂ 𝐵 or (∏𝑛 𝑠(𝑛) ×
𝑐) ∩ 𝐵 = 0. In the former case, 𝑠 ⊩ 𝑐 ̌ ⊂ 𝜏; in the latter case, 𝑠 ⊩ 𝑐 ̌ ∩ 𝜏 = 0. The claim
has just been proved. □
Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing which is compactly bal-
anced below 𝜅. Let 𝑊 be the Solovay model derived from 𝜅 and work in the model 𝑊.
Let 𝑝 ∈ 𝑃 be a condition and 𝜏 be a 𝑃-name such that 𝑝 ⊩ 𝜏 ∶ 𝑋 → 𝜔 is a function. We
must find a 𝐺-hyperedge and a condition stronger than 𝑝 which forces 𝜏 to be constant
on the hyperedge.
The condition 𝑝 ∈ 𝑃 as well as the name 𝜏 are definable in the model 𝑊 from
parameters in the ground model and a parameter 𝑧 ∈ 2𝜔 . Let 𝑉[𝐾] be an intermediate
forcing extension obtained by a poset of size < 𝜅, containing the point 𝑧. Work in 𝑉[𝐾]
and consider the poset 𝑄 × 𝑅 where 𝑄 is the poset of infinite subsets of 𝜔 ordered by
inclusion. Let 𝑈 ⊂ 𝑄 and 𝑦 ∈ 𝑌 be mutually generic filter objects for the product; so
𝑈 is in fact a nonprincipal ultrafilter on 𝜔 in the model 𝑉[𝐾][𝑈]. The poset 𝑄 is 𝜎-
closed, and therefore 𝑅 computed in the model 𝑉[𝐾][𝑈] is the same as 𝑅 computed in
the model 𝑉[𝐾] and 𝑦 is in fact 𝑅-generic over the model 𝑉[𝐾][𝑈]. By the continuous
reading of names for the poset 𝑅, the sets 𝒫(𝜔)∩𝑉[𝐾][𝑈][𝑦] and 𝒫(𝜔)∩𝑉[𝐾][𝑦] are the
same. By a mutual genericity argument and the fact that 𝑅 adds no independent reals,
𝑈 generates an ultrafilter on 𝜔 in the model 𝑉[𝐾][𝑈][𝑦]. Work in the model 𝑉[𝐾][𝑈].
Claim 11.8.5. There is an 𝑅-name 𝜎 for a balanced virtual condition in 𝑃 such that
̇ | < ℵ0 → 𝜎/𝑦𝑔𝑒𝑛
𝑅 ⊩ ∀𝑦 ∈ 𝑌 |𝑦Δ𝑦𝑔𝑒𝑛 ̇ = 𝜎/𝑦.
To parse the claim correctly, note that any point of the space 𝑌 which is up to finitely
̇ is in fact 𝑅-generic again and yields the same forcing exten-
many entries equal to 𝑦𝑔𝑒𝑛
sion. The claim therefore says that the evaluation of the name 𝜎 does not depend on
the specific generic point, but only on its modulo finite equivalence class.
Proof. Choose an arbitrary 𝑅-name 𝜒 for a balanced virtual condition below the
condition 𝑝. We now use the ultrafilter 𝑈 and the compact balance of the poset 𝑃 to
integrate the name 𝜒. Choose any point 𝑦𝜔 ∈ 𝑌 . For each 𝑛 ∈ 𝜔, let 𝑦𝑛̇ be the 𝑅-name
below 𝐶 for the element of 𝑌 such that 𝑦𝑛̇ ↾ 𝑛 = 𝑦𝜔 ↾ 𝑛 and 𝑦𝑛̇ ↾ [𝑛, 𝜔) = 𝑦𝑔𝑒𝑛
̇ ↾ [𝑛, 𝜔);
note that 𝑦𝑛̇ is forced to be a point 𝑅-generic over the model 𝑉[𝐾][𝑈], generating the
̇ . Let 𝜒𝑛 be the name for the balanced virtual condition 𝜒/𝑦𝑛̇ . Let
same model as 𝑦𝑔𝑒𝑛
𝜎 be the name for the 𝑈-limit of the sequence ⟨𝜒𝑛̇ ∶ 𝑛 ∈ 𝜔⟩ in the definable compact
Hausdorff topology on the space of all balance classes for 𝑃. It is immediate that the
name 𝜎 works as desired. □
Still working in the model 𝑉[𝐾][𝑈], find a name 𝜎 as in the claim. By a standard
balance argument (Proposition 5.2.4), 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 decides in 𝑃 the value of
̇ ). Passing to a condition 𝑟 if necessary, we may assume that there is a specific
𝜏(𝑦𝑔𝑒𝑛
number 𝑚 ∈ 𝜔 such that 𝑟 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜏(𝑦𝑔𝑒𝑛 ̇ ) = 𝑚.̌ Now, let 𝑦 ∈ 𝑌 be
a point 𝑅-generic over the model 𝑉[𝐾][𝑈], meeting the condition 𝑟 and let 𝑝 ̄ = 𝜎/𝑦.
Find a number 𝑛 ∈ 𝜔 such that the set 𝑟(𝑛) contains an 𝐻𝑛 -hyperedge 𝑏 ∈ 𝐻𝑛 and
for each 𝑖 ∈ 𝑏 let 𝑦𝑖 ∈ 𝑌 be the point obtained from 𝑦 by replacing the 𝑛-th entry of
𝑦 with 𝑖. Thus, the set {𝑦𝑖 ∶ 𝑖 ∈ 𝑏} is a 𝐺-hyperedge (this is exactly the point which
does not work if a skew product variation of 𝐺 is considered) and for each 𝑖 ∈ 𝑛 we
have 𝑝 ̄ = 𝜎/𝑦𝑖 by the choice of the name 𝜎. By the forcing theorem, in the model 𝑊
𝑝 ̄ ⊩𝑃 ∀𝑦 ∈ 𝑎𝑛 𝜏(𝑦) = 𝑚,̌ completing the proof. □
Corollary 11.8.6. Let 𝐺, 𝐻 be analytic locally countable hypergraphs on respective
Polish spaces 𝑋, 𝑌 such that 𝐺 has finite chromatic number 𝑛 ∈ 𝜔 and 𝐻 is actionable
and does not have Borel 𝜎-bounded chromatic number.
(1) Let 𝑃 be the coloring poset for 𝐺. In the 𝑃-extension of the symmetric Solovay
(2) Then it is consistent relative to an inaccessible cardinal that ZF+DC holds, 𝐺
has countable chromatic number, yet 𝐻 has uncountable chromatic number.
Proof. Balanced virtual conditions for 𝑃 are classified by total 𝐺-colorings whose
range is a subset of 𝑛. Such colorings naturally form a compact subset of the compact
Hausdorff space 𝑛𝑋 , therefore the poset 𝑃 is compactly balanced. As a result, in the 𝑃-
extension of the symmetric Solovay model, the chromatic number of 𝐻 is uncountable
by Theorem 11.8.2. At the same time, 𝑃 forces 𝐺 to have countable chromatic number.
□
Corollary 11.8.7. Let ℤ act freely and in a measure preserving Borel way on a
Polish probability space ⟨𝑋, 𝜇⟩. Let 𝐺 be the hypergraph of arity three on 𝑋 containing a
triple {𝑥0 , 𝑥1 , 𝑥2 } if there is a number 𝑛 ∈ 𝜔 such that 𝑛 ⋅ 𝑥0 = 𝑥1 and 𝑛 ⋅ 𝑥1 = 𝑥2 . Then
matic number of 𝔾0 is uncountable and the chromatic number of 𝐺 is countable;
(2) it is also consistent relative to an inaccessible cardinal that ZF+DC holds, the
chromatic number of 𝔾0 is two and the chromatic number of 𝐺 is uncountable.
Proof. For the first item, use Corollary 11.4.12. For the second item, use Exam-
ple 11.1.20 to show that the hypergraph 𝐺 does not have Borel 𝜎-bounded chromatic
number; it is clearly actionable. Let 𝒦 be the simplicial complex on 2𝜔 × 2 consisting
of partial finite functions from 2𝜔 to 2 which can be extended to a total 𝔾0 -coloring. It
is easy to see that the simplicial complex 𝒦 is Borel and locally countable. Then, apply
Theorem 11.8.2 to the poset 𝑃 = 𝑃𝒦 as in Definition 6.1.1(3). It follows easily from The-
orem 6.2.7 that the balanced virtual conditions for 𝑃 are classified by total 𝔾0 -colorings
with two colors, which naturally form a closed subset of the compact Hausdorff space
𝜔
22 . Thus the poset 𝑃 is compactly balanced. □
Corollary 11.8.8.
(1) Let 𝑃 be the poset of infinite subsets of 𝜔 ordered by inclusion. In the 𝑃-extension
of the Solovay model, the chromatic number of ℍ<𝜔 is uncountable.
(2) It is consistent relative to an inaccessible cardinal that there is a nonprincipal
ultrafilter on 𝜔 and the chromatic number of ℍ<𝜔 is uncountable.
This is immediate from the fact that the poset 𝑃 is compactly balanced–Example 9.2.4.
The corollary can be viewed as a commentary on a result of Rosendal [89]: in ZF+DC,
if there is a discontinuous homomorphism between Polish groups then the chromatic
numbers of the Hamming graphs ℍ𝑛 are finite. Since a nonprincipal ultrafilter on
𝜔 yields a discontinuous homomorphism from the Cantor group 2𝜔 to 2, this result
cannot be extended to the diagonal Hamming graph.
The following two corollaries use compactly balanced posets from Examples 9.2.11
and 9.2.13.
(1) Let 𝑃 be the linearization poset for the 𝐸-quotient space as in Example 8.7.5. In
the 𝑃-extension of the Solovay model, the chromatic number of ℍ<𝜔 is uncount-
able.
(2) It is consistent relative to an inaccessible cardinal that there is a linear ordering
on the 𝐸-quotient space and the chromatic number of ℍ<𝜔 is uncountable.
Corollary 11.8.10. Let 𝐺 be a locally finite Borel graph on a Polish space 𝑋 satis-
fying the Hall condition.
(1) Let 𝑃 be the poset adding a perfect matching for 𝐺 as in Example 6.2.9. In the
𝑃-extension of the Solovay model, the chromatic number of ℍ<𝜔 is uncountable.
(2) It is consistent relative to an inaccessible cardinal that 𝐺 has a perfect matching
and the chromatic number of ℍ<𝜔 is uncountable.
The following example presents a (necessarily) non-actionable hypergraph which does
not have Borel 𝜎-bounded chromatic number, yet it has countable chromatic number
in some compactly balanced extension of the Solovay model.
Example 11.8.11. The actionable assumption cannot be removed from the as-
sumptions of Theorem 11.8.2.
Proof. Let Γ be the free group on two generators ≫, 𝛿. It acts on the space 2Γ by
shift; that is, (𝛽 ⋅ 𝑥)(𝛼) = 𝑥(𝛽 −1 𝛼) holds for all 𝛽, 𝛼 ∈ Γ and 𝑥 ∈ 2Γ . Let 𝑋 ⊂ 2Γ be
the dense 𝐺𝛿 set on which the action is free. Let 𝐸0 be the Γ-orbit equivalence relation
on 𝑋. Let 𝐸1 be the orbit equivalence relation induced by the subgroup of Γ generated
by 𝛿. It is not difficult to see that 𝐸1 ⊂ 𝐸0 are Borel equivalence relations. Let 𝐺 be
the hypergraph on 𝑋 of arity three containing triples {𝑥0 , 𝑥1 , 𝑥2 } consisting of pairwise
𝐸0 -related points and containing two 𝐸1 -related and two 𝐸1 -unrelated points.
To see how a compactly balanced poset can make the chromatic number of 𝐺
countable, consider the Cayley graph 𝐻 on 𝑋: it connects points 𝑥0 , 𝑥1 if 𝑥1 =≫ ⋅𝑥0
(the ≫-edges of 𝐻) or 𝑥1 = 𝛿 ⋅ 𝑥0 (the 𝛿-edges of 𝐻) or vice versa. This is an acyclic 4-
regular graph whose connectedness components are exactly the 𝐸0 -classes. In ZFC, ev-
ery acyclic graph without vertices of degree 0 or 1 has an orientation in which every ver-
tex has out-degree one, constructed component by component. As in Example 9.2.15,
such an orientation can be added by a compactly balanced poset. The following claim
shows the impact of such an orientation on the hypergraph 𝐺:
Claim 11.8.12. (ZF) Suppose that the graph 𝐻 has an orientation in which every
vertex has out-degree one. Then the chromatic number of 𝐺 is countable.
Proof. Let 𝐻⃗ be the orientation. For each 𝑥 ∈ 𝑋 the color ℎ(𝑥) is the pair ⟨𝑏 =
𝑏(𝑥), 𝑘 = 𝑘(𝑥)⟩ such that 𝑘 is the largest possible number such that 𝐻⃗ contains an
oriented path from 𝑥 to 𝛿𝑐𝑘 ⋅ 𝑥 for some 𝑐 ∈ {−1, 1}. If 𝑘 = 0 then 𝑏 = 0, otherwise
𝑏 = 𝑐. If such 𝑘 does not exist, then the color ℎ(𝑥) is ∞. We claim that ℎ is a 𝐺-coloring.
To see this, first consider any two 𝐸0 -related points 𝑥0 , 𝑥1 ∈ 𝑋. In the 𝐻-path
between 𝑥0 , 𝑥1 no vertex gets an out-degree two, and that leaves only three cases: either
the whole path is oriented towards 𝑥0 , or towards 𝑥1 , or towards some point in the
middle. Now, if ℎ(𝑥0 ) = ℎ(𝑥1 ) = ∞ then all three cases show that all the edges on
the path must be 𝛿-edges, so 𝑥0 𝐸1 𝑥1 . Conversely, if 𝑥0 , 𝑥1 are 𝐸1 -related, say 𝑥0 =
𝛿𝑚 ⋅ 𝑥1 for some 𝑚 > 0, and ℎ(𝑥0 ) ≠ ∞, then in the first two cases 𝑘(𝑥0 ) ≠ 𝑘(𝑥1 )
and in the third case 𝑏(𝑥0 ) = 1 ≠ −1 = 𝑏(𝑥1 ). It follows that no 𝐺-hyperedge can
be monochromatic: the homogeneous color cannot be ∞ on account of the two 𝐸1 -
unrelated points in the hyperedge, and the homogeneous color cannot be different from
∞ on the account of the two 𝐸1 -related points in the hyperedge. □
Claim 11.8.13. The hypergraph 𝐺 does not have Borel 𝜎-bounded fractional chro-
matic number.
Proof. For a point 𝑥 ∈ 𝑋 and a number 𝑚 ∈ 𝜔, write 𝑎𝑥𝑚 = {𝛿𝑖𝑚 ≫𝑗𝑚 ⋅𝑥 ∶ 𝑖, 𝑗 ∈
𝑚}. Note that the set 𝑎𝑥𝑚 ⊂ 𝑋 is a subset of a single 𝐸0 -class and visits 𝑚 many distinct
𝐸1 -classes, each in 𝑚 many elements. A simple counting argument then shows that
every subset of 𝑎𝑥𝑚 of size 𝑚 + 1 contains a 𝐺-hyperedge, so the fractional chromatic
number of 𝐺 on the set 𝑎𝑥𝑚 is not smaller than 𝑚 as witnessed by the normalized
counting measure on 𝑎𝑥𝑚 .
Now, suppose that 𝑋 = ⋃𝑛 𝐵𝑛 is a partition into Borel sets. By the Baire category
theorem, there is a number 𝑛 ∈ 𝜔 such that 𝐵𝑛 is not meager. In view of the first
paragraph, to prove the claim it will be enough that for all but finitely many 𝑚 ∈ 𝜔
there is a point 𝑥 ∈ 𝑋 such that 𝑎𝑥𝑚 ⊂ 𝐵𝑛 . To this end, let 𝑡 ∶ Γ → 2 be a finite
partial function such that 𝐵𝑛 is comeager in [𝑡]. Let 𝑚 ∈ 𝜔 be larger than the length
of any word in dom(𝑡); we will find a point 𝑥 ∈ 𝑋 such that 𝑎𝑥𝑚 ⊂ 𝐵𝑛 . Let 𝑠 =
⋃{𝑡𝑖𝑗 ∶ 𝑖, 𝑗 ∈ 𝑚} where each 𝑡𝑖𝑗 ∶ Γ → 2 is the finite partial function given by the
demand 𝑡𝑖𝑗 (𝛽) = 𝑡(𝛿𝑖𝑚 ≫𝑗𝑚 𝛽) for all 𝛽 such that 𝛿𝑖𝑚 𝛾𝑗𝑚 𝛽 ∈ dom(𝑡). Note that for
distinct pairs ⟨𝑖, 𝑗⟩, ⟨𝑘, 𝑙⟩ ∈ 𝑚 × 𝑚 and any 𝛽 ∈ Γ at least one of 𝛿𝑖𝑚 𝛾𝑗𝑚 𝛽 and 𝛿𝑘𝑚 𝛾𝑙𝑚 𝛽
has length at least 𝑚. By the choice of the number 𝑚, 𝑠 ∶ Γ → 2 is a finite function.
The set 𝐶 = ⋂{≫−𝑗𝑚 𝛿−𝑖𝑚 𝐵𝑛 ∶ 𝑖, 𝑗 ∈ 𝑚} is comeager in [𝑠]; let 𝑥 ∈ 𝐶 be an arbitrary
point. Reviewing the definitions, it is clear that 𝑎𝑥𝑚 ⊂ 𝐵 as required. □
Now, consider the poset 𝑃 adding an orientation of 𝐻 in which every vertex in 𝑋
gets an out-degree one. A condition 𝑝 ∈ 𝑃 is an orientation on countably many com-
ponents of 𝐻 in which every vertex in these components gets an out-degree one. The
ordering is that of reverse inclusion. The poset 𝑃 was analyzed in Example 9.2.15. It is
not difficult to prove that the balanced virtual conditions of 𝑃 are classified by orienta-
tions of 𝐻 in which every vertex gets an out-degree one, which naturally form a compact
Hausdorff space. Thus, the poset 𝑃 is compactly balanced. It adds an 𝐻-coloring with
countably many colors by Claim 11.8.12, while the hypergraph 𝐻 does not have Borel
𝜎-bounded chomatic or even fractional chromatic number by Claim 11.8.12. □
CHAPTER 12
The Silver divide
12.1. Perfectly balanced forcing

The perfect set property in the model 𝐿(ℝ)[𝑈], where 𝑈 is a Ramsey ultrafilter,
was proved by [22]. In this section, we provide a general machinery for proving results
of this type. We start with two key definitions.
Definition 12.1.1. Let 𝑃 be a Suslin forcing. A virtual condition 𝑝 ̄ is perfectly
balanced if in every generic extension 𝑉[𝐺], whenever
(1) 𝑄 ∈ 𝑉 is a poset such that 𝒫(𝑄) ∩ 𝑉 is countable in 𝑉[𝐺];
(2) 𝜎 ∈ 𝑉 is a 𝑄-name for a condition in 𝑃 stronger than 𝑝;̄
(3) ℋ ⊂ 𝒫(𝑄) is a perfect set such that every finite set 𝑎 ⊂ ℋ is a set of filters
over 𝑄 mutually generic over 𝑉,
then there is a perfect set 𝐶 ⊂ ℋ such that the set of conditions {𝜎/𝐻 ∶ 𝐻 ∈ 𝐶} has
a lower bound in the separative quotient. A poset is perfectly balanced if below every
condition 𝑝 ∈ 𝑃 there is a perfectly balanced virtual condition.
This forcing property is often guaranteed by a simple feature which does not speak
about any balance issues at all.
Definition 12.1.2. A Suslin forcing 𝑃 is perfect if for every Borel function 𝑓 ∶ 2𝜔 →
𝑃, either there is a finite set 𝑎 ⊂ 2𝜔 such that the set 𝑓″ 𝑎 ⊂ 𝑃 has no lower bound, or
else there is a perfect set 𝐶 ⊂ 2𝜔 such that 𝑓″ 𝐶 has a lower bound in the separative
quotient of 𝑃.
In general, the separative quotient of Suslin forcings is a 𝚷12 ordering, making perfect-
ness a rather complicated projective property of the poset 𝑃. In all particular posets
considered in this book, the status of perfectness is absolute throughout all forcing ex-
tensions.
Proposition 12.1.3. Let 𝑃 be a Suslin forcing which is perfect in all forcing exten-
sions. Then every balanced virtual condition in 𝑃 is perfectly balanced.
Proof. Let 𝑝 ̄ be a balanced virtual condition in 𝑃. Let 𝑄 be a partial order, 𝜎 a
𝑄-name for a condition in 𝑃 stronger than 𝑝.̄ Let 𝑉[𝐺] be a generic extension such that
𝒫(𝑄) ∩ 𝑉 is countable in 𝑉[𝐺]. Let ℋ be a perfect set of filters on 𝑄 which consists of
filters in finite tuples mutually generic over 𝑉.
Claim 12.1.4. For every finite set 𝑎 ⊂ ℋ, the set {𝜎/𝐻 ∶ 𝐻 ∈ 𝑎} ⊂ 𝑃 has a common
lower bound.
Proof. Let ⟨𝐻𝑗 ∶ 𝑗 ∈ 𝑖⟩ enumerate the set 𝑎 without repetitions. By induction
on 𝑗 ∈ 𝑖, construct a descending sequence ⟨𝑟𝑗 ∶ 𝑗 ∈ 𝑖⟩ of conditions in 𝑃 such that
269
270 12. THE SILVER DIVIDE
for each 𝑗 ∈ 𝑖 𝑟𝑗 ∈ 𝑉[𝐾][𝐻𝑘 ∶ 𝑘 ∈ 𝑗 + 1] and 𝑟𝑗 ≤ 𝜎/𝐻𝑗 . This is easy to do using the

balance of the condition 𝑝 ̄ at every stage of the induction, noting that 𝜎/𝐻𝑗+1 , 𝑟𝑗 are both
strengthenings of 𝑝 ̄ in mutually generic extensions of the model 𝑉[𝐾]. In the end, the
condition 𝑟𝑖−1 is a lower bound of the set {𝜎/𝐻 ∶ 𝐻 ∈ 𝑎}. □
Now, let ℎ ∶ 2𝜔 → ℋ be a continuous injection and let 𝑓 ∶ 2𝜔 → 𝑃 be the continuous
function defined by 𝑓(𝑦) = 𝜎/ℎ(𝑦). Apply the perfectness of the poset 𝑃 to find a perfect
set 𝐶 such that for each 𝑦 ∈ 𝐶, 𝑟 ≤ 𝑓(𝑦) holds in the separative quotient. The condition
𝑟 witnesses the perfect balance of 𝑝 ̄ in this instance. □
We prove two notable dichotomy type preservation properties of perfectly balanced
posets.
Definition 12.1.5. The full Silver dichotomy is the following statement: If 𝐸 is a
Borel equivalence relation on a Polish space 𝑋 and 𝐴 ⊂ 𝑋 is an 𝐸-invariant set, then
either 𝐴 contains only countably many 𝐸-classes or 𝐴 contains a perfect set consisting
of pairwise 𝐸-unrelated elements.
As a consequence, the full Silver dichotomy implies that among all sets whose cardi-
nality is smaller than a Borel quotient space, 2𝜔 is the set with the smallest uncount-
able cardinality. The terminology refers to the classical Silver dichotomy [54, Theorem
5.7.1], a theorem of ZF+DC which says in particular that the dichotomy holds for an-
alytic sets 𝐴 ⊂ 𝑋. The Solovay model satisfies the full Silver dichotomy. The following
result is stated using Convention 1.7.18.
Theorem 12.1.6. In cofinally perfectly balanced extensions of the symmetric Solovay
model, the full Silver dichotomy holds.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a perfect Suslin forcing such
that 𝑉𝜅 ⊧ 𝑃 is balanced in every forcing extension. Let 𝑊 be a symmetric Solovay model
derived from 𝜅 and work in the model 𝑊. Let 𝑝 ∈ 𝑃 be a condition and 𝜏 be a 𝑃-name
such that 𝑝 ⊩ 𝜏 ⊂ 𝑋 is an 𝐸-invariant set containing uncountably many 𝐸-classes. The
condition 𝑝 as well as the name 𝜏 have to be definable from parameters in 𝑉 as well
as some parameter 𝑧 ∈ 2𝜔 . Use the assumptions to find an intermediate model 𝑉[𝐾]
obtained as a generic extension of 𝑉 by a poset of cardinality smaller than 𝜅 such that
𝑧 ∈ 𝑉[𝐾] and 𝑃 is perfectly balanced in 𝑉[𝐾].
Work in the model 𝑉[𝐾]. Find a perfectly balanced virtual condition 𝑝 ̄ ≤ 𝑝. Note
𝑉 [𝐾]
that the equivalence relation 𝐸 is Borel; by Theorem 2.5.6, it has fewer than ℶ𝜔1
𝑉 [𝐾]
many virtual classes. The cardinality ℶ𝜔1 is countable in the model 𝑊, while the set
𝜏 is forced to contain uncountably many 𝐸-classes. It follows that in the model 𝑉[𝐾]
there have to be a poset 𝑅 of cardinality smaller than 𝜅, an 𝑅-name 𝜎 for a condition
in 𝑃 stronger than 𝑝 ̄ and an 𝑅-name 𝜂 for an element of 𝑋 which is forced not to be a
realization of any virtual 𝐸-class in the model 𝑉[𝐾], and 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃
𝜂 ∈ 𝜏.
Move to some generic extension 𝑉[𝐾][𝐺] obtained by a poset of cardinality smaller
than 𝜅 such that 𝒫(𝑅) ∩ 𝑉[𝐾] is countable in 𝑉[𝐾][𝐺]. Work in 𝑉[𝐾][𝐺]. Use Propo-
sition 1.7.12 to find a perfect set ℋ of filters on 𝑅 which are in finite tuples mutually
generic over 𝑉[𝐾]. Note that by the mutual genericity and the initial choice of the name
𝜂, the points 𝜂/𝐻 for 𝐻 ∈ ℋ are pairwise 𝐸-unrelated. By the perfect balance of the
virtual condition 𝑝,̄ there is a perfect set 𝐶 ⊂ ℋ such that the set {𝜎/𝐻 ∶ 𝐻 ∈ 𝐶} has a
12.1. PERFECTLY BALANCED FORCING 271
lower bound, say 𝑞 ∈ 𝑃 in the separative quotient of 𝑃. By the forcing theorem applied
in every model 𝑉[𝐾][𝐻] for 𝐻 ∈ 𝐶 it is the case that in the model 𝑊, the condition 𝑞
forces the perfect set {𝜂/𝐻 ∶ 𝐻 ∈ 𝐶} consisting of pairwise 𝐸-unrelated elements to be
a subset of 𝜏. The proof is complete. □
The second preservation theorem of this section deals with a strong form of well-known
Todorcevic’s Open Coloring Axiom, OCA [104].
Definition 12.1.7. OCA+ is the following statement. Whenever 𝑋 is a Polish
space, 𝐴 ⊂ 𝑋 is a set, and Γ is a graph on 𝐴 which is open in the topology on 𝐴 × 𝐴
inherited from 𝑋 × 𝑋, then either 𝐴 is a union of countably many Γ-anticliques, or 𝐴
contains a perfect Γ-clique.
The following result is stated using Convention 1.7.18.
Theorem 12.1.8. In cofinally perfectly balanced extensions of the symmetric Solovay
model, OCA+ holds.
Proof. Let 𝑋 be a Polish space and let 𝑃 be a perfect Suslin forcing. Let 𝜅 be an
inaccessible cardinal such that 𝑃 is cofinally perfectly balanced below 𝜅. Let 𝑊 be a
symmetric Solovay model derived from 𝜅. In the model 𝑊, let Γ ⊂ 𝑋 2 be a symmetric
open set, let 𝑝 ∈ 𝑃 be a condition, and let 𝜏 be a 𝑃-name for a subset of 𝑋 such that
𝑝 ⊩ 𝜏 cannot be covered by countably many Γ-anticliques. We must find a perfect set
𝐵 ⊂ 𝑋 such that any two points of 𝐵 are Γ-related, and a condition 𝑞 ≤ 𝑝 in 𝑃 which
forces 𝐵̌ ⊂ 𝜏.
To this end, choose a parameter 𝑧 ∈ 2𝜔 such that 𝑝, 𝜏, Γ are definable from 𝑧. Find
an intermediate generic extension 𝑉[𝐾] of 𝑉 by a poset of cardinality smaller than 𝜅
such that 𝑧 ∈ 𝑉[𝐾] and 𝑃 is perfectly balanced in 𝑉[𝐾]. Work in the model 𝑉[𝐾]. Let
𝑝 ̄ ≤ 𝑝 be a perfectly balanced virtual condition in 𝑃. Since Coll(𝜔, < 𝜅) ⊩ 𝑝 ⊩𝑃 𝜏 is
not covered by countably many Γ-anticliques, and the closure of a Γ-anticlique is still a
Γ-anticlique, there must be a poset 𝑅 of cardinality smaller than 𝜅, an 𝑅-name 𝜂 for an
element of 𝑋 which belongs to no closed Γ-anticlique coded in 𝑉[𝐾], and an 𝑅-name 𝜎
for a condition in 𝑃 stronger than 𝑝 ̄ such that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜂 ∈ 𝜏.
Let 𝑉[𝐾][𝐺] be a generic extension obtained by a poset of cardinality smaller than
𝜅 such that 𝒫(𝑅) ∩ 𝑉[𝐾] is countable in 𝑉[𝐾][𝐺]. Work in 𝑉[𝐾][𝐺]. Let {𝐷𝑛 ∶ 𝑛 ∈ 𝜔}
enumerate all open dense subsets of finite powers of the poset 𝑅 in 𝑉[𝐾], with infinite
repetitions. By induction on |𝑡| build conditions 𝑟𝑡 ∈ 𝑅 for 𝑡 ∈ 2<𝜔 so that
• 𝑡 ⊂ 𝑠 implies 𝑟𝑠 ≤ 𝑟𝑡 ;
• whenever 𝐷𝑛 ⊂ 𝑅𝑚 is an open dense set for some 𝑚 < 2𝑛 , then every 𝑚-tuple
of distinct elements from the set {𝑟𝑡 ∶ 𝑡 ∈ 2𝑛 } belongs to 𝐷𝑛 ;
• for all 𝑡 ∈ 2<𝜔 there are open sets 𝑂𝑡0 , 𝑂𝑡1 ⊂ 𝑋 such that 𝑂𝑡0 × 𝑂𝑡1 ⊂ Γ and
𝑟𝑡⌢ 0 ⊩ 𝜂 ∈ 𝑂𝑡0 and 𝑟𝑡⌢ 1 ⊩ 𝜂 ∈ 𝑂𝑡1 .
The construction is routine except for the last item; we just describe how the last item
is obtained. Suppose that 𝑟𝑡 has been found. Work in 𝑉[𝐾] and let 𝑈 ⊂ 𝑋 be the union
of all basic open sets 𝑂 ⊂ 𝑋 such that 𝑟𝑡 ⊩ 𝜂 ∉ 𝑂. Then 𝑟𝑡 ⊩ 𝜂 ∈ 𝑋 ⧵ 𝑈. Since the set
𝑋 ⧵ 𝑈 is closed, by the choice of the name 𝜂 it cannot be a Γ-anticlique and therefore
there are points 𝑥0 , 𝑥1 ∈ 𝑋 ⧵ 𝑈 which are Γ-connected. Since the set Γ ⊂ 𝑋 2 is open,
there are basic open sets 𝑂𝑡0 , 𝑂𝑡1 ⊂ 𝑋 such that 𝑥0 ∈ 𝑂𝑡0 , 𝑥1 ∈ 𝑂𝑡1 , and 𝑂𝑡0 × 𝑂𝑡1 ⊂ Γ.
Neither of the two open sets is a subset of 𝑈 and therefore there must be conditions
𝑟𝑡⌢ 0 and 𝑟𝑡⌢ 1 below 𝑟𝑡 such that the former forces 𝜂 ∈ 𝑂𝑡0 and the latter forces 𝜂 ∈ 𝑂𝑡1
as desired.
In the end, for every binary sequence 𝑦 ∈ 2𝜔 let 𝐻𝑦 ⊂ 𝑅 be the filter generated by the
conditions {𝑟𝑦↾𝑛 ∶ 𝑛 ∈ 𝜔}. Note that any finite tuple of distinct filters 𝐻𝑦 for 𝑦 ∈ 2𝜔 is
mutually generic over the model 𝑉[𝐾] by the second item in the inductive construction
above. The mutual genericity also shows that the function 𝑦 ↦ 𝜂/𝐻𝑦 is a continuous
injection from 2𝜔 to 𝑋, and its range is a Γ-clique by the third item above. By the
perfect balance of the condition 𝑝,̄ there is a perfect set 𝐶 ⊂ 2𝜔 such that the conditions
{𝜎/𝐻𝑦 ∶ 𝑦 ∈ 𝐶} have a lower bound 𝑞 in the separative quotient of the poset 𝑃. By the
forcing theorem applied in every model 𝑉[𝐾][𝐻] for 𝐻 ∈ 𝐶 it is the case that in the
model 𝑊, the condition 𝑞 forces the perfect Γ-clique {𝜂/𝐻 ∶ 𝐻 ∈ 𝐶} to be a subset of 𝜏.
The proof is complete. □
Now it is time for a list of perfect and perfectly balanced forcings.
Example 12.1.9. Let 𝐼 be an 𝐹𝜍 -ideal on 𝜔. The poset 𝑃 of all 𝐼-positive subsets of
𝜔 ordered by inclusion is perfect.
As a special case, this includes the poset of infinite subsets of 𝜔 ordered by inclusion
of Section 7.1 and the posets of Section 7.3, both adding ultrafilters on 𝜔 with various
Ramsey properties.
Proof. Recall that 𝑃(𝐼) is the poset of all 𝐼-positive subsets of 𝜔, ordered by inclu-
sion. Write 𝐼 = ⋃𝑛 𝐼𝑛 as a countable union of closed sets closed under taking subset.
Let 𝑓 ∶ 2𝜔 → 𝒫(𝜔) be a Borel function such that for any finite set 𝑎 ⊂ 2𝜔 , ⋂ 𝑓″ 𝑎 ∉ 𝐼
holds; we must find a perfect set 𝐵 ⊂ 2𝜔 such that the set 𝑓″ 𝐵 ⊂ 𝑃 has a lower bound.
Thinning the domain of 𝑓 if necessary we may assume that the function 𝑓 is in fact
continuous. By induction on 𝑛 ∈ 𝜔 build nodes 𝑢𝑡 ∈ 2<𝜔 for all 𝑡 ∈ 2𝑛 and finite sets
𝑏𝑛 ⊂ 𝜔 such that
• 𝑏𝑛 ∉ 𝐼𝑛 ;
• 𝑠 ⊂ 𝑡 implies that 𝑢𝑠 ⊂ 𝑢𝑡 and 𝑠 is incompatible with 𝑡 implies 𝑢𝑠 is incom-
patible with 𝑢𝑡 ;
• for each 𝑡 ∈ 2𝑛+1 and every 𝑦 ∈ [𝑢𝑡 ] it is the case that 𝑏𝑛 ⊂ 𝑓(𝑦).
Once the induction is performed, let 𝑏 = ⋃𝑛 𝑏𝑛 , let 𝐵 ⊂ 2𝜔 be the perfect set of all
points 𝑦 ∈ 2𝜔 such that ∀𝑛∃𝑡 ∈ 2𝑛 𝑢𝑡 ⊂ 𝑦 and use the continuity of the function 𝑓 to
prove that 𝑏 is the lower bound of the set 𝑓″ 𝐵.
To start the induction, let 𝑢0 = 0. Now suppose that the nodes 𝑢𝑡 ∈ 2<𝜔 for
𝑡 ∈ 2𝑛 as well as sets 𝑏𝑚 for 𝑚 ∈ 𝑛 have been constructed. For each 𝑡 ∈ 2𝑛 choose
distinct points 𝑦𝑡0 , 𝑦𝑡1 ∈ [𝑢𝑡 ] and use the initial assumption on the function 𝑓 to observe
that 𝑐 = ⋂𝑡∈2𝑛 𝑓(𝑦𝑡0 ) ∩ ⋂𝑡∈2𝑛 𝑓(𝑦𝑡1 ) is an 𝐼-positive set. Since the set 𝐼𝑛 ⊂ 𝒫(𝜔) is
topologically closed and closed under subset, there must be a finite subset 𝑏𝑛 ⊂ 𝑐 which
is not in 𝐼𝑛 . Use the continuity of the function 𝑓 to find initial segments 𝑢𝑡⌢ 0 ⊂ 𝑦𝑡0 and
𝑢𝑡⌢ 1 ⊂ 𝑦𝑡1 satisfying the second item of the induction hypothesis. This concludes the
inductive step. □
Corollary 12.1.10. [22] Let 𝑃 be the poset of infinite subsets of 𝜔 ordered by inclu-
sion.
(1) In the 𝑃-extension of the symmetric Solovay model, the full Silver dichotomy
holds, and OCA+ holds.
12.1. PERFECTLY BALANCED FORCING 273

Ramsey ultrafilter on 𝜔, the full Silver dichotomy holds, and OCA+ holds.
Example 12.1.11. Let ⟨Γ, ⋅⟩ be a countable semigroup. The poset 𝑃 = 𝑃Γ of Sub-
section 7.4 is perfect.
Proof. Recall that elements of 𝑃 are just sequences in Γ𝜔 and the ordering is de-
fined by 𝑞 ≤ 𝑝 if there are pairwise disjoint nonempty finite sets 𝑎𝑛 ⊂ 𝜔 such that
𝑞(𝑛) = ∏𝑚∈𝑎 𝑝(𝑚). The proof of the perfect property of the poset 𝑃 is another fusion
𝑛
argument. Let 𝑓 ∶ 2𝜔 → 𝑃 be a Borel function such that for every finite set 𝑏 ⊂ 2𝜔 , the
conditions in the set 𝑓″ 𝑏 have a common lower bound in 𝑃; we must find a perfect set
𝐵 ⊂ 2𝜔 such that the set 𝑓″ 𝐵 ⊂ 𝑃 has a lower bound.
Thinning the domain of 𝑓 if necessary we may assume that the function 𝑓 is con-
tinuous. By induction on 𝑛 ∈ 𝜔 build nodes 𝑢𝑡 ∈ 2<𝜔 and finite sets 𝑎𝑡 ⊂ 𝜔 for all
𝑡 ∈ 2𝑛 , and also elements 𝛾𝑛 ∈ Γ so that
• 𝑠 ⊂ 𝑡 implies that 𝑢𝑠 ⊂ 𝑢𝑡 and 𝑠 is incompatible with 𝑡 implies 𝑢𝑠 is incom-
patible with 𝑢𝑡 ;
• 𝑎0 = 0 and if 𝑠 ⊂ 𝑡 then max(𝑎𝑠 ) < min(𝑎𝑡 );
• for each 𝑡 ∈ 2𝑛+1 and each 𝑦 ∈ [𝑢𝑡 ], 𝛾𝑛 = ∏𝑚∈𝑎 𝑓(𝑦)(𝑚).
𝑡
Once the induction is performed, let 𝑝 = ⟨𝛾𝑛 ∶ 𝑛 ∈ 𝜔⟩, let 𝐵 ⊂ 2𝜔 be the perfect set of
all points 𝑦 ∈ 2𝜔 such that ∀𝑛 ∃𝑡 ∈ 2𝑛 𝑢𝑡 ⊂ 𝑦 and observe that 𝑝 is the lower bound of
the set 𝑓″ 𝐵.
To start the induction, let 𝑢0 = 0 and 𝑎0 = 0. Now suppose that the nodes 𝑢𝑡 ∈ 2<𝜔
for 𝑡 ∈ 2𝑛 as well as sets 𝑎𝑠 for 𝑠 ∈ 2≤𝑛 and elements 𝛾𝑚 for 𝑚 ∈ 𝑛 have been con-
structed. For each 𝑡 ∈ 2𝑛 choose distinct points 𝑦𝑡0 , 𝑦𝑡1 ∈ [𝑢𝑡 ] and use the initial
assumption on the function 𝑓 to observe that the set 𝑐 = {𝑓(𝑦𝑡0 ), 𝑓(𝑦𝑡1 ) ∶ 𝑡 ∈ 2𝑛 }
has a lower bound in the poset 𝑃. This means that there are nonempty finite sets
𝑎𝑡⌢ 0 , 𝑎𝑡⌢ 1 ⊂ 𝜔 disjoint from ⋃𝑠∈2≤𝑛 𝑎𝑠 and a semigroup element 𝛾𝑛 ∈ Γ such that
∏𝑚∈𝑎 ⌢ 𝑓(𝑦𝑡0 )(𝑚) = 𝛾𝑛 and ∏𝑚∈𝑎 ⌢ 𝑓(𝑦𝑡1 )(𝑚) = 𝛾𝑛 holds for all 𝑡 ∈ 2𝑛 . Use the
𝑡 0 𝑡 1
continuity of the function 𝑓 to find initial segments 𝑢𝑡⌢ 0 ⊂ 𝑦𝑡0 and 𝑢𝑡⌢ 1 ⊂ 𝑦𝑡1 such that
𝑓(𝑦𝑡0 )(𝑚) = 𝑓(𝑦)(𝑚) holds for all 𝑚 ∈ 𝑎𝑡0 and all 𝑦 ∈ [𝑢𝑡⌢ 0 ] and 𝑓(𝑦𝑡1 )(𝑚) = 𝑓(𝑦)(𝑚)
holds for all 𝑚 ∈ 𝑎𝑡1 and all 𝑦 ∈ [𝑢𝑡⌢ 1 ]. This concludes the inductive step. □
Corollary 12.1.12. Let 𝑃 be the poset of Subsection 7.4 designed to add a stable
ordered union ultrafilter.
(1) In the 𝑃-extension of the symmetric Solovay model, the full Silver dichotomy
holds, and OCA+ holds.
stable ordered union ultrafilter on 𝜔, the full Silver dichotomy holds, and OCA+
holds.
The last example in this section illustrates the distinction between perfect and perfectly
balanced posets.
Example 12.1.13. The Fin×Fin poset 𝑃 of Definition 7.2.1 is perfectly balanced
but not perfect.
Proof. Recall that 𝑃 consists of all subsets of 𝜔 × 𝜔 with infinitely many infinite
vertical sections, ordered by 𝑞 ≤ 𝑝 if 𝑞 ⧵ 𝑝 ⊂ 𝜔 × 𝜔 is a set with only finitely many
infinite vertical sections. We first prove the failure of perfectness. For each 𝑛 ∈ 𝜔 and
each binary string 𝑡 ∈ 2𝑛 , it is easy to find a perfect set 𝐴𝑡 ⊂ 𝒫(𝜔) such that
• 𝐴𝑡 consists of pairwise almost disjoint infinite sets;
• for all 𝑥 ∈ ∏𝑡∈2𝑛 𝐴𝑡 , the set ⋂𝑡 𝑥𝑡 ⊂ 𝜔 is infinite.
Then, let 𝑓𝑡 ∶ [𝑡] → 𝒫(𝜔) be a continuous injection into 𝐴𝑡 for every 𝑡 ∈ 2<𝜔 . Now, for
every 𝑦 ∈ 2𝜔 let 𝑔(𝑦) ⊂ 𝜔 × 𝜔 be the set of all pairs ⟨𝑛, 𝑚⟩ such that 𝑚 ∈ 𝑓𝑦↾𝑛 (𝑦). It is
clear that the set 𝑔(𝑦) ⊂ 𝜔 × 𝜔 has all vertical sections infinite, so is a condition in 𝑃.
We will show that any finite subset of 𝑔″ 2𝜔 has a lower bound in 𝑃, yet no condition in
𝑃 is below more than countably many elements of 𝑔″ 2𝜔 .
For the first assertion, let 𝑎 ⊂ 2𝜔 be a finite set. Let 𝑚 ∈ 𝜔 be such that the strings
𝑦 ↾ 𝑚 for 𝑦 ∈ 𝑎 are pairwise distinct. Then, for all 𝑛 ≥ 𝑚 the second item implies
that the set ⋂𝑦∈𝑎 𝑓𝑦↾𝑛 (𝑦) is infinite. In other words, the set ⋂𝑦∈𝑎 𝑔(𝑦) has all vertical
sections beyond 𝑚 infinite, so it is a lower bound for 𝑔″ 𝑎. For the second assertion,
suppose that 𝑝 ∈ 𝑃 is a condition, and assume towards a contradiction that the set
{𝑦 ∈ 2𝜔 ∶ 𝑝 ≤ 𝑔(𝑦)} is uncountable. By a counting argument, there must be a number
𝑛 ∈ 𝜔 such that the set {𝑦 ∈ 2𝜔 ∶ 𝑝𝑛 is infinite and modulo finite a subset of 𝑔(𝑦)𝑛 } is
uncountable. Find two distinct elements 𝑦0 , 𝑦1 of the latter set such that 𝑦0 ↾ 𝑛 = 𝑦1 ↾ 𝑛;
denote the common value by 𝑡. Then, the intersection 𝑓𝑡 (𝑦0 ) ∩ 𝑓𝑡 (𝑦1 ) should be finite
by the choice of the function 𝑓𝑡 , and at the same time it should modulo finite contain
the infinite set 𝑝𝑛 . This is a contradiction.
Now it is time to show that 𝑃 is perfectly balanced. Let 𝑝 ∈ 𝑃 be a condition. Let
𝑎 ⊂ 𝜔 be an infinite set such that for each 𝑛 ∈ 𝑎, the vertical section 𝑎𝑛 is infinite.
Let 𝑈 be a nonprincipal ultrafilter on 𝜔 containing 𝑎, and for each 𝑛 ∈ 𝜔 let 𝑈𝑛 be
a nonprincipal ultrafilter on 𝜔 such that if 𝑛 ∈ 𝑎 then 𝑎𝑛 ∈ 𝑈𝑛 . Let 𝑝 ̄ be the virtual
condition on the Coll(𝜔, 𝒫(𝜔)) poset, standing for the analytic set 𝐴 of all sets 𝑏 ⊂ 𝑎
such that the set 𝑐 = {𝑛 ∈ 𝜔 ∶ 𝑏𝑛 is infinite} diagonalizes 𝑈, and for each 𝑛 ∈ 𝑐, the set
𝑏𝑛 diagonalizes 𝑈𝑛 . The condition 𝑝 ̄ ≤ 𝑝 is balanced by Theorem 7.2.2; we will show
that it is perfectly balanced.
Let 𝑄 be a poset and let 𝜎 be a 𝑄-name for a condition in the set 𝐴. Let 𝑉[𝐺]
be a generic extension such that 𝒫(𝑄) ∩ 𝑉 is countable in 𝑉[𝐺] and ℋ is a perfect
set of filters on 𝑄 in finite tuples mutually generic over 𝑉. We must find a condition
𝑟 ∈ 𝑃 in the model 𝑉[𝐺] such that the set {𝐻 ∈ ℋ ∶ 𝑟 ≤ 𝜎/𝐻} is uncountable. To
do that, for each filter 𝐻 ∈ ℋ write 𝑏𝐻 = {𝑛 ∈ 𝜔 ∶ (𝜎/𝐻)𝑛 diagonalizes the filter
𝑈𝑛 }. For each 𝐻 ∈ ℋ, the set 𝑏𝐻 diagonalizes 𝑈; as in Example 12.1.9, there is a set
𝑏 ⊂ 𝜔 such that the collection 𝒦 = {𝐻 ∈ ℋ ∶ 𝑏 ⊂ 𝑏𝐻 modulo finite} contains a
perfect subset. By another fusion argument similar to Example 12.1.9, we can find sets
𝑏𝑛 ⊂ 𝜔 for each 𝑛 ∈ 𝜔 such that the collection ℒ = {𝐻 ∈ 𝒦 ∶ for every 𝑛 ∈ 𝜔, if
(𝜎/𝐻)𝑛 diagonalizes 𝑈𝑛 , then 𝑏𝑛 ⊂ (𝜎/𝐻)𝑛 modulo finite} contains a perfect subset.
Let 𝑐 = {⟨𝑛, 𝑚⟩ ∈ 𝜔2 ∶ 𝑛 ∈ 𝑏 ∧ 𝑚 ∈ 𝑏𝑛 }. It is not difficult to see that 𝑐 ≤ 𝜎/𝐻 holds in
the separative quotient of 𝑃 for every filter 𝐻 ∈ ℒ. □
12.2. Bernstein balanced forcing

In this section we identify a class of posets which is in a precise sense dual to the
class of perfectly balanced forcings.
Definition 12.2.1. Let 𝑃 be a Suslin forcing. A virtual condition 𝑝 ̄ is Bernstein
balanced if in every generic extension 𝑉[𝐺], for every condition 𝑝 ≤ 𝑝,̄ every infinite
12.2. BERNSTEIN BALANCED FORCING 275
poset 𝑄 ∈ 𝑉 such that 𝒫(𝑄) ∩ 𝑉 is countable in 𝑉[𝐺], and every perfect family ℋ ⊂
𝒫(𝑄) such that each finite set 𝑎 ⊂ ℋ is a collection of filters mutually generic over 𝑉,
there is a filter 𝐻 ∈ ℋ such that every condition in 𝑃∩𝑉[𝐻] below 𝑝 ̄ is compatible with
𝑝. The poset 𝑃 is Bernstein balanced if there is a Bernstein balanced virtual condition
below every condition in 𝑃.
As the simplest initial example, consider the poset of countable partial functions from
2𝜔 to 2 ordered by reverse inclusion. Its balanced virtual conditions are classified by
total functions from 2𝜔 to 2. Each such virtual condition 𝑝 ̄ is in fact Bernstein balanced.
To see this, note that any condition 𝑝 ≤ 𝑝 ̄ in any extension 𝑉[𝐺] has countable domain.
On the other hand, if ℋ ∈ 𝑉[𝐺] is a perfect set of filters mutually generic over 𝑉, then
by the product forcing theorem, for each point 𝑥 ∈ dom(𝑝) ⧵ 𝑉 there is at most one
filter 𝐻 ∈ ℋ such that 𝑥 ∈ 𝑉[𝐻]. By a counting argument then, there is a filter 𝐻 ∈ ℋ
such that dom(𝑝) ∩ 𝑉[𝐻] ⧵ 𝑉 = 0 and then 𝑝 is compatible with every condition in
𝑉[𝐻] which is stronger than 𝑝.̄
Bernstein balanced extensions of the Solovay model share a number of regularity
properties. The main technical tool used in all the theorems below is the following.
Proposition 12.2.2. Let 𝑃 be a Suslin forcing and let 𝑝 ̄ be a Bernstein balanced
virtual condition in 𝑃. Let 𝑄 be a partial order and 𝜎 a 𝑄-name for a condition in 𝑃
stronger than 𝑝.̄ Let 𝑊 be a Solovay model derived from an inaccessible cardinal greater
than |𝑄|. In the model 𝑊, if ℋ ⊂ 𝒫(𝑄) is a perfect family consisting of filters mutually
generic over 𝑉, then 𝑝 ̄ forces in 𝑃 that the set {𝐻 ∈ ℋ ∶ 𝜎/𝐻 belongs to the 𝑃-generic filter}
is uncountable.
Proof. Work in the model 𝑊. Let 𝑝 ∈ 𝑃 be a condition stronger than 𝑝,̄ and 𝑎 ⊂
ℋ be a countable set. We must find a filter 𝐻 ∈ ℋ ⧵ 𝑎 such that 𝜎/𝐻 is compatible with
𝑝. Let 𝑉[𝐾] be an intermediate extension obtained by a poset of cardinality smaller
than 𝜅 containing a code for ℋ, and enumeration of the set 𝑎, and the condition 𝑄.
Work in the model 𝑉[𝐾]. The set ℋ⧵𝑎 is Borel and uncountable, and therefore contains
a perfect subset. By the Bernstein balance of the virtual condition 𝑝,̄ there is a filter
𝐻 ∈ ℋ ⧵ 𝑎 such that 𝑝 is compatible with all conditions in 𝑃 ∩ 𝑉[𝐻] stronger than 𝑝,̄
in particular with the condition 𝜎/𝐻. This concludes the proof. □
With the proposition in hand, we begin a line of preservation results. They are all stated
using Convention 1.7.18.
Theorem 12.2.3. In cofinally Bernstein balanced extensions of the symmetric Solo-
vay model, there is no finitely additive diffuse probability measure on 𝜔.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing which is Bern-
stein balanced cofinally below 𝜅. Let 𝑊 be the symmetric Solovay model derived from
𝜅 and work in the model 𝑊. Suppose towards a contradiction that 𝑝 ∈ 𝑃 is a condition,
𝜏 is a 𝑃-name for a map from 𝒫(𝜔) to [0, 1], and 𝑝 forces 𝜏 to be a finitely additive dif-
fuse probability measure. The condition 𝑝 and the name 𝜏 are definable from ground
model parameters and an additional parameter 𝑧 ∈ 2𝜔 . Find an intermediate model
𝑉[𝐾] obtained using a poset of cardinality smaller than 𝜅 such that 𝑧 ∈ 𝑉[𝐾] and 𝑃 is
Bernstein balanced in 𝑉[𝐾]. Work in the model 𝑉[𝐾].
Let 𝑝 ̄ ≤ 𝑝 be a Bernstein balanced virtual condition. Let 𝑄 be the poset of finite
binary strings ordered by reverse end-extensions, with its name 𝑥̇ for the set of those
𝑛 ∈ 𝜔 for which there is a condition 𝑞 ∈ 𝑄 in the generic filter such that 𝑞(𝑛) = 1.
There must be a poset 𝑅 of cardinality smaller than 𝜅, a condition ⟨𝑞, 𝑟⟩ ∈ 𝑄 × 𝑅, and a
𝑄 × 𝑅-name 𝜎 for a condition in 𝑃 stronger than 𝑝 ̄ such that either ⟨𝑞, 𝑟⟩ ⊩ Coll(𝜔, <
𝜅) ⊩ 𝜎 ⊩𝑃 𝜏(𝑥)̇ ≥ 1/2 or ⟨𝑞, 𝑟⟩ ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜏(𝑥)̇ ≤ 1/2. For definiteness,
assume that the former option prevails; with the latter option, replace 𝑥̇ with the name
for its complement and proceed in the same way.
Move to an extension 𝑉[𝐾][𝐺] obtained with some poset of cardinality smaller
than 𝜅 such that 𝒫(𝑄 × 𝑅) ∩ 𝑉[𝐾] is countable in 𝑉[𝐾][𝐺], and work in the model
𝑉[𝐾][𝐺]. Let ⟨𝑂𝑚 ∶ 𝑚 ∈ 𝜔⟩ be an enumeration of all open dense subsets of all finite
powers of 𝑄 × 𝑅 that appear in the model 𝑉[𝐾], with infinite repetitions. By recursion
on 𝑚 ∈ 𝜔 build numbers 𝑛𝑚 ∈ 𝜔 and conditions ⟨𝑞𝑖𝑡 , 𝑟𝑖𝑡 ⟩ ≤ ⟨𝑞, 𝑟⟩ for 𝑖 ∈ 3 and 𝑡 ∈ 2𝑚
so that dom(𝑞𝑖𝑡 ) = 𝑛𝑚 for all 𝑖 ∈ 3 and 𝑡 ∈ 2𝑚 , and:
• if 𝑖 ∈ 3 and 𝑡 ⊂ 𝑠 are binary strings, then ⟨𝑞𝑖𝑠 , 𝑟𝑖𝑠 ⟩ ≤ ⟨𝑞𝑖𝑡 , 𝑟𝑖𝑡 ⟩;
• if 𝑂𝑚 is an open dense set in the 𝑘-fold product of 𝑄 × 𝑅 and 𝑘 is smaller than
𝑚, then for every 𝑖 ∈ 3 and every 𝑘-tuple ⟨𝑡𝑙 ∶ 𝑙 ∈ 𝑘⟩ of distinct elements of
2𝑚+1 , the tuple ⟨⟨𝑞𝑖𝑡𝑙 , 𝑟𝑖𝑡𝑙 ⟩ ∶ 𝑙 ∈ 𝑘⟩ belongs to 𝑂𝑚 ;
• whenever 𝑖, 𝑗 are distinct numbers in 3, 𝑠, 𝑡 ∈ 2𝑚 and 𝑘 ∈ 𝑛𝑚 ⧵ dom(𝑞), then
𝑞𝑖𝑠 (𝑘) and 𝑞𝑗𝑡 (𝑘) are not both simultaneously equal to 1.
To perform the recursion, start with ⟨𝑞𝑖0 , 𝑟𝑖0 ⟩ = ⟨𝑞, 𝑟⟩ for all 𝑖 ∈ 3. Now, suppose that
𝑛𝑚 ∈ 𝜔 and conditions ⟨𝑞𝑖𝑡 , 𝑟𝑖𝑡 ⟩ ≤ ⟨𝑞, 𝑟⟩ for 𝑖 ∈ 3 and 𝑡 ∈ 2𝑚 have been found. First,
work on subscript 0: for all 𝑡 ∈ 2𝑚+1 find conditions ⟨𝑞00𝑡 , 𝑟0𝑡 ⟩ ∈ 𝑄 × 𝑅 so that the first
two items are satisfied and let 𝑛0𝑚 = max𝑡 dom(𝑞00𝑡 ). Then, work on subscript 1: for
all 𝑡 ∈ 2𝑚+1 find conditions ⟨𝑞01𝑡 , 𝑟1𝑡 ⟩ ∈ 𝑄 × 𝑅 so that the first two items are satisfied, for
each 𝑡 and each 𝑗 ∈ [𝑛𝑚 , 𝑛0𝑚 ) 𝑞01𝑡 (𝑗) = 0 holds, and let 𝑛1𝑚 = max𝑡 dom(𝑞01𝑡 ). Finally,
work on subscript 2: for all 𝑡 ∈ 2𝑚+1 find conditions ⟨𝑞02𝑡 , 𝑟2𝑡 ⟩ ∈ 𝑄 × 𝑅 so that the first
two items are satisfied, for each 𝑡 and each 𝑗 ∈ [𝑛𝑚 , 𝑛1𝑚 ) 𝑞02𝑡 (𝑗) = 0 holds, and let
𝑛2𝑚 = max𝑡 dom(𝑞02𝑡 ). To conclude the work, extend the binary strings 𝑞00𝑡 , 𝑞01𝑡 , and 𝑞02𝑡
with zeroes only so that the resulting binary strings 𝑞0𝑡 , 𝑞1𝑡 , 𝑞2𝑡 have the same domain
𝑛𝑚+1 .
In the end, for each 𝑖 ∈ 3 and each 𝑦 ∈ 2𝜔 let 𝐻𝑖𝑦 ⊂ 𝑄 × 𝑅 be the filter generated
by the conditions ⟨𝑞𝑖𝑦↾𝑚 , 𝑟𝑖𝑦↾𝑚 ⟩ for 𝑚 ∈ 𝜔. The first and second items above show that
each family ℋ𝑖 = {𝐻𝑖𝑦 ∶ 𝑦 ∈ 2𝜔 } consists of filters on 𝑄 × 𝑅 in finite tuples mutually
generic over the model 𝑉[𝐾]. The third item above shows that for distinct 𝑖, 𝑗 ∈ 3 and
points 𝑦0 , 𝑦1 ∈ 2𝜔 , the intersection 𝑥/𝐻 ̇ 𝑗𝑦1 is finite.
̇ 𝑖𝑦0 ∩ 𝑥/𝐻
Now, a twice repeated use of the Bernstein balance of the virtual condition 𝑝 ̄ in
𝑉[𝐾] with the families ℋ0 , ℋ1 , ℋ2 yields points 𝑦0 , 𝑦1 , 𝑦2 ∈ 2𝜔 such that the conditions
𝑝0 = 𝜎/𝐻0𝑦0 , 𝑝1 = 𝜎/𝐻1𝑦1 , and 𝑝2 = 𝜎/𝐻2𝑦2 have a common lower bound. Write 𝑥0 =
𝑥/𝐻
̇ 0𝑦0 , 𝑥1 = 𝑥/𝐻 ̇ 1𝑦1 , and 𝑥2 = 𝐻2𝑦2 . By the previous paragraph, the sets 𝑥0 , 𝑥1 , 𝑥2 ⊂ 𝜔
are pairwise almost disjoint. At the same time, by the forcing theorem in 𝑉[𝐾], the
common lower bound of the conditions 𝑝0 , 𝑝1 , 𝑝2 forces the numbers 𝜏(𝑥0̌ ), 𝜏(𝑥1̌ ), and
𝜏(𝑥2̌ ) to be at least 1/2 each. This contradicts the assumption that 𝜏 was forced to be a
diffuse finitely additive probability measure. □
The next preservation theorem deals with Todorcevic’s Open Coloring Axiom, OCA
[104].
Definition 12.2.4. OCA is the following statement. Whenever 𝑋 is a Polish space,

𝐴 ⊂ 𝑋 is a set, and Γ is a graph on 𝐴 which is open in the topology on 𝐴 × 𝐴 inherited
from 𝑋 × 𝑋, then either 𝐴 is a union of countably many Γ-anticliques, or 𝐴 contains an
uncountable Γ-clique.
Theorem 12.2.5. In cofinally Bernstein balanced extensions of the symmetric Solo-
vay model, OCA holds.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing such that 𝑃 is
Bernstein balanced cofinally below 𝜅. Let 𝑊 be a symmetric Solovay model derived
from 𝜅. In the model 𝑊, let 𝑋 be a Polish space and let Γ ⊂ 𝑋 2 be a symmetric open
set, let 𝑝 ∈ 𝑃 be a condition, and let 𝜏 be a 𝑃-name for a subset of 𝑋 such that 𝑝 ⊩ 𝜏
cannot be covered by countably many Γ-anticliques. We will find a perfect set 𝐶 ⊂ 𝑋
such that any two points of 𝐶 are Γ-related, and a condition 𝑞 ≤ 𝑝 in 𝑃 which forces
𝐶 ̌ ∩ 𝜏 is uncountable.
To this end, choose a parameter 𝑧 ∈ 2𝜔 such that 𝑝, 𝜏, Γ are definable from 𝑧. Find
an intermediate generic extension 𝑉[𝐾] of 𝑉 by a poset of size < 𝜅 such that 𝑧 ∈ 𝑉[𝐾]
and 𝑃 is Bernstein balanced in 𝑉[𝐾]. Work in the model 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be a Bernstein
balanced virtual condition. Since Coll(𝜔, < 𝜅) ⊩ 𝑝 ⊩𝑃 𝜏 is not covered by countably
many Γ-anticliques, and a closure of a Γ-anticlique is still a Γ-anticlique, there must be
a poset 𝑅 of size < 𝜅, and 𝑅-name 𝜂 for an element of 𝑋 which belongs to no closed
Γ-anticlique coded in 𝑉[𝐾], and an 𝑅-name 𝜎 for a condition in 𝑃 stronger than 𝑝 ̄ such
that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜂 ∈ 𝜏.
Move into the model 𝑊. Let {𝐷𝑛 ∶ 𝑛 ∈ 𝜔} enumerate all open dense subsets of
finite powers of the poset 𝑅 in 𝑉[𝐾], with infinite repetitions. As in the proof of Theo-
rem 12.1.8, by induction on |𝑡| build conditions 𝑟𝑡 ∈ 𝑅 for 𝑡 ∈ 2<𝜔 so that
• 𝑡 ⊂ 𝑠 implies 𝑟𝑠 ≤ 𝑟𝑡 ;
• whenever 𝐷𝑛 ⊂ 𝑅𝑚 is an open dense set for some 𝑚 < 2𝑛 , then every 𝑚-tuple
of distinct elements from the set {𝑟𝑡 ∶ 𝑡 ∈ 2𝑛 } belongs to 𝐷𝑛 ;
• for all 𝑡 ∈ 2<𝜔 there are open sets 𝑂𝑡0 , 𝑂𝑡1 ⊂ 𝑋 such that 𝑂𝑡0 × 𝑂𝑡1 ⊂ Γ and
𝑟𝑡⌢ 0 ⊩ 𝜂 ∈ 𝑂𝑡0 and 𝑟𝑡⌢ 1 ⊩ 𝜂 ∈ 𝑂𝑡1 .
In the end, for every binary sequence 𝑦 ∈ 2𝜔 let 𝐻𝑦 ⊂ 𝑅 be the filter generated by
the conditions {𝑟𝑦↾𝑛 ∶ 𝑛 ∈ 𝜔} and let 𝑝𝑦 = 𝜎/𝐻𝑦 . Note that any finite tuple of distinct
filters 𝐻𝑦 for 𝑦 ∈ 2𝜔 is mutually generic over the model 𝑉[𝐾] by the second item in
the inductive construction above. Proposition 12.2.2 applied in 𝑉[𝐾] shows that in 𝑊,
𝑝 ̄ forces the set 𝑎 = {𝑦 ∈ 2𝜔 ∶ 𝑝𝑦 is in the generic filter} to be uncountable. The set
{𝜂/𝐻𝑦 ∶ 𝑦 ∈ 𝑎} is then forced to be an uncountable Γ-clique. □
The next preservation theorem deals with a limited version of uniformization in cofi-
nally Bernstein balanced extensions.
Theorem 12.2.6. Let 𝐸 be a Borel equivalence relation on a Polish space 𝑋. In cofi-
nally Bernstein balanced extensions of the symmetric Solovay model, every subset of 𝑋 is
either covered by countably many 𝐸-classes or contains an uncountable subset consisting
of pairwise 𝐸-unrelated elements.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing which is Bern-
stein balanced cofinally below 𝜅. Let 𝑊 be the symmetric Solovay model derived from
𝜅, let 𝑝 ∈ 𝑃 be a condition and let 𝜏 be a 𝑃-name such that 𝑝 ⊩ 𝜏 ⊂ 𝑋 is a set which is
not covered by countably many 𝐸-classes. We will find a perfect set 𝐴 ⊂ 𝑋 consisting
of pairwise 𝐸-unrelated elements and a condition 𝑞 ≤ 𝑝, 𝑞 ⊩ 𝜏 ∩ 𝐴̌ is uncountable.
This will prove the theorem.
The condition 𝑝 and the name 𝜏 are definable from a parameter 𝑧 ∈ 2𝜔 and some
parameters in the ground model. Let 𝑉[𝐾] be some intermediate extension of the
ground model by a poset of size < 𝜅 containing 𝑧 and such that 𝑃 is Bernstein bal-
anced in 𝑉[𝐾]; work in 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be a Bernstein balanced virtual condition in
the poset 𝑃. Since the equivalence relation 𝐸 is Borel, by Theorem 2.5.6 there are fewer
than ℶ𝜔1 many virtual 𝐸-classes in 𝑉[𝐾]. Since the cardinal (ℶ𝜔1 )𝑉 [𝐾] is countable in
𝑊, there must be in 𝑉[𝐾] a poset 𝑅 of cardinality smaller than 𝜅 and 𝑅-names 𝜎 for a
condition in 𝑃 stronger than 𝑝 ̄ and 𝜂 for an element of 𝑋 which is not a realization of
any virtual 𝐸-class in 𝑉[𝐾] such that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜂 ∈ 𝜏.
In the model 𝑊, use Proposition 1.7.12 to find a perfect set {𝐻𝑦 ∶ 𝑦 ∈ 2𝜔 } of fil-
ters on 𝑅 which are mutually generic over the model 𝑉[𝐾]. Write 𝑝𝑦 = 𝜎/𝐻𝑦 and
𝑥𝑦 = 𝜂/𝐻𝑦 . By Proposition 2.1.7, the assumption on the name 𝜂, and the mutual
genericity, the set 𝐴 = {𝜂/𝐻𝑦 ∶ 𝑦 ∈ 2𝜔 } consists of pairwise 𝐸-unrelated elements.
Proposition 12.2.2 applied in 𝑉[𝐾] shows that in 𝑊 the condition 𝑝 ̄ forces that for un-
countably many 𝑦 ∈ 2𝜔 , 𝑝𝑦 belongs to the generic filter. Then 𝑝 ̄ ⊩ 𝜏∩ 𝐴̌ is uncountable
as required. □
The last preservation theorem in this section deals with analytic P-ideals in cofinally
Bernstein balanced extensions.
Theorem 12.2.7. Let 𝐼 be an analytic P-ideal on 𝜔. In cofinally Bernstein balanced
extensions of the symmetric Solovay model, if 𝐴 ⊂ 𝐼 is an uncountable set, then there is a
set 𝑏 ∈ 𝐼 such that the set {𝑎 ∈ 𝐴 ∶ 𝑎 ⊂ 𝑏} is uncountable.
Proof. Suppose that 𝜅 is an inaccessible cardinal and 𝑃 is a Suslin forcing which
is Bernstein balanced cofinally below 𝜅. Let 𝑊 be a symmetric Solovay model derived
from 𝜅; work in the model 𝑊. Let 𝑝 ∈ 𝑃 be a condition and 𝜏 be a 𝑃-name such that
𝑝 ⊩ 𝜏 ⊂ 𝐼 is an uncountable set. We need to produce a set 𝑏 ∈ 𝐼 and a condition
stronger than 𝑝 which forces the set {𝑎 ∈ 𝜏 ∶ 𝑎 ⊂ 𝑏}̌ to be uncountable. The condition
𝑝 and the name 𝜏 must be definable from parameters in the ground model and some
real parameter 𝑧 ∈ 2𝜔 . Let 𝑉[𝐾] be an intermediate forcing extension by a poset of size
< 𝜅 such that 𝑧 ∈ 𝑉[𝐾] and 𝑃 is Bernstein balanced in 𝑉[𝐾], and work in the model
𝑉[𝐾].
By the assumptions on the poset 𝑃, there must be a Bernstein balanced virtual
condition 𝑝 ̄ ≤ 𝑝 in the model 𝑉[𝐾]. There must be a poset 𝑄 of size < 𝜅, a 𝑄-name 𝜂
for an element of 𝐼 which is not in 𝑉[𝐾], and a 𝑄-name 𝜎 for a condition in 𝑃 stronger
than 𝑝 ̄ such that 𝑄 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜂 ∈ 𝜏. Let 𝑉[𝐾][𝐺] be some generic
extension by a poset of cardinality less than 𝜅 in which there is a perfect collection
ℋ ⊂ 𝒫(𝑄) which consists of filters mutually generic over 𝑉[𝐾]. Work in the model
𝑉[𝐾][𝐺].
Use the result of Solecki [98] to fix a lower semicontinuous submeasure 𝜇 on 𝜔
such that 𝐼 = {𝑎 ⊂ 𝜔 ∶ lim𝑛 𝜇(𝑎 ⧵ 𝑛) = 0}. Consider the poset 𝑅 of triples ⟨𝑠, 𝜀, 𝑎⟩ where
𝑠 ⊂ 𝜔 is finite, 𝜀 > 0 is a real number, and 𝑎 ∈ 𝐼 is a set such that 𝜇(𝑎 ⧵ 𝑠) < 𝜀𝑞 . The
ordering is defined by ⟨𝑠1 , 𝜀1 , 𝑎1 ⟩ ≤ ⟨𝑠0 , 𝜀0 , 𝑎0 ⟩ if 𝑠0 ⊂ 𝑠1 , 𝜀1 ≤ 𝜀0 , and 𝑎0 ⊂ 𝑠1 ∪ 𝑎1 . It is
not difficult to see that 𝑅 is a 𝜎-linked poset, and the union of the first coordinates of
conditions in the generic filter is forced to modulo finite contain every ground model
element of 𝐼.
Let 𝑎 ⊂ 𝜔 be a set generic over the model 𝑉[𝐾][𝐺] for the poset 𝑅, and work in
the model 𝑉[𝐾][𝐺][𝑎]. For every filter 𝐻 ∈ ℋ ∩ 𝑉[𝐾][𝐺], 𝜂/𝐻 ⊂ 𝑎 modulo finite
holds, and the set ℋ ∩ 𝑉[𝐾][𝐺] is uncountable as the poset 𝑅 is c.c.c. Thus, the set
{𝐻 ∈ ℋ ∶ 𝜂/𝐻 ⊂ 𝑎 modulo finite} is analytic, uncountable, and therefore contains
a nonempty perfect subset ℋ ′ . Proposition 12.2.2 applied in 𝑉[𝐾] shows that in the
model 𝑊 the condition 𝑝 ̄ forces the set 𝐴 = {𝐻 ∈ ℋ ′ ∶ 𝜎𝑦 is in the generic filter} to be
uncountable. The set 𝑏 = {𝜂/𝐻 ∶ 𝐻 ∈ 𝐴} is then forced to be an uncountable subset of
𝜏 and each element of it is modulo finite included in the set 𝑎. □
Now we move to a rich list of examples of Bernstein balanced forcings and related
corollaries.
Theorem 12.2.8. Every placid Suslin forcing 𝑃 is Bernstein balanced and every
placid virtual condition in 𝑃 is Bernstein balanced.
Proof. Let 𝑝 ̄ be a virtual placid condition in the poset 𝑃. Let 𝑉[𝐺] be a generic
extension and in 𝑉[𝐺], let 𝑝 ≤ 𝑝 ̄ be a condition in 𝑃, let 𝑄 ∈ 𝑉 be an infinite poset
such that 𝒫(𝑄) ∩ 𝑉 is countable in 𝑉[𝐺], and suppose that ℋ ⊂ 𝒫(𝑄) is a perfect
family of filters in finite tuples pairwise mutually generic over 𝑉. We must find a filter
𝐻 ∈ ℋ such that all conditions in 𝑃 ∩ 𝑉[𝐻] below 𝑝 ̄ are compatible with 𝑃. By a
Mostowski absoluteness argument, it is enough to find such a filter in some further
generic extension of 𝑉[𝐺]. Let 𝑅 be any poset adding a new real, and let 𝜏 be an 𝑅-
name for an element of ℋ which is not in 𝑉[𝐺].
Claim 12.2.9. 𝑅 ⊩ 𝑉[𝜏] ∩ 𝑉[𝐺] = 𝑉.
Proof. Suppose towards a contradiction that this is not the case. Then in 𝑉[𝐺],
there must be a condition 𝑟 ∈ 𝑅, a set 𝑎 ∉ 𝑉 of ordinals, and a 𝑄-name 𝜂 such that
𝑟 ⊩ 𝑎̌ = 𝜂/𝜏. Let 𝐾0 , 𝐾1 ⊂ 𝑅 be filters mutually generic over 𝑉[𝐺] containing 𝑟, and
let 𝐻0 = 𝜏/𝐾0 , 𝐻1 = 𝜏/𝐾1 . Since in the model 𝑉[𝐺], the perfect family ℋ consisted
of filters on 𝑄 mutually generic over 𝑉, by a Mostowski absoluteness argument this is
also true in 𝑉[𝐺][𝐾0 ][𝐾1 ]; in particular, 𝐻0 , 𝐻1 ⊂ 𝑄 are filters mutually generic over
𝑉. By the product forcing theorem applied in 𝑉 then, 𝑉[𝐻0 ] ∩ 𝑉[𝐻1 ] = 𝑉. However,
the set 𝑎 ∉ 𝑉 belongs to both 𝑉[𝐻0 ] and 𝑉[𝐻1 ] as 𝑎 = 𝜂/𝐻0 = 𝜂/𝐻1 by the initial
assumptions on the set 𝑎. This is a contradiction. □
Now, let 𝐾 ⊂ 𝑅 be a filter generic over the model 𝑉[𝐺] and let 𝐻 = 𝜏/𝐾; by the claim,
𝑉[𝐺] ∩ 𝑉[𝐻] = 𝑉. The placidity of the virtual condition 𝑝 ̄ applied with the models
𝑉[𝐺] and 𝑉[𝐻] now shows that 𝑝 is compatible with all conditions in the model 𝑉[𝐻]
below 𝑝 ̄ as desired. □
(1) Let 𝑃 be the poset of countable subsets of 𝑋 which are linearly independent over
Φ, with the reverse inclusion ordering. In the 𝑃-extension of the symmetric Solo-
vay model, there is no diffuse finitely additive probability measure on 𝜔 and
OCA holds.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, 𝑋 has a
Hamel basis over Φ, yet there is no diffuse finitely additive probability measure
on 𝜔 and OCA holds.
Example 12.2.11. Let Γ be a Borel graph on a Polish space 𝑋 such that for some
𝑛 ∈ 𝜔, Γ does not contain an injective homomorphic copy of 𝐾𝑛,𝜔1 . Then the coloring
poset 𝑃Γ of Definition 8.1.1 is Bernstein balanced and every balanced virtual condition
is Bernstein balanced.
Proof. The balanced virtual conditions are classified by Γ-colorings 𝑐 ∶ 𝑋 → 𝜔
by Theorem 8.1.2. We must prove that every such a coloring represents a Bernstein
balanced virtual condition.
To this end, let 𝑉[𝐺] be a generic extension and work in 𝑉[𝐺]. Towards a contra-
diction, suppose that there is a condition 𝑝 ∈ 𝑃 such that 𝑐 ⊂ 𝑝, an infinite poset 𝑄 ∈ 𝑉
such that 𝒫(𝑄) ∩ 𝑉 is countable in 𝑉[𝐺], and an uncountable family ℋ consisting of
filters on 𝑄 which are mutually generic over 𝑉 such that for each 𝐻 ∈ ℋ there is a
condition 𝑝𝐻 ∈ 𝑃 ∩ 𝑉[𝐻] such that 𝑐 ⊂ 𝑝𝐻 and 𝑝𝐻 is incompatible with 𝑝. An exami-
nation of the incompatibility options and a counting argument reveal that there must
be a point 𝑥 ∈ dom(𝑝) ⧵ 𝑉 such that the family 𝒢 = {𝐻 ∈ ℋ ∶ ∃𝑥𝐻 ∈ 𝑋 ∩ 𝑉[𝐻] ⧵ 𝑉 𝑥 Γ
𝑥𝐻 ∧ 𝑝𝐻 (𝑥𝐻 ) = 𝑝(𝑥)} is uncountable. For each filter 𝐻 ∈ 𝒢 fix a witnessing point
𝑥𝐻 ∈ 𝑋 ∩ 𝑉[𝐻].
Let 𝑎 ⊂ 𝒢 be a set of size 𝑛 + 1. For every set 𝑏 ⊂ 𝑎 of size 𝑛, the set 𝐶𝑏 =
{𝑦 ∈ 𝑋 ∶ ∀𝐻 ∈ 𝑏 𝑥𝐻 Γ 𝑦} is countable by the initial assumption on the graph Γ. By a
Shoenfield absoluteness argument, 𝐶𝑏 ⊂ 𝑉[𝐻 ∶ 𝐻 ∈ 𝑏]; in particular, 𝑥 ∈ 𝑉[𝐻 ∶ 𝐻 ∈
𝑏]. By a standard mutual genericity argument, it follows that 𝑥 ∈ 𝑋 ∩ 𝑉 must hold.
However, then 𝑝(𝑥) = 𝑝𝐻 (𝑥) must occur, violating the assumption that 𝑝𝐻 is a Γ-
coloring. A contradiction. □
Example 12.2.12. Let 𝒦 be a 𝐺𝛿 matroid on a Polish space 𝑋 and 𝑃 be the poset
of countable 𝒦-sets as in Definition 6.3.8. The poset 𝑃 is Bernstein balanced and every
balanced virtual condition is Bernstein balanced.
Proof. The balanced virtual conditions are classified by maximal 𝒦-sets by The-
orem 6.3.9. We must prove that every such a maximal set 𝐴 ⊂ 𝑋 represents a Bernstein
To this end, let 𝑉[𝐺] be a generic extension and work in 𝑉[𝐺]. Towards a con-
tradiction, suppose that there is a condition 𝑝 ∈ 𝑃 such that 𝐴 ⊂ 𝑝, an infinite poset
𝑄 ∈ 𝑉 such that 𝒫(𝑄) ∩ 𝑉 is countable in 𝑉[𝐺], and an uncountable family ℋ consist-
ing of filters on 𝑄 which are mutually generic over 𝑉 such that for each 𝐻 ∈ ℋ there
is a condition 𝑝𝐻 ∈ 𝑃 ∩ 𝑉[𝐻] such that 𝐴 ⊂ 𝑝𝐻 and 𝑝𝐻 is incompatible with 𝑝. An
examination of the incompatibility options and a counting argument reveal that there
must be a finite set 𝑏 ⊂ 𝑝 ⧵ 𝑉 such that the family 𝒢 = {𝐻 ∈ ℋ ∶ there is a finite set
𝑎𝐻 ⊂ 𝑝𝐻 such that 𝑎𝐻 ∪ 𝐴 is a 𝒦-set while 𝑎𝐻 ∪ 𝐴 ∪ 𝑏 is not} is uncountable.
Let |𝑏| = 𝑛. Let 𝑑 ⊂ 𝒢 be a set of size greater than 𝑛. Let 𝑐 ⊂ 𝐴 be a finite set such
that for every filter 𝐻 ∈ 𝑑, 𝑏 ∪ 𝑐 ∪ 𝑎𝐻 ∉ 𝒦 holds. Note that 𝑏 ∪ 𝑐 ∈ 𝒦 and (by a repeated
application of the balance of the set 𝐴) ⋃𝐻∈𝑑 𝑎𝐻 ∪ 𝑐 ∈ 𝒦. Let 𝑒 = 𝑏 ∪ 𝑐 ∪ ⋃𝐻∈𝑑 𝑎𝐻
and let |𝑒| = 𝑚. Since ⋃𝐻∈𝑑 𝑎𝐻 ∪ 𝑐 ⊂ 𝑒 is a set in 𝒦 of cardinality 𝑚 − 𝑛, the exchange
property of the matroid 𝒦 guarantees that every subset of 𝑒 maximal with respect to
membership in 𝒦 has cardinality at least 𝑚 − 𝑛. Let 𝑓 ⊂ 𝑒 be a maximal set in 𝒦
extending the set 𝑏 ∪ 𝑐. Since |𝑓| ≥ 𝑚 − 𝑛, there must be a filter 𝐻 ∈ 𝑑 such that
𝑎𝐻 ⊂ 𝑓. This contradicts the assumption that 𝑏 ∪ 𝑐 ∪ 𝑎𝐻 ∉ 𝒦. □
Corollary 12.2.13. Let 𝑋 be a Polish field and Φ ⊂ 𝑋 a countable subfield.
(1) Let 𝑃 be the poset of countable subsets of 𝑋 which are algebraically independent
over Φ, with the reverse inclusion ordering. In the 𝑃-extension of the symmetric
Solovay model, there is no diffuse finitely additive probability measure on 𝜔 and
OCA holds.
transcendence basis over Φ, there is no diffuse finitely additive probability mea-
sure on 𝜔 and OCA holds.
Many quotient simplicial complex forcings are Bernstein balanced.

such that 𝐹 is pinned. Let 𝑃 be the transversal poset of Definition 6.4.4. Then 𝑃 is
Bernstein balanced and every balanced virtual condition is Bernstein balanced.
Proof. The balanced virtual conditions are classified by Theorem 6.4.5: they are
inclusion maximal sets 𝐴 ⊂ 𝑋 such that 𝐸 ↾ 𝐴 = 𝐹 ↾ 𝐴. Now, let 𝑝 ̄ be such a balanced
virtual condition. Move to some generic extension and in it, suppose that there is a
condition 𝑝 ∈ 𝑃 such that 𝑝 ≤ 𝑝,̄ an infinite poset 𝑄 ∈ 𝑉 such that 𝒫(𝑄) ∩ 𝑉 is
countable in 𝑉[𝐺], and an uncountable family ℋ consisting of filters on 𝑄 which are
pairwise mutually generic over 𝑉. By mutual genericity, the only 𝐹-classes that occur
in more than one model 𝑉[𝐻] for 𝐻 ∈ ℋ are the classes which are realized already
in 𝑉. By a counting argument, there is a filter 𝐻 ∈ ℋ such that in the model 𝑉[𝐻]
there are no 𝐹-classes represented in the domain of 𝑝 other than the classes which are
realized in 𝑉. Then 𝑝 is compatible with every condition in 𝑉[𝐻] which is stronger
than 𝑝.̄ □

𝑋.
(1) Let 𝑃 be the poset of countable subsets of 𝑋 consisting of pairwise 𝐸-unrelated ele-
ments, ordered by reverse inclusion. In the 𝑃-extension of the symmetric Solovay
model, there is no diffuse finitely additive probability measure on 𝜔 and OCA
holds.
transversal, there is no diffuse finitely additive probability measure on 𝜔 and
OCA holds.
Example 12.2.16. Let ℱ be a Fraissé class with strong amalgamation. Let 𝐸 be

a Borel equivalence relation on a Polish space 𝑋. Then the 𝐸, ℱ-Fraissé forcing 𝑃 of
Definition 8.7.3 is Bernstein balanced and every balanced virtual condition is Bernstein
balanced.
Proof. The balanced virtual conditions are classified by Theorem 8.7.4 as the ℱ-
structures on the virtual 𝐸-quotient space. Now, let 𝑝 ̄ be such a balanced virtual condi-
tion. Move to some generic extension and in it, suppose that there is a condition 𝑝 ∈ 𝑃
such that 𝑝 ≤ 𝑝,̄ an infinite poset 𝑄 ∈ 𝑉 such that 𝒫(𝑄) ∩ 𝑉 is countable in 𝑉[𝐺],
and an uncountable family ℋ consisting of filters on 𝑄 which are pairwise mutually
generic over 𝑉. By mutual genericity, the only 𝐸-classes that occur in more than one
model 𝑉[𝐻] for 𝐻 ∈ ℋ are the classes which are realizations of virtual 𝐸-classes in
𝑉. By a counting argument, there is a filter 𝐻 ∈ ℋ such that in the model 𝑉[𝐻] there
are no 𝐸-classes represented in the domain of 𝑝 other than the classes which are real-
izations of virtual 𝐸-classes in 𝑉. Then 𝑝 is compatible with every condition in 𝑉[𝐻]
which is stronger than 𝑝.̄ □

(1) Let 𝑃 be the poset of linear orders on countable subsets of the 𝐸-quotient space,
with the reverse inclusion ordering. In the 𝑃-extension of the symmetric Solovay
model, there is no diffuse finitely additive probability measure on 𝜔 and OCA
holds.
quotient space is linearly ordered, there is no diffuse finitely additive probability
measure on 𝜔 and OCA holds.
Example 12.2.18. Let 𝐸, 𝐹 be Borel equivalence relations on respective Polish

spaces 𝑋, 𝑌 with 𝜆(𝐸) ≤ 𝜆(𝐹). Then the 𝐸, 𝐹-collapse forcing of Definition 6.4.1 is
Bernstein balanced and every balanced virtual condition is Bernstein balanced.
Proof. The balanced virtual conditions are classified by injections from the vir-
tual 𝐸-space to the virtual 𝐹-space–Theorem 6.4.2. Now, let 𝑝 ̄ be such a balanced vir-
tual condition. Move to some generic extension and in it, suppose that there is a con-
dition 𝑝 ∈ 𝑃 such that 𝑝 ≤ 𝑝,̄ an infinite poset 𝑄 ∈ 𝑉 such that 𝒫(𝑄) ∩ 𝑉 is countable
in 𝑉[𝐺], and an uncountable family ℋ consisting of filters on 𝑄 which are pairwise
mutually generic over 𝑉. By mutual genericity, the only 𝐸-classes and 𝐹-classes that
occur in more than one model 𝑉[𝐻] for 𝐻 ∈ ℋ are the classes which are realizations
of virtual 𝐸 or 𝐹-classes in 𝑉. By a counting argument, there is a filter 𝐻 ∈ ℋ such
that in the model 𝑉[𝐻] there are no 𝐸-classes or 𝐹-classes represented in the domain
of 𝑝 other than the classes which are realizations of virtual classes in 𝑉. Then 𝑝 is
compatible with every condition in 𝑉[𝐻] which is stronger than 𝑝.̄ □
Corollary 12.2.19. Let 𝐸, 𝐹 be pinned Borel equivalence relations on the respective

Polish spaces 𝑋, 𝑌 with uncountably many classes.
(1) Let 𝑃 be the 𝐸, 𝐹-collapse forcing of Definition 6.4.1. In the 𝑃-extension of the
symmetric Solovay model, there is no diffuse finitely additive probability mea-
sure on 𝜔 and OCA holds.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, |𝐸| ≤ |𝐹|
holds, there is no diffuse finitely additive probability measure on 𝜔 and OCA
holds.
There are many posets which are neither Bernstein balanced nor perfectly balanced.
The examples below are built to violate specific preservation properties of Bernstein
balanced posets.
Example 12.2.20. Consider the clopen graph Γ on 2𝜔 connecting points 𝑥0 ≠ 𝑥1

if the smallest 𝑛 ∈ 𝜔 such that 𝑥0 (𝑛) ≠ 𝑥1 (𝑛) is even. Let 𝑃 be the balanced poset
of Example 8.9.3. In the 𝑃-extension of the Solovay model, there is an uncountable
subset of 2𝜔 such that every Γ-clique and every Γ-anticlique in it is countable. Thus, in
the 𝑃-extension of the Solovay model, OCA fails. In view of Theorem 12.2.5, 𝑃 is not
Bernstein balanced.
Example 12.2.21. Let 𝑃 be the Lusin poset of Definition 8.9.5. In the 𝑃-extension
of the symmetric Solovay model the conclusion of Theorem 12.2.6 fails. The union of
the first coordinates of the generic filter witness that the conclusion of Theorem 12.2.6
fails for the equivalence relation 𝔼0 . In particular, the Lusin poset is not Bernstein
balanced.
Proof. Let 𝐴̇ be the 𝑃-name for the union of the first coordinates of the conditions
in the generic filter. Let 𝜅 be an inaccessible cardinal, let 𝑊 be a symmetric Solovay
model derived from 𝜅, and move to the model 𝑊. Let 𝑝 = ⟨𝑎, 𝑏⟩ ∈ 𝑃 be a condition
and let 𝜏 be a 𝑃-name for an uncountable subset of 𝐴.̇ We must find a condition 𝑞 ≤ 𝑝
and two distinct 𝔼0 -related points 𝑥0 , 𝑥1 ∈ 2𝜔 such that 𝑞 ⊩ 𝑥0̌ , 𝑥1̌ ∈ 𝜏. To this end,
find a parameter 𝑧 ∈ 2𝜔 such that both 𝑝, 𝜏 are definable from some parameters in
the ground model and the parameter 𝑧. Let 𝑉[𝐾] be an intermediate generic extension
containing the parameter 𝑧, obtained as a forcing extension of the ground model by a
poset of size less than 𝜅. Work in the model 𝑉[𝐾].
Let 𝑝 ̄ ≤ 𝑝 be a balanced virtual condition in 𝑃 as in Theorem 8.9.6, so 𝑎𝑝̄ = 𝑎.
Since 𝜏 is forced to be an uncountable set, there must be a poset 𝑅, an 𝑅-name 𝜎 for
a condition in 𝑃 stronger than 𝑝,̄ and an 𝑅-name 𝜂 for a point in 𝑎𝜍 ⧵ 𝑎 such that
𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜂 ∈ 𝜏. Looking back at the description of the virtual
condition 𝑝 ̄ in Theorem 8.9.6, we see that 𝑅 forces 𝜂 to be a point Cohen-generic over
the model 𝑉[𝐾], and it is also forced that any tuple 𝑥 ∈ (2𝜔 )𝑛 of points in the set
𝑎𝜍 ⧵(𝑎∪ [𝜂]𝔼0 ) is Cohen-generic over the model 𝑉[𝐾][𝜂]. By the general forcing theory,
we may present the poset 𝑅 as a two step iteration 𝑆 0 ∗ 𝑆 1̇ , where 𝑆 0 is the Cohen poset
2<𝜔 restricted to some finite binary string 𝑠, adding the Cohen-generic point 𝜂, and 𝑆 1̇
is the 𝑆 0 -name for the remainder forcing.
Move back to the model 𝑊. Choose a filter 𝐻00 ⊂ 𝑆 0 generic over the model 𝑉[𝐾],
and write 𝑥0 = 𝜂/𝐻00 ∈ 2𝜔 . Flip any value of 𝑥0 past dom(𝑠) to obtain another point
𝑥1 ∈ 2𝜔 . Then 𝑥1 is 𝔼0 -related to 𝑥0 and also Cohen generic over the model 𝑉[𝐾],
containing the string 𝑠 as an initial segment. Write 𝐻10 ⊂ 𝑆 0 for the filter generic over
𝑉[𝐾] obtained from 𝑥1 ; thus, 𝑉[𝐾][𝐻00 ] = 𝑉[𝐾][𝐻10 ]. Find filters 𝐻01 ⊂ 𝑆 1̇ /𝐻00 and
𝐻11 ⊂ 𝑆/𝐻 ̇ 10 mutually generic over the model 𝑉[𝐾][𝐻00 ], and write 𝑝0 = 𝜎/𝐻00 ∗ 𝐻01
and 𝑝1 = 𝜎/𝐻10 ∗ 𝐻11 . The conditions 𝑝0 , 𝑝1 are compatible in the poset 𝑃 by a mutual
genericity argument similar to the proof of Theorem 8.9.6. Let 𝑞 ∈ 𝑃 be any lower
bound for the conditions 𝑝0 , 𝑝1 . The initial choices of the names 𝜎 and 𝜂 now imply
that 𝑞 ⊩ 𝑥0̌ , 𝑥1̌ ∈ 𝜏 as desired. □
Example 12.2.22. Let 𝑃 be the balanced poset of Example 8.9.4. In the 𝑃-extension
of the Solovay model there is a dominating subset of 𝜔𝜔 such that the set of all func-
tions in it dominated by any fixed 𝑦 ∈ 𝜔𝜔 is countable. Thus, the conclusion of The-
orem 12.2.7 fails in the 𝑃-extension with the P-ideal 𝐼 on 𝜔 × 𝜔 consisting of sets with
all vertical sections finite. The poset 𝑃 is not Bernstein balanced.
We conclude this section with an anti-preservation result and an example justifying the
choice of the Bernstein name for the class of posets in question. Recall that a Bernstein
set is a subset of a Polish space such that neither it nor its complement contains a perfect
set.
Proposition 12.2.23. In nontrivial, cofinally Bernstein balanced extensions of the
symmetric Solovay model, there is a Bernstein set.
Proof. Suppose that 𝜅 is an inaccessible cardinal and 𝑃 is a Suslin forcing which is

Bernstein balanced cofinally below 𝜅. Let 𝑊 be the symmetric Solovay model derived
from 𝜅 and work in the model 𝑊. Let 𝑝 ∈ 𝑃 be a condition. Let 𝑉[𝐾] be an intermediate
extension obtained with a poset of size < 𝜅 such that 𝑝 ∈ 𝑉[𝐾] and 𝑃 is Bernstein
balanced in 𝑉[𝐾]. Working in 𝑉[𝐾], find a Bernstein balanced virtual condition 𝑝 ̄ ≤ 𝑝,
and a poset 𝑄 of size < 𝜅 and a 𝑄-name 𝜎 for a condition such that 𝑄 ⊩ 𝜎 ≤ 𝑝.̄ Since
the poset 𝑃 contains no atoms, it is also possible to find 𝑄-names 𝜎0 , 𝜎1 for incompatible
elements of 𝑃 stronger than 𝜎.
Back in 𝑊, let {𝐻𝑦 ∶ 𝑦 ∈ 2𝜔 } be a perfect collection of filters on 𝑄 pairwise generic
over the model 𝑉[𝐾], obtained by an application of Proposition 1.7.12. Let 𝜏0 be the
𝑃-name for the set {𝑦 ∈ 2𝜔 ∶ 𝜎0 /𝐻𝑦 belongs to the generic filter on 𝑃} and let 𝜏1 be
the 𝑃-name for the set {𝑦 ∈ 2𝜔 ∶ 𝜎1 /𝐻𝑦 belongs to the generic filter on 𝑃}. These are
clearly forced to be disjoint subsets of 2𝜔 , and 𝑝 ̄ forces that complement of neither
contains a perfect set: any condition below 𝑝 ̄ is incompatible with only countably many
conditions in the set {𝜎0 /𝐻𝑦 , 𝜎1 /𝐻𝑦 ∶ 𝑦 ∈ 2𝜔 } by the Bernstein balance of the virtual
condition 𝑝.̄ Thus, 𝑝 ̄ forces both 𝜏0 , 𝜏1 to be Bernstein sets. □
Unlike perfectly balanced extensions, Bernstein balanced extensions may exhibit

chaotic structure of cardinalities below 2𝜔 . This concern was addressed in [111].
Example 12.2.24. Let 𝑃 be the poset of all countable functions from 2𝜔 to 2, or-
dered by reverse extension. Let 𝜅 be an inaccessible cardinal, let 𝑊 be the symmetric
Solovay model derived from 𝜅, and let 𝐺 ⊂ 𝑃 be a filter generic over 𝑊. In 𝑊[𝐺],
let 𝑎0 = {𝑦 ∈ 2𝜔 ∶ ∃𝑝 ∈ 𝐺 𝑝(𝑦) = 0} and 𝑎1 = {𝑦 ∈ 2𝜔 ∶ ∃𝑝 ∈ 𝐺 𝑝(𝑦) = 1}. In
𝑊[𝐺], |𝑎0 | ≠ |𝑎1 |. Thus, 2𝜔 can be decomposed into two uncountable sets of distinct
cardinalities, contradicting the full Silver dichotomy.
Proof. Work in 𝑊. Suppose towards a contradiction that 𝑝 ∈ 𝑃 is a condition
and 𝜏 is a 𝑃-name such that 𝑝 ⊩ 𝜏 ∶ 𝑎0̇ → 𝑎1̇ is a bijection. The condition 𝑝 as well
as the name 𝜏 have to be definable from some ground model parameters and some
parameter 𝑧 ∈ 2𝜔 . Find an intermediate model 𝑉[𝐾] obtained as a generic extension
of the ground model by a poset of size < 𝜅 such that 𝑧 ∈ 𝑉[𝐾].
Work in the model 𝑉[𝐾]. Let 𝑝 ̄ be the Coll(𝜔, 𝔠)-name for the set {𝑞 ∈ 𝑃 ∶ 𝑝 ⊂
𝑞 ∧ ∀𝑥 ∈ 𝑉[𝐾] ∩ 2𝜔 ⧵ dom(𝑝) 𝑞(𝑥) = 0}. This is a balanced virtual condition in 𝑃 for
the model 𝑉[𝐾]. For every point 𝑥 ∈ 2𝜔 ⧵ dom(𝑝) let 𝑦𝑥 ∈ 2𝜔 be a point such that
Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩𝑃 𝜏(𝑥)̌ = 𝑦𝑥̌ , if it exists. As 𝜏 is forced to be an injection from 𝑎0̇
to 𝑎1̇ , for each 𝑥 there can be at most one 𝑦𝑥 of this kind, and the function 𝑔 ∶ 𝑥 ↦ 𝑦𝑥
must be an injection from 2𝜔 ⧵ dom(𝑝) to dom(𝑝). Since the former set is uncountable
and the latter is countable, there must be a point 𝑥 ∈ 2𝜔 ⧵ dom(𝑝) which is not in the
domain of 𝑔.
Still in the model 𝑉[𝐾], the statement that 𝑥 ∉ dom(𝑔) means that Coll(𝜔, < 𝜅)
forces that either there is a condition below 𝑝 ̄ in 𝑃 which forces 𝜏(𝑥)̌ out of 𝑉[𝐾], or
there are two distinct conditions in 𝑃 stronger than 𝑝 ̄ which force the value 𝜏(𝑥)̌ to be
two distinct points in 𝑉[𝐾]. Suppose for definiteness that the former is the case. Then
there must be a poset 𝑅 of size < 𝜅, an 𝑅-name 𝜎 for a condition in 𝑃 stronger than 𝑝 ̄ and
an 𝑅-name 𝜂 for an element of 2𝜔 ⧵ 𝑉[𝐾] such that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜏(𝑥)̌ = 𝜂.
In the model 𝑊, pick filters 𝐻0 , 𝐻1 ⊂ 𝑅 mutually generic over the model 𝑉[𝐾]. Let
𝑝0 = 𝜎/𝐻0 ∈ 𝑃 and 𝑝1 = 𝜎/𝐻1 ∈ 𝑃; by the balance of the condition 𝑝,̄ 𝑝0 and 𝑝1 are
12.3. 𝑛-BERNSTEIN BALANCED FORCING 285
conditions compatible in 𝑃, with some lower bound 𝑞 ∈ 𝑃. Let 𝑦0 = 𝜂/𝐻0 ∈ 2𝜔 and

𝑦1 = 𝜂/𝐻1 ∈ 2𝜔 ; by the product forcing theorem and the choice of the name 𝜂, 𝑦0 ≠ 𝑦1
holds. But then, 𝑞 ⊩ 𝜏(𝑥)̌ = 𝑦0̌ and 𝜏(𝑥)̌ = 𝑦1̌ , an impossibility. □
12.3. 𝑛-Bernstein balanced forcing

The class of Bernstein balanced Suslin forcings admits a meaningful stratification
which amounts to assigning a numerical dimension to forcings in this class. Before we
state the definition, we introduce a natural notion of dimension to closed graphs on
Polish spaces.
Definition 12.3.1. Let 𝑛 ≥ 1 be a number. Let Γ be a nonempty closed graph on
a Polish space 𝑋. We say that Γ has Komjáth dimension ≥ 𝑛 if for all nonempty open
sets 𝑂𝑖 ⊂ 𝑋 for 𝑖 ∈ 𝑛 + 1, the set {𝑥 ∈ ∏𝑖∈𝑛+1 𝑂𝑖 ∶ ∀𝑖 ∈ 𝑛 𝑥(𝑖) Γ 𝑥(𝑛)} is either empty
or both its projections to ∏𝑖∈𝑛 𝑂𝑖 and to 𝑂𝑛 are somewhere dense in ∏𝑖∈𝑛 𝑂𝑖 and 𝑂𝑛
respectively. The graph Γ has Komjáth dimension 𝑛 if 𝑛 is the largest number such that
Γ has Komjáth dimension ≥ 𝑛.
Definition 12.3.2. Let 𝑛 ≥ 1, 𝑘 > 2 be numbers. Let Γ ⊂ [𝑋]𝑘 be a closed
hypergraph of arity 𝑘 on a Polish space 𝑋. We say that Γ has Komjáth dimension ≥
𝑛 if there are nonzero numbers 𝑘0 , 𝑘1 such that the closed graph Δ on [𝑋]𝑘0 ∪ [𝑋]𝑘1
connecting sets 𝑎0 , 𝑎1 if 𝑎0 ∪ 𝑎1 ∈ Γ has Komjáth dimension ≥ 𝑛.
A list of instructive examples is in order. We provide the lower bounds on the dimen-
sion only. It is not difficult to show that the lower bounds we compute are the actual
values of the dimension. A number of examples of higher dimensional graphs arise
in the context of algebraic varieties in ℝ𝑛 . The simple calculations of tame topolog-
ical dimension 𝚍𝚒𝚖 of subsets of ℝ𝑛 definable in the o-minimal structure ⟨ℝ, ≤, +, ⋅⟩
[110, Chapter 4] are helpful to establish the value of the graph theoretic dimension.
The following are the properties of the tame topological dimension which we use be-
low without mention. For a definable subset 𝐵 ⊂ ℝ𝑛 𝚍𝚒𝚖(𝐵) = 𝑛 iff 𝐵 contains a
nonempty open subset. If 𝐵 ⊂ ℝ𝑚 × ℝ𝑛 is a definable set and 𝑘 ≤ 𝑛 is a number
then the set 𝐶 = {𝑥 ∈ ℝ𝑛 ∶ 𝚍𝚒𝚖(𝐵𝑥 ) = 𝑘} is definable and if 𝐶 is nonempty then
𝚍𝚒𝚖(𝐵 ∩ (𝐶 × ℝ𝑚 )) = 𝚍𝚒𝚖(𝐶) + 𝑘. Moreover, injective definable maps preserve dimen-
sion.
Example 12.3.3. Let 𝜀 > 0 be a real number. Let Γ be the closed graph on 𝑋
connecting points of Euclidean distance 𝜀. Then Γ has Komjáth dimension 3.
Proof. Let ⟨𝑂𝑖 ∶ 𝑖 ∈ 4⟩ be basic open subsets of 𝑋 and let 𝐵 = {⟨𝑥𝑖 ∶ 𝑖 ∈ 4⟩ ∈
∏𝑖∈𝑛+1 𝑂𝑖 ∶ ∀𝑖 ∈ 𝑛 {𝑥𝑖 , 𝑥𝑛 } ∈ Γ}. Note that the set 𝐵 is algebraic. Suppose that the set
𝐵 is nonempty, and let ⟨𝑥𝑖 ∶ 𝑖 ∈ 𝑛 + 1⟩ ∈ 𝐵 be any element. As the graph Γ is invariant
under shifts of 𝑋, the projection of 𝐵 to 𝑂𝑛 contains an open ball around 𝑥𝑛 . Showing
that the projection of 𝐵 to ∏𝑖∈𝑛 𝑂𝑖 contains an open set is more demanding. Note that
for each point 𝑦 ∈ 𝑂𝑛 close to 𝑥𝑛 the 𝜀-sphere around 𝑦 intersects each basic open set
𝑂𝑖 in a nonempty set of dimension 2; thus 𝚍𝚒𝚖(𝐵𝑦 ) = 6 and 𝚍𝚒𝚖(𝐵) ≥ 3 + 6 = 9. Since,
for any three distinct points in 𝑋 the 𝜀-spheres around them intersect in at most two
points (a set of zero dimension), this means that the dimension of the projection of 𝐵
into ∏𝑖∈𝑛 𝑂𝑖 has to have the maximal possible value 9 as well, so has to contain an
open set. This concludes the proof. □
Example 12.3.4. Let 𝑋 = ℝ2 and let Γ ⊂ [𝑋]3 be the hypergraph consisting of

triples which form the set of vertices in an isosceles triangle. Γ has Komjáth dimension
at least 2.
Proof. Let Δ be the graph on the union of [𝑋]2 and 𝑋 connecting {𝑥0 , 𝑥1 } ∈ [𝑋]2
with 𝑥2 ∈ 𝑋 if {𝑥0 , 𝑥1 , 𝑥2 } ∈ Γ. We show that Δ has Komjáth dimension ≥ 2.
Let 𝑂𝑖 ⊂ 𝑋 for 𝑖 ∈ 4 be basic open sets such that the set 𝐵 = {⟨𝑥𝑖 ∶ 𝑖 ∈ 4⟩ ∈
∏𝑖 𝑂𝑖 ∶ {𝑥0 , 𝑥1 , 𝑥2 }, {𝑥0 , 𝑥1 , 𝑥3 } ∈ Γ} is nonempty. It is enough to show that its projec-
tions to 𝑂0 ×𝑂1 and to 𝑂2 ×𝑂3 contain nonempty open sets. We deal with the projection
to 𝑂2 × 𝑂3 . Let ⟨𝑥𝑖 ∶ 𝑖 ∈ 4⟩ ∈ 𝐵 be any point. For points 𝑦0 ∈ 𝑂0 and 𝑦1 ∈ 𝑂1 close
enough to 𝑥0 and 𝑥1 the section 𝐵𝑦0 𝑦1 ⊂ 𝑂2 × 𝑂3 has dimension 2–it is a product of two
segments in a line of points equidistant from 𝑦0 and 𝑦1 . Thus, 𝚍𝚒𝚖(𝐵) ≥ 2 + 2 + 2 = 6.
On the other hand, given any distinct points 𝑥2 , 𝑥3 ∈ 𝑋, the set of all pairs ⟨𝑥0 , 𝑥1 ⟩ ∈ 𝑋 2
which form a basis of an isosceles triangle with both 𝑥2 and 𝑥3 has dimension 2–the
pair is determined by either of its elements. As a result, the 𝑂0 × 𝑂1 -sections of the set
𝐵 have dimension at most 2. Thus, the projection of 𝐵 to the 𝑂2 × 𝑂3 coordinate has to
have the maximal dimension 4, so has to contain a nonempty open set. This completes
the proof. □
In certain simple situations, one can evaluate the dimension in graphs derived from
varieties which are not algebraic.
Example 12.3.5. Let 𝐶 ⊂ ℝ2 be a compact parametric 𝐶 1 -curve containing no
straight segments. Let Γ be the graph on the space 𝑋 = ℝ2 connecting points 𝑥0 , 𝑥1 if
either 𝑥0 − 𝑥1 ∈ 𝐶 or 𝑥1 − 𝑥0 ∈ 𝐶. The graph Γ has Komjáth dimension ≥ 2.
Proof. Let 𝑂𝑖 for 𝑖 ∈ 3 be nonempty open subsets of 𝑋 and suppose that the set
𝐵 = {⟨𝑥𝑖 ∶ 𝑖 ∈ 3⟩ ∈ ∏𝑖 𝑂𝑖 ∶ ∀𝑖 ∈ 2 {𝑥𝑖 , 𝑥2 } ∈ Γ} is nonempty. It is enough to show
that the projections of the set 𝐵 to 𝑂2 and to 𝑂0 × 𝑂1 contain nonempty open sets. Let
⟨𝑥𝑖 ∶ 𝑖 ∈ 3⟩ ∈ 𝐵 be any point. For definiteness assume that 𝑥2 −𝑥0 ∈ 𝐶 and 𝑥2 −𝑥1 ∈ 𝐶.
Since the graph Γ is invariant under shifts, it is clear that a small open ball around 𝑥2
is a subset of the projection of 𝐵 to 𝑂2 . For the projection of 𝐵 to 𝑂0 × 𝑂1 , first use the
initial assumption on the curve 𝐶 to shift the point 𝑥0 within 𝑂0 if necessary so that
the curves 𝑥0 + 𝐶 and 𝑥1 + 𝐶 intersect at 𝑥2 with distinct tangent directions. Since both
𝑥0 + 𝐶 and 𝑥1 + 𝐶 are 𝐶 1 -curves, there is a small open disc 𝑃 ⊂ 𝑂2 around 𝑥2 such
that both (𝑥0 + 𝐶) ∩ 𝑃 and (𝑥1 + 𝐶) ∩ 𝑃 are simple curves intersecting the boundary
of 𝑃 at two distinct points each and intersecting each other at 𝑥2 only. By the Jordan
curve theorem applied in 𝑃, any two small shifts of the curves 𝑥0 + 𝐶 and 𝑥1 + 𝐶 will
still intersect inside 𝑃. It follows that a product of two small balls around 𝑥0 and 𝑥1 is
a subset of the projection of 𝐵 to 𝑂0 × 𝑂1 . □
We can also find high-dimensional graphs unrelated to Euclidean spaces.
Example 12.3.6. Let 𝑛 ∈ 𝜔 be a number. Let Φ be an uncountable Polish field.
View 𝑋 = Φ𝑛 as a vector field over Φ with the usual inner product ⋅. The graph Γ on 𝑋
connecting vectors 𝑥0 , 𝑥1 if 𝑥0 ⋅ 𝑥1 = 1 has Komjáth dimension ≥ 𝑛.
Proof. Suppose that 𝑂𝑖 ⊂ 𝑋 are open sets for 𝑖 ∈ 𝑛 + 1 such that the set 𝐵 =
{⟨𝑥𝑖 ∶ 𝑖 ∈ 𝑛 + 1⟩ ∈ ∏𝑖∈𝑛+1 𝑂𝑖 ∶ ∀𝑖 ∈ 𝑛 𝑥𝑖 ⋅ 𝑥𝑛 = 1} is nonempty. It will be enough
to show that the projection of 𝐵 to the 𝑂𝑛 -coordinate and to the ∏𝑖∈𝑛 𝑂𝑖 -coordinates
contains an open set. Let ⟨𝑥𝑖 ∶ 𝑖 ∈ 𝑛 + 1⟩ ∈ 𝐵 be an arbitrary point. We deal with the
projection to the ∏𝑖∈𝑛 𝑂𝑖 -coordinates.
First adjust the points ⟨𝑥𝑖 ∶ 𝑖 ∈ 𝑛⟩ into a general position, i.e. so that they are
linearly independent. To do this, let 𝑎 ⊂ 𝑋 be a set of 𝑛 − 1 many linearly independent
vectors such that for all 𝑦 ∈ 𝑎, 𝑦 ⋅ 𝑥𝑛 = 0 and 𝑥𝑖 + 𝑦 ∈ 𝑂𝑖 for all 𝑖 ∈ 𝑛. For each 𝑖 ∈ 𝑛,
𝑥𝑖 does not belong to the span of 𝑎, so the span of 𝑎 ∪ {𝑥𝑖 } is all of 𝑋. It follows that
one can select points 𝑦𝑖 in the linear span of 𝑎 for every 𝑖 ∈ 𝑛 such that the collection
{𝑥𝑖 + 𝑦𝑖 ∶ 𝑖 ∈ 𝑛} is linearly independent. Then for each 𝑖 ∈ 𝑛, 𝑥𝑖 + 𝑦𝑖 ∈ 𝑂𝑖 and
(𝑥𝑖 + 𝑦𝑖 ) ⋅ 𝑥𝑛 = 1 as desired.
Now, suppose that the points 𝑥𝑖 for 𝑖 ∈ 𝑛 are in general position. By Cramer’s
rule, there is a small neighborhood 𝑃 of ⟨𝑥𝑖 ∶ 𝑖 ∈ 𝑛⟩ in ∏𝑖∈𝑛 𝑂𝑖 such that for all points
⟨𝑧𝑖 ∶ 𝑖 ∈ 𝑛⟩ ∈ 𝑃, there is exactly one point 𝑣 ∈ 𝑋 such that for all 𝑖 ∈ 𝑛, 𝑥𝑖 ⋅ 𝑣 = 1 holds,
and moreover this point 𝑣 belongs to 𝑂𝑛 . Then 𝑃 is a subset of the projection of 𝐵 as
desired. □
We will be primarily interested in graphs which in ZFC have countable chromatic num-
ber; as the Komjáth dimension of the graph increases, it becomes harder to find the col-
oring. The preservation theorems below depend on a forcing analysis of closed graphs
of a fixed dimension.
Definition 12.3.7. Let Γ be a closed graph on a Polish space 𝑋 of Komjáth di-
mension ≥ 1. Let 𝑄 be the Cohen poset on the space 𝑋 with its name 𝑥𝑔𝑒𝑛
̇ for a generic
point in 𝑋. If 𝑥 ∈ 𝑋 is a 𝑄-generic point, the remainder poset in 𝑉[𝑥] consists of all
basic open subsets of 𝑋 which contain some point 𝑦 ∈ 𝑋 such that {𝑥, 𝑦} ∈ Γ; the
ordering is that of inclusion.
In principle, the remainder poset may be empty. We prove two propositions about it.
The first characterizes the membership in the remainder poset; the second shows what
the remainder poset is in fact designed to do.
Proposition 12.3.8. Let 𝑂0 , 𝑂1 ⊂ 𝑋 be open sets, and write 𝐴 = {𝑥0 ∈ 𝑂0 ∶ ∃𝑥1 ∈
𝑂1 {𝑥0 , 𝑥1 } ∈ Γ}. The following are equivalent:
(1) 𝑂0 ⊩ 𝑂1 belongs to the remainder poset;
(2) 𝐴 ⊂ 𝑂0 is dense in 𝑂0 ;
(3) 𝐴 ⊂ 𝑂0 is comeager in 𝑂0 .
Proof. (3) implies (1) as the set 𝐴 is analytic and 𝑂0 forces 𝑥𝑔𝑒𝑛
̇ to belong to every
analytic comeager subsets of 𝑂0 coded in the ground model. (1) implies (2): if (2) failed
then there would be a nonempty open set 𝑂0′ ⊂ 𝑂0 disjoint from 𝐴. By Mostowski ab-
soluteness between 𝑉 and its 𝑄0 -extension, 𝑂0′ ⊩ 𝑂1 does not belong to the remainder
poset and so (1) fails. We are left with the (2)→(3) implication, which uses the assump-
tion that Γ is a closed graph of dimension at least 1.
Let {𝑈𝑛 ∶ 𝑛 ∈ 𝜔} be a countable collection of open dense subsets of 𝑂0 and let
𝑂0′ ⊂ 𝑂0 be a nonempty open set. As the set 𝐴 ⊂ 𝑂0 is analytic, it has the Baire
property, so it is enough to show that the intersection 𝐴 ∩ 𝑂0′ ∩ ⋂𝑛 𝑈𝑛 is nonempty.
By recursion on 𝑛 ∈ 𝜔, build open sets 𝑃0𝑛 ⊂ 𝑂0 and 𝑃1𝑛 ⊂ 𝑂1 so that 𝑃00 = 𝑂0′ and
𝑃10 = 𝑂1 and for all 𝑛 ∈ 𝜔,
• the closure of 𝑃0𝑛+1 is a subset of 𝑃0𝑛 , and it has diameter smaller than 2−𝑛 in
a fixed complete metric for 𝑋, and similarly for the sets 𝑃1𝑛 ;
• there are points 𝑥0𝑛 ∈ 𝑃0𝑛 and 𝑥1𝑛 ∈ 𝑃1𝑛 forming a Γ-edge;
• 𝑃0𝑛+1 ⊂ 𝑈𝑛 .
To start the recursion, find any edge {𝑥00 , 𝑥10 } such that 𝑥00 ∈ 𝑂0′ and 𝑥10 ∈ 𝑂1 ; such an
edge exists by the assumption (2). Now suppose that 𝑃0𝑛 , 𝑥0𝑛 , 𝑃1𝑛 , 𝑥1𝑛 have been found.
By the dimension assumption on the graph, the set 𝐵𝑛 = {𝑥 ∈ 𝑃0𝑛 ∶ ∃𝑦 ∈ 𝑃1𝑛 {𝑥, 𝑦} ∈ Γ}
is somewhere dense in 𝑃0𝑛 . Let 𝑃0𝑛+1 be an open subset of radius smaller than 2−𝑛
whose closure is a subset of 𝑃0𝑛 ∩𝑈𝑛 and such that 𝐵𝑛 ∩𝑃0𝑛 is dense. Let 𝑥0𝑛+1 ∈ 𝐵𝑛 ∩𝑃0𝑛
be an arbitrary point, and let 𝑥1𝑛+1 ∈ 𝑃1𝑛 be a point such that {𝑥0𝑛+1 , 𝑥1𝑛+1 } ∈ Γ holds.
Let 𝑃1𝑛+1 be any neighborhood of 𝑥1𝑛+1 whose closure is a subset of 𝑃1𝑛 and which has
diameter smaller than 2−𝑛 . The recursion step has been performed.
In the end, let 𝑥0 be the limit of 𝑥0𝑛+1 and let 𝑥1 be the limit of 𝑥1𝑛+1 . The limits
exist by the first item of the recursion hypothesis. Then {𝑥0 , 𝑥1 } ∈ Γ holds by the second
item of the recursion hypothesis and 𝑥0 ∈ 𝑂0′ ∩ ⋂𝑛 𝑈𝑛 holds by the last item. (3) of the
claim follows. □
Now let 𝐺 ⊂ 𝑄 be a generic filter and work in 𝑉[𝐺0 ]. Suppose that the remainder poset
𝑅 is nonempty. Any filter 𝐻 ⊂ 𝑅 generic over 𝑉[𝐺] is clearly a filter on 𝑄. It turns out
that this filter is generic over the ground model, as the following key proposition shows.
Note that as the graph Γ is closed, the points 𝑥0 , 𝑥1 ∈ 𝑋 associated with the filters 𝐺, 𝐻
are Γ-related.
Proposition 12.3.9. Let 𝑛 ∈ 𝜔 be a natural number such that Γ has dimension
≥ 𝑛. 𝑄 forces the following. If the remainder poset 𝑅 is nonempty, then the filter on 𝑄𝑛
added by 𝑅𝑛 is generic for 𝑄𝑛 over the ground model.
Proof. Let ⟨𝑂𝑖 ∶ 𝑖 ∈ 𝑛 + 1⟩ be a tuple of open subsets of 𝑋 such that 𝑂𝑛 ⊩ ∀𝑖 ∈
𝑛 𝑂𝑖 ∈ 𝑅.̇ Let 𝐷 ⊂ 𝑄𝑛 be a dense open set; we must find a tuple ⟨𝑃𝑖 ∶ 𝑖 ∈ 𝑛 + 1⟩ such
that for all 𝑖 ∈ 𝑛 + 1 𝑃𝑖 ⊂ 𝑂𝑖 holds, ⟨𝑃𝑖 ∶ 𝑖 ∈ 𝑛⟩ ∈ 𝐷, and 𝑃𝑛 ⊩ ∀𝑖 ∈ 𝑛 𝑃𝑖 ∈ 𝑅.̇ Let
𝐴 = {⟨𝑥𝑖 ∶ 𝑖 ∈ 𝑛 + 1⟩ ∈ ∏𝑖 𝑂𝑖 ∶ ∀𝑖 ∈ 𝑛 𝑥𝑖 Γ 𝑥𝑛 }. Use the initial forcing assumption and
a Mostowski absoluteness argument between 𝑉 and its 𝑄-extension to see that 𝐴 ≠ 0.
Use the dimension assumption to conclude that the projection 𝐵 of 𝐴 into the first 𝑛
coordinates is somewhere dense in ∏𝑖∈𝑛 𝑂𝑖 . Use the assumption that the set 𝐷 ⊂ 𝑄𝑛
is dense to find nonempty open sets 𝑃𝑖 ⊂ 𝑂𝑖 for 𝑖 ∈ 𝑛 such that ⟨𝑃𝑖 ∶ 𝑖 ∈ 𝑛⟩ ∈ 𝐷 and 𝐵
is dense in ∏𝑖 𝑃𝑖 . Let 𝐶 = {𝑥 ∈ 𝑂𝑛 ∶ ∃⟨𝑥𝑖 ∶ 𝑖 ∈ 𝑛⟩ ∈ ∏𝑖∈𝑛 𝑃𝑖 ∀𝑖 ∈ 𝑛 𝑥 Γ 𝑥𝑖 }. By the
dimension assumption again, the set 𝐶 is dense in some nonempty open set 𝑃𝑛 ⊂ 𝑂𝑛 .
By Proposition 12.3.8, for all 𝑖 ∈ 𝑛 𝑃𝑛 ⊩ 𝑃𝑖 ∈ 𝑅; thus, the tuple ⟨𝑃𝑖 ∶ 𝑖 ∈ 𝑛 + 1⟩ is as
required. □
Now we move to balanced forcing and introduce the central definition of this section.
Definition 12.3.10. Let 𝑛 ≥ 2 be a number. Let 𝑃 be a Suslin forcing. A virtual
condition 𝑝 ̄ is 𝑛-Bernstein balanced if in every generic extension 𝑉[𝐺], for every con-
dition 𝑝 ≤ 𝑝,̄ every infinite poset 𝑄 ∈ 𝑉 such that 𝒫(𝑄) ∩ 𝑉 is countable in 𝑉[𝐺], and
every perfect family ℋ ⊂ 𝒫(𝑄) such that each set 𝑎 ⊂ ℋ of size 𝑛 is a collection of
filters mutually generic over 𝑉, there is a filter 𝐻 ∈ ℋ such that every condition in
𝑃 ∩ 𝑉[𝐻] below 𝑝 ̄ is compatible with 𝑝. The poset 𝑃 is 𝑛-Bernstein balanced if there is
a 𝑛-Bernstein balanced virtual condition below every condition in 𝑃.
It is clear that, writing 𝐵𝑛 for the class of 𝑛-Bernstein balanced forcings and 𝐵<𝜔 for the
class of Bernstein balanced forcings, we have 𝐵2 ⊂ 𝐵3 ⊂ ⋯ ⊂ 𝐵<𝜔 . There are several
preservation theorems for the classes of 𝑛-Bernstein forcings which lead to some of the
most attractive results of this book.
Theorem 12.3.11. Let 𝑛, 𝑘 ≥ 2 be numbers. Let Γ be a closed hypergraph on a Polish
space 𝑋 of arity 𝑘 and Komjáth dimension ≥ 𝑛 such that every nonempty open subset of
𝑋 contains a Γ-hyperedge. In cofinally 𝑛-Bernstein balanced extensions of the symmetric
Solovay model, Γ has uncountable chromatic number.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing such that 𝑃 is 𝑛-
from 𝜅; work in 𝑊. Let 𝑝 ∈ 𝑃 be a condition and 𝜏 be a 𝑃-name such that 𝑝 forces 𝜏 to
be a function from 𝑋 to 𝜔. We have to find a Γ-hyperedge 𝑎 and a condition stronger
than 𝑝 which forces 𝜏 ↾ 𝑎 to be constant.
The condition 𝑝 and the name 𝜏 are both definable from parameters in the ground
model and an additional parameter 𝑧 ∈ 2𝜔 . Let 𝑉[𝐾] be an intermediate extension
obtained by a poset of cardinality smaller than 𝜅, containing 𝑧 and such that the poset 𝑃
is 𝑛-Bernstein balanced in 𝑉[𝐾]. Work in the model 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be an 𝑛-Bernstein
balanced virtual condition. Consider the Cohen poset 𝑄00 on the space 𝑋, with its name
𝑥𝑔𝑒𝑛
̇ for the generic element of 𝑋. There must be a poset 𝑅 of cardinality smaller than
𝜅, a 𝑄00 × 𝑅-name 𝜎 for a condition in 𝑃 stronger than 𝑝,̄ a natural number 𝑚 ∈ 𝜔, and
a condition ⟨𝑞, 𝑟⟩ ∈ 𝑄00 × 𝑅 such that ⟨𝑞, 𝑟⟩ ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑝 𝜏(𝑥𝑔𝑒𝑛 ̇ ) = 𝑚.̌
Let 𝑘0 , 𝑘1 ∈ 𝜔 be numbers such that the graph Δ on [𝑋]𝑘0 ∪ [𝑋]𝑘1 connecting
𝑎0 ∈ [𝑋]𝑘0 and 𝑎1 ∈ [𝑋]𝑘1 if 𝑎0 ∪ 𝑎1 ∈ Γ has Komjáth dimension at least 𝑛. Write
𝑋0 = [𝑋]𝑘0 and 𝑋1 = [𝑋]𝑘1 . Let 𝑄0 be the Cohen forcing on 𝑋0 and let 𝑄1 be the Cohen
forcing on 𝑋1 . Note that 𝑄0 adds a 𝑘0 -tuple of mutually Cohen generic points in 𝑋0 .
Thus, the product 𝑄0 × 𝑅𝑘0 adds mutually generic filters 𝐺0𝑖 ⊂ 𝑄00 × 𝑅 for 𝑖 ∈ 𝑘0 . By a
balance argument with 𝑝,̄ the conditions 𝜎/𝐺0𝑖 for 𝑖 ∈ 𝑘0 have a common lower bound;
the name for it will be denoted 𝜎0 . We construct the 𝑄1 × 𝑅𝑘1 -name 𝜎1 for a condition
in 𝑃 in a symmetric way.
Note that ([𝑞]𝑘0 × [𝑞]𝑘1 ) ∩ Δ is a nonempty set by the density assumption on the
hypergraph Γ. By the dimension assumption, there has to be an open set 𝑞0 ⊂ [𝑞]𝑘0
in which the projection of the set ([𝑞]𝑘0 × [𝑞]𝑘1 ) ∩ Δ is dense. Let 𝐺 ⊂ 𝑄0 × 𝑅𝑘0 be a
filter generic over 𝑉[𝐾] such that the first coordinates in the product jointly meet the
condition 𝑞0 ∈ 𝑄0 and the second coordinates meet the condition 𝑟 ∈ 𝑅. Work in
the model 𝑉[𝐾][𝐺]. Let 𝑎0 ∈ [𝑋]𝑘0 be the 𝑄0 -generic set of points in 𝑋. Let 𝑄2 be the
remainder poset of all open sets 𝑂 ⊂ 𝑋1 such that there is 𝑏 ∈ 𝑂 with 𝑎0 ∪𝑏 ∈ Γ, ordered
by inclusion. By Proposition 12.3.8 and the initial choice of the condition 𝑞0 ∈ 𝑄0 ,
[𝑞]𝑘1 ∈ 𝑄2 .
In some further generic extension 𝑉[𝐾][𝐺][𝐿] by a poset of cardinality smaller
than 𝜅, use Proposition 1.7.12 to find a perfect family ℋ of filters on 𝑄1 × 𝑅𝑘1 in finite
tuples generic over the model 𝑉[𝐾][𝐻] such that the 𝑄1 -coordinates meet the condition
[𝑞]𝑘1 and the 𝑅-coordinates meet the condition 𝑟. Work in the model 𝑉[𝐾][𝐺][𝐿]. By
Proposition 12.3.9, for every finite set 𝑐 ⊂ ℋ of size 𝑛, the filters in 𝑐 viewed as filters on
𝑄1 × 𝑅𝑘1 are mutually generic over 𝑉[𝐾]. By the 𝑛-Bernstein balance of the condition
𝑝,̄ there is a filter 𝐻 ∈ ℋ such that the conditions 𝜎0 /𝐺, 𝜎1 /𝐻 ∈ 𝑃 are compatible. Let
𝑎1 ∈ [𝑋]𝑘1 be the 𝑄1 -generic set of points added by the filter 𝐻. By the definition of
the poset 𝑄1 and the assumption that Γ is closed, it follows that 𝑎 = 𝑎0 ∪ 𝑎1 ∈ Γ. By
the forcing theorem applied in the models 𝑉[𝐾][𝐺] and 𝑉[𝐾][𝐻], in the model 𝑊 the
common lower bound of the conditions 𝜎0 /𝐺 and 𝜎1 /𝐻 forces in 𝑃 that 𝜏 ↾ 𝑎 is constant

with value 𝑚. This completes the proof. □
Theorem 12.3.12. Let 𝑛 ≥ 2 be a number. Let 𝑋 be an uncountable Polish field

over a countable field Φ. In cofinally 𝑛-Bernstein balanced extensions of the symmetric
Solovay model, there is no transcendence basis for 𝑋 over Φ.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing such that 𝑃 is 𝑛-

from 𝜅; work in 𝑊. Towards a contradiction, let 𝑝 ∈ 𝑃 be a condition and 𝜏 be a 𝑃-name
such that 𝑝 forces 𝜏 to be a transcendence basis for 𝑋 over Φ.
The condition 𝑝 and the name 𝜏 are both definable from parameters in the ground
model and an additional parameter 𝑧 ∈ 2𝜔 . Let 𝑉[𝐾] be an intermediate extension
obtained by a poset of cardinality smaller than 𝜅, containing 𝑧 and such that the poset
𝑃 is 𝑛-Bernstein balanced in 𝑉[𝐾]. Work in the model 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be an 𝑛-
Bernstein balanced virtual condition. Consider the Cohen poset 𝑄00 on the space 𝑋,
with its name 𝑥𝑔𝑒𝑛 ̇ for the generic element of 𝑋. There must be a poset 𝑅 of cardinality
smaller than 𝜅, a 𝑄00 × 𝑅-name 𝜎 for a condition in 𝑃 stronger than 𝑝,̄ and a name 𝜂 for
a finite subset of 𝑋 such that 𝑄00 × 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝑥𝑔𝑒𝑛 ̇ is in the algebraic
closure of 𝜂 and 𝜂 ⊂ 𝜏. Consider the product (𝑄00 × 𝑅)𝑛 , and the corresponding names
𝜎𝑖 for 𝑖 ∈ 𝑛 of conditions in 𝑃 below 𝑝 ̄ derived from the various coordinates of the
product. By a balance argument (Proposition 5.2.4) with 𝑝,̄ the conditions 𝜎𝑖 are forced
to be compatible; let 𝜒 be the (𝑄00 × 𝑅)𝑛 -name for their common lower bound.
Let 𝑄0 = (𝑄00 )𝑛 , the poset for adding a Cohen-generic point in 𝑋 𝑛 . Let 𝐺 ⊂ 𝑄0 ×𝑅𝑛
be a filter generic over 𝑉[𝐾] and work in the model 𝑉[𝐾][𝐺]. Let 𝑢 ∈ 𝑋 𝑛 be the vector
added by the first coordinates in the product. Let 𝑄1 be the remainder poset of all basic
open sets 𝑂 ⊂ 𝑋 𝑛 such that there is a vector 𝑣 ∈ 𝑂 such that 𝑢 ⋅ 𝑣 = 1, ordered by
inclusion. In some forcing extension 𝑉[𝐾][𝐺][𝐿], let ℋ be a perfect collection of filters
on 𝑄1 × 𝑅𝑛 in finite tuples mutually generic over 𝑉[𝐾][𝐺]. By Example 12.3.6 and
Proposition 12.3.9, each filter 𝐻 ∈ ℋ viewed as a filter on 𝑄0 × 𝑅𝑛 is generic over 𝑉[𝐾],
and moreover, these filters are in 𝑛-tuples mutually generic over 𝑉[𝐾]. As the condition
𝑝 ̄ is 𝑛-Bernstein balanced, there must be a filter 𝐻 ∈ ℋ such that 𝑋 ∩ 𝑉[𝐺] ∩ 𝑉[𝐻] ⊂ 𝑉
and the conditions 𝜒/𝐺 and 𝜒/𝐻 are compatible.
Now, write 𝑣 ∈ 𝑋 𝑛 ∩ 𝑉[𝐾][𝐻] for the point added by the filter 𝐻. For each 𝑖 ∈ 𝑛
let 𝑎𝑖 = 𝜂/𝐺𝑖 where 𝐺𝑖 ⊂ 𝑄00 × 𝑅 is the 𝑖-th coordinate of the filter 𝐺. Similarly, let
𝑏𝑖 = 𝜂/𝐻𝑖 where 𝐻𝑖 ⊂ 𝑄00 × 𝑅 is the 𝑖-th coordinate of the filter 𝐻. Thus, 𝑢(𝑖) is in
the algebraic closure of 𝑎𝑖 and 𝑣(𝑖) is in the algebraic closure of 𝑏𝑖 . Since 𝑢 ⋅ 𝑣 = 1, it
must be the case that 𝑣(𝑛 − 1) is in the algebraic closure of rng(𝑢) ∪ rng(𝑣) ⧵ {𝑣(𝑛 − 1)}.
In other words, 𝑣(𝑛 − 1) is in the algebraic closure of 𝑐 = ⋃𝑖∈𝑛 𝑎𝑖 ∪ ⋃𝑖∈𝑛−1 𝑏𝑖 and
at the same time in the algebraic closure of 𝑏𝑛−1 . By a mutual genericity argument,
𝑏𝑛−1 ∩ 𝑐 ⊂ 𝑉[𝐾], so 𝑣(𝑛 − 1) is not in the algebraic closure of 𝑏𝑛−1 ∩ 𝑐. The exchange
property of the algebraic matroid then implies that the set 𝑏𝑛−1 ∪ 𝑐 is not algebraically
free (Claim 6.3.5).
Finally, the forcing theorem applied in the models 𝑉[𝐾][𝐺] and 𝑉[𝐾][𝐻] shows
that in the model 𝑊, the common lower bound of the conditions 𝜒/𝐺 and 𝜒/𝐻 forces
in 𝑃 that 𝑏𝑛−1 ∪ 𝑐 ⊂ 𝜏. This contradicts the assumption that 𝜏 is forced to be an alge-
braically free set. □
Among the numerous corollaries, we include only the most striking ones.
Example 12.3.13. Every placid Suslin forcing is 2-Bernstein balanced, and every
placid virtual condition is 2-Bernstein balanced. To see this, note that the argument
for Theorem 12.2.8 uses only mutual genericity in pairs in the family ℋ.
Theorem 12.3.12 together with Examples 9.3.4 and 6.3.6 now immediately provide a
major distinction between Hamel bases and transcendence bases:
Corollary 12.3.14. Let 𝑋 be a Borel vector space over a countable field Φ. Let 𝑌 be
an uncountable Polish field with a countable subfield Ψ.
(1) Let 𝑃 be the partial ordering of countable linearly independent subsets of 𝑋. In
the 𝑃-extension of the symmetric Solovay model, 𝑌 has no transcendence basis
over Ψ.
Hamel basis while 𝑌 has no transcendence basis.
We can draw clear distinctions between the logical strength of existence of colorings
for various algebraic hypergraphs on Euclidean spaces. For the following corollary,
recall the respective results of [18] and [92]: the Euclidean plane can be partitioned
into countably many pieces avoiding monochromatic equilateral triangles or isosceles
triangles, respectively. The latter result is much harder than the former and the two
are separated by almost thirty years. We have:
Corollary 12.3.15. Let Γ be the hypergraph in ℝ2 containing triples consisting of
vertices of equilateral triangles. Let Δ be the corresponding isosceles triangle hypergraph
in ℝ2 .
(1) Let 𝑃 be the coloring poset for Γ as in Example 8.2.10. In the 𝑃-extension of the
symmetric Solovay model, the chromatic number of Δ is uncountable.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, chromatic
number of Γ is countable, while the chromatic number of Δ is uncountable.
Proof. The poset 𝑃 is placid by Example 9.3.11. It does not add a coloring for Δ
by Example 12.3.4 and Theorem 12.3.11. □
We can also see the effect of dimension on coloring Euclidean distance graphs. In di-
mension one, coloring of these graphs is readily found from an existence of a selector
in a countable Borel equivalence relation. Dimension two was handled in [28], dimen-
sion three in [29] twenty years later, and the general case was resolved in [64]. We
have:
Corollary 12.3.16. Let Γ1 be the graph on ℝ connecting points with rational dis-
tance, and let Γ2 be a corresponding graph on ℝ2 .
(1) Let 𝑃 be the poset of countable partial Γ1 -colorings with Vitali-invariant domain.
In the 𝑃-extension of the symmetric Solovay model, Γ2 has uncountable chro-
matic number.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, Γ1 has
countable chromatic number, yet Γ2 has uncountable chromatic number.
Proof. The poset 𝑃 is placid. In view of Theorem 12.3.11, it is enough to produce
a closed subgraph Γ2′ of Γ2 which has Komjáth dimension two, and such that every
nonempty open subset of ℝ2 contains a Γ2′ -edge. To this end, choose a set 𝑎 ⊂ ℚ of
positive rationals converging to 0 and let Γ2′ connect points 𝑥0 , 𝑥1 ∈ ℝ2 if their Eu-
clidean distance belongs to 𝑎. Then the graph Γ2′ is closed, and every nonempty open
subset of ℝ2 contains a Γ2′ -edge. The computation of dimension of Γ2′ follows closely
Example 12.3.3. □
Example 12.3.17. Let Γ be a Borel graph on a Polish space 𝑋 which does not con-
tain a homomorphic injective copy of 𝐾𝑛,𝜔1 . Let 𝑃 be the coloring poset for Γ as defined
in Definition 8.1.1. Then 𝑃 is 𝑛 + 1-Bernstein balanced and every balanced virtual con-
dition is 𝑛 + 1-Bernstein balanced. To see this, observe that the argument for Exam-
ple 12.2.11 uses only mutual genericity for 𝑛 + 1-tuples.
Corollary 12.3.18. Let Γ2 be the graph on ℝ2 connecting points with rational dis-
tance, and let Γ3 be a corresponding graph on ℝ3 .
(1) Let 𝑃 be the coloring poset for Γ2 . In the 𝑃-extension of the symmetric Solovay
model, Γ3 has uncountable chromatic number.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, Γ2 has
countable chromatic number, yet Γ3 has uncountable chromatic number.
Proof. The graph Γ2 does not contain an injective copy of 𝐾2,𝜔1 . Therefore, the
poset 𝑃 is 3-Bernstein balanced. In view of Theorem 12.3.11, it is enough to produce
a closed subgraph Γ3′ of Γ3 which has Komjáth dimension three, and such that every
nonempty open subset of ℝ3 contains a Γ3′ -edge. To this end, choose a set 𝑎 ⊂ ℚ of
positive rationals converging to 0 and let Γ3′ connect points 𝑥0 , 𝑥1 ∈ ℝ3 if their Eu-
clidean distance belongs to 𝑎. Then the graph Γ3′ is closed, and every nonempty open
subset of ℝ3 contains a Γ3′ -edge. The computation of dimension of Γ3′ follows closely
Example 12.3.3. □
The extension of this result to higher dimensions requires building new partial or-
ders, and we refrain from it at this point. The final example of this section shows that
Berstein balance does not imply 𝑛-Bernstein balance for any 𝑛 ∈ 𝜔.
Example 12.3.19. Let 𝑋 be a Polish field with a countable subfield Φ. Let 𝑃 be
the poset of countable algebraically independent subsets of 𝑋. The poset 𝑃 is Bernstein
balanced by Example 12.2.12 but not 𝑛-Bernstein balanced for any number 𝑛 in view
of Theorem 12.3.12.
12.4. Existence of generic filters

Let 𝑃 be a Suslin forcing. In the presence of suitable large cardinal axioms, one can
replace the 𝑃-extension of the symmetric Solovay model with the 𝑃-extension of the
model 𝐿(ℝ). A standard absoluteness argument shows that validity of 𝚷21 sentences
transfers from the former to the latter, and so the latter can serve as a vehicle for most
independence results presented in this book. A natural question arises: does there exist
a filter 𝐺 ⊂ 𝑃 which is generic over 𝐿(ℝ)?
The answer is an easy yes if the poset 𝑃 in question is 𝜎-closed and the Continuum
Hypothesis holds, since then one can meet the dense subsets of the poset 𝑃 appearing in
the model 𝐿(ℝ) one by one in a straightforward transfinite recursion argument. An in-
teresting feature of Bernstein balance is that it guarantees the existence of generic filters
12.4. EXISTENCE OF GENERIC FILTERS 293
over inner models such as 𝐿(ℝ) independently of cardinal arithmetic and assumptions
such as the Continuum Hypothesis, purely as a consequence of large cardinal axioms.
Definition 12.4.1. Let 𝑃 be a Suslin forcing.
(1) If 𝐵 ⊂ 𝑃 is a set and 𝑝 ∈ 𝑃 then write 𝑝 ≤ Π𝐵 to denote that 𝑝 is stronger
than all conditions in 𝐵;
(2) if 𝐵 ⊂ 𝑃 then 𝜏𝐵 is the Coll(𝜔, 𝐵)-name for the analytic set {𝑝 ∈ 𝑃 ∶ 𝑝 ≤ Π𝐵}.
(3) We say that 𝑃 is soft if for every centered set 𝐵 ⊂ 𝑃 of cardinality less than 𝔠
there is a centered set 𝐶 ⊃ 𝐵 such that the pair ⟨Coll(𝜔, 𝐶), 𝜏𝐶 ⟩ is a Bernstein
Note that a soft poset 𝑃 must have the following centeredness property: if 𝐵 ⊂ 𝑃 is
a countable centered set, then 𝐵 has a lower bound. To see this, just extend it into a
Bernstein balanced centered set 𝐶 ⊂ 𝑃, note that in the Coll(𝜔, 𝐶)-extension, the set 𝐶
has a lower bound by the definition, and by a Mostowski absoluteness argument the
set 𝐵 must have a lower bound already in the ground model.
Theorem 12.4.2. Suppose that there is a weakly compact Woodin cardinal. Suppose
that 𝑃 is a soft Suslin forcing. Then there is a filter 𝐺 ⊂ 𝑃 which is generic over the model
𝐿(ℝ).
Proof. Let 𝐵 ⊂ 𝑃 be a centered set of size < 𝔠, and let 𝐷 ⊂ 𝑃 be an open dense set
in 𝐿(ℝ). We will show that there is a condition 𝑝 ∈ 𝐷 such that {𝑝} ∪ 𝐵 is a centered
set. The theorem then follows by a straightforward transfinite recursion construction,
given the fact that there are only 𝔠-many subsets of 𝑃 in the model of 𝐿(ℝ) as soon
as a measurable cardinal exists. So, let 𝐶 ⊃ 𝐵 be a Bernstein balanced centered set
witnessing the definitory properties of the soft poset 𝑃. The set 𝐷 is definable from a
real parameter in the model 𝐿(ℝ# ). Below, we identify the set 𝐷 with its definition.
Let 𝜅 be a weakly compact Woodin cardinal, let ℚ𝜅 be the associated countably
based stationary tower, let 𝐾 ⊂ ℚ𝜅 be a generic filter and work in the model 𝑉[𝐾].
Note that 𝜅 = ℵ1 and every element of 2𝜔 is generic over 𝑉 by a poset smaller than 𝜅.
Consider the poset 𝑅 = Coll(𝜔, 𝐶) and use Proposition 1.7.12 to find a perfect collection
{𝐻𝑦 ∶ 𝑦 ∈ 2𝜔 } of filters on 𝑅 pairwise mutually generic over the ground model 𝑉. Use
the perfect set property for analytic sets to see the following:
Claim 12.4.3. For every finite set 𝑎 ⊂ 𝑃 such that 𝑎 ∪ 𝐶 is a centered set, the set
𝑌𝑎 = {𝑦 ∈ 2𝜔 ∶ ∃𝑝 ∈ 𝑉[𝐻𝑦 ] 𝑝 ≤ Π𝐶 and the set {𝑝} ∪ 𝑎 has no common lower bound} is
countable.
Let 𝑗 ∶ 𝑉 → 𝑀 be the generic ultrapower associated with 𝐾; the model 𝑀 is closed
under 𝜔-sequences. Work in the model 𝑀. The closure properties of the model 𝑀
guarantee that the following objects belong to the model 𝑀: the collection {𝐻𝑦 ∶ 𝑦 ∈
2𝜔 }, the collection {𝑃 ∩ 𝑉[𝐻𝑦 ] ∶ 𝑦 ∈ 𝑌 }, and the map 𝑎 ↦ 𝑌𝑎 as 𝑎 varies over finite
subsets of 𝑃 such that 𝑎 ∪ 𝐶 is a centered set. Also, the model 𝑀 satisfies the statement
that the range of this map consists of countable sets. Looking at the set 𝑗(𝐶) in the
model 𝑀, we see that |𝑗(𝐶)| < 𝔠, and for each finite set 𝑎 ⊂ 𝑗(𝐶) the set 𝑎 ∪ 𝐶 ⊂ 𝑗(𝐶)
is centered, and therefore the set 𝑌𝑎 ⊂ 2𝜔 is countable. By a cardinality argument, the
set 2𝜔 ⧵ ⋃{𝑌𝑎 ∶ 𝑎 ∈ [𝑗(𝐶)]<ℵ0 } is nonempty; let 𝑦 be one of its elements.
Work in the model 𝑉[𝐻𝑦 ]. Note that the theory of 𝐿(ℝ# ) with real parameters is
invariant under forcing and so the set 𝐷 ⊂ 𝑃 is still open dense in 𝑉[𝐻𝑦 ]. Thus, there
must be a condition 𝑝 ∈ 𝐷 ∩ 𝑉[𝐻𝑦 ], 𝑝 ≤ Π𝐶. By the choice of the point 𝑦 ∈ 𝑌 , the

set {𝑝} ∪ 𝑗(𝐶) is centered. Thus 𝑀 ⊧ there is a condition 𝑝 ∈ 𝐷 such that {𝑝} ∪ 𝑗(𝐶) is
centered. By the elementarity of the embedding 𝑗, 𝑀 ⊧ there is a condition 𝑝 ∈ 𝐷 such
that {𝑝} ∪ 𝐶 is centered; in particular, {𝑝} ∪ 𝐵 is centered as desired. □
The following examples all use the Woodin cardinal assumption which is not spelled
out.
𝑋. The poset 𝑃𝒦 is soft. To see this, review the proof of the last sentence in Theo-
rem 6.2.3 and note that one can start from any centered set of size < 𝔠 instead of a
single condition. The resulting balanced virtual condition is Bernstein balanced by
Theorem 12.2.8 and Example 9.3.4.
The following two examples are just special cases of the previous one.
Example 12.4.5. Let 𝑋 be a Polish vector space over a countable field. There is
a basis generic over 𝐿(ℝ) for the poset 𝑃 of Example 6.3.6. This follows from Theo-
rem 12.4.2 and Example 6.3.6: every centered subset of 𝑃 yields a linearly independent
set, which can be extended to a maximal linearly independent set. A maximal linearly
independent set yields a Bernstein balanced virtual condition.
Example 12.4.6. Let Γ be a Borel graph on a Polish space 𝑋. There is a maximal
acyclic subgraph Δ ⊂ Γ generic over 𝐿(ℝ) for the poset 𝑃 of Example 6.3.7.This follows
from Theorem 12.4.2 and Example 6.3.7: every centered subset of 𝑃 yields an acyclic
subset of Γ, which can be extended to a maximal acyclic set. A maximal acyclic set
yields a Bernstein balanced virtual condition.
Our quintessential example of a non-fragmented Borel matroid yields a soft Suslin forc-
ing as well.
Example 12.4.7. Let 𝑋 be a Polish field and Φ its countable subfield. There is a
transcendence basis over 𝐿(ℝ) for the poset 𝑃 of Example 6.3.10. This follows from
Theorem 12.4.2 and Example 6.3.10: every centered subset of 𝑃 yields an algebraically
independent set, which can be extended to a maximal algebraically independent set.
A maximal algebraically independent set yields a Bernstein balanced virtual condition
by Example 12.2.12.
There are many quotient simplicial complex forcings which are soft; we provide two
representative examples.
Example 12.4.8. Let 𝐸 be a pinned Borel equivalence relation on a Polish space 𝑋.
There is a linear ordering on the 𝐸-quotient space generic over 𝐿(ℝ) for the poset 𝑃 of
Example 8.7.5. This follows from Theorem 12.4.2 and Theorem 8.7.4: every centered
subset of 𝑃 yields a partial ordering on the 𝐸-quotient space, which can be extended to
a linear order. A linear ordering on the 𝐸-quotient space yields a Bernstein balanced
virtual condition, by the pinned assumption on 𝐸 and Example 12.2.16.
Example 12.4.9. Let 𝐸, 𝐹 be pinned Borel equivalence relations on respective Pol-
ish spaces 𝑋, 𝑌 with uncountably many classes each. There is an injection from the
𝐸-quotient to the 𝐹-quotient space generic over 𝐿(ℝ) for the poset of Definition 6.4.1.
This follows from Theorem 12.4.2, Theorem 6.4.2, and Example 12.2.18: every centered
subset of 𝑃 of size < 𝔠 yields a partial injection from the 𝐸-quotient to the 𝐹-quotient
space and also a set of 𝐹-classes which are the forbidden values, both of size < 𝔠. A
counting argument provides a total injection from the 𝐸-quotient to the 𝐹-quotient
space extending the given one and avoiding the given set of forbidden values. Such an
injection yields a Bernstein balanced virtual condition by Example 12.2.18.
Many other examples can be produced by the observation that the class of soft forcings
is closed under countable product. The nonexamples are perhaps more interesting
than the examples.
Example 12.4.10. Let 𝑃 be the 𝒫(𝜔) modulo finite poset. It is not Bernstein bal-
anced by Theorem 12.2.3 above. The 𝑃-extension of 𝐿(ℝ) contains a Ramsey ultrafilter
on 𝜔, in particular a P-point. At the same time, it is consistent [95] and occurs in the
product Silver model [19] that there are no P-points on 𝜔. In such circumstances, there
cannot be a filter on 𝑃 generic over 𝐿(ℝ).
Example 12.4.11. Let 𝑃 be the Lusin poset of Definition 8.9.5. It is not Bernstein
balanced by Theorem 12.2.6 above. The 𝑃-extension of 𝐿(ℝ) contains a Lusin subset of
2𝜔 . At the same time, the negation of Martin’s Axiom and the negation of the Contin-
uum Hypothesis implies that every subset 2𝜔 of size ℵ1 is meager and so no Lusin set
exists. In such circumstances, there cannot be a filter on 𝑃 generic over 𝐿(ℝ).
Example 12.4.12. Consider the clopen graph Γ on 2𝜔 connecting points 𝑥0 ≠ 𝑥1
if the smallest 𝑛 ∈ 𝜔 such that 𝑥0 (𝑛) ≠ 𝑥1 (𝑛) is even. Let 𝑃 be the balanced poset
of Example 8.9.3. It is not Bernstein balanced by Example 12.2.20 above. In the 𝑃-
extension of 𝐿(ℝ), there is an uncountable set 𝐴 ⊂ 2𝜔 such that every Γ-clique and
every Γ-anticlique in it is countable. Now, since the graph Γ is clopen, closures of both
Γ-cliques and Γ-anticliques are cliques and anticliques respectively. Thus, the stated
property of 𝐴 holds also in 𝑉. At the same time, it is consistent that OCA holds in
𝑉 [104]. In such circumstances, every uncountable subset of Γ must contain either a
Γ-clique or an uncountable Γ-anticlique and therefore a 𝑃-generic filter over 𝑉 cannot
exist.
Example 12.4.13. Let 𝑃 be the balanced poset for adding a cofinal Kurepa family
on 2𝜔 as in Definition 8.5.2. The poset 𝑃 is placid, but not soft: the balanced virtual
conditions of 𝑃 are not obtained as lower bounds of filters, cf. Theorem 8.5.3. To obtain
a model of ZFC plus large cardinals in which there is no 𝑃-generic filter over 𝐿(ℝ), a
conjunction of results of [53] and [76] yields a model of ZFC in which |2𝜔 | = ℵ𝜔+1
and the generalized Chang’s conjecture (ℵ𝜔+1 , ℵ𝜔 ) → (ℵ1 , ℵ0 ) holds. In such circum-
stances, there is no cofinal Kurepa family on 2𝜔 , and so no filter on 𝑃 generic over
𝐿(ℝ). Unlike the previous examples, the construction of the model of ZFC begins with
a 2-huge cardinal, a very significant large cardinal hypothesis.
The classes of Bernstein balanced and soft Suslin forcings do not coincide. One so-
phisticated instance of this phenomenon is the Kurepa family poset from the previous
example. Also, the more common quotient simplicial complex forcings of Sections 6.4
or 8.7 are Bernstein balanced but not soft, as in them the balanced virtual conditions are
not just lower bounds of filters, but need to take into account some information about
the virtual quotient spaces concerned. This leads to the following question about the
existence of generic filters for a particularly simple Bernstein balanced Suslin forcing
which is not soft.
Question 12.4.14. (In the context of ZFC+suitable large cardinal assumption.) Is

there a tournament on the 𝔽2 -quotient space which is generic over 𝐿(ℝ) for the poset
of Example 8.7.6?
We conclude this section with a mutual genericity result for Bernstein balanced and
perfectly balanced forcings.
Theorem 12.4.15. Let 𝜅 be a weakly compact Woodin cardinal. Let 𝑃0 , 𝑃1 be 𝜎-closed
Suslin forcings such that
(1) 𝑃0 , 𝑃1 are ℵ0 -tethered;
(2) every balanced virtual condition in 𝑃0 is perfectly balanced;
(3) every balanced virtual condition in 𝑃1 is Bernstein balanced.
If 𝐺0 ⊂ 𝑃0 and 𝐺1 ⊂ 𝑃1 are filters (in 𝑉) separately generic over 𝐿(ℝ), then they are
mutually generic over 𝐿(ℝ).
Proof. We start with a preliminary observation. Let 𝑝0̄ be the virtual condition
in 𝑃0 consisting of a collapse name for the set of all lower bounds of the filter 𝐺0 ; let
𝑝1̄ be defined similarly. By the 𝜎-closure assumption, both 𝑝0̄ , 𝑝1̄ are nonzero condi-
tions. Since the filter 𝐺0 is generic over 𝐿(ℝ), for every analytic set 𝐴 ⊂ 𝑃0 there is a
condition in 𝐺0 which is either incompatible with all elements of 𝐴 or is stronger than
some element of 𝐴. By the ℵ0 -tether of the poset 𝑃0 , it must then be the case that 𝑝0̄
is a balanced virtual condition in 𝑃0 . By the same reasoning, 𝑝1̄ is a balanced virtual
condition in 𝑃1 , and it is even Bernstein balanced by the assumption (3).
Now, let 𝑋 be any uncountable Polish space. In view of Proposition 1.7.9 applied
in the model 𝐿(ℝ), it is enough to show that for any two disjoint sets 𝐴0 , 𝐴1 ⊂ 𝑋 in
the respective models 𝐿(ℝ)[𝐺0 ], 𝐿(ℝ)[𝐺1 ], there is a set 𝐵 ⊂ 𝑋 in 𝐿(ℝ) containing 𝐴1
and disjoint from 𝐴0 . To this end, let 𝜏0 , 𝜏1 be respective 𝑃0 , 𝑃1 -names in 𝐿(ℝ) such that
𝐴0 = 𝜏0 /𝐺0 and 𝐴1 = 𝜏1 /𝐺1 . The names 𝜏0 , 𝜏1 can be viewed as sets of reals, and so each
has a definition in 𝐿(ℝ) from real and ordinal parameters; below, we will evaluate them
in other models using these definitions. We also evaluate 𝑃0 , 𝑃1 using their definitions.
Write ⊩0 for the forcing relation of 𝑃0 and ⊩1 for the forcing relation of 𝑃1 .
Let 𝐻 ⊂ ℚ𝜅 be a generic filter. Let 𝑗 ∶ 𝑉 → 𝑀 be the associated generic ultrapower
and work in the model 𝑀. Note that 𝐺1 ⊂ 𝑗(𝐺1 ) is a countable set in the model 𝑀 and
by the 𝜎-closure assumption on the poset 𝑃1 , the filter 𝑗(𝐺1 ) must contain a lower bound
of 𝐺1 . Consider the set 𝐵 = {𝑥 ∈ 𝑋 ∶ ∃𝑝 ∈ 𝑃1 𝑝 is a lower bound of the filter 𝐺1 and
𝑝 ⊩1 𝑥̌ ∈ 𝜏1 }. Clearly, the set 𝐵 ⊂ 𝑋 belongs to (𝐿(ℝ))𝑀 and it contains the set 𝑗(𝐴1 ).
By the elementarity of the embedding 𝑗, it will be enough to show that 𝐵 is disjoint
from the set 𝑗(𝐴0 ).
To see this, we prove the following claim, which is also a statement of the model
𝑀. Call a Borel set 𝐶 ⊂ 𝑋 positive if for every condition 𝑝1 ∈ 𝑃1 which is a lower bound
of the filter 𝐺1 , 𝑝1 ⊩1 𝐶 ∩𝜏1 ≠ 0. By the forcing theorem applied to 𝑗(𝐺1 ), 𝐶 ∩𝑗(𝐴1 ) ≠ 0
holds for every positive Borel set 𝐶. Clearly, the collection of positive Borel sets is in
(𝐿(ℝ))𝑀 .
Claim 12.4.16. If 𝑝0 ∈ 𝑃0 is a condition which is a lower bound of the filter 𝐺0 and
𝑥 ∈ 𝐵 is a point such that 𝑝0 ⊩0 𝑥̌ ∈ 𝜏0 , then there exist a condition 𝑝0′ ≤ 𝑝0 and a
positive Borel set 𝐶 ⊂ 𝑋 such that 𝑝0′ ⊩0 𝐶 ⊂ 𝜏0 .
The theorem immediately follows, as we now show. By the claim and the genericity
of the filter 𝑗(𝐺0 ) over (𝐿(ℝ))𝑀 , there must be in 𝑗(𝐺0 ) either a condition which forces
𝐵 ∩ 𝜏0 = 0 or a condition which forces 𝐶 ⊂ 𝜏0 for some Borel positive set 𝐶 ⊂ 𝑋.

However, the latter alternative means that 𝑗(𝐴0 ) ∩ 𝑗(𝐴1 ) ≠ 0, contradicting our initial
assumptions on 𝐴0 , 𝐴1 . The former alternative confirms that the set 𝐵 separates 𝑗(𝐴0 )
and 𝑗(𝐴1 ) as required.
To prove the claim, fix 𝑝0 ∈ 𝑃0 and 𝑥 ∈ 𝑋 as in the assumption. In view of the fact
that the reals of the model 𝑀 are the reals of some symmetric Solovay model derived
from 𝜅 (Fact 1.7.20(3)), in the ground model there must be a poset 𝑄 of size < 𝜅 and
𝑄-names 𝜎0 , 𝜎1 , 𝜂 for conditions in 𝑃0 , 𝑃1 and a point in 𝑋 respectively such that 𝑄 forces
that 𝜎0 is a lower bound of 𝐺0 , 𝜎1 is a lower bound of 𝐺1 and Coll(𝜔, < 𝜅) ⊩ 𝜎0 ⊩0 𝜂 ∈
𝜏0 and Coll(𝜔, < 𝜅) ⊩ 𝜎1 ⊩1 𝜂 ∈ 𝜏1 . Moreover, there has to be a filter 𝐾 ⊂ 𝑄 generic
over 𝑉 such that 𝑝0 = 𝜎0 /𝐾 and 𝑥 = 𝜂/𝐾. Now, let 𝐻 ⊂ Coll(𝜔, 𝒫(𝑄) ∩ 𝑉) be a filter in
𝑀 mutually generic over 𝑉 with the filter 𝐾.
Work in the model 𝑉[𝐻]. Use Proposition 1.7.12 to find a continuous function
𝑦 ↦ 𝐻𝑦 which to each element 𝑦 ∈ 2𝜔 assigns a filter 𝐻𝑦 ⊂ 𝑄 so that for every finite
set 𝑎 ⊂ 2𝜔 , the filters {𝐻𝑦 ∶ 𝑦 ∈ 𝑎} are mutually generic over 𝑉. For every element
𝑦 ∈ 2𝜔 , write 𝑝0𝑦 = 𝜎0 /𝐻𝑦 , 𝑝1𝑦 = 𝜎1 /𝐻𝑦 , and 𝑥𝑦 = 𝜂/𝐻𝑦 . Since the conditions
𝑝0𝑦 ∈ 𝑃0 are all stronger than the balanced virtual condition 𝑝0̄ and they are found in
mutually generic models, each finite set of them has a lower bound as in Claim 12.1.4.
By the perfectness assumption on the poset 𝑃0 , the model 𝑉[𝐻] contains a perfect set
𝐷 ⊂ 2𝜔 and a condition 𝑟 ∈ 𝑃0 which is stronger than all 𝑝0𝑦 for all 𝑦 ∈ 𝐷. Since both
conditions 𝑝0 , 𝑟 ∈ 𝑃0 are stronger than the balanced virtual condition 𝑝0̄ and are found
in mutually generic models, they are compatible with a lower bound 𝑝0′ .
Now, consider the set {𝑝1𝑦 ∶ 𝑦 ∈ 𝐷} and the perfect set 𝐶 = {𝑥𝑦 ∶ 𝑦 ∈ 𝐷}. By the
Bernstein balance of the virtual condition 𝑝1̄ , every condition 𝑝1 ∈ 𝑃1 which is a lower
bound of the filter 𝐺1 is compatible with 𝑝1𝑦 for all but countably many points 𝑦 ∈ 𝐷.
As a result, 𝐶 ⊂ 𝑋 is a positive Borel set. The initial choice of the name 𝜂 also implies
that 𝑝0′ ⊩ 𝐶 ⊂ 𝜏0 . The claim has just been proved. □
Example 12.4.17. Suppose that there is a weakly compact Woodin cardinal. Let
𝑃0 be the poset of infinite subsets of 𝜔 ordered by inclusion, and let 𝑃1 be the poset
of countable subsets of ℝ linearly independent over ℚ ordered by reverse inclusion.
Both posets are ℵ0 -tethered by Examples 10.3.8 and 10.3.1 respectively The poset 𝑃0
is perfectly balanced by Example 12.1.9 and every virtual balanced condition in 𝑃1 is
Bernstein balanced by Examples 12.2.8, 9.3.4, and 6.3.6. Suppose that 𝑈 is a Ramsey
ultrafilter on 𝜔. Example 12.4.5 shows that there is a Hamel basis 𝐵 ⊂ ℝ for reals over
rationals which is generic over 𝐿(ℝ) for the poset 𝑃1 As is well-known [32], the filter 𝑈 is
𝐿(ℝ)-generic for 𝑃0 . Theorem 12.4.15 now shows that in fact 𝑈 is even 𝐿(ℝ)[𝐵]-generic
for the poset 𝑃0 as well.
CHAPTER 13
The arity divide
13.1. 𝑚, 𝑛-centered and balanced forcings

In this chapter, we develop a tool which is particularly useful for ruling out com-
binatorial objects with high degree of organization. The following notion is central:
Definition 13.1.1. Let 𝑃 be a Suslin forcing and 𝑛 ∈ 𝑚 be numbers.
(1) A virtual condition 𝑝 ̄ in 𝑃 is 𝑚, 𝑛-balanced if in every generic extension, when-
ever {𝐻𝑖 ∶ 𝑖 ∈ 𝑚} are filters generic over 𝑉 such that for every set 𝑎 ⊂ 𝑚 of
size 𝑛 the filters {𝐻𝑖 ∶ 𝑖 ∈ 𝑎} are mutually generic over 𝑉, if 𝑝𝑖 ≤ 𝑝 ̄ are condi-
tions in 𝑃 in 𝑉[𝐻𝑖 ], then the set {𝑝𝑖 ∶ 𝑖 ∈ 𝑚} has a common lower bound in
𝑃.
(2) The poset 𝑃 is 𝑚, 𝑛-balanced if for every condition 𝑝 ∈ 𝑃 there is a 𝑚, 𝑛-
balanced virtual condition 𝑝 ̄ ≤ 𝑝.
As an initial example, let 𝑃 be the poset of linear orderings on countable sets of 𝔼0 -
classes, ordered by reverse extension. The balanced virtual conditions are classified by
linear orderings of the 𝔼0 -quotient space. Each such ordering 𝑝 ̄ is in fact 𝑚, 2-balanced
for every 𝑚 ∈ 𝜔. To see this, in some ambient forcing extension let 𝑉[𝐺𝑖 ] for 𝑖 ∈ 𝑚
be generic extensions which are pairwise mutually generic, and let 𝑝𝑖 ∈ 𝑉[𝐺𝑖 ] be a
condition stronger than 𝑝 ̄ for each 𝑖 ∈ 𝑚. The domains of the linear orderings 𝑝𝑖
pairwise intersect in the set of ground model 𝔼0 -classes; on this set, the orderings 𝑝𝑖
agree and yield the ordering 𝑝.̄ Therefore, it is possible to find a common linearization
of ⋃𝑖 𝑝𝑖 , which is their common lower bound.
Sometimes, a much simpler notion makes an appearance:
Definition 13.1.2. Let 𝑛 ∈ 𝑚 be numbers. A poset 𝑃 is 𝑚, 𝑛-centered if whenever
𝑎 ⊂ 𝑃 is a set of size 𝑚 such that any subset of 𝑎 of size 𝑛 has a common lower bound,
then 𝑎 has a common lower bound.
As an initial example, let 𝑃 be the partial order of all tournaments on countable
sets of 𝔼0 -classes, ordered by reverse inclusion. In it, every countable set of pairwise
compatible conditions has a common lower bound. It is immediately clear that every
balanced poset which is 𝑚, 𝑛-centered is also 𝑚, 𝑛-balanced and each balanced virtual
condition in it is 𝑚, 𝑛-balanced. An important part of this chapter is devoted to detect-
ing distinctions between 𝑚, 𝑛-balanced and 𝑚, 𝑛-centered forcings. Here, we restrict
ourselves to two initial observations. Note that 𝑚, 𝑛-centeredness (unlike the corre-
sponding balance notion) is 𝚷12 and therefore absolute between all generic extensions.
Note also that 𝑚, 𝑛-centeredness is a combinatorial (as opposed to forcing) property
of the the poset, in the sense that one can have two analytic dense subsets 𝑄0 , 𝑄1 of
a given Suslin forcing 𝑃 such that 𝑄0 is 𝑚, 𝑛-centered while 𝑄1 is not. (Note that in
299
300 13. THE ARITY DIVIDE
any nonatomic poset 𝑃 one can find three pairwise incompatible conditions 𝑝0 , 𝑝1 , 𝑝2
and add to the poset the suprema 𝑞𝑖𝑗 of conditions 𝑝𝑖 and 𝑝𝑗 for any pair {𝑖, 𝑗} ⊂ 3 of
distinct indices. Then 𝑞0 , 𝑞1 , 𝑞2 is a collection of three pairwise compatible conditions
with no common lower bound.) On the other hand, 𝑚, 𝑛-balance is decidedly a forcing
property of posets.
As a final remark, observe that both 𝑚, 𝑛-balance and 𝑚, 𝑛-centeredness are prop-
erties preserved by countable support product. Thus, the numerous independence re-
sults in this chapter can be combined.
13.2. Preservation theorems

The main reason for considering the 𝑚, 𝑛-balance is that it rules out discontinu-
ous homomorphisms between Polish groups in balanced extensions of the symmetric
Solovay model. One way of doing that is to prove that in the given model of ZF+DC,
the chromatic number of the Hamming graph ℍ2 is not two (say using Theorem 11.4.5
or 11.2.2), and then use a result of [89] to show that in ZF+DC this rules out discon-
tinuous homomorphisms. The following theorem works in many cases which are not
treatable using the chromatic number of the Hamming graph. Note that a nonprincipal
ultrafilter on 𝜔 yields in ZF a discontinuous homomorphism from 2𝜔 to 2; thus, ruling
out discontinuous homomorphisms automatically rules out nonprincipal ultrafilters
on 𝜔 as well.
The following theorems are stated using Convention 1.7.18.
Theorem 13.2.1. Let 𝑛 ∈ 𝜔 be a number. In cofinally 𝑛+1, 𝑛-balanced extensions of
the symmetric Solovay model, all homomorphisms between Polish groups are continuous.
Proof. Suppose that 𝜅 is an inaccessible cardinal. Suppose that 𝑃 is a Suslin
forcing which is is 𝑛 + 1, 𝑛-balanced cofinally below 𝜅. Let 𝑊 be a symmetric Solo-
vay model derived from 𝜅 and work in 𝑊. Suppose towards a contradiction that the
conclusion of the theorem fails: thus, there are Polish groups Γ, Δ, a condition 𝑝 ∈
𝑃 and a 𝑃-name 𝜏 such that 𝑝 ⊩ 𝜏 ∶ Γ → Δ is a discontinuous homomorphism.
Both 𝑝 and 𝜏 must be definable in 𝑊 from parameters in the ground model and some
point 𝑧 ∈ 2𝜔 . Let 𝑉[𝐾] be some intermediate extension of 𝑉 by a poset of cardinality
smaller than 𝜅 such that 𝑧 ∈ 𝑉[𝐾] and 𝑃 is 𝑛 + 1, 𝑛-balanced in 𝑉[𝐾]. Work in the
model 𝑉[𝐾].
Let 𝑝 ̄ ≤ 𝑝 be a 𝑛 + 1, 𝑛-balanced virtual condition. Consider the poset 𝑃Γ adding a
generic element 𝛾𝑔𝑒𝑛̇ of the group Γ. The following is a key claim:
Claim 13.2.2. 𝑃Γ forces that there are disjoint basic open sets 𝑂0 , 𝑂1 ⊂ Δ such that
Coll(𝜔, < 𝜅) ⊩ ∃𝑝0 ≤ 𝑝 ̄ 𝑝0 ⊩𝑃 𝜏(𝛾𝑔𝑒𝑛
̇ ) ∈ 𝑂0 and ∃𝑝1 ≤ 𝑝 ̄ 𝑝1 ⊩ 𝜏(𝛾𝑔𝑒𝑛̇ ) ∈ 𝑂1 .
Proof. Suppose towards a contradiction that 𝑞 ∈ 𝑃Γ forces the opposite. Then,
𝑞 forces that in the Coll(𝜔, < 𝜅)-extension there is a unique point 𝛿 ∈ Δ such that
there is a condition 𝑝′ ≤ 𝑝 ̄ in the poset 𝑃 forcing 𝜏(𝛾𝑔𝑒𝑛
̇ ) = 𝛿. Since the point 𝛿 is in
the symmetric Solovay model definable from 𝜏, 𝑝,̄ and 𝛾𝑔𝑒𝑛 ̇ , it must belong to the 𝑃Γ -
̇
extension, and there is a 𝑃Γ -name 𝛿 for it. Note that then, 𝑞 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩𝑃
𝛿 ̇ = 𝜏(𝛾𝑔𝑒𝑛
̇ ).
Now, pass to the symmetric Solovay model 𝑊 and consider the set 𝐵 = {𝛾 ∈ Γ ∶ 𝛾
is 𝑃Γ -generic over 𝑉[𝐾] and 𝛾 ∈ 𝑞} and the function 𝑓 ∶ 𝐵 → Δ assigning to each point
13.2. PRESERVATION THEOREMS 301
̇ The function 𝑓 is continuous on 𝐵, and the choice of the name 𝛿 ̇

𝛾 ∈ 𝐵 the point 𝛿/𝛾.
implies that 𝑝 ̄ ⊩ 𝑓 ̌ ⊂ 𝜏 holds. The set 𝐵 ⊂ Γ is dense 𝐺𝛿 in 𝑞. A standard result in the
theory of Polish groups [58, Theorems 9.9 and 9.10] now says that a homomorphism
from Γ to Δ which is continuous on a set comeager in a nonempty open set is in fact
continuous on the whole group Γ. This contradicts the initial choice of the name 𝜏. □
Let 𝑋 = {𝑥 ∈ Γ𝑛+1 ∶ ∏𝑖∈𝑛 𝑥(𝑖) = 𝑥(𝑛)}; this is a closed subset of Γ𝑛+1 , equipped
with the topology inherited from Γ𝑛+1 . If 𝑎 ⊂ 𝑛 + 1 is a set of size 𝑛, it is clear that the
remaining coordinate of a point 𝑥 ∈ 𝑋 is a continuous function of the coordinates 𝑥(𝑖)
for 𝑖 ∈ 𝑎, and therefore the projection from 𝑋 to Γ𝑎 is a continuous and open surjection.
Let 𝑥 ∈ 𝑋 be a point 𝑃𝑋 generic over 𝑉[𝐾]. Use Proposition 3.1.1 to see that whenever
𝑎 ⊂ 𝑛 + 1 are distinct numbers then 𝑥 ↾ 𝑎 ∈ Γ is a sequence (𝑃Γ )𝑛 -generic over 𝑉[𝐾].
Fix 𝑖 ∈ 𝑛. Working in the model 𝑉[𝐾][𝑥(𝑖)] find a poset 𝑅𝑖 of size < 𝜅 and a name
𝜎𝑖 for a condition in the poset 𝑃 stronger than 𝑝 ̄ and a name 𝛿𝑖̇ for an element of the
group Δ such that 𝑉[𝐾][𝑥(𝑖)] ⊧ 𝑅𝑖 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎𝑖 ⊩𝑃 𝜏(𝑥(𝑖)) = 𝛿𝑖̇ . In the model
𝑉[𝐾][𝑥(𝑛)], find disjoint basic open sets 𝑂0 , 𝑂1 ⊂ Δ as in Claim 13.2.2. Passing to a
condition 𝑟 = ⟨𝑟𝑖 ∶ 𝑖 ∈ 𝑛⟩ ∈ ∏𝑖∈𝑛 𝑅𝑖 and switching 𝑂0 , 𝑂1 if necessary, we may assume
that 𝑉[𝐾][𝑥 ↾ 𝑛] ⊧ 𝑟 ⊩ ∏𝑖∈𝑛 𝑥(𝑖) ∉ 𝑂0 . Use the choice of the set 𝑂0 to find, in the
model 𝑉[𝐾][𝑥(𝑛)], a poset 𝑅𝑛 of size < 𝜅, 𝑅𝑛 -names 𝜎𝑛 for an element of 𝑃 stronger than
𝑝 ̄ and 𝛿𝑛̇ for an element of 𝑂0 ⊂ Δ such that 𝑅𝑛 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎𝑛 ⊩𝑃 𝜏(𝑥(𝑛)) ̌ = 𝛿𝑛̇ .
Let 𝐻𝑖 ⊂ 𝑅𝑖 for 𝑖 ∈ 𝑛 + 1 be filters mutually generic over the model 𝑉[𝐾][𝑥]
such that 𝑟𝑖 ∈ 𝐻𝑖 holds for all 𝑖 ∈ 𝑛. For each 𝑖 ∈ 𝑛 + 1 write 𝑝𝑖 = 𝜎𝑖 /𝐻𝑖 ∈ 𝑃 and
𝛿𝑖 = 𝛿𝑖̇ /𝐻𝑖 . Note that whenever 𝑎 ⊂ 𝑛 is a set of size 𝑛, the models 𝑉[𝐾][𝑥𝑖 ][𝐻𝑖 ] for
𝑖 ∈ 𝑎 are mutually generic extensions of the model 𝑉[𝐾]. By the balance assumption
on the virtual condition 𝑝,̄ the conditions 𝑝𝑖 ∈ 𝑃 for 𝑖 ∈ 𝑛 + 1 have a lower bound, call
it 𝑞 ∈ 𝑃. Let 𝑊 be a symmetric Solovay extension of the model 𝑉[𝐾][𝑥][𝐻𝑖 ∶ 𝑖 ∈ 𝑛 + 1]
and work in 𝑊. The condition 𝑞 forces that 𝜏(𝑥(𝑖)) = 𝛿𝑖 for all 𝑖 ∈ 𝑛 + 1. Observe
that ∏𝑖∈𝑛 𝑥(𝑖) = 𝑥(𝑛) and ∏𝑖∈𝑛 𝛿𝑖 ≠ 𝛿𝑛 since ∏𝑖∈𝑛 𝛿𝑖 ∉ 𝑂0 while 𝛿𝑛 ∈ 𝑂0 . This
contradicts the assumption that 𝜏 is forced to be a homomorphism from Γ to Δ. □
Theorem 13.2.1 has a counterpart for certain quotient groups. Suppose that 𝐼 is a Borel
ideal on 𝜔. The quotient space 𝒫(𝜔)/𝐼 will be viewed as a group with the (quotient of
the) symmetric difference operation. A homomorphism ℎ ∶ 𝒫(𝜔)/𝐼 → 𝒫(𝜔)/𝐽 is Borel
if the set {⟨𝑥, 𝑦⟩ ∈ 𝒫(𝜔) × 𝒫(𝜔) ∶ ℎ([𝑥]𝐼 ) = [𝑦]𝐽 } is Borel.
Theorem 13.2.3. Let 𝐼, 𝐽 be Borel ideals on 𝜔 containing all singletons and suppose
that the equality modulo 𝐽 is a pinned equivalence relation. Let 𝑛 ∈ 𝜔 be a number. In co-
finally 𝑛 + 1, 𝑛-balanced extensions of the symmetric Solovay model, all homomorphisms
of 𝒫(𝜔)/𝐼 to 𝒫(𝜔)/𝐽 are Borel.
The assumptions are satisfied in particular 𝐹𝜍 -ideals 𝐽 (as then equality modulo 𝐽 is
an 𝐹𝜍 -equivalence relation and as such pinned [54, Theorem 17.1.3 (iii)]) and for an-
alytic P-ideals 𝐽 (as they are Borel and Polishable by [98]; the equality modulo 𝐽 is an
orbit equivalence relation of the action of the Polish abelian group 𝐽 by the symmet-
ric difference, and orbit equivalence relations of abelian Polish groups are pinned by
[54, Theorem 17.1.3 (ii)]).
Proof. Write 𝐸 for the equality modulo 𝐼 and 𝐹 for equality modulo 𝐽, both Borel
equivalence relations on 𝑋 = 𝒫(𝜔). Suppose that 𝜅 is an inaccessible cardinal. Sup-
pose that 𝑃 is a Suslin forcing which is is 𝑛 + 1, 𝑛-balanced cofinally below 𝜅. Let 𝑊
be a symmetric Solovay model derived from 𝜅 and work in 𝑊. Suppose towards a con-
tradiction that the conclusion of the theorem fails. Thus, there exist a condition 𝑝 ∈ 𝑃
and a 𝑃-name 𝜏 such that 𝑝 forces 𝜏 to be a homomorphism. Both 𝑝 and 𝜏 must be
definable in 𝑊 from parameters in the ground model and some point 𝑧 ∈ 2𝜔 . Let 𝑉[𝐾]
be a generic extension of 𝑉 by a poset of cardinality smaller than 𝜅 such that 𝑧 ∈ 𝑉[𝐾]
and 𝑃 is 𝑛 + 1, 𝑛-balanced in 𝑉[𝐾].
Work in the model 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be a 𝑛 + 1, 𝑛-balanced virtual condition.
Consider the Cohen poset 𝑄 on 𝑋 adding a generic set 𝑥𝑔𝑒𝑛 ̇ ⊂ 𝜔. There are two cases.
Case 1. 𝑄 ⊩ ∀𝑦 ⊂ 𝜔 Coll(𝜔, < 𝜅) ⊩ ∃𝑟 ≤ 𝑝 ̄ 𝑟 ⊩𝑃 𝜏([𝑥𝑔𝑒𝑛 ̇ ]𝐸 ) ≠ [𝑦]𝐹 holds. This
case in fact leads to a contradiction. Write Δ for the symmetric difference operation
on 𝑋 and utilize its associativity to apply it also to finite tuples of subsets of 𝜔. Let
𝑋̄ = {𝑥̄ ∈ 𝑋 𝑛+1 ∶ Δ𝑖∈𝑛 𝑥(𝑖) = 𝑥(𝑛)}; this is a closed subset of 𝑋 𝑛+1 , equipped with the
topology inherited from 𝑋 𝑛+1 . If 𝑎 ⊂ 𝑛+1 is a set of size 𝑛, it is clear that the remaining
coordinate of a point 𝑥 ∈ 𝑋 is a continuous function of the coordinates 𝑥(𝑖) for 𝑖 ∈ 𝑎,
and therefore the projection from 𝑋 to Γ𝑎 is a continuous and open surjection. Let
𝑥̄ ∈ 𝑋̄ be a point 𝑃𝑋̄ generic over 𝑉[𝐾]. Use Proposition 3.1.1 to see that whenever
𝑎 ⊂ 𝑛 + 1 are distinct numbers then 𝑥̄ ↾ 𝑎 ∈ Γ is a sequence 𝑄𝑛 -generic over 𝑉[𝐾].
Fix 𝑖 ∈ 𝑛. Working in the model 𝑉[𝐾][𝑥(𝑖)] find a poset 𝑅𝑖 of cardinality smaller
than 𝜅 and an 𝑅𝑖 -name 𝜎𝑖 for a condition in the poset 𝑃 stronger than 𝑝 ̄ and an 𝑅𝑖 -name
𝜂𝑖 for a such that 𝑉[𝐾][𝑥(𝑖)] ⊧ 𝑅𝑖 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎𝑖 ⊩𝑃 𝜏([𝑥(𝑖)]𝐸 ) = [𝜂𝑖 ]𝐹 . Let
𝐻𝑖 ⊂ 𝑅𝑖 for 𝑖 ∈ 𝑛 be filters mutually generic over the model 𝑉[𝐾][𝑥]. ̄ Write 𝑝𝑖 = 𝜎𝑖 /𝐻𝑖
and 𝑦𝑖 = 𝜂𝑖 /𝐻𝑖 for 𝑖 ∈ 𝑛, and look at the set 𝑦 = Δ𝑖∈𝑛 𝑦𝑖 ⊂ 𝜔. There are two hopeless
subcases.
Case 1a. The equivalence class [𝑦]𝐹 is represented in the model 𝑉[𝐾][𝑥(𝑛)]. ̄ Work in
the model 𝑉[𝐾][𝑥(𝑛)].
̄ Use the initial case assumption to find a poset 𝑅𝑛 , an 𝑅𝑛 -name
𝜎𝑛 for a condition in 𝑃 such that 𝑅𝑛 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎𝑛 ⊩ 𝜏([𝑥(𝑛)] ̄ 𝐸 ) ≠ [𝑦]𝐹 . Let
𝐻𝑛 ⊂ 𝑅𝑛 be a filter generic over the model 𝑉[𝐾][𝑥][𝐻 ̄ 𝑖 ∶ 𝑖 ∈ 𝑛] and let 𝑝𝑛 = 𝜎𝑛 /𝐻𝑛 .
Note that for every 𝑗 ∈ 𝑛 + 1, the models 𝑉[𝐾][𝑥(𝑖)][𝐻
̄ 𝑖 ] for 𝑖 ∈ 𝑛 + 1 ⧵ {𝑗} are mutually
generic over 𝑉[𝐾]. It follows from the 𝑛 + 1, 𝑛-balance assumption on the condition
𝑝 ̄ that the conditions 𝑝𝑖 for 𝑖 ∈ 𝑛 + 1 have a common lower bound, say 𝑟 ∈ 𝑃. The
condition 𝑟 forces 𝜏([𝑥(𝑖)]
̄ 𝐸 ) = [𝑦𝑖 ]𝐹 for all 𝑖 ∈ 𝑛, and 𝜏(𝑥𝑛 ) is not modulo 𝐽 equivalent
to 𝑦 = Δ𝑖∈𝑛 𝑦𝑖 . This contradicts the assumption that 𝜏 is forced to be a homomorphism,
as 𝑥𝑛 = Δ𝑖∈𝑛 𝑥𝑖 .
Case 1b. Case 1a fails. Work in the model 𝑉[𝐾][𝑥(𝑛)]. ̄ Find a poset 𝑅𝑛 , an 𝑅𝑛 -name
𝜎𝑛 for a condition in 𝑃 and an 𝑅𝑛 -name 𝜂𝑛 for a subset of 𝜔 such that 𝑅𝑛 ⊩ Coll(𝜔, <
𝜅) ⊩ 𝜎𝑛 ⊩ 𝜏([𝑥(𝑛)] ̄ 𝐸 ) = [𝜂𝑛 ]𝐹 . Let 𝐻𝑛 ⊂ 𝑅 𝑛 be a filter generic over the model
𝑉[𝐾][𝑥][𝐻 ̄ 𝑖 ∶ 𝑖 ∈ 𝑛] and let 𝑝𝑛 = 𝜎𝑛 /𝐻𝑛 and 𝑦𝑛 = 𝜂𝑛 /𝐻𝑛 . Now, either the name 𝜂𝑛
is 𝐹-pinned below some condition in the filter 𝐻𝑛 , in which case the 𝐹-class [𝑦𝑛 ]𝐹 is
represented in 𝑉[𝐾][𝑥(𝑛)] ̄ by the assumption that 𝐹 is pinned, or the name 𝜂𝑛 is not
𝐹-pinned below any condition in the filter 𝐻𝑛 , in which case the 𝐹-class [𝑦𝑛 ]𝐹 is not
represented even in the model 𝑉[𝐾][𝑥(𝑖) ̄ ∶ 𝑖 ∈ 𝑛][𝐻𝑖 ∶ 𝑖 ∈ 𝑛] by the mutual genericity.
In either case, 𝑦 𝐹 𝑦𝑛 fails.
The rest of Case 1b is identical to Case 1a. For every index 𝑗 ∈ 𝑛 + 1, the models
𝑉[𝐾][𝑥(𝑖)][𝐻
̄ 𝑖 ] for 𝑖 ∈ 𝑛 + 1 ⧵ {𝑗} are mutually generic over 𝑉[𝐾]. It follows from the
𝑛 + 1, 𝑛-balance assumption on the condition 𝑝 ̄ that the conditions 𝑝𝑖 for 𝑖 ∈ 𝑛 + 1
have a common lower bound, say 𝑟 ∈ 𝑃. The condition 𝑟 forces 𝜏([𝑥(𝑖)] ̄ 𝐸 ) = [𝑦𝑖 ]𝐹 for
all 𝑖 ∈ 𝑛, and 𝜏(𝑥𝑛 ) = 𝑦𝑛 is not modulo 𝐽 equivalent to 𝑦 = Δ𝑖∈𝑛 𝑦𝑖 . This contradicts the
assumption that 𝜏 is forced to be a homomorphism, as 𝑥𝑛 = Δ𝑖∈𝑛 𝑥𝑖 .
Case 2. Case 1 fails. By the Borel reading of names for the poset 𝑄, we can find a Borel
set 𝐵 ⊂ 𝑋 co-meager in some nonempty open set 𝑂 ⊂ 𝑋 and a Borel function 𝑓 ∶ 𝐵 → 𝑋
such that 𝑂 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩ 𝜏([𝑥𝑔𝑒𝑛 ̇ ]𝐸 ) = [𝑓(̇ 𝑥𝑔𝑒𝑛
̇ )]𝐹 . Now, in the model 𝑊 let
𝐶 ⊂ 𝐵 be the set of all points which are 𝑄-generic over 𝑉[𝐾]. Note that the set 𝐶 ⊂ 𝐵
is comeager in 𝑂 and Borel, and by the forcing theorem, 𝑝 ̄ ⊩𝑃 ∀𝑥 ∈ 𝐶 𝜏([𝑥]𝐸 ) =
[𝑓(𝑥)]𝐸 . Since the set 𝐶 is Borel and non-meager, for all infinite sets 𝑦 ∈ 𝑋 there are
sets 𝑥0 , 𝑥1 ∈ 𝐶 such that 𝑥0 Δ𝑥1 = 𝑦 modulo finite (Pettis theorem, [58, Theorem 9.9]).
It is then clear that 𝑝 ̄ forces the homomorphism 𝜏 to be Borel: 𝜏([𝑦]𝐸 ) = [𝑧]𝐹 just in
case there exist 𝑥0 , 𝑥1 ∈ 𝐶 such that 𝑥0 Δ𝑥1 = 𝑦 modulo finite and 𝑧 𝐹 𝑓(𝑥0 )Δ𝑓(𝑥1 ),
and 𝜏([𝑦]𝐸 ) = [𝑧]𝐹 just in case for all 𝑥0 , 𝑥1 ∈ 𝐶 such that 𝑥0 Δ𝑥1 = 𝑦 modulo finite,
𝑧 𝐹 𝑓(𝑥0 )Δ𝑓(𝑥1 ). These are in turn analytic and coanalytic descriptions of 𝜏. □
The various degrees of 𝑛+1, 𝑛-balance are not difficult to separate. One particularly el-
egant way of doing so is to seek monochromatic solutions to equations in Polish groups.
We state one prominent case, leaving the others to the patient reader.
Theorem 13.2.4. Let 𝑛 ≥ 2 be a number. Let ⟨𝑋, +⟩ be an uncountable Polish
abelian group and 𝐶 ⊂ 𝑋 a countable dense set. In cofinally 𝑛 + 1, 𝑛-balanced extensions
of the symmetric Solovay model, for every coloring from 𝑋 to 𝜔 there is a monochromatic
set of size 𝑛 + 1 adding up to an element of 𝐶.
An interesting case occurs with 𝑋 = ℝ. [93, Theorem 0.5] shows that in ZFC there is
a coloring of ℝ with no monochromatic sets of size 𝑛 + 1 which add up to an element
of 𝐶 for any fixed countable dense set 𝐶 ⊂ ℝ. With some care, it is possible to design a
𝑛 + 2, 𝑛 + 1-balanced Suslin forcing which adds a coloring with this property.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing which is cofi-
nally 𝑛 + 1, 𝑛-balanced below 𝜅. Let 𝑊 be the symmetric Solovay model derived from
𝜅 and work in 𝑊. Let 𝜏 be a 𝑃-name and 𝑝 ∈ 𝑃 be a condition forcing 𝜏 to be a map
from 𝑋 to 𝜔. We must find a parallelogram consisting of pairwise distinct points and a
condition stronger than 𝑝 which forces the vertices of the parallelogram to have all the
same color.
The name 𝜏 and the condition 𝑝 must both be definable with parameters in the
ground model and another parameters 𝑧 ∈ 2𝜔 . Let 𝑉[𝐾] be an intermediate model
obtained by a poset of cardinality smaller than 𝜅 such that 𝑧 ∈ 𝑉[𝐾] and 𝑃 is 𝑛 + 1, 𝑛-
balanced in 𝑉[𝐾]. Work in the model 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be a 𝑛 + 1, 𝑛-balanced virtual
condition. Let 𝑄0 be the Cohen poset on the group 𝑋 with its name for the generic point
𝑥𝑔𝑒𝑛
̇ in 𝑋. There must be a poset 𝑅 of cardinality smaller than 𝜅, a number 𝑚 ∈ 𝜔, a
𝑅 × Coll(𝜔, 𝜆)-name 𝜎 and a condition 𝑂 ∈ 𝑄0 such that 𝑂 ⊩ 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩
̇ ) = 𝑚.̌
𝜎 ⊩𝑃 𝜏(𝑦𝑔𝑒𝑛
Use the density of the set 𝐶 to find an element 𝑐 ∈ 𝐶 such that there are 𝑛 + 1-
many distinct elements of 𝑂 adding up to 𝑐. Consider the space of 𝑌 of all 𝑛 + 1-tuples
of points in 𝑂 which add up to 𝑐. Note that for every 𝑖 ∈ 𝑛 + 1, the 𝑖-th coordinate of
𝑦 ∈ 𝑌 is a continuous function of the others. It follows that the projection of 𝑌 into

any 𝑛-many of its coordinates is a continuous open map from 𝑌 to 𝑋 𝑛 . Let 𝑄1 be the
Cohen poset on 𝑌 and let 𝑦 = ⟨𝑦𝑖 ∶ 𝑖 ∈ 𝑛 + 1⟩ ∈ 𝑋 be a 𝑛 + 1-tuple in 𝑋 𝑄1 -generic over
𝑉[𝐾] and meeting the nonempty condition 𝑋 ∩ 𝑂𝑛+1 . We conclude that any 𝑁 many
points in the generic 𝑛 + 1-tuple are mutually generic over 𝑉[𝐾] for the poset 𝑄0 .
Let 𝐻𝑖 ⊂ 𝑅 for 𝑖 ∈ 𝑛 + 1 be filters mutually generic over the model 𝑉[𝐾][𝑥], and let
𝑝𝑖 = 𝜎𝑖 /𝑦𝑖 , 𝐻𝑖 . Since the extensions 𝑉[𝐾][𝑦𝑖 ][𝐻𝑖 ] for 𝑖 ∈ 𝑛 + 1 are in 𝑛-tuples mutually
generic, the balance assumption on the virtual condition 𝑝 ̄ shows that the conditions
𝑝𝑖 ∈ 𝑃 for 𝑖 ∈ 𝑛+1 have a common lower bound. By the forcing theorem applied in the
respective models 𝑉[𝐾][𝑥(𝑖)][𝐻̄ 𝑖 ] for 𝑖 ∈ 𝑛+1, we see that in the model 𝑊 the common
lower bound in 𝑃 forces the points on the tuple 𝑦 to have the same color 𝑚. □
Finally, we move to the much better organized world of 3, 2-centered forcings.
Theorem 13.2.5. Let Γ be an acyclic Borel graph on a Polish space 𝑋 such that the
Γ-path connectedness relation is Borel and unpinned. In 3, 2-centered, cofinally balanced
extensions of the symmetric Solovay model, Γ has no maximal acyclic subgraph.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin, 3, 2-centered poset
which is balanced cofinally below 𝜅. Let 𝑊 be a symmetric Solovay model derived
from 𝜅. Work in 𝑊. Suppose that 𝑝 ∈ 𝑃 is a poset and 𝜏 is a 𝑃-name such that 𝑝 forces
𝜏 to be a spanning subset of Γ. We will find a cycle in Γ and a condition stronger than
𝑝 which forces the cycle to be a subset of 𝜏.
The condition 𝑝 and the name 𝜏 are definable from ground model parameters and
an additional parameter in 2𝜔 . Let 𝑉[𝐾] be an intermediate extension containing 𝑧
obtained by a poset of cardinality smaller than 𝜅 and such that 𝑃 is balanced in 𝑉[𝐾].
Work in the model 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be a balanced virtual condition in 𝑃. The equiv-
alence relation 𝐸 is not pinned in 𝑉[𝐾] by Corollary 2.7.3, and there is a nontrivial
𝐸-pinned name on the poset collapsing ℵ1 to ℵ0 by Theorem 2.6.3. By the cofinal
balance assumption, there must be a poset 𝑄 of cardinality smaller than 𝜅, a nontriv-
ial 𝐸-pinned 𝑄-name 𝜂 for an element of 𝑋, and a 𝑄-name 𝜎 for a balanced virtual
condition in the 𝑄-extension which is stronger than 𝑝.̄ Let 𝐻0 , 𝐻1 , 𝐻2 ⊂ 𝑄 be filters
mutually generic over 𝑉[𝐾] and write 𝑝𝑖̄ = 𝜎/𝐻𝑖 and 𝑥𝑖 = 𝜂/𝐻𝑖 for 𝑖 ∈ 3. For any pair
{𝑖, 𝑗} ⊂ 3 of distinct indices, we conclude by the balance of the condition 𝑝 ̄ in 𝑉[𝐾] that
the virtual conditions 𝑝𝑖̄ , 𝑝𝑗̄ must be compatible. Thus, in each model 𝑉[𝐾][𝐻𝑖 ][𝐻𝑗 ],
there must be a poset 𝑄𝑖𝑗 and 𝑄𝑖𝑗 -name 𝜎𝑖𝑗 for a condition in 𝑃 stronger than both 𝑝𝑖̄
and 𝑝𝑗̄ , and a 𝑄𝑖𝑗 -name 𝜒𝑖𝑗 for the unique shortest Γ-path between 𝑥𝑖 and 𝑥𝑗 such that
𝑉[𝐾][𝐻𝑖 ][𝐻𝑗 ] ⊧ 𝑄𝑖𝑗 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎𝑖𝑗 ⊩ 𝜒𝑖𝑗 ⊂ 𝜏.
Let 𝐺𝑖𝑗 ⊂ 𝑄𝑖𝑗 be filters mutually generic over the model 𝑉[𝐾][𝐻𝑖 ∶ 𝑖 ∈ 3]. Write
𝑝𝑖𝑗 = 𝜎𝑖𝑗 /𝐺𝑖𝑗 and 𝑢𝑖𝑗 = 𝜒𝑖𝑗 /𝐺𝑖𝑗 . Observe that whenever 𝑖 ∈ 3 and 𝑗0 , 𝑗1 ∈ 3 are the two
indices distinct from 𝑖, then 𝑝𝑖𝑗0 and 𝑝𝑖𝑗1 are compatible conditions in 𝑃 by the balance
of the condition 𝑝𝑖̄ in 𝑉[𝐾][𝐻𝑖 ]. By the 3, 2-centeredness assumption, the conditions
𝑝𝑖𝑗 for 𝑖, 𝑗 ∈ 3 distinct have a common lower bound 𝑟 ∈ 𝑃. Note also that after erasing
some local loops if necessary ⋃𝑖𝑗 𝑢𝑖𝑗 is a cycle. By the forcing theorem applied in each
model 𝑉[𝐾][𝐻𝑖 , 𝐻𝑗 ][𝐺𝑖𝑗 ], it follows that 𝑟 ⊩ ⋃𝑖𝑗 𝑢𝑖𝑗 ⊂ 𝜏 as desired. □
Theorem 13.2.6. Let 𝑋 be an uncountable Polish space. In 3, 2-centered, cofinally
balanced extensions of the symmetric Solovay model, every set mapping 𝑓 ∶ [𝑋]2 → [𝑋]ℵ0
has a free triple.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin, 3, 2-centered poset

which is balanced cofinally below 𝜅. Let 𝑊 be a symmetric Solovay model derived
from 𝜅. Work in 𝑊. Suppose that 𝑝 ∈ 𝑃 is a poset and 𝜏 is a 𝑃-name such that 𝑝 forces
𝜏 to be a function from [𝑋]2 to [𝑋]ℵ0 . We will find a triple of points in 𝑋 and a condition
stronger than 𝑝 which forces the triple to be free for 𝜏.
The condition 𝑝 and the name 𝜏 are definable from ground model parameters and
an additional parameter in 2𝜔 . Let 𝑉[𝐾] be an intermediate extension containing 𝑧
obtained by a poset of cardinality smaller than 𝜅 and such that 𝑃 is balanced in 𝑉[𝐾].
Work in the model 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be a balanced virtual condition in 𝑃. By the cofinal
balance assumption, there must be a poset 𝑄 of cardinality smaller than 𝜅, a 𝑄-name
𝜂 for an element of 𝑋 which does not belong to 𝑉[𝐾], and a 𝑄-name 𝜎 for a balanced
virtual condition in the 𝑄-extension which is stronger than 𝑝.̄ Let 𝐻0 , 𝐻1 , 𝐻2 ⊂ 𝑄 be
filters mutually generic over 𝑉[𝐾] and write 𝑝𝑖̄ = 𝜎/𝐻𝑖 and 𝑥𝑖 = 𝜂/𝐻𝑖 for 𝑖 ∈ 3. For
any pair {𝑖, 𝑗} ⊂ 3 of distinct indices, we conclude by the balance of the condition 𝑝 ̄
in 𝑉[𝐾] that the virtual conditions 𝑝𝑖̄ , 𝑝𝑗̄ must be compatible. Thus, in each model
𝑉[𝐾][𝐻𝑖 ][𝐻𝑗 ], there must be a poset 𝑄𝑖𝑗 and 𝑄𝑖𝑗 -name 𝜎𝑖𝑗 for a condition in 𝑃 stronger
than both 𝑝𝑖̄ and 𝑝𝑗̄ , and a 𝑄𝑖𝑗 -name 𝜒𝑖𝑗 for an element of 𝑋 𝜔 such that 𝑉[𝐾][𝐻𝑖 ][𝐻𝑗 ] ⊧
𝑄𝑖𝑗 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎𝑖𝑗 ⊩ rng(𝜒𝑖𝑗 ) = 𝜏(𝑥𝑖̌ , 𝑥𝑗̌ ).
Let 𝐺𝑖𝑗 ⊂ 𝑄𝑖𝑗 be filters mutually generic over the model 𝑉[𝐾][𝐻𝑖 ∶ 𝑖 ∈ 3]. Write
𝑝𝑖𝑗 = 𝜎𝑖𝑗 /𝐺𝑖𝑗 and 𝑢𝑖𝑗 = 𝜒𝑖𝑗 /𝐺𝑖𝑗 . Observe that whenever 𝑖 ∈ 3 and 𝑗0 , 𝑗1 ∈ 3 are the two
indices distinct from 𝑖, then 𝑝𝑖𝑗0 and 𝑝𝑖𝑗1 are compatible conditions in 𝑃 by the balance
of the condition 𝑝𝑖̄ in 𝑉[𝐾][𝐻𝑖 ]. By the 3, 2-centeredness assumption, the conditions
𝑝𝑖𝑗 for 𝑖, 𝑗 ∈ 3 distinct have a common lower bound 𝑟 ∈ 𝑃. Note also that for each
𝑘 ∈ 3, the point 𝑥𝑘 does not belong to the model 𝑉[𝐾][𝐻𝑖 , 𝐻𝑗 ][𝐺𝑖𝑗 ] where 𝑖, 𝑗 ∈ 3 are
the two indices distinct from 𝑘, and therefore does not belong to the range of 𝑢𝑖𝑗 . It
follows that 𝑟 ⊩ {𝑥𝑖 ∶ 𝑖 ∈ 3} is a free set for 𝜏 as desired. □
Theorem 13.2.7. Let 𝐸 be a pinned Borel equivalence relation on a Polish space
𝑋. In 3, 2-centered, tethered, and cofinally balanced extensions of the symmetric Solovay
model, the following are equivalent:
(1) 𝐸 has a transversal;
(2) the 𝐸-quotient space is linearly ordered.
Proof. The implication (1)→(2) is trivial. In ZF, the space 𝑋, as every Polish
space, carries a Borel linear ordering ≤. If 𝐴 ⊂ 𝑋 is an 𝐸-transversal, then one can
order the 𝐸-quotient space by setting 𝑐 ≺ 𝑑 if the unique element of 𝐴 ∩ 𝑐 is ≤-smaller
than the unique element of 𝐴 ∩ 𝑑. The implication (2)→(1) is the heart of the matter.
Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a Suslin forcing which is 3, 2-centered,
balanced cofinally below 𝜅 and tethered below 𝜅. Let 𝑊 be a symmetric Solovay model
derived from 𝜅 and work in 𝑊. Suppose that 𝑝 ∈ 𝑃 is a condition forcing 𝐸 not to have
a transversal. Suppose that 𝜏 is a 𝑃-name for a tournament on the 𝐸-quotient space.
We will find a 3-cycle on the 𝐸-quotient space and a condition stronger than 𝑝 which
forces the cycle to be a subset of 𝜏. This will prove the theorem.
The condition 𝑝 and the name 𝜏 are definable from some ground model param-
eters and an additional parameter 𝑧 ∈ 2𝜔 . As a provisional definition, call a tuple
⟨𝑀, 𝑝,̄ 𝑄, 𝜂, 𝜎⟩ symmetric if 𝑀 is an intermediate generic extension of 𝑉 by a poset of
cardinality smaller than 𝜅 such that 𝑧 ∈ 𝑀, 𝑝 ̄ ≤ 𝑝 is a balanced virtual condition in
the model 𝑀, 𝑄 ∈ 𝑀 is a poset of cardinality smaller than 𝜅, 𝜂 ∈ 𝑀 is a 𝑄-name for an
element of 𝑋 which is not 𝐸-related to any element of 𝑀 ∩ 𝑋, 𝜎 ∈ 𝑀 is a 𝑄-name for a

balanced virtual condition in the 𝑄-extension of 𝑀 which is stronger than 𝑝,̄ and
(*) for any conditions 𝑞0 , 𝑞1 ∈ 𝑄, in some generic extension there are filters
𝐻0 , 𝐻1 ⊂ 𝑄 separately generic over 𝑀 such that 𝑞0 ∈ 𝐻0 , 𝑞1 ∈ 𝐻1 , 𝜂/𝐻0
is 𝐸-related to 𝜂/𝐻1 , and 𝜎/𝐻0 is compatible with 𝜎/𝐻1 in the poset 𝑃.
The following claim is central.
Claim 13.2.8. There is a symmetric tuple ⟨𝑀, 𝑝,̄ 𝑄, 𝜂, 𝜎⟩.
Proof. Let 𝐺 ⊂ 𝑃 be a filter generic over the model 𝑊 containing the condition
𝑝 and work in 𝑊[𝐺]. For each 𝐸-class 𝑐, consider the model 𝑀𝑐 of sets hereditarily
definable from parameters in the ground model and the additional parameters 𝑧, 𝑐, 𝐺.
There must be an 𝐸-class 𝑐 such that 𝑐 ∩ 𝑀𝑐 = 0; otherwise, one could form an 𝐸-
selector in 𝑊[𝐺] as the set 𝐴 = {𝑥 ∈ 𝑋 ∶ 𝑥 is the least element of [𝑥]𝐸 in the canonical
well-order of 𝑀[𝑥]𝐸 }, contradicting the initial assumptions on the condition 𝑝. Fix such
an 𝐸-class 𝑐, an arbitrary element 𝑥 ∈ 𝑐, and let 𝑀𝑥 be the model of sets hereditarily
definable from parameters in the ground model and the additional parameters 𝑧, 𝑥, 𝐺.
Note that 𝑀𝑐 ⊂ 𝑀𝑥 holds.
By the balance assumption, the fact that the models 𝑀𝑐 and 𝑀𝑥 are well-ordered,
and Theorem 9.1.1, the models 𝑀𝑐 and 𝑀𝑥 are generic extensions of the ground model
by posets of cardinality smaller than 𝜅; in particular, 𝑀𝑥 is a generic extension of 𝑀𝑐 by
a poset of cardinality smaller than 𝜅. By the tether assumption, as in Proposition 10.2.1,
there are virtual balanced virtual conditions 𝑝𝑐̄ and 𝑝𝑥̄ in the respective models 𝑀𝑐 and
𝑀𝑥 such that their realizations belong to the generic filter 𝐺. Necessarily 𝑝𝑥̄ ≤ 𝑝𝑐̄ ≤ 𝑝
holds. Working in 𝑀𝑐 , let 𝑄 be a poset of cardinality smaller than 𝜅 such that there is a
filter 𝐻 ⊂ 𝑄 generic over 𝑀𝑐 such that 𝑀𝑥 = 𝑀𝑐 [𝐻]. Let 𝜂 ∈ 𝑀𝑐 be a 𝑄-name such that
𝑥 = 𝜂/𝐻 and let 𝜎 be a 𝑄-name such that 𝑝𝑥̄ = 𝜎/𝐻. We claim that for some condition
𝑞 ∈ 𝑄, the tuple ⟨𝑀𝑐 , 𝑝𝑐̄ , 𝑄 ↾ 𝑞, 𝜂, 𝜎⟩ is symmetric. It remains only to choce 𝑞 in such a
way that (*) is satisfied.
To see this, in 𝑊[𝐺] let 𝐷 ⊂ 𝑄 be the set of all conditions 𝑟 ∈ 𝑄 such that there
is a filter 𝐻 ′ ⊂ 𝑄 which is generic over 𝑀𝑐 and such that 𝜂/𝐻 ′ ∈ 𝑐 and 𝜎/𝐻 ′ has a
realization in the filter 𝐺. The set, having just been defined from 𝑐 and 𝐺, belongs to
the model 𝑀𝑐 . It also contains the 𝑄-generic filter 𝐻 ⊂ 𝑄 as a subset. By a density
argument with the filter 𝐻, there must be a condition 𝑞 ∈ 𝐻 such that 𝐷 contains all
conditions 𝑟 ∈ 𝑄 such that 𝑟 ≤ 𝑞. It is immediate from the definition of the set 𝐷 that
the condition 𝑞 ∈ 𝑄 works as required. □
Now, fix the symmetric tuple ⟨𝑀, 𝑝,̄ 𝑄, 𝜂, 𝜎⟩. Let 𝐻0 ⊂ 𝑄0 and 𝐻1 ⊂ 𝑄1 be filters
mutually generic over 𝑀, and write 𝑥0 = 𝜂/𝐻0 , 𝑥1 = 𝜂/𝐻1 , 𝑝0̄ = 𝜎/𝐻0 and 𝑝1̄ = 𝜎/𝐻1 .
Claim 13.2.9. In some generic extension 𝑁 of 𝑀[𝐻0 , 𝐻1 ] by a poset of cardinality
smaller than 𝜅 there is a condition 𝑟 ∈ 𝑃 stronger than 𝑝0̄ , 𝑝1̄ such that 𝑁 ⊧ Coll(𝜔, <
𝜅) ⊩ 𝑟 ⊩𝑃 ⟨[𝑥0 ]𝐸 , [𝑥1 ]𝐸 ⟩ ∈ 𝜏.
Proof. To start with, note that 𝑄×𝑄 forces 𝜎left and 𝜎right to be compatible virtual
conditions in 𝑃 by the balance assumption on 𝑝,̄ and it also forces 𝜂left and 𝜂right to be
𝐸-unrelated elements of 𝑋 by the pinned assumption on the equivalence relation 𝐸.
Let 𝑞0 ∈ 𝐻0 , 𝑞1 ∈ 𝐻1 be conditions and suppose towards a contradiction that in 𝑀, the
condition ⟨𝑞0 , 𝑞1 ⟩ forces the negation of the statement of the claim.
13.3. EXAMPLES 307
Let 𝜆 < 𝜅 be a cardinal larger than |𝒫(𝑄) ∩ 𝑀| and let 𝐾0 , 𝐾1 ⊂ Coll(𝜔, 𝜆) be

filters mutually generic over 𝑀[𝐻0 , 𝐻1 ]. By (*) and the forcing theorem, there are filters
𝐻0′ ∈ 𝑀[𝐻0 ][𝐾0 ] and 𝐻1′ ∈ 𝑀[𝐻1 ][𝐾1 ] which are generic over 𝑀, 𝑞0 ∈ 𝐻1′ and 𝑞1 ∈ 𝐻0′
holds, and moreover, writing 𝑥0′ = 𝜂/𝐻0′ , 𝑥1′ = 𝜂/𝐻1′ , 𝑝0′̄ = 𝜎/𝐻0′ and 𝑝1′̄ = 𝜎/𝐻1′ ,
we have that 𝑥0 𝐸 𝑥0′ and 𝑥1 𝐸 𝑥1′ both hold, and 𝑝0̄ and 𝑝0′̄ are compatible virtual
conditions in 𝑃, and 𝑝1̄ and 𝑝1′̄ are compatible virtual conditions in 𝑃. Note also that the
filters 𝐻0′ , 𝐻1′ ⊂ 𝑄 are mutually generic over 𝑀 since they are found in the respective
mutually generic extensions 𝑀[𝐻0 ][𝐾0 ] and 𝑀[𝐻1 ][𝐾1 ]–Corollary 1.7.10.
Now, observe that the conditions 𝑝0̄ , 𝑝0′̄ , 𝑝1̄ , 𝑝1′̄ have a common lower bound in the
poset 𝑃. To see this, note that 𝑝0̄ , 𝑝0′̄ are compatible with a lower bound 𝑟0 ∈ 𝑃 in the
model 𝑀[𝐻0 ][𝐾0 ], and 𝑝1̄ , 𝑝1′̄ are compatible with a lower bound 𝑟1 ∈ 𝑃1 in the model
𝑀[𝐻1 ][𝐾1 ]. Now use the balance of the condition 𝑝 ̄ to see that 𝑟0 , 𝑟1 are compatible
conditions in 𝑃.
Since 𝜏 is a name for a total order, there must be a generic extension 𝑁 of the model
𝑀[𝐻0 , 𝐻1 ][𝐾0 , 𝐾1 ] by a poset of cardinality smaller than 𝜅 in which there is a condition
𝑟 ∈ 𝑃 which is a common lower bound of 𝑟0 , 𝑟1 and such that 𝑁 ⊧ Coll(𝜔, < 𝜅) ⊩
𝑟 ⊩𝑃 ⟨[𝑥0 ]𝐸 , [𝑥1 ]𝐸 ⟩ ∈ 𝜏 or 𝑁 ⊧ Coll(𝜔, < 𝜅) ⊩ 𝑟 ⊩𝑃 ⟨[𝑥1 ]𝐸 , [𝑥0 ]𝐸 ⟩ ∈ 𝜏. The former
option violates the initial contradictory assumption in view of the forcing theorem in
the model 𝑀 and the generic filters 𝐻0 , 𝐻1 , and the latter option violates the initial
contradictory assumption in view of the generic filters 𝐻0′ , 𝐻1′ . □
Finally, let 𝐻0 , 𝐻1 , 𝐻2 ⊂ 𝑄 be filters mutually generic over the model 𝑀. For each
𝑖 ∈ 3 write 𝑥𝑖 = 𝜂/𝐻𝑖 and 𝑝𝑖̄ for 𝜎/𝐻𝑖 . Use the claim to find a poset 𝑅01 ∈ 𝑀[𝐻0 ][𝐻1 ]
of cardinality smaller than 𝜅 and an 𝑅-name 𝜒01 for a common lower bound of 𝑝0̄ , 𝑝1̄
in 𝑃 such that 𝑀[𝐻0 ][𝐻1 ] ⊧ 𝑅01 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜒01 ⊩ ⟨[𝑥0̌ ]𝐸 , [𝑥1̌ ]𝐸 ⟩ ∈ 𝜏. Similarly
for 𝑅12 , 𝜒12 and 𝑅20 , 𝜒20 . Let 𝐾01 ⊂ 𝑅01 , 𝐾12 ⊂ 𝑅12 , and 𝐾20 ⊂ 𝑅20 be filters mutually
generic over the model 𝑀[𝐻𝑖 ∶ 𝑖 ∈ 3]. Write 𝑝01 = 𝜒01 /𝐾01 and similarly for 𝑝12 , 𝑝20 .
Note that the conditions 𝑝01 and 𝑝12 are compatible in 𝑃 by the balance of the virtual
condition 𝑝1̄ ∈ 𝑀[𝐻1 ]: they are found in the respective extensions 𝑀[𝐻1 ][𝐻0 ][𝐾01 ]
and 𝑀[𝐻1 ][𝐻2 ][𝐾12 ] mutually generic over 𝑀[𝐻1 ], and they are both stronger than 𝑝1̄ .
Similarly, the conditions 𝑝12 and 𝑝20 are compatible, and the conditions 𝑝20 and 𝑝01
are compatible. Finally, the 3, 2-centeredness assumption shows that the conditions
𝑝01 , 𝑝12 , 𝑝20 have a common lower bound 𝑞 ≤ 𝑝. The forcing theorem applied in the
respective models 𝑀[𝐻0 , 𝐻1 ][𝐾01 ], 𝑀[𝐻1 ][𝐻2 ][𝐾12 ] and 𝑀[𝐻2 ][𝐻0 ][𝐾20 ] shows that
in the model 𝑊, 𝑞 forces the sequence ⟨[𝑥0 ]𝐸 , [𝑥1 ]𝐸 , [𝑥2 ]𝐸 , [𝑥0 ]𝐸 ⟩ to form an oriented
3-cycle which is a subset of 𝜏. The proof of the theorem is complete. □
13.3. Examples
The first batch of examples deals with the implications and limitations of Theo-
rem 13.2.7. We use Theorem 13.2.1 to add the nonexistence of discontinuous homo-
morphisms of Polish groups to the conclusions for reference purposes.
𝑃 be the poset for adding a tournament on the 𝐸-quotient space as in Example 8.7.6.
Then 𝑃 is 3, 2-centered by its definition, balanced by Theorem 8.7.4, and tethered by
Example 10.3.7. It is compactly balanced, so does not add a 𝔼0 -transversal by Exam-
ple 9.2.11. Thus, Theorem 13.2.7 applies to it, as do all other theorems of Section 13.2.

(1) Let 𝑃 be the tournament poset associated with 𝐸 as in Example 8.7.6. In the
𝑃-extension of a symmetric Solovay model, there are no discontinuous homo-
morphisms of Polish groups, an there is no linear ordering on the 𝔼0 -quotient
space.
a tournament on the 𝐸-quotient space while there are no discontinuous homo-
morphisms of Polish groups and there is no linear ordering on the 𝔼0 -quotient
space.
Example 13.3.3. Let 𝐸 be a countable Borel equivalence relation on a Polish space
𝑋. Let 𝑃 be the poset adding an action of ℤ on 𝑋 inducing 𝐸 as in Example 6.4.9. The
poset 𝑃 is 3, 2-centered by its definition, balanced by Example 6.4.9, tethered by Ex-
ample 10.3.6, and it does not add an 𝔼0 -transversal by Corollary 11.3.12. Thus, Theo-
rem 13.2.7 applies to it, as do all other theorems of Section 13.2.
Corollary 13.3.4. Let 𝐸 be a countable Borel equivalence relation on a Polish space
𝑋.
(1) Let 𝑃 be the poset adding an action of ℤ on 𝑋 inducing 𝐸 as in Example 6.4.9.
In the 𝑃-extension of the symmetric Solovay model, there are no discontinuous
homomorphisms of Polish groups, and there is no linear ordering on the 𝔼0 -
quotient space.
orbit equivalence relation of a (discontinuous) ℤ-action, there are no discontin-
uous homomorphisms of Polish groups, and there is no linear ordering on the
𝔼0 -quotient space.
Example 13.3.5. Let Γ be a Borel graph on a Polish space 𝑋. Suppose that 𝑛 ∈
𝜔 is a number such that Γ does not contain an injective homomorphic copies of ei-
→
ther of 𝐾𝜔,𝜔 or 𝐾𝑛,𝜔1 . Let 𝑃 be the coloring poset of Definition 8.1.1. The poset 𝑃 is
3, 2-centered by its definition, it is balanced by Theorem 8.1.2 and tethered by Exam-
ple 10.3.3. It does not add a 𝔼0 -transversal by Theorem 11.7.6. Thus, Theorem 13.2.7
applies to it, as do all other theorems of Section 13.2.
Corollary 13.3.6. Let 𝐴 ⊂ ℝ be a countable set of positive reals converging to zero.
Let Γ be the graph on ℝ2 connecting two points if their Euclidean distance belongs to 𝐴.
(1) Let 𝑃 be the coloring poset of Definition 8.1.1. In the 𝑃-extension of the symmetric
Solovay model, there are no discontinuous homomorphisms of Polish groups,
and there is no linear ordering of the 𝔼0 -quotient space.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, the chro-
matic number of Γ is countable, yet there is no discontinuous homomorphism
between Polish groups and no linear ordering of the 𝔼0 -quotient space.
The next example shows that the tether assumption is necessary in Theorem 13.2.7.
Example 13.3.7. Let 𝑃 be the collapse poset of |𝔼0 | to |2𝜔 | as in Definition 6.4.1.
The poset 𝑃 is 3, 2-centered by its definition and balanced by Theorem 6.4.2. It does
not add an 𝔼0 -transversal by Corollary 11.5.8, but it does add a linear ordering of the
𝔼0 -quotient space by mapping it injectively into the linearly ordered set 2𝜔 .
13.3. EXAMPLES 309
The following example shows that the assumption that 𝐸 be pinned is necessary in
Theorem 13.2.7.
Example 13.3.8. Let 𝑃 be the poset adding a function which selects from each
nonempty countable subset of 𝑋 = 2𝜔 a single element as in Example 6.4.14. The
poset is 3, 2-centered by its definition, balanced by Theorem 6.4.11, tethered by Ex-
ample 10.3.5, and adds a linear ordering of the 𝔽2 -quotient space without adding a
𝔽2 -transversal.
Proof. The poset 𝑃 does not add an 𝔽2 -transversal since no balanced poset does
by Corollary 9.1.5. At the same time, an existence of a function 𝑓 ∶ [𝑋]ℵ0 → 𝑋 such
that for each nonempty countable set 𝑎 ⊂ 𝑋 𝑓(𝑎) ∈ 𝑎 holds implies |𝔽2 | ≤ |𝑋 <𝜔1 |.
To see the injection from the 𝔽2 -space to 𝑋 <𝜔1 , to each countable set 𝑎 ⊂ 𝑋 assign a
transfinite sequence ⟨𝑥𝛼 ∶ 𝛼 ∈ 𝛽⟩ by setting recursively 𝑥𝛼 = 𝑓(𝑎 ⧵ {𝑥≫ ∶ ≫∈ 𝛼})
unless the set 𝑎 ⧵ {𝑥≫ ∶ ≫∈ 𝛼} is empty, in which case we finish the recursion. The set
𝑋 <𝜔1 is linearly ordered by the lexicographic ordering, and so the poset 𝑃 adds a linear
ordering of the 𝔽2 -space. □
The following example shows that the pinned assumption in Theorem 13.2.5 is neces-
sary.
𝑋. Let 𝑃 be the transversal poset of Example 6.4.6. The poset 𝑃 is 3, 2-centered by its
definition and it is balanced by Theorem 6.4.5. Letting Γ be the graph on 𝑋 connecting
any two distinct 𝐸-related points, note that 𝑃 adds a maximal acyclic subgraph to Γ–it is
the graph consisting of all edges {𝑥0 , 𝑥1 } ∈ Γ such that one of the vertices 𝑥0 , 𝑥1 belongs
to the 𝐸-selector added by 𝑃.
𝑋.
(1) Let 𝑃 be the transversal poset of Example 6.4.6. In the 𝑃-extension of the symmet-
ric Solovay model, there are no discontinuous homomorphisms of Polish groups.
transversal, yet there is no discontinuous homomorphism between Polish
groups.
The next batch of examples deals with partial orders which are 𝑚, 𝑛-balanced but not
3, 2-centered, and violate the conclusions for 3, 2-centered posets from Theorems 13.2.5
through 13.2.7.
Example 13.3.11. Let Γ be a Borel graph on a Polish space 𝑋. Let 𝑃 be the poset
of all countable acyclic subsets of Γ ordered by reverse inclusion. Whenever 𝑛 ∈ 𝜔 is
a natural number, the poset 𝑃 is 𝑛, 2-balanced and every balanced virtual condition is
𝑛, 2-balanced.
The poset 𝑃 adds a maximal acyclic subset of Γ, violating the conclusion of Theo-
rem 13.2.5 for many graphs Γ. Therefore, in such cases the poset 𝑃 is not 3, 2-centered
and even does not contain a dense analytic 3, 2-centered subset.
Proof. It follows from Example 6.3.7 that balanced virtual conditions for 𝑃 are
classified by maximal acyclic subgraphs of Γ. Let 𝑝 ̄ be any maximal acyclic subgraph
of Γ. We will check that 𝑝 ̄ is 𝑛, 2-balanced, completing the proof. To this end, let
{𝑉[𝐻𝑖 ] ∶ 𝑖 ∈ 𝑛} be pairwise mutually generic extensions of 𝑉, respectively contain-
ing some conditions 𝑝𝑖 ≤ 𝑝 ̄ for each 𝑖 ∈ 𝑛. We have to show that ⋃𝑖∈𝑛 𝑝𝑖 is a common
lower bound of the conditions 𝑝𝑖 for 𝑖 ∈ 𝑛; i.e., it does not contain a cycle. The follow-
ing claim will be useful to this end.
Claim 13.3.12. For each 𝑖 ∈ 𝑛 and vertices 𝑥0 , 𝑥1 ∈ 𝑋 ∩ 𝑉, the following three
formulas are equivalent:
(1) 𝑥0 , 𝑥1 are connected by a path in Γ ∩ 𝑉;
(2) 𝑥0 , 𝑥1 are connected by a path in 𝑝;̄
(3) 𝑥0 , 𝑥1 are connected by a path in 𝑝𝑖 .
Proof. (1)→(2) is implied by the maximality of 𝑝.̄ (2)→ (3) follows from the fact
that 𝑝 ̄ ⊂ 𝑝𝑖 , and the negation of (1) implies by the Mostowski absoluteness that 𝑥0 , 𝑥1
are not connected by any path in the graph Γ ∩ 𝑉[𝐻𝑖 ], which is larger than 𝑝𝑖 and
therefore (3) has to fail. □
Now, suppose towards a contradiction that 𝑐 ⊂ ⋃𝑖 𝑝𝑖 is a cycle. It must use edges from
more than one of the sets 𝑝𝑖 for 𝑖 ∈ 𝑛, as each of these sets in itself is acyclic. By the
pairwise mutual genericity assumption, if 𝑖, 𝑗 ∈ 𝑛 are distinct indices and 𝑒𝑖 ∈ 𝑝𝑖 and
𝑒𝑗 ∈ 𝑝𝑗 are adjacent edges, then the vertex they share belongs to 𝑉. It follows that there
are is 𝑖 ∈ 𝑛 and vertices 𝑥0 , 𝑥1 ∈ 𝑋 ∩ 𝑉 such that the cycle 𝑐 contains a path from 𝑥0 to
𝑥1 using exclusively edges from 𝑝𝑖 ⧵ 𝑉. The claim then shows that 𝑥0 , 𝑥1 are connected
using edges in 𝑝𝑖 ∩ 𝑉 as well, so 𝑝𝑖 contains a cycle c. A contradiction. □
Corollary 13.3.13. Let Γ be a Borel graph on a Polish space 𝑋.
(1) Let 𝑃 be the poset adding a maximal acyclic subgraph of Γ as in Example 6.3.7.
In the 𝑃-extension of the symmetric Solovay model every homomorphism be-
tween Polish groups is continuous.
maximal acyclic subgraph and every homomorphism between Polish groups is
continuous.
Example 13.3.14. Let ℱ be a Fraissé class of structures in finite relational lan-
guage with strong amalgamation. Let 𝐸 be a Borel equivalence relation on a Polish
space 𝑋. Let 𝑃 = 𝑃(ℱ, 𝐸) be the poset of Definition 8.7.3. For each number 𝑛 ∈ 𝜔, the
poset 𝑃 is 𝑛, 2-balanced and every balanced virtual condition is 𝑛, 2-centered.
The linearization poset 𝑃 for the 𝔼0 -quotient space of Example 8.7.5 is tethered by Ex-
ample 10.3.7 and does not add an 𝔼0 -selector by Example 9.2.11. Therefore, 𝑃 violates
the conclusion of Theorem 13.2.7, so 𝑃 contains no dense analytic 3, 2-centered subset.
Proof. It follows from Theorem 8.7.4 that balanced virtual conditions in 𝑃 are
classified by ℱ-structures on the virtual quotient space 𝑋 ∗∗ . Let 𝑝 ̄ be such a structure.
Let 𝑉[𝐻𝑖 ] for 𝑖 ∈ 𝑛 be generic extensions of the ground model which are pairwise
mutually generic. Let 𝑝𝑖 ∈ 𝑉[𝐻𝑖 ] be a condition extending 𝑝,̄ for each 𝑖 ∈ 𝑛. Note
that the domains of the conditions pairwise intersect in the domain of 𝑝.̄ Let 𝑏 =
⋃𝑖 dom(𝑝𝑖 ). For each finite set 𝑎 ⊂ 𝑏 use the strong amalgamation of the class ℱ 𝑛 − 1-
many times to find a structure 𝑁𝑎 ∈ ℱ on 𝑎 so that for each 𝑖 ∈ 𝑛, 𝑁𝑎 ↾ (dom(𝑝𝑖 ) ∩ 𝑎) =
𝑝𝑖 ↾ (dom(𝑝𝑖 ) ∩ 𝑎). Let 𝑈 be an ultrafilter on [𝑏]<ℵ0 such that for every finite set 𝑐 ⊂ 𝑏,
13.3. EXAMPLES 311
the set {𝑎 ∈ [𝑏]<ℵ0 ∶ 𝑐 ⊂ 𝑎} belongs to 𝑈. Let 𝑁 be the structure on 𝑏 which is the

𝑈-integral of the structures 𝑁𝑎 . It is immediate that for all 𝑁 ↾ dom(𝑝𝑖 ) = 𝑝𝑖 for each
𝑖 ∈ 3, and the closure of the class ℱ under substructures shows that 𝑁 is a ℱ-structure.
It is the desired lower bound of the conditions 𝑝𝑖 for 𝑖 ∈ 𝑛. □
(1) Let 𝑃 be the 𝐸-linearization poset as in Example 8.7.5. In the 𝑃-generic extension
of the symmetric Solovay model every homomorphism between Polish groups is
continuous.
quotient space carries a linear ordering and every homomorphism between Pol-
ish groups is continuous.
Example 13.3.16. Let Γ be a circular hypergraph on a Polish space 𝑋 as in Defini-

tion 8.2.6. Let 𝑃 be the circular coloring poset of Definition 8.2.7 and Example 8.2.10.
Under CH, the poset 𝑃 is 4, 3-balanced and every balanced virtual condition is 4, 3-
balanced.
Proof. By Theorem 8.2.8, balanced virtual conditions are classified by total Γ-

colorings 𝑐 ∶ 𝑋 → 𝜔 × 𝜔. For each such coloring 𝑐, the pair Coll(𝜔, 𝑋), 𝑐⟩̌ is balanced.
We will show that the pair is in fact 4, 3-balanced.
Suppose that in some ambient generic extension, 𝑉[𝐺𝑖 ] for 𝑖 ∈ 4 are generic ex-
tensions and any three of them are mutually generic. Suppose that 𝑝𝑖 ∈ 𝑉[𝐺𝑖 ] for
𝑖 ∈ 4 are conditions below 𝑐; we must show that they have a common lower bound.
Write 𝑑𝑖 = dom(𝑝𝑖 ) for 𝑖 ∈ 4. Let 𝑑 ⊂ 𝑋 be a countable subset of 𝑋 closed under
the circular automorphisms containing ⋃𝑖 𝑑𝑖 as a subset and let 𝑑4 = 𝑑 ⧵ ⋃𝑖∈4 𝑑𝑖 . Let
𝑑4 = {𝑥𝑛 ∶ 𝑛 ∈ 𝜔} be an enumeration. For each pair 𝑖, 𝑗 of distinct indices in 4, each
𝑛 ∈ 𝜔, and each circular automorphism 𝜙 let 𝑒𝑛𝑖𝑗𝜙 = {𝑦 ∈ 𝑑𝑖 ∶ 𝜙(𝑦𝑥𝑛−1 )𝑥𝑛 ∈ 𝑑𝑗 }. Use
the pairwise mutual genericity assumption to argue as in the proof of Theorem 8.2.8
that 𝑒𝑛𝑖𝑗𝜙 is a subset of a single right 𝑋 ∩ 𝑉-coset. Let 𝑞 ∶ 𝑑 → 𝜔 × 𝜔 be any map
such that ⋃𝑖 𝑝𝑖 ⊂ 𝑞 and for each 𝑛 ∈ 𝜔, 𝑞(𝑥𝑛 ) = ⟨𝑛, 𝑚⟩ for some number 𝑚 such
that ⟨𝑛, 𝑚⟩ ∉ ⋃𝑖≠𝑗,𝜙 𝑝𝑖″ 𝑒𝑛𝑖𝑗𝜙 (𝑥). Note that the latter union is a subset of 𝜔 × 𝜔 with all
vertical sections finite. We claim that 𝑞 is a common lower bound of the conditions 𝑝𝑖
for 𝑖 ∈ 4.
We will only show that any triple {𝑥0 , 𝑥1 , 𝑥2 } ∈ Γ of pairwise distinct points is not
monochromatic. There are several cases to consider. If two points of the triple belong
to one and the same set 𝑑𝑖 then so does the third one, and then we use the assumption
that 𝑝𝑖 ∈ 𝑃 is a coloring without such monochromatic triples. The case in which
each point of the triple belongs to some 𝑑𝑖 for 𝑖 ∈ 4 but never to the same one, say
𝑥0 ∈ 𝑑0 ⧵ 𝑉, 𝑥1 ∈ 𝑑1 ⧵ 𝑉, and 𝑥2 ∈ 𝑑2 ⧵ 𝑉 is impossible in view of the assumption that
the three extensions 𝑉[𝐺0 ], 𝑉[𝐺1 ], 𝑉[𝐺2 ] are mutually generic. If one of the points,
say 𝑥0 , belongs to 𝑑4 and the other two do not, say 𝑥1 ∈ 𝑑𝑗 and 𝑥2 ∈ 𝑑𝑖 for 𝑖, 𝑗 ∈ 4
distinct, then 𝑞(𝑥0 ) is distinct from all colors in the set 𝑝𝑗″ 𝑒𝑛𝑗𝑖𝜙 (𝑥0 ) and so is different
from 𝑝𝑗 (𝑥1 ), and monochromaticity fails again. Finally, if more than one point of the
triple is in the set 𝑑4 , then the triple cannot be monochromatic since the map 𝑞 ↾ 𝑑4 is
an injection. □
Corollary 13.3.17. Let Γ be the hypergraph on ℝ2 consisting of all triples {𝑥0 , 𝑥1 ,

𝑥2 } which form the set of vertices of an equilateral triangle.
(1) Let 𝑃 be the Γ-coloring poset of Example 8.2.10. In the 𝑃-generic extension of
the symmetric Solovay model, every homomorphism between Polish groups is
continuous.
(2) It is consistent relative to an inaccessible cardinal that ZF+DC holds, there is an
equilateral triangle-free decomposition of ℝ2 , yet every homomorphism between
Polish groups is continuous.
CHAPTER 14
Other combinatorics
The technology of balanced virtual conditions can be applied to prove general the-
orems about lack of other combinatorial objects in the extensions under discourse. In
this section, we include several theorems that are hopefully elegant axiomatizations
and generalizations of earlier results in [74].
14.1. Maximal almost disjoint families

One rather surprising limitation of balanced extensions of the symmetric Solovay
model is that they contain no maximal almost disjoint families of subsets of 𝜔. This in
particular subsumes the result of Törnquist [107] that there are no maximal almost dis-
joint families in the symmetric Solovay model. The following theorem is stated using
Convention 1.7.18.
Theorem 14.1.1. In cofinally balanced extensions of the symmetric Solovay model

there are no infinite maximal almost disjoint families of subsets of 𝜔.

balanced below 𝜅. Let 𝑊 be a symmetric Solovay model derived from 𝜅 and work in 𝑊.
Suppose towards a contradiction that there exist a condition 𝑝 ∈ 𝑃 and a name 𝜏 such
that 𝑝 forces 𝜏 to be an infinite maximal almost disjoint family. The condition 𝑝 as well
as the name 𝜏 must be definable from some parameter 𝑧 ∈ 2𝜔 and some parameters
from the ground model. Use Fact 1.7.16 and the assumptions to find an intermediate
generic extension 𝑉[𝐾] such that 𝑧 ∈ 𝑉[𝐾] and 𝑃 is balanced in 𝑉[𝐾]. Work in the
model 𝑉[𝐾].
Let 𝑝 ̄ ≤ 𝑝 be a balanced virtual condition. Let 𝐼 be the set {𝑎 ⊂ 𝜔 ∶ for some poset
𝑅𝑎 of size < 𝜅 and some 𝑅𝑎 -name 𝜎𝑎 for a condition in 𝑃 stronger than 𝑝 ̄ such that
𝑅𝑎 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝑎̌ ∈ 𝜏}.
Claim 14.1.2. 𝜔 cannot be covered by a finite set and finitely many elements of the
set 𝐼.
Proof. Suppose that 𝐽 ⊂ 𝐼 is a finite set such that ⋃ 𝐽 ⊂ 𝜔 is co-finite. Let 𝐻𝑎 ⊂

𝑅𝑎 for 𝑎 ∈ 𝐽 be filters mutually generic over 𝑉[𝐾] and let 𝑝𝑎 = 𝜎𝑎 /𝐻𝑎 ∈ 𝑃. By the
balance of the condition 𝑝,̄ it follows that the set {𝑝𝑎 ∶ 𝑎 ∈ 𝐽} ⊂ 𝑃 has a lower bound,
denote it by 𝑞. Since the model 𝑊 is a symmetric Solovay extension of each of the
models 𝑉[𝐾][𝐻𝑎 ], the forcing theorem applied in the model 𝑉[𝐾][𝐻𝑎 ] shows that in
𝑊, for each 𝑎 ∈ 𝐽, the condition 𝑞 forces 𝐽 ⊂ 𝜏. However, since ⋃ 𝐽 ⊂ 𝜔 is cofinite, it
has to be the case that 𝑞 ⊩ 𝐽 ̌ = 𝜏, contradicting the initial assumptions on the name
𝜏. □
313
314 14. OTHER COMBINATORICS
Let 𝑈 be a nonprincipal ultrafilter on 𝜔 disjoint from 𝐼. There must be a poset 𝑅 of

size < 𝜅, an 𝑅-name 𝜂 for an infinite subset of 𝜔 which is modulo finite included in all
sets in 𝑈, an 𝑅-name 𝜒 for a subset of 𝜔 and an 𝑅-name 𝜎 for an element of 𝑃 stronger
than 𝑝 ̄ such that 𝑅 ⊩ 𝜒 ∩ 𝜂 is infinite and 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜒 ∈ 𝜏. This occurs
since 𝜏 is forced to be a maximal almost disjoint family and therefore must contain an
element with infinite intersection with 𝜂.
Now, let 𝐻0 , 𝐻1 ⊂ 𝑅 be filters mutually generic over the model 𝑉[𝐾]. Let 𝑎0 =
𝜒/𝐻0 , 𝑎1 = 𝜒/𝐻1 ∈ 𝒫(𝜔), and 𝑝0 = 𝜎/𝐻0 , 𝑝1 = 𝜎/𝐻1 ∈ 𝑃. By the balance of the
condition 𝑝 ̄ ≤ 𝑝 it must be the case that 𝑝0 , 𝑝1 ∈ 𝑃 have a lower bound, denote it by
𝑞. Since 𝑊 is the symmetric Solovay extension of each of the models 𝑉[𝐾][𝐻0 ] and
𝑉[𝐾][𝐻1 ], the forcing theorem applied in these models shows that 𝑊 satisfies that 𝑞
forces both 𝑎0̌ and 𝑎1̌ into 𝜏. The proof will be complete if we show that 𝑎0 ≠ 𝑎1 and
𝑎0 , 𝑎1 have infinite intersection.
For 𝑎0 ≠ 𝑎1 , observe that neither 𝑎0 , 𝑎1 can belong to the model 𝑉[𝐾]. If, say,
𝑎0 ∈ 𝑉[𝐾] then 𝑅 witnesses the fact that 𝑎0 ∈ 𝐼, and consequently 𝑎0 must have both
finite and infinite intersection with 𝜂/𝐻0 , a contradiction. Now, since 𝑎0 ∈ 𝑉[𝐾][𝐻0 ]
and 𝑎1 ∈ 𝑉[𝐾][𝐻1 ], a mutual genericity argument shows that 𝑎0 ≠ 𝑎1 .
To establish that the set 𝑎0 ∩ 𝑎1 is infinite, move back to the model 𝑉[𝐾], let ⟨𝑠0 , 𝑠1 ⟩
be a condition in the product 𝑅 × 𝑅 and 𝑛 ∈ 𝜔 be a number; we must find a number
𝑚 > 𝑛 and conditions 𝑡0 ≤ 𝑠0 and 𝑡1 ≤ 𝑠1 such that 𝑡0 ⊩ 𝑚̌ ∈ 𝜒 and 𝑡1 ⊩ 𝑚̌ ∈ 𝜒. To
this end, let 𝑏0 = {𝑚 ∈ 𝜔 ∶ ∃𝑡 ≤ 𝑠0 𝑡 ⊩ 𝑚̌ ∈ 𝜒} and 𝑏1 = {𝑚 ∈ 𝜔 ∶ ∃𝑡 ≤ 𝑠1 𝑡 ⊩ 𝑚̌ ∈ 𝜒}.
The sets 𝑏0 , 𝑏1 ⊂ 𝜔 are both forced to have infinite intersection with 𝜂 and therefore
must belong to the ultrafilter 𝑈. This means that there is a natural number 𝑚 > 𝑛 in
the intersection 𝑏0 ∩ 𝑏1 , and then the desired conditions 𝑡0 ≤ 𝑠0 and 𝑡1 ≤ 𝑠1 are found
by the definition of the sets 𝑏0 and 𝑏1 . □
Theorem 8.10.7 above produces a weakly balanced MAD forcing such that in its exten-
sion of the Solovay model, a maximal almost disjoint family exists. As a result of that
example and Theorem 9.1.6, we have:
Corollary 14.1.3. The following theory is consistent relative to an inaccessible car-
dinal. ZF+DC holds, there is an infinite maximal almost disjoint family of subsets of 𝜔,
and there is no uncountable sequence of pairwise distinct reals.
14.2. Unbounded linear suborders

Another general obstruction for reaching ZF independence results in balanced ex-
tensions is described in the following theorem, stated using Convention 1.7.18.
Theorem 14.2.1. Let ⊴ be an 𝐹𝜍 -preorder on a Polish space 𝑋 with no maximal
element such that every countable linearly ordered set has an upper bound. In cofinally
balanced 𝜎-closed extensions of the symmetric Solovay model, ⊴ contains no unbounded
linearly ordered sets.
A typical preorder satisfying the assumptions is the Turing reducibility preorder or the
modulo finite domination ordering on 𝜔𝜔 .
Proof. We start with a simple claim which takes place in the context of ZFC. If 𝑅
is a poset and 𝜂 is an 𝑅-name for an element of 𝑋, say that 𝜂 is unbounded if 𝑅 forces
that for every ground model element 𝑥 ∈ 𝑋, 𝜂 ⊴ 𝑥 fails.
14.3. MEASURE AND CATEGORY 315
Claim 14.2.2. Suppose that 𝑅0 , 𝑅1 are posets and 𝜂0 , 𝜂1 are respective unbounded
names for elements of 𝑋. Then 𝑅0 × 𝑅1 ⊩ 𝜏0 , 𝜏1 are ⊴-incomparable.
Proof. Let ⊴ = ⋃𝑛 𝐹𝑛 where for every 𝑛 ∈ 𝜔, 𝐹𝑛 is closed. If the conclusion

failed, there would have to be a pair ⟨𝑟0 , 𝑟1 ⟩ ∈ 𝑅0 × 𝑅1 forcing say 𝜂0 ⊴ 𝜂1 and then
strengthening the pair if necessary there would have to be a number 𝑛 ∈ 𝜔 such that
⟨𝜂0 , 𝜂1 ⟩ ∈ 𝐹𝑛 is forced. Let 𝑀 be a countable elementary submodel of a large structure
containing 𝑅1 , 𝑟1 , 𝜂1 , let 𝑔 ⊂ 𝑅1 be a filter generic over the model 𝑀 such that 𝑟1 ∈ 𝑔,
and let 𝑥 = 𝜂1 /𝑔. Since 𝜂0 is an unbounded name, 𝑅0 ⊩ 𝜂0 ⊴ 𝑥̌ fails, and so there must
be a condition 𝑟0′ ≤ 𝑟0 and basic open sets 𝑂0 , 𝑂1 ⊂ 𝑋 such that (𝑂0 × 𝑂1 ) ∩ 𝐹𝑛 = 0,
𝑥 ∈ 𝑂1 , and 𝑟0′ ⊩ 𝜏0 ∈ 𝑂0 . By the forcing theorem, there must be a condition 𝑟1′ ∈ 𝑔
below 𝑟1 such that 𝑟1′ ⊩ 𝜏1 ∈ 𝑂1 . Then the pair ⟨𝑟0′ , 𝑟1′ ⟩ ≤ ⟨𝑟0 , 𝑟1 ⟩ forces ⟨𝜂0 , 𝜂1 ⟩ ∈ 𝑂0 × 𝑂1
and so ⟨𝜂0 , 𝜂1 ⟩ ∉ 𝐹𝑛 , in contradiction with the initial assumptions. □
Now, let 𝜅 be an inaccessible cardinal and 𝑃 be a 𝜎-closed Suslin forcing which

is balanced cofinally below 𝜅. Let 𝑊 be the symmetric Solovay model derived from
𝜅. Suppose towards a contradiction that the conclusion of the theorem fails in the 𝑃-
extension of 𝑊. Then, in the model 𝑊 there must be a condition 𝑝 ∈ 𝑃 and a 𝑃-name
𝜏 such that 𝑝 ⊩ 𝜏 ⊂ 𝑋 is an ⊴-unbounded linearly ordered set. The condition 𝑝 as well
as the name 𝜏 must be definable from some parameter 𝑧 ∈ 2𝜔 and some parameters in
the ground model. Let 𝑉[𝐾] be a generic extension of the ground model by a poset of
size < 𝜅 such that 𝑝, 𝑧 ∈ 𝑉[𝐾] and 𝑃 is balanced in 𝑉[𝐾].
Work in the model 𝑉[𝐾]. Let 𝑝 ̄ ≤ 𝑝 be a balanced virtual condition in the poset 𝑃.
Since Coll(𝜔, < 𝜅) ⊩ 𝑝 ⊩ 𝜏 is an unbounded set in ⊴, for every element 𝑥 ∈ 𝑋 ∩ 𝑉
the set 𝜏 is forced to contain an element which is not ⊴𝑥. Since Coll(𝜔, < 𝜅) ⊩ 𝑝 ⊩
𝑋 ∩ 𝑉[𝐾] is a countable set and DC holds, 𝜏 is forced to contain a countable subset such
that no element of 𝑋 ∩ 𝑉[𝐾] is an upper bound of it. By the initial assumptions on the
preorder ⊴, this countable set is forced to have an upper bound in 𝜏, which is then an
element of 𝜏 which is not ⊴𝑥 for any element 𝑥 ∈ 𝑋 ∩ 𝑉[𝐾]. In total, in 𝑉[𝐾] there
must be a poset 𝑅 of size < 𝜅, an 𝑅-name 𝜎 for a condition in 𝑃 such that 𝜎 ≤ 𝑝 ̄ and an
unbounded 𝑅-name 𝜂 for an element of 𝑋 such that 𝑅 ⊩ 𝜂 is not ⊴-below any element
of 𝑉[𝐾] and 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜂 ∈ 𝜏.
In the model 𝑊, let 𝐻0 , 𝐻1 ⊂ 𝑅 be filters mutually generic over 𝑉[𝐾]. Let 𝑝0 =
𝜎/𝐻0 ∈ 𝑃 and 𝑝1 = 𝜎/𝐻1 ∈ 𝑃; by the balance of the condition 𝑝,̄ the conditions 𝑝0 , 𝑝1
are compatible with some lower bound 𝑞 ∈ 𝑃. Let 𝑥0 = 𝜂/𝐻0 ∈ 𝑋 and 𝑥1 = 𝜂/𝐻1 ∈ 𝑋;
by Claim 14.2.2, these are ⊴-incomparable elements of 𝑋. Since the model 𝑊 is a sym-
metric extension of both models 𝑉[𝐾][𝐻0 ] and 𝑉[𝐾][𝐻1 ], the forcing theorem applied
in these models shows that in 𝑊, 𝑞 ⊩ 𝑥0̌ , 𝑥1̌ ∈ 𝜏. This contradicts the assumption that
𝜏 is forced to be linearly ordered by ⊴. □
We do not know if it is consistent with ZF+DC to have a linearly ordered, unbounded

subset of 𝜔𝜔 under the modulo finite domination ordering, and at the same time not
to have an uncountable sequence of reals.
14.3. Measure and category

In this section, we show that in balanced extensions of the Solovay model, there is
a set of reals without the Baire property. We also provide a framework for showing that
in certain circumstances, all sets of reals may be Lebesgue measurable. The following
theorem is stated using Convention 1.7.18.
Theorem 14.3.1. In nontrivial cofinally balanced extensions of the symmetric Solo-
vay model, there is a set of reals without the Baire property.
Proof. Let 𝜅 be an inaccessible cardinal. Let 𝑃 be a nontrivial Suslin forcing such
that 𝑉𝜅 ⊧ 𝑃 is balanced in every forcing extension. Let 𝑊 be the symmetric Solovay
model derived from 𝜅 and work in 𝑊. Let 𝑝 ∈ 𝑃 be a condition. We must find a Polish
space 𝑋, a condition 𝑝 ̄ ≤ 𝑝 and a 𝑃-name 𝜏 for a subset of 𝑋 such that 𝑝 ̄ ⊩ 𝜏 does not
have the Baire property.
The condition 𝑝 ∈ 𝑃 is definable from a real parameter 𝑧 ∈ 2𝜔 and some parame-
ters in the ground model. Let 𝑉[𝐾] be an intermediate extension using a poset of size
< 𝜅 such that 𝑧 ∈ 𝑉[𝐾] and 𝑃 is balanced in 𝑉[𝐾], and work in 𝑉[𝐾] for a moment. Let
𝑝 ̄ ≤ 𝑝 be a balanced virtual condition stronger than 𝑃. Choose a poset 𝑄 of size < 𝜅 and
a name 𝜎 for a condition in 𝑃 such that the pair ⟨𝑄, 𝜎⟩ is balanced and in the balance
equivalence class of 𝑝.̄ Move to the 𝑄-extension. Since the poset 𝑃 is balanced, it is not
c.c.c. below 𝜎 by Proposition 5.2.11(1), in particular it is not Suslin 𝜎-linked below 𝜎.
Thus, the analytic graph of incompatibility of conditions in 𝑃 below 𝜎 has uncountable
Borel chromatic number. By the 𝔾0 -dichotomy (Fact 11.1.5), there is a 𝑄-name for a
continuous map ℎ ∶ 2𝜔 → 𝑃 which is a homomorphism of 𝔾0 to the incompatibility
graph on 𝑃 below 𝜎. Let 𝑆 be the Cohen forcing on 2𝜔 introducing a point 𝑦𝑔𝑒𝑛 ̇ ; let 𝑝gen
̇
̇
be the 𝑄 × 𝑆-name for ℎ(𝑦𝑔𝑒𝑛 ̇ ).
Now, back in 𝑊, consider the space 𝑋 of all filters on the two-step iteration 𝑄 × 𝑆
generic over the model 𝑉[𝐾], viewed as a subset of 𝒫(𝑄 × 𝑆). Since the product is
countable in 𝑊, its powerset gets the usual zero-dimensional compact topology. Since
the model 𝑉[𝐾] contains only countably many open dense subsets of the product, the
set 𝑋 ⊂ 𝒫(𝑄 × 𝑆) is 𝐺𝛿 and therefore Polish. Let 𝜏 be the 𝑃-name for the set of all
filters 𝑔 ∈ 𝑋 such that the condition 𝑝gen ̇ /𝑔 ∈ 𝑃 belongs to the generic filter on 𝑃;
more formally, 𝜏 = {⟨𝑔, 𝑝gen ̇ /𝑔⟩ ∶ 𝑔 ∈ 𝑋}. We claim that 𝑝 ̄ ⊩ 𝜏 does not have the Baire
property.
To show this, first argue that 𝑝 ̄ ⊩ 𝜏 ⊂ 𝑋 is not meager. Suppose towards a con-
tradiction that this fails. Then in the model 𝑉[𝐾], there exist a poset 𝑅 of size < 𝜅 and
𝑅-names 𝜎 for a condition in 𝑃 stronger than 𝑝 ̄ and 𝜂 for a dense 𝐺𝛿 subset of 𝑋 such
that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃 𝜏 ∩ 𝜂 = 0. Let 𝐺 ⊂ 𝑄 × 𝑆 and 𝐻 ⊂ 𝑅 be mutually
generic filters. By a mutual genericity argument, 𝐺 ∈ 𝜂/𝐻 holds. By a balance ar-
gument (Proposition 5.2.4), the conditions 𝜎/𝐻 and 𝑝gen ̇ /𝐺 are compatible in 𝑃. The
common lower bound of these two conditions forces in 𝑃 that 𝐺̌ ∈ 𝜂/𝐻 ∩ 𝜏. This is a
contradiction.
We will now argue that 𝑝 ̄ ⊩ 𝜏 is not comeager in any nonempty open subset of 𝑋.
Suppose towards a contradiction that this fails. Then in the model 𝑉[𝐾], there must
be a condition ⟨𝑞, 𝑠⟩ ∈ 𝑄 × 𝑆, a poset 𝑅 of size < 𝜅 and 𝑅-names 𝜎 for a condition in 𝑃
stronger than 𝑝 ̄ and 𝜂 for a dense 𝐺𝛿 subset of 𝑋 such that 𝑅 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝜎 ⊩𝑃
∀𝑔 ∈ 𝜂 ⟨𝑞, 𝑠⟩ ∈ 𝑔 → 𝑔 ∈ 𝜏. Let 𝐿 ⊂ 𝑄 and 𝐻 ⊂ 𝑅 be mutually generic filters, with 𝑞 ∈ 𝐿.
A standard argument provides (in a further generic extension) two 𝔾0 -related points
𝑦0 , 𝑦1 ∈ 2𝜔 extending 𝑠 which are separately 𝑆-generic over the model 𝑉[𝐾][𝐻][𝐿]. Let
𝐺0 , 𝐺1 ⊂ 𝑄 × 𝑆 be the filters given by 𝐿, 𝑦0 and 𝐿, 𝑦1 respectively; both contain the con-
dition ⟨𝑞, 𝑠⟩. By the product forcing theorem, the filters 𝐺0 , 𝐻 are mutually generic over
14.3. MEASURE AND CATEGORY 317
𝑉[𝐾] and so are the filters 𝐺1 , 𝐻. By a mutual genericity argument, both filters 𝐺0 , 𝐺1
both belong to the set 𝜂/𝐻. By a balance argument (Proposition 5.2.4), the condition
𝑝gen
̇ /𝐺0 is compatible with 𝜎/𝐻 in the poset 𝑃. Their common lower bound forces in
the poset 𝑃 that 𝐺1̌ ∈ 𝜂/𝐻 ⧵ 𝜏 by the assumed properties of the homomorphism ℎ. This
is a contradiction. □
Question 14.3.2. Does the conclusion of Theorem 14.3.1 remain in force in weak-
ly balanced extensions of the symmetric Solovay model?
Other regularity properties of sets of reals may be preserved in balanced extensions.

Consider the following.
Definition 14.3.3. Let 𝑄 be a c.c.c. Suslin forcing. Let 𝑃 be a Suslin forcing. We

say that 𝑃 is 𝑄-balanced if for every condition 𝑝 ∈ 𝑃 there is a balanced virtual condition
𝑝 ̄ ≤ 𝑝 such that 𝑄 ⊩ 𝑝 ̄ is still balanced. Similar terminology applies for weakly 𝑄-
balanced forcings.
For the following theorem, let 𝑋 be a Polish space, let 𝑥𝑔𝑒𝑛

̇ be a 𝑄-name for an element
of 𝑋, and let 𝐼 be the 𝜎-ideal of Borel subsets 𝐵 ⊂ 𝑋 such that 𝑄 ⊩ 𝑥𝑔𝑒𝑛̇ ∉ 𝐵.̇ The
theorem is stated using Convention 1.7.18.
Theorem 14.3.4. In 𝑄-weakly balanced extensions of the symmetric Solovay model,

for every set 𝐴 ⊂ 𝑋 there is a Borel set 𝐵 ⊂ 𝑋 such that 𝐴Δ𝐵 ∈ 𝐼.

𝑄-balanced below 𝜅. Let 𝑊 be the symmetric Solovay model derived from 𝜅 and work
in 𝑊. Let 𝑝 ∈ 𝑃 be a condition and 𝜏 be a 𝑃-name such that 𝑝 ⊩ 𝜏 ⊂ 𝑋. We must find
a Borel set 𝐵 and a stronger condition 𝑝 ̄ ≤ 𝑝 in 𝑃 such that 𝑝 ̄ ⊩ 𝜏Δ𝐵̇ ∈ 𝐼.
The condition 𝑝 ∈ 𝑃 and the name 𝜏 are definable from a real parameter 𝑧 ∈ 2𝜔
and some parameters in the ground model. Let 𝑉[𝐾] be an intermediate extension us-
ing a poset of size < 𝜅 such that 𝑧 ∈ 𝑉[𝐾] and work in the model 𝑉[𝐾]. Since 𝑃 is
weakly 𝑄-balanced in 𝑉[𝐾], it must be the case that there is a weakly balanced virtual
condition 𝑝 ̄ ≤ 𝑝 such that 𝑄 ⊩ 𝑝 ̄ is weakly balanced. By a balance argument (Proposi-
tion 5.2.4), 𝑄 ⊩ Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ decides the statement 𝑥𝑔𝑒𝑛 ̇ ∈ 𝜏. Let 𝐴 = 𝐴0 ∪ 𝐴1 be
a maximal antichain of 𝑄 such that for every condition 𝑞 ∈ 𝐴0 , 𝑞 ⊩𝑄 Coll(𝜔, < 𝜅) ⊩
𝑝 ̄ ⊩𝑃 𝑥𝑔𝑒𝑛̇ ∉ 𝜏, and for every condition 𝑞 ∈ 𝐴1 , 𝑞 ⊩𝑄 Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩𝑃 𝑥𝑔𝑒𝑛 ̇ ∈ 𝜏.
𝑉 [𝐾]
In 𝑊, let 𝐵 = {𝑥 ∈ 𝑋 ∶ ∃𝑔 ⊂ 𝑄 ∶ 𝑔 is generic over 𝑉[𝐾] and contains a condition in
𝐴1 , and 𝑥 = 𝑥𝑔𝑒𝑛̇ /𝑔}. A complexity calculation as in Proposition 2.8.5(1) shows that the
set 𝐵 is Borel since the model 𝑉[𝐾] contains only countably many maximal antichains
of 𝑄. It will be enough to show that 𝑝 ̄ ⊩ 𝜏Δ𝐵 ∈ 𝐼.
On one hand, it is clear that 𝐵 ⊂ 𝜏 must hold. Whenever 𝑥 ∈ 𝐵 is a point and
𝑔 ⊂ 𝑄 is a filter generic over 𝑉[𝐾] containing a condition in 𝐴1 and 𝑥𝑔𝑒𝑛 ̇ /𝑔 = 𝑥, then
by the forcing theorem in the model 𝑉[𝐾], 𝑉[𝐾][𝑔] ⊧ Coll(𝜔, < 𝜅) ⊩ 𝑝 ̄ ⊩ 𝑥̌ ∈ 𝜏, and
then by the forcing theorem in 𝑉[𝐾][𝑔], 𝑊 ⊧ 𝑝 ̄ ⊩ 𝑥̌ ∈ 𝜏. By similar reasoning, it must
be the case that 𝜏 ⧵ 𝐵 ⊂ 𝐶 where 𝐶 = {𝑥 ∈ 𝑋 ∶ for no filter 𝑔 ⊂ 𝑄𝑉 [𝐾] generic over
𝑉[𝐾], 𝑥𝑔𝑒𝑛̇ /𝑔 = 𝑥}. Note that the set 𝐶 ⊂ 𝑋 is Borel by Proposition 2.8.5(1) again. Now,
it is clear that 𝐶 ∈ 𝐼 holds: if there were a condition 𝑞 ∈ 𝑄 forcing 𝑥𝑔𝑒𝑛
̇ ∈ 𝐶, taking any
filter 𝐺 ⊂ 𝑄 generic over 𝑊 containing the condition 𝑞, the point 𝑥𝑔𝑒𝑛 ̇ /𝐺 must belong
to 𝐶. However, since the poset 𝑄 is c.c.c. and Suslin, the filter 𝐺 ∩ 𝑉[𝐾] is a filter on
𝑄𝑉 [𝐾] generic over 𝑉[𝐾] and so the point 𝑥 = 𝑥𝑔𝑒𝑛

̇ /𝐺 ∩ 𝑉[𝐾] does not belong to 𝐶,
which is a contradiction. □
Example 14.3.5. [94] It is consistent relative to an inaccessible cardinal that

ZF+DC holds, every set of reals is Lebesgue measurable, and not every set of reals
has the Baire property. For this, use the 𝑃-extension of the Solovay model poset where
the Suslin forcing 𝑃 is as in Example 8.9.4 and the Suslin c.c.c. poset 𝑄 of closed subsets
of ℝ of positive Lebesgue measure ordered by inclusion, with its associated name for
the generic real. It is clear that the associated ideal 𝐼 is just the ideal of Lebesgue null
sets. Now, the balanced virtual conditions for 𝑃 have been classified in Theorem 8.9.2.
Let 𝑝 = ⟨𝑎𝑝 , 𝑏𝑝 ⟩ be a condition. Then the (collapse name for the) pair 𝑝 ̄ = ⟨𝑎𝑝 , 𝑐⟩ is
a balanced virtual condition whenever 𝑐 is a dominating set of functions in 𝜔𝜔 in the
ground model. Now, the poset 𝑄 is bounding, therefore the set 𝑏𝑝 remains dominating
in the 𝑄-extension and 𝑝 ̄ is a balanced virtual condition in the 𝑄-extension as well. By
Theorem 14.3.4, in the 𝑃-extension of the Solovay model, every set of reals is Lebesgue
measurable. In that extension, there must be a set of reals without the Baire property
by Theorem 14.3.1.
Example 14.3.6. It is consistent relative to an inaccessible cardinal that ZF plus

DC holds, every set of reals is Lebesgue measurable, and there is a maximal almost
disjoint family. For this, use the 𝑃-extension of the symmetric Solovay model where 𝑃
is the MAD forcing of Definition 8.10.6. It will be enough to show that 𝑃 is 𝑄-weakly
balanced, where 𝑄 is the Suslin c.c.c. poset 𝑄 of closed subsets of ℝ of positive Lebesgue
measure ordered by inclusion. Now, certain weakly balanced virtual conditions for 𝑃
have been discovered in Theorem 8.10.7. Let 𝑝 = ⟨𝑎𝑝 , 𝑏𝑝 ⟩ be a condition. Then any
(collapse name for a) pair 𝑝 ̄ = ⟨𝑎𝑝 , 𝑐⟩ is a weakly balanced virtual condition where 𝑐 is
the set of all pairs ⟨𝑎𝑝 , 𝑠⟩ where 𝑠 is a partition of 𝜔 into finite intervals in the ground
model. Now, let 𝐺 ⊂ 𝑄 be a generic filter, and in the extension 𝑉[𝐺], consider any
(collapse name for a) pair 𝑝 ̃ = ⟨𝑎𝑝 , 𝑑⟩ where 𝑑 is the set of all pairs ⟨𝑎𝑝 , 𝑠⟩ where 𝑠 is
a partition of 𝜔 into finite intervals in 𝑉[𝐺]. By Theorem 8.10.7 applied in 𝑉[𝐺], 𝑝 ̃ is
a weakly balanced virtual condition in 𝑉[𝐺]. Since the poset 𝑄 is bounding, for every
partition 𝑠 ∈ 𝑉[𝐺] of 𝜔 into finite intervals there is a partition 𝑡 ∈ 𝑉 of 𝜔 such that
every interval in 𝑡 contains a subinterval in 𝑠. It follows immediately from the definition
of the poset 𝑃 that 𝑝,̄ 𝑝 ̃ are inseparable in the poset 𝑃; in particular, 𝑝 ̄ is still a weakly
balanced virtual condition in 𝑉[𝐺].
14.4. The Ramsey ultrafilter extension

Let 𝑃 be the poset of infinite subsets of 𝜔 ordered by inclusion. Let 𝜅 be an in-
accessible cardinal, and let 𝑊 be the symmetric Solovay model derived from 𝜅. Let
𝑈 ⊂ 𝑃 be a filter generic over 𝑊. The model 𝑊[𝑈] is a balanced extension of 𝑊 by
Theorem 7.1.2. It is immediate that 𝑈 is a nonprincipal ultrafilter on 𝜔 and in fact a
Ramsey ultrafilter. The model 𝑊[𝑈] has been investigated for decades [22, 23, 32, 44].
We have provided new information about the model at several locations in this book.
In this section, we outline several major areas of study of the model 𝑊[𝑈] and gather
the available known results as well as critical open questions.
14.4. THE RAMSEY ULTRAFILTER EXTENSION 319
Question 14.4.1. Classify the Borel equivalence relations 𝐸, 𝐹 on Polish spaces

such that in 𝑊[𝑈], |𝐸| ≤ |𝐹| holds. In particular, are there Borel equivalence relations
𝐸, 𝐹 such that |𝐸| ≤ |𝐹| fails in the symmetric Solovay model 𝑊 and holds in 𝑊[𝑈]?
We have proved that in 𝑊[𝑈], the smooth divide is preserved (Corollary 9.2.5, previ-
ously known to [22]), the orbit divide is preserved (Corollary 9.4.8), and the 𝐸𝐾𝜍 -divide
is preserved (Corollary 9.5.10). However, our efforts stalled in other directions. We
do not know if the turbulent divide is preserved. We do not know if there are any
non-hyperfinite countable Borel equivalence relations 𝐸 such that |𝐸| ≤ |𝔼0 | holds in
𝑊[𝑈]; in principle, this inequality could hold for all countable Borel equivalence rela-
tions whatsoever.
Question 14.4.2. Classify the Borel equivalence relations 𝐸 such that the 𝐸-quo-
tient space is linearly ordered in 𝑊[𝑈].
As a basic affirmative result in this direction, we show that 𝔼0 and 𝔼1 -quotient spaces
are linearly ordered in 𝑊[𝑈]. To see this, observe in ZF+DC plus the existence of a
nonprincipal ultrafilter on 𝜔 that the class of linearly orderable equivalence relations
is closed under countable increasing unions. For the proof, let 𝑋 be a Polish space and
⟨𝐸𝑛 ∶ 𝑛 ∈ 𝜔⟩ be an increasing sequence of analytic equivalence relations on 𝑋, each
with linearly orderable quotient space. Use the DC assumption to pick linear orders ≤𝑛
for each of them. Let 𝑈 be a nonprincipal ultrafilter on 𝜔. If 𝑥, 𝑦 ∈ 𝑋 are 𝐸-unrelated
elements, then let [𝑥]𝐸 ≤ [𝑦]𝐸 if the set 𝑎(𝑥, 𝑦) = {𝑛 ∈ 𝜔 ∶ [𝑥]𝐸𝑛 ≤𝑛 [𝑦]𝐸𝑛 } belongs
to the ultrafilter 𝑈. If 𝑥′ 𝐸 𝑥 and 𝑦′ 𝐸 𝑦 are different representatives of the 𝐸-classes
of 𝑥, 𝑦, then there is a number 𝑚 ∈ 𝜔 such that 𝑥 𝐸𝑚 𝑥′ and 𝑦 𝐸𝑚 𝑦′ ; therefore, the
symmetric difference 𝑎(𝑥, 𝑦)Δ𝑎(𝑥′ , 𝑦′ ) is a subset of 𝑚, and the definition of ≤ does not
depend on the choice of the equivalence class representatives. It is easy to check that
≤ is a linear ordering on the 𝐸-classes.
As a basic negative result, the 𝔽2 -quotient space is not linearly ordered in 𝑊[𝑈];
it even carries no tournament by Theorem 10.2.9 and Example 10.3.8. Another nega-
tive result, Theorem 14.4.5 below, shows that the 𝔼2 -quotient space cannot be linearly
ordered. For an attractive open instance of Question 14.4.2, consider the case any non-
hyperfinite countable Borel equivalence relation 𝐸.
Another attractive question scheme is the following.
Question 14.4.3. Let 𝑋 be an uncountable Polish space. Classify the Borel sets
𝐴 ⊂ [𝑋]ℵ0 such that in 𝑊[𝑈], there is a function 𝑓 assigning to each set 𝑎 ∈ 𝐴 an
ultrafilter on 𝑎.
As a basic affirmative result in this direction, if 𝐸 is a hyperfinite countable Borel equiv-
alence relation on 𝑋, then there is an assignment of ultrafilters to 𝐸-classes in 𝑊[𝑈].
To see this, let 𝐸𝑛 for 𝑛 ∈ 𝜔 be equivalence relations with all classes finite forming an
inclusion-increasing sequence such that 𝐸 = ⋃𝑛 𝐸𝑛 . For the first item, let ≤ be any
linear ordering of 𝑋. For each point 𝑥 ∈ 𝑋 let 𝑥(𝑛) be the ≤-least element of 𝑋 which
is 𝐸𝑛 -related to 𝑋. Let 𝑈𝑥 = {𝑎 ⊂ [𝑥]𝐸 ∶ {𝑛 ∈ 𝜔 ∶ 𝑥(𝑛) ∈ 𝑎} ∈ 𝑈}. Thus, 𝑈𝑥 is an ul-
trafilter on [𝑥]𝐸 and 𝑥 𝐸 𝑦 implies that 𝑈𝑥 = 𝑈𝑦 since 𝑈 is nonprincipal and for some
𝑚 ∈ 𝜔 𝑥 𝐸𝑚 𝑦 holds, and then for all 𝑛 > 𝑚 𝑥(𝑛) = 𝑦(𝑛) holds.
As a basic negative result in this direction, there is no assignment of ultrafilters to
all countable subsets of 𝑋 in 𝑊[𝑈]. To see this, suppose towards a contradiction that
𝑓 is a function assigning to each set 𝑎 ∈ [𝑋]ℵ0 an ultrafilter on 𝑎. Let 𝑇 = {⟨𝑎, 𝑏⟩ ∈

([𝑋]ℵ0 )2 ∶ 𝑎 ⧵ 𝑏 ∈ 𝑓(𝑎Δ𝑏)}. Note that 𝑇 is a tournament on [𝑋]ℵ0 : given any sets
𝑎, 𝑏 ∈ [𝑋]ℵ0 , the set 𝑎Δ𝑏 is a disjoint union of 𝑎 ⧵ 𝑏 and 𝑏 ⧵ 𝑎, so the ultrafilter 𝑓(𝑎Δ𝑏)
contains exactly one of the two pieces. However, in 𝑊[𝑈] there is no tournament on
[𝑋]ℵ0 by Theorem 10.2.9 and Example 10.3.8.
As a basic open instance, let Γ be the free group on two generators acting on 2Γ by
shift and let 𝑋 ⊂ Γ be the 𝐺𝛿 set of points on which Γ acts freely. Let 𝐸 be the orbit
equivalence relation on 𝑋. Is there an assignment of ultrafilters to 𝐸-classes? This
seemingly arbitrary question relates to the quotient cardinal question 14.4.1. It is well-
known that 𝐸 is not Borel reducible to 𝔼0 [37, Thoerm 7.4.10]. However, an assignment
of ultrafilters to Γ-orbits yields in ZF the cardinal inequality |𝐸| ≤ |𝔼0 |. To see this, let Δ
be the acyclic locally finite Cayley graph on 𝑋 and let Δ⃗ be the orientation of the Cayley
graph defined by ⟨𝑥, 𝑦⟩ ∈ Δ⃗ if the set of {𝑧 ∈ 𝑋 ∶ the unique injective Cayley path from
𝑥 to 𝑧 includes 𝑦} belongs to the ultrafilter assigned to [𝑥]𝐸 . Clearly, every vertex gets
outflow one in the orientation Δ.⃗ Now, apply the argument after Example 9.2.15 to
conclude that |𝐸| ≤ |𝔼0 | must hold.
Question 14.4.4. Classify the ultrafilters on 𝜔 in 𝑊[𝑈]. In particular, for which
Borel ideals 𝐼 on 𝜔 is there an ultrafilter 𝐹 in 𝑊[𝑈] such that 𝐼 ∩ 𝐹 = 0?
As the only nontrivial result in this section, we now prove that there is no ultrafilter in
𝑊[𝑈] which is disjoint from the summable ideal.
Theorem 14.4.5. Let 𝑃 be the poset of infinite subsets of 𝜔 ordered by inclusion. In
the 𝑃-extension of the symmetric Solovay model, the complement graph associated with
the summable ideal on 𝜔 cannot be oriented.
Proof. Write 𝐼 for the summable ideal on 𝜔; i.e. 𝐼 consists of sets 𝑎 ⊂ 𝜔 such that
1
the sum Σ{ ∶ 𝑛 ∈ 𝑎} is finite. Towards a contradiction, let 𝜅 be an inaccessible car-
𝑛+1
dinal, let 𝑊 be a symmetric Solovay model derived from 𝜅, let 𝑝 ∈ 𝑃 be a condition and
𝜏 be a 𝑃-name such that 𝑝 ⊩ 𝜏 is an orientation of the complement graph associated
with 𝐼. Both 𝑝, 𝜏 must be definable from some real parameter 𝑧 ∈ 2𝜔 and some ground
model parameters. Let 𝑉[𝐾] be an intermediate extension of the ground model by a
poset of size < 𝜅 containing the parameter 𝑧, and work in the model 𝑉[𝐾].
We will produce a poset 𝑄 and a 𝑄-name 𝑥𝑔𝑒𝑛 ̇ for an element of 2𝜔 such that
(I) below every condition 𝑞 ∈ 𝑄 there are conditions 𝑞0 , 𝑞1 ≤ 𝑞 and an automor-
phism 𝜋 ∶ 𝑄 ↾ 𝑞0 → 𝑄 ↾ 𝑞1 such that 𝜋(𝑥𝑔𝑒𝑛 ̇ ) is forced by 𝑞1 to be equal to
1 − 𝑥𝑔𝑒𝑛
̇ modulo 𝐼;
(II) the ultrafilter added by 𝑃 still generates an ultrafilter in the 𝑃 × 𝑄-extension.
Once this is done, let 𝐺 ⊂ 𝑃 and 𝐻 ⊂ 𝑄 be mutually generic filters over the model
𝑉[𝐾], with 𝑝 ∈ 𝐺, and work in 𝑉[𝐾][𝐺][𝐻]. Let 𝑥 = 𝑥𝑔𝑒𝑛 ̇ /𝐻. Let 𝑈 be the ultrafilter on
𝜔 generated by the filter 𝐺; this is possible by the item (II) above. By Theorem 7.1.2, 𝑈
is a balanced virtual condition in the poset 𝑃 in the model 𝑉[𝐾][𝐺][𝐻]. The following
is proved by a standard argument using the balance of 𝑈:
Claim 14.4.6. In the model 𝑉[𝐾][𝐺][𝐻], either Coll(𝜔, < 𝜅) ⊩ 𝑈 ⊩𝑃 ⟨𝑥, 1−𝑥⟩ ∈ 𝜏,
or Coll(𝜔, < 𝜅) ⊩ 𝑈 ⊩𝑃 ⟨1 − 𝑥, 𝑥⟩ ∈ 𝜏 holds.
Suppose for definiteness that the former alternative prevails. Find a condition 𝑞 ∈ 𝐻
which forces it, and find conditions 𝑞0 , 𝑞1 ≤ 𝑞 and an automorphism 𝜋 ∶ 𝑄 ↾ 𝑞0 → 𝑄 ↾
14.4. THE RAMSEY ULTRAFILTER EXTENSION 321
𝑞1 as in item (I). Find a filter 𝐻0 ⊂ 𝑄 generic over 𝑉[𝐾][𝐺] meeting the condition 𝑞0 ,
and let 𝐻1 = 𝜋″ 𝐻0 . Let 𝑥0 , 𝑥1 ∈ 2𝜔 be the points associated with the filters 𝐻0 , 𝐻1 .
Then the models 𝑉[𝐾][𝐺][𝐻0 ] and 𝑉[𝐾][𝐺][𝐻1 ] are equal, and by the forcing theorem
applied in 𝑉[𝐾][𝐺], it must be true in 𝑊 that 𝑈 ⊩𝑃 ⟨𝑥0 , 1 − 𝑥0 ⟩ ∈ 𝜏, ⟨𝑥1 , 1 − 𝑥1 ⟩ ∈ 𝜏.
This is impossible though as 𝑥0 = 1 − 𝑥1 modulo 𝐼 and 𝜏 is forced to be a tournament.
The remainder of the proof consists of the construction of the poset 𝑄 satisfying (I)
and (II). This is a pure ZFC construction in which the concentration of measure phe-
nomenon is a critical ingredient. Let ⟨𝐽𝑛 ∶ 𝑛 ∈ 𝜔⟩ be a very fast sequence of successive
intervals on 𝜔. The following is the concentration of measure type of demand on the
intervals in question that we need. Let 𝜇𝑛 be the normalized counting measure on 2𝐽𝑛 .
1
Let 𝑑𝑛 be the metric on 2𝐽𝑛 defined by 𝑑𝑛 (𝑥, 𝑦) = Σ{ ∶ 𝑥(𝑚) ≠ 𝑦(𝑚)}. We demand
𝑚+1
that the following holds for every 𝑛 ∈ 𝜔:
(III) for every set 𝑎 ⊂ 2𝐽𝑛 of 𝜇𝑛 -mass 1/𝑛, the 2−𝑛 -neigborhood of 𝑎 in 2𝐽𝑛 in the
sense of the metric 𝑑𝑛 has 𝜇𝑛 -mass greater than 1/2.
The concentration of measure computations in [86, Theorem 4.3.19] show that such a
fast sequence of intervals indeed exists. Now, let 𝑇ini be the tree of all finite sequences
𝑡 such that for each 𝑛 ∈ dom(𝑡), 𝑡(𝑛) ∈ 2𝐽𝑛 . Let 𝑄 be the partial order of all nonempty
trees 𝑞 ⊂ 𝑇ini without endnodes such that for each 𝑚 ∈ 𝜔 there is 𝑛𝑚 ∈ 𝜔 such that
for each 𝑡 ∈ 𝑞 of length 𝑛 > 𝑛𝑚 , the set {𝑥 ∈ 2𝐽𝑛 ∶ 𝑡⌢ ⟨𝑥⟩ ∈ 𝑞} has 𝜇𝑛 -mass ≥ 𝑚/𝑛. The
ordering on 𝑄 is that of inclusion. Let 𝑥𝑔𝑒𝑛 ̇ be the 𝑄-name for the concatenation of the
trunks of the trees in the generic filter. We must show that items (I) and (II) above hold
for 𝑄 and 𝑥𝑔𝑒𝑛̇ .
Item (I) is where the concentration of measure shows up in force. We will in fact
show that whenever 𝑞0 , 𝑞1 ∈ 𝑄 are arbitrary conditions then there are conditions 𝑞′0 ≤
𝑞0 , 𝑞′1 ≤ 𝑞1 and an isomorphism 𝜋 ∶ 𝑄 ↾ 𝑞′0 → 𝑄 ↾ 𝑞′1 such that 𝜋(1 − 𝑥𝑔𝑒𝑛 ̇ ) is forced
by 𝑞′1 to be modulo 𝐼 equivalent to 𝑥𝑔𝑒𝑛 ̇ . To see this, let 𝑡0 ∈ 𝑞0 , 𝑡1 ∈ 𝑞1 be nodes of
the same length such that for every node 𝑡 ∈ 𝑞0 of length 𝑛 ≥ |𝑡0 |, the set 𝑎0 (𝑡) =
{𝑥 ∈ 2𝐽𝑛 ∶ 𝑡⌢ ⟨𝑥⟩ ∈ 𝑞0 } has 𝜇𝑛 -mass at least 2/𝑛, and for every node 𝑡 ∈ 𝑞1 of length
𝑛 ≥ |𝑡0 |,the set 𝑎1 (𝑡) = {𝑥 ∈ 2𝐽𝑛 ∶ 𝑡⌢ ⟨𝑥⟩ ∈ 𝑞1 } has 𝜇𝑛 -mass at least 2/𝑛 as well. We will
produce a tree 𝑞′0 ≤ 𝑞0 ↾ 𝑡0 in 𝑄 and a level and order preserving injection 𝜋 ∶ 𝑞′0 →
𝑞1 ↾ 𝑡1 so that
(IV) for each node 𝑡 ∈ 𝑞′0 and each number 𝑛 > |𝑡0 | in dom(𝑡), 𝑑𝑛 (𝑡(𝑛), 1 −
𝜋(𝑡)(𝑛)) < 2−𝑛+1 .
Write 𝑞′1 = 𝜋″ 𝑞′0 . Since the measures 𝜇𝑛 are normalized counting measures, the map
𝜋 naturally extends to an isomorphism 𝜋 ∶ 𝑄 ↾ 𝑞′0 → 𝑄 ↾ 𝑞′1 . The demand (IV) then
implies that 𝜋(1 − 𝑥𝑔𝑒𝑛̇ ) is forced by 𝑞′1 to be modulo 𝐼 equivalent to 𝑥𝑔𝑒𝑛
̇ as required.
The map 𝜋 is obtained by a hungry algorithm. Among all level and order preserv-
ing injections from subsets of 𝑞0 ↾ 𝑡0 to 𝑞1 ↾ 𝑡1 which satisfy (IV), select an inclusion
maximal one and call it 𝜋. It will be enough to show that 𝑞′0 = dom(𝜋) belongs to
𝑄. To see this, first of all 𝑞′0 is closed under initial segment by an obvious maximality
argument. To verify the branching condition in the definition of 𝑄 for 𝑞′0 , let 𝑡 ∈ 𝑞′0 be
of length some 𝑛 ≥ |𝑡0 |. It will be enough to argue that the set {𝑥 ∈ 2𝐽𝑛 ∶ 𝑡⌢ ⟨𝑥⟩ ∈ 𝑞′0 }
has 𝜇𝑛 -mass at least min(𝜇𝑛 (𝑎0 (𝑡)), 𝜇𝑛 (𝑎1 (𝜋(𝑡))) − 1/𝑛.
To do this, note that if both sets 𝑏0 = {𝑥 ∈ 2𝐽𝑛 ∶ 𝑡⌢ ⟨𝑥⟩ ∈ 𝑞0 ⧵ 𝑞′0 } and 𝑏1 =

{𝑥 ∈ 2𝐽𝑛 ∶ 𝑡⌢ ⟨𝑥⟩ ∈ 𝑞1 ⧵ 𝜋(𝑞′0 )} had 𝜇𝑛 -mass greater than 1/𝑛, then by (III) the 2−𝑛 -
neighborhood of 𝑏0 and the set {1 − 𝑥 ∶ 𝑥 ∈ 𝑏1 } would both have 𝜇𝑛 -mass greater than
1/2 and so they would intersect, making it possible to extend 𝜋 while satisfying (IV)
and contradicting the maximality of 𝜋.
Item (II) follows from a density argument on 𝑃 and 𝑄 given the fact that the poset
𝑄 is proper and does not add independent reals [115, Theorem 4.4.8]. □
Corollary 14.4.7.
(1) Let 𝑃 = 𝒫(𝜔) modulo finite. In the 𝑃-extension of the symmetric Solovay model,
there is no ultrafilter on 𝜔 disjoint from the summable ideal.
a nonprincipal ultrafilter on 𝜔, yet there is no ultrafilter disjoint from the sum-
mable ideal.
Bibliography
[1] Francis Adams and Jindřich Zapletal, Cardinal invariants of closed graphs, Israel J. Math. 227 (2018),
no. 2, 861–888, DOI 10.1007/s11856-018-1745-6. MR3846345
[2] Martin Aigner, Combinatorial theory, Grundlehren der Mathematischen Wissenschaften [Fundamen-
tal Principles of Mathematical Sciences], vol. 234, Springer-Verlag, Berlin-New York, 1979. MR542445
[3] Reinhold Baer, Abelian groups that are direct summands of every containing abelian group, Bull. Amer.
Math. Soc. 46 (1940), 800–806, DOI 10.1090/S0002-9904-1940-07306-9. MR2886
[4] Bohuslav Balcar, Thomas Jech, and Jindřich Zapletal, Semi-Cohen Boolean algebras, Ann. Pure Appl.
Logic 87 (1997), no. 3, 187–208, DOI 10.1016/S0168-0072(97)00009-2. MR1474561
[5] John T. Baldwin and Paul B. Larson, Iterated elementary embeddings and the model theory of infinitary
logic, Ann. Pure Appl. Logic 167 (2016), no. 3, 309–334, DOI 10.1016/j.apal.2015.12.004. MR3437649
[6] John T. Baldwin, Sy D. Friedman, Martin Koerwien, and Michael C. Laskowski, Three red her-
rings around Vaught’s conjecture, Trans. Amer. Math. Soc. 368 (2016), no. 5, 3673–3694, DOI
10.1090/tran/6572. MR3451890
[7] Tomek Bartoszyński and Haim Judah, Set theory: On the structure of the real line, A K Peters, Ltd.,
Wellesley, MA, 1995. MR1350295
[8] James E. Baumgartner and Alan D. Taylor, Partition theorems and ultrafilters, Trans. Amer. Math. Soc.
241 (1978), 283–309, DOI 10.2307/1998845. MR491193
[9] A. Bella, A. Dow, K. P. Hart, M. Hrušák, J. van Mill, and P. Ursino, Embeddings into 𝒫(ℕ)/fin and exten-
sion of automorphisms, Fund. Math. 174 (2002), no. 3, 271–284, DOI 10.4064/fm174-3-7. MR1925004
[10] Mariam Beriashvili, Ralf Schindler, Liuzhen Wu, and Liang Yu, Hamel bases and well-ordering the con-
tinuum, Proc. Amer. Math. Soc. 146 (2018), no. 8, 3565–3573, DOI 10.1090/proc/14010. MR3803680
[11] Andreas Blass, Ultrafilters related to Hindman’s finite-unions theorem and its extensions, Logic and
combinatorics (Arcata, Calif., 1985), Contemp. Math., vol. 65, Amer. Math. Soc., Providence, RI, 1987,
pp. 89–124, DOI 10.1090/conm/065/891244. MR891244
[12] Andreas Blass, Natasha Dobrinen, and Dilip Raghavan, The next best thing to a P-point, J. Symb. Log.
80 (2015), no. 3, 866–900, DOI 10.1017/jsl.2015.31. MR3395353
[13] Jörg Brendle, Fabiana Castiblanco, Ralf Schindler, Liuzhen Wu, and Liang Yu, A model with everything
except a well-ordering of the reals, arXiv:1809.10420, 2018.
[14] Jörg Brendle and Michael Hrušák, Countable Fréchet Boolean groups: an independence result, J. Sym-
bolic Logic 74 (2009), no. 3, 1061–1068, DOI 10.2178/jsl/1245158099. MR2548480
[15] Boris Bukh, Measurable sets with excluded distances, Geom. Funct. Anal. 18 (2008), no. 3, 668–697,
DOI 10.1007/s00039-008-0673-8. MR2438995
[16] Lev Bukovský, Iterated ultrapower and Prikry’s forcing, Comment. Math. Univ. Carolinae 18 (1977),
no. 1, 77–85. MR446978
[17] Andrés Eduardo Caicedo, John Daniel Clemens, Clinton Taylor Conley, and Benjamin David Miller,
Definability of small puncture sets, Fund. Math. 215 (2011), no. 1, 39–51, DOI 10.4064/fm215-1-2.
MR2851700
[18] Jack Ceder, Finite subsets and countable decompositions of Euclidean spaces, Rev. Roumaine Math.
Pures Appl. 14 (1969), 1247–1251. MR257307
[19] David Chodounský and Osvaldo Guzmán, There are no P-points in Silver extensions, Israel J. Math. 232
(2019), no. 2, 759–773, DOI 10.1007/s11856-019-1886-2. MR3990958
[20] Clinton T. Conley and Benjamin D. Miller, A bound on measurable chromatic numbers of locally fi-
nite Borel graphs, Math. Res. Lett. 23 (2016), no. 6, 1633–1644, DOI 10.4310/MRL.2016.v23.n6.a3.
MR3621100
[21] Patrick Dehornoy, Iterated ultrapowers and Prikry forcing, Ann. Math. Logic 15 (1978), no. 2, 109–160,
DOI 10.1016/0003-4843(78)90018-9. MR514228
323
324 BIBLIOGRAPHY
[22] Carlos Augusto Di Prisco and Stevo Todorcevic, Perfect-set properties in 𝐿(𝐑)[𝑈], Adv. Math. 139 (1998),
no. 2, 240–259, DOI 10.1006/aima.1998.1752. MR1654181
[23] Natasha Dobrinen and Daniel Hathaway, Forcing and the Halpern–Läuchli Theorem, J. Symb. Log. 85
(2020), no. 1, 87–102, DOI 10.1017/jsl.2019.59. MR4085056
[24] Natasha Dobrinen, José G. Mijares, and Timothy Trujillo, Topological Ramsey spaces from Fraïssé
classes, Ramsey-classification theorems, and initial structures in the Tukey types of p-points, Arch. Math.
Logic 56 (2017), no. 7-8, 733–782, DOI 10.1007/s00153-017-0540-0. MR3696065
[25] Alan Dow, Set theory in topology, Recent progress in general topology (Prague, 1991), North-Holland,
Amsterdam, 1992, pp. 167–197. MR1229125
[26] P. Erdös and S. Kakutani, On non-denumerable graphs, Bull. Amer. Math. Soc. 49 (1943), 457–461, DOI
10.1090/S0002-9904-1943-07954-2. MR8136
[27] P. Erdős and A. Hajnal, On the structure of set-mappings, Acta Math. Acad. Sci. Hungar. 9 (1958), 111–
131, DOI 10.1007/BF02023868. MR95124
[28] P. Erdős and A. Hajnal, On chromatic number of graphs and set-systems, Acta Math. Acad. Sci. Hungar.
17 (1966), 61–99, DOI 10.1007/BF02020444. MR193025
[29] P. Erdős and P. Komjáth, Countable decompositions of 𝐑2 and 𝐑3 , Discrete Comput. Geom. 5 (1990),
no. 4, 325–331, DOI 10.1007/BF02187793. MR1043714
[30] Ilijas Farah, Semiselective coideals, Mathematika 45 (1998), no. 1, 79–103, DOI
10.1112/S0025579300014054. MR1644345
[31] Ilijas Farah, Ideals induced by Tsirelson submeasures, Fund. Math. 159 (1999), no. 3, 243–258, DOI
10.4064/fm-159-3-243-258. MR1680630
[32] Ilijas Farah, Analytic quotients: theory of liftings for quotients over analytic ideals on the integers, Mem.
Amer. Math. Soc. 148 (2000), no. 702, xvi+177, DOI 10.1090/memo/0702. MR1711328
[33] Matthew Foreman and Menachem Magidor, Large cardinals and definable counterexamples to the con-
tinuum hypothesis, Ann. Pure Appl. Logic 76 (1995), no. 1, 47–97, DOI 10.1016/0168-0072(94)00031-W.
MR1359154
[34] Roland Fraïssé, Sur l’extension aux relations de quelques propriétés des ordres (French), Ann. Sci. Ecole
Norm. Sup. (3) 71 (1954), 363–388. MR0069239
[35] D. H. Fremlin, Measure theory. Vol. 5. Set-theoretic measure theory. Part II, Torres Fremlin, Colchester,
2015. Corrected reprint of the 2008 original. MR3723041
[36] Harvey Friedman and Lee Stanley, A Borel reducibility theory for classes of countable structures, J. Sym-
bolic Logic 54 (1989), no. 3, 894–914, DOI 10.2307/2274750. MR1011177
[37] Su Gao, Invariant descriptive set theory, Pure and Applied Mathematics (Boca Raton), vol. 293, CRC
Press, Boca Raton, FL, 2009. MR2455198
[38] E. Glasner, B. Tsirelson, and B. Weiss, The automorphism group of the Gaussian measure cannot act
pointwise, Israel J. Math. 148 (2005), 305–329, DOI 10.1007/BF02775441. Probability in mathematics.
MR2191233
[39] G. Grünwald, Egy halmazelméleti tételről, Mathematikai és Fizikai Lapok, 44 (1937), 51–53.
[40] András Hajnal and Attila Máté, Set mappings, partitions, and chromatic numbers, Logic Colloquium
’73 (Bristol, 1973), North-Holland, Amsterdam, 1975, pp. 347–379. MR0424569
[41] R. Halin, Über unendliche Wege in Graphen (German), Math. Ann. 157 (1964), 125–137, DOI
10.1007/BF01362670. MR170340
[42] Eric J. Hall, Kyriakos Keremedis, and Eleftherios Tachtsis, The existence of free ultrafilters on 𝜔 does
not imply the extension of filters on 𝜔 to ultrafilters, MLQ Math. Log. Q. 59 (2013), no. 4-5, 258–267, DOI
10.1002/malq.201100092. MR3100753
[43] Philip Hall, On representatives of subsets, J. London Math. Soc., 10 (1935), 26–30.
[44] J. M. Henle, A. R. D. Mathias, and W. Hugh Woodin, A barren extension, Methods in mathemati-
cal logic (Caracas, 1983), Lecture Notes in Math., vol. 1130, Springer, Berlin, 1985, pp. 195–207, DOI
10.1007/BFb0075312. MR799042
[45] Neil Hindman and Dona Strauss, Algebra in the Stone-Čech compactification: Theory and applications,
De Gruyter Expositions in Mathematics, vol. 27, Walter de Gruyter & Co., Berlin, 1998. MR1642231
[46] Greg Hjorth and Alexander S. Kechris, Rigidity theorems for actions of product groups and count-
able Borel equivalence relations, Mem. Amer. Math. Soc. 177 (2005), no. 833, viii+109, DOI
10.1090/memo/0833. MR2155451
[47] Wilfrid Hodges, A shorter model theory, Cambridge University Press, Cambridge, 1997. MR1462612
[48] Haim Horowitz and Saharon Shelah, Transcendence bases, well-orderings of the reals and the axiom of
choice, arXiv:1901.01508, 2019.
BIBLIOGRAPHY 325
[49] M. Hrušák, D. Meza-Alcántara, E. Thümmel, and C. Uzcátegui, Ramsey type properties of ideals, Ann.
Pure Appl. Logic 168 (2017), no. 11, 2022–2049, DOI 10.1016/j.apal.2017.06.001. MR3692233
[50] Jaime I. Ihoda and Saharon Shelah, Souslin forcing, J. Symbolic Logic 53 (1988), no. 4, 1188–1207, DOI
10.2307/2274613. MR973109
[51] Thomas Jech, Set theory, Springer Monographs in Mathematics, Springer-Verlag, Berlin, 2003. The
third millennium edition, revised and expanded. MR1940513
[52] Haim Judah, Andrzej Rosłanowski, and Saharon Shelah, Examples for Souslin forcing, Fund. Math.
144 (1994), no. 1, 23–42, DOI 10.4064/fm-144-1-23-42. MR1271476
[53] I. Juhász, S. Shelah, and L. Soukup, More on countably compact, locally countable spaces, Israel J. Math.
62 (1988), no. 3, 302–310, DOI 10.1007/BF02783299. MR955134
[54] Vladimir Kanovei, Borel equivalence relations: Structure and classification, University Lecture Series,
vol. 44, American Mathematical Society, Providence, RI, 2008. MR2441635
[55] Vladimir Kanovei, Marcin Sabok, and Jindřich Zapletal, Canonical Ramsey theory on Polish
spaces, Cambridge Tracts in Mathematics, vol. 202, Cambridge University Press, Cambridge, 2013.
MR3135065
[56] Itay Kaplan and Saharon Shelah, Forcing a countable structure to belong to the ground model, MLQ
Math. Log. Q. 62 (2016), no. 6, 530–546, DOI 10.1002/malq.201400094. MR3601093
[57] M. Kaufmann, The quantifier “there exist uncountably many” and some of its relatives, Model-theoretic
logics, Perspect. Math. Logic, Springer, New York, 1985, pp. 123–176. MR819535
[58] Alexander S. Kechris, Classical descriptive set theory, Graduate Texts in Mathematics, vol. 156,
Springer-Verlag, New York, 1995. MR1321597
[59] Alexander S. Kechris, Actions of Polish groups and classification problems, Analysis and logic (Mons,
1997), London Math. Soc. Lecture Note Ser., vol. 262, Cambridge Univ. Press, Cambridge, 2002,
pp. 115–187. MR1967835
[60] A. S. Kechris, V. G. Pestov, and S. Todorcevic, Fraïssé limits, Ramsey theory, and topological dynamics of
automorphism groups, Geom. Funct. Anal. 15 (2005), no. 1, 106–189, DOI 10.1007/s00039-005-0503-1.
MR2140630
[61] A. S. Kechris, S. Solecki, and S. Todorcevic, Borel chromatic numbers, Adv. Math. 141 (1999), no. 1,
1–44, DOI 10.1006/aima.1998.1771. MR1667145
[62] Richard Ketchersid, Paul Larson, and Jindřich Zapletal, Ramsey ultrafilters and countable-to-one uni-
formization, Topology Appl. 213 (2016), 190–198, DOI 10.1016/j.topol.2016.08.018. MR3563079
[63] Julia Knight, Antonio Montalbán, and Noah Schweber, Computable structures in generic extensions, J.
Symb. Log. 81 (2016), no. 3, 814–832, DOI 10.1017/jsl.2015.30. MR3569106
[64] Péter Komjáth, A decomposition theorem for 𝐑𝑛 , Proc. Amer. Math. Soc. 120 (1994), no. 3, 921–927,
DOI 10.2307/2160488. MR1169038
[65] Péter Komjáth, The list-chromatic number of infinite graphs defined on Euclidean spaces, Discrete Com-
put. Geom. 45 (2011), no. 3, 497–502, DOI 10.1007/s00454-009-9228-5. MR2770548
[66] Péter Komjáth and James Schmerl, Graphs on Euclidean spaces defined using transcendental distances,
Mathematika 58 (2012), no. 1, 1–9, DOI 10.1112/S0025579311001999. MR2891155
[67] P. Komjáth and S. Shelah, Coloring finite subsets of uncountable sets, Proc. Amer. Math. Soc. 124 (1996),
no. 11, 3501–3505, DOI 10.1090/S0002-9939-96-03450-8. MR1342032
[68] Péter Komjáth and Saharon Shelah, Two consistency results on set mappings, J. Symbolic Logic 65
(2000), no. 1, 333–338, DOI 10.2307/2586540. MR1782123
[69] Georges Kurepa, À propos d’une généralisation de la notion d’ensembles bien ordonnés (French), Acta
Math. 75 (1943), 139–150, DOI 10.1007/BF02404103. MR13762
[70] Adam Kwela and Marcin Sabok, Topological representations, J. Math. Anal. Appl. 422 (2015), no. 2,
1434–1446, DOI 10.1016/j.jmaa.2014.09.059. MR3269521
[71] Paul B. Larson and Jindřich Zapletal, Discontinuous homomorphisms, selectors, and automorphisms
of the complex field, Proc. Amer. Math. Soc. 147 (2019), no. 4, 1733–1737, DOI 10.1090/proc/14338.
MR3910437
[72] Paul B. Larson, The stationary tower, University Lecture Series, vol. 32, American Mathematical Soci-
ety, Providence, RI, 2004. Notes on a course by W. Hugh Woodin. MR2069032
[73] Paul B. Larson, Scott processes, Beyond first order model theory, CRC Press, Boca Raton, FL, 2017,
pp. 23–76. MR3729323
[74] Paul Larson and Jindřich Zapletal, Canonical models for fragments of the axiom of choice, J. Symb. Log.
82 (2017), no. 2, 489–509, DOI 10.1017/jsl.2017.29. MR3663414
326 BIBLIOGRAPHY
[75] Dominique Lecomte and Benjamin D. Miller, Basis theorems for non-potentially closed sets and
graphs of uncountable Borel chromatic number, J. Math. Log. 8 (2008), no. 2, 121–162, DOI
10.1142/S0219061308000749. MR2673697
[76] Jean-Pierre Levinski, Menachem Magidor, and Saharon Shelah, Chang’s conjecture for ℵ𝜔 , Israel J.
Math. 69 (1990), no. 2, 161–172, DOI 10.1007/BF02937302. MR1045371
[77] Saunders Mac Lane, A lattice formulation for transcendence degrees and 𝑝-bases, Duke Math. J. 4 (1938),
no. 3, 455–468, DOI 10.1215/S0012-7094-38-00438-7. MR1546067
[78] David Marker, Model theory: An introduction, Graduate Texts in Mathematics, vol. 217, Springer-
Verlag, New York, 2002. MR1924282
[79] Andrew Marks and Spencer Unger, Baire measurable paradoxical decompositions via matchings, Adv.
Math. 289 (2016), 397–410, DOI 10.1016/j.aim.2015.11.034. MR3439691
[80] A. R. D. Mathias, On sequences generic in the sense of Prikry, J. Austral. Math. Soc. 15 (1973), 409–414.
MR0332482
[81] Diego A. Mejía, Matrix iterations with vertical support restrictions, Proceedings of the 14th and 15th
Asian Logic Conferences, World Sci. Publ., Hackensack, NJ, 2019, pp. 213–248. MR3890467
[82] Benjamin D. Miller, The graph-theoretic approach to descriptive set theory, Bull. Symbolic Logic 18
(2012), no. 4, 554–575. MR3053069
[83] Jaroslav Nešetřil, Ramsey classes and homogeneous structures, Combin. Probab. Comput. 14 (2005),
no. 1-2, 171–189, DOI 10.1017/S0963548304006716. MR2128088
[84] Jaroslav Nešetřil and Vojtěch Rödl, Partitions of finite relational and set systems, J. Combinatorial The-
ory Ser. A 22 (1977), no. 3, 289–312, DOI 10.1016/0097-3165(77)90004-8. MR437351
[85] James G. Oxley, Matroid theory, Oxford Science Publications, The Clarendon Press, Oxford University
Press, New York, 1992. MR1207587
[86] Vladimir Pestov, Dynamics of infinite-dimensional groups: The Ramsey-Dvoretzky-Milman phenome-
non, University Lecture Series, vol. 40, American Mathematical Society, Providence, RI, 2006. Revised
edition of Dynamics of infinite-dimensional groups and Ramsey-type phenomena [Inst. Mat. Pura. Apl.
(IMPA), Rio de Janeiro, 2005; MR2164572]. MR2277969
[87] Christian Rosendal, Cofinal families of Borel equivalence relations and quasiorders, J. Symbolic Logic
70 (2005), no. 4, 1325–1340, DOI 10.2178/jsl/1129642127. MR2194249
[88] Christian Rosendal, Automatic continuity of group homomorphisms, Bull. Symbolic Logic 15 (2009),
no. 2, 184–214, DOI 10.2178/bsl/1243948486. MR2535429
[89] Christian Rosendal, Continuity of universally measurable homomorphisms, Forum Math. Pi 7 (2019),
e5, 20, DOI 10.1017/fmp.2019.5. MR3996719
[90] Christian Rosendal and Sławomir Solecki, Automatic continuity of homomorphisms and fixed points
on metric compacta, Israel J. Math. 162 (2007), 349–371, DOI 10.1007/s11856-007-0102-y. MR2365867
[91] Edward R. Scheinerman and Daniel H. Ullman, Fractional graph theory: A rational approach to
the theory of graphs, With a foreword by Claude Berge; A Wiley-Interscience Publication, Wiley-
Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, Inc., New York,
1997. MR1481157
[92] James H. Schmerl, Countable partitions of Euclidean space, Math. Proc. Cambridge Philos. Soc. 120
(1996), no. 1, 7–12, DOI 10.1017/S0305004100074612. MR1373342
[93] James H. Schmerl, Avoidable algebraic subsets of Euclidean space, Trans. Amer. Math. Soc. 352 (2000),
no. 6, 2479–2489, DOI 10.1090/S0002-9947-99-02331-4. MR1608502
[94] Saharon Shelah, On measure and category, Israel J. Math. 52 (1985), no. 1-2, 110–114, DOI
10.1007/BF02776084. MR815606
[95] Saharon Shelah, Proper and improper forcing, 2nd ed., Perspectives in Mathematical Logic, Springer-
Verlag, Berlin, 1998. MR1623206
[96] Saharon Shelah and Juris Steprāns, PFA implies all automorphisms are trivial, Proc. Amer. Math. Soc.
104 (1988), no. 4, 1220–1225, DOI 10.2307/2047617. MR935111
[97] Saharon Shelah and Jindřich Zapletal, Ramsey theorems for product of finite sets with submeasures,
Combinatorica 31 (2011), no. 2, 225–244, DOI 10.1007/s00493-011-2677-5. MR2848252
[98] Sławomir Solecki, Analytic ideals and their applications, Ann. Pure Appl. Logic 99 (1999), no. 1-3, 51–
72, DOI 10.1016/S0168-0072(98)00051-7. MR1708146
[99] Juris Steprāns, Strong 𝑄-sequences and variations on Martin’s axiom, Canad. J. Math. 37 (1985), no. 4,
730–746, DOI 10.4153/CJM-1985-039-6. MR801424
[100] Jacques Stern, On Lusin’s restricted continuum problem, Ann. of Math. (2) 120 (1984), no. 1, 7–37, DOI
10.2307/2007070. MR750715
BIBLIOGRAPHY 327
[101] E. Szemerédi, On sets of integers containing no 𝑘 elements in arithmetic progression, Acta Arith. 27
(1975), 199–245, DOI 10.4064/aa-27-1-199-245. MR369312
∗
[102] A. Szymański and Zhou Hao Xua, The behaviour of 𝜔2 under some consequences of Martin’s axiom,
General topology and its relations to modern analysis and algebra, V (Prague, 1981), Sigma Ser. Pure
Math., vol. 3, Heldermann, Berlin, 1983, pp. 577–584. MR698462
[103] Simon Thomas and Jindřich Zapletal, On the Steinhaus and Bergman properties for infinite products
of finite groups, Confluentes Math. 4 (2012), no. 2, 1250002, 26, DOI 10.1142/S1793744212500028.
MR2982769
[104] Stevo Todorčević, Partition problems in topology, Contemporary Mathematics, vol. 84, American Math-
ematical Society, Providence, RI, 1989. MR980949
[105] Stevo Todorčević, Remarks on Martin’s axiom and the continuum hypothesis, Canad. J. Math. 43 (1991),
no. 4, 832–851, DOI 10.4153/CJM-1991-048-8. MR1127033
[106] Stevo Todorcevic, Walks on ordinals and their characteristics, Progress in Mathematics, vol. 263,
Birkhäuser Verlag, Basel, 2007. MR2355670
[107] Asger Törnquist, Definability and almost disjoint families, Adv. Math. 330 (2018), 61–73, DOI
10.1016/j.aim.2018.03.005. MR3787540
[108] Todor Tsankov, Automatic continuity for the unitary group, Proc. Amer. Math. Soc. 141 (2013), no. 10,
3673–3680, DOI 10.1090/S0002-9939-2013-11666-7. MR3080189
[109] Douglas Ulrich, Richard Rast, and Michael C. Laskowski, Borel complexity and potential canonical
Scott sentences, Fund. Math. 239 (2017), no. 2, 101–147, DOI 10.4064/fm326-11-2016. MR3681584
[110] Lou van den Dries, Tame topology and o-minimal structures, London Mathematical Society Lecture
Note Series, vol. 248, Cambridge University Press, Cambridge, 1998. MR1633348
[111] Mark Brian Vanliere, Splitting the reals into two small pieces, ProQuest LLC, Ann Arbor, MI, 1982.
Thesis (Ph.D.)–University of California, Berkeley. MR2632635
[112] Boban Veličković, Definable automorphisms of 𝒫(𝜔)/fin, Proc. Amer. Math. Soc. 96 (1986), no. 1, 130–
135, DOI 10.2307/2045667. MR813825
[113] W. Hugh Woodin, Supercompact cardinals, sets of reals, and weakly homogeneous trees, Proc. Nat. Acad.
Sci. U.S.A. 85 (1988), no. 18, 6587–6591, DOI 10.1073/pnas.85.18.6587. MR959110
[114] W. Hugh Woodin, The axiom of determinacy, forcing axioms, and the nonstationary ideal, De Gruyter
Series in Logic and its Applications, vol. 1, Walter de Gruyter & Co., Berlin, 1999. MR1713438
[115] Jindřich Zapletal, Forcing idealized, Cambridge Tracts in Mathematics, vol. 174, Cambridge University
Press, Cambridge, 2008. MR2391923
[116] Jindřich Zapletal, Interpreter for topologists, J. Log. Anal. 7 (2015), Paper 6, 61, DOI
10.4115/jla.2015.7.6. MR3457546
[117] Jindřich Zapletal, Hypergraphs and proper forcing, J. Math. Log. 19 (2019), no. 2, 1950007, 64, DOI
10.1142/S0219061319500077. MR4014887
[118] Jindřich Zapletal, Subadditive families of hypergraphs, unpublished, 2019.
[119] Joseph Zielinski, The complexity of the homeomorphism relation between compact metric spaces, Adv.
Math. 291 (2016), 635–645, DOI 10.1016/j.aim.2015.11.051. MR3459026
[120] Andy Zucker, Big Ramsey degrees and topological dynamics, Groups Geom. Dyn. 13 (2019), no. 1, 235–
276, DOI 10.4171/GGD/483. MR3900770
Index
absoluteness forcing
Mostowski, 27 𝑚, 𝑛-balanced, 14, 299
Shoenfield, 27 𝑛-Bernstein balanced, 288
𝑚, 𝑛-centered, 299
below 𝜅, 31 balanced, 111
Bernstein balanced, 274, 296
cardinal compactly balanced, 13, 182, 195, 262
𝜆(𝐸), 45, 128, 129 definably balanced, 234
Erdős, 47 nested balanced, 13, 193
measurable, 68, 69 perfect, 269, 296
pinned, 𝜅(𝐸), 3, 45 perfectly balanced, 13, 269
coloring, 26 placid, 13, 189, 279
coloring number pod balanced, 206
Borel, ℵ1 , 122, 198 reasonable, 58
countable, 145, 222
Suslin, 105
complete countable section, 130
tethered, 13, 213, 219
complex, 117
weakly balanced, 116
fragmented, 117, 190, 210, 221, 294
forcing, specific
concentration of measure, 4, 86, 321
𝐸-linearization, 11, 166, 186, 196, 281, 282,
condition
294, 311
𝑚, 𝑛-balanced, 299
𝐸, 𝐹-collapse, 128, 191, 224, 294
balanced, 108
𝐸, 𝐹-transversal, 12, 129, 191, 197, 222
placid, 189
𝐸, ℱ-Fraissé, 165, 192, 223, 281
virtual, 107
𝑃𝑋 , 4, 30, 73, 76
weakly balanced, 114
Γ-coloring, 145, 200, 222, 280
decomposition Γ, Δ-homomorphism, 157, 187, 196, 222
𝒦, 153, 203 Coll(𝜔, < 𝜅), 30
acyclic, 181 Coll(𝜔, 𝑋), 30
ℚ𝜅 , 31, 293
end of graph, 186 𝒦-decomposition, 154, 181, 191
equivalence 𝒫(𝜔) mod fin, 10, 184, 196, 223, 272, 295, 320
orbit, 13, 99, 193 acyclic, 126, 200, 294, 309
pinned, 39 automorphism, 159, 202
placid, 78 circular, 150, 191, 201, 311
virtually placid, 78 Fin×Fin, 136, 185, 273
equivalence, specific finite-countable, 169
𝔼0 , 5, 26 Hamel basis, 11, 126, 279, 294
𝔼1 , 26, 193 Lusin, 171, 282, 295
𝔼2 , 26 Lusin collapse, 173, 181
𝔼Γ , 26, 42 MAD, 177, 314
𝔼𝐾𝜍 , 26, 205 matroid, 126, 221, 280
𝔼𝜔1 , 3, 26, 43, 68, 69 Vitali, 183, 206
𝔽2 , 3, 26, 69 fragmentation, 117
329
330 INDEX
generic ultrapower, 31, 293 product

graph large skew, 230
𝐾𝑛 , 25 measured skew, 232, 251
→ , 25, 260, 308
𝐾𝜔,𝜔 principal skew, 229, 239
𝐾𝑛,𝜔1 , 25, 292 skew, 227, 255
𝐾𝑛,𝑛 , 25, 255
𝔾0 , 228, 245, 316 quotient space, 27
Euclidean distance, 257, 262 sequence
Hamming, 228, 236, 300 choice-coherent, 96, 193
Hamming, diagonal, 6, 228, 253, 257, 261 coherent, 4, 93
Hamming, on 𝜔𝜔 , 7, 228, 261, 262 set mapping, 198, 201, 304
hypergraph tournament, 8, 167, 296
actionable, 262 transversal, 26
circular, 150, 191, 201, 311 turbulence, 4, 76, 189
ideal ultrafilter
𝜔-hitting, 77 Ramsey, 272
branch, 81 stable ordered union, 273
countably separated, 82, 112 uniformization
P-ideal, 278 pinned, 215
Rado graph, 91 Saint-Raymond, 218
summable, 9, 89, 320 well-orderable, 216
Tsirelson, 91
independent maps, 4, 73, 76, 77 virtual
equivalence class, 36
jump structure, 37
Friedman–Stanley, 39
walk, 73, 76, 86
Komjáth dimension, 285
Kurepa family, 160, 188, 192, 196
large fragment of ZFC, 25

large structure, 25
master function, 118

matroid, 124
𝐺𝛿 , 126, 221
algebraic, 127
graphic, 126
linear, 126
modular, 125, 154
with countable closures, 125, 154
number
Borel 𝜎-bounded chromatic, 229, 262, 264
Borel 𝜎-bounded clique, 233
Borel 𝜎-bounded fractional chromatic, 231,
266
Borel 𝜎-finite clique, 233
countable Borel chromatic, 6, 228
fractional chromatic, 230
OCA, 13, 276

OCA+, 271
perfect matching, 6, 186, 246

pin
𝐸-pin, 35, 78
𝑃-pin, 107
pod, 205
SELECTED PUBLISHED TITLES IN THIS SERIES
248 Paul B. Larson and Jindrich Zapletal, Geometric Set Theory, 2020
247 István Heckenberger and Hans-Jürgen Schneider, Hopf Algebras and Root
Systems, 2020
246 Matheus C. Bortolan, Alexandre N. Carvalho, and José A. Langa, Attractors
Under Autonomous and Non-autonomous Perturbations, 2020
245 Aiping Wang and Anton Zettl, Ordinary Differential Operators, 2019
244 Nabile Boussaı̈d and Andrew Comech, Nonlinear Dirac Equation, 2019
243 José M. Isidro, Jordan Triple Systems in Complex and Functional Analysis, 2019
242 Bhargav Bhatt, Ana Caraiani, Kiran S. Kedlaya, Peter Scholze, and Jared
Weinstein, Perfectoid Spaces, 2019
241 Dana P. Williams, A Tool Kit for Groupoid C ∗ -Algebras, 2019
240 Antonio Fernández López, Jordan Structures in Lie Algebras, 2019
239 Nicola Arcozzi, Richard Rochberg, Eric T. Sawyer, and Brett D. Wick, The
Dirichlet Space and Related Function Spaces, 2019
238 Michael Tsfasman, Serge Vlǎduţ, and Dmitry Nogin, Algebraic Geometry Codes:
Advanced Chapters, 2019
237 Dusa McDuff, Mohammad Tehrani, Kenji Fukaya, and Dominic Joyce, Virtual
Fundamental Cycles in Symplectic Topology, 2019
236 Bernard Host and Bryna Kra, Nilpotent Structures in Ergodic Theory, 2018
235 Habib Ammari, Brian Fitzpatrick, Hyeonbae Kang, Matias Ruiz, Sanghyeon
Yu, and Hai Zhang, Mathematical and Computational Methods in Photonics and
Phononics, 2018
234 Vladimir I. Bogachev, Weak Convergence of Measures, 2018
233 N. V. Krylov, Sobolev and Viscosity Solutions for Fully Nonlinear Elliptic and Parabolic
Equations, 2018
232 Dmitry Khavinson and Erik Lundberg, Linear Holomorphic Partial Differential
Equations and Classical Potential Theory, 2018
231 Eberhard Kaniuth and Anthony To-Ming Lau, Fourier and Fourier-Stieltjes
Algebras on Locally Compact Groups, 2018
230 Stephen D. Smith, Applying the Classification of Finite Simple Groups, 2018
229 Alexander Molev, Sugawara Operators for Classical Lie Algebras, 2018
228 Zhenbo Qin, Hilbert Schemes of Points and Infinite Dimensional Lie Algebras, 2018
227 Roberto Frigerio, Bounded Cohomology of Discrete Groups, 2017
226 Marcelo Aguiar and Swapneel Mahajan, Topics in Hyperplane Arrangements, 2017
225 Mario Bonk and Daniel Meyer, Expanding Thurston Maps, 2017
224 Ruy Exel, Partial Dynamical Systems, Fell Bundles and Applications, 2017
223 Guillaume Aubrun and Stanislaw J. Szarek, Alice and Bob Meet Banach, 2017
222 Alexandru Buium, Foundations of Arithmetic Differential Geometry, 2017
221 Dennis Gaitsgory and Nick Rozenblyum, A Study in Derived Algebraic Geometry,
2017
220 A. Shen, V. A. Uspensky, and N. Vereshchagin, Kolmogorov Complexity and
Algorithmic Randomness, 2017
219 Richard Evan Schwartz, The Projective Heat Map, 2017
218 Tushar Das, David Simmons, and Mariusz Urbański, Geometry and Dynamics in
Gromov Hyperbolic Metric Spaces, 2017
217 Benoit Fresse, Homotopy of Operads and Grothendieck–Teichmüller Groups, 2017
For a complete list of titles in this series, visit the

AMS Bookstore at www.ams.org/bookstore/survseries/.
Photo courtesy of the University of Florida
College of Liberal Arts and Sciences.
This book introduces a new research direction in set theory: the study of models
of set theory with respect to their extensional overlap or disagreement. In Part I,
the method is applied to isolate new distinctions between Borel equivalence
relations. Part II contains applications to independence results in Zermelo–
Fraenkel set theory without Axiom of Choice.
The method makes it possible to classify in great detail various paradoxical
objects obtained using the Axiom of Choice; the classifying criterion is a
ZF-provable implication between the existence of such objects. The book
considers a broad spectrum of objects from analysis, algebra, and combi-
natorics: ultrafilters, Hamel bases, transcendence bases, colorings of Borel
graphs, discontinuous homomorphisms between Polish groups, and many more.
The topic is nearly inexhaustible in its variety, and many directions invite further
investigation.
For additional information

and updates on this book, visit
www.ams.org/bookpages/surv-248
SURV/248

(Mathematical Surveys and Monographs 248) Paul B. Larson, Jindřich Zapletal - Geomet

Uploaded by

Document Informationclick to expand document information

Document Informationclick to expand document information

Copyright:

Available Formats

(Mathematical Surveys and Monographs 248) Paul B. Larson, Jindřich Zapletal - Geomet

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

(Mathematical Surveys and Monographs 248) Paul B. Larson, Jindřich Zapletal - Geomet

Uploaded by

Copyright:

Available Formats

Mathematical

2010 Mathematics Subject Classiﬁcation. Primary 03E15, 03E25,

For additional information and updates on this book, visit

Library of Congress Cataloging-in-Publication Data

Part I. Equivalence relations 33

Chapter 2. The virtual realm 35

Chapter 4. Nested sequences of models 93

Part II. Balanced extensions of the Solovay model 103

Chapter 5. Balanced Suslin forcing 105

Chapter 6. Simplicial complex forcings 117

Chapter 7. Ultrafilter forcings 135

Chapter 8. Other forcings 145

Chapter 9. Preserving cardinalities 179

Chapter 10. Uniformization 213

Chapter 11. Locally countable structures 227

11.5. Measured control 250

Chapter 12. The Silver divide 269

Chapter 13. The arity divide 299

Chapter 14. Other combinatorics 313

1.1. Outline of the subject

1.2. Equivalence relation results

Theorem 1.2.1. (Proposition 2.2.5) Let 𝐸 be a Borel equivalence relation on a Polish

Theorem 1.2.6. (Theorem 3.1.4) Let 𝑋 be a Polish space and 𝑓0 ∶ 𝑋 → 𝑌0 and

1.3. Independence: by topic

Cardinalities of quotient spaces. Mirroring the traditional concerns of descriptive

(5) (Corollary 9.4.15) given a pinned orbit equivalence relation 𝐸 of a continuous

Locally countable structures. One particularly popular subject of descriptive set

(1) (Corollary 11.8.8) there is a nonprincipal ultrafilter on 𝜔;

Open problems abound. For example, given nonsimilar triangles 𝑇0 , 𝑇1 , is it possible

Uniformization. Uniformization problems belong to the guiding lights of descriptive

Theorem 1.3.22. (Theorem 14.2.1 simplified) In every balanced extension of the

1.4. Independence: by model

Theorem 1.4.1. In the model 𝑊[𝑈], the following statements hold:

Theorem 1.4.2. In the model 𝑊[𝐵], the following statements hold:

(1) (Proposition 9.2.22) 𝔼0 has a transversal;

Models with a linear ordering. Let 𝐸 be a Borel equivalence relation on a Polish

Theorem 1.4.3. In the model 𝑊[≤], the following statements hold:

(1) (Corollary 9.2.12) |𝔼0 | > |2𝜔 |;

The transversal models. Let 𝐸 be a pinned Borel equivalence relation on a Pol-

1.5. Independence: by preservation theorem

regularity properties. A significant weakening of this notion is centered control. A

Chapter 3 restates and greatly generalizes Hjorth’s notion of turbulence in forc-

𝐸-class represented in each model 𝑀𝑛 , then it is represented in 𝑀𝜔 –Theorem 4.3.6.

Chapter 6 analyzes a class of balanced forcings arising from simplicial complexes

Chapter 7 analyzes various ways of adding a nonprincipal ultrafilter on 𝜔 to a

Section 8.3 considers the problem of adding a discontinuous homomorphism be-

Chapter 9 compares cardinalities of quotient spaces in balanced extensions of the

Chapter 10 deals with the question of whether countable-to-one uniformization

Chapter 13 presents the classes of 𝑚, 𝑛-balanced and centered forcings. These

1.7. Notation and terminology

Combinatorics. We use plenty of standard graph theoretic parlance throughout. A

(2) 𝐸 is almost Borel reducible to 𝐹, in symbols 𝐸 ≤𝑎 𝐹, if there exists a Borel

Definition 1.7.4. If 𝐸 is an equivalence relation on a Polish space 𝑋 then the

Fact 1.7.5. (Mostowski absoluteness) If 𝑀 ⊂ 𝑁 are transitive models of ZF plus DC

Fact 1.7.6. (Shoenfield absoluteness) If 𝑀 ⊂ 𝑁 are transitive models of ZF plus DC

In particular, intepretations of analytic equivalence relations are equivalence relations

Fact 1.7.7. If 𝑉 is a model of ZFC, 𝑉[𝐺] is a forcing extension of 𝑉, and 𝑀 is a model