This happens because the probability that an element is erased is independent of the identity of other elements in the sequence, and thus E has no interaction information with any subset of those elements.
this allows us to write: where the variable m ranges over bit-masks of length i − 1, and m I is equal to 1 when all indices I in m are equal to 1, and 0 otherwise.