Tricki

## Using generators and closure properties

### Quick description

Suppose that is some mathematical structure that is generated by some small subset . (The meaning of "is generated by" depends on what sort of structure is.) A useful method of proving statements of the form "Every element of has property " is to show that every element of has property and to show that anything you generate using elements that have property also has property .

In this article we concentrate on closure properties that have an algebraic flavour. Another sort of closure is topological closure: this is dealt with in the article Prove the result on a dense subset and then prove that the set where the result holds is closed.

### Prerequisites

These vary from example to example. Material from a typical mathematics degree course is discussed, but more advanced topics are briefly explained, and links to relevant Wikipedia articles are given.

### General discussion

An equivalent way of thinking about what it means for a set to generate another set is to say that is a certain sort of closure of . More precisely, suppose that you have a way of generating elements of from other elements (or pairs of elements, or sequences of elements, etc.). A set is closed if anything you can generate using elements of belongs to . Given any set , the closure of is the smallest closed set that contains . It is what you get if you start with , generate everything you can from , generate everything you can from with the new elements you've added, and so on (where in some situations the words "and so on" could refer to a transfinite process). In this language, if you want to prove a statement about every element of , it is enough to prove it for every element of a subset , to show that the set of elements that satisfy is closed under some process of generating new elements, and to show that the closure of is .

This technique can be (and often is) thought of as a generalization of induction. To obtain the usual principle of induction take to be the set of all positive integers, to be the set , and the operation used to create new elements to be that of replacing a number by its successor. To prove a statement about all positive integers, it is enough to prove it for and to prove that if it is true for then it is true for the successor of . The principle of induction is the statement that is the closure of under the successor operation.

### Example 1: Möbius maps take circles or straight lines to circles or straight lines

A Möbius map, or Möbius transformation, is a function from to given by a formula of the form , where , , and are complex numbers with . An important fact about Möbius maps is that they take circles to circles, at least if one counts a straight line as a degenerate circle (with its centre at ). How does one prove this fact?

Perhaps one could express what a Möbius transformation does in terms of the real and imaginary parts of , write an equation for a circle, apply the transformation, and try to find an equation for the resulting set. But this feels as though it is going to be very complicated, and if it works it will still have the drawback of giving us no idea why the result is true.

Fortunately, there is a much better approach. The Möbius transformations form a group under composition, and it is obvious that if and are two maps that both take circles/lines to circles/lines, then so does (since if you do and then , you take a circle/line to a circle/line and then to another circle/line). So all we have to do is prove the result for some set of maps that generates the Möbius group.

It is an easy exercise to prove that every Möbius map can be built out of translations, rotations, dilations and the map (which is called inversion). Note that these are all Möbius maps: a translation is given by the formula , and . Rotations are of the form for some complex number with , and dilations are of the form with a positive real number. A hint for showing that these maps generate the Möbius group: note that if then (if then it is even easier).

It is completely obvious that translations, rotations and dilations take circles/lines to circles/lines. The one thing that takes a bit of verification is that inversion works. Even here one can reduce the calculation by conjugating: since we know that rotations preserve circles/lines, it is enough to consider circles centred on the non-negative real axis, and lines that cross the non-negative real axis at right angles. This leaves us with a far simpler calculation than we would have had to face if we had just plunged straight in and tried to investigate the effect of an arbitrary Möbius map on an arbitrary circle/line.

Just to see how this example fits into our general framework, note that we are taking to be the set of all Möbius maps, to be the set of all translations, rotations and dilations, and inversion, and we observe that the set of maps with the property we want (namely, taking circles/lines to circles/lines) is closed under composition, and we showed that the closure of is all of .

### Example 2: all Borel subsets of are Lebesgue measurable

This is an example where one is more or less forced to use the method, since the Borel sets are defined via generators and closure properties. The generators are all open intervals, and the operations one can perform are countable unions and countable intersections. That is, the collection of Borel sets is the smallest collection of sets that contains all open intervals and is closed under countable unions and countable intersections.

Let us briefly recall the definition of Lebesgue measure for subsets of . (We are confining ourselves to just because it is convenient to avoid the minor technicalities needed to discuss sets of infinite measure.) If is an open subset of , then it can be expressed as a countable union of disjoint open intervals. Proof: Define elements and of to be equivalent if every between and also lies in ; check that the equivalence classes are disjoint open intervals; since every open interval contains a rational, there are countably many of them. The measure of is then defined to be the sum of the lengths of these open intervals. And now, if is an arbitrary subset of , we define its outer measure to be the infimum over all open sets that contain of the measure of . A set is Lebesgue measurable if the outer measures of and add up to 1.

To prove that every Borel set is measurable, one must now prove that if are all measurable, then so is . (Since the complement of a measurable set is obviously measurable, this is enough to do countable intersections as well, so it proves the whole result.) Very roughly, the technique for doing this is to find, for each , an open set containing with measure at most more than the measure of , and a closed set contained in with measure at most less than the measure of , and to argue that the union of the sets has measure at most more than the union of the sets . This does not quite do the job because the union of the is not necessarily closed. However, once one has proved that a countable union of closed sets (or alternatively a countable intersection of open sets) is Lebesgue measurable, then one can approximate it by a closed set (or open set).

We omit the details of this, since the main purpose of this example is to illustrate the range of statements that can be proved using generators and closure properties, rather than to give full details of the proofs. (However, if anybody felt like adding a concise proof, that would of course be fine.)