Wiki
Wiki

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

Updated

Incidence identities and exchange rigidity in every projective plane


These statements hold in every projective plane, Desarguesian or not. They are elementary and are recorded here with complete author proofs by Plasma AI, without independent review. They are the all-plane inputs of the bounded-blocking proof sketch.

Setting. Π\Pi is a projective plane of order q≥2q\ge2 with N=q2+q+1N=q^2+q+1 points and lines. For an integer-valued function zz on points, write ∂z(ℓ)=∑P∈ℓz(P)\partial z(\ell)=\sum_{P\in\ell}z(P) for its line sums and ∣z∣=∑Pz(P)|z|=\sum_Pz(P). For a point set SS of size ss, the load of a line is xℓ=∂1S(ℓ)=∣S∩ℓ∣x_\ell=\partial 1_S(\ell)=|S\cap\ell|.

Moments, pencils and variance

Moments. Counting incidences and ordered pairs of distinct points of SS,

∑ℓxℓ=(q+1)s,∑ℓxℓ(xℓ−1)=s(s−1).\sum_\ell x_\ell=(q+1)s,\qquad \sum_\ell x_\ell(x_\ell-1)=s(s-1).

Pencil identity. For every integer function zz and every point PP,

∑ℓ∋P∂z(ℓ)=q z(P)+∣z∣.\sum_{\ell\ni P}\partial z(\ell)=q\,z(P)+|z|.

Proof. The q+1q+1 lines through PP all contain PP, and every other point lies on exactly one of them. □\square

For z=1Sz=1_S this reads ∑ℓ∋Pxℓ=s+q 1S(P)\sum_{\ell\ni P}x_\ell=s+q\,1_S(P). The map z↦∂zz\mapsto\partial z is injective: if ∂z=0\partial z=0, the identity gives qz(P)=−∣z∣qz(P)=-|z| for every PP, so zz is a constant cc with (q+N)c=0(q+N)c=0. A load function therefore determines its point set. Conversely, an integer function xx on lines with ∑ℓxℓ=(q+1)s\sum_\ell x_\ell=(q+1)s whose pencil sums take only the values ss and s+qs+q is the load function of the set SS of points with pencil sum s+qs+q. Summing the pencil sums over all points gives (q+1)2s=Ns+q∣S∣(q+1)^2s=Ns+q|S|, so ∣S∣=s|S|=s. Then xx and ∂1S\partial1_S have the same pencil sums, and they are equal because the pencil-sum map on line functions is injective: it is the map ∂\partial of the dual plane.

Variance identity. With μ=(q+1)s/N\mu=(q+1)s/N the mean load,

∑ℓ(xℓ−μ)2=sq(1−sN).\sum_\ell(x_\ell-\mu)^2=sq\Bigl(1-\frac sN\Bigr).

Proof. By the moments, ∑ℓxℓ2=s2+sq\sum_\ell x_\ell^2=s^2+sq. Since (q+1)2=N+q(q+1)^2=N+q, Nμ2=s2+s2q/NN\mu^2=s^2+s^2q/N. Subtract. □\square

So every point set, however it is built, has load variance

v=sqN(1−sN)=μ qq+1(1−sN),v=\frac{sq}N\Bigl(1-\frac sN\Bigr)=\mu\,\frac q{q+1}\Bigl(1-\frac sN\Bigr),

asymptotic to its mean when s=O(q)s=O(q). This is an equality of second moments, not a Poisson approximation or a constraint on tail shape. If every load lies in [1,C][1,C], then v≤(μ−1)(C−μ)v\le(\mu-1)(C-\mu), the largest variance of a distribution on [1,C][1,C] with mean μ\mu. Written out, this is exactly the quadratic inequality of L27, whose proof sums (xℓ−1)(C−xℓ)≥0(x_\ell-1)(C-x_\ell)\ge0. Any construction with a bounded cap must therefore realize a load distribution with variance close to its mean on a bounded range; a concentrated distribution is impossible.

Exchange rigidity

Lemma (exchange footprint). Let z≠0z\ne0 be an integer function on the points of Π\Pi with ∣∂z(ℓ)∣<q|\partial z(\ell)|<q for every line, and let F={ℓ:∂z(ℓ)≠0}F=\{\ell:\partial z(\ell)\ne0\}. Then ∣F∣≥q+1|F|\ge q+1. If ∣F∣=q+1|F|=q+1 and ∣∂z(ℓ)∣<q/2|\partial z(\ell)|<q/2 for every line, then FF is the pencil of a point PP and z=k 1{P}z=k\,1_{\{P\}} for a nonzero integer kk.

Proof. By the pencil identity, ∑ℓ∋P∂z(ℓ)≡∣z∣\sum_{\ell\ni P}\partial z(\ell)\equiv|z| (mod qq) at every point PP. Since ∂\partial is injective, FF is nonempty.

Suppose ∣F∣≤q|F|\le q. The lines of FF cover at most q(q+1)<Nq(q+1)<N points, so some point lies on no line of FF, and the congruence there gives ∣z∣≡0|z|\equiv0. A line ℓ∈F\ell\in F meets the other at most q−1q-1 lines of FF in at most q−1q-1 of its q+1q+1 points, so some point of ℓ\ell lies on no other line of FF. The congruence at that point gives ∂z(ℓ)≡∣z∣≡0\partial z(\ell)\equiv|z|\equiv0 (mod qq), so ∂z(ℓ)=0\partial z(\ell)=0 because ∣∂z(ℓ)∣<q|\partial z(\ell)|<q. This contradicts ℓ∈F\ell\in F. Hence ∣F∣≥q+1|F|\ge q+1.

Suppose ∣F∣=q+1|F|=q+1. Each ℓ∈F\ell\in F meets the other qq lines of FF in at most qq points, so again some point of ℓ\ell lies on no other line of FF, and ∂z(ℓ)≡∣z∣\partial z(\ell)\equiv|z| (mod qq). If some point lay on no line of FF, then ∣z∣≡0|z|\equiv0 and the previous contradiction recurs. So the q+1q+1 lines of FF cover every point, and by the lemma below they form the pencil of a point PP. All values ∂z(ℓ)\partial z(\ell) with ℓ∈F\ell\in F are congruent to ∣z∣|z| modulo qq and lie in (−q/2,q/2)(-q/2,q/2), so they equal one integer kk, and k≠0k\ne0 because FF is the support. Then ∂z=k ∂1{P}\partial z=k\,\partial 1_{\{P\}}, since ∂1{P}\partial 1_{\{P\}} is the indicator of the pencil of PP, and injectivity gives z=k 1{P}z=k\,1_{\{P\}}. □\square

Lemma (covering pencils). A set of q+1q+1 lines covering every point is the pencil of a point.

Proof. Dually, let BB be a set of q+1q+1 points meeting every line. Take a point P∉BP\notin B. The q+1q+1 lines through PP partition the other points, and each meets BB, so each contains exactly one point of BB. Hence every line through a point outside BB meets BB exactly once. For distinct X,Y∈BX,Y\in B, the line XYXY meets BB twice, so it contains no point outside BB; thus XY⊆BXY\subseteq B and, comparing sizes, B=XYB=XY. Dualizing, the lines form a pencil. □\square

Consequence for exchanges. Let R⊆SR\subseteq S and AA disjoint from SS, not both empty, with every line meeting AA and RR in fewer than q/2q/2 points. The exchange S↦(S∖R)∪AS\mapsto(S\setminus R)\cup A changes the load of every line in FF for z=1A−1Rz=1_A-1_R. It changes at least q+1q+1 loads, and at least q+2q+2 unless it inserts or removes a single point, the case z=±1{P}z=\pm1_{\{P\}}.

This is a bound on changed line loads, not on the number of changed points. A single insertion has point support one and line support q+1q+1; swapping two distinct points has point support two and line support 2q2q. A bounded-point absorber is not excluded merely because many lines see its change. Its legality must account for those lines simultaneously. The small-change hypothesis also matters: replacing a full line by another full line changes only those two loads, by qq and −q-q. The stronger, but state-specific, large-deletion obstruction uses saturated pencils of a maximal arc; it does not follow just from the footprint bound.

A modular form of the pencil identity

Lemma. Let m≥2m\ge2 be coprime to qq, and let W={ℓ:xℓ≢1(modm)}W=\{\ell:x_\ell\not\equiv1\pmod m\}. For every point PP,

∑ℓ∋P, ℓ∈W(xℓ−1)≡s−q−1+q 1S(P)(modm).\sum_{\ell\ni P,\ \ell\in W}(x_\ell-1)\equiv s-q-1+q\,1_S(P)\pmod m.

Hence either every point of SS or every point outside SS lies on a line of WW.

Proof. Subtract q+1q+1 from the pencil identity for 1S1_S; lines outside WW contribute multiples of mm. The right sides for points in and outside SS differ by q≢0q\not\equiv0, so at least one of them is nonzero modulo mm, and a point on no line of WW has left side 00. □\square

If WW were empty, both alternatives would fail unless SS or its complement were empty; but then every load is 00 or q+1q+1, neither congruent to 11, so WW is all lines. Hence no point set has all its line intersections congruent to 11 modulo a number coprime to qq. For a set with exactly the intersection numbers 11 and nn this gives gcd⁡(n−1,q)>1\gcd(n-1,q)>1, a weak form of the classical restriction that n−1n-1 divides qq. For a set with all loads in [1,4][1,4], where L27's argument gives t2+t3=−12(s2−(4q+5)s+4N)≤(24q+9)/8t_2+t_3=-\tfrac12\bigl(s^2-(4q+5)s+4N\bigr)\le(24q+9)/8 for the numbers tit_i of lines with ii points, the case m=3m=3 with 3∤q3\nmid q says that the lines with two or three points cover SS or cover its complement. In the second case at least (N−s)/(q−1)(N-s)/(q-1) of them are needed, since each contains at most q−1q-1 points outside SS.