I seek to prove that the number of inversions in a permutation is the length of the word (letters of the form $(i,i+1)$). I land on $P(n)$ implies $P(n \pm 1)$. I can't quite convince myself that I'm done or that this isn't strong enough to conclude $P(n)$ for all $n$.
Thank you in advance for your time.