Intersections of Open Sets and Unions of Closed Sets

From Optimal Transport Wiki
Revision as of 00:30, 15 November 2020 by Joel e pion (talk | contribs) (Initial write)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

The sets and are a subset of the Borel set. The set is the collection of all sets which are a countable intersections of open sets and the set is the collection of all sets which are a countable union of closed sets.[1]

Definitions

Let 'X' be a topological space whose collection of open sets is denoted '<math>\tau<\math>' and whose collection of closed sets is denoted 'C', then,

<math>\mathcal{G}^\delta = \{\bigcap_{n=1}^\infty\mathscr{O}_n: \mathscr{O}_n\in\tau \forall n\in\mathbb{N}\}<\math>

<math>\mathcal{F}^\sigma = \{\bigcup_{n=1}^\infty C_n: C_n\in C \forall n\in\mathbb{N}\}<\math>

The definitions can be extended as follows. Let 'w' be a non-trivial word in the alphabet <math>\{\delta,\sigma\}<\math> of length 'm'. Let 'u' be the first 'm-1' letters in the word and let <math>w_m<\math> be the last letter. Then we define,

<math>\mathcal{F}^w = \mathcal{G}^w = \{\bigcap_{n=1}^\infty P_n: P_n\in\G^u \forall n\in\mathbb{N}\}<\math>

if <math>w_m = \delta<\math> and we define

<math>\mathcal{F}^w = \mathcal{G}^w = \{\bigcup_{n=1}^\infty P_n: P_n\in\G^u \forall n\in\mathbb{N}\}<\math>

if <math>w_m = \sigma<\math>

  1. Gerald B. Folland, Real Analysis: Modern Techniques and Their Applications, Second Edition, §1.2