Each result cited below is universally quantified over the data in its own statement. Throughout, L = d / 2 L=\sqrt{d}/2 L = d /2 , a nonnegative real number, and for x , y ∈ R d x,y\in\mathbb{R}^{d} x , y ∈ R d we write
κ ( x , y ) = 1 2 d T ( x , y ) 2 . \kappa(x,y)=\tfrac12\,d_{\mathbb{T}}(x,y)^{2}. κ ( x , y ) = 2 1 d T ( x , y ) 2 .
Finite sums ∑ i = 1 m \sum_{i=1}^{m} ∑ i = 1 m are those of Finite Sum Notation in a Field in the field of real numbers; from Properties of Finite Sums we use the recursion and the independence of the extending family (claim 1), additivity (claim 2) and homogeneity (claim 3, with the factors 1 2 \tfrac12 2 1 and − 1 -1 − 1 , so that a finite sum of differences is the difference of the finite sums). Points of R d \mathbb{R}^{d} R d are added, subtracted and scaled coordinatewise, as in Sum of Points of R n \mathbb{R}^n R n , Scalar Multiple of a Point of R n \mathbb{R}^n R n and Difference, Dot Product, and Orthogonality in R n \mathbb{R}^n R n , and R d \mathbb{R}^{d} R d is a real vector space by Euclidean Space R n \mathbb{R}^n R n is a Real Vector Space . Since 0 ∈ Z 0\in\mathbb{Z} 0 ∈ Z and Z \mathbb{Z} Z is closed under negation and addition (claim 2 of Arithmetic, Order, Discreteness and Intervals of the Integers ), the lattice Z d \mathbb{Z}^{d} Z d of Lattice-Periodic Functions and the Periodic Function Classes §lattice contains the origin 0 R d 0_{\mathbb{R}^{d}} 0 R d and is closed under negation and addition. The set R d \mathbb{R}^{d} R d is convex , since every point t x + ( 1 − t ) y t\,x+(1-t)\,y t x + ( 1 − t ) y with x , y ∈ R d x,y\in\mathbb{R}^{d} x , y ∈ R d lies in R d \mathbb{R}^{d} R d .
Step 0. Three elementary facts.
(a) Expansion. For all a , b ∈ R d a,b\in\mathbb{R}^{d} a , b ∈ R d ,
1 2 ∥ a ∥ 2 − 1 2 ∥ a − b ∥ 2 = a ⋅ b − 1 2 ∥ b ∥ 2 . \tfrac12\lVert a\rVert^{2}-\tfrac12\lVert a-b\rVert^{2}=a\cdot b-\tfrac12\lVert b\rVert^{2}. 2 1 ∥ a ∥ 2 − 2 1 ∥ a − b ∥ 2 = a ⋅ b − 2 1 ∥ b ∥ 2 .
Indeed, by claim 1 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n one has ∥ a − b ∥ 2 = ( a − b ) ⋅ ( a − b ) \lVert a-b\rVert^{2}=(a-b)\cdot(a-b) ∥ a − b ∥ 2 = ( a − b ) ⋅ ( a − b ) ; by claims 3 and 5 of Bilinearity and Symmetry of the Dot Product on R n \mathbb{R}^n R n this equals a ⋅ a − b ⋅ a − a ⋅ b + b ⋅ b a\cdot a-b\cdot a-a\cdot b+b\cdot b a ⋅ a − b ⋅ a − a ⋅ b + b ⋅ b , and by claim 1 there (symmetry) together with claim 1 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n it equals ∥ a ∥ 2 − 2 a ⋅ b + ∥ b ∥ 2 \lVert a\rVert^{2}-2\,a\cdot b+\lVert b\rVert^{2} ∥ a ∥ 2 − 2 a ⋅ b + ∥ b ∥ 2 . Multiplying by 1 2 \tfrac12 2 1 and subtracting from 1 2 ∥ a ∥ 2 \tfrac12\lVert a\rVert^{2} 2 1 ∥ a ∥ 2 gives the identity.
(b) Nearest lifts. Let x , y ∈ R d x,y\in\mathbb{R}^{d} x , y ∈ R d . For every y ~ ∈ y + Z d \tilde y\in y+\mathbb{Z}^{d} y ~ ∈ y + Z d ,
d T ( x , y ) ≤ ∥ x − y ~ ∥ = ∥ y ~ − x ∥ and hence κ ( x , y ) ≤ 1 2 ∥ x − y ~ ∥ 2 ; d_{\mathbb{T}}(x,y)\le\lVert x-\tilde y\rVert=\lVert\tilde y-x\rVert\qquad\text{and hence}\qquad\kappa(x,y)\le\tfrac12\lVert x-\tilde y\rVert^{2}; d T ( x , y ) ≤ ∥ x − y ~ ∥ = ∥ y ~ − x ∥ and hence κ ( x , y ) ≤ 2 1 ∥ x − y ~ ∥ 2 ;
and the point y ~ x = x + ϖ ( y − x ) \tilde y_{x}=x+\varpi(y-x) y ~ x = x + ϖ ( y − x ) belongs to y + Z d y+\mathbb{Z}^{d} y + Z d and satisfies ∥ x − y ~ x ∥ = d T ( x , y ) \lVert x-\tilde y_{x}\rVert=d_{\mathbb{T}}(x,y) ∥ x − y ~ x ∥ = d T ( x , y ) , hence κ ( x , y ) = 1 2 ∥ x − y ~ x ∥ 2 \kappa(x,y)=\tfrac12\lVert x-\tilde y_{x}\rVert^{2} κ ( x , y ) = 2 1 ∥ x − y ~ x ∥ 2 . To see this, write y ~ = y + m \tilde y=y+m y ~ = y + m with m ∈ Z d m\in\mathbb{Z}^{d} m ∈ Z d . Then x − y ~ = ( − 1 ) ( y − x − ( − m ) ) x-\tilde y=(-1)\bigl(y-x-(-m)\bigr) x − y ~ = ( − 1 ) ( y − x − ( − m ) ) and y ~ − x = y − x − ( − m ) \tilde y-x=y-x-(-m) y ~ − x = y − x − ( − m ) , so claim 5 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n (with ∣ − 1 ∣ = 1 |-1|=1 ∣ − 1∣ = 1 ) gives ∥ x − y ~ ∥ = ∥ y ~ − x ∥ = ∥ y − x − ( − m ) ∥ \lVert x-\tilde y\rVert=\lVert\tilde y-x\rVert=\lVert y-x-(-m)\rVert ∥ x − y ~ ∥ = ∥ y ~ − x ∥ = ∥ y − x − ( − m )∥ ; as − m ∈ Z d -m\in\mathbb{Z}^{d} − m ∈ Z d , The Flat Torus Distance: Minimality of the Wrapped Displacement, Periodicity, the Metric on the Unit Cell and the Lipschitz Bound §minimal gives d T ( x , y ) ≤ ∥ y − x − ( − m ) ∥ d_{\mathbb{T}}(x,y)\le\lVert y-x-(-m)\rVert d T ( x , y ) ≤ ∥ y − x − ( − m )∥ . Both d T ( x , y ) d_{\mathbb{T}}(x,y) d T ( x , y ) (The Wrapped Displacement and the Flat Torus Distance §distance ) and ∥ x − y ~ ∥ \lVert x-\tilde y\rVert ∥ x − y ~ ∥ (claim 1 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n ) are nonnegative, and for real numbers 0 ≤ s ≤ t 0\le s\le t 0 ≤ s ≤ t one has s ⋅ s ≤ s ⋅ t ≤ t ⋅ t s\cdot s\le s\cdot t\le t\cdot t s ⋅ s ≤ s ⋅ t ≤ t ⋅ t , multiplication by a nonnegative element preserving the order of the ordered field R \mathbb{R} R ; so d T ( x , y ) 2 ≤ ∥ x − y ~ ∥ 2 d_{\mathbb{T}}(x,y)^{2}\le\lVert x-\tilde y\rVert^{2} d T ( x , y ) 2 ≤ ∥ x − y ~ ∥ 2 , and multiplying by 1 2 \tfrac12 2 1 gives the second inequality. For y ~ x \tilde y_{x} y ~ x : the point k 0 = y − x − ϖ ( y − x ) k_{0}=y-x-\varpi(y-x) k 0 = y − x − ϖ ( y − x ) lies in Z d \mathbb{Z}^{d} Z d by The Flat Torus Distance: Minimality of the Wrapped Displacement, Periodicity, the Metric on the Unit Cell and the Lipschitz Bound §range , and y ~ x = y + ( − k 0 ) \tilde y_{x}=y+(-k_{0}) y ~ x = y + ( − k 0 ) with − k 0 ∈ Z d -k_{0}\in\mathbb{Z}^{d} − k 0 ∈ Z d ; moreover x − y ~ x = ( − 1 ) ϖ ( y − x ) x-\tilde y_{x}=(-1)\varpi(y-x) x − y ~ x = ( − 1 ) ϖ ( y − x ) , so ∥ x − y ~ x ∥ = ∥ ϖ ( y − x ) ∥ = d T ( x , y ) \lVert x-\tilde y_{x}\rVert=\lVert\varpi(y-x)\rVert=d_{\mathbb{T}}(x,y) ∥ x − y ~ x ∥ = ∥ ϖ ( y − x )∥ = d T ( x , y ) by claim 5 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n and The Wrapped Displacement and the Flat Torus Distance §distance .
(c) Periodicity and Lipschitz bound of κ \kappa κ in the first variable. For all x , x ′ , y ∈ R d x,x',y\in\mathbb{R}^{d} x , x ′ , y ∈ R d and k ∈ Z d k\in\mathbb{Z}^{d} k ∈ Z d one has κ ( x + k , y ) = κ ( x , y ) \kappa(x+k,y)=\kappa(x,y) κ ( x + k , y ) = κ ( x , y ) , by The Flat Torus Distance: Minimality of the Wrapped Displacement, Periodicity, the Metric on the Unit Cell and the Lipschitz Bound §symmetry applied with the lattice points k k k and 0 R d 0_{\mathbb{R}^{d}} 0 R d ; and ∣ κ ( x , y ) − κ ( x ′ , y ) ∣ ≤ L ∥ x − x ′ ∥ |\kappa(x,y)-\kappa(x',y)|\le L\lVert x-x'\rVert ∣ κ ( x , y ) − κ ( x ′ , y ) ∣ ≤ L ∥ x − x ′ ∥ , which is the second inequality of The Flat Torus Distance: Minimality of the Wrapped Displacement, Periodicity, the Metric on the Unit Cell and the Lipschitz Bound §lipschitz multiplied by 1 2 \tfrac12 2 1 .
Step 1. Chains and their values. Since Γ \Gamma Γ is nonempty, fix once and for all a point w ^ ∈ Γ \hat w\in\Gamma w ^ ∈ Γ and put x ^ = p r 1 ( w ^ ) \hat x=\mathrm{pr}_{1}(\hat w) x ^ = pr 1 ( w ^ ) . A chain C C C consists of a natural number N N N with 2 ≤ N 2\le N 2 ≤ N and a map [ N ] → Γ [N]\to\Gamma [ N ] → Γ , i ↦ w i i\mapsto w_{i} i ↦ w i , with w 1 = w ^ w_{1}=\hat w w 1 = w ^ ; we write x i = p r 1 ( w i ) x_{i}=\mathrm{pr}_{1}(w_{i}) x i = pr 1 ( w i ) and y i = p r 2 ( w i ) y_{i}=\mathrm{pr}_{2}(w_{i}) y i = pr 2 ( w i ) for i ∈ [ N ] i\in[N] i ∈ [ N ] , so that x 1 = x ^ x_{1}=\hat x x 1 = x ^ . Let C \mathcal{C} C be the set of all chains; it is nonempty, containing the chain with N = 2 N=2 N = 2 and w 1 = w 2 = w ^ w_{1}=w_{2}=\hat w w 1 = w 2 = w ^ . For a chain C C C (with N − 1 ∈ N N-1\in\mathbb{N} N − 1 ∈ N because 2 ≤ N 2\le N 2 ≤ N ) put
K C = ∑ i = 1 N − 1 ( κ ( x i + 1 , y i ) − κ ( x i , y i ) ) − κ ( x N , y N ) , g C ( x ) = K C + κ ( x , y N ) ( x ∈ R d ) . K_{C}=\sum_{i=1}^{N-1}\bigl(\kappa(x_{i+1},y_{i})-\kappa(x_{i},y_{i})\bigr)-\kappa(x_{N},y_{N}),\qquad g_{C}(x)=K_{C}+\kappa(x,y_{N})\quad(x\in\mathbb{R}^{d}). K C = i = 1 ∑ N − 1 ( κ ( x i + 1 , y i ) − κ ( x i , y i ) ) − κ ( x N , y N ) , g C ( x ) = K C + κ ( x , y N ) ( x ∈ R d ) .
These functions have the following four properties.
(i) 0 ≤ g C ( x ^ ) 0\le g_{C}(\hat x) 0 ≤ g C ( x ^ ) . Put x N + 1 = x 1 x_{N+1}=x_{1} x N + 1 = x 1 and b i = κ ( x i + 1 , y i ) − κ ( x i , y i ) b_{i}=\kappa(x_{i+1},y_{i})-\kappa(x_{i},y_{i}) b i = κ ( x i + 1 , y i ) − κ ( x i , y i ) for i ∈ [ N ] i\in[N] i ∈ [ N ] . By the recursion of claim 1 of Properties of Finite Sums , applied with S ( N − 1 ) = N S(N-1)=N S ( N − 1 ) = N , and the independence of the extending family stated there,
∑ i = 1 N b i = ∑ i = 1 N − 1 ( κ ( x i + 1 , y i ) − κ ( x i , y i ) ) + κ ( x 1 , y N ) − κ ( x N , y N ) = g C ( x 1 ) = g C ( x ^ ) . \sum_{i=1}^{N}b_{i}=\sum_{i=1}^{N-1}\bigl(\kappa(x_{i+1},y_{i})-\kappa(x_{i},y_{i})\bigr)+\kappa(x_{1},y_{N})-\kappa(x_{N},y_{N})=g_{C}(x_{1})=g_{C}(\hat x). i = 1 ∑ N b i = i = 1 ∑ N − 1 ( κ ( x i + 1 , y i ) − κ ( x i , y i ) ) + κ ( x 1 , y N ) − κ ( x N , y N ) = g C ( x 1 ) = g C ( x ^ ) .
By claims 2 and 3 of Properties of Finite Sums ,
∑ i = 1 N b i = 1 2 ( ∑ i = 1 N d T ( x i + 1 , y i ) 2 − ∑ i = 1 N d T ( x i , y i ) 2 ) , \sum_{i=1}^{N}b_{i}=\tfrac12\Bigl(\sum_{i=1}^{N}d_{\mathbb{T}}(x_{i+1},y_{i})^{2}-\sum_{i=1}^{N}d_{\mathbb{T}}(x_{i},y_{i})^{2}\Bigr), i = 1 ∑ N b i = 2 1 ( i = 1 ∑ N d T ( x i + 1 , y i ) 2 − i = 1 ∑ N d T ( x i , y i ) 2 ) ,
which is nonnegative because Γ \Gamma Γ is torus-cyclically monotone : that definition, applied to N N N and the points w 1 , … , w N ∈ Γ w_{1},\dots,w_{N}\in\Gamma w 1 , … , w N ∈ Γ , with x N + 1 = x 1 x_{N+1}=x_{1} x N + 1 = x 1 exactly as there, gives ∑ i = 1 N d T ( x i , y i ) 2 ≤ ∑ i = 1 N d T ( x i + 1 , y i ) 2 \sum_{i=1}^{N}d_{\mathbb{T}}(x_{i},y_{i})^{2}\le\sum_{i=1}^{N}d_{\mathbb{T}}(x_{i+1},y_{i})^{2} ∑ i = 1 N d T ( x i , y i ) 2 ≤ ∑ i = 1 N d T ( x i + 1 , y i ) 2 .
(ii) Periodicity. g C ( x + k ) = g C ( x ) g_{C}(x+k)=g_{C}(x) g C ( x + k ) = g C ( x ) for all x ∈ R d x\in\mathbb{R}^{d} x ∈ R d and k ∈ Z d k\in\mathbb{Z}^{d} k ∈ Z d , by Step 0(c).
(iii) Lipschitz bound. ∣ g C ( x ) − g C ( x ′ ) ∣ = ∣ κ ( x , y N ) − κ ( x ′ , y N ) ∣ ≤ L ∥ x − x ′ ∥ |g_{C}(x)-g_{C}(x')|=|\kappa(x,y_{N})-\kappa(x',y_{N})|\le L\lVert x-x'\rVert ∣ g C ( x ) − g C ( x ′ ) ∣ = ∣ κ ( x , y N ) − κ ( x ′ , y N ) ∣ ≤ L ∥ x − x ′ ∥ for all x , x ′ ∈ R d x,x'\in\mathbb{R}^{d} x , x ′ ∈ R d , by Step 0(c).
(iv) Extension. Let w ∈ Γ w\in\Gamma w ∈ Γ , x = p r 1 ( w ) x=\mathrm{pr}_{1}(w) x = pr 1 ( w ) and y = p r 2 ( w ) y=\mathrm{pr}_{2}(w) y = pr 2 ( w ) , and let C + C^{+} C + be the chain with N + 1 N+1 N + 1 points w 1 , … , w N , w N + 1 w_{1},\dots,w_{N},w_{N+1} w 1 , … , w N , w N + 1 , where w N + 1 = w w_{N+1}=w w N + 1 = w , so that x N + 1 = x x_{N+1}=x x N + 1 = x and y N + 1 = y y_{N+1}=y y N + 1 = y for C + C^{+} C + . The first N − 1 N-1 N − 1 summands defining K C + K_{C^{+}} K C + are those defining K C K_{C} K C , since they involve only w 1 , … , w N w_{1},\dots,w_{N} w 1 , … , w N , and the recursion of claim 1 of Properties of Finite Sums , applied with S ( N − 1 ) = N S(N-1)=N S ( N − 1 ) = N , gives
K C + = ∑ i = 1 N − 1 ( κ ( x i + 1 , y i ) − κ ( x i , y i ) ) + κ ( x , y N ) − κ ( x N , y N ) − κ ( x , y ) = g C ( x ) − κ ( x , y ) . K_{C^{+}}=\sum_{i=1}^{N-1}\bigl(\kappa(x_{i+1},y_{i})-\kappa(x_{i},y_{i})\bigr)+\kappa(x,y_{N})-\kappa(x_{N},y_{N})-\kappa(x,y)=g_{C}(x)-\kappa(x,y). K C + = i = 1 ∑ N − 1 ( κ ( x i + 1 , y i ) − κ ( x i , y i ) ) + κ ( x , y N ) − κ ( x N , y N ) − κ ( x , y ) = g C ( x ) − κ ( x , y ) .
Hence g C + ( x ′ ) = g C ( x ) + κ ( x ′ , y ) − κ ( x , y ) g_{C^{+}}(x')=g_{C}(x)+\kappa(x',y)-\kappa(x,y) g C + ( x ′ ) = g C ( x ) + κ ( x ′ , y ) − κ ( x , y ) for every x ′ ∈ R d x'\in\mathbb{R}^{d} x ′ ∈ R d .
Step 2. Definition of φ \varphi φ . For x ∈ R d x\in\mathbb{R}^{d} x ∈ R d let S ( x ) = { g C ( x ) : C ∈ C } S(x)=\{g_{C}(x):C\in\mathcal{C}\} S ( x ) = { g C ( x ) : C ∈ C } , a nonempty subset of R \mathbb{R} R because C \mathcal{C} C is nonempty. For every chain C C C , (iii) and (i) give
g C ( x ) ≥ g C ( x ^ ) − L ∥ x − x ^ ∥ ≥ − L ∥ x − x ^ ∥ , g_{C}(x)\ge g_{C}(\hat x)-L\lVert x-\hat x\rVert\ge-L\lVert x-\hat x\rVert , g C ( x ) ≥ g C ( x ^ ) − L ∥ x − x ^ ∥ ≥ − L ∥ x − x ^ ∥ ,
so S ( x ) S(x) S ( x ) is bounded below by − L ∥ x − x ^ ∥ -L\lVert x-\hat x\rVert − L ∥ x − x ^ ∥ , and by Existence of the Infimum of a Nonempty Subset of R \mathbb{R} R Bounded Below it has a greatest lower bound in R \mathbb{R} R . Define φ ( x ) = inf S ( x ) \varphi(x)=\inf S(x) φ ( x ) = inf S ( x ) , and ψ ( x ) = 1 2 ∥ x ∥ 2 − φ ( x ) \psi(x)=\tfrac12\lVert x\rVert^{2}-\varphi(x) ψ ( x ) = 2 1 ∥ x ∥ 2 − φ ( x ) as in the statement. By the definition of a greatest lower bound we shall use two facts: φ ( x ) ≤ g C ( x ) \varphi(x)\le g_{C}(x) φ ( x ) ≤ g C ( x ) for every chain C C C ; and every real lower bound of S ( x ) S(x) S ( x ) is at most φ ( x ) \varphi(x) φ ( x ) .
Step 3. Claim 1. Let x ∈ R d x\in\mathbb{R}^{d} x ∈ R d and k ∈ Z d k\in\mathbb{Z}^{d} k ∈ Z d . By (ii), S ( x + k ) = S ( x ) S(x+k)=S(x) S ( x + k ) = S ( x ) , so φ ( x + k ) = φ ( x ) \varphi(x+k)=\varphi(x) φ ( x + k ) = φ ( x ) and φ \varphi φ is Z d \mathbb{Z}^{d} Z d -periodic . Let x , x ′ ∈ R d x,x'\in\mathbb{R}^{d} x , x ′ ∈ R d . For every chain C C C , Step 2 and (iii) give φ ( x ) ≤ g C ( x ) ≤ g C ( x ′ ) + L ∥ x − x ′ ∥ \varphi(x)\le g_{C}(x)\le g_{C}(x')+L\lVert x-x'\rVert φ ( x ) ≤ g C ( x ) ≤ g C ( x ′ ) + L ∥ x − x ′ ∥ , so φ ( x ) − L ∥ x − x ′ ∥ \varphi(x)-L\lVert x-x'\rVert φ ( x ) − L ∥ x − x ′ ∥ is a lower bound of S ( x ′ ) S(x') S ( x ′ ) and therefore φ ( x ) − L ∥ x − x ′ ∥ ≤ φ ( x ′ ) \varphi(x)-L\lVert x-x'\rVert\le\varphi(x') φ ( x ) − L ∥ x − x ′ ∥ ≤ φ ( x ′ ) . Exchanging x x x and x ′ x' x ′ , and using ∥ x ′ − x ∥ = ∥ x − x ′ ∥ \lVert x'-x\rVert=\lVert x-x'\rVert ∥ x ′ − x ∥ = ∥ x − x ′ ∥ (claim 5 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n ), we get ∣ φ ( x ) − φ ( x ′ ) ∣ ≤ L ∥ x − x ′ ∥ |\varphi(x)-\varphi(x')|\le L\lVert x-x'\rVert ∣ φ ( x ) − φ ( x ′ ) ∣ ≤ L ∥ x − x ′ ∥ . As ∥ x − x ′ ∥ = d E ( x , x ′ ) \lVert x-x'\rVert=d_{E}(x,x') ∥ x − x ′ ∥ = d E ( x , x ′ ) by claim 2 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n and ∣ φ ( x ) − φ ( x ′ ) ∣ |\varphi(x)-\varphi(x')| ∣ φ ( x ) − φ ( x ′ ) ∣ is the distance of the absolute-value metric , φ \varphi φ is Lipschitz with constant L = d / 2 L=\sqrt{d}/2 L = d /2 .
Step 4. Claim 3. Let w ∈ Γ w\in\Gamma w ∈ Γ , x = p r 1 ( w ) x=\mathrm{pr}_{1}(w) x = pr 1 ( w ) , y = p r 2 ( w ) y=\mathrm{pr}_{2}(w) y = pr 2 ( w ) and x ′ ∈ R d x'\in\mathbb{R}^{d} x ′ ∈ R d . For every chain C C C , Step 2 applied at x ′ x' x ′ to the chain C + C^{+} C + of (iv) gives
φ ( x ′ ) ≤ g C + ( x ′ ) = g C ( x ) + κ ( x ′ , y ) − κ ( x , y ) . \varphi(x')\le g_{C^{+}}(x')=g_{C}(x)+\kappa(x',y)-\kappa(x,y). φ ( x ′ ) ≤ g C + ( x ′ ) = g C ( x ) + κ ( x ′ , y ) − κ ( x , y ) .
Hence φ ( x ′ ) − κ ( x ′ , y ) + κ ( x , y ) \varphi(x')-\kappa(x',y)+\kappa(x,y) φ ( x ′ ) − κ ( x ′ , y ) + κ ( x , y ) is a lower bound of S ( x ) S(x) S ( x ) , so it is at most φ ( x ) \varphi(x) φ ( x ) ; rearranging,
φ ( x ′ ) ≤ φ ( x ) + 1 2 d T ( x ′ , y ) 2 − 1 2 d T ( x , y ) 2 . \varphi(x')\le\varphi(x)+\tfrac12d_{\mathbb{T}}(x',y)^{2}-\tfrac12d_{\mathbb{T}}(x,y)^{2}. φ ( x ′ ) ≤ φ ( x ) + 2 1 d T ( x ′ , y ) 2 − 2 1 d T ( x , y ) 2 .
Step 5. Claim 2. For a chain C C C , whose last point has second coordinate y N y_{N} y N , and for y ~ ∈ y N + Z d \tilde y\in y_{N}+\mathbb{Z}^{d} y ~ ∈ y N + Z d , let f C , y ~ : R d → R f_{C,\tilde y}:\mathbb{R}^{d}\to\mathbb{R} f C , y ~ : R d → R be given by
f C , y ~ ( x ) = y ~ ⋅ x + ( − 1 2 ∥ y ~ ∥ 2 − K C ) . f_{C,\tilde y}(x)=\tilde y\cdot x+\Bigl(-\tfrac12\lVert\tilde y\rVert^{2}-K_{C}\Bigr). f C , y ~ ( x ) = y ~ ⋅ x + ( − 2 1 ∥ y ~ ∥ 2 − K C ) .
By claim 1 of Affine Functions, Sums, Nonnegative Multiples and Pointwise Suprema of Convex Functions , applied to the convex set R d \mathbb{R}^{d} R d , the point p = y ~ p=\tilde y p = y ~ and the constant − 1 2 ∥ y ~ ∥ 2 − K C -\tfrac12\lVert\tilde y\rVert^{2}-K_{C} − 2 1 ∥ y ~ ∥ 2 − K C , each f C , y ~ f_{C,\tilde y} f C , y ~ is convex on R d \mathbb{R}^{d} R d . Let F \mathcal{F} F be the set of all these functions; it is nonempty, since C \mathcal{C} C is nonempty and y N = y N + 0 R d ∈ y N + Z d y_{N}=y_{N}+0_{\mathbb{R}^{d}}\in y_{N}+\mathbb{Z}^{d} y N = y N + 0 R d ∈ y N + Z d . Fix x ∈ R d x\in\mathbb{R}^{d} x ∈ R d ; we show that ψ ( x ) \psi(x) ψ ( x ) is the least upper bound of { f ( x ) : f ∈ F } \{f(x):f\in\mathcal{F}\} { f ( x ) : f ∈ F } .
Upper bound. Let C C C be a chain and y ~ ∈ y N + Z d \tilde y\in y_{N}+\mathbb{Z}^{d} y ~ ∈ y N + Z d . By Step 0(b), κ ( x , y N ) ≤ 1 2 ∥ x − y ~ ∥ 2 \kappa(x,y_{N})\le\tfrac12\lVert x-\tilde y\rVert^{2} κ ( x , y N ) ≤ 2 1 ∥ x − y ~ ∥ 2 , so g C ( x ) ≤ K C + 1 2 ∥ x − y ~ ∥ 2 g_{C}(x)\le K_{C}+\tfrac12\lVert x-\tilde y\rVert^{2} g C ( x ) ≤ K C + 2 1 ∥ x − y ~ ∥ 2 . By Step 0(a) and the symmetry of the dot product (claim 1 of Bilinearity and Symmetry of the Dot Product on R n \mathbb{R}^n R n ), and then Step 2,
f C , y ~ ( x ) = 1 2 ∥ x ∥ 2 − 1 2 ∥ x − y ~ ∥ 2 − K C ≤ 1 2 ∥ x ∥ 2 − g C ( x ) ≤ 1 2 ∥ x ∥ 2 − φ ( x ) = ψ ( x ) . f_{C,\tilde y}(x)=\tfrac12\lVert x\rVert^{2}-\tfrac12\lVert x-\tilde y\rVert^{2}-K_{C}\le\tfrac12\lVert x\rVert^{2}-g_{C}(x)\le\tfrac12\lVert x\rVert^{2}-\varphi(x)=\psi(x). f C , y ~ ( x ) = 2 1 ∥ x ∥ 2 − 2 1 ∥ x − y ~ ∥ 2 − K C ≤ 2 1 ∥ x ∥ 2 − g C ( x ) ≤ 2 1 ∥ x ∥ 2 − φ ( x ) = ψ ( x ) .
Least. Let b ∈ R b\in\mathbb{R} b ∈ R be an upper bound of { f ( x ) : f ∈ F } \{f(x):f\in\mathcal{F}\} { f ( x ) : f ∈ F } , and let C C C be a chain. The point y ~ x = x + ϖ ( y N − x ) \tilde y_{x}=x+\varpi(y_{N}-x) y ~ x = x + ϖ ( y N − x ) of Step 0(b) lies in y N + Z d y_{N}+\mathbb{Z}^{d} y N + Z d and satisfies κ ( x , y N ) = 1 2 ∥ x − y ~ x ∥ 2 \kappa(x,y_{N})=\tfrac12\lVert x-\tilde y_{x}\rVert^{2} κ ( x , y N ) = 2 1 ∥ x − y ~ x ∥ 2 , so g C ( x ) = K C + 1 2 ∥ x − y ~ x ∥ 2 g_{C}(x)=K_{C}+\tfrac12\lVert x-\tilde y_{x}\rVert^{2} g C ( x ) = K C + 2 1 ∥ x − y ~ x ∥ 2 and, by the same identity as above, f C , y ~ x ( x ) = 1 2 ∥ x ∥ 2 − g C ( x ) f_{C,\tilde y_{x}}(x)=\tfrac12\lVert x\rVert^{2}-g_{C}(x) f C , y ~ x ( x ) = 2 1 ∥ x ∥ 2 − g C ( x ) . Hence 1 2 ∥ x ∥ 2 − g C ( x ) ≤ b \tfrac12\lVert x\rVert^{2}-g_{C}(x)\le b 2 1 ∥ x ∥ 2 − g C ( x ) ≤ b , that is 1 2 ∥ x ∥ 2 − b ≤ g C ( x ) \tfrac12\lVert x\rVert^{2}-b\le g_{C}(x) 2 1 ∥ x ∥ 2 − b ≤ g C ( x ) . As C C C was arbitrary, 1 2 ∥ x ∥ 2 − b \tfrac12\lVert x\rVert^{2}-b 2 1 ∥ x ∥ 2 − b is a lower bound of S ( x ) S(x) S ( x ) , so 1 2 ∥ x ∥ 2 − b ≤ φ ( x ) \tfrac12\lVert x\rVert^{2}-b\le\varphi(x) 2 1 ∥ x ∥ 2 − b ≤ φ ( x ) , that is ψ ( x ) ≤ b \psi(x)\le b ψ ( x ) ≤ b .
Thus for every x x x the set { f ( x ) : f ∈ F } \{f(x):f\in\mathcal{F}\} { f ( x ) : f ∈ F } has an upper bound, and its least upper bound is ψ ( x ) \psi(x) ψ ( x ) . Claim 4 of Affine Functions, Sums, Nonnegative Multiples and Pointwise Suprema of Convex Functions , applied to the convex set R d \mathbb{R}^{d} R d and the nonempty family F \mathcal{F} F of convex functions, shows that the function whose value at x x x is that least upper bound, namely ψ \psi ψ , is convex on R d \mathbb{R}^{d} R d .
Step 6. Claim 4. Let w ∈ Γ w\in\Gamma w ∈ Γ , x = p r 1 ( w ) x=\mathrm{pr}_{1}(w) x = pr 1 ( w ) , y = p r 2 ( w ) y=\mathrm{pr}_{2}(w) y = pr 2 ( w ) , and let y ~ ∈ y + Z d \tilde y\in y+\mathbb{Z}^{d} y ~ ∈ y + Z d satisfy ∥ y ~ − x ∥ = d T ( x , y ) \lVert\tilde y-x\rVert=d_{\mathbb{T}}(x,y) ∥ y ~ − x ∥ = d T ( x , y ) . By claim 5 of Elementary Properties of the Euclidean Norm on R n \mathbb{R}^n R n , ∥ x − y ~ ∥ = ∥ y ~ − x ∥ \lVert x-\tilde y\rVert=\lVert\tilde y-x\rVert ∥ x − y ~ ∥ = ∥ y ~ − x ∥ , so κ ( x , y ) = 1 2 ∥ x − y ~ ∥ 2 \kappa(x,y)=\tfrac12\lVert x-\tilde y\rVert^{2} κ ( x , y ) = 2 1 ∥ x − y ~ ∥ 2 . Let x ′ ∈ R d x'\in\mathbb{R}^{d} x ′ ∈ R d . By Step 0(b), κ ( x ′ , y ) ≤ 1 2 ∥ x ′ − y ~ ∥ 2 \kappa(x',y)\le\tfrac12\lVert x'-\tilde y\rVert^{2} κ ( x ′ , y ) ≤ 2 1 ∥ x ′ − y ~ ∥ 2 , so claim 3 (Step 4) gives
φ ( x ′ ) ≤ φ ( x ) + 1 2 ∥ x ′ − y ~ ∥ 2 − 1 2 ∥ x − y ~ ∥ 2 , \varphi(x')\le\varphi(x)+\tfrac12\lVert x'-\tilde y\rVert^{2}-\tfrac12\lVert x-\tilde y\rVert^{2}, φ ( x ′ ) ≤ φ ( x ) + 2 1 ∥ x ′ − y ~ ∥ 2 − 2 1 ∥ x − y ~ ∥ 2 ,
and therefore
ψ ( x ′ ) = 1 2 ∥ x ′ ∥ 2 − φ ( x ′ ) ≥ ( 1 2 ∥ x ′ ∥ 2 − 1 2 ∥ x ′ − y ~ ∥ 2 ) − φ ( x ) + 1 2 ∥ x − y ~ ∥ 2 . \psi(x')=\tfrac12\lVert x'\rVert^{2}-\varphi(x')\ge\Bigl(\tfrac12\lVert x'\rVert^{2}-\tfrac12\lVert x'-\tilde y\rVert^{2}\Bigr)-\varphi(x)+\tfrac12\lVert x-\tilde y\rVert^{2}. ψ ( x ′ ) = 2 1 ∥ x ′ ∥ 2 − φ ( x ′ ) ≥ ( 2 1 ∥ x ′ ∥ 2 − 2 1 ∥ x ′ − y ~ ∥ 2 ) − φ ( x ) + 2 1 ∥ x − y ~ ∥ 2 .
By Step 0(a) with a = x ′ a=x' a = x ′ and b = y ~ b=\tilde y b = y ~ , the bracket equals x ′ ⋅ y ~ − 1 2 ∥ y ~ ∥ 2 x'\cdot\tilde y-\tfrac12\lVert\tilde y\rVert^{2} x ′ ⋅ y ~ − 2 1 ∥ y ~ ∥ 2 ; by Step 0(a) with a = x a=x a = x and b = y ~ b=\tilde y b = y ~ , 1 2 ∥ x − y ~ ∥ 2 = 1 2 ∥ x ∥ 2 − x ⋅ y ~ + 1 2 ∥ y ~ ∥ 2 \tfrac12\lVert x-\tilde y\rVert^{2}=\tfrac12\lVert x\rVert^{2}-x\cdot\tilde y+\tfrac12\lVert\tilde y\rVert^{2} 2 1 ∥ x − y ~ ∥ 2 = 2 1 ∥ x ∥ 2 − x ⋅ y ~ + 2 1 ∥ y ~ ∥ 2 . Adding, and using claims 1 and 5 of Bilinearity and Symmetry of the Dot Product on R n \mathbb{R}^n R n to write x ′ ⋅ y ~ − x ⋅ y ~ = y ~ ⋅ ( x ′ − x ) x'\cdot\tilde y-x\cdot\tilde y=\tilde y\cdot(x'-x) x ′ ⋅ y ~ − x ⋅ y ~ = y ~ ⋅ ( x ′ − x ) ,
ψ ( x ′ ) ≥ 1 2 ∥ x ∥ 2 − φ ( x ) + y ~ ⋅ ( x ′ − x ) = ψ ( x ) + y ~ ⋅ ( x ′ − x ) . \psi(x')\ge\tfrac12\lVert x\rVert^{2}-\varphi(x)+\tilde y\cdot(x'-x)=\psi(x)+\tilde y\cdot(x'-x). ψ ( x ′ ) ≥ 2 1 ∥ x ∥ 2 − φ ( x ) + y ~ ⋅ ( x ′ − x ) = ψ ( x ) + y ~ ⋅ ( x ′ − x ) .
Since this holds for every x ′ ∈ R d x'\in\mathbb{R}^{d} x ′ ∈ R d , and R d \mathbb{R}^{d} R d is convex, y ~ \tilde y y ~ belongs to the subdifferential ∂ R d ψ ( x ) \partial_{\mathbb{R}^{d}}\psi(x) ∂ R d ψ ( x ) .