• Nie Znaleziono Wyników

Applications of infinitary combinatorics 6

N/A
N/A
Protected

Academic year: 2021

Share "Applications of infinitary combinatorics 6"

Copied!
1
0
0

Pełen tekst

(1)

Applications of infinitary combinatorics 6

2018

Zad. 1 Show that (βω, +) is left topological semi-group.

Zad. 2 Show that (m) + p = p + (m) for every p ∈ βω and m ∈ ω.

Zad. 3 Show that if p ∈ βω \ ω extends the filter of sets with density 1, then for each q the ultrafilter p + q extends the filter of sets with density 1. Prove that if p ∈ βω \ ω contains a density 0 set then for each q the ultrafilter p + q contains a set with density 0. Conclude that the addition of ultrafilters is not commutative. Also, that the function Tq defined by Tq(p) = p + q is not continuous.

Zad. 4 Show that if p if P -point, then p is not of the form p = q + r for any q, r ∈ βω \ ω.

Zad. 5 Let (G, +) be a compact left topological semi-group. Show that every right ideal contains a minimal right ideal and that this minimal ideal is closed.

Zad. 6 Show that if I is an ideal in a semi-group (G, +) and R is a minimal right ideal, then R ⊆ I.

Zad. 7 Fix k ∈ ω and work in (βω)k. Let

S = {(n, n + d, n + 2d, . . . , n + (k − 1)d) : d, n ∈ ω}

and

I = {(n, n + d, n + 2d, . . . , n + (k − 1)d) : n ∈ ω, d > 0}.

Show that S is a left topological semi-group and that I is an ideal in S.

Zad. 8 Let Σ be a finite alphabet and let W be the set of words over Σ. Let v be a letter outside Σ (a variable over W ), A - the set of words over Σ ∪ {v} and V = A \ W . For every a ∈ Σ let ¯a : A → W be a function such that ¯a(w) is a word in Σ in which all instances of v in w are replaced by a. Prove the following theorem: for every finite partition of W there is x ∈ V and an element of the partition such that ¯a(x) is contained in this element for each a ∈ A. (This is Hales-Jewett theorem. See the Blass’ paper linked on the webpage).

Pbn

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

Cytaty

Powiązane dokumenty

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

Can you find a partial order of size at most ω 1 which is not Tukey equivalent to any of them.. (P is Tukey equivalent to Q iff P is Tukey below Q and Q is Tukey

Show that those spaces are Hausdorff but not

1 Show that the existence of countable π-base implies separability which itself implies Knaster property and that Knaster property implies

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

The aim of this paper is to prove a similar theorem which contains the above result.. Namely, we have

In this paper, based on the induced tree of the crossed cube in the square of a graph, a novel distributed CDS construction algorithm named CDS-ITCC-G ∗ is presented, which can

Besides these the proof uses Borel–Carath´ eodory theorem and Hadamard’s three circles theorem (the application of these last two theorems is similar to that explained in [4], pp..