Bourbaki

Exercise 30, § 6

Algebra, I, 155

Bourbaki marks this one as harder than the rest.

Let pp be a prime number, rr and tt integers ⩾0\geqslant 0, S a cyclic group of order pr+tp^{r+t} and T the subgroup of S of order ptp^t. (a) If S operates on a finite set E, show that

Card⁡(E)≡Card⁡(ET)(modpr+1), \operatorname{Card}(E) \equiv \operatorname{Card}(E^T) \pmod{p^{r+1}},
where ETE^T denotes the set of elements of E invariant under T. (b) Let m,n⩾0m, n \geqslant 0. Show that
(pr+tmptm)≡(prmn)(modpr+1). \binom{p^{r+t}m}{p^tm} \equiv \binom{p^rm}{n} \pmod{p^{r+1}}.
(Let M be a set with m elements and E the set of subsets of S×MS \times M with ptnp^t n elements. Define an operation of S on S×MS \times M such that there exists a bijection of ETE^T onto the set of subsets of (S/T)×M(S/T) \times M with n elements; apply (a).)

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.