### Quick description

There are many situations in mathematics, especially in algebraic contexts, where a question about some infinite family of objects is equivalent to a question about a single 'universal' object of the same type. Often, it is easier to consider the question just for the universal object.

### Prerequisites

### Example 1

Let be a polynomial, and suppose we wish to determine if there are any integers for which .

Certainly, if then , for any positive integer . In other words, the equation has solutions in the ring . Consider the other direction: if we have solutions in , when do we have solutions in ? Ideally, we want to incorporate all the 'modulo ' cases into a single case. The way to do this is by forming an inverse limit, as explained below.

We have a family of rings , but this family has some structure to it: given positive integers and , there is a natural map from to given by 'reduction modulo '. Now consider sequences , where is an element of . Define addition and multiplication of sequences pointwise, and note that this forms a commutative ring, with identity given by the 'all 1' sequence. We say such a sequence is compatible if, for any positive integers and , we have modulo . Observe that the compatible sequences form a subring. This is the inverse limit of the rings , and is written .

It is clear that listing all the reductions modulo of a given integer will define a compatible sequence, so contains as a subring. Hence if want to rule out solutions in , it suffices to rule out solutions in .

We could instead have only looked at solutions in the rings , where is some prime. This time, the inverse limit is , known as the -adic integers, which is the ring of integers of the field of -adic numbers. Despite the appearance of the prime here, this field actually has characteristic zero, and contains a copy of the rational numbers. It turns out that is isomorphic as a ring to the (unrestricted) Cartesian product of the rings , as ranges over all primes. So finding solutions in is equivalent to finding them separately in for each prime .

### Example 2

(This is an example of a popular trick in group theory, 'try it for the free group'. This could perhaps be spun off to its own article.)

Let be a group generated by elements, and let be a subgroup of index . How many elements could it take to generate ?

At first sight, this seems an unreasonable question, as for the family of -generated groups is rather diverse, and apparently has little structure in common. For instance, every finite simple group is generated by elements. Moreover, could be infinite; in this case, how do we even know that is finitely generated? We don't want to be considering such a wide range of different examples.

However, we have a group that is in some sense universal for -generator groups: this is the free group on generators. Let's call our set of generators ; we also need the symbols . Then the free group on consists of all equivalence classes of strings of symbols in , with the rule that we can 'cancel out' and if we see them next to each other. Multiplication is given by concatenating the strings.

Now is universal in the following sense: given any function from the set to a group , this function extends to a homomorphism from to . In particular, if the function takes to a generating set for , we obtain a surjective homomorphism from to . With a little more thought, it is clear how to reduce our original question to the special case of the free group: if is a subgroup of of index , then its preimage must have index in . Now if is a generating set for , then generates , and evidently . So we can rephrase our question as follows:

Let be a *free* group generated by elements, and let be a subgroup of index . How many elements could it take to generate ?

The answer turns out to be surprisingly simple (although the proof is not obvious, and involves tricks beyond the scope of this article). The number of generators needed for in this case is determined entirely by and , and is always precisely . This is known as the Schreier index formula. As an immediate consequence, we get the following answer to our original question:

Let be a group generated by elements, and let be a subgroup of index . Then the number of elements needed to generate is at most . The free groups show that this bound cannot be improved.

1 year 27 weeksago1 year 36 weeksago1 year 37 weeksago2 years 14 weeksago2 years 35 weeksago