A mathematical document discussing generator functions, involutions, and proofs by recurrence, covering various properties and equalities.
Extract
[...] On note for all The family of form a partition of the set of involutions of . There is a bijection between the set and the set of involutions of for there is a bijection between the sets and the set of involutions of for all . On a . (car in bijection) and the same for all . So we get: . Question 3 Thus we easily show by induction that then car for all . So we have . Question 4 . On pose for . We can then write that . [...]
[...] Initialisation : : OK Hereditary: : OK So we have and so on converge therefore to 0. Therefore, and for all is well defined. Question 5 Donc . Question 6 On pose . So . donc . On deduce that . Question 7 The following results will be shown by recurrence: [...]
