1
大学数学基礎解説
文献あり

Independent Sets and the Continuum Hypothesis

132
0

数学論理学アドベントカレンダー2022 の記事を書いてみました。遅れてすみません。

Let [X]<ω:={YX:|Y|<0} denote the collection of all finite subsets of X (also written Pω(X)).

Independent set

Let f:[X]<ωP(X) be any function. A set AX is called independent if for all finite A0[A]<ω and αAA0, we have αf(A0).

For example, if F is a field, X is an F-vector space, and spanF:[X]<ωP(X) is the F-span, then a set AX is independent with respect to spanF iff A is F-linearly independent.

We have a folklore characterization of the Continuum Hypothesis (CH).

The following are equivalent:

  1. For any f:[R]<ω[R]<ω, there exists an independent set of size 3.
  2. ¬CH.

In this article, we'll see proofs of the following facts.

  1. For any kN and f:[k]<ω[k]<ω, there exists an independent set Ak of size |A|=k+1.
  2. For kN, there exists some f:[k]<ω[k]<ω without any independent set Ak of size |A|=k+2.
  3. For any Borel f:[R]<ω[R]<ω, there exists an independent nonempty perfect set PR. (Thus |P|=20.)

Items (i) and (ii) imply Theorem 1, since one sees that every f:[X]<ω[X]<ω admits an independent set of size 3 iff |X|2.

Item (iii) illustrates that the above CH phenomenon is orthogonal to descriptive set theory. Indeed, if f:[R]<ω[R]<ω is Borel, then moving to a generic extension with (|R|=20>ω)V[G] and using item (i), we see from Σ11-absoluteness that in V, f admits independent sets of size k for any kN. I learned about this absoluteness argument from ジタさん's article here .

Proof of (i)

The following proof is from [1, Lemma 2.3].

We proceed via induction on k. When k=0, let A={α} be any set with αf(), and this is an independent set of size 1.

Let k>0 and f:[k]<ω[k]<ω, and fix k1k.

For a set Yk (later taken to be Y=k1), we put f[Y]:=Y0[Y]<ωf(Y0), so that a routine cardinality computation shows that |f[Y]||Y|+0. We can perform the "closure under f" operation
Y:=Yf[Y]f[f[Y]]=nNfn[Y]
such that |Y||Y||Y|+0 and moreover f[Y]Y. This defines the least YY with the property that f[Y]Y.

Now since |k1|=k1<k, we can pick some arbitrary αkk1 outside of this closure.

Define the "restriction to k1" function g:[k1]<ω[k1]<ω such that
g(X0)=(f(X0)f(X0{α}))k1[k1]<ω
By induction on k, the function g:[k1]<ω[k1]<ω has an independent set Ak1 of size k.

We claim that A{α} is an independent set of size k+1. It's clear from the g-independence of A that if βA and A0A{β}, then
βf(A0)f(A0{α})
Moreover for any A0A, we have
αf(A0)k1
due to k1A being closed under f. So A{α} is indeed independent.

Proof of (ii)

Again we proceed by induction on kN.

When k=0, we define f:[0]<ω[0]<ω via
f(X0)={{0,1,,n1}if X0={n}else
Then any set {m,n}0=N of size 2 cannot be independent since if m<n, then mf({n}).

Let k>0. For each α<ωk, since |α|k1, we can fix by induction a function fα:[α]<ω[α]<ω without independent sets of size k+1. Then we define f:[ωk]<ω[ωk]<ω via
f(X0)={if X0=fmax(X0)(X0{max(X0)})else

For example, when k=1, our function f:[1]<ω[1]<ω defined above can be made more explicit. For each α<ω1, fix an enumeration α={α0,α1,} with indices from ω. Then
f(X0)={{α0,α1,,αn1}if X0={αn<α}else
One may use this explicit form to check that f has no independent set of size 3. [Hint: Let {αm<αn<α} be the independent set.]

We claim that f admits no independent set of size k+2. Towards a contradiction, assume X0[ωk]<ω is an independent set with |X0|=k+2. Let α=max(X0), and so X0{α} is an independent set for fα of size k+1, which is a contradiction.

A slight variation of the proofs above gives another equivalent formulation of CH:

Let [X]ω:={YX:|Y|0} denote the collection of all countable subsets of X (also written Pω1(X)).

The following are equivalent:

  1. For any f:[R]<ω[R]ω, there exists an independent set of size 2.
  2. ¬CH.

Proof of (iii)

Recall that [R]<ω is a standard Borel space, when its Borel structure is inherited from the set of representatives {(xi)R<ω:x0<x1<<xn1} as a Borel (in fact, open) subset of the Polish space R<ω:=nNRn.

Fix any Borel function f:[R]<ω[R]<ω.

For every positive integer n>0, the set
Rn:={(xi)Rn:{xi}[R]<ω is an independent set of size n}
is a comeager Borel subset of Rn.

Fix n>0, and let
Cn:={(xi)Rn:x0f({x1,,xn1})}Rn
It's clear that Cn is Borel.

Then for each (x1,,xn1)Rn1, the section
Cn(x1,,xn1)={x0R:x0f({x1,,xn1})}=Rf({x1,,xn1})
is a cofinite subset of R, and so is comeager.

By Kuratowski–Ulam [2, Theorem 8.41], every section of Cn is comeager implies that the set Cn is comeager Borel.

In a similar way and by modifying the proof above, Kuratowski–Ulam also implies that the desired set
Rn={(xi)Rn:jn,xjA0{xi},xjf(A0)A0}
is comeager Borel. Here we may use that comeager Borel sets are closed under finite intersections, and also preimages under canonical projections π:RnRm.

Now let's recall the definition and some properties of the hyperspace K(X) of (nonempty) compact subsets of X (later taken to be X=R).

The hyperspace K(X)

Let X be a Polish space. Denote by K(X) the set of (nonempty) compact subsets of X. When K(X) is endowed with the Vietoris topology (see [2, §4.F]), K(X) becomes a Polish space.

More explicitly, if d is a compatible complete metric on X, then the Hausdorff metric dH is a compatible complete metric on K(X) (see [2, Theorem 4.25]).

[2, Exercise 8.8]

Recall that a Polish space X is perfect if X has no isolated points.

If X is a perfect Polish space, then comeagerly many KK(X) is (nonempty) perfect.

[2, Theorem 19.1]

For KX and nN, define (K)n:={(xi)Kn:ij,xixj} to be the set of tuples in Kn with pairwise distinct entries.

Let X be a Polish space. For all iN, we fix a natural number niN and a comeager subset RiXni. Then comeagerly many KK(X) satisfies that iN,(K)niRi.

Fixing the sets RnRn from Lemma 4, we can use Lemmas 5 and 6 to find a comeager set of PK(R) such that PR is nonempty perfect and (P)nRn for all n. By definition of independent sets and using (P)nRn, we see that any such P is an independent set.

The same proof above applies to any Universally Baire measurable f:[R]<ωRω as well.

For example, let FR be a countable subfield of R. The F-span spanF:[R]<ωRω can be defined to be a Borel function. So by Example 1, there must exist a nonempty perfect set PR which is F-linearly independent.

Cohen forcing

We can give an explicit combinatorial account of the previous proof of (iii), and some alternative lemmas to replace Lemmas 5 and 6.

For simplicity, instead of using R, we replace it with the Baire space ωω. For our purposes, the Cohen forcing C=(ω<ω,) consists of conditions which are finite segments p=(x0,,xn1)ω<ω, and we say that pq (p is stronger than q) if p is an end-extension of q.

When Gω<ω is C-generic, we write the corresponding Cohen real as xG:=Gωω.

For a Borel set Bωω, we can use Σ11-absoluteness to define it in V[G] using the same Borel code, such that B=BV[G](ωω)V. Then recall that Bωω is comeager iff xGBV[G].

Now we define a notion of forcing that generically adds a nonempty perfect subset P of ωω.

The notion of forcing P consists of conditions p such that for some nN, p is a function p:2<nω<ω, satisfying for all s,t2<n,
stp(s)p(t)
where denotes end-extension.

For conditions p,qP, we say that pq (p is stronger than q) if p is an end-extension of q, that is q=pdom(q).

When GP is generic, we can define a function φG:=limG:2ωωω such that for all x(2ω)V[G], φG(x):=nN(G)(xn)ωω. (We will show dom(φG(x))=ω in Lemma 7.)

This φG is clearly continuous, and we will see that in fact it is an embedding, so that PG:=image(φG)ωω is a nonempty perfect set. The main lemma is the following:

For all x0,x1,,xn1(2ω)V[G] pairwise distinct (ijxixj), (φG(x0),φG(x1),,φG(xn1)) is Cn-generic over V.

The proof is mostly standard, and the only nontrivial step is the following.

Let pP with dom(p)=2<n, and let DC2n be a dense set. Then there exists some qp with dom(q)=2n and q(t):t2nD.

Lemma 8

Consider p^:=p(t(n1)):t2nC2n. Then since DC2n is dense, there exists some q^p^ such that q^D. Define q:2nω<ω such that
q(t)={p(t)if t2<nq^(t)if t2n
Now we finish by checking that qP, qp.

Lemma 7

Fix mN such that xim2m are pairwise distinct for in.

For any open dense set DCn and kN, define D^kCk such that
(p0,,pk1)D^ki0in1k,(pi0,,pin1)D
Note that for every i0in1k (pairwise distinct), the set {(pi)Ck:(pi0,,pin1)D} is open dense in Ck, and so D^k as a finite intersection of these (kn)n! many open dense sets is open dense in Ck.

Define EP such that for any pP with dom(p)=2k,
pE(km)(p(t):t2kD^2k)
Since we've shown that D^2k is open dense in C2k, Lemma 8 implies that EP is dense, so we can fix some pEG and let dom(p)=2k.

Since km, xik2k are pairwise distinct for in. By definition of E and D^2k, we have
(p(x0k),p(x1k),,p(xn1k))D
Since pG, we also have (p(xik))(φG(xi)) as an initial segment, so (φG(xi)) meets D as desired.

When combined with Lemma 4, Lemma 7 implies that PG(ωω)V[G] is an independent nonempty perfect set. Then the statement “there exists an independent nonempty perfect set” is Σ21, so Σ21-absoluteness implies that it holds in V as well. This gives an alternative proof of (iii).

Infinite independent sets

Questions of the form “Which f:[κ]<ω[κ]<ω admits an infinite independent set?” is once again less related to the question of (G)CH, but more related to partition properties of cardinals. For example:

[3, Theorem 45.2]

Let κ be a Ramsey cardinal and let λ<κ. Then every f:[κ]<ω[κ]<λ admits an independent set of size κ.

Compared with the main phenomema (i) and (ii), the consistency of “every f:[ω]<ω[ω]<ω admits an infinite independent set” seems to be still unclear. The best result I could find is the following:

[4, Theorem 2]

Assume V=L. The following are equivalent:

  1. Every f:[κ]<ω[κ]ω admits an independent set of size ω.
  2. κ(ω)2<ω.

So if V=L, then κ=ω does not satisfy the critetion of this last theorem, see eg. [5, Proposition 7.15].

Strong Fubini's Theorem

We conclude this article with a connection to the strong Fubini's theorem. I first learned about strong Fubini's theorem from でぃぐさん's article [6].

Let nullP(R) denote the set of Lebesgue null sets in R.

The following are equivalent:

  1. Every f:[R]<ωnull admits an independent set of size 2.
  2. For any function f:[0,1]2[0,1], it holds that
    0101fdxdy=0101fdydx
    whenever both integrals exist in the sense of Lebesgue integration.

The reader may compare this statement with the statement of Theorem 3, where every f:[R]<ω[R]ω admitting an independent set of size 2 is equivalent to ¬CH.

It's easy to see that statement (1) from Proposition 11 is equivalent to the following statement:

(1') Every f^:[0,1]null admits an independent pair α,β[0,1], in the sense that αf^(β) and βf^(α).

  • Here, (1) ⇒ (1') is easy since given any f^:[0,1]null, we can let f:[R]<ωnull be defined via f({cotπα})=cot(πf^(α)) if α(0,1) and f(S)= otherwise, and so any f-independent set {cotπα,cotπβ}R of size 2 gives an f^-independent pair α,β[0,1].
  • Next, (1') ⇒ (1) is also easy since if f:[R]<ωnull, then letting for every α[0,1], f^(α):={α}f()f({α}), we see that any f^-independent pair α,β[0,1] gives an f-independent set {α,β} of size 2.

A proof from [6, Lemma 2] showed that statement (2) of Proposition 11 is equivalent to the following statement:

(2') There does not exist a set D^[0,1]2, such that:

  • For every x[0,1], the vertical section D^x:={y[0,1]:(x,y)D^} is Lebesgue conull;
  • For every y[0,1], the horizontal section D^y:={x[0,1]:(x,y)D^} is Lebesgue null.

Note that in [6, Lemma 2], the quantifiers for the sections' coordinates x,y are "for almost every", but we can always modify D over a Lebesgue null subset of [0,1]2 to get to a set D^ of our desired form, where we can quantify over every vertical/horizontal section.

It remains to show that (1') ↔ (2'). The following proofs are essentially contained in [6, Theorem 3].

¬(1)¬(2)

Let f:[0,1]null admit no independent pair. That is, for all α,β[0,1], we have αf(β) or βf(α).

Define the set D:={(x,y)[0,1]2:xf(y)}.

  • Fix any x[0,1]. For any y[0,1], we have either xf(y) so then yDx, or yf(x). So every possible y[0,1] is covered by Dxf(x)=[0,1]. Then since f(x)null, the section Dx[0,1]f(x) is Lebesgue conull.
  • Fix any y[0,1]. Then the section Dy=f(y)null is Lebesgue null.

So D[0,1]2 violates (2').

¬(2)¬(1)

Let D[0,1]2 violate (2'). So for every x,y[0,1], we have [0,1]Dxnull and Dynull.

Define the function f:[0,1]null such that
f(x):=([0,1]Dx)Dx

Fix any α,β[0,1].

  • If (α,β)D, then αDβf(β).
  • If (α,β)D, then β[0,1]Dαf(α).

So f admits no independent pair.

参考文献

[1]
John T. Baldwin, Sy D. Friedman, Martin Koerwien, Michael C. Laskowski, Three Red Herrings around Vaught’s Conjecture, Transactions of the American Mathematical Society, 2016, pp. 3673-3694
[2]
Alexander S. Kechris, Classical Descriptive Set Theory, Graduate Texts in Mathematics, Springer-Verlag, 1995
[3]
P. Erdős, A. Hajnal, A. Máté, R. Rado, Combinatorial Set Theory: Partition Relations for Cardinals, Studies in Logic and the Foundations of Mathematics, North-Holland, 1984
[4]
K.J. Devlin, J.B. Paris, More on the free subset problem, Annals of Mathematical Logic, 1973, pp. 327-336
[5]
Akihiro Kanamori, The Higher Infinite: Large Cardinals in Set Theory from their Beginnings, Springer Monographs in Mathematics, Springer, 2009
投稿日:20221222
OptHub AI Competition

この記事を高評価した人

高評価したユーザはいません

この記事に送られたバッジ

バッジはありません。
バッチを贈って投稿者を応援しよう

バッチを贈ると投稿者に現金やAmazonのギフトカードが還元されます。

投稿者

duyaa
duyaa
6
276
中国人です。今はAlexander Kechris先生の弟子として、カリフォルニア工科大学で博士課程を受けています。

コメント

他の人のコメント

コメントはありません。
読み込み中...
読み込み中
  1. Proof of (i)
  2. Proof of (ii)
  3. Proof of (iii)
  4. Cohen forcing
  5. Infinite independent sets
  6. Strong Fubini's Theorem
  7. 参考文献