Topological Reduced Products and the GCH

Document Type

Conference Proceeding

Language

eng

Format of Original

7 p.

Publication Date

1976

Publisher

Topology Proceedings

Source Publication

Topology Proceedings

Source ISSN

0146-4124

Abstract

Since its inception in the late fifties, the theory of reduced products in model theory and algebra has developed into an active field of research with increasingly many participants. In particular the theory of ultraproducts has provided "algebraic" proofs of the compactness theorem of first order logic, the existence of saturated models of certain kinds; as well as a characterization of the notion of elementary equivalence between models. Copious details can be found in [BS] and [CK]. In our paper [B] we attempted to translate the notion of reduced product into the context of general topology and found, not too surprisingly, that here was a vast untapped source of research problems, many of the type already encountered in the theory of box products. In [B] several parallel problems involving box products and "topological" ultraproducts are explored; and it turns out that the ultraproduct theorems are often either easier than their counterparts to prove or can be proved directly in ZFC without recourse to extra set-theoretic axioms. Topological reduced products are formed as certain quotients of box products where the equivalence relations in question derive from filters on the index set. In this note ~N'e present a result about paracompactness in topological ultraproducts (i.e. where the filter is maximal) and show how this result relates to a known theorem about paracompactness in box products (trivially reduced products via the singleton filter). Both of these results relate directly with the Generalized Continuum Hypothesis (GCH).

Comments

Published as part of the proceedings of the conference, Spring Topology and Dynamics Conference, 1976: 261-267. Publisher link.

Paul Bankston was affiliated with McMaster University at the time of publication.

Share

COinS