On Series of Ordinals and Combinatorics

This paper deals mainly with generalizations of results in finitary combinatorics to infinite ordinals. It is well-known that for finite ordinals ∑_bT<αβ is the number of 2-element subsets of an α-element set. It is shown here that for any well-ordered set of arbitrary infinite order type α, ∑_bT<αβ is the ordinal of the set M of 2-element subsets, where M is ordered in some natural way. The result is then extended to evaluating the ordinal of the set of all n-element subsets for each natural number n ≥ 2. Moreover, series ∑_β<αf(β) are investigated and evaluated, where α is a limit ordinal and the function f belongs to a certain class of functions containing polynomials with natural number coefficients. The tools developed for this result can be extended to cover all infinite α, but the case of finite α appears to be quite problematic.     

Countable network weight and multiplication of Borel sets

A space Borel multiplies with a space if each Borel set of is a member of the -algebra in generated by Borel rectangles. We show that a regular space Borel multiplies with every regular space if and only if has a countable network. We give an example of a Hausdorff space with a countable network which fails to Borel multiply with any non-separable metric space. In passing, we obtain a characterization of those spaces which Borel multiply with the space of countable ordinals, and an internal necessary and sufficient condition for to Borel multiply with every metric space.

     

Indestructibility and level by level equivalence and inequivalence

If κ < λ are such that κ is indestructibly supercompact and λ is 2^λ supercompact, it is known from [4] that

• {δ < κ | δ is a measurable cardinal which is not a limit of measurable cardinals and δ violates level by level equivalence between strong compactness and supercompactness}

must be unbounded in κ. On the other hand, using a variant of the argument used to establish this fact, it is possible to prove that if κ < λ are such that κ is indestructibly supercompact and λ is measurable, then

• {δ < κ | δ is a measurable cardinal which is not a limit of measurable cardinals and δ satisfies level by level equivalence between strong compactness and supercompactness}

must be unbounded in κ. The two aforementioned phenomena, however, need not occur in a universe with an indestructibly supercompact cardinal and sufficiently few large cardinals. In particular, we show how to construct a model with an indestructibly supercompact cardinal κ in which if δ < κ is a measurable cardinal which is not a limit of measurable cardinals, then δ must satisfy level by level equivalence between strong compactness and supercompactness. We also, however, show how to construct a model with an indestructibly supercompact cardinal κ in which if δ < κ is a measurable cardinal which is not a limit of measurable cardinals, then δ must violate level by level equivalence between strong compactness and supercompactness. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On countable connected locally connected almost regular Urysohn spaces

We construct connected, locally connected, almost regular, countable, Urysohn spaces. This answers a problem of G.X. Ritter. We show that there are 2^c such non-homeomorphic spaces. We also show that there are 2^c non-homeomorphic spaces which are further rigid. We discuss the group of homeomorphisms of such spaces.The following question was raised by G.X. Ritter: Does there exist a countable connected locally connected Urysohn space which is almost regular? We answer this question in the affirmative and in fact, show that not only are there as many as 2^c such spaces but that there are just as many rigid spaces with the same properties. Furthermore we show that every countable Urysohn space is a subspace of such a space. We also prove that every countable group is isomorphic to the group of autohomeomorphisms of some connected locally connected almost regular Urysohn space. Examples are given of groups of order c which can be represented in this manner.     

Indestructibility and stationary reflection

If κ < λ are such that κ is a strong cardinal whose strongness is indestructible under κ ‐strategically closed forcing and λ is weakly compact, then we show that A = {δ < κ | δ is a non‐weakly compact Mahlo cardinal which reflects stationary sets} must be unbounded in κ. This phenomenon, however, need not occur in a universe with relatively few large cardinals. In particular, we show how to construct a model where no cardinal is supercompact up to a Mahlo cardinal in which the least supercompact cardinal κ is also the least strongly compact cardinal, κ 's strongness is indestructible under κ ‐strategically closed forcing, κ 's supercompactness is indestructible under κ ‐directed closed forcing not adding any new subsets of κ, and δ is Mahlo and reflects stationary sets iff δ is weakly compact. In this model, no strong cardinal δ < κ is indestructible under δ ‐strategically closed forcing. It therefore follows that it is relatively consistent for the least strong cardinal κ whose strongness is indestructible under κ ‐strategically closed forcing to be the same as the least supercompact cardinal, which also has its supercompactness indestructible under κ ‐directed closed forcing not adding any new subsets of κ (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Metacompact subspaces of products of ordinals

Let be a subspace of the product of finitely many ordinals. is countably metacompact, and is metacompact iff has no closed subset homeomorphic to a stationary subset of a regular uncountable cardinal. A theorem generalizing these two results is: is -metacompact iff has no closed subset homeomorphic to a -stationary set where .

     

The quasi order of graphs on an ordinal

For α an ordinal, a graph with vertex set α may be represented by its characteristic function, f:[α]²→2, where f({γ,δ})=1 if and only if the pair {γ,δ} is joined in the graph. We call these functions α-colorings.We introduce a quasi order on the α-colorings (graphs) by setting f≤g if and only if there is an order-preserving mapping t:α→α such that f({γ,δ})=g({t(γ),t(δ)}) for all {γ,δ}∈[α]². An α-coloring f is an atom if g≤f implies f≤g.We show that for α=ω^ω below every coloring there is an atom and there are continuum many atoms. For α<ω^ω below every coloring there is an atom and there are finitely many atoms.