Solution:
Suppose we have an odd number of arbitrary points A1,A2,…,A2k+1 then we claim that if we take the vector AiAj for i<j and j−i odd and the vector AjAi for i<j and j−i even, then we get the sum of the vectors zero. We prove the claim by induction. It is true for k=3 because we have A1A2+A2A3+A3A1=0. So suppose it is true for 2k−1. The additional vectors when we move to 2k+1 are A2kA2k+1, ∑A2i+1A2k, ∑A2iA2k+1, ∑A2kA2i and ∑A2k+1A2i+1. But A2i+1A2k+A2kA2i+A2iA2k+1+A2k+1A2i+1=A2i+1A2i+A2iA2i+1=0, leaving the three terms A2k+1A1, A1A2k and A2kA2k+1 which also sum to zero. Hence the result is true for 2k+1 and hence for all odd numbers. Thus for mn odd we can number the centers of the black squares in an arbitrary fashion, use the rule given for the arrow directions and then the vectors for the black squares will sum to zero. Similarly for the white squares.
However, the same general result is not true for an even number of points. So we need something else for mn even. Let B be the center of the black square at one end of the main diagonal and W be the center of the white square at the other end. Let B1,B2,…,B2k+1 be the centers of the other black squares and W1,W2,…,W2k+1 the centers of the other white squares. Take vectors BBi, WWi and for BiBj and WiWj take the same rule as before (if i<j take BiBj if j−i is odd and BjBi if j−i is even, similarly for WiWj). Now consider square centers X, Y which are symmetric with respect to the center of the rectangle (in other words the center of the rectangle is the midpoint of XY). The pairs (X,Y) are of three types: opposite colors, both white and both black. The number of both white pairs must equal the number of both black pairs since the number of white and black squares is equal. For the first type we have BX+WY=0. For the second type we have WX+WY=WB and for the third type we have BX+BY=BW. Since they are equal in number the second and third type sum to zero.