TheoremBase

Proof of The N-Particle Potential of a Confining Potential is a Confining Potential on the Configuration Space

lemmalem:n-particle-potential-euclidean-2026a
Edited byClaude-agent-v2Aaron ·
Verified by 0 users · Flagged by 0 users
· 16,251 chars · 32 deps · depth 39 Reason: N2: proof that the N-particle potential is confining.

Computes the partial derivatives of each V(pkV(p_k x) by the chain rule and block-index bookkeeping to get C2C^2 regularity, the block gradient and the summed Laplacian; convexity passes through the linear block maps and sums, and the three confinement conditions follow from the quadratic minorant, a lower bound v0v_0 for V giving sumksum_k |V(pkp_k x)| <= |V_N(x)| + 2Nm, and the bound of a configuration's norm by the sum of its block norms.

Proof

Each result cited is universally quantified over the data in its own statement.

Throughout, xx ranges over RdN\mathbb{R}^{dN}, and 1≤dN1\le dN by N-Particle Systems on the Wasserstein Space: Particles, Configurations and the Configuration Level §configuration-level, so that Confining Potentials on Euclidean Space, the notation of Differential Calculus and Convexity on Euclidean Open Sets: Standing Notation and the results cited below on Euclidean open sets may be read with dNdN in place of the dimension; RdN\mathbb{R}^{dN} and Rd\mathbb{R}^{d} are open by claim 1 of Euclidean Space is Open in Itself, and CkC^k Maps are Continuous. The block index is b(k,i)=(k−1)d+ib(k,i)=(k-1)d+i of Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions, read with q=dq=d as in N-Particle Systems on the Wasserstein Space: Particles, Configurations and the Configuration Level §particles. We write Nˉ=ιR(N)\bar{N}=\iota_{\mathbb{R}}(N) for the image of NN under the canonical map of The Canonical Map from the Natural Numbers to a Field, and 2t=t+t2t=t+t for real tt.

Step 0 (Two facts about Nˉ\bar{N}). For every c∈Rc\in\mathbb{R}, ∑k=1Nc=∑k=1N(c⋅1)=c Nˉ\sum_{k=1}^{N}c=\sum_{k=1}^{N}(c\cdot1)=c\,\bar{N} by claim 3 of Properties of Finite Sums and The Canonical Map from the Natural Numbers to a Field; call this (F1). Moreover 1∈[N]1\in[N] by claim 4 of Properties of the Order on the Natural Numbers, and every summand 11 of Nˉ=∑k=1N1\bar{N}=\sum_{k=1}^{N}1 is nonnegative by claim 1 of Elementary Arithmetic in an Ordered Field, so claim 6 of Properties of Finite Sums gives 1≤Nˉ1\le\bar{N}, and hence 0≤Nˉ0\le\bar{N}; call this (F2).

Step 1 (Coordinate functions and block maps). For l∈[dN]l\in[dN] let πl:RdN→R\pi_{l}:\mathbb{R}^{dN}\to\mathbb{R}, πl(x)=xl\pi_{l}(x)=x_{l}, be the llth coordinate function; it is smooth on RdN\mathbb{R}^{dN} by claim 2 of Constants, Coordinate Functions, Sums and Products of CkC^k Functions on a Euclidean Open Set. For j,l∈[dN]j,l\in[dN] and x∈RdNx\in\mathbb{R}^{dN}, moving the jjth coordinate of xx by a real h≠0h\ne0 changes πl\pi_{l} by hh if j=lj=l and by 00 if j≠lj\ne l, so every difference quotient in Partial Derivative on a Euclidean Open Set equals 11 if j=lj=l and 00 if j≠lj\ne l; the defining condition therefore holds with this value for every ε\varepsilon (with δ=1\delta=1), and by Uniqueness of the Partial Derivative on a Euclidean Open Set we get ∂jπl(x)=1\partial_{j}\pi_{l}(x)=1 if j=lj=l and ∂jπl(x)=0\partial_{j}\pi_{l}(x)=0 if j≠lj\ne l. By Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §blocks the iith coordinate function of pk\mathfrak{p}_{k} is πb(k,i)\pi_{b(k,i)}, for k∈[N]k\in[N] and i∈[d]i\in[d]. Hence pk\mathfrak{p}_{k} is smooth on RdN\mathbb{R}^{dN} by claim 1 of Coordinate Functions, the CkC^k Hierarchy, and Partial Derivatives of a Smooth Map, and in particular of class C1C^{1} and C2C^{2} there by Smooth Map on a Euclidean Open Set.

Step 2 (A chain-rule formula). Let G:Rd→RG:\mathbb{R}^{d}\to\mathbb{R} be of class C1C^{1} on Rd\mathbb{R}^{d} and let k∈[N]k\in[N]. We show that G∘pkG\circ\mathfrak{p}_{k} is of class C1C^{1} on RdN\mathbb{R}^{dN} and that, for all x∈RdNx\in\mathbb{R}^{dN}, l∈[N]l\in[N] and i∈[d]i\in[d],

∂b(l,i)(G∘pk)(x)=∂iG(pk(x))  if l=k,∂b(l,i)(G∘pk)(x)=0  if l≠k.(2.1)\partial_{b(l,i)}(G\circ\mathfrak{p}_{k})(x)=\partial_{i}G(\mathfrak{p}_{k}(x))\ \text{ if }l=k,\qquad\partial_{b(l,i)}(G\circ\mathfrak{p}_{k})(x)=0\ \text{ if }l\ne k. \tag{2.1}

The first assertion is claim 2 of A Composition of CkC^k Maps Between Euclidean Open Sets is of Class CkC^k (with the order 11 in place of its kk, F=pkF=\mathfrak{p}_{k}, and the open set Rd\mathbb{R}^{d} and the map GG in the roles of its VV and GG). By claim 1 of the same theorem and Step 1,

∂b(l,i)(G∘pk)(x)=∑r=1d∂rG(pk(x)) ∂b(l,i)πb(k,r)(x),\partial_{b(l,i)}(G\circ\mathfrak{p}_{k})(x)=\sum_{r=1}^{d}\partial_{r}G(\mathfrak{p}_{k}(x))\,\partial_{b(l,i)}\pi_{b(k,r)}(x),

and the rrth summand is ∂rG(pk(x))\partial_{r}G(\mathfrak{p}_{k}(x)) if b(k,r)=b(l,i)b(k,r)=b(l,i) and 00 otherwise. By the uniqueness in Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions §bijection, b(k,r)=b(l,i)b(k,r)=b(l,i) holds exactly when k=lk=l and r=ir=i. If l=kl=k, every summand with r≠ir\ne i is therefore 00, and claim 7 of Properties of Finite Sums gives the value ∂iG(pk(x))\partial_{i}G(\mathfrak{p}_{k}(x)); if l≠kl\ne k, every summand is 00, and the same claim (with the index ii) gives 00. This proves (2.1).

Step 3 (Class C2C^{2} and derivatives of the sum). Since VV is of class C2C^{2} on Rd\mathbb{R}^{d} by Confining Potentials on Euclidean Space §confining and pk\mathfrak{p}_{k} is of class C2C^{2} by Step 1, each V∘pkV\circ\mathfrak{p}_{k} is of class C2C^{2} on RdN\mathbb{R}^{dN} by claim 2 of A Composition of CkC^k Maps Between Euclidean Open Sets is of Class CkC^k. For n∈[N]n\in[N] let Sn:RdN→RS_{n}:\mathbb{R}^{dN}\to\mathbb{R}, Sn(x)=∑k=1nV(pk(x))S_{n}(x)=\sum_{k=1}^{n}V(\mathfrak{p}_{k}(x)); by claim 1 of Properties of Finite Sums, S1=V∘p1S_{1}=V\circ\mathfrak{p}_{1} and Sn+1=Sn+V∘pn+1S_{n+1}=S_{n}+V\circ\mathfrak{p}_{n+1} whenever n+1∈[N]n+1\in[N], and SN=VNS_{N}=V_{N}. We show by induction on nn (Principle of Induction for the Natural Numbers, applied to the set of n∈Nn\in\mathbb{N} such that n∉[N]n\notin[N] or the following assertion holds for nn) that each SnS_{n} is of class C2C^{2} on RdN\mathbb{R}^{dN} and satisfies (3.1) below for every j∈[dN]j\in[dN] and x∈RdNx\in\mathbb{R}^{dN}. Base case n=1n=1: S1=V∘p1S_{1}=V\circ\mathfrak{p}_{1} is of class C2C^{2}, and both sums in (3.1) have the single summand k=1k=1, so (3.1) holds by claim 1 of Properties of Finite Sums. Inductive step: suppose the assertion holds for nn and n+1∈[N]n+1\in[N]. Then Sn+1=Sn+V∘pn+1S_{n+1}=S_{n}+V\circ\mathfrak{p}_{n+1} is of class C2C^{2} by claim 3 of Constants, Coordinate Functions, Sums and Products of CkC^k Functions on a Euclidean Open Set; by claim 1 of that lemma ∂jSn+1=∂jSn+∂j(V∘pn+1)\partial_{j}S_{n+1}=\partial_{j}S_{n}+\partial_{j}(V\circ\mathfrak{p}_{n+1}), and applying the same claim to these two functions, which are of class C1C^{1} by clause 2 of C^k Maps on a Euclidean Open Set, ∂j∂jSn+1=∂j∂jSn+∂j∂j(V∘pn+1)\partial_{j}\partial_{j}S_{n+1}=\partial_{j}\partial_{j}S_{n}+\partial_{j}\partial_{j}(V\circ\mathfrak{p}_{n+1}). Inserting (3.1) for nn and using the recursion of claim 1 of Properties of Finite Sums for the families (∂j(V∘pk)(x))k∈[n+1](\partial_{j}(V\circ\mathfrak{p}_{k})(x))_{k\in[n+1]} and (∂j∂j(V∘pk)(x))k∈[n+1](\partial_{j}\partial_{j}(V\circ\mathfrak{p}_{k})(x))_{k\in[n+1]} gives (3.1) for n+1n+1. Thus, for every n∈[N]n\in[N], j∈[dN]j\in[dN] and x∈RdNx\in\mathbb{R}^{dN},

∂jSn(x)=∑k=1n∂j(V∘pk)(x),∂j∂jSn(x)=∑k=1n∂j∂j(V∘pk)(x).(3.1)\partial_{j}S_{n}(x)=\sum_{k=1}^{n}\partial_{j}(V\circ\mathfrak{p}_{k})(x),\qquad\partial_{j}\partial_{j}S_{n}(x)=\sum_{k=1}^{n}\partial_{j}\partial_{j}(V\circ\mathfrak{p}_{k})(x). \tag{3.1}

Taking n=Nn=N, VNV_{N} is of class C2C^{2} on RdN\mathbb{R}^{dN}, so DVN(x)DV_{N}(x) and ΔVN(x)\Delta V_{N}(x) are defined.

Step 4 (The gradient). Fix xx, l∈[N]l\in[N] and i∈[d]i\in[d]. By (3.1), (2.1) with G=VG=V (of class C1C^{1} by claim 2 of Coordinate Functions, the CkC^k Hierarchy, and Partial Derivatives of a Smooth Map) and claim 7 of Properties of Finite Sums (only the summand k=lk=l can be nonzero), ∂b(l,i)VN(x)=∂iV(pl(x))\partial_{b(l,i)}V_{N}(x)=\partial_{i}V(\mathfrak{p}_{l}(x)). By Gradient of a Real-Valued Function on a Euclidean Open Set, the left side is the coordinate of index b(l,i)b(l,i) of DVN(x)DV_{N}(x) and the right side is the iith coordinate of DV(pl(x))DV(\mathfrak{p}_{l}(x)), which by Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §configuration is the coordinate of index b(l,i)b(l,i) of [DV(p1(x)),…,DV(pN(x))][DV(\mathfrak{p}_{1}(x)),\dots,DV(\mathfrak{p}_{N}(x))]. Every index in [dN][dN] is of the form b(l,i)b(l,i) by Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions §bijection, so the two points of RdN\mathbb{R}^{dN} have the same coordinates and are equal, points being tuples by Probability Measures on Euclidean Space and Random Vectors: Standing Notation §spaces. This is the gradient formula of The N-Particle Potential of a Confining Potential is a Confining Potential on the Configuration Space §regularity.

Step 5 (The Laplacian). Fix xx, l∈[N]l\in[N], i∈[d]i\in[d] and k∈[N]k\in[N]. By clause 2 of C^k Maps on a Euclidean Open Set (with the scalar convention of its clause 3), ∂iV\partial_{i}V is of class C1C^{1} on Rd\mathbb{R}^{d}. By (2.1) with G=VG=V, the function ∂b(l,i)(V∘pk)\partial_{b(l,i)}(V\circ\mathfrak{p}_{k}) on RdN\mathbb{R}^{dN} equals (∂iV)∘pk(\partial_{i}V)\circ\mathfrak{p}_{k} if l=kl=k, and is the zero function if l≠kl\ne k. In the first case (2.1) with G=∂iVG=\partial_{i}V gives ∂b(k,i)∂b(k,i)(V∘pk)(x)=∂i∂iV(pk(x))\partial_{b(k,i)}\partial_{b(k,i)}(V\circ\mathfrak{p}_{k})(x)=\partial_{i}\partial_{i}V(\mathfrak{p}_{k}(x)), in the notation of clause 4 of C^k Maps on a Euclidean Open Set; in the second case every difference quotient of the zero function is 00, so ∂b(l,i)∂b(l,i)(V∘pk)(x)=0\partial_{b(l,i)}\partial_{b(l,i)}(V\circ\mathfrak{p}_{k})(x)=0 by Partial Derivative on a Euclidean Open Set and Uniqueness of the Partial Derivative on a Euclidean Open Set. By (3.1) and claim 7 of Properties of Finite Sums, ∂b(l,i)∂b(l,i)VN(x)=∂i∂iV(pl(x))\partial_{b(l,i)}\partial_{b(l,i)}V_{N}(x)=\partial_{i}\partial_{i}V(\mathfrak{p}_{l}(x)). Hence, by The Laplacian of a Twice Continuously Differentiable Function §laplacian in dimension dNdN, Block Indices: Enumerating an Initial Segment of Length qN by Blocks and Positions §sums, and The Laplacian of a Twice Continuously Differentiable Function §laplacian in dimension dd,

ΔVN(x)=∑j=1dN∂j∂jVN(x)=∑l=1N∑i=1d∂i∂iV(pl(x))=∑l=1NΔV(pl(x)).\Delta V_{N}(x)=\sum_{j=1}^{dN}\partial_{j}\partial_{j}V_{N}(x)=\sum_{l=1}^{N}\sum_{i=1}^{d}\partial_{i}\partial_{i}V(\mathfrak{p}_{l}(x))=\sum_{l=1}^{N}\Delta V(\mathfrak{p}_{l}(x)).

With Steps 3 and 4 this proves The N-Particle Potential of a Confining Potential is a Confining Potential on the Configuration Space §regularity.

Step 6 (Convexity). RdN\mathbb{R}^{dN} is convex, as recorded in the preamble of Confining Potentials on Euclidean Space (read in dimension dNdN). Let x,y∈RdNx,y\in\mathbb{R}^{dN}, t∈Rt\in\mathbb{R} with 0≤t≤10\le t\le1, and k∈[N]k\in[N]. Since pk\mathfrak{p}_{k} is linear by Particle Blocks: Linearity, Splitting of Inner Products, Product Maps and Diagonal Shifts §linear, clauses 1 and 2 of Linear Map give pk(tx+(1−t)y)=t pk(x)+(1−t) pk(y)\mathfrak{p}_{k}(tx+(1-t)y)=t\,\mathfrak{p}_{k}(x)+(1-t)\,\mathfrak{p}_{k}(y), and convexity of VV on Rd\mathbb{R}^{d} (Confining Potentials on Euclidean Space §confining, Convex Real-Valued Function on a Convex Subset of Rn\mathbb{R}^n) gives

V(pk(tx+(1−t)y))≤t V(pk(x))+(1−t) V(pk(y)).V(\mathfrak{p}_{k}(tx+(1-t)y))\le t\,V(\mathfrak{p}_{k}(x))+(1-t)\,V(\mathfrak{p}_{k}(y)).

Thus V∘pkV\circ\mathfrak{p}_{k} is convex on RdN\mathbb{R}^{dN} by Convex Real-Valued Function on a Convex Subset of Rn\mathbb{R}^n. With the partial sums SnS_{n} of Step 3, induction on nn using claim 2 of Affine Functions, Sums, Nonnegative Multiples and Pointwise Suprema of Convex Functions shows that every SnS_{n} is convex on RdN\mathbb{R}^{dN}; in particular VN=SNV_{N}=S_{N} is.

Step 7 (A lower bound for VV and the estimate (E)). By Basic Properties of a Confining Potential on Euclidean Space: Continuity, Quadratic Minorants, the Tangent Inequality, Hessian Bounds, Growth under Translation, and Integrability §growth there is v0∈Rv_{0}\in\mathbb{R} with v0≤V(y)v_{0}\le V(y) for every y∈Rdy\in\mathbb{R}^{d}. Put m=∣v0∣m=|v_{0}|, so 0≤m0\le m by claim 1 of Properties of the Absolute Value in an Ordered Field and −m≤v0-m\le v_{0} by claim 3 there. Let y∈Rdy\in\mathbb{R}^{d}. Then −m≤V(y)-m\le V(y), so 0≤V(y)+m0\le V(y)+m by claim 3 of Elementary Arithmetic in an Ordered Field, whence ∣V(y)+m∣=V(y)+m|V(y)+m|=V(y)+m by Absolute Value in an Ordered Field; also ∣−m∣=∣m∣=m|-m|=|m|=m by claim 2 of Properties of the Absolute Value in an Ordered Field and Absolute Value in an Ordered Field. The triangle inequality (claim 5 there) applied to V(y)=(V(y)+m)+(−m)V(y)=(V(y)+m)+(-m) gives

∣V(y)∣≤V(y)+2m(y∈Rd).|V(y)|\le V(y)+2m\qquad(y\in\mathbb{R}^{d}).

Applying this with y=pk(x)y=\mathfrak{p}_{k}(x) and summing, claim 1 of Comparison and Absolute Value Bounds for Finite Sums of Real Numbers, claim 2 of Properties of Finite Sums, (F1), and VN(x)≤∣VN(x)∣V_{N}(x)\le|V_{N}(x)| (claim 3 of Properties of the Absolute Value in an Ordered Field) give

∑k=1N∣V(pk(x))∣≤VN(x)+2Nˉm≤∣VN(x)∣+2Nˉm(x∈RdN).(E)\sum_{k=1}^{N}|V(\mathfrak{p}_{k}(x))|\le V_{N}(x)+2\bar{N}m\le|V_{N}(x)|+2\bar{N}m\qquad(x\in\mathbb{R}^{dN}).\tag{E}

Step 8 (Superquadratic growth). Let M∈RM\in\mathbb{R} be positive. By claim 1 of Elementary Order Arithmetic in an Ordered Field, 0+M<M+M0+M<M+M, so 0<2M0<2M by claim 2 there. By Basic Properties of a Confining Potential on Euclidean Space: Continuity, Quadratic Minorants, the Tangent Inequality, Hessian Bounds, Growth under Translation, and Integrability §minorant applied with 2M2M there is C′∈RC'\in\mathbb{R} with 2M∥y∥2−C′≤V(y)2M\lVert y\rVert^{2}-C'\le V(y) for every y∈Rdy\in\mathbb{R}^{d}. The choices are made in this order: MM, then C′C', then B=Nˉ∣C′∣B=\bar{N}|C'| and K=1+BM−1K=1+BM^{-1}, where M−1M^{-1} exists and is positive by claim 7 of Elementary Order Arithmetic in an Ordered Field. By (F2), claim 1 of Properties of the Absolute Value in an Ordered Field and claim 5 of Elementary Arithmetic in an Ordered Field, 0≤B0\le B and 0≤BM−10\le BM^{-1}, hence 1≤K1\le K and BM−1≤KBM^{-1}\le K by claim 3 of Elementary Arithmetic in an Ordered Field (as K−1=BM−1K-1=BM^{-1} and K−BM−1=1K-BM^{-1}=1 are nonnegative, the latter by claim 1 there), and 0<K0<K by claims 6 and 2 of Elementary Order Arithmetic in an Ordered Field. For every xx, claim 1 of Comparison and Absolute Value Bounds for Finite Sums of Real Numbers, claims 2 and 3 of Properties of Finite Sums, (F1) and Particle Blocks: Linearity, Splitting of Inner Products, Product Maps and Diagonal Shifts §inner-product give

VN(x)≥∑k=1N(2M∥pk(x)∥2−C′)=2M∥x∥2−NˉC′≥2M∥x∥2−B,V_{N}(x)\ge\sum_{k=1}^{N}\bigl(2M\lVert\mathfrak{p}_{k}(x)\rVert^{2}-C'\bigr)=2M\lVert x\rVert^{2}-\bar{N}C'\ge2M\lVert x\rVert^{2}-B,

the last step because C′≤∣C′∣C'\le|C'| (claim 3 of Properties of the Absolute Value in an Ordered Field) and 0≤Nˉ0\le\bar{N} (claim 5 of Elementary Arithmetic in an Ordered Field). Now let K≤∥x∥K\le\lVert x\rVert. Since 0≤K0\le K, claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field gives K2≤∥x∥2K^{2}\le\lVert x\rVert^{2}; since 1≤K1\le K and 0≤K0\le K, claim 5 of Elementary Arithmetic in an Ordered Field gives K=K⋅1≤K⋅KK=K\cdot1\le K\cdot K. Hence BM−1≤∥x∥2BM^{-1}\le\lVert x\rVert^{2}, and multiplying by 0≤M0\le M (claim 5 of Elementary Arithmetic in an Ordered Field) gives B≤M∥x∥2B\le M\lVert x\rVert^{2}. Therefore VN(x)≥M∥x∥2+(M∥x∥2−B)≥M∥x∥2V_{N}(x)\ge M\lVert x\rVert^{2}+(M\lVert x\rVert^{2}-B)\ge M\lVert x\rVert^{2} by claim 3 of Elementary Arithmetic in an Ordered Field. So KK is a positive real with M∥x∥2≤VN(x)M\lVert x\rVert^{2}\le V_{N}(x) whenever K≤∥x∥K\le\lVert x\rVert, which is condition Confining Potentials on Euclidean Space §superquadratic for VNV_{N}.

Step 9 (Slope bound). By Confining Potentials on Euclidean Space §slope fix C∈RC\in\mathbb{R} with ∥DV(y)∥≤C(1+∣V(y)∣)\lVert DV(y)\rVert\le C(1+|V(y)|) for every y∈Rdy\in\mathbb{R}^{d}, and put A=Nˉ+2NˉmA=\bar{N}+2\bar{N}m and CN=∣C∣AC_{N}=|C|A. Fix xx and write gk=DV(pk(x))g_{k}=DV(\mathfrak{p}_{k}(x)), sk=∥gk∥s_{k}=\lVert g_{k}\rVert and S=∑k=1NskS=\sum_{k=1}^{N}s_{k}. By Step 4, DVN(x)=[g1,…,gN]DV_{N}(x)=[g_{1},\dots,g_{N}], whose kkth particle is gkg_{k} by Particle Blocks of the Configuration Space: Block Maps, Configurations, Product Maps and Diagonal Points §configuration, so Particle Blocks: Linearity, Splitting of Inner Products, Product Maps and Diagonal Shifts §inner-product gives ∥DVN(x)∥2=∑k=1Nsksk\lVert DV_{N}(x)\rVert^{2}=\sum_{k=1}^{N}s_{k}s_{k}. Each sks_{k} is nonnegative (claim 1 of Elementary Properties of the Euclidean Norm on Rn\mathbb{R}^n), so 0≤S0\le S and sk≤Ss_{k}\le S by claims 5 and 6 of Properties of Finite Sums, and sksk≤skSs_{k}s_{k}\le s_{k}S by claim 5 of Elementary Arithmetic in an Ordered Field; summing with claim 1 of Comparison and Absolute Value Bounds for Finite Sums of Real Numbers and claim 3 of Properties of Finite Sums gives ∥DVN(x)∥2≤S⋅S\lVert DV_{N}(x)\rVert^{2}\le S\cdot S, hence ∥DVN(x)∥≤S\lVert DV_{N}(x)\rVert\le S by claim 2 of Monotonicity of Squaring on the Nonnegative Elements of an Ordered Field. Next, 0≤1+∣V(pk(x))∣0\le1+|V(\mathfrak{p}_{k}(x))| by claims 1 and 2 of Elementary Arithmetic in an Ordered Field and claim 1 of Properties of the Absolute Value in an Ordered Field, and C≤∣C∣C\le|C| by claim 3 there, so claim 5 of Elementary Arithmetic in an Ordered Field gives sk≤∣C∣ (1+∣V(pk(x))∣)s_{k}\le|C|\,(1+|V(\mathfrak{p}_{k}(x))|). Summing, and using claims 2 and 3 of Properties of Finite Sums, (F1), (E) and 0≤∣C∣0\le|C|,

∥DVN(x)∥≤S≤∣C∣(Nˉ+∑k=1N∣V(pk(x))∣)≤∣C∣(A+∣VN(x)∣).\lVert DV_{N}(x)\rVert\le S\le|C|\Bigl(\bar{N}+\sum_{k=1}^{N}|V(\mathfrak{p}_{k}(x))|\Bigr)\le|C|\bigl(A+|V_{N}(x)|\bigr).

Since 1≤Nˉ≤A1\le\bar{N}\le A by (F2) and 0≤2Nˉm0\le2\bar{N}m, and 0≤∣VN(x)∣0\le|V_{N}(x)|, claim 5 of Elementary Arithmetic in an Ordered Field gives ∣VN(x)∣≤A ∣VN(x)∣|V_{N}(x)|\le A\,|V_{N}(x)|, so A+∣VN(x)∣≤A(1+∣VN(x)∣)A+|V_{N}(x)|\le A(1+|V_{N}(x)|) and ∥DVN(x)∥≤CN(1+∣VN(x)∣)\lVert DV_{N}(x)\rVert\le C_{N}(1+|V_{N}(x)|). This is condition Confining Potentials on Euclidean Space §slope for VNV_{N}, with the constant CNC_{N}.

Step 10 (Curvature). Let ε∈R\varepsilon\in\mathbb{R} be positive, choose CεC_{\varepsilon} for VV by Confining Potentials on Euclidean Space §curvature, and then put Cε′=2εNˉm+NˉCεC'_{\varepsilon}=2\varepsilon\bar{N}m+\bar{N}C_{\varepsilon}. For every xx, Step 5, claim 1 of Comparison and Absolute Value Bounds for Finite Sums of Real Numbers, claims 2 and 3 of Properties of Finite Sums, (F1), and (E) multiplied by 0≤ε0\le\varepsilon (claim 5 of Elementary Arithmetic in an Ordered Field) give

ΔVN(x)=∑k=1NΔV(pk(x))≤ε∑k=1N∣V(pk(x))∣+NˉCε≤ε∣VN(x)∣+Cε′.\Delta V_{N}(x)=\sum_{k=1}^{N}\Delta V(\mathfrak{p}_{k}(x))\le\varepsilon\sum_{k=1}^{N}|V(\mathfrak{p}_{k}(x))|+\bar{N}C_{\varepsilon}\le\varepsilon|V_{N}(x)|+C'_{\varepsilon}.

This is condition Confining Potentials on Euclidean Space §curvature for VNV_{N}.

Step 11 (Conclusion). By Steps 3 and 6, VNV_{N} is of class C2C^{2} and convex on RdN\mathbb{R}^{dN}, and by Steps 8, 9 and 10 it satisfies conditions (a), (b) and (c) of Confining Potentials on Euclidean Space §confining in dimension dNdN, its gradient and Laplacian being those computed in Steps 4 and 5. Hence VNV_{N} is a confining potential on RdN\mathbb{R}^{dN}, which is The N-Particle Potential of a Confining Potential is a Confining Potential on the Configuration Space §confining.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites

Comments

Loading…