Let n be an integer ≥0. The group Sn is generated by the transpositions (τi,i+1)1≤i≤n−1.
By virtue of Proposition 8, it suffices to show that every transposition τp,q, 1≤p<q≤n, belongs to the subgroup H generated by the τi,i+1, 1≤i≤n−1. We show this by induction on q−p. For q−p=1, it is obvious. If q−p>1, then (formula (4)) τp,q=τq−1,qτp,q−1τq−1,q. By the induction hypothesis τp,q−1∈H and therefore τp,q∈H.
If σ∈Sn, every ordered pair (i,j) of elements of {1,n} such that i<j and σ(i)>σ(j) is called an inversion of σ. Let ν(σ) denote the number of inversions of σ.
Let P be the additive group of mappings from Zn to Z. For f∈P and σ∈Sn, let σf be the element of P defined by
(5)
σf(z1,…,zn)=f(zσ(1),…,zσ(n)).
The action of Sn on P thus defined is an operation; for all σ,τ∈Sn and f∈P, σf=f and
(τ(σf))(z1,…,zn)=σf(zτ(1),…,zτ(n))=f(zτσ(1),…,zτσ(n))=((τσ)f)(z1,…,zn). Formula (5) shows that
σ(−f)=−σf for
σ∈Sn and
f∈P.
Let p be the element of P defined by
p(z1,…,zn)=i<j∏(zj−zi).
Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.