Transcendence bases, well-orderings of the reals and
the axiom of choice
Haim Horowitz and Saharon Shelah
Abstract
We prove that ZF+DC+"there exists a transcendence basis
for the reals"+"there is no well-ordering of the reals” is consistent
relative to ZFC. This answers a question of Larson and Zapletal.111Date: January 27, 2019
2010 Mathematics Subject Classification: 03E25, 03E35, 03E40, 12F20
Keywords: transcendence basis, well-ordering, axiom of choice, forcing,
amalgamation
Publication 1093 of the second author
Partially supported by European Research Council grant 338821.
Introduction
It’s well-known that the axiom of choice has far-reaching consequences
for the structure of the real line. Among them, to name a few, are
the existence of non-measurable sets of reals, nonprincipal ultrafilters
on ω, paradoxical decompositions of the unit sphere, mad families
and more. As the aforementioned statements are consistently false
over ZF+DC, it’s natural to study the possible implications between
them in the absence of choice. This direction of study has gained
considerable interest in recent years, with many consistency results
showing mostly the independence over ZF+DC between various properties
of the real line implied by the axiom of choice. We mention several
such examples:
**Theorem ([Sh:218]): **It’s consistent relative to an inaccessible
cardinal that ZF+DC holds, all set of reals are Lebesgue measurable
and there is a set of reals without the Baire property.
**Theorem ([HwSh:1113]): **It’s consistent relative to an
inaccessible cardinal that ZF+DC holds, all sets of reals are Lebesgue
measurable and there is a mad family.
**Theorem ([LaZa1]): **It’s consistent relative to a proper
class of Woodin cardinals that there exists a mad family and there
are no ω1 sequences of reals, nonatomic measures on ω
and total selectors for E0.
Our current paper will focus on two consequences of the axiom of choice
for the real line, namely the existence of a transcendence basis for
the reals and the existence of a well-ordering of the reals. The following
question was asked by Larson and Zapletal in their forthcoming book:
**Question ([LaZa2]): **Does the existence of a transcendence
basis for the reals imply the existence of a well-ordering of the
reals?
We shall prove that the answer is negative, namely:
**Main result: ZF+DC+"**there exists a transcendence basis
for the reals"+"there is no well-ordering of the reals" is consistent
relative to ZFC.
The proof strategy will be similar to that of [Sh:218] and [HwSh:1113]
(though no inaccessible cardinals will be used in the current proof).
Our forcing P will consist of conditions p=(up,Qp,∼Rp)
where Qp is a ccc forcing from some fixed H(λ)
that forces MAℵ1 and ∼Rp is a set
of Qp-names of reals that’s forced by Qp
to be a transcendence basis for the reals. The order will be defined
naturally. The sets of the form ∼Rp will approximate
a transcendence basis in the final model, while the forcing notions
Qp will help us to prove the non-existence of a well-ordering
of the reals using a standard amalgamation argument. The fact that
each Qp forces MAℵ1 will guarantee that the
relevant amalgamation will be ccc.
Acknowledgement: We would like to thank Jindra Zapletal for
informing us about a gap in a previous version of this paper.
The rest of the paper will be devoted to the proof of the main result
mentioned above. We shall assume basic familiarity with amalgamation
of forcing notions (see, e.g., [HwSh:1090]).
Proof of the main result
**Hypothesis 1: **Throughout the paper, we fix infinite regular
cardinals λ and κ and an infinite cardinal μ
such that μ=μℵ1<λ, κ=μ+ or ℵ2≤cf(κ)≤κ≤λ
and (∀α<κ)([α]ℵ1<κ).
**Definition 2: **We define the forcing notion P as
follows:
A. p∈P iff p=(u,Q,∼R)=(up,Qp,∼Rp)
where:
a. u∈[λ]<κ.
b. Q∈H(λ) is a ccc forcing such that u is
its underlying set of elements.
c. ⊩QMAℵ1.
d. ∼R is a set of Q-names of reals that
is forced by Q to be a transcendence basis of the reals.
B. p≤Pq iff
a. up⊆uq.
b. Qp⋖Qq.
c. ∼Rp⊆∼Rq.
**Definition 3: **We define the following P names:
a. ∼Q=∪{Qp:p∈∼GP}.
b. ∼R=∪{∼Rp:p∈∼GP}.
**Claim 4: **a. P is a forcing notion of cardinality
λ<κ, preserving cardinals and cofinalities of cardinals
≤κ and >λ<κ.
b. If δ<κ is a limit ordinal and pˉ=(pα:α<δ)
is ≤P-increasing and continuous (i.e. α<δ→β<α∪Qp1+β⋖Qpα),
then pˉ has an upper bound pδ such that pˉ^(pδ)
is ≤P-increasing continuous.
c. In clause (b), if ℵ2≤cf(δ), then pδ
can be chosen as the union of the pαs.
d. ⊩P"∼Q is ccc and
λ is its underlying set of elements".
e. ⊩P"⊩∼Q"∼R
is a transcendence basis for the reals.
f. Every permutation g of λ naturally induces an automorphism
g^ of P and ∼Q which
maps ∼R to itself.
**Proof: **a. By clause (b), P is (<κ)-complete,
hence it preserves cardinals and cofinalities ≤κ. The
rest should be straightforward.
b. As α<δ∪Qpα is
ccc, it can be extended to a ccc forcing Qpδ
such that α<δ∪Qpα⋖Qpδ
and ⊩QpδMAℵ1. As the union
of the ∼Rpα is algebraically independent,
we can extend it to a transcendence basis for the reals.
c. Letting Qδ=α<δ∪Qpα,
obviously Qδ is ccc. In order to show that ⊩QδMAℵ1,
it’s enough to show that for forcing notions of cardinality ℵ1
in VQδ. As ℵ2≤cf(δ), the
names for a given ccc forcing in VQδ and ℵ1-many
of its dense subsets are already Qα-names for
some α<δ, and as ⊩QαMAℵ1,
we’re done. Similarly, every Qδ-name for a real
is already a Qα-name for some α<δ,
hence α<δ∪∼Rpα
is a Qδ-name of a transcendence basis.
d. Let G⊆P be generic over V, we shall argue
in V[G]. Given I={qα:α<ω1}⊆Q,
as P is (<κ)-complete, it doesn’t add new sequences
of ordinals of length ω1, hence I∈V. For every p∈P,
there is some q∈P above p such that I⊆Qq.
Therefore, there is some p∈G such that I⊆Qp.
As Qp is ccc, there are two elements of I that are
compatible in Qp and hence they’re compatible in Q.
It follows that Q is ccc. By a similar density argument,
for every α<λ, there is some p∈G such that α∈Qp,
hence λ is the underlying set of elements of Q.
e. As before, we shall argue in V[G] where G⊆P
is generic over V. The algebraic independence of ∼R
follows from G being directed. As for the maximality of ∼R,
as before, suppose that ∼r is a Q-name
for a real, then by a similar argument as in clause (d), there is
p∈G such that ∼r is a Qp-name.
As ∼Rp is a Qp-name of a transcendence
basis, we’re done.
f. This is straightforward. □
**Definition/Observation 5: **Let V1 be the model HOD(R<κ∪{∼R}∪V)
inside VP∗∼Q, then V1 is a model
of ZF+DC<κ with the same reals as VP∗∼Q.
In particular, V1 contains a transcendence basis for the reals
(using Claim 4(e)). □
We shall obtain the desired result by proving that there is no well
ordering of the reals in V1. Before that, we shall prove our main
amalgamation claim:
**Main amalgamation claim 6: **(A) implies (B) where:
A. a. Q0⋖Ql (l=1,2).
b. ⊩Ql"∼rlˉ=(∼rl,i:i<nl)
is algebraically independent over RVQ0.
c. Q=Q1×Q0Q2.
B. ⊩Q"∼r1ˉ^∼r2ˉ
is algebraically independent over RVQ0.
**Proof: **Assume towards contradiction that there is a counterexample
to the claim. As forcing with Q is the same as forcing
with Q0∗((Q1/Q0)×(Q2/Q0)),
if there is a counterexample to the claim, then by working in VQ0
we obtain a counterexample where Q0 is trivial and Q=Q1×Q2.
Therefore, we may assume wlog that Q=Q1×Q2
and Q0 is trivial. We may also assume wlog that it’s
forced by Q that ∼r1ˉ and ∼r2ˉ
form a counterexample (if (q1,q2)∈Q1×Q2
forces that ∼r1ˉ and ∼r2ˉ
form a counterexample, then we can replace Ql by Ql↾ql
for l=1,2).
**Subclaim: **We may assume wlog that Q1 and Q2
are Cohen forcing.
Proof of Subclaim: Suppose that xˉ=(Q1,Q2,∼r1ˉ,∼r2ˉ)
form a counter example to the amalgamation claim, we shall construct
a counter example x′ˉ=(Q1′,Q2′,∼r1′ˉ,∼r2′ˉ)
where Q1′,Q2′ are Cohen forcing. As xˉ
is a counter example to the claim, there is a nontrivial polynomial
P=P(x0,...,xn1−1,y0,...,yn2−1) with coeficients in RV
and a condition (p1,p2)∈Q1×Q2
such that (p1,p2)⊩Q1×Q2"P(∼r1ˉ,∼r2ˉ)=0".
We shall now choose (p1,nˉ,p2,nˉ,a1,nˉ,a2,nˉ)
by induction on n<ω such that the following conditions hold:
a. pl,nˉ=(pl,n,ν:ν∈ωn) (l=1,2).
b. Each pl,n,ν is a condition in Ql (l=1,2).
c. If n=m+1, l∈{1,2} and ν∈ωn then pl,m,ν↾m≤pl,n,ν.
d. al,nˉ=(al,n,η,i−,al,n,η,i+:η∈ωn,i<nl).
e. al,n,η,i− and al,n,η,i+ are rationals such
that al,n,η,i+−al,n,η,i−<2n1.
f. pl,n,η⊩Ql"i<nl∧al,n,η,i−<∼rl,i<al,n,η,i+".
g. If n=m+1, ρ∈ωm, l∈{1,2}, ((ai,bi):i<nl)
is a sequence of pairs of rationals such that ai<bi for i<nl
and pl,m,ρ⊮Ql"¬(i<nl∧ai<∼rl,i<bi)",
then for some k<ω, pl,n,ρ^(k)⊩Ql"i<nl∧ai<∼rl,i<bi".
h. Moreover, we have ai<al,n,ρ^(k),i−<al,n,ρ^(k),i+<bi.
i. Moreover, if n=m+1 and ν1,ν2∈ωm, then for
some k1 and k2, letting ρl=νl^(kl) (l=1,2)
we have: For all x1,...,xn1,y1,...,yn2, if i<n1∧al,n,ρ1,i−<xi<al,n,ρ1,i+
and j<n2∧al,n,ρ2,j−<yj<al,n,ρ2,j+
then −2n1<P(x1,...,xn1−1,y1,...,yn2−1)<2n1.
j. The al,n,η,i− are increasing with η and the al,n,η,i+
are decreasing with η.
The induction is straightorward where for clause (i) we use the fact
that (p1,p2)⊩Q1×Q2"P(∼r1ˉ,∼r2ˉ)=0".
For l=1,2 we define the following objects:
a. Ql′=(ω<ω,≤).
b. ∼ηl is the name for the generic real of
Ql′.
c. For i<nl, ∼rl,i′ is the unique real in
n<ω∩(al,n,∼ηl↾n,i−,al,n,∼ηl↾n,i+).
Now Ql′ are equivalent to Cohen forcing, and by clause
(i) of the induction, ⊩Q1′×Q2′"P(∼r1′,∼r2′)=0".
Therefore, in order to prove the subclaim, it suffices to show that
⊩Ql′"∼rl,1′,...,∼rl,n1−1′
are algebraically independent over RV". Assume towards
contradiction that there is some η∈Ql′ and a nontrivial
polynomial Pl′(x0,...,xnl−1) such that η⊩Ql′"Pl′(∼rl′)=0".
By the assumption on (Ql,∼rl), letting
n=lg(η), pl,n,η⊩Ql"Pl′(∼rl)=0".
Let Gl⊆Ql be generic over V such that pl,n,η∈Gl,
so wlog Pl′(∼rl[Gl])>0. By continuity, there
are rationals ai<bi (i<nl) such that V[G]⊨"for
every x0,...,xnl−1, i<nl∧ai<xi<bi→Pl′(x0,...,xnl−1)>0
and ∼rl,i[Gl]∈(ai,bi)". Therefore, the
first part of the statement holds in V and there is some q∈Gl
such that pl,n,η≤q and q forces the second part of
the statement. In particular, pl,n,η⊮Ql"¬(i<nl∧ai<∼rl,i<bi)".
By clause (g) of the induction, there is some k<ω such that
pl,n+1,η^(k)⊩Ql"i<nl∧ai<∼rl,i<bi"
and ai<al,n+1,η^(k),i−<al,n+1,η^(k),i+<bi.
Now η^(k) is a condition in Ql′ that forces
in Ql′ that ∼rl,i′∈(ai,bi)
for all i<nl. It follows that η^(k) forces in Ql′
that Pl′(∼rl,0′,...,∼rl,nl−1′)>0,
contradicting the choise of η and P−l′. It follows that ⊩Ql′"∼rl,1′,...,∼rl,n1−1′
are algebraically independent over RV", which completes
the proof of the subclaim.
We shall now return to the proof of the main amalgamation claim:
Let χ≥ℵ1 be large enough and let N be a countable
elementary submodel of (H(χ),∈) such that Ql,∼rlˉ∈N
(l=1,2). As Ql is Cohen, there is a Ql-name
∼ηl for a Cohen real over V that generates
the generic for Ql. For each l<3 and i<nl there
is a Borel function Bl,i such that ∼rl,i=Bl,i(∼ηl),
we may assume that the Bl,is belong to N as well.
Let η1′∈V be Cohen over N, let G2⊆Q2
be generic over V and let η2=∼η2[G2].
η2 is Cohen over V and is also generic over N[η1′].
Therefore, (η1′,η2) is generic for Q1×Q2
over N. As it’s forced by Q1×Q2 over
V that ∼r1ˉ^∼r2ˉ
is a counterexample, there is a polynomial P witnessing this, i.e.
V⊨"⊩Q1×Q2"P(...,B1,l(∼η1′),...,...,B2,l(∼η2),...)=0"".
By absoluteness, the same stetement holds in N. By the genericity
over N of (η1′,η2), N[η1′,η2]⊨P(...,B1,l(η1′),...,...,B2,l(η2),...)=0.
Therefore, there is p2∈G2⊆Q2 such that
N[η1′]⊨"p2⊩Q2"∼r2ˉ
is not algebraically independent over RV, as witnessed
by (B1,l(η1′):l<n1)"", and by absoluteness, the
same holds in V. This contradicts assumption (A)(b) and completes
the proof of the claim. □
Before proving the relevant conclusion for P, we need the
following algebraic observation:
**Observation 7: **Let p1,p2∈P and suppose
that p1≤p2. Denote Qpl by Ql
and ∼Rpl by ∼Rl (l=1,2).
Then ⊩Q2"∼R2∖∼R1
is algebraically independent over RVQ1".
**Proof: **Suppose towards contradiction that there is some q∈Q2
and ∼r0,...,∼rn2−1 (with no
repetition) such that q⊩Q2"∼r0,...,∼rn2−1∈∼R2∖∼R1
are not algebraically independent over RVQ1".
By increasing q if necessary, we may assume wlog that there is
a non-trivial polynomial P(x0,...,xn2−1) over RVQ1
such that q⊩Q2"P(∼r0,...,∼rn2−1)=0".
Therefore, there are Q1-names of reals ∼s0,...,∼sn1−1
and a polynomial Q(x0,...,xn2−1,y0,...,yn1−1) over the
rationals such that q⊩Q2"Q(x0,...,xn2−1,∼s0,...,∼sn1−1)=P(x0,...,xn2−1)".
Recalling that ∼R1 is a Q1-name of
a transcendence basis over the rationals, then by increasing q
if necessary, there are Q1-names of reals ∼t0,...,∼tn0−1
such that q⊩Q2"∼t0,...,∼tn0−1∈∼R1
(with no repetition)" and q⊩Q2"∼s0,...,∼sn1−1
are algebraic over Q[∼t0,...,∼tn0−1]"
(here Q denotes the field of rational numbers). It follows
that q⊩Q2"{∼t0,...,∼tn0−1,∼r0,...∼rn2−1}⊆∼R2
is not algebraically independent over the rationals". By the choice
of the ∼tis and the ∼ris,
q⊩Q2"∼t0,...,∼tn0−1,∼r0,...,∼rn2−1
are without repetition”. Together, we get a contradiction to the
definition of the conditions in P and the fact that p2∈P.
□
**Conclusion 8: **Suppose that p1,p2∈P such
that p1≤p2. Let g be a permutation of λ of order
2 such that g↾up1=id and g′′(up2)∩up2=up1,
and let p3=g^(p2). Then there is q∈P such
that p2,p3≤q and Qp2×Qp1Qp3⋖Qq.
**Proof: **Let Q=Qp2×Qp1Qp3.
As Q1 is ccc and ⊩Q1"MAℵ1+Q2/Q1⊨ccc+Q3/Q1⊨ccc",
it follows that Q is ccc (see e.g. [HwSh:1090] for
details). By the previous observation, for l=2,3, ⊩Qpl"∼Rpl∖∼Rp1
is algebraically independent over RVQp1".
Therefore, by Claim 6, ⊩Q"(∼Rp2∖∼Rp1)∪(∼Rp3∖∼Rp1)
is algebraically independent over RVQ1".
It follows that ⊩Q"∼Rp2∪∼Rp3=∼Rp1∪(∼Rp2∖∼Rp1)∪(∼Rp3∖∼Rp1)
is algebraically independent over the rationals" (recall that if
{α0,...,αn−1} are algebraically independent over
the rationals and {αn,...,αm−1} are algebraically
independent over a field F containing Q∪{α0,...,αn−1},
then {α0,...,αm−1} are algebraically independent
over the rationals). By Hypothesis 1, there is a ccc forcing Qq
such that Q⋖Qq, ⊩QqMAℵ1
and ∣Qq∣=uq for some uq∈[λ]<κ.
As ⊩Qq"∼Rp2∪∼Rp3
are algebraically independent over the rationals", there is a set
∼Rq of Qq-names of reals such that
∼Rp2∪∼Rp3⊆∼Rq
and ⊩Qq"∼Rq is a transcendence
basis for the reals". Now let q=(uq,Qq,∼Rq),
it’s easy to verify that q is as required. □
Recalling Observation 5, we shall complete the proof of the main result
of the paper by proving the following claim:
**Claim 9: **There is no well-ordering of the reals in V1.
**Proof: **Assume towards contradiction that there are (p1,r1)∈P∗∼Q
such that, over V, (p1,r1)⊩P∗∼Q"∼f
is a one-to-one function from R to Ord" and such that
∼f is definable from ∼R and
a sequence (∼ηϵ:ϵ<ϵ(∗))
where ϵ(∗)<κ and wlog each ∼ηϵ
is a Qp1 name for a real (by a similar argument as
in claims 4(d) and 4(e), we can always extend p1 to make this
true). Choose (p2,r2)≥(p1,r1) and a name of a real ∼r
such that (p2,r2)⊩P∗∼Q"∼r∈RVQp2∖RVQp1",
wlog r2∈Qp2, and by extending the condition if
necessary, we may assume wlog that (p2,r2) forces a value γ
to ∼f(∼r).
Let g be a permutation of λ of order 2 such that g↾up1=id
and g′′(up2)∩up2=up1. We shall denote both of
the induced automorphisms on P and Q by g^.
Clearly, g^(p1)=p1. Let p3=g^(p2) and r3=g^(r2).
By the previous claims, there is q∈P such that p2,p3≤q
and Qp2×Qp1Qp3⋖Qq,
and by the construction of the amalgamation, there is r∈Qq
above r2 and r3. As ⊩P∗∼Q"RVQp2∩RVQp3=RVQp1",
it follows that (q,r)⊩P∗∼Q"∼r=g(∼r)".
As (p2,r2)≤(q,r), (q,r)⊩P∗∼Q"∼f(∼r)=γ".
Recalling that ∼f is forced to be injective, we
shall arrive at a contradiction by showing that (q,r)⊩P∗∼Q"∼f(g^(∼r))=γ".
It’s enough to show that the statement is forced by (p3,r3)=(g^(p2),g^(r2)),
and in order to show that, it suffices to show that ∼f=g^(∼f).
Recalling that each ∼ηϵ in the definition
of ∼f is a Qp1-name and that g
is the identity on up1, it follows that g^(∼ηϵ)=∼ηϵ.
By Claim 4(f), ∼R is preserved by g^. As
∼f is definable from ∼R and
(∼ηϵ:ϵ<ϵ(∗)), it
follows that g^(∼f)=∼f. This
completes the proof of the claim. □
References
[HwSh:1090] Haim Horowitz and Saharon Shelah, Can you take Toernquist’s
inaccessible away?, arXiv:1605.02419
[HwSh:1113] Haim Horowitz and Saharon Shelah, Madness and regularity
properties, arXiv:1704.08327
[LaZa1] Paul Larson and Jindrich Zapletal, Canonical models for
fragments of the axiom of choice, Journal of Symbolic Logic, 82:489-509,
2017
[LaZa2] Paul Larson and Jindrich Zapletal, Geometric set theory,
preprint
[Sh:218] Saharon Shelah, On measure and category, Israel J. Math.
52 (1985) 110-114
(Haim Horowitz) Department of Mathematics
University of Toronto
Bahen Centre, 40 St. George St., Room 6290
Toronto, Ontario, Canada M5S 2E4
E-mail address: [email protected]
(Saharon Shelah) Einstein Institute of Mathematics
Edmond J. Safra Campus,
The Hebrew University of Jerusalem.
Givat Ram, Jerusalem 91904, Israel.
Department of Mathematics
Hill Center - Busch Campus,
Rutgers, The State University of New Jersey.
110 Frelinghuysen Road, Piscataway, NJ 08854-8019 USA
E-mail address: [email protected]