Prove.

Definition D1

Fix a starting point a and a width h, and call Iⱼ = [ a + (j−1)h, a + jh ) the j-th bin. Here 0 < h, and j runs far enough to cover all the data.

Proof.