The Setting
Let be a finite simple graph. The variational problem assigns real weights to vertices and couples a logarithmic vertex contribution with a penalty for weight on adjacent vertices.
A real vertex weight on is a function . The neighborhood of a vertex is the set of vertices adjacent to .✦ The vertex mass of a set and the neighborhood mass are the sums in (1): (1)
For vertex sets , the cross mass is the ordered edge sum in (2); the sets and may overlap: (2)✦ The unordered edge mass is the sum of endpoint products over unordered edges, as in (3): (3)✦
The vertex potential and the graph potential are the functions in (4). All logarithms are natural, with the convention : (4) An optimizer for is a real vertex weight that is nonnegative at every vertex and satisfies (5): (5)
The Claim
Theorem 1. Let be a finite simple graph. Then (6)✦ Let be an optimizer for . For every vertex , (7)✦ For every nonnegative real vertex weight , (8)✦
In the paper, the result reads: for every nonempty finite simple graph , attains its maximum, every maximizer has , and for every , and every nonnegative real weight satisfies , where the summand is when .
What Is Checked
The assertions (6), (7) and (8) are stated over finite simple graphs and real vertex weights, with competitor weights restricted to be nonnegative.