Answer: Sum of Squares Under a Linear Constraint
Key Idea / Intuition
The sum of squares can be made arbitrarily small by spreading the total weight A over many terms (like equal slices), but it can never reach zero since all xjโ>0. On the upper end, concentrating nearly all weight in a single term pushes โxj2โ close to A2, but strict positivity prevents it from actually reaching A2. So the answer is the open interval (0,A2).
Formal Proof / Solution
Step 1: Upper bound โ โxj2โ<A2.
By the CauchyโSchwarz inequality (or simply because all xjโ>0 and their sum is A):
โj=0โโxj2โโค(โj=0โโxjโ)2=A2
is not the right bound here. Let's think more carefully.
Since all xjโ>0 and โxjโ=A, we have xjโ<A for every j. Therefore:
โj=0โโxj2โ=โj=0โโxjโโ
xjโ<โj=0โโxjโโ
A=Aโ
A=A2.
So โxj2โ<A2.
Step 2: Approaching A2 โ the upper bound is tight.
Let x0โ=Aโฯตโ
โj=1โโrj and distribute the remaining weight ฯต-small pieces geometrically. More directly: take
x0โ=A(1โฯต),xjโ=Aฯตโ
2โjย forย jโฅ1,
so that โxjโ=A(1โฯต)+Aฯต=A. Then:
โxj2โ=A2(1โฯต)2+A2ฯต2โj=1โโ4โj=A2(1โฯต)2+3A2ฯต2โ.
As ฯตโ0+, this approaches A2. So A2 is a supremum but is not achieved.
Step 3: Lower bound โ โxj2โ>0.
Since each xjโ>0, clearly โxj2โ>0.
Step 4: Approaching 0 โ the lower bound is tight.
Take xjโ=nAโโ
1j<nโ for large n (i.e., equal weights on the first n terms, tiny positive values for the rest โ but we need all xjโ>0).
More carefully: take xjโ=cโ
rj for 0<r<1, so โxjโ=1โrcโ=A, meaning c=A(1โr). Then:
โxj2โ=c2โr2j=1โr2c2โ=1โr2A2(1โr)2โ=1+rA2(1โr)โ.
As rโ1โ, this approaches 0. So 0 is an infimum but is not achieved.
Step 5: All values in (0,A2) are achieved.
The function rโฆ1+rA2(1โr)โ is continuous and maps (0,1) onto (0,A2) (it equals A2/3 at r=1/2, etc.). By the intermediate value theorem, every value in (0,A2) is achieved.
Conclusion:
The set of possible values of j=0โโโxj2โ is exactly the open interval
(0,A2)โ.