• Nie Znaleziono Wyników

# Applications of infinitary combinatorics 2

N/A
N/A
Protected

Share "Applications of infinitary combinatorics 2"

Copied!
2
0
0

Pełen tekst

(1)

### Applications of infinitary combinatorics 2

2018

Filters and ultrafilters.

Zad. 1 Show that every filter can be extended to an ultrafilter.

Zad. 2 We say that a family A generates a free filter if its closure under supersets and intersections is a free filter. Show that this is equivalent to the assertion that A has strong finite intersection property (sfip), i.e. every intersection of finitely many elements of A is infinite.

Zad. 3 Show that there are 2c many ultrafilters on ω. Hint: consider an independent family (Aα)α<c of subsets of ω. For f : c → {0, 1} show that there is an ultrafilter Ff such that Aα ∈ Ff if and only if f (α) = 1.

Zad. 4 Fix n ∈ ω and consider a family ∅ /∈ C ⊆ P(ω) satisfying the condition (?)n:

“for every partition of ω in less than n + 1 many sets the family C contains exactly one element of the partition”. For which n the condition (?)n is equivalent to “C is an ultrafilter”? Note: we do not assume here that C is a filter!

Zad. 5 If F is a filter on ω, then P is a pseudo-intersection of F if P is infinite and P ⊆ F for every F ∈ F .

• Show that every free filter generated by countably many elements does have a pseudo-intersection.

• Show that the density filter does not have a pseudo-intersection.

Zad. 6 A filter F is a P-filter if for every family {Fn: n < ω} ⊆ F there is A ∈ F such that A ⊆ Fn for every n < ω.

• Show that under Continuum Hypothesis there is a P-ultrafiler.

• Show that the density filter, i.e.

{A ⊆ ω : limA ∩ {0, . . . , n − 1}

n = 1}

is a P-filter.

• Show that the density filter cannot be extended to a P-ultrafilter.

(2)

Zad. 7 (*) Is P(ω)/Fin isomorphic to P(ω1)/Fin?

Pbn

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

Cytaty

Powiązane dokumenty

Recall that a family P of subsets of the natural numbers has the strong finite intersection property provided every finite intersection of members of P is infinite... It suffices

Mark, on an Argand diagram, the points A, B and C representing these three roots and find the area of

More- over, our results and methods used in the proof suggest that in the class of bounded pseudoconvex complete Reinhardt domains the symmetry of the Green function is equivalent

In a special case where the base field k is algebraically closed and a proper component of the intersection is a closed point, intersection multiplicity is an invariant of

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

This indeed turned out to be the right approach since Baumgartner’s proof (see [3]) also shows that PFA implies that every uncountable subset of P(ω) contains an uncountable chain or

4.5.. Denote this difference by R.. In a typical problem of combinatorial num- ber theory, the extremal sets are either very regular, or random sets. Our case is different. If A is

Thus, since Handelman proved that the ultrasimplicial property is preserved under formation of quotients by order-ideals [Han83, Theorem 3(ii)], it follows that every abelian