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. is a projective plane of order with points and lines. For an integer-valued function on points, write for its line sums and . For a point set of size , the load of a line is .
Moments, pencils and variance
Moments. Counting incidences and ordered pairs of distinct points of ,
Pencil identity. For every integer function and every point ,
Proof. The lines through all contain , and every other point lies on exactly one of them.
For this reads . The map is injective: if , the identity gives for every , so is a constant with . A load function therefore determines its point set. Conversely, an integer function on lines with whose pencil sums take only the values and is the load function of the set of points with pencil sum . Summing the pencil sums over all points gives , so . Then and have the same pencil sums, and they are equal because the pencil-sum map on line functions is injective: it is the map of the dual plane.
Variance identity. With the mean load,
Proof. By the moments, . Since , . Subtract.
So every point set, however it is built, has load variance
asymptotic to its mean when . This is an equality of second moments, not a Poisson approximation or a constraint on tail shape. If every load lies in , then , the largest variance of a distribution on with mean . Written out, this is exactly the quadratic inequality of L27, whose proof sums . 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 be an integer function on the points of with for every line, and let . Then . If and for every line, then is the pencil of a point and for a nonzero integer .
Proof. By the pencil identity, (mod ) at every point . Since is injective, is nonempty.
Suppose . The lines of cover at most points, so some point lies on no line of , and the congruence there gives . A line meets the other at most lines of in at most of its points, so some point of lies on no other line of . The congruence at that point gives (mod ), so because . This contradicts . Hence .
Suppose . Each meets the other lines of in at most points, so again some point of lies on no other line of , and (mod ). If some point lay on no line of , then and the previous contradiction recurs. So the lines of cover every point, and by the lemma below they form the pencil of a point . All values with are congruent to modulo and lie in , so they equal one integer , and because is the support. Then , since is the indicator of the pencil of , and injectivity gives .
Lemma (covering pencils). A set of lines covering every point is the pencil of a point.
Proof. Dually, let be a set of points meeting every line. Take a point . The lines through partition the other points, and each meets , so each contains exactly one point of . Hence every line through a point outside meets exactly once. For distinct , the line meets twice, so it contains no point outside ; thus and, comparing sizes, . Dualizing, the lines form a pencil.
Consequence for exchanges. Let and disjoint from , not both empty, with every line meeting and in fewer than points. The exchange changes the load of every line in for . It changes at least loads, and at least unless it inserts or removes a single point, the case .
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 ; swapping two distinct points has point support two and line support . 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 and . 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 be coprime to , and let . For every point ,
Hence either every point of or every point outside lies on a line of .
Proof. Subtract from the pencil identity for ; lines outside contribute multiples of . The right sides for points in and outside differ by , so at least one of them is nonzero modulo , and a point on no line of has left side .
If were empty, both alternatives would fail unless or its complement were empty; but then every load is or , neither congruent to , so is all lines. Hence no point set has all its line intersections congruent to modulo a number coprime to . For a set with exactly the intersection numbers and this gives , a weak form of the classical restriction that divides . For a set with all loads in , where L27's argument gives for the numbers of lines with points, the case with says that the lines with two or three points cover or cover its complement. In the second case at least of them are needed, since each contains at most points outside .