The Setting
A scalar coordinate of a finite configuration assigns a real number to each vertex. Its increments along oriented pairs can be normalized by the distances between the corresponding points.
Let be nonnegative integers. For a real exponent , the coordinate distance on is the function in (1). (1)✦
Definition 1. The standard pair index is the set of pairs of vertices oriented by increasing index: (2)✦
Incidence and Normalization
Let be a finite vertex set and a finite edge set, with endpoint maps . The incidence matrix is the matrix (3)✦
Definition 2. For a real edge scale , with the convention , the normalized gradient is the linear map whose matrix, in terms of the incidence matrix in (3), is (4)✦
The Claim
Theorem 1. Let be finite sets, let and , and let . The normalized gradient in (4) satisfies, for every , (5)✦
Let and . On the pair index in (2), take and , and suppose that , with as in (1). For each coordinate , let be the scalar coordinate function . Then, for every , (6)✦
What Is Checked
The library states (5) over finite oriented edge sets with arbitrary real edge scales under the zero inverse convention, and (6) over finite real coordinate configurations with and positive pairwise coordinate distances.