Hamming distance triangle inequality

170 Views Asked by At

How to prove triangle inequality of metric space for Hamming distance between the bit strings of length n? $$d(x,y) \le d(x,z)+d(z,y)$$