Bourbaki marks this one as harder than the rest.
Suppose that K=Z and that X is finite. For every integer k≥0, let (ek,α) denote the basis of Ak(X).
(a) Let (wn)n∈N be a sequence of elements of F. Let wk,α(n) be the coefficient of ek,α in the term of g(wn)∈A^(X) of degree k. Then:
g(wn)=k,α∑wk,α(n)ek,αfor all n∈Z.
The sequence (wn) is called typical if, for every ordered pair (k,α) the function wk,α:n↦wk,α(n) is a binomial polynomial of degree ≤k, cf. Exercise 4. This condition is independent of the choice of the bases (er,α). Show that it is equivalent to the existence of a sequence (ak)k∈N of elements of A^q(X) such that ω(ak)≥k for all k and
g(wn)=k=0∑∞nkakfor all n∈Z.
(b) Show that, if (wn) and (wn′) are two typical sequences, so are (wn−1) and (wnwn′).
(c) Let w be an element of CkF for k≥1 and let f be a binomial polynomial of degree ≤k. Show that (wf(n)) is a typical sequence. In particular if z∈F, the sequence (zn) of powers of z is typical.
(d) Let (wn) be a sequence of elements of F. Show that (wn) is typical if and only if there exist y0,y1,…,yn,… in F, where yi∈CiF for all i≥1 and
wn≡y0y1n⋯yk(n)(modCk+1F)
for all n∈Z and all k≥1. (Determine the yi from (wn) by setting successively n=0,1,…. For example w0=y0,w1=y0y1,….)
(e) Let H be a Hall set relative to X and let (wn) be a sequence of elements of F. Let (α(m,n))m∈H,n∈Z be the family of integers such that
wn≡m∈H∏ϕ(m)α(m,n)(modCcF)
for all n∈Z and all c≥1 (cf. no. 4, Remark). Show that (wn) is typical if and only if, for all m∈H, the function n↦α(m,n) is a binomial polynomial of degree ≤l(m), where l(m) is the length of m.†
(f) A sequence (wn) is called 1-typical if the corresponding functions wk,α are binomial polynomials of degree ≤k−1. Show that, if (wn) is 1-typical, there exist yi∈Ci+1F for i=0,1,…, such that
wn≡y0y1n⋯yk(n)(modCk+1F)
for all n∈Z and all k≥1.