Sets Small
In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets. Each Borel set is assigned a unique countable ordinal number called the rank of the Borel set. more...
 Home
Boys
Girls
Infants & Toddlers
Men's Accessories
Men's Clothing
Uniforms
 Adult
 Lab Coats
Scouting
Scrubs
 Bottoms
Bottoms Large
Bottoms Medium
Bottoms Other
Bottoms Plus
Bottoms Small
Bottoms X Large
Bottoms X Small
Lots
Other
Sets Large
Sets Medium
Sets Other
Sets Plus
Sets Small
Sets X Large
Sets X Small
Sets, 2 pieces
Tops
Tops Large
Tops Medium
Tops Other
Tops Plus
Tops Small
Tops X Large
Tops X Small
Boys
Girls
Vintage
Wedding Apparel
Women's Accessories,...
Women's Clothing
The Borel hierarchy is of particular interest in descriptive set theory.
One common use of the Borel hierarchy is to prove facts about the Borel sets using transfinite induction on rank. Properties of sets of small finite ranks are important in measure theory and analysis.
Borel sets
The Borel algebra in an arbitrary topological space is the smallest collection of subsets of the space that contains the open sets and is closed under countable unions and complementation. It can be shown that the Borel algebra is closed under countable intersections as well.
A short proof that the Borel algebra is well defined proceeds by showing that the entire powerset of the space is closed under complements and countable unions, and thus the Borel algebra is the intersection of all families of subsets of the space that have these closure properties. This proof does not give a simple procedure for determining whether a set is Borel. A motivation for the Borel hierarchy is to provide a more explicit characterization of the Borel sets.
Boldface hierarchy
The Borel hierarchy or boldface Borel hierarchy on a space X consists of classes  α greater than zero. Each of these classes consists of subsets of X. The classes are defined inductively from the following rules:
A set is  α > 1 if and only if there is a sequence of sets  Ai is  αi < α and 
It can be shown that  The motivation for the hierarchy is to follow the way in which a Borel set could be constructed from open sets using complementation and countable unions. The rank of a Borel set is the least α such that the set is in  If X is an uncountable Polish space, it can be shown that  α < ω1, and thus the hierarchy does not collapse. Equivalently, for each α < ω1 there is a Borel set of rank α.
Read more at Wikipedia.org
|
