Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Projection and color-moment construction


This proves L153. Write N=(2kk)N=\binom{2k}k, p=k+1p=k+1, and let JVJ_V be the NN by NN all-ones matrix. Let DD be the inclusion matrix from kk-sets to (k−1)(k-1)-sets, so (Dh)(T)=∑C⊃Th(C)(Dh)(T)=\sum_{C\supset T}h(C). Define

E(B,C)=(−1)∣B∩C∣p(k∣B∩C∣).E(B,C)=\frac{(-1)^{|B\cap C|}}{p\binom{k}{|B\cap C|}}.

We first prove that EE is the orthogonal projection onto ker⁡D\ker D. Fix BB and a (k−1)(k-1)-set TT, and set s=∣B∩T∣s=|B\cap T|. There are k−sk-s extensions of TT whose intersection with BB has size s+1s+1 and s+1s+1 whose intersection has size ss. Hence the corresponding column sum is zero, because

(k−s)(−1)s+1(ks+1)+(s+1)(−1)s(ks)=0.\frac{(k-s)(-1)^{s+1}}{\binom{k}{s+1}} +\frac{(s+1)(-1)^s}{\binom{k}s}=0.

Thus the range of EE lies in ker⁡D\ker D. For h∈ker⁡Dh\in\ker D, repeated downward summation gives ∑C⊇Th(C)=0\sum_{C\supseteq T}h(C)=0 for every ∣T∣<k|T|<k: each downward step counts each extension a fixed positive number of times. Fix BB and put hs=∑∣B∩C∣=sh(C)h_s=\sum_{|B\cap C|=s}h(C). Summing those identities over the jj-subsets of BB gives

∑s=0k(sj)hs=0(j<k),hk=h(B).\sum_{s=0}^k\binom sjh_s=0\quad(j<k),\qquad h_k=h(B).

Binomial inversion therefore gives hs=(−1)k−s(ks)h(B)h_s=(-1)^{k-s}\binom ks h(B). Since kk is even,

(Eh)(B)=1p∑s=0k(−1)shs(ks)=k+1ph(B)=h(B).(Eh)(B)=\frac1p\sum_{s=0}^k\frac{(-1)^s h_s}{\binom ks} =\frac{k+1}{p}h(B)=h(B).

Symmetry of EE, its range containment, and this identity prove that it is the asserted orthogonal projection. In particular it is positive semidefinite. Its trace also gives dim⁡ker⁡D=N/p\dim\ker D=N/p.

The matrix in the statement satisfies K=JV/p+(p−1)EK=J_V/p+(p-1)E, so it is positive semidefinite. Its diagonal is one. At intersection sizes s=0,ks=0,k its entry KsK_s is one; for 0<s<k0<s<k, use (ks)≥k\binom ks\ge k to get 0≤Ks≤10\le K_s\le1. Also Kk−1=0K_{k-1}=0.

For the matrix MM on V×{1,…,p}V\times\{1,\ldots,p\}, the same-color block is K/pK/p and every different-color block is (JV−K)/(p(p−1))(J_V-K)/(p(p-1)). On the constant color direction their sum is JV/pJ_V/p; on every color direction perpendicular to constants their difference is

Kp−JV−Kp(p−1)=pK−JVp(p−1)=E.\frac Kp-\frac{J_V-K}{p(p-1)} =\frac{pK-J_V}{p(p-1)}=E.

Both are positive semidefinite. Moreover yyTyy^{\mathsf T} has operator JV/pJ_V/p on the constant color direction and zero on its orthogonal complement. Consequently M−yyTM-yy^{\mathsf T} is positive semidefinite. The Schur complement of the top-left entry one now shows that the block matrix with blocks 1,yT,y,M1,y^{\mathsf T},y,M is positive semidefinite. The entrywise inequalities and marginal and edge conditions follow directly from 0≤Ks≤10\le K_s\le1, Kk=1K_k=1 and Kk−1=0K_{k-1}=0.

There are (ks)2\binom ks^2 sets CC with ∣B∩C∣=s|B\cap C|=s. The two sums in the statement are therefore

(ks)2Ks=(ks)((ks)+k(−1)s)p,(ks)21−Ksp−1=(ks)((ks)−(−1)s)p.\binom ks^2K_s =\frac{\binom ks(\binom ks+k(-1)^s)}p, \qquad \binom ks^2\frac{1-K_s}{p-1} =\frac{\binom ks(\binom ks-(-1)^s)}p.

They are nonnegative by the already proved entrywise inequalities. When p=k+1p=k+1 is prime, the congruence (p−1s)≡(−1)s(modp)\binom{p-1}s\equiv(-1)^s\pmod p makes both numerators divisible by pp. This includes s=0,ks=0,k and proves all assertions. □\square