Tricki
• LaTeX processing error: math_failure (math_unknown_function\B):\B_\alpha
• LaTeX processing error: math_failure (math_unknown_function\B):\B_0
• LaTeX processing error: math_failure (math_unknown_function\B):\B_\alpha = \bigcup_{\beta<\alpha}\B_\beta
• LaTeX processing error: math_failure (math_unknown_function\B):\B_{\omega_1}
• LaTeX processing error: math_failure (math_unknown_function\B):E\in\B_0
• LaTeX processing error: math_failure (math_unknown_function\B):\B_\beta
• LaTeX processing error: math_failure (math_unknown_function\B):E\in\B_\alpha

## Revision of Use transfinite induction to construct Borel sets from Tue, 05/05/2009 - 14:47

### Quick description

Transfinite induction can be used to construct the Borel sets for a given topology. Since each stage of the construction can be carefully controlled, it is possible to prove results that hold for all Borel sets based on results for simple sets (such as open sets or even intervals).

### Prerequisites

Measure theory, transfinite induction.

### Example 1

The problem in this case is given a vector measure with values in and a non-negative measure (positive for open sets) to show that if

for any open set where is a closed convex set, that then

where

which is known as the asymptotic or recession cone of .

We can construct the Borel sets: for each ordinal we have \B_\alpha constructed as follows:

• \B_0 is the set of open sets,

• is the set of countable unions or countable intersections or sets in \B_\alpha

• \B_\alpha = \bigcup_{\beta<\alpha}\B_\beta is is a limit ordinal.

Then \B_{\omega_1} is the set of Borel sets where is the first uncountable ordinal.

We start the induction with the fact that (Target) holds for for all E\in\B_0

If (Target) holds for all \B_\beta for with a limit ordinal, then clearly by definition of \B_\alpha (Target) also holds for all E\in\B_\alpha

The hard part is then dealing with successor ordinals.

The complexity can be reduced by realizing that finite unions and intersections of sets in \B_\alpha are also in \B_\alpha this in turn means that we only need to deal with nested countable unions and intersections at each stage of the construction.

Considering nested unions, suppose with . Then either for all , or there is an where . In the former case, for all , and so taking limits, as is a closed convex cone. In the latter case, we have for all , and so taking limits the result again holds.

Considering nested intersections, suppose with . Then either or . In the former case, for all , and taking limits of gives the desired result. If then either for some or for all . In then for all and taking limits of again gives the desired result. Finally, considering for all we see that

Taking limits and using the definition of gives the desired: .

### Example 1 could use some

Example 1 could use some motivation: where does this sort of statement come up and why would one want to prove it?

### It doesn't look to me as

It doesn't look to me as though transfinite induction is needed here. All you need is that the Borel sets are the closure of the open sets under countable unions and intersections. So I think the article should have a title such as the following — "To prove a fact about all Borel sets, prove it for open sets and prove that it is preserved by countable unions and intersections" — and should be rewritten accordingly.

### The title could definitely be

The title could definitely be changed. But transfinite induction is needed: to get from the base class of open sets to all Borel sets requires it, or something similar.

### Not if you define the class

Not if you define the class of Borel sets to be the smallest class of sets that contains the open sets and is closed under countable unions and intersections. Then if you want to prove that some fact P is true of all Borel sets it is sufficient to prove that it holds for all open sets, and that a countable union or intersection of sets satisfying P satisfies P.

An analogy: suppose I have some property of invertible matrices and I know that the product of two matrices with that property has the property, and the inverse of a matrix with that property has the property. Now I take a set of matrices with that property. Then I know that every matrix in the group generated by has that property as well. Why? Well, I could build up stage by stage and do an inductive argument. Alternatively, I could say that I know that the set of all matrices with that property forms a subgroup of the group of all invertible matrices, and that subgroup contains . Therefore, it contains the group generated by . The second proof, uses a different notion of "subgroup generated by" and you need induction only to prove that the two notions are equivalent.

In the case of Borel sets, it is neater to use the definition above because it saves you having to mention ordinals every time you want to prove something.

Remark added 16/5/09: I have rewritten the article to reflect the fact that transfinite induction is not needed.

### At the moment, example 1

At the moment, example 1 contains a reference to , although these are not defined until later in the article. Maybe someone with a better feeling for the material can correct this.

### Thanks &ndash; I didn't quite

Thanks – I didn't quite make enough modifications to the earlier version of the article, but have fixed it now.