Take to be the vector of and absorb into . Its diagonal entry is , each axial-neighbour entry is and each diagonal-neighbour entry is . Since these weights agree in both directions, is a symmetric matrix.
Extend a grid vector by zero to the whole integer lattice. Let contain unordered axial-neighbour pairs and unordered diagonal-neighbour pairs. Only finitely many differences involving nonzero values contribute. Each lattice vertex has total neighbour weight , so expanding the squared differences gives
It is nonpositive. If it vanishes, every axial difference vanishes. The axial lattice is connected and is zero outside the finite interior square, forcing . Thus for every nonzero : .
Reordering the grid replaces by for a permutation matrix . This preserves symmetry and the sign of the quadratic form, proving the assertion for any ordering. Multiplying the whole system by merely rescales by a positive number and has the same conclusions.

Articles by others on the same topic (0)

There are currently no matching articles.