  The rigidity of a matrix describes the minimal number of entries one has to
change to reduce matrix's rank to r. We give very simple combinatorial proof of
the lower bound for the rigidity of Sylvester (special case of Hadamard) matrix
that matches the best known result by de Wolf(2005) for Hadamard matrices
proved by quantum information theoretical arguments.
