Let i1i2 . . . in be a permutation of {1, 2, . . . , n} with inversion sequence b1, b2, . . . , bn and let k = b1 + +bn. Show by induction that we cannot bring i1i2 . . . in to 12 . . . n by fewer than k successive switches of adjacent terms.