Constructive topology of bishop spaces

The theory of Bishop spaces (TBS) is so far the least developed approach to constructive topology with points. Bishop introduced function spaces, here called Bishop spaces, in 1967, without really exploring them, and in 2012 Bridges revived the subject. In this Thesis we develop TBS. Instead of having a common space-structure on a set X and R, where R denotes the set of constructive reals, that determines a posteriori which functions of type X -> R are continuous with respect to it, within TBS we start from a given class of "continuous" functions of type X -> R that determines a posteriori a space-structure on X. A Bishop space is a pair (X, F), where X is an inhabited set and F, a Bishop topology, or simply a topology, is a subset of all functions of type X -> R that includes the constant maps and it is closed under addition, uniform limits and composition with the Bishop continuous functions of type R -> R. The main motivation behind the introduction of Bishop spaces is that function-based concepts are more suitable to constructive study than set-based ones. Although a Bishop topology of functions F on X is a set of functions, the set-theoretic character of TBS is not that central as it seems. The reason for this is Bishop's inductive concept of the least topology generated by a given subbase. The definitional clauses of a Bishop space, seen as inductive rules, induce the corresponding induction principle. Hence, starting with a constructively acceptable subbase the generated topology is a constructively graspable set of functions exactly because of the corresponding principle. The function-theoretic character of TBS is also evident in the characterization of morphisms between Bishop spaces. The development of constructive point-function topology in this Thesis takes two directions. The first is a purely topological one. We introduce and study, among other notions, the quotient, the pointwise exponential, the dual, the Hausdorff, the completely regular, the 2-compact, the pair-compact and the 2-connected Bishop spaces. We prove, among other results, a Stone-Cech theorem, the Embedding lemma, a generalized version of the Tychonoff embedding theorem for completely regular Bishop spaces, the Gelfand-Kolmogoroff theorem for fixed and completely regular Bishop spaces, a Stone-Weierstrass theorem for pseudo-compact Bishop spaces and a Stone-Weierstrass theorem for pair-compact Bishop spaces. Of special importance is the notion of 2-compactness, a constructive function-theoretic notion of compactness for which we show that it generalizes the notion of a compact metric space. In the last chapter we initiate the basic homotopy theory of Bishop spaces. The other direction in the development of TBS is related to the analogy between a Bishop topology F, which is a ring and a lattice, and the ring of real-valued continuous functions C(X) on a topological space X. This analogy permits a direct "communication" between TBS and the theory of rings of continuous functions, although due to the classical set-theoretic character of C(X) this does not mean a direct translation of the latter to the former. We study the zero sets of a Bishop space and we prove the Urysohn lemma for them. We also develop the basic theory of embeddings of Bishop spaces in parallel to the basic classical theory of embeddings of rings of continuous functions and we show constructively the Urysohn extension theorem for Bishop spaces. The constructive development of topology in this Thesis is within Bishop's informal system of constructive mathematics BISH, inductive definitions with rules of countably many premises included

A Boolean Model of Ultrafilters

We introduce the notion of Boolean measure algebra. It can be described shortly using some standard notations and terminology. If B is any Boolean algebra, let B N denote the algebra of sequences (xn); xn 2 B: Let us write pk 2 B N the sequence such that pk (i) = 1 if i k and pk (i) = 0 if k ! i: If x 2 B, denote by x 2 B N the constant sequence x = (x; x; x; : : :): We define a Boolean measure algebra to be a Boolean algebra B with an operation : B N ! B such that (pk ) = 0 and (x ) = x. Any Boolean measure algebra can be used to model non principal ultrafilters in a suitable sense. Also, we can build effectively the initial Boolean measure algebra. This construction is related to the closed open Ramsey Theorem [8]. AMS Class. 03C90 (03F65 05D10 06E 54A05) Keywords: ultrafilters, boolean algebras, boolean models, Ramsey Theorem Introduction Non-principal ultrafilters over natural numbers constitute a typical example of objects that cannot be described effecti..