In mathematics, a Borel set is any set in a topological space that can be formed from open sets (or, equivalently, from closed sets) through the operations of countable union, countable intersection, and relative complement. Borel sets are named after Émile Borel. For a topological space X, the collection of all Borel sets on X forms a σ-algebra, known as the Borel algebra or Borel σ-algebra. The Borel algebra on X is the smallest σ-algebra containing all open sets (or, equivalently, all closed sets). Borel sets are important in measure theory, since any measure defined on the open sets of a space, or on the closed sets of a space, must also be defined on all Borel sets of that space. Any measure defined on the Borel sets is called a Borel measure. Borel sets and the associated Borel hierarchy also play a fundamental role in descriptive set theory. In some contexts, Borel sets are defined to be generated by the compact sets of the topological space, rather than the open sets. The two definitions are equivalent for many well-behaved spaces, including all Hausdorff σ-compact spaces, but can be different in more pathological spaces. In the case that X is a metric space, the Borel algebra in the first sense may be described generatively as follows. For a collection T of subsets of X (that is, for any subset of the power set P(X) of X), let be all countable unions of elements of T be all countable intersections of elements of T Now define by transfinite induction a sequence Gm, where m is an ordinal number, in the following manner: For the base case of the definition, let be the collection of open subsets of X. If i is not a limit ordinal, then i has an immediately preceding ordinal i − 1. Let If i is a limit ordinal, set The claim is that the Borel algebra is Gω1, where ω1 is the first uncountable ordinal number. That is, the Borel algebra can be generated from the class of open sets by iterating the operation to the first uncountable ordinal. To prove this claim, any open set in a metric space is the union of an increasing sequence of closed sets.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Ontological neighbourhood
Related courses (11)
MATH-432: Probability theory
The course is based on Durrett's text book Probability: Theory and Examples.
It takes the measure theory approach to probability theory, wherein expectations are simply abstract integrals.
MATH-205: Analysis IV
Learn the basis of Lebesgue integration and Fourier analysis
CS-101: Advanced information, computation, communication I
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a
Show more
Related lectures (53)
Lebesgue Integration: Cantor Set
Explores the construction of the Lebesgue function on the Cantor set and its unique properties.
Unitary Group and Spectral Types
Covers the proof of unitary group uniqueness and spectral types.
Functional Calculus: Simple Functions
Covers the extension of functional calculus to simple functions and the concept of *-homomorphism.
Show more
Related publications (32)

INCLASS: Incremental Classification Strategy for Self-Aware Epileptic Seizure Detection

David Atienza Alonso, Giovanni Ansaloni, Tomas Teijeiro Campo, Renaud Marquis

Wearable Health Companions allow the unobtrusive monitoring of patients affected by chronic conditions. In particular, by acquiring and interpreting bio-signals, they enable the detection of acute episodes in cardiac and neurological ailments. Nevertheless ...
2022

On the equation A del u plus (del u)(t) A = G

Bernard Dacorogna

Let Omega subset of R-n be an open set, A is an element of R-nxn and G : Omega -> R-nxn be given. We look for a solution u : Omega -> R-n of the equation A del u + (del u)(t) A = G We also study the associated Dirichlet problem. (C) 2020 Elsevier Ltd. All ...
PERGAMON-ELSEVIER SCIENCE LTD2020

A pathwise approach to the extinction of branching processes with countably many types

Sophie Myriam Hautphenne

We consider the extinction events of Galton-Watson processes with countably infinitely many types. In particular, we construct truncated and augmented Galton-Watson processes with finite but increasing sets of types. A pathwise approach is then used to sho ...
ELSEVIER SCIENCE BV2019
Show more
Related concepts (22)
Σ-algebra
In mathematical analysis and in probability theory, a σ-algebra (also σ-field) on a set X is a nonempty collection Σ of subsets of X closed under complement, countable unions, and countable intersections. The ordered pair is called a measurable space. The σ-algebras are a subset of the set algebras; elements of the latter only need to be closed under the union or intersection of finitely many subsets, which is a weaker condition.
Probability space
In probability theory, a probability space or a probability triple is a mathematical construct that provides a formal model of a random process or "experiment". For example, one can define a probability space which models the throwing of a die. A probability space consists of three elements: A sample space, , which is the set of all possible outcomes. An event space, which is a set of events, , an event being a set of outcomes in the sample space. A probability function, , which assigns each event in the event space a probability, which is a number between 0 and 1.
Measurable function
In mathematics and in particular measure theory, a measurable function is a function between the underlying sets of two measurable spaces that preserves the structure of the spaces: the of any measurable set is measurable. This is in direct analogy to the definition that a continuous function between topological spaces preserves the topological structure: the preimage of any open set is open. In real analysis, measurable functions are used in the definition of the Lebesgue integral.
Show more

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.