This paper investigates the conditions under which almost disjoint families of subsets of natural numbers can be embedded into the real line, exploring their separation properties and implications for certain C*-algebras, with results varying across different set-theoretic models.
Contribution
It introduces new extraction principles related to R-embeddability, proves their consistency in certain models, and applies these to analyze the structure of Akemann-Doner C*-algebras.
Findings
01
Every almost disjoint family of size continuum has an R-embeddable subfamily of size continuum in the Sacks model.
02
There exists an almost disjoint family where no two uncountable subfamilies can be separated, but countable subfamilies can.
03
In ZFC, there are Akemann-Doner C*-algebras of density continuum with no nonseparable commutative subalgebras.
Abstract
An almost disjoint family A of subsets of N is said to be R-embeddable if there is a function f:N→R such that the sets f[A] are ranges of real sequences converging to distinct reals for distinct A∈A. It is well known that almost disjoint families which have few separations, such as Luzin families, are not R-embeddable. We study extraction principles related to R-embeddability and separation properties of almost disjoint families of N as well as their limitations. An extraction principle whose consistency is our main result is: every almost disjoint family of size continuum contains an R-embeddable subfamily of size continuum. It is true in the Sacks model. The Cohen model serves to show that the above principle does not follow from the fact that every almost disjoint…
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
On R-embeddability of almost disjoint families and Akemann-Doner C*-algebras
An almost disjoint family A of subsets of N is said to be R-embeddable if
there is a function f:N→R such that the sets f[A]
are ranges of real sequences converging to distinct reals for distinct A∈A. It is well known
that almost disjoint families which have few separations, such as Luzin families, are not R-embeddable.
We study extraction principles related to R-embeddability and separation
properties of almost disjoint families of N as well as their limitations. An extraction principle whose consistency is our main result
is:
•
every almost disjoint family of size continuum contains an R-embeddable subfamily of size continuum.
It is true in the Sacks model. The Cohen model serves to show that the above principle does not follow from the fact that every almost disjoint family of size continuum has two separated subfamilies of size continuum.
We also construct in
ZFC an almost disjoint family, where no two uncountable subfamilies can be separated but
always a countable subfamily can be separated from any disjoint subfamily.
Using a refinement of the R-embeddability property called a controlled R-embedding
property we obtain the following results concerning Akemann-Doner C*-algebras which are
induced by uncountable almost disjoint families:
•
In ZFC there are Akemann-Doner C*-algebras of density c with no commutative subalgebras
of density c,
•
It is independent from ZFC whether there is an Akemann-Doner algebra of density c with no nonseparable commutative subalgebra.
This completes an earlier result that there is in ZFC an Akemann-Doner algebra
of density ω1 with no nonseparable commutative subalgebra.
The research of the second author was supported by a PAPIIT grant IN100317 and CONACyT grant 285130.
1. Introduction
A family A of infinite subsets of N is almost disjoint if any two distinct elements of A have finite intersection.
The earliest uncountable almost disjoint families considered by Sierpiński were
defined as the ranges of sequences of rationals converging to distinct reals.
Hence, we say that an almost disjoint family A is R-embeddable if there is
a function (called an embedding) f:N→R such that the sets f[A] for A∈A are
the ranges of sequences converging to distinct reals (see e.g.[14, 13]). Two families B,C of subsets of N
are *separated *if there is X⊆N such that:
(1)
If B∈B then B∖X is finite.
2. (2)
If C∈C then C∩X is finite.
Considering disjoint neighbourhoods of two condensation points
of the limits of converging sequences we see that R-embeddable almost disjoint families contain many pairs of
uncountable subfamilies which are separated. On the other hand
it is an old and beautiful result of Luzin ([19]) that
there is an almost disjoint family A
of size ω1 such that no two uncountable subfamilies of A can be separated.
We will call such families inseparable. To highlight the relationship between inseparable
and R-embeddable families, recall a dichotomy of [14] where it is shown that
assuming the proper forcing axiom (PFA) every almost disjoint family
of size ω1 is either R-embeddable
or contains an inseparable subfamily, while Dow [7] showed that under the
same assumption every maximal almost disjoint family contains an inseparable subfamily.
An uncountable almost disjoint family A is called a Q-family if for every B⊆A
the families B and A∖B are separated (sometimes called a
separated family). One of the earliest
applications of Martin’s axiom (MA) was proving the consistency of
the existence of Q-families (which is false under the continuum hypothesis (CH) by a counting argument).
All Q-families are R-embeddable and moreover they have a stronger
uniformization type property: for every ϕ:A→R there is f:N→R
such that f[A] is the range of a sequence converging to ϕ(A) (in other
words limn∈A(f(n)−ϕ(A))=0) for each A∈A
([13, Propositions 2.1., 2.3]).
It is natural, and useful (see e.g., [2, Theorem 2.39]), to consider
versions
of the above notions which are more cardinal specific: Let κ be a cardinal, then
•
an almost disjoint family A has the
κ-controlled R-embedding property if for every ϕ:A→R there is
B⊆A of cardinality κ and f:N→R
such that f[B] is the range of a sequence converging to ϕ(B) for every B∈B,
•
an almost disjoint family A of size κ is κ-inseparable
if no two subfamilies of A both of size κ can be separated,
•
an almost disjoint family A is κ-anti Lusin if it has cardinality
κ and for every subfamily B⊆A of cardinality κ
there are two subfamilies
B0,B1⊆B of cardinality κ which
can be separated ([26]).
This paper is a contribution to the study of extraction principles for
almost disjoint families in the context of the above properties. Our main positive results
concern the cardinality of the continuum c and are:
•
It is consistent that every almost disjoint family of size c contains an
R-embeddable subfamily of size c (Theorem 31).
•
It is consistent that every almost disjoint family of size c has
the ω1-controlled R-embedding property (Theorem 41).
•
The above extraction principles are not consequences of
every almost disjoint family of size c containing a c-anti Luzin subfamily
(Theorems 14 and 17).
The first two extraction principles above are obtained in the iterated Sacks model.
As a side product we also prove that in that model every partial function f:X→2N for
X⊆2N of cardinality c is uniformly continuous on an
uncountable Y⊆X (Theorem 39). We do not know
if the consistency of this property of functions can be concluded from
known results like in [28] or [6] or the fact that
under PFA every function is monotone on an uncountable set (see [3]).
The third result above is obtained in the Cohen model from a result of
Dow and Hart (Theorem 14) stating that in that model every almost disjoint family is
c-anti Luzin ([8, Proposition 2.6.] using
Steprāns’s characterization of P(N)/Fin in that model ([27])
and from the first of our negative results below:
•
In the Cohen model there is an almost disjoint family of cardinality c
with no uncountable R-embeddable subfamily (Theorem 17).
•
In the Cohen model no uncountable almost disjoint family has ω1-controlled R-embedding
property (Theorem 18).
We should recall here that by a result of A. Avilés, F. Cabello Sánchez, J. Castillo, M.
González and Y. Moreno it is consitent (follows from MA) that c-inseparable
families exist ([2, Lemma 2.36]) (c-inseparable
families are called c-Lusin families in [8, 2]).
On the other hand, we also discover some ZFC limitations to other extraction principles:
•
No almost disjoint family of size c has the c-controlled embedding property (Theorem 6).
•
There is in ZFC an inseparable family of cardinality ω1 which
has all possible separations (i.e., separating its countable parts
from the rest of the family) (Corollary 11).
The second result is not only natural in the above context by showing that
one cannot even consistently hope for extracting from every inseparable family an uncountable subfamily
with even fewer separations (for example like Mrówka’s family where one can only separate finite subfamilies
from the rest of the family). It has also found a natural application in a construction
of a thin-tall scattered operator algebra in [10]. Note that under
the hypothesis of b>ω1 all inseparable families have the properties
of our family from Corollary 11 (see [31, Theorem 3.3]).
Some of the above results concerning the R-embeddability of almost disjoint families find immediate
applications in the theory of C*-algebras. It was in the paper [1]
of Akemann and Doner where certain C*-algebras were associated to an almost disjoint
family A and a function ϕ:A→[0,2π). We call these algebras Akemann-Doner
algebras and denote them by AD(A,ϕ). For the construction see Section 6 or the papers
[1, 5]. These algebras, initially for A and ϕ constructed only under
CH in [1], were the first examples providing negative answer to a question
of Dixmier whether every nonseparable C*-algebra must contain a nonseparable commutative C*-subalgebra.
Later S. Popa found in [25] a different and a ZFC example, the reduced group C*-algebra
of an uncountable free group. However, the latter C*-algebra is very complicated (e.g. it has no nontrivial idempotents [24] etc.) while Akemann-Doner algebras are approximately finite dimensional in the sense of [9] that is, there is
a directed family of finite-dimensional C*-subalgebras whose union is dense in the
entire C*-algebra. In [5] it was noted that employing
an inseparable family A one can obtain in ZFC a nonseparable Akemann-Doner
algebra with no nonseparable commutative subalgebra. Such ZFC examples must be
obtained from almost disjoint families A of cardinality ω1. This
is because we have, for example, the above mentioned
result of Dow and Hart that it is consistent that every almost disjoint family of
cardinality c is c-anti-Lusin. The cardinality of the
almost disjoint family A is the density of the C*-algebra AD(A,ϕ), that is minimal cardinality
of a norm-dense set.
Some natural questions remained, for example,
if one can have in ZFC an Akemann-Doner algebra of density c with no nonseparable
commutative subalgebra or another question if it is consistent that every Akemann-Doner algebra of density c
has a commutative C*-subalgebra of density c. Here we answer these question
proving that:
•
In ZFC there are Akemann-Doner C*-algebras of density c with no commutative subalgebras
of density c (Theorem 44).
•
It is independent from ZFC whether there is an Akemann-Doner algebra of density c with no nonseparable commutative subalgebra (Theorem 45 and the result of [1]).
In fact, we also prove in Theorems 46 and 47
that the existence of nonseparable commutative C*-subalgebras
in every Akemann-Doner algebra does not follow from the negation of CH.
The structure of the paper is as follows: in Section 2 we prove some preliminary ZFC results
concerning R-embeddability, Section 3 is devoted to the construction of an inseparable almost disjoint family where all countable parts can be separated from the remaining part of the family, Section 4 is devoted to the results mentioned above that hold in the Cohen model and Section 5 to the results that hold in the Sacks model. The last section 6 concerns the consequences of the previous results for
the Akemann-Doner C*-algebras.
The set-theoretic terminology and notation is standard and can be found in [16].
The knowledge on C*-algebras required to follow Section 6 does not exceed a linear algebra course
concerning 2×2 matrices. Any additional background can be found in [22].
All almost disjoint families are assumed to be infinite and consist of infinite sets.
A⊆∗B means that
B∖A is finite. We use N, R, Q for nonnegative integers, reals and rationals respectively. When we view elements of N as von Neumann ordinals, i.e. subsets and/or elements of each other then we use
ω for N. The cardinality of R is denoted by c.
If κ is a cardinal and X is a set, then [X]κ denotes
the family of all subsets of X of cardinality κ. In particular [A]2 is the set
of all pairs {a,b} of elements of A. Elements of An for n∈ω are
n-tuples of A i.e., t=(t(0),t(2),…,t(n−1)). We consider
2<ω=⋃n∈ω2n with the inclusion as a tree,
we also consider its subtrees T and then [T] denotes the set of all branches of T.
The terminology concerning the Cohen forcing C and the Sacks forcing S is recalled
at the beginning of Sections 4 and 5 respectively.
2. Preliminaries
2.1. R-embedability of almost disjoint families
Recall the definition of an R-embeddable almost disjoint family from the introduction.
A useful tool for describing properties of almost disjoint families are Ψ-spaces associated with them ([15]).
The Ψ-space corresponding to an almost disjoint family A⊆℘(N) whose
points are identified with N∪A is denoted by Ψ(A).
Lemma 1**.**
Suppose that A is an almost disjoint family.
There is a 1-1 correspondence between continuous functions ϕ:Ψ(A)→R
and functions f:N→R for which xA=limn∈Af(n) exists for
each A∈A. It is given by f=ϕ↾N. Then xA=ϕ(A) for
each A∈A.
Lemma 2**.**
Let A⊆℘(N) be an almost disjoint family.
Consider N<ω∪Nω with the topology where N<ω is
discrete and the basic neighbourhoods of x∈Nω are of
the form
[TABLE]
for any finite F⊆ω.
The following conditions are equivalent (to the property of being R-embeddable):
(1)
There is a continuous ϕ:Ψ(A)→R such that
ϕ↾A is injective,
2. (2)
There is a continuous ϕ:Ψ(A)→R such that
ϕ↾A is injective and ϕ[A] has dense complement in R,
3. (3)
There is a continuous ϕ:Ψ(A)→R such that
ϕ↾A is injective and ϕ[A]⊆R∖Q,
4. (4)
There is a continuous ϕ:Ψ(A)→R such that
ϕ is injective, ϕ[A]⊆R∖Q and ϕ[N]⊆Q,
5. (5)
There is a continuous ϕ:Ψ(A)→N<ω∪Nω such that
ϕ is injective, ϕ[A]⊆Nω and ϕ[N]⊆N<ω,
6. (6)
There is a continuous ϕ:Ψ(A)→2ω such that
ϕ↾A is injective,
Proof.
(1) ⇒ (2) We may assume that A is infinite.
Let U⊆R be the union of all open intervals included in ϕ[A].
If it is empty, we are done. Otherwise
let E={en∣n∈N}⊆U be countable and dense in U.
A continuous ϕ′:Ψ(A)→R∖E
such that ϕ′[Ψ(A)]⊆ϕ[Ψ(A)] will satisfy (2). Let {xkn∣n,k∈N}⊆ϕ[A] be distinct
where x0n=en for each n∈N
and such that ∣xkn−xk+1n∣<1/(n+k).
We may choose such xnks since en’s are in the interior of ϕ[A].
Let Akn∈A be such that ϕ(Akn)=xkn for each n,k∈N.
Find finite Gkn⊆Akn so that Akn∖Gkn’s are all pairwise disjoint and
∣ϕ(i)−xkn∣<1/(n+k) for each i∈Akn∖Gkn for each n,k∈N.
Modify ϕ to obtain ϕ′
in the following way: Put ϕ′↾Akn∖Gkn to be constantly xk+1n for each
n,k∈N and ϕ′(Akn)=xk+1n for each
n,k∈N and put ϕ′ to be equal to ϕ on the remaining points of Ψ(A).
Injectivity of ϕ′↾A and the inclusion
ϕ′[Ψ(A)]⊆ϕ[Ψ(A)]∖E are clear.
So we are left with the continuity. ϕ′ is clearly continuous at each Akn for n,k∈N.
Let A∈A be distinct than each Akn. Then each intersection A∩Akn is finite.
As ∣ϕ′(i)−ϕ(i)∣<2/(n+k) for i∈Akn for each n,k∈N, it follows that
limi∈A∣ϕ′(i)−ϕ(i)∣=0, that is
[TABLE]
(2) ⇒ (3) Choose dense countable E⊆R∖ϕ[A].
Let η:R→R be a homeomorphism such that η[E]=Q and consider
ϕ′=η∘ϕ.
(3) ⇒ (4) Take ϕ satisfying (3) and modify it on N to obtain ϕ′
in such a way that ϕ′(n)s are distinct rationals for all n∈N and
∣ϕ(n)−ϕ′(n)∣<1/n for all n∈N.
(4) ⇔ (5) First we construct certain bijection
ρ:N<ω∪Nω→R such that ρ[N<ω]=Q
and ρ[Nω]=R∖Q. First define a family
(Is∣s∈N<ω) of open intervals with rational end-points with the following
properties:
(1)
I∅=R,
2. (2)
⋃{Is⌢n∣n∈N}=Is,
3. (3)
each end-point of an interval Is is an endpoint of another
interval Is′ for ∣s∣=∣s′∣,
4. (4)
the diameter of Is is smaller than 1/∣s∣ for s=∅,
5. (5)
for every s∈N<ω we have Is⌢n∩Is⌢n′=∅
for distinct n,n′∈N,
6. (6)
Every rational is used as an end-point of two (and necessarily only two adjacent, by the previous properties) of the intervals Is for s∈N<ω. [math] is end-point of
two of Iss for some ∣s∣=1.
First define ρ on N<ω by
defining ρ(s) by induction on ∣s∣. Let ρ(∅)=0.
If ∣s∣=1, then ρ(s) is the right end-point of Is if Is consists of positive reals
and ρ(s) is the left end-point of Is if Is consists of negative reals.
If ∣s∣>1, then ρ(s) is the left end-point of Is.
For x∈Nω let ρ(x) be the only point of
⋂n∈ωIx↾n.
Note that ρ is continuous and that ρ−1(xn)→ρ−1(x)
if xn is a sequence of rationals converging to an irrational x. This
proves (4) ⇔ (5).
(5) ⇒ (6) First note that there η:N<ω∪Nω→Nω
which is continuous and the identity on Nω. Namely send s∈N<ω
to the sequence s⌢0ω. Now note that there is ζ:Nω→2ω
which is continuous. So use the composition of these functions to obtain (6) from (5).
(6) ⇒ (1) is clear.
∎
Remark 3**.**
Using Lemma 1 we obtain versions of the conditions
from Lemma 2 for functions from N into R. In particular the definition
of an R-embeddable almost disjoint from the introduction which is
a version of item (1) of Lemma 2 is equivalent
to version in the literature, e.g. in [13] which
are versions of item (4) of Lemma 2.
The following is a simple condition that allows us to get R-embeddability.
Lemma 4**.**
Let T⊆2<ω be a tree, Z⊆[T] and
A={Ar∣r∈Z} an almost disjoint family of
subsets of N. If
there is a family {Bs∣s∈T}⊆[N]ω with the following properties:
(1)
Bt=⋃{Bt⌢i∣t⌢i∈T,i∈{0,1}}* for all t∈T,*
2. (2)
Bs∩Bt* is finite whenever s,t∈T are incompatible.*
3. (3)
Ar⊆⋂n∈ωBr↾n* for every r∈Z.*
Then, A is R-embeddable.
Proof.
Define ϕ:Ψ(A)⟶2ω by puting ϕ(Ar)=r for all r∈Z
and ϕ(n)=s⌢0ω if n∈Bs, ∣s∣≥n and s is the first in the lexicographic
order which satisfies the previous requirements. If there is no such s∈2<ω, then put
ϕ(n)=0ω. Clearly ϕ↾A is injective, so we are left with the continuity to
check (1) of Lemma 2.
By (3) if k∈Ar, then k∈Br↾n for
every n∈ω. Fix n∈ω. So if we take
[TABLE]
then the condition “ k∈Bs and ∣s∣≥n” implies
r↾n⊆s by (1). By (2) the set
in (*) almost covers Ar, and so for almost all elements of k∈Ar we have
r↾n⊆ϕ(k). As n∈ω was arbitrary, it follows that limk∈Arϕ(k)=r=ϕ(Ar), as required for the continuity.
∎
Remark 5**.**
By transfinite induction one can construct a family of sequences
(qnα)n∈N for α<c in such a way that
no tree T⊆2<ω and no collection {Bt∣t∈T} satisfies the
hypothesis of Lemma 4 for any family of ℘(N) obtained through a bijection
between N and Q from {{qnα}n∈N∣α<c}.
It follows that the condition from Lemma 4
is not equivalent to the R-embeddability.
This way one can also conclude that there are R-embeddable almost disjoint
families of subsets of N
which are not equivalent to a family of branches of 2<ω.
2.2. κ-controlled R-embedding property
Recall the definition of the κ-controlled R-embedding property from the introduction.
Theorem 6**.**
No almost disjoint family A of cardinality c has
c-controlled R-embedding property.
Proof.
Let A be an almost disjoint family of size c
consisting of infinite sets.
Let (Mα)α<c be a well-ordered, continuous, increasing chain of sets satisfying
(1)
∣Mα∣≤max(∣α∣,ω) for each α<c,
2. (2)
RN,℘(N)⊆⋃α<cMα,
3. (3)
If A∈Mα∩℘(N) and f∈Mα∩RN and
limn∈Af(n) exists, then it belongs to Mα+1.
It should be clear that one can construct such a sequence (Mα)α<c.
Define ϕ:A→[0,1] so that ϕ(A)∈R∖Mα(A)+1 for
A∈A, where
[TABLE]
This can be arranged by (2) and by (1). Now suppose A′⊆A has cardinality
c and f:N→R.
By (2) there is α0<c such that f∈Mα0. Take A∈A′ such that
α(A)≥α0 which exists by (1) as A′ has cardinality c.
Then A∈Mα(A)∩℘(N) and f∈Mα(A)∩[0,1]N, so by (3),
if limn∈Af(n) exists, then it belongs to Mα(A)+1. But ϕ(A)∈Mα(A)+1
by the definition of ϕ, so limn∈Af(n)=ϕ(A).
∎
However, it is quite possible to have almost disjoint families
of cardinality κ with κ-controlled embedding property:
Proposition 7**.**
[13, cf. 2.3.]**
Let κ be a cardinal. Assume MAκ**. Then
every subfamily A of cardinality κ of the Cantor family
C={Ax∣x∈2ω}⊆℘(2<ω), where
Ax={x↾n∣n∈ω}
for x∈2ω,
has the following strong version of the κ-controlled embedding property:
For every function ϕ:A→[0,1] there is a
function f:2<ω→[0,1] such that for all A∈A
[TABLE]
Proof.
It is well known that under the above hypothesis all subsets
of 2ω of cardinality κ are Q-sets and that it implies that
all subfamilies of the Cantor family of cardinality κ
can be separated from the rest of the family, i.e. they are Q-families in our terminology
from the introduction. It follows that
Ψ(A) is a normal topological space. As the nonisolated points of
Ψ(A) correspond to A and form a discrete closed subset of
Ψ(A) any function ϕ on them is continuous and extends by the Tietze extension theorem to a continuous
ϕ:Ψ(A)→[0,1]. So put f=ϕ↾2<ω
and use Lemma 1 identifying 2<ω and N.
∎
3. A Luzin family with all possible separations in ZFC
The main striking property of a Luzin family is that it is inseparable.
On the other hand,
there is also an almost disjoint family A of size ℵ1 such that every
countable B⊆A can be separated from A∖B (see [23]).
Here we construct an almost disjoint family which
satisfies both properties simultaneously. As both of these properties are hereditary with respect to
uncountable subfamilies this shows certain limitations to any further extraction principles.
To construct the almost disjoint family with the aboved-mentioned properties
we need colorings of pairs of countable ordinals with properties
first obtained by S. Todorcevic in [29] (cf. [30]).
In fact, the concrete construction we choose, due to Velleman ([32]), is based
on a family of finite subsets of ω1. It was C. Morgan
who connected these two ideas ([21]).
For functions c:[ω1]2→N we will abuse notation and
denote c({α,β}) by c(α,β).
Theorem 8**.**
There is a sequence (gα∣α<ω1)⊆{0,1,2}N
and a coloring c:[ω1]2→N
satisfying the following:
(1)
For all β<α<ω1 for all k>c(β,α)
we have {gβ(k),gα(k)}={1,2},
2. (2)
For all β<α<ω1
we have gβ(c(β,α))=1 and gα(c(β,α))}=2,
3. (3)
For all γ<β<α<ω1 if c(γ,β)>c(α,β), then
c(γ,β)=c(γ,α),
4. (4)
For all α<ω1 and all m∈N the set {β<α∣c(β,α)<m} is finite.
5. (5)
For all α<ω1 the sets and gα−1[{1}] and gα−1[{2}]
are infinite.
Proof.
We choose the approach from Section 5 of [17].
Thus our c:[ω1]2→N is m of Definition 5.1. of [17], i.e., c(α,β) is
the minimal rank of an element X∈μ such that α,β∈X where μ is
an (ω,ω1)-cardinal.
The functions gα for α<ω1 are defined as follows, for n=0 we put gα(0)=0
for any α<ω1 and for any n∈N we put:
[TABLE]
Here X1∗X2 is as in the definition 1.1. (5) of [17].
First let us argue that the gαs are well defined.
By Definition 1.1. (6) and (7) of [17] each element α∈ω1
is in an element of rank zero of (ω,ω1)-cardinal μ. Now by
Velleman’s Density Lemma 2.3. of [17] it follows that
α is in an element of rank n of μ for any n∈N.
By Definition 1.1. (5) of [17] each element X of μ
of rank bigger than zero is of the form
X1∗X2 which means in particular that
X=X1∪X2 and X1∩X2<X1∖X2<X2∖X1.
Now suppose that α∈X=X1∗X2 and α∈Y=Y1∗Y2 and the ranks of X1,X2,Y1,Y2
are elements of μ of fixed rank n∈N. By Definition 1.1. (3) of [17]
there is an order preserving fY,X:X→Y, which by By Definition 1.1. (3) and (5) of
[17] must satisfy f[X1]=Y1 and f[X2]=Y2 and moreover
f↾(X∩(α+1)) is the identity on X∩(α+1) be the coherence
lemma 2.1 of [17], so fY,X(α)=α and f[X1∩X2]=Y1∩Y2,
f[X1∖X2]=Y1∖Y2 and f[X2∖X1]=Y2∖Y1 and so
the value of gα(n+1) does not depend if we applied the definition of gα(n+1)
to X1∗X2 or Y1∗Y2 which completes the proof of the claim that the gαs are well defined.
Now we will prove (1) and (2) for α<β<ω1
such that c(α,β)>0.
For (1) let n+1=k>rank(X) such that α,β∈X∈μ. Let Y (which exists by
the above-mentioned Density Lemma) be such that X⊆Y∈μ and rank(Y)=k.
Y=Y1∗Y2. By Definition 1.1. (5) of [17] we have that X⊆Y1 or
X⊆Y2, so {gβ(k),gα(k)}={1,2}.
(2) follows from the definition of c, i.e., from the minimality of the rank of X∋α,β,
which is of the form X1∪X2 with X1∖X2<X2∖X1 by By Definition 1.1. (5) of [17]
and by the hypothesis that c(α,β)>0.
Property (3) is Corollary 5.4 (2) of [17].
Property (4) is Proposition 5.3 (a) of [17].
To obtain property (5),
recall from [17, Theorem 4.5]
that (gα−1[{1}],gα−1[{2}])α<ω1
is a Hausdorff gap, so the sets must be infinite from some point on, so it is enough
to remove possibly countably many α<ω1 and renumerate the remaining ones.
So we are left with removing the hypothesis c(α,β)>0 from (1) and (2).
Note that what we have proved so far is valid for α,β,γ from
any subset of ω1, in other words we can pass to an uncountable subset X of ω1
and consider only gαs for α∈X and then re-enumerate X as ω1 in an
increasing manner. So we need to argue that there is an uncountable X⊆ω1
such that c(α,β)>0 for every α<β and α,β∈X.
To obtain X apply the Dushnik-Miller theorem (Theorem 9.7 of [16])
to a coloring d:[ω1]2→{0,1} given by
d(α,β)=min{1,c(α,β)} knowing that
all elements of rank zero must have fixed finite cardinality.
∎
Theorem 9**.**
There are families
(Xα,Yα,Aα,Bα∣α<ω1) of subsets of N
such that
(1)
Xα=Aα∪Bα* is infinite, Aα∩Bα=∅ for all α<ω1,*
2. (2)
Xβ∩Xα=∗∅* for all β<α<ω1,*
3. (3)
Yβ⊆∗Yα* for all β<α<ω1,*
4. (4)
Xβ⊆∗Yα* for all β<α<ω1,*
5. (5)
Xα∩Yα=∅* for all α<ω1,*
6. (6)
For every α<ω1 and every k∈N for all
but finitely many β<α there is l>k
such that
[TABLE]
Proof.
Define all the sets as subsets of [{0,1,2}<ω]2 instead of N.
For α<ω1 put Xα=Aα∪Bα, where
If β<α<ω1 and
{r,s}∈Xα∩Xβ and
gα↾(n+1)=gβ↾(n+1), then
{r,s}={gα↾(n+1),gβ↾(n+1)}
and {r(n),s(n)}={1,2} which means that n≤c(α,β) by
(1) and (2) of Theorem 8. So we obtain (2).
Note that if β<α<ω1, then
{gα↾c(α,β),gβ↾c(α,β)}∈Aβ∩Bα
by
(1) of Theorem 8, so we obtain (6).
For α<ω1 define
[TABLE]
If follows that Xβ⊆Yα if β<α<ω1, so we have (4).
Also Yα∩Xα=∅ holds because
Xβ∩Xα⊆⋃i≤c(β,α)[{0,1,2}i+1]2
by (1) and (2) of Theorem 8.
If γ<β<α we have c(γ,β)=c(γ,α) with the
possible exception for γ<β in the set D(β,α)={δ<β∣c(δ,β)≤c(β,α)}
by (3) of Theorem 8. D(β,α) is moreover finite by (4) of Theorem 8.
So almost all summands in the definition of Yβ appear literally in the definition
of Yα. The remaining summands of Yβ are Xγ∖⋃i≤c(γ,β)[{0,1,2}i]2 for γ∈D(β,α).
Each of them is almost equal to a summand of Yα of the form
Xγ∖⋃i≤c(γ,α)[{0,1,2}i]2 for γ∈D(β,α)
which proves that Yβ⊆∗Yα that is we have (3) which completes the proof
of the theorem.
∎
An example of the use of the partition of Xαs above into
Aα and Bα is given in the following
proposition which has found an application in [10].
Proposition 10**.**
There are families
(Xα′,Yα′,α<ω1) of subsets of N
and bijections fα:N×N→Xα′
such that
(1)
Xβ′∩Xα′=∗∅* for all β<α<ω1,*
2. (2)
Yβ′⊆∗Yα′* for all β<α<ω1,*
3. (3)
Xβ′⊆∗Yα′* for all β<α<ω1,*
4. (4)
Xα′∩Yα′=∅* for all α<ω1,*
5. (5)
For every α<ω1 and every k∈N for all
but finitely many β<α there are m1<...<mk and n1<...<nk
such that
[TABLE]
for all 1≤i,j≤k.
Proof.
Consider a pairwise disjoint family {Il∣l∈N} of finite subsets N
where Il={li,j∣1≤i,j≤l}∪{rl}.
Define Xα′=⋃{Il∣l∈Xα}
and Yα′=⋃{Il∣l∈Yα} where Xα,Yα
satisfy Theorem 9. It is clear that (1) - (4) are satisfied.
Put Xα′′=⋃{Il∖{rl}∣l∈Xα}.
Now for α<ω1 let Aα and Bα be
as in Theorem 9 and define
recursively in l∈Xα for elements
of Il∖{rl} an injection hα:Xα′′→N×N
in such a way that if l∈Aα, then there are m1<...<ml such that
hα(li,j)=(j,mi) for all 1≤i,j≤l, and
if l∈Bα, then there are n1<...<nl such that
hα(li,j)=(i,nj) for all 1≤i,j≤l. Now
use the elements {rl∣l∈Xα} to extend hα to
a bijection hα′:Xα′→N×N and define fα=(hα′)−1.
Note that
(6) of Theorem 9 gives l>k such that l∈Aβ∩Bα,
and so (5) follows.
∎
We may note several interesting properties
of the almost disjoint family (Xα∣α<ω1) from Theorem 9.
Corollary 11**.**
There is an almost disjoint family A which is inseparable (Luzin) but
for every countable B⊆A, the families B and A∖B
can be separated.
Proof.
As countable almost disjoint families can be separated, it is enough to
separate the initial fragment {Xβ∣β<α}
from the remaining part {Xβ∣β≥α}.
Our family from Theorem 9 of course has such separation Yα, so it is enough
to note that it is inseparable. For this note that Theorem 9 (5) implies that
given α<ω1 and k∈N for all but finitely many β<α we have
max(Xβ∩Xα)>k. This condition implies the inseparability of
the family in the standard way as in the case of the Lusin family (cf. [15]).
∎
Corollary 12**.**
There is a Luzin family (Xα∣α<ω1) such that
whenever X⊆ω1 is uncountable, councountable, then there is a
a Hausdorff gap (AαX,BαX)α<ω1
for which ((Xα∣α∈X),(Xα∣α∈ω1∖X))
is its almost disjoint refinement.
Proof.
Take the families (Xα∣α<ω1) and
(Yα∣α<ω1) from Theorem 9.
Using the nonexistence
of countable
gaps in ℘(N)/Fin for each α<ω1 we can recursively
construct separation CαX
of (Xβ∣β∈X∩α)
and (Xβ∣β∈α∖X) i.e., such CαX⊆N that
•
Xβ⊆∗CαX, if β∈α∩X,
•
Xβ∩CαX=∗∅,
if β∈α∖X.
•
CβX∩Yβ⊆∗CαX, if β<α,
•
(Yβ∖CβX)∩CαX=∗∅, if β<α.
Putting
AαX=CαX∩Yα, BαX=Yα∖CαX
we obtain a Hausdorff gap.
∎
4. R-embeddability in the Cohen model
The Cohen forcing C consists of elements of N<ω and is ordered by
reverse inclusion.
By the *Cohen model *we mean the model obtained by adding
ω2-Cohen reals with finite supports to a model of the Generalized
Continuum Hypothesis (GCH). Given X⊆ω2 we define
CX as the forcing adding Cohen reals (with finite supports)
indexed by X. The following lemma is well known:
Lemma 13** (Continuous reading of names for Cohen forcing).**
If A˙ is a C-name for a subset of N, then there is a pair (⟨Bn⟩n∈N,F) such that
(1)
each Bn⊆N<ω is a maximal antichain.
2. (2)
if s∈Bn+1 then there is t∈Bn such that
t⊆s.
3. (3)
F:n∈N⋃Bn⟶2.**
4. (4)
If c∈Nω is Cohen over V, then
[TABLE]
Here by A˙[c] we denote the evaluation of the name A˙ using the generic real c. If the
conditions (1) - (4) hold, we will say that (⟨Bn⟩n∈N,F) codes A˙.
As a warm-up we present a direct proof of a result of Dow and Hart from [8]
which was obtained there using an ingenious axiomatization of ℘(N)/Fin in the Cohen model.
In the Cohen model,
every almost disjoint family of
size ω2 is ω2-anti Lusin.
Proof.
It is enough to show that in the Cohen model, every almost disjoint family of size
ω2 contains two subfamilies of size ω2 that are
separated. Let A={A˙α∣α∈ω2} be a
Cω2-name for an almost disjoint family. Since Cω2
has the countable chain condition, for every α∈ω2, we can find Sα∈[ω2]ω
such that each A˙α is, in fact, a CSα-name.
By CH and the Δ-system lemma, (see [18] Lemma III.6.15) we can find
X∈[ω2]ω2 such that {Sα∣α∈X} forms a Δ-system with root R∈[ω2]ω.
We may further assume that the root R is the empty set (if this is not the
case, we simply move to the intermediate model obtained by forcing with
CR). Since CSα is a forcing notion equivalent to
C, we may assume that for each α∈X,A˙α is
a C{α}-name. Since V is a model of CH,
we can find X1∈[X]ω2
and a pair (⟨Bn⟩n∈ω,F) that codes every A˙α. In other words, each
A˙α is forced to be equal to
[TABLE]
(where c˙α is the name of the αth-Cohen real). Since
A is forced to be an almost disjoint family, there are
s,t∈N<ω such that:
(1)
s and t are incomparable nodes of the same length,
2. (2)
there are no m,s′,t′ with the following properties:
(a)
m>∣s∣,∣t∣.
2. (b)
s′,t′∈Bm.
3. (c)
s⊆s′,t⊆t′.
4. (d)
F(s′)=F(t′)=1.
(In fact, every pair of incomparable nodes can be extended to a pair of
nodes satisfying these properties). In V[G], define
families C0 and C1 by
[TABLE]
and
[TABLE]
It is
easy to see that both families are of size ω2 and are separated by
⋃{A∖m∣A∈C0}.
∎
A stronger statement: “Every almost disjoint family of size
continuum contains an R-embedabble subfamily of size
continuum” is consistent but it is false in the Cohen model.
We will prove the latter in the rest of this section and the former in the
next section.
By T we denote the set of all finite trees T⊆N<ω such that all maximal nodes of T have fixed the same height, we
denote this common value by ht(T). Given a tree
T⊆N<ω we define [T]2,=={{s,t}∈[T]2∣∣s∣=∣t∣}.
Definition 15**.**
Define P as the collection of all triples p=(Tp,Rp,ϕp) that satisfy the following properties:
(1)
Tp∈T.**
2. (2)
Rp* ⊆[Tp]2,=.*
3. (3)
If {s,t}∈Rp and {s′,t′}∈[Tp]2,= is such that s⊆s′ and t⊆t′ then {s′,t′}∈Rp.
4. (4)
ϕp:Tp⟶2.**
5. (5)
There is no {s,t}∈Rp such that ϕp(s)=ϕp(t)=1.
Given p,q∈P we say p≤Pq if Tq⊆Tp,Rq=Rp∩[Tq]2,=,ϕq⊆ϕp.
Since P is a countable partial order, it is a forcing notion equivalent to
the Cohen forcing. We define ϕ˙gen to be equal to ⋃{ϕp∣p∈G˙} (where G˙ is the name for a generic filter
of P). It is easy to see that ϕ˙gen is forced to be a
function from N<ω to 2.
Definition 16**.**
We define U as the set of all sequences (p,⟨sα⟩α∈F) with the following properties:
(1)
p∈P.**
2. (2)
F∈[ω2]<ω.**
3. (3)
sα∈Tp* for every α∈F (where p=(Tp,Rp,ϕp)).*
We define (p,⟨sα⟩α∈F)≤(q,⟨tα⟩α∈G) if the following conditions hold:
(1)
p≤Pq.**
2. (2)
G⊆F.**
3. (3)
tα⊆sα* for every α∈G.*
It is easy to see that U is forcing equivalent to Cω2. Moreover, U is forcing equivalent to first forcing with
P and then adding ω2-Cohen reals.
Given α<ω2 we define A˙α to be
the set {n∣ϕ˙gen(c˙α↾n)=1} (where c˙α is the name for the α-th Cohen real). It
is easy to see that A˙={A˙α∣α<ω2} is forced to be an almost disjoint family of size ω2.
Theorem 17**.**
In the Cohen model, there is an almost disjoint family of size ω2 that
does not contain uncountable R-embeddable subfamilies.
Proof.
Since U is forcing equivalent to Cω2, we can
think of the Cohen model as the model obtained after forcing with U
over a model of the Continuum Hypothesis. Let A be the almost disjoint family that was defined above. We
argue by contradiction, so assume that there is B˙={A˙α˙ξ∣ξ∈ω1} and f˙ such that
f˙ is forced to be an embedding Ψ(B˙) into 2ω
as in Lemma 2 (6). For every
ξ∈ω1, we may find r_{\xi}=(p_{\xi},\langle s_{\eta}^{r\xi}\rangle_{\eta\in F_{\xi}})$$\in\mathbb{U} and
βξ with the following properties:
By the Δ-system lemma, (see [18] Lemma III.2.6) we may find
p∈P,R∈[ω2]<ω,W∈[ω2]ω1 and s∈N<ω with the
following properties:
(1)
pξ=p for every ξ∈W.
2. (2)
{Fξ∣ξ∈W} forms a Δ-system with root
R.
3. (3)
sηrξ=sηrξ′
for every
ξ,ξ′∈W and η∈R.
4. (4)
s=sβξrξ for every ξ∈W.
It is easy to see that {rξ∣ξ∈W}⊆U is a centered set. Let {Hα∣α∈ω1}⊆[W]2 be a pairwise disjoint family.
For every α∈ω1 we find r_{\alpha}^{\prime}=(p_{\alpha}^{\prime},\langle u_{\eta}^{r_{\alpha}^{\prime}}\rangle_{\eta\in F_{\alpha}^{\prime}})$$\in\mathbb{U},tα and
zα with the following properties:
(1)
rα′≤rξ1,rξ2 where Hα={ξ1,ξ2} and ξ1<ξ2.
2. (2)
s⌢0⊆uβξ1rα′.
3. (3)
s⌢1⊆uβξ2rα′.
4. (4)
tα,zα∈N<ω are incompatible.
5. (5)
rα′⊩tα⊆f˙(A˙βξ1)∧zα⊆f˙(A˙βξ2).
The last condition (5) can be obtained since f˙ is forced to be injective
when restricted to B˙ as in Lemma 2 (6).
Once again, we can find W0∈[ω2]ω1,p′∈P,s0,s1∈N<ω,R′′∈[ω2]<ω,t,z such that for every α∈W0 the following holds:
(1)
pα′=p′.
2. (2)
tα=t and zα=z.
3. (3)
{Fα′∣α∈W0} forms a
Δ-system with root R′.
4. (4)
uηrα′=uηrδ′
for every α,δ∈W0 and η∈R′.
5. (5)
s0=uβξ1rα′ and s1=uβξ2rα′
for every
α∈W0 where Hα={ξ1,ξ2}.
Once again, the set {rα′∣α∈W0}⊆U is centered. Let M be a countable elementary submodel
of some H(κ) (where κ is a sufficiently
big cardinal) containing all objects that have been defined so far. Let γ∈M∩W0 and δ∈W∖M. Find m∈N such that
s⌢m∈/Tp′, let s be a sequence extending s⌢m
such that ∣s∣=∣s0∣=∣s1∣. Then we find r=(p,⟨yηr⟩η∈F)
with the following properties:
(1)
r≤rγ′,rδ.
2. (2)
Tp′∪{s}⊆Tp (where p=(Tp,Rp,Fp)).
3. (3)
F=Fγ′∪Fδ.
4. (4)
yβδr=s.
5. (5)
{s0,s},{s1,s}∈/Rp′.
We claim that r forces that f˙[A˙βδ]
has infinitely many elements below t and infinitely many elements below z,
this will be a contradiction. Let r1≤r and
k∈N, it will be enough to prove that we can extend r1
to a condition that forces that there is l>k such that l is in A˙βδ and its image under f˙ will be an extension of
t whose height is bigger than k (the case of z is similar). Let
α∈M∩W0 such that supp(r1)∩M and Fα′∖R′ are disjoint.
Let r2 be the greatest lower bound of
r1∩M and rα′, note that r2∈M. Let e∈ω such that s0⌢e has not been used
and let v be extending s0⌢e such that ∣v∣=sβδr1
and r3 such that sβξ1r3=v
(where Hα={ξ1,ξ2}) and
{v,sβδr1}∈/Rr3. Since r3,f˙∈M we can find
r4∈M such that r4≤r3 and
l>k such that r4⊩l∈A˙βξ1∧t⊆f˙(l). Since the support of
r4 is contained in M, then it is compatible with r1. Since {v,sβδr1}∈/Rr3, we can find a common extension that
forces that l is in A˙βδ.
∎
The above family clearly does not have ω1-controlled R-embedding
property but a much stronger fact concerning ω1-controlled R-embedding
property can be proved in the Cohen model.
Theorem 18**.**
In the Cohen model,
no uncountable almost disjoint family A has ω1-controlled R-embedding property.
Proof.
Let
{cα∣α<ω2} be the sequence of Cohen reals generating the Cohen model.
Let F be an uncountable almost disjoint family.
For every A∈A there is a countable
XA⊆ω2 such that A∈V[{cα∣α∈XA}].
Define ϕ:A→2ω by ϕ(A)=cαA where αA∈XA and all αA’s are distinct.
Suppose that f:N→2ω. There is a countable Y⊆ω2 such that
f∈V[{cα∣α∈Y}]. As A is uncountable, there is A∈A such
that αA∈Y, so αA∈XA∪Y.
Hence limn∈Af(n)=cαA=ϕ(A), proving that
A does not have ω1-controlled property.
∎
Remark 19**.**
The above proofs remains valid for any finite support product of not less than 2ω
c.c.c. forcings in place of the Cohen forcing.
5. R-embeddability in the Sacks model
By the *Sacks model *we mean the model obtained by adding ω2-Sacks reals (with countable support) to a model of the GCH. Recall
that a tree p⊆2<ω is a *Sacks tree if every node of
p can be extended to a splitting node. We denote by S the
collection of all Sacks tree and we order it by inclusion. Given α≤ω2 we denote by Sα the countable support
iteration of S of length α. *We will now prove that
in the Sacks model, every almost disjoint family of size continuum contains an
R-embeddable family of the same size. We will need to recall
some important notions and results on Sacks forcing. For more of this forcing
notion the reader may consult [4],
[12] and [20].
Definition 20**.**
Let α≤ω2,n,m∈N.
(1)
Given p,q∈S we say that (p,m)≤(q,n) if the following holds:
(a)
p≤q.**
2. (b)
n≤m.**
3. (c)
qn=pn.**
4. (d)
If n<m then for every s∈qn there are distinct t0,t1∈pm such that s⊆t0,t1.
2. (2)
Given p,q∈Sα and F∈[α]<ω we say that (p,m)≤F(q,n) if
the following holds:
Let α≤ω2 and {(pi,Fi,ni)∣i∈N} be a family such
that for every i∈N the following holds:
(1)
pi∈Sα.**
2. (2)
Fi∈[α]<ω.**
3. (3)
Fi⊆Fi+1.**
4. (4)
ni<ni+1.**
5. (5)
(pi+1,ni+1)≤Fi(pi,ni).**
6. (6)
j∈N⋃Fj=j∈N⋃supp(pj)**
Define p such that supp(p)=j∈N⋃supp(pj) and if β∈supp(p) then
p(β) is a Sβ-name for the intersection
of {pi(β)∣β∈supp(pi)}. Then p∈Sα and p≤pi for every
i∈N.
If p∈S and s∈2<ω we define ps={t∈p∣t⊆s∨s⊆t}. Note that ps is a Sacks tree if
and only if s∈p.
Definition 22**.**
Let p∈Sα,F∈[supp(p)]<ω and σ:F⟶2n. We define pσ as follows:
(1)
supp(pσ)=supp(p).**
2. (2)
Letting β<α the following holds:
(a)
pσ(β)=p(β)* if
β∈/F.*
2. (b)
pσ(β)=p(β)σ(β)* if β∈F.*
Similar to previous situation, pσ is not necessarily a condition of
Sα. We will say that σ:F⟶2n is
*consistent with p if pσ∈Sα. A condition
p is (F,n)-determined *if for every σ:F⟶2n either σ is consistent with p or there is
β∈F such that σ↾(F∩β) is
consistent with p and (p↾β)σ↾(F∩β)⊩σ(β)∈/p(β).
We say that p∈Sα is *continous *if for every
F∈[supp(p)]<ω and for every
n∈N there are G and m such that the following holds:
For every p∈Sα there is a
continous q≤p such that q is continous.
Let p be a continuous condition. We say that {(Fi,ni,Σi)∣i∈ω} is *a
representation of *p if the following holds:
(1)
Fi∈[supp(p)]<ω,ni∈ω.
2. (2)
Fi⊆Fi+1 and ni<ni+1.
3. (3)
supp(p)=i∈N⋃Fi.
4. (4)
p is (Fi,ni)-determined for every i∈ω.
5. (5)
Σi is the set of all σ:Fi⟶2ni
such that σ is consistent with p.
Note that if {(Fi,ni,Σi)∣i∈ω} is a representation of p and f:ω⟶ω is an increasing function, then {(Ff(i),nf(i),Σf(i))∣i∈N} is also a representation of p. It is also easy to see
that if p is continuous with representation {(Fi,ni,Σi)∣i∈N} and σ∈Σi, then pσ is also a continuous condition. Given a continuous
condition p∈Sα and R={(Fi,ni,Σi)∣i∈N} a representation of p, we
define [p]R as the set of all ⟨yβ⟩β∈supp(p)∈(2ω)supp(p) such that for every i∈ω the function
σ:Fi⟶2ni given by σ(β)=yβ↾ni belongs to Σi.
Lemma 25**.**
Let p∈Sα be a continuous condition. If R={(Fi,ni,Σi)∣i∈N} and R′={(Gi,mi,Πi)∣i∈N} are
two representations of p, then [p]R=[p]R′.
Proof.
We argue by contradiction, assume that there is y=⟨yβ⟩β<a∈[p]R∖[p]R′. Since y∈/[p]R′ there must be i∈ω such that the function σ:Gi⟶2mi given by σ(β)=yβ↾mi is not in Πi, i.e. σ is not
consistent with p. Since p is (Gi,mi)-determined,
there is β∈Gi such that σ↾(Gi∩β) is consistent with p but pσ↾(Gi∩β)⊩σ(β)∈/p(β). Let j∈ω such that
Gi⊆Fj and mi<nj. Since y∈[p]R we know that the function τ:Fj⟶2nj
given by τ(ξ)=yξ↾nj is consistent
with p. It is clear that pτ↾(Fj∩β)≤pσ↾(Gi∩β)
and σ(β)⊆τ(β) so
pτ↾(Fj∩β) forces that
τ(β) is not in p(β), which
contradicts the fact that τ is consistent with p.
∎
In light of the previous result, we will omit the subscript and only write
[p] to refer to [p]R where R is any
representation of p. It is easy to see that if p∈Sα is
a continuous condition then [p] is a compact set and
p⊩sgen↾supp(p)∈[p] (where sgen is the sequence of
generic reals). Let S∈[ω2]ω and
σ:F⟶2<ω where F∈[S]<ω,
we define ⟨σ⟩S as the set {⟨yβ⟩β∈S∈(2ω)S∣∀β∈F(σ(β)⊆yβ)}. Note that this is family of sets are the basis for the topology
of (2ω)S. The following result is well known:
Lemma 26** (Continuous reading of names for Sacks forcing).**
Let α<ω2,p∈Sα and x˙ be a Sα-name such
that p⊩x˙∈[ω]ω.
There is a continuous condition q≤p and a continuous function F:[q]⟶[N]ω such that
q\Vdash$$F\left(\dot{s}_{gen}\upharpoonright supp\left(q\right)\right)=\dot{x} (where s˙gen is the name for the generic real).
We will need the following notion:
Definition 27**.**
*Let C,D be two subfamilies of ℘(N). We say that the pair (C,D) *is
decisive if one of the following two conditions hold:
(1)
Either c∩d is infinite for every c∈C and
d∈D or
2. (2)
c∩d* is finite for every c∈C and d∈D.*
Note that if the second alternative holds and C and D
are both compact, then there is an m such that c∩d⊆m for
every c∈C and d∈D.
Lemma 28**.**
Let p,q be two continous conditions in Sα such that
supp(p)=supp(q) and F:(2ω)supp(p)⟶[N]ω a continuous function. There are p′,q′∈Sα such that the following holds:
(1)
p′≤p* and q′≤q.*
2. (2)
supp(p)=supp(q)=supp(p′)=supp(q′).**
3. (3)
The pair (F[[p′]],F[[q′]]) is decisive.
Proof.
We proceed by cases, the first case is that there are p′≤p,q′≤q with supp(p)=supp(q)=supp(p′)=supp(q′) and m∈N such F(y)∩F(z)⊆m for every y∈[p′] and z∈[q′].
In this case it is clear that the pair (F[[p′]],F[[q′]]) is decisive. The second case is that for every p′≤p,q′≤q with supp(p)=supp(q)=supp(p′)=supp(q′) and m∈N there are y∈[p′],z∈[q′] and k>m such that
k∈F(y)∩F(z).
Let supp(p)={αn∣n∈N}. We
will now recursively build the two sequences {(pn,mn,Fn)∣n∈N} and {(qn,kn,Gn)∣n∈N} such that for every
n∈N the following holds:
(1)
p0=p and q0=q,F0=G0=∅.
2. (2)
Fn∈[supp(p)]<ω,Fn⊆Fn+1 and αn∈Fn+1.
3. (3)
Gn∈[supp(q)]<ω,Gn⊆Gn+1 and αn∈Gn+1.
4. (4)
m0=k0=0.
5. (5)
mn<mn+1 and kn<kn+1.
6. (6)
pn and qn are continous conditions.
7. (7)
supp(pn)=supp(qn)=supp(p).
8. (8)
(pn+1,mn+1)≤Fn+1(pn,mn) and (qn+1,kn+1)≤Gn+1(qn,kn).
9. (9)
pn+1 is (Fn+1,mn+1)-determined and qn+1
is (Gn+1,kn+1)-determined.
10. (10)
For every σ:Fn⟶2mn and τ:Gn⟶2kn if σ is consistent with pn and
τ is consistent with qn then there is l>n such that l∈F(y)∩F(z) for every
y∈[pσn] and z∈[qτn].
Assume we are at step n+1. Since both pn and qn are continuous
conditions, we can find Fn+1,Gn+1,mn+1 and kn+1 with the
following properties:
(1)
Fn∪{αn}⊆Fn+1 and Gn∪{αn}⊆Gn+1.
2. (2)
mn<mn+1,kn<kn+1.
3. (3)
pn is (Fn+1,mn+1)-determined and qn is
(Gn+1,kn+1)-determined.
Let W={(σi,τi)}i<u
enumerate all pairs (σ,τ) for which σ:Fn+1⟶2mn+1 and τ:Gn+1⟶2kn+1. We recursively find a sequence {(p1i,q1i)∣i<u+1} such that for every i<u the
following holds:
(1)
pn=p10 and qn=q10.
2. (2)
(p1i+1,mn+1)≤Fn+1(p1i,mn+1) and (q1i+1,kn+1)≤Gn+1(q1i,kn+1).
3. (3)
p1i and q1i are continous.
4. (4)
supp(p1i)=supp(q1i)=supp(p).
5. (5)
If σi is consistent with p1i+1 and τi is
consistent with q1i+1 then there is l>n such that l∈F(y)∩F(z) for every
y∈[(p1i+1)σi] and
z∈[(q1i+1)τi].
Assume we are at step i. In case either σi is not consistent with
p1i or τi is not consistent with q1i we simply define
p1i+1=p1i and q1i+1=q1i. Assume σi is
consistent with p1i and τi is consistent with q1i. By
the hypothesis, there are l>n,y∈[(p1i)σi] and z∈[(q1i)τi] such that k∈F(y)∩F(z). Since F is a continous function, we can
find p1i+1 and q1i+1 with the following properties:
(1)
σi is consistent with p1i+1.
2. (2)
τi is consistent with q1i+1.
3. (3)
For every y1∈[(p1i+1)σi] and z1∈[(q1i+1)τi] it is the case that k∈F(y)∩F(z).
4. (4)
p1i+1 and q1i+1 are continous.
5. (5)
(p1i+1,mn+1)≤Fn+1(p1i,mn+1) and (q1i+1,kn+1)≤Fn(q1i,kn+1).
6. (6)
supp(p1i)=supp(q1i)=supp(p).
We then define pn+1=p1u+1 and qn+1=q1u+1.
Let p′ and q′ be the respective fusion sequences. It is
easy to see that F[c]∩F[e] is infinite for every c∈[p′] and e∈[q′].
∎
Note that if p is continous and β=min(supp(p)) then we may assume that p(β) is a real Sacks
tree (not only a name).
Proposition 29**.**
Let p∈Sα be a continuous condition, F:[p]⟶[N]ω a continuous function and
β=min{supp(α)}. Then there are q∈Sα with representation {(Fi,mi,Σi)∣i∈N} such that the following holds:
(1)
q≤p.**
2. (2)
supp(q)=supp(p).**
3. (3)
F0={β}.**
4. (4)
For every i∈N the following holds: for every σ,τ∈Σi such that σ(β)=τ(β), the pair (F[[qσ]],F[[qτ]]) is decisive.
Proof.
Let supp(p)={αn∣n∈N} with
α0=β . We recursively build a sequence {(pn,mn,Fn)∣n∈N} with the following properties:
(1)
p0=p.
2. (2)
F0={β} and m0=0.
3. (3)
Each pn is continuous and supp(pn)=supp(p).
4. (4)
Fn∈[supp(p)]<ω and
αn∈Fn.
5. (5)
(pn+1,mn+1)≤Fn(pn,mn).
6. (6)
mn<mn+1.
7. (7)
For every σ,τ:Fn⟶2mn such that
σ(β)=τ(β) and both are
consistent with pn, the pair (F[[pσn]],F[[pτn]]) is decisive.
Assume we are at step n. We first find Fn+1 and mn+1>mn such
that Fn∪{αn}⊆Fn+1 and pn is
(Fn+1,mn+1)-determined. Let W be the set of all pairs
(σ,τ) such that σ,τ:Fn+1⟶2mn+1,σ(β)=τ(β) and
both are consistent with pn. Enumerate W={(σi,τi)∣i≤l}. We recursively build {qi∣i≤l} with the following properties:
(1)
Each qi is (Fn+1,mn+1)-determined and continuous.
2. (2)
supp(qi)=supp(p).
3. (3)
(q0,mn)≤Fn+1(pn,mn+1).
4. (4)
(qi+1,mn+1)≤Fn(qi,mn+1) for i<l.
5. (5)
For each i≤l one of the following conditions hold:
(a)
Either σi or τi is not consistent with qi or
2. (b)
the pair (F[[(qi)σi]],F[[(qi)τi]]) is decisive.
Assume we are at step i<l. In case that σi+1 or τi+1 is
not consistent with qi we simply define qi+1=qi. We now assume
both σi+1 and τi+1 are consistent with qi. By applying
the previous lemma to (qi)σi and (qi)τi we obtain r0,r1 continous conditions
with the following properties:
(1)
r0≤(qi)σi.
2. (2)
r1≤(qi)τi.
3. (3)
supp(r0)=supp(r1)=supp(p).
4. (4)
the pair (F[[r0]],F[[r1]]) is decisive.
We now define the r to be a Sacks tree with the following properties:
(1)
rσi+1(0)=r0(β).
2. (2)
rτi+1(0)=r1(β).
3. (3)
rs=qi(β)s for s∈qi(β)mn and s∈/{σi+1(β),τi+1(β)}.
Let u˙ be a S-name with the following properties:
(1)
r0↾(β+1)⊩u˙=⟨r0(ξ)⟩ξ>β.
2. (2)
r1↾(β+1)⊩u˙=⟨r1(ξ)⟩ξ>β.
3. (3)
r′⊩‘‘u˙=⟨qi(ξ)⟩ξ>β\textquotedblright for every r′≤r↾(β+1) that is incompatible with both
r0↾(β+1) and r1↾(β+1).
Let qi+1=r⌢u˙. It is easy to see that qi+1 has the
desired properties. Finally, we define pn+1=ql. The fusion has the
desired properties.
∎
Let a be a countable subset of ω2. We can define Sa
as a countable support iteration of Sacks forcing with domain a. Clearly,
Sa is isomorphic to Sδ where δ is the
order type of a. Note that if p∈Sω2 is a continuous
condition, then it can be seen as a condition of Ssupp(p). With this remark, it is easy to prove the following:
Proposition 30**.**
Let p∈Sα be a continuous condition that has a
representation {(Fi,ni,Σi)∣i∈N} and F:[p]⟶[N]ω a continuous function. Let α∗ be the
order type of supp(p) and π:supp(p)⟶α∗ be the (unique) order isomorphism. There are
q∈Sα∗ and a continuous function H:[q]⟶[N]ω with the following properties:
(1)
supp(q)=α∗.**
2. (2)
The set {(π[Fi],ni,πΣi)∣i∈N} is a representation of q (where πΣi={πσ∣σ∈Σi}).
3. (3)
If π:(2ω)supp(p)⟶(2ω)α∗ denotes the
natural homeomorphism induced by π. then π↾[p] is an homeomorphism and F=Hπ.
We will say that (p,F) and (q,H) are
*isomorphic *if the previous conditions hold.
Theorem 31**.**
In the Sacks model, every almost disjoint family of size ω2 contains an
R-embedabble subfamily of size ω2.
Proof.
Let A˙={A˙α∣α∈ω2} be a Sω2-name for an almost disjoint family.
For every α<ω2 we choose a pair (pα,Fα) with the following properties:
By the Δ-system lemma, we can assume that {supp(pα)∣α∈ω2} forms a delta system with root
R∈[ω2]ω. Let δ∈ω2 such
that R⊆δ. By a pruning argument, we may assume that
R=supp(pα)∩δ for every α<ω2.
Since Sω2 has the ω2-chain condition, there is
p∈Sω2 such that p forces that the set {α∣pα∈G˙} will have size ω2 (where G˙ is the
name of the generic filter). Note that we may assume that p∈Sδ (by increasing δ if needed).
Let G0⊆Sδ be a generic filter such that p∈G0. We will now work in V[G0]. Let W={α∣(pα↾δ)∈G0}
which has size ω2 by the nature of p. For every α∈W, let
pα′ be the Sδ-name such that pα=(pα↾δ)⌢pα′. Note that we may view each pα′[G0] as
a condition of Sω2 where supp(pα′[G0])=supp(pα)∖δ. Let r=⟨rβ⟩β<δ be the generic sequence of reals added by G0. We can now define
Hα:[pα′[G0]]⟶[N]ω given by Hα(⟨yβ⟩)=Fα((r↾supp(pα))⌢⟨yβ⟩) which is a continous function.
By a previous lemma, for each α∈W we can find a continous condition
qα and {(Fiα,miα,Σiα)∣i∈ω} a representation of
qα with the following properties:
(1)
qα≤pα′[G0].
2. (2)
supp(qα)=supp(pα′[G0]).
3. (3)
F0α={βα} where βα=min(supp(pα′[G0])).
4. (4)
For every i∈ω the following holds: for every σ,τ∈Σiα such that σ(βα)=τ(β), the pair (Hα[[(qα)σ]],Hα[[(qα)τ]]) is decisive.
Let α∗ be the order type of supp(qα). For
each α∈W we find qα∗∈Sα∗
and Hα∗:[qα∗]⟶[N]ω such that (qα,Hα) and (qα∗,Hα∗) are
isomorphic. We can then find find γ,q∗∈Sγ
with representation {(Fi,mi,Σi)∣i∈N} and a continous function H:[γ]⟶[N]ω such that the set W′⊆W consisting of all α such that α∗=γ,qα∗=q∗ and Hα∗=H has size ω2.
We first note that for every i∈N the following holds: for every
σ,τ∈Σi such that σ(0)=τ(0), the pair (H[[qσ∗]],H[[qτ∗]]) is
decisive, furthermore, H(y)∩H(z) is finite for every y∈qσ∗
and z∈qτ∗. It is decisive since (qα,Hα) and (q∗,H) are
isomorphic, the second part of the claim follows since any pair of conditions
indexed by elements of W′ have disjoint supports (and A
is forced to be an almost disjoint family).
Given s∈q∗∩2ni let Bs=⋃{∪H[[qσ]]∣σ∈Σi∧σ(0)=s}. Note that if s and
t are two different elements of q∗∩2ni then Bs and
Bt are almost disjoint. Let T={Bs∣s∈q∗∩2ni∧i∈N}.
Note that if α∈W′ then qα⊩A˙α⊆s⊆r˙βα⋂Bs where r˙βα denotes the name of
the βα-generic real. It follows by genericity that A
will contain an R-embeddable subfamily of size ω2.
∎
The rest of this section is devoted to the study of the controlled version
of the R-embeddability in the Sacks model. In Theorem 41
we obtain the maximal possible
ω1-controlled embedding property since no family of
size c can have c-controlled R-embedding property by
Theorem 6.
Definition 32**.**
e:2ω→2ω* is the function
satisfying e(x)(n)=x(2n) for every n∈ω.*
Lemma 33**.**
Let u⊆2<ω be in S
and H:[u]→2N
be a homeomorphism.
Let α<ω2. Whenever p∈Sω2
is such that p↾α⊩p(α)=uˇ
and p↾α⊩x˙∈2ω for an Sα-name x˙,
then there is an Sα-name q˙ such that
(p↾α)⌢q˙∈Sα+1,
(p↾α)⌢q˙≤p↾(α+1) and
[TABLE]
In particular (p↾α)⌢q˙⊩eˇ(s˙α)=x˙, if
p(α)=1S.
Proof.
Define q˙ to be an Sα-name for the set
[TABLE]
This is an Sα-name for a perfect subtree
of u and so (p↾α)⌢q˙∈Sα+1,
(p↾α)⌢q˙≤p↾(α+1). We also have
(p↾α)⌢q˙⊩s˙α∈q˙ and e(H(z))=x for every
z∈[q], so the lemma follows.
∎
Lemma 34**.**
Let β<δ<ω2 and suppose that
p∈Sδ+1⊆Sω2 and F˙ is an Sδ-name
for a continuous function from 2ω onto 2ω such that F−1[{x}]∩[p(δ)]
is perfect for every x∈2ω in any forcing extension.
There is an Sδ-name r˙
such that p↾δ⌢r˙≤p and
[TABLE]
Proof.
Let q˙ be an Sδ-name for the set
[TABLE]
It is a name for a perfect set, as preimages of singletons under F are perfect in p(δ)
in any forcing extension. Let r˙ be such a name that [r]=q.
So p↾δ⌢r˙∈Sδ+1. Also q⊆[p(δ)], so
p↾δ⌢r˙≤p. If z∈q, then
F(z)=s˙β. But p↾δ⌢r˙⊩s˙δ∈[r˙]=q˙, so the lemma follows.
∎
Definition 35**.**
c1:S→2ω* is the following coding of
perfect subtrees of 2<ω by the reals. Let τ:N→2<ω be any
fixed bijection. Then given p∈S we define
c1(p)(n)=1 if and only if τ(n)∈p.
c2 will denote the decoding function i.e.,*
[TABLE]
Definition 36**.**
Let {Un∣n∈N} be a fixed bijective enumeration of all
clopen subsets of 2ω.
Suppose that p∈S.
Define Fp:2ω→2ω as follows: First by recursion define
a strictly increasing sequence (ni)i∈N such that n0 is minimal satisfying
Un0∩[p]=∅=[p]∖Un0
and both Un0 and 2ω∖Un0 are intervals
in the lexicographical order on 2ω. Given n0,...,nk
for k∈N let nk+1 be minimal such that nk+1>nk and
the following conditions hold for every σ∈2k+2:
(1)
⋂0≤i≤k+1Uniσ(i)* is an
interval in the lexicographical order on 2ω,*
2. (2)
⋂0≤i≤k+1Uniσ(i)∩[p]=∅,**
3. (3)
diam(⋂0≤i≤k+1Uniσ(i)∩[p])≤(2/3)k+1,
where V1=V and V0=2ω∖V.
Finally for x∈2ω and i∈ω we define
[TABLE]
Lemma 37**.**
Let p∈S. Fp−1[{x}]∩[p] is perfect
for any x∈2ω in any forcing extension.
Proof.
The conditions (1) - (3) of Definition 36 guarantee the
property in the statement of the lemma, but they are preserved by any forcing.
∎
Lemma 38**.**
The function f:2ω×2ω→2ω defined as
[TABLE]
is continuous.
Proof.
Let ε>0.
Let {Un∣n∈N} and {Uni∣i∈N} be as in Definition 36.
Let i0∈2N be such that Σi=i0∞1/2i<ε/2.
Given p there is m∈ω such that if p,p′ are perfect subsets of 2ω such that
c1(p)↾m=c1(p′)↾m, then the constructions of
{Uni∣i<i0} for p and p′ agree. It follows that if xn is sufficiently
close to x, then ∣Fc2(xn)(z)−Fc2(x)(z)∣<ε/2 (i.e.,
Fc2(xn) converges uniformly to Fc2(x)).
So
[TABLE]
[TABLE]
if ∣y−yn∣ and ∣x−xn∣ are sufficiently small by the
continuity of Fc2(x) and the above-mentioned uniform convergence.
∎
Theorem 39**.**
The following statement is true in the Sacks model:
Suppose that {xξ∣ξ<ω2}⊆2ω is a set of distinct reals
and {yξ∣ξ<ω2}⊆2ω. Then there is a continuous
g:2ω→2ω
and X⊆ω2 of cardinality ω1 such that g(xξ)=yξ
for all ξ∈X. In fact, there is a ground model continuous
ϕ:2ω×2ω→2ω
such that ϕ(xξ,sδ)=yξ for all ξ∈X and some δ<ω2.
Proof.
As CH holds in intermediate models we may assume that there are strictly increasing
{βθ∣θ<ω2}, conditions
pθ∈Sβθ⊆Sω2
and Sβθ-names x˙θ,y˙θ for xθ
and yθ respectively where θ<ω2 such that
pθ⊩x˙θ∈VSθ+1. Using the CH in the ground model
we can apply the stationary Δ-system lemma111By the stationary Δ-system lemma
we will mean the following lemma: given a family {Xθ∣θ<ω2}
of countable subsets of ω2 there is a stationary set
A⊆{α∈ω2∣cf(α)=ω1}
such that {Xθ∣θ∈A} forms a Δ-system. One can prove it as follows:
Take regressive f:{θ<ω2∣cf(θ)=ω1}→ω2
given by f(θ)=sup(Xθ∩θ). Use the pressing down lemma obtaing
a stationary A′⊆A where f is constantly equal to θ0. By CH and the ω1-additivity of the
nonstationary ideal on ω2 there is a stationary A′′⊆A′
such that Xθ∩θ0 is constant for θ∈A′′.
Consider g:ω2→ω2
given by g(θ)=sup{sup(Xη)∣η≤θ}. Let A⊆A′′
be the intersection of A′′ with the club consisting of the ordinals bigger than θ0
and closed under
g. A is the required set. for countable sets and obtain a stationary A⊆{α∈ω2:cf(α)=ω1}
such that {supp(pθ)∣θ∈A} forms a Δ-system
with root Δ⊆ω2 and all the conditions agree on Δ.
We can use the result of [11] to find continuous
hθ:2ω→2ω and qθ≤pθ such that
qθ⊩hˇθ(x˙θ)=s˙θ,
for all θ∈A. Use the pressing down lemma finding
a stationary A′⊆A such that there is α<ω2
with supp(qθ)∩θ⊆α for all θ∈A′.
We will work for the rest of the proof in VSα which will
be treated as the ground model.
By passing to a subset of A′ of cardinality ω2
and renaming the qθ’s we may assume that
[TABLE]
for a fixed continuous h:2ω→2ω and all θ∈A′
and p(θ) is a fixed perfect tree u⊆2<ω and the supports of
pθs for θ∈A′ are pairwise disjoint and min(supp(pθ))=θ
for all θ∈A′. Also
fix a homeomorphism H:[u]→2ω. Construct a strictly increasing
{θξ∣ξ<ω1} such that θξ<βθξ<θξ′ for all ξ<ξ′<ω1. Relabel the involved objects as
pξ:=pθξ, αξ:=θξ, βξ:=βθξ,
x˙ξ:=x˙θξ,
y˙ξ:=y˙θξ. Let δ<ω2 be
sup{αξ:ξ<ω1}=sup{βξξ˙<ω1}.
We will work with the iteration Sδ+1. In the model VSδ+1g is defined by
[TABLE]
where f is as in Lemma 38.
By (1) it is enough to prove that given p∈Sδ+1 and ξ<ω1
there is p′≤p, p′∈Sδ+1 and ξ<ξ′<ω1 such that
[TABLE]
Let ξ<ξ′<ω1 be such that the support of p↾δ is included in
αξ′, so we can assume that p↾δ∈Sαξ′ and
so p(δ) is an Sαξ′-name. As
supp(pξ′)⊆[αξ′,βξ′), the conditions p and pξ′
are compatible. Let p′′∈Sδ+1 be obtained from p by replacing 1 by
pξ′(α) on any α∈[αξ′,βξ′) so that
p′′≤p,pξ′ and p′′(αξ′)=u. Now to obtain the desired p′≤p′′
we will modify p′′ on αξ′,βξ′ and δ using Lemmas
33 and 34.
By Lemma 33 there is an Sαξ′-name q˙ such that
(p′′↾αξ′)⌢q˙∈Sαξ′+1,
(p′′↾αξ′)⌢q˙≤p′′↾(αξ′+1) and
[TABLE]
Since p′′(βξ′)=1
and yξ′ is an Sβξ′-name by the last part of Lemma 33
there is an Sβξ′-name o˙ such that
(p′′↾βξ′)⌢o˙∈Sβξ′+1,
(p′′↾βξ′)⌢o˙≤p′′↾(βξ′+1) and
[TABLE]
In VSβξ′ consider the continuous
function Fp(δ) as defined in Definition
36. Apply Lemma 34 whose hypothesis is satisfied
by Lemma 37 finding
an Sδ-name r˙
such that p′′↾δ⌢r˙≤p′′ and
[TABLE]
Define p′≤p in Sδ+1 by replacing in p′′
•
u by q˙ on the αξ′-th coordinate,
•
1 by o˙ on the βξ′-th coordinate,
•
p(δ) by r˙ on the δ-th coordinate.
It follows that p′∈Sδ, p′≤p′′≤p and
p′↾(αξ′+1)≤(p′′↾αξ′)⌢q˙,
p′↾(βξ′+1)≤(p′′↾αξ′)⌢o˙
and p′↾(δ+1)≤(p′′↾δ)⌢r˙.
Note that (5) and (3) gives that
[TABLE]
which together with (4) gives the required (2).
∎
Remark 40**.**
It is proved in [11] that under the hypothesis of Proposition 39
there is a continuous g:2N→2N
and either there is X⊆ω2 of cardinality ω2 such that g(xξ)=yξ or
g(yξ)=xξ.
Note that if xξ=sξ and yξ=sξ+1, where sξ denotes the ξ-th Sacks real
for ξ<ω2, then there is
there is no continuous g:2N→2N
such that g(xξ)=yξ for ω2-many ξ<ω2. This follows from the fact that any continuous function is coded
in some intermediate model.
Theorem 41**.**
In the Sacks model every almost disjoint family of cardinality ω2
has the ω1-controlled embedding property.
Proof.
Work in the Sacks model. Let A be any almost disjoint family of cardinality
2ω=ω2 and ϕ:A→2ω any function. By Theorem 31
and Lemma 2 and Remark 3 there is a subfamily A′⊆A of cardinality
ω2 and a function f:A′→2ω,
such that the limits xA=limn∈Af(n) exist for each A∈A′ and are different for
distinct A∈A′.
By Theorem 39 there is a subfamily
B⊆A′ of cardinality ω1 and a continuous g:2ω→2ω
such that g(xA)=ϕ(A) for all A∈B. By the continuity
of g we have ϕ(A)=g(xA)=limn∈Ag(f(n))
for all A∈B. So f′:N→2ω given by g∘f witnesses
the ω1-controlled embedding property for A and ϕ.
∎
6. An application: Abelian subalgebras of Akemann-Doner C*-algebras
The application of our combinatorial results from the previous sections
presented here is related to noncommutative C*-algebras defined by C. Akemann and J. Doner in [1]
with the help of almost disjoint families. Let us recall these constructions.
We consider the C*-algebra M2 of all complex 2×2 matrices with the usual operations
like in linear algebra and with the linear operator norm. In this section C will
stand for the field of complex numbers.
By ℓ∞(M2) we denote the C*-algebra of
all norm bounded sequences from M2 with the supremum norm and the coordinatewise operations.
By c0(M2) we denote the C*-subalgebra of ℓ∞(M2)
consisting of sequences of matrices whose norms converge to zero.
For θ∈[0,2π) define a 2×2 complex matrix of a rank one projection by
[TABLE]
Given A⊆N and θ∈[0,2π) define PA,θ∈ℓ∞(M2) by
[TABLE]
Given an almost disjoint family A⊆℘(N) and a function
ϕ:A→[0,2π) the Akemann-Donner algebra AD(A,ϕ) is the subalgebra
of ℓ∞(M2) generated by c0(M2) and {PA,ϕ(A)∣A∈A}.
As the distances between PA,θ and PA′,θ′ are at least one for infinite and
distinct A,A′⊆N and any θ,θ′∈[0,2π), such algebras
are nonseparable if A is uncountable.
Clearly if A is uncountable and ϕ:A→[0,2π) is constantly equal to θ, then
AD(A,ϕ) contains the nonseparable commutative C*-algebra
isomorphic to C0(Ψ(A)) of all complex valued continuous functions on Ψ(A) vanishing at infinity because Pθ2=Pθ=Pθ∗ since
it is a projection. However, as Akemann and Doner proved under CH, one can choose
A so that for every injective ϕ:A→(0,π/6) the algebra
AD(A,ϕ) has no nonseparable commutative subalgebra. In [5] the hypothesis
of CH was removed by showing that a ZFC Luzin family A is sufficient for this result
of Akemann and Doner. We have the following two lemmas implicitly from
[1, 5]:
Lemma 42**.**
Suppose that A is an almost disjoint family and
ϕ:A→[0,2π). If there is B⊆A of cardinality κ and f:N→[0,2π)
such that limn∈Bf(n)=ϕ(n) for every B∈B, then AD(A,ϕ)
contains a commutative C-subalgebra of density κ.*
Proof.
First define Pf∈ℓ∞(M2) by
Pf(n)=pf(n).
For B∈B define RB∈ℓ∞(M2) by RB(n)=PfχB(n),
where χB is the characteristic function of B.
The hypothesis about f implies that RB−PB,ϕ(B)∈c0(M2) and so RB is in AD(A,ϕ).
The algebra
generated by {RB∣B∈B} is commutative isomorphic to
C0(Ψ(B)) and of density κ as required.
∎
Lemma 43**.**
Let c∈R be such that
∥P0−Pθ∥<1/4 for θ∈[0,c].
Suppose that A is an almost disjoint family and that
ϕ:A→[0,c] is such that for no B⊆A of cardinality κ there is
f:N→[0,c]
such that limn∈Af(n)=ϕ(A) for every A∈B. Then
AD(A,ϕ)
does not contain any commutative C-subalgebra of density κ.*
Proof.
This is a slight modification of an argument from [1]
and modified in [5].
Let ρ:{Pθ∣θ∈[0,1/4]}→[0,1/4] be defined
by ρ(Pθ)=θ. ρ is a continuous map from a closed
subset of the unit ball B1 of M2 into [0,1/4]. Use the Tietze extension theorem to
find a continuous
η:B1→[0,1/4] which extends ρ.
Suppose that C is a commutative subalgebra of AD(A,ϕ)
whose density is κ. As in [1] and [5],
in a slightly different language, it follows from
simultaneous diagonalization of commuting matrices that
there are rank one projections q(n)∈M2 such that a(n)q(n)=q(n)a(n) for each
n∈N and each a∈C and we may assume that ∥q(n)−P0∥2≤1/2 by
(2.1.) of [5].
It is easy to note that for each element a of AD(A,ϕ)
the limit limn∈Aa(n) exists and is equal to a multiple of pϕ(A).
The density of C being κ means that
there is B⊆A of cardinality κ such that
for each B∈B there is aB∈C such that the limit limn∈BaB(n) exists and is equal zBpϕ(B) for a nonzero complex number zB.
By the compactness of the unit ball in M2
for each infinite B′⊆B there is an infinite B′′⊆B′
such that limn∈B′′q(n)=q′ exists, and so it needs to be a rank one projection
which commutes with limn∈AaB(n) which is zBpϕ(B), so pϕ(B)
and q′ commute but ∥q′−pϕ(B)∥≤1/2+1/4<1 and so q′=pϕ(B)
(see e.g. Lemma 3 of [5]).
This means that actually limn∈Bq(n) exists and is equal to pϕ(B)
for each B∈B. By the continuity of η we have
limn∈Bη(q(n))=η(pϕ(B))=ϕ(B).
Define f:N→[0,1/4] by f(n)=η(q(n)). So limn∈Bf(n)=ϕ(B) for
every B∈B contradicting the hypothesis on A.
∎
As corollaries we obtain:
Theorem 44**.**
In ZFC, for every almost disjoint family A of cardinality c there is
ϕ:A→[0,2π) such that the
Akemann-Doner C-algebra AD(A,ϕ) of density c has no commutative subalgebras
of density c.*
Proof.
Fix an almost disjoint family A of cardinality c.
By Theorem 6 there is ϕ:A→R such that
for no B⊆A of cardinality c there is f:N→R
such that limn∈Bf(n)=ϕ(B) for all B∈B.
By applying a continuous injective mapping we may assume that R is replaced by [0,c],
where c∈R is like in Lemma 43. Now Lemma 43
implies that AD(A,ϕ) has no commutative subalgebras
of density c.
∎
Theorem 45**.**
It is consistent that every Akemann-Doner algebra
of density c contains a nonseparable commutative subalgebra.
Proof.
We claim that the above statement holds in the Sacks model. By Theorem
41 given any almost disjoint family A of cardinality c
and a functions ϕ:A→R there is an uncountable B⊆A
such that limn∈Bf(n)=ϕ(B) for all B∈B. It follows form
Lemma 42 that AD(A,ϕ) contains a nonseparable commutative subalgebra.
∎
Theorem 46**.**
Let c∈R be such that
∥P0−Pθ∥<1/4 for θ∈[0,c]. It is consistent with the negation of
CH that for every almost disjoint family A of cardinality
c there is ϕ:A→[0,c]
such that the Akemann-Doner algebra AD(A,ϕ) of density c
has no nonseparable commutative subalgebra.
Proof.
Work in the Cohen model.
Fix an almost disjoint family A of cardinality c.
By Theorem 18 there is ϕ:A→R such that
for no uncountable B⊆A there is f:N→R
such that limn∈Bf(n)=ϕ(B) for all B∈B.
By applying a continuois mapping we may assume that the interval R is replaced by [0,c],
where c∈R is like in Lemma 43. Now Lemma 43
implies that AD(A,ϕ) has no commutative nonseparable subalgebras.
∎
Theorem 47**.**
Let c∈R be such that
∥P0−Pθ∥<1/4 for θ∈[0,c]. It is consistent with the negation of
CH that there is an almost disjoint family A of cardinality
c such that for every ϕ:A→[0,c]
the Akemann-Doner algebra AD(A,ϕ) of density c
has no nonseparable commutative subalgebra.
Proof.
Work in the Cohen model.
Let A be an almost disjoint family of cardinality c from Theorem 17.
By Theorem 17 for no ϕ:A→R there is
an uncountable B⊆A and f:N→R
such that limn∈Bf(n)=ϕ(B) for all B∈B.
Now Lemma 43
implies that AD(A,ϕ) has no commutative nonseparable subalgebras.
∎
These results complete earlier result of [5]
that there is in ZFC an almost
disjoint family A (any inseparable family) such that for every
ϕ:A→[0,c) the Akemann-Doner algebra of density ω1 has no nonseparable commutative subalgebra.
Bibliography32
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] C. Akemann and J. Doner, A nonseparable C*-algebra with only separable abelian C*-subalgebras . Bull. London Math. Soc. 11 (1979), no. 3, 279–284.
2[2] A. Avilés, F. Cabello Sánchez, J. Castillo, M. González, Y. Moreno, Separably injective Banach spaces . Lecture Notes in Mathematics, 2132. Springer, 2016.
3[3] J. Baumgartner, Applications of the proper forcing axiom . Handbook of set-theoretic topology, 913–959, North-Holland, Amsterdam, 1984.
4[4] J. Baumgartner, R. Laver, Iterated perfect-set forcing . Ann. Math. Logic 17 (1979), no. 3, 271–288.
5[5] T. Bice, P. Koszmider, A note on the Akemann-Doner and Farah-Wofsey constructions . Proc. Amer. Math. Soc. 145 (2017), no. 2, 681–687.
6[6] K. Ciesielski, J. Pawlikowski, Small coverings with smooth functions under the covering property axiom . Canad. J. Math. 57 (2005), no. 3, 471–493.
7[7] A. Dow, Sequential order under PFA . Canad. Math. Bull. 54 (2011), no. 2, 270–276.
8[8] A. Dow, K. P. Hart, Applications of another characterization of β ℕ ∖ ℕ 𝛽 ℕ ℕ \beta\mathbb{N}\setminus\mathbb{N} Proceedings of the International Conference on Topology and its Applications (Yokohama, 1999). Topology Appl. 122 (2002), no. 1-2, 105–133.