Homepage › Solution manuals › Kenneth Ireland › A Classical Introduction to Modern Number Theory › Exercise 11.19
Exercise 11.19
Prove the identity , where the sum is over all monic polynomials in and the product is over all monic irreducible in . is defined in Section 4.
Answers
(The solution of this exercise requires external knowledge on formal power series. To learn more about formal power series, see [Niven, Formal power series], [Bourbaki, Algebra IV, ¤4], and [Wikipedia, Formal power series]. About summable families, see [Bourbaki, General Topology, III ¤5]. )
Proof.
For each monic polynomial , is defined by
To complete this definition, we define . By Lemma 1, for all monic polynomials .
We must prove the following equality in the ring of formal power series :
where is the set of monic polynomials of , and is the set of monic polynomials of which are irreducible over .
Since and are infinite sets, we must give a sense at this formula. This implies to introduce a topology on the algebra , which is given by the distance defined by
where is the valuation on : if , then , and . This distance is associated to the norm , given by , so that is a normed vector space.
As in Bourbaki, a family of vectors of a normed vector space is summable, if there is some such that
where is the set of finite subsets of . Then we write . There is a similar definition for multipliable families.
In the algebra , this is equivalent to under the filter of the complementaries of finite sets: (Bourbaki, IV, 4, Lemma 1), which means, for ,
Moreover, if the family is summable, then is multipliable (Bourbaki, Algebra IV, 4, Proposition 2).
A summable family , where is a countable set, can be summed in any order (Bourbaki, General Topology, III,7 Proposition 9). If is a bijection, then
After these preliminaries, we can show that the family is summable.
If , let be an integer such that , and consider the set of monic polynomials such that . Then is a finite set, and for all , , so that .
This proves that the family is summable, and makes sense.
Then the sub-family is also summable. This proves that is multiplicable, and makes sense.
To prove (3), we use first geometric power series. For all ,
The set is a countable set (countable union of finite sets). We use an arbitrary numbering of , , obtained by a bijection . Write the finite set , et the set of monic polynomials whose irreducible factors are in , so that every uniquely decomposes under the form
Write . Then (see Bourbaki, Algebra IV, 4, Proposition 2)
Then, using (4),
the limit being in the metric space with the distance .
Since is the increasing union of the ,
We justify this statement.
If , let be an integer such that . The set of monic irreducible polynomials such that is finite, thus there is some integer such that, for all integers , implies .
For every , if , there is some irreducible monic factor of such that , therefore . Then
so
This shows the statement.
Since
where
the unicity of the limit shows that
□