Infinity-Borel set

Infinity-Borel set

In set theory, a subset of a Polish space X is ∞-Borel if itcan be obtained by starting with the open subsets of X, and transfinitely iterating the operations of complementation and wellordered union (but see the caveat below).

Formal definition

More formally: we define by simultaneous transfinite recursion the notion of ∞-Borel code, and of the interpretation of such codes. Since X is Polish, it has a countable base. Let enumerate that base (that is, mathcal{N}_i is the i^mathrm{th} basic open set). Now:

* Every natural number i is an ∞-Borel code. Its interpretation is mathcal{N}_i.
* If c is an &infin;-Borel code with interpretation A_c, then the ordered pair <0,c> is also an &infin;-Borel code, and its interpretation is the complement of A_c, that is, Xsetminus A_c.
* If vec c is a length-α sequence of &infin;-Borel codes for some ordinal α (that is, if for every &beta;<α, c_eta is an &infin;-Borel code, say with interpretation A_{c_{eta), then the ordered pair <1,vec c> is an &infin;-Borel code, and its interpretation is igcup_{eta.

Now a set is &infin;-Borel if it is the interpretation of some &infin;-Borel code.

The axiom of choice implies that "every" set can be wellordered, and therefore that every subset of every Polish space is infty-Borel. Therefore the notion is interesting only in contexts where AC does not hold (or is not known to hold).

The assumption that every set of reals is infty-Borel is part of AD+, an extension of the axiom of determinacy studied by Woodin.

Incorrect definition

It is very tempting to read the informal description at the top of this article as claiming that the &infin;-Borel sets are the smallest class of subsets of X containing all the open sets and closed under complementation and wellordered union. That is, one might wish to dispense with the &infin;-Borel codes altogether and try a definition like this:

: For each ordinal α define by transfinite recursion Bα as follows:

:# B0 is the collection of all open subsets of X.:# For a given even ordinal α, Bα+1 is the union of Bα with the set of all complements of sets in Bα.:# For a given even ordinal α, Bα+2 is the set of all wellordered unions of sets in Bα+1.:# For a given limit ordinal &lambda;, B&lambda; is the union of all Bα for α<&lambda;

: It follows from the Burali-Forti paradox that there must be some ordinal α such that B&beta; equals Bα for every &beta;>α. For this value of α, Bα is the collection of &infin;-Borel sets.

Unfortunately, without the axiom of choice, it is not clear that the &infin;-Borel sets "are" closed under wellordered union. This is because, given a wellordered union of &infin;-Borel sets, each of the individual sets may have "many" &infin;-Borel codes, and there may be no way to choose one code for each of the sets, with which to form the code for the union.

Alternative characterization

For subsets of Baire space or Cantor space, there is a more concise (if less transparent) alternative definition, which turns out to be equivalent. A subset "A" of Baire space is &infin;-Borel just in case there is a set of ordinals "S" and a first-order formula "&phi;" of the language of set theory such that, for every "x" in Baire space,

: xin Aiff L [S,x] modelsphi(S,x)

where "L" ["S","x"] is Gödel's constructible universe relativized to "S" and "x". When using this definition, the &infin;-Borel code is made up of the set "S" and the formula "&phi;", taken together.


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • List of set theory topics — Logic portal Set theory portal …   Wikipedia

  • Set theory — This article is about the branch of mathematics. For musical set theory, see Set theory (music). A Venn diagram illustrating the intersection of two sets. Set theory is the branch of mathematics that studies sets, which are collections of objects …   Wikipedia

  • Borel-Cantelli lemma — In probability theory, the Borel Cantelli lemma is a theorem about sequences of events. In a slightly more general form, it is also a result in measure theory. It is named after Émile Borel and Francesco Paolo Cantelli.Let ( E n ) be a sequence… …   Wikipedia

  • Cylinder set measure — In mathematics, cylinder set measure (or promeasure, or premeasure, or quasi measure, or CSM) is a kind of prototype for a measure on an infinite dimensional vector space. An example is the Gaussian cylinder set measure on Hilbert space. Cylinder …   Wikipedia

  • List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… …   Wikipedia

  • List of mathematical logic topics — Clicking on related changes shows a list of most recent edits of articles to which this page links. This page links to itself in order that recent changes to this page will also be included in related changes. This is a list of mathematical logic …   Wikipedia

  • List of properties of sets of reals — This page lists some properties of sets of real numbers. The general study of these concepts forms descriptive set theory, which has a rather different emphasis from general topology.Definability properties* Borel set * Analytic set * C… …   Wikipedia

  • Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… …   Wikipedia

  • Riesz representation theorem — There are several well known theorems in functional analysis known as the Riesz representation theorem. They are named in honour of Frigyes Riesz. The Hilbert space representation theorem This theorem establishes an important connection between a …   Wikipedia

  • Lp space — In mathematics, the Lp spaces are function spaces defined using a natural generalization of the p norm for finite dimensional vector spaces. They are sometimes called Lebesgue spaces, named after Henri Lebesgue (Dunford Schwartz 1958, III.3),… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”