• Nie Znaleziono Wyników

Applications of infinitary combinatorics 5

N/A
N/A
Protected

Academic year: 2021

Share "Applications of infinitary combinatorics 5"

Copied!
1
0
0

Pełen tekst

(1)

Applications of infinitary combinatorics 5

2018

Zad. 1 Define the almost disjointness number a by

a= min{|A| : A is infinite maximal almost disjoint family}.

Show that b ≤ a. Hint: consider A - almost disjoint family of size less than b on ω × ω and suppose that it contains all the sets of the form {n} × ω.

Zad. 2 What is the topological interpretation of a?

Zad. 3 We say that S ⊆ ω splits N ⊆ ω if both S ∩ A and A \ S are infinite. Define the splitting number

s= min{|A| : every N ⊆ ω is split by a member of A}.

Show that s is the minimal family of bounded sequences of real numbers such that for every infinite Y ⊆ ω at least one of those sequences does not converge on Y .

Zad. 4 Show that s is the minimal κ such that {0, 1}κ is sequentially compact (i.e.

every sequence has a convergent subsequence).

Zad. 5 Show that if X ⊆ {0, 1}ω is such that |X| < s, then λ(X) = 0, where λ is the standard (Lebesgue) measure on {0, 1}N.

Zad. 6 Show directly (without using p ≤ a) that MA(ω1) implies a > ω1.

Zad. 7 Assume MA(κ). Let X be a Hausdorff space such that every family of pairwise disjoint open sets is countable. Let {Uα: α < κ} be a family of dense open subsets of X.

Show that T

α<κUα 6= ∅. Notice that this is a generalization of Baire theorem.

Zad. 8 Consider the following version of Martin’s Axiom: for every P - countable partially ordered set, for every family of κ many dense sets in P, there is a filter inter- secting all of them. Show that this version implies that d = c. Hint: consider

P = {f : f − function, dom(f ) ∈ [ω], rng(f ) ⊆ ω}

ordered by “⊇”.

Zad. 9 Show that b is the minimal number κ such that there is no gap of type (ω, κ).

What is the topological interpretation of this fact?

Pbn

http://www.math.uni.wroc.pl/~pborod/dydaktyka

Cytaty

Powiązane dokumenty

Show that those spaces are Hausdorff but not

1 Show that the summable ideal and the ideal of density 0 sets are both dense.. Show that they

In this short paper we investigate properties of Rings, putting special emphasis on the relationship between the two operations “+” and “·”... This follows from

We obtain holomorphic functions with prescribed fast growth near the boundary of such domains; then we apply our construction in order to obtain functions which are holomorphic and

We prove some properties of uniformly completely Ramsey null sets (for example, every hereditarily Menger set is uniformly completely Ramsey null).. The notion of UCR 0 sets

The ‘only if direction’ follows from the well-known result that every induced subgraph of a strongly chordal graph has a simple vertex , meaning a vertex v such that the

The minimum total cover problem was first shown to be NP-hard in general graphs by Majumdar [10], where he also gives a linear-time algorithm for trees.. Hedetniemi

Let us now recall the notion of α-proper forcing for a countable ordinal α saying that, given an ∈-chain of length α of countable elementary sum- bodels of some large enough structure