Skip to main content
Top

1998 | Book

A Course on Borel Sets

Author: S. M. Srivastava

Publisher: Springer Berlin Heidelberg

Book Series : Graduate Texts in Mathematics

insite
SEARCH

About this book

The roots of Borel sets go back to the work of Baire [8]. He was trying to come to grips with the abstract notion of a function introduced by Dirich­ let and Riemann. According to them, a function was to be an arbitrary correspondence between objects without giving any method or procedure by which the correspondence could be established. Since all the specific functions that one studied were determined by simple analytic expressions, Baire delineated those functions that can be constructed starting from con­ tinuous functions and iterating the operation 0/ pointwise limit on a se­ quence 0/ functions. These functions are now known as Baire functions. Lebesgue [65] and Borel [19] continued this work. In [19], Borel sets were defined for the first time. In his paper, Lebesgue made a systematic study of Baire functions and introduced many tools and techniques that are used even today. Among other results, he showed that Borel functions coincide with Baire functions. The study of Borel sets got an impetus from an error in Lebesgue's paper, which was spotted by Souslin. Lebesgue was trying to prove the following: Suppose / : )R2 -- R is a Baire function such that for every x, the equation /(x,y) = 0 has a. unique solution. Then y as a function 0/ x defined by the above equation is Baire.

Table of Contents

Frontmatter
1. Cardinal and Ordinal Numbers
Abstract
In this chapter we present some basic set-theoretical notions. The first five sectionsl are devoted to cardinal numbers. We use Zorn’s lemma to develop cardinal arithmetic. Ordinal numbers and the methods of transfinite induction on well-ordered sets are presented in the next four sections. Finally, we introduce trees and the Souslin operation. Trees are also used in several other branches of mathematics such as infinitary combinatorics, logic, computer science, and topology. The Souslin operation is of special importance to descriptive set theory, and perhaps it will be new to some readers.
S. M. Srivastava
2. Topological Preliminaries
Abstract
As mentioned in the introduction, we shall present the theory of Borel sets in the general context of Polish spaces. In this chapter we give an account of Polish spaces. The space NN of sequences of natural numbers, equipped with the product of discrete topologies on N, is of particular importance to us. Our theory takes a particularly simple form on this space, and it is possible to generalize the results on Borel subsets of NN to general Polish spaces. The relevant results that we shall use to obtain these generalizations are presented in the last section of this chapter.
S. M. Srivastava
3. Standard Borel Spaces
Abstract
In this chapter we introduce Borel sets and Borel functions—the main topics of this monograph. However, many of the deep results on Borel sets and Borel functions require the theory of analytic and coanalytic sets, which is developed in the next chapter. So, this chapter, though quite important, should be seen mainly as an introduction to these topics.
S. M. Srivastava
4. Analytic and Coanalytic Sets
Abstract
In this chapter we present the theory of analytic and coanalytic sets. The theory of analytic and coanalytic sets is of fundamental importance to the theory of Borel sets and Borel functions. It gives the theory of Borel sets its power. Thus the results proved in this chapter are the central results of these notes.
S. M. Srivastava
5. Selection and Uniformization Theorems
Abstract
In this chapter we present some measurable selection theorems. Selection theorems are needed in several branches of mathematics such as probability theory, stochastic processes, ergodic theory, mathematical statistics ([17], [34], [89], [18], etc.), functional analysis, harmonic analysis, representation theory of groups and C*-algebras ([4], [6], [7], [35], [36], [37], [40], [50], [54], [72], [73], [124], etc.), game theory, gambling, dynamic programming, control theory, mathematical economics ([55], [78], etc.). Care has been taken to present the results in such a way that they are readily applicable in a variety of situtations. It is impossible to present a satisfactory account of applications in a book of this size. We shall be content with giving some applications that do not require much background beyond what has been developed in this book. From time to time we give some references, where interested readers will find more applications.
S. M. Srivastava
Backmatter
Metadata
Title
A Course on Borel Sets
Author
S. M. Srivastava
Copyright Year
1998
Publisher
Springer Berlin Heidelberg
Electronic ISBN
978-3-642-85473-6
Print ISBN
978-3-642-85475-0
DOI
https://doi.org/10.1007/978-3-642-85473-6