This paper determines the unique set of vectors that minimizes the $p$-frame potential for $N=d+1$ and $p$ in (0,2), confirming a previous conjecture and solving the minimization problem in this case.
Contribution
It establishes the unique minimizer of the $p$-frame potential for $N=d+1$ and $p$ in (0,2), confirming a conjecture and completing the minimization analysis for this scenario.
Findings
01
Identifies the unique minimizer of the $p$-frame potential for $N=d+1$ and $p$ in (0,2).
02
Confirms a conjecture by Chen et al. regarding the minimization problem.
03
Provides a complete solution to the minimization problem in the specified case.
Abstract
For any positive real number p, the p-frame potential of N unit vectors X:={x1,…,xN}⊂Rd is defined as FPp,N,d(X)=∑i=j∣⟨xi,xj⟩∣p. In this paper, we focus on the special case N=d+1 and establish the unique minimizer of FPp,d+1,d for p∈(0,2). Our results completely solve the minimization problem of p-frame potential when N=d+1, which confirms a conjecture posed by Chen, Gonzales, Goodman, Kang and Okoudjou.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
The Minimizers of the p-frame potential
Zhiqiang Xu
LSEC, Inst. Comp. Math., Academy of
Mathematics and System Science, Chinese Academy of Sciences, Beijing, 100091, China
School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China
For any positive real number p, the p-frame potential of N
unit vectors X:={x1,…,xN}⊂Rd is defined as
FPp,N,d(X)=∑i=j∣⟨xi,xj⟩∣p. In this paper,
we focus on this quantity for N=d+1 points and establish uniqueness of minimizers of FPp,d+1,d for all p∈(0,2). Our results completely solve the minimization problem
of the p-frame potential when N=d+1, confirming a conjecture posed
by Chen, Gonzales, Goodman, Kang and Okoudjou [4].
Key words and phrases:
Frame potential, Tight frames, Spherical designs
The project was supported by NSFC grant (91630203, 11688101),
Beijing Natural Science Foundation (Z180002).
1. Introduction
1.1. The p-frame potential
Minimal potential energy problems have been actively discussed over the last decades in connection with applications in physics, signal analysis and numerical integration. Generally, one aims to find distributions of N points on the unit sphere which minimize the potential energy over all sized N configurations [18, 5, 2].
One of the most interesting potential energies is the p-frame potential. Assume that X:={xi}i=1N where xi∈Rd with ∥xi∥2=1,i=1,…,N.
For p>0, the value
[TABLE]
is called the p*-frame potential * of X (see [7, 4]). The minimization problem of the p-frame potential is to solve
[TABLE]
where
S(N,d)
denotes all sets of N unit-norm vectors in Rd. This problem actually has a long history and has attracted much attention.
For N≤d, the set of N orthogonal vectors in Rd is always the minimizer of (2) for any positive p and hence we only consider the case where N≥d+1. We also note that the value of FPp,N,d(X) does not change if we replace xi by ciUxi for each i∈{1,2,⋯,N}, where U is an orthogonal matrix and ci∈{1,−1}. Thus, for convenience we say the minimizer of (2) is unique if the solution to
(2) is unique up to a common orthogonal transformation and a real unimodular constant for each vector.
1.2. Related work
There are many results which presented a lower bound of FPp,N,d(X).
When p=2k∈2Z+, the following bound
[TABLE]
was presented by Sidelnikov in [17]. The equality in (3) holds precisely
when X∪−X is a spherical 2k-design, see [11, 17]. The set X={xi}i=1N attaining the bound in (3) can also be identified as a projective k-design since we consider xi and −xi as the same point (see [12] for the definition of projective designs).
For the special case k=1, i.e. p=2, the minimizers of the 2-frame
potential are projective 1-designs [11, 17]. Noting the fact that
finite unit-norm tight frames (FUNTFs) are in one-to-one correspondence with
projective 1-designs [6], we know that the equality in (3) holds
for k=1 and all N≥d as long as X is a FUNTF (see also [1]).
However, when k>1, the bound in (3) is not tight for small N since the
existence of spherical designs requires N to be large enough [6].
For any p>2, Ehler and Okoudjou provided another bound in [7]:
[TABLE]
where equality holds if and only if X is an equiangular tight frame (ETF) in Rd
[8, 13]. We take N=d+1 as an example. Since there always exist d+1
unit vectors in Rd forming an ETF [8, 15], namely the regular simplex
of size d+1, the set of these vectors uniquely minimizes the p-frame potential for
p>2.
When p∈(0,2), not much is known about minimizers of this value except in a few special cases. In [7], Ehler and Okoudjou solved the simplest case where d=2 and N=3 and also proved that the minimizer of the p-frame potential is exactly n copies of an orthonormal basis if N=nd where n is a positive integer. In [9], Glazyrin provided a lower bound for any 1≤p≤2:
[TABLE]
but the condition under which equality holds is strict.
In [4], Chen, Gonzales, Goodman, Kang and Okoudjou considered this special
case where N=d+1. Particularly, [4] showed through numerical experiments
that the sets Lkd, which they call lifted ETFs, seem to be minimizers of the
p-frame potential for certain k depending on p. Here,
Lkd={x1,…,xd+1}⊂Rd is defined as a set of d+1 unit vectors in Rd satisfying
[TABLE]
Note that {xi}i=1k+1⊂Lkd actually forms an ETF in some subspace W⊂Rd with dimension k and the rest of d−k vectors form an orthonormal basis in the orthogonal complement of W.
More precisely, the following conjecture is proposed in [4]:
Conjecture 1.1**.**
Suppose d≥2. Set p0:=0, pd:=2 and pk:=ln(k+1)−ln(k)ln(k+2)−ln(k) for each k∈{1,2,…,d−1}. Then, when p∈(pk−1,pk], k=1,2,…,d, the set Lkd minimizes the p-frame potential when N=d+1.
The cases d=2 and p=2 for Conjecture 1.1 are already solved in [7] and [1], respectively.
The first new result for Conjecture 1.1 was obtained by
Glazyrin in [10] who showed that an orthonormal basis in Rd plus a repeated vector minimizes
FPp,d+1,d(X)
for any p∈(0,2(ln2ln3−1)]. Combining Glazyrin’s result with the previous ones, the minimizer of FPp,d+1,d(X) is only known for p∈(0,2(ln2ln3−1)]∪[2,∞).
Recently, Park extented Glazyrin’s result to the case N=d+m where 1≤m<d, and showed that an orthonormal basis plus m repeated vectors is the minimizer for any p∈[1,2ln(m+1)−ln(m)ln(2m+1)−ln(2m)] (see [16]). But Conjecture 1.1 remains open when d>2.
1.3. Our contributions
The aim of this paper is to confirm Conjecture 1.1 and to show that the minimizers are unique provided p=pk.
Our main result is the following theorem which completely solves the minimal p-frame potential problem for the case where N=d+1.
Theorem 1.2**.**
Let d≥2 be an integer. Set p0:=0, pd:=2 and pk:=ln(k+1)−ln(k)ln(k+2)−ln(k) for each k∈{1,2,…,d−1}. Assume that p∈(0,2) is a real number. Let X={x1,…,xN} be a set of N unit vectors in Rd, where N=d+1.
(i)
For p∈(pk−1,pk),k=1,2,…,d, and for any X∈S(d+1,d) we have
FPp,d+1,d(X)≥(k+1)k1−p
and equality holds if and only if X=Lkd.
2. (ii)
For p=pk,k=1,…,d−1,
and for any X∈S(d+1,d) we have
FPp,d+1,d(X)≥(k+1)k1−pk
and equality holds if and only if
X=Lkd or X=Lk+1d.
Based on the previous results and Theorem 1.2 in this paper, in Table 1.3, we list optima for the minimal p-frame potential problem when N=d+1. Note that 2(ln2ln3−1)≈1.16993 and ln2ln3≈1.58496.
Hence, (0,2(ln2ln3−1)] is a subinterval in (0,ln2ln3).
In Table 1.3, we also use the fact that L1d is essentially an orthonormal basis plus a repeated vector and Ldd forms an ETF in Rd.
1.4. Organization
The paper is organized as follows. In Section 2, we prove Theorem 1.2 based on Lemma 2.1. The proof of Lemma 2.1 is presented in Section 3.
2. Proof of Theorem 1.2
In this section we present a proof of Theorem 1.2. The following lemma plays a key role in our proof of Theorem 1.2. We postpone its proof to Section 3.
To this end, we set
[TABLE]
where α>1.
We consider
[TABLE]
where α>1.
Noting that Mα,d+1(z1,…,zd+1) is a symmetric function on d+1 variables z1,…,zd+1, we identify solutions to (7) only up to permutations of zi.
Lemma 2.1**.**
Suppose that d≥1 is an integer.
Set
[TABLE]
(i)
If α∈(ak,ak−1) then the unique solution to (7)
is k+1k+11,…,k+11,d−k0,…,0 where k=1,2,…,d.
2. (ii)
Assume that α=ak where k=1,…,d−1. Then (7) has exactly two solutions:
k+1k+11,…,k+11,d−k0,…,0 and
k+2k+21,…,k+21,d−k−10,…,0.
We next state a proof of Theorem 1.2. Our method of estimating the p-frame
potential in this proof is motivated by the work of Bukh and Cox [3]. For a
finite set X={xi}i=1N∈S(N,d), Bukh and Cox derived a new lower bound
on μ(X):=j=lmax∣⟨xj,xl⟩∣ with the help of
an orthonormal basis in the null space of the Gram matrix of X (see also [14]). We borrow their
idea of considering the null space of the Gram matrix of X. Noting the
corresponding null space in our case is a one-dimensional subspace in RN, we pick
a unit vector y in this subspace, showing that we can use the coordinates of
y to provide an estimation on the value of FPp,d+1,d(X).
(i)
Note that
FPp,d+1,d(Lkd)=(k+1)k1−p.
To this end, it is enough to show that
FPp,d+1,d(X)≥(k+1)k1−p
when p∈(pk−1,pk) and Lkd is the unique minimizer for each k∈{1,2,…,d}.
Recall that X={xi}i=1d+1⊂Rd is a set of d+1 unit-norm vectors. Set
[TABLE]
Note that rank(G)≤d. Thus, there exists a unit vector y=(y1,…,yd+1)T∈Rd+1 such that Gy=0. We compute the value of (i,i)-entry of the matrix GyyT and obtain
[TABLE]
which implies
[TABLE]
Summing up the above inequality from 1 to d+1, we obtain
[TABLE]
We next present a proof for (i)
with dividing the proof into two cases:
Case 1: p∈(0,1].
Note that (0,1]⊂(p0,p1). It is enough to prove that the unique solution to
X∈S(d+1,d)argminFPp,d+1,d(X)
is X=L1d for any p∈(0,1].
We first consider the case where p=1.
Since
[TABLE]
we obtain
[TABLE]
which implies
[TABLE]
The equality in (9) holds if and only if there exist i1,i2∈{1,2,…,d+1} with i1=i2 such that ∣⟨xi1,xi2⟩∣=1 and the remaining terms in the sum i=1∑d+1j=i∑∣⟨xi,xj⟩∣ are all zero. We arrive at the conclusion.
We next turn to the case p∈(0,1). Noting ∣⟨xi,xj⟩∣≤1, we have
[TABLE]
for any p∈(0,1).
Thus,
[TABLE]
The equality holds if and only if ∣⟨xi,xj⟩∣=0 or 1 for any distinct i,j. Thus, the minimizer of 1-frame potential is also the unique minimizer of p-frame potential for any p∈(0,1).
Case 2: 1<p<2.
For 1<p<2, we use Ho¨lder’s inequality to obtain
[TABLE]
where q>2 satisfies p1+q1=1. The second equality in (11) holds if and only if there exists a constant c∈R such that
Let α=2q and zi=∣yi∣2 for i=1,2,…,d+1. Then we
can rewrite the inequality in (13) as
[TABLE]
where Mα,d+1(z1,…,zd+1)=i=1∑d+1j=i∑ziαzjα, z1+⋯+zd+1=1,zi≥0,i=1,…,d+1.
Note that α=2q=21+21p−11. If p∈(pk−1,pk)∩(1,2) where k∈{1,…,d}, then α∈(ak,ak−1). Here, ak is defined in (8). According to Lemma 2.1, Mα,d+1(z1,…,zd+1) attains its maximum, k(k+1)1−2α, only when zi=k+11 for i=1,…,k+1 and zi=0 for i≥k+2. Thus, we obtain
[TABLE]
when p∈(pk−1,pk)∩(1,2), k=1,…,d. Combining with equation (12), the equality in (15) holds if and only if
for i=j
[TABLE]
which implies that X=Lkd.
Combining the analysis in Case 1, we arrive at the conclusion (i) for Theorem 1.2.
(ii) Note that
FPp,d+1,d(Lkd)=FPp,d+1,d(Lk+1d)=(k+1)k1−p
when p=pk, k=1,2,…,d−1. To this end, it is enough to prove that FPpk,d+1,d(X)≥(k+1)k1−pk and that the minimizers are Lkd and Lk+1d. Since pk∈(1,2) for each k∈{1,2,…,d−1}, we follow our analysis for the proof of (i).
If p=pk where k∈{1,…,d−1}, then α in (14) is equal to ak. According to Lemma 2.1, Mak,d+1(z1,…,zd+1) attains its maximum, which is k(k+1)1−2ak, at exactly two points:
k+1k+11,…,k+11,d−k0,…,0 and
k+2k+21,…,k+21,d−k−10,…,0. Thus, we obtain
[TABLE]
for k=1,2,…,d−1.
According to (12), the equality in (17) holds if and only if X=Lkd or Lk+1d, which implies the conclusion (ii).
∎
Remark 2.2**.**
For convenience, we state Theorem 1.2 and its proof for the real case.
In fact, it is easy to extend the result in Theorem 1.2 to complex case.
Moreover, the method which is employed to prove Theorem 1.2 can be used to estimate the matrix potential, i.e. i=j∑∣Ai,j∣p, where Ai,j is the (i,j)-entry of any matrix A∈C(d+1)×(d+1) whose rank is d and diagonal elements are equal to 1 (see [10]).
3. Proof of Lemma 2.1
In this section we present the proof of Lemma 2.1.
We begin with introducing the following lemma, which portrays the main feature of local extrema for (7).
For convenience, we set
[TABLE]
where s:=d+1−m11−m1t,m1∈[1,2d+1]∩Z.
Lemma 3.1**.**
Assume that (w1,…,wd+1) is a local maxima of Mα,d+1(z1,…,zd+1) subject to the constraints in (7) and wi>0 for each i∈{1,2,…,d+1}. Then
(i)
The maxima (w1,…,wd+1) is in the form
m1t0,…,t0,d+1−m1s0,…,s0 up to a permutation where m1∈[1,2d+1]∩Z,t0∈(0,m11) and s0=d+1−m11−m1t0.
2. (ii)
The value t0 is a local maxima of fm1,α,d+1(t).
Proof.
(i) We claim that w1,…,wd+1 can take at most two different values. Note that
Mα,d+1(z1,…,zd+1) is a symmetric function on z1,…,zd+1. Hence, up to a permutation, we can write (w1,…,wd+1) as m1t0,…,t0,d+1−m1s0,…,s0 for some t0∈(0,m11) and s0=d+1−m11−m1t0. It remains to prove the claim.
Set r0(z1,…,zd+1):=z1+⋯+zd+1−1 and
[TABLE]
Since (w1,…,wd+1) is a local extreme point, according to KKT conditions, there exist constants λ and μi,i=1,2,…,d+1, which are called KKT multipliers, such that the followings hold:
[TABLE]
Combining wi>0 and (19d), we can obtain μi=0,i=1,2,…,d+1.
Substituting μi=0 into (19a), we obtain
[TABLE]
which implies that λ>0 and
[TABLE]
Hence, we obtain
[TABLE]
where f(x):=xα+2αλ⋅xα−11.
Set w0:=(2α2α−1⋅λ)2α−11.
Noting that f′(x)=αxα−1−2αλ(α−1)x−α,
we obtain that f′(x)<0,x∈(0,w0), f′(w0)=0 and f′(x)>0,x∈(w0,∞),
which implies that, for any c∈R, the cardinality of the set {x:f(x)=c,x>0} is less than or equal to 2 .
Hence, equation (21) implies that w1,…,wd+1 can take at most two different values.
(ii) Combining
[TABLE]
with m1t0,…,t0,d+1−m1s0,…,s0 being a local maxima of Mα,d+1m1t,…,t,d+1−m1s,…,s, we obtain the conclusion immediately.
∎
Lemma 3.2**.**
Let m1∈[1,2d+1]∩Z and m2=d+1−m1 where d≥2 is an integer. Set
[TABLE]
where α>1. We use h′(x) to denote the derivative with respect to x of
h(x).
Then
(i)
The function h′(x) has at most two zeros on (0,∞), and hence h(x) has at most two extreme points on (0,∞);
2. (ii)
If α<1+d−11, then there exist x^1∈(0,1), x^2∈(1,∞) such that h′(x)>0 for x∈(0,x^1)∪(x^2,∞) and h′(x)<0 for x∈(x^1,x^2);
3. (iii)
If α≥1+d−11, then h(x) is positive and monotonically increasing on (1,∞);
4. (iv)
If α=1+d−11 and m1=2d+1, then h(x) is monotonically increasing on (0,∞);
5. (v)
If α=1+d−11 and m1<2d+1, then there exists x^3∈(0,1) such that h′(x)>0 for x∈(0,x^3)∪(1,∞) and h′(x)<0 for x∈(x^3,1).
Proof.
We split the proof, proving each claim separately.
(i) By computation, we have
[TABLE]
where h1(x)=(4α−2)⋅(m2−1)x2α−2α⋅m2⋅x2+(2α−2)⋅m1.
Set
[TABLE]
Noting that h1′(x)<0,x∈(0,x0), h1′(x)>0,x∈(x0,∞) and h1′(x0)=0, h1(x)=0 has at most two distinct solutions on (0,∞). According to (22), h′(x)=0 also has at most two distinct solutions on (0,∞), which implies the conclusion.
(ii) When α<1+d−11, we obtain h1(1)=2α(d−1)−2d<0. Then we have
[TABLE]
Observing that m2>1 and α>1, we obtain
[TABLE]
[TABLE]
Thus, combining (24), (25) and (26), we obtain that h1(x)=0 has exactly two solutions x^1, x^2, where x^1∈(0,1), x^2∈(1,∞). By the monotonicity of h1(x), we also know that h1(x)<0, x∈(x^1,x^2) and h1(x)>0, x∈(0,x^1)∪(x^2,∞). According to (22), we obtain that h′(x)<0, x∈(x^1,x^2) and h′(x)>0, x∈(0,x^1)∪(x^2,∞).
(iii)
Note that
[TABLE]
where we use m2=d+1−m1≥2d+1 and α≥1+d−11.
So the function h1(x) is monotonically increasing when x>1. Noting that h1(1)=2α(d−1)−2d≥0, we have h1(x)>0 on (1,∞), which implies that h(x) is monotonically increasing on (1,∞). Since h(1)=0, we conclude that h(x)>0 when x>1.
(iv)
When α=1+d−11 and m1=2d+1, we have h1(1)=0 and x0=1 from (23), which implies that h1(x0)=0. Since x0 is the minimum point of h1(x), we obtain h1(x)≥0 on (0,∞). Finally, from (22) we see that h′(x)≥0 on (0,∞), which implies the conclusion.
(v)
Noting that x0=1 provided α=1+d−11 and m1<2d+1, we have
[TABLE]
Since α=1+d−11, from (iii) we have that h(x) is monotonically increasing on (1,∞). Noting that (25) and (26) also hold for α=1+d−11, we conclude that h1(x)=0 has exactly two solutions x^3 and 1, where x^3∈(0,1). From (22), we obtain that h′(x)<0, for x∈(x^3,1) and h′(x)>0, for x∈(0,x^3)∪(1,∞).
∎
We next study the local maxima of fm1,α,d+1(t) for each m1∈[1,2d+1]∩Z and α∈(1,1+d−11]. The following lemma shows that if 1<α≤1+d−11, then fm1,α,d+1(t) attains a local maximum at t0 only if t0∈{0,d+11,m11}.
Lemma 3.3**.**
Assume d≥2 is an integer and m1∈[1,2d+1]∩Z.
(i)
Assume that 1<α<1+d−11, t0∈[0,m11]
and fm1,α,d+1(t) has a local maximum at t0. Then
t0∈{0,d+11,m11}.
2. (ii)
Assume that α=1+d−11, t0∈[0,m11]
and fm1,α,d+1(t) has a local maximum at t0. Then
t0∈{0,m11}.
Proof.
For convenience, let m2:=d+1−m1>1. Recall that
[TABLE]
where s=m21−m1⋅t. Noting that t,s≥0 and m1⋅t+m2⋅s=1, we can set t=m1cos2θ, s=m2sin2θ, where θ∈[0,2π]. We use the substitution t=m1cos2θ,s=m2sin2θ to transform the function from fm1,α,d+1(t) to
[TABLE]
To this end, it is enough to study the local maxima of g on [0,2π].
A simple calculation shows that
[TABLE]
We can rewrite g′(θ) as
[TABLE]
where v:=ts=m2m1⋅cosθsinθ and h(v):=(m2−1)v4α−2−m2⋅v2α+m1⋅v2α−2−(m1−1).
Particularly, when θ=θ∗:=arctan(m1m2), we have v=m2m1⋅cosθ∗sinθ∗=1.
Noting that α>1, m1≥1 and m2>1, we obtain
[TABLE]
Since 4α⋅m12αm1⋅(cosθ)4α−1sinθ is positive for any θ∈(0,2π), to study the monotonicity of g(θ),
it is enough to consider the sign of h(v) with v>0.
(i)
First we consider the case 1<α<1+d−11.
Lemma 3.2 shows that there exists v^1∈(0,1) and v^2∈(1,∞) such that
h′(v)>0 for v∈(0,v^1)∪(v^2,∞) and h′(v)<0 for v∈(v^1,v^2).
Noting that h(1)=0 and v^1<1<v^2, we obtain that h(v^1)>0 and h(v^2)<0.
Combining Lemma 3.2 and the results above, we obtain that h(v)=0 has exactly one solution on [0,v^1) , say v1. Similarly, h(v)=0 also has exactly one solution on (v^2,∞), say v2. Let θ1:=arctan(v1m1m2) and θ2:=arctan(v2m1m2).
If m1=1, then we have h(0)=0 and hence v1=0. From the monotonicity of h(v), we obtain that h(v)<0, v∈(1,v2), h(v)>0, v∈(0,1)∪(v2,∞) and h(v)=0, v∈{0,1,v2}. Then from (31) it is easy to check that g′(θ)<0, θ∈(θ∗,θ2), g′(θ)>0, θ∈(0,θ∗)∪(θ2,2π) and g′(θ)=0, θ∈{0,θ∗,θ2,2π}, which implies g(θ) has only two local maxima: θ∗ and 2π.
If m1>1, then h(0)<0, which means v1∈(0,v^1). Thus, by the monotonicity of h(v) we conclude that h(v)<0, v∈(0,v1)∪(1,v2), h(v)>0, v∈(v1,1)∪(v2,∞) and h(v)=0, v∈{v1,1,v2}.
We can use (31) to transform these results to g′(θ).
Hence, we obtain that g′(θ)<0, θ∈(0,θ1)∪(θ∗,θ2), g′(θ)>0, θ∈(θ1,θ∗)∪(θ2,2π) and g′(θ)=0, θ∈{0,θ1,θ∗,θ2,2π}, which implies g(θ) has only three local maxima: 0, θ∗ and 2π.
(ii)
We next consider the case where α=1+d−11. We divided the proof into two cases.
Case 1: m1=2d+1 .
Lemma 3.2 implies that h(v) is monotonically increasing on (0,∞). Noting that h(0)=−(m1−1)<0 and h(1)=0, we have h(v)<0, v∈(0,1) and h(v)>0, v∈(1,∞). We use (31) to transform the result to g′(θ) and obtain that g′(θ)<0, θ∈(0,θ∗), g′(θ)>0, θ∈(θ∗,2π) and g′(θ)=0, θ∈{0,θ∗,2π}, which implies g(θ) has only two local maxima: 0 and 2π.
Case 2: m1<2d+1 .
According to Lemma 3.2, there exists v^3∈(0,1) such that h′(v)>0 for v∈(0,v^3)∪(1,∞) and h′(v)<0 for v∈(v^3,1).
If m1=1, then h(0)=h(1)=0. According to the sign of h′(v), we obtain that h(v)≥0, v∈[0,∞). Equation (31) implies that g′(θ) is always non-negative on [0,2π], which means 2π is the only local maxima of g(θ).
If 1<m1<2d+1, then h(0)<0. So there exists v3∈(0,v^3) such that h(v)<0, v∈(0,v3) and h(v)≥0, v∈[v3,∞). Set θ3:=arctan(v3m1m2). According to (31), we have g′(θ)<0, θ∈(0,θ3), g′(θ)>0, θ∈(θ3,2π) and g′(θ)=0, θ∈{0,θ3,2π}, which implies g(θ) has only two local maxima: 0 and 2π.
∎
Remark 3.4**.**
When 1<α≤1+d−11, combining Lemma 3.1 and Lemma 3.3, we obtain that (d+11,…,d+11) is the only local maxima of Mα,d+1(z1,…,zd+1) with the constraints z1+⋯+zd+1=1 and zi>0, i=1,2,…,d+1.
We deal with the case α>1+d−11 in the next lemma.
Lemma 3.5**.**
Assume that α>1+d−11 and d≥2. Assume that (w1,w2,…,wd+1) is a local maxima of Mα,d+1(z1,…,zd+1) with the constraints in (7).
Then there exists k0∈{1,…,d+1} such that wk0=0.
Proof.
We proceed by contradiction, supposing that wi>0 for i∈{1,…,d+1}.
According to Lemma 3.1, (w1,…,wd+1) is in the form
m1t0,…,t0,d+1−m1s0,…,s0 up to a permutation where m1∈[1,2d+1]∩Z, t0∈(0,m11) and s0=d+1−m11−m1t0.
Lemma 3.1 also implies that t0 is a local maxima of fm1,α,d+1(t). So, it is enough to show the following claim:
Claim 1: When α>1+d−11, if t0∈(0,m11) is a local maxima
of fm1,α,d+1(t), then m1t0,…,t0,d+1−m1s0,…,s0 is not a local maxima of Mα,d+1(z1,…,zd+1) with the constraints in (7).
Claim 1 contradicts m1t0,…,t0,d+1−m1s0,…,s0 being a local maxima of Mα,d+1(z1,…,zd+1) with the constraints in (7). Hence, there exists k0∈{1,…,d+1} such that wk0=0.
It remains to prove Claim 1.
For convenience, set m2:=d+1−m1. Since m1≤2d+1 and d≥2, we have m2≥2.
Set
[TABLE]
where l=m2−1 and ε∈(−ls0,s0). We aim to show that ε=0 is not a local maxima of F(ε). In fact, we can prove this by showing that ε=0 is a local minima of F(ε).
A simple calculation shows that
[TABLE]
Noting l=m2−1, we can check that
[TABLE]
We claim F′′(0)>0 and hence ε=0 is a local minima of F(ε).
It remains finally to prove F′′(0)>0.
Note that
[TABLE]
Since t0∈/{0,m11} is a local maxima of fm1,α,d+1(t), from equation (31) we know that t0s0 is a root of h(v)=0, where h(v)=(m2−1)v4α−2−m2⋅v2α+m1⋅v2α−2−(m1−1).
According to Lemma 3.2, h(v)>0 for v>1 provided α≥1+d−11, which
implies that t0s0≤1 and hence s0≤t0. Combining s0>0 and l2+m2−1≥2, we have
We prove Lemma 2.1 by induction on d. First, we consider the case d=1. For d=1, we have only two non-negative variables z1,z2 which satisfy z1+z2=1. For any α>1 we have
[TABLE]
where equality holds if and only if z1=z2=21. Hence, the solution to (7) is (21,21) which implies Lemma 2.1 holds for d=1. We assume that Lemma 2.1 holds for d=d0−1 and hence we know the solution to (7)
for d=d0−1. So, we consider the case where d=d0.
Assume that (w1,…,wd0+1) is a solution to (7) with d=d0. Recall that
a0=∞, ad0=1, ak=21⋅ln(k+2)−ln(k+1)ln(k+2)−ln(k), k=1,2,…,d0−1. For convenience, we set
ek+1:=(k+11,…,k+11)∈Rk+1 and 0d0−k:=(0,…,0)∈Rd0−k.
We also set
[TABLE]
We first show
[TABLE]
dividing the proof into two cases.
Case 1: α∈(1+d0−11,∞) .
According to Lemma 3.5, at least one of the entries in (w1,…,wd0+1) is 0. Without loss of generality, we assume wd0+1=0. Since Mα,d0+1(w1,…,wd0,0)=Mα,d0(w1,…,wd0), (w1,…,wd0) is the solution to (7) with d=d0−1. Hence, by induction we conclude that (35) holds.
Case 2: α∈(1,1+d0−11].
If one of entries in (w1,…,wd0+1) is 0, we can show that
(35) holds using a similar argument as above.
So, we consider the case where wi>0 for each i∈{1,…,d0+1}. Lemma 3.1 shows that
(w1,…,wd0+1) is in the form m1t0,…,t0,d0+1−m1s0,…,s0 up to a permutation where m1∈[1,2d0+1]∩Z, t0∈(0,m11) and s0=d0+1−m11−m1t0
. Lemma 3.1 also implies that t0 is a local maxima of the function fm1,α,d0+1(t), where fm1,α,d0+1(t) is defined in (18). According to Lemma 3.3, we obtain t0=d0+11. Hence (w1,…,wd0+1)=(d0+11,…,d0+11) , which implies (35).
It is now enough to compare the values among
Mα,d0+1(ek+1,0d0−k),k=1,…,d0.
Setting H(x):=x1−2α(x−1), we obtain Mα,d0+1(ek+1,0d0−k)=H(k+1) for each k∈{1,2,…,d0}. A simple calculation shows that H(x) is monotonically increasing on (0,1+2α−21) and monotonically decreasing on (1+2α−21,∞). Hence, the sequence
H(k+1),k=1,…,d0, is unimodal.
(i) Firstly, we consider the case where α∈(ak,ak−1), k=1,2,…,d0−1.
Noting that H(k)<H(k+1) and H(k+1)>H(k+2), we obtain
[TABLE]
where equality holds if and only if x=k. For the case α∈(ad0,ad0−1), noting that H(d0)<H(d0+1), we obtain
[TABLE]
To summarize,
(ek+1,0d0−k)
is the unique solution to (7) with d=d0 when α∈(ak,ak−1), k=1,2,…,d0.
(ii) It remains finally to check the case where α=ak, k=1,2,…,d0−1.
Noting H(k+1)=H(k+2), H(k)<H(k+1) and H(k+2)>H(k+3) provided α=ak,k=1,2,…,d0−2,
we obtain that (7) has two solutions which are
(ek+2,0d0−k−1) and (ek+1,0d0−k) with d=d0 .
When α=ad0−1, noting H(d0)=H(d0+1) and H(d0−1)<H(d0), we obtain that (7) also has two solutions which are
ed0+1 and (ed0,01) with d=d0 .
Hence, the conclusion also holds for d=d0 which completes the proof.
∎
Acknowledgement. We would like to thank the anonymous reviewers for their
comments which help improve this paper substantially.
Bibliography18
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] J. J. Benedetto and M. Fickus, Finite normalized tight frames. Adv. Comp. Math. 18 (2003), 357-385.
2[2] S. V. Borodachov, D. P. Hardin, A. Reznikov and E. B. Saff, Optimal discrete measures for Riesz potentials. In Trans. Amer. Math. Soc. 370 (2018), 6973-6993 .
3[3] B. Bukh and C. Cox, Nearly orthogonal vectors and small antipodal spherical codes. Ar Xiv preprint (2018), ar Xiv:1803.02949.
4[4] X. Chen, V. Gonzales, E. Goodman, S. Kang and K. Okoudjou, Universal Optimal Configurations for the p-Frame Potentials. Adv. Comput. Math. 46, 4 (2020). https://doi.org/10.1007/s 10444-020-09745-7.
5[5] H. Cohn, A. Kumar, Universally optimal distribution of points on spheres. J. Amer. Math. Soc. 20 (2007), 99-148.
6[6] P. Delsarte, J. M. Goethals, and J. J. Seidel, Spherical codes and designs. Geometriae Dedicata 6 (1977), 363-388.
7[7] M. Ehler and K. A. Okoudjou, Minimization of the probabilistic p-frame potential . J. Statist. Plann. Inference. 142 (2012), 645-659.
8[8] M. Fickus, D. G. Mixon, Tables of the existence of equiangular tight frames. Ar Xiv preprint (2015), ar Xiv:1504.00253.