Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
This page sharpens the exceptional-point threshold of the conditional curve reduction, which belongs to the negative branch of the bounded-blocking sketch. That reduction lets a blocking set have at most about points off a curve , where is the density of lines missing . Counting the missed lines through each outside point raises the threshold to about , independently of . For unions of conics in odd characteristic the count is proved below by quadratic character sums. For curves of bounded degree in large prime planes it follows from the monodromy of the projection from a point, with the source interfaces and the restriction argument given below. The negative answer then needs a premise that a fixed proportion of every bounded-cap set of linear size lies on a curve of fixed degree. The arguments are author-recorded by Plasma AI, without independent review. Nothing here proves either answer to Problem 1159.
Setting
Let be a prime power and a curve defined over . Write for its rational points, for the set of lines containing none of them, and, for a rational point ,
Every line of has points, none on , so
Counting principle. Let meet every line, and put . Each line of misses and meets , so it contains a point of . Hence
The old threshold bounds every by . If instead is close to its average for all but boundedly many , then (2) forces to be at least about .
The threshold cannot be raised for arbitrary blocking sets. For odd, a conic together with an external line blocks every line, and only the points of that line lie off the conic. Raising it would need the line cap, which the conic proposition below does not use.
Unions of conics in odd characteristic
Proposition. Let be odd and let be the union of distinct nondegenerate conics defined over . There is a set of at most points such that every rational point satisfies
Consequently, if meets every line of PG, , and , then
so .
Proof. Let with symmetric and . Fix a rational and a line ; the lines through are the lines with . Parametrize by . The points of lie on exactly when
Since , this binary quadratic form is nonzero. As is odd, its rational zeros number , or according as
is a nonsquare, zero, or a nonzero square. Replacing by leaves unchanged and replacing by multiplies it by , so its quadratic character depends only on the line. Along , is a binary quadratic form in . Its zeros are the tangent lines from to . There are exactly two of them over , because is off the conic and the characteristic is odd, so has two distinct roots.
A line through misses exactly when for every . When no vanishes, the product is that indicator. At the at most tangent parameters it lies in while the line meets at its rational point of tangency. Expanding the product,
with . Each is a binary form of even degree , so its character is defined on . If is not a constant multiple of a square, its affine restriction is not either: a form of even degree has an even number of roots of odd multiplicity. Weil's bound in the form of Lidl and Niederreiter, Finite Fields, Theorem 5.41, used at statement level and not re-read here, then gives , the accounting for the parameter at infinity. Summing over nonempty ,
which with gives (3), unless some with is a constant multiple of a square.
Suppose . Then every root of has even multiplicity. For this is impossible, the two roots being distinct. For , choose : each of the two tangent lines from to is also tangent to some with , . Let be the set of lines over tangent to at least two of the conics. In odd characteristic a nondegenerate conic is recovered from its dual conic, so distinct conics have distinct dual conics, which meet in at most four points. Hence . The two tangents from to are distinct lines of through , so belongs to the set of intersection points of two distinct lines of , which has at most elements. This proves (3).
For (4), there are at least rational points off , and at the points of . The lower bound in (3) is positive by hypothesis, so (1) and (3) give
Points of lie on at most lines, and the other points of satisfy (3). Inserting both bounds in (2) gives (4). For fixed , dividing (4) by gives the stated asymptotic form.
For a single conic, (3) holds with no exceptions. More precisely an internal point lies on external lines and an external point on . So a point set blocking the external lines has at least points, hence at least . The old threshold gave only about . The exceptional set is genuinely needed when . In characteristic different from two and three, the two conics and have the same pair of tangent lines from the origin, and through the origin about lines, rather than , miss both. The evidence entry point checks (3), the exceptional count and this example in small prime planes.
Corollary. Let be odd, and fixed, and a set meeting every line of PG in to points. Let be a nonzero homogeneous form over of degree at most whose geometrically irreducible nonlinear components defined over are all conics. Then
Indeed, the line components contain at most points of and the other non-conic components at most rational points in total, as in the curve reduction. Apply the proposition to the union of the conic components if it is nonempty; otherwise gives the conclusion directly. In particular, at cap a bounded union of lines and conics contains at most points of . Since a cap- blocking set has at most about points, this bounds the portion of that such curves can carry. It does not by itself contradict blocking, because nothing forces to lie mostly on conics.
Odd characteristic is essential. In PG with the three conics of the parity construction meet every line in one to six points and leave no point outside their union. There every tangent of a conic passes through its nucleus, so the discriminant argument above has no analogue.
The pencil count for curves of bounded degree
For general the same count needs the distribution of rational points in the fibres of the projection from . Exceptional points cannot be avoided, but for sets with a line cap it suffices that they lie on boundedly many lines.
Proposition 2. Fix . There are constants and with the following property. Let be prime and let be a nonempty reduced union of geometrically irreducible curves defined over , of degrees and total degree at most . Outside a union of at most lines, every rational point satisfies
Here is the proportion of fixed-point-free permutations in , as in the curve reduction. One may take . The constants are uniform over the coefficients and components of .
Proof. Work first over . Let be the singular points of the whole reduced curve , including intersections of different components. In the dual plane put
where parametrizes lines through and has its reduced structure. Thus is exactly the set of lines meeting in distinct geometric points. The incidence morphism is finite étale.
The degree assumption makes each component reflexive. The precise external input is the degree-below-characteristic consequence of Hefez's generic-contact discussion, specified under the source interfaces below. In odd characteristic reflexivity gives simple generic tangency. Distinct reflexive components have distinct dual curves, by biduality. A generic tangent to one component therefore has contact exactly two there and meets every other component transversally, away from all singular points. The whole union is quasireflexive in Entin's sense. His Theorem 2 gives geometric monodromy
In the plane case its mechanism can be seen directly. For each component, the off-diagonal fibre square of the incidence morphism is birational to : two distinct points determine their line. This gives double transitivity on that component's fibre. A simple tangent on gives an inertia element which transposes two sheets of that component and fixes the sheets of every other component. Conjugating this element using double transitivity gives every transposition supported on the th factor. Doing this for each gives the product, without inferring joint independence merely from pairwise independence.
We next specify the exceptional lines. A generic polar of a reduced degree-at-most- plane curve has no component in common with it, so Bézout bounds by . The same polar argument bounds by . Consequently
The reduced plane curve has at most singular geometric points, again by a generic polar. Let be the union, in the original plane, of the lines dual to those points. It has at most components.
Fix . Its pencil misses . It is not a component of , because that would say . None of the dual curves is a line, by reflexivity and . At a smooth point of , biduality identifies its tangent with for some . Thus can be tangent to this dual curve only if , also excluded. Its intersections with the line components are transverse. We have proved that meets only transversally at smooth points.
Let be the normalization in the function field of the connected geometric Galois closure over . The surface is normal, integral and projective, and is finite. Write as a scheme. It is an effective ample Cartier divisor: it is the pullback of a line under a finite surjection.
Here is the needed connectedness argument. A normal surface is Cohen--Macaulay and has a dualizing sheaf . Serre duality and Serre vanishing give, for sufficiently large ,
In the exact sequence for the effective divisor , the restriction of global functions therefore gives : global functions on the integral projective surface are constant, and a constant vanishing on is zero. A disconnected would give a nontrivial idempotent on . Thus is connected.
It is also smooth. Over , is étale, so this is immediate there. Its Galois group has order , making the cover tame at every component of . Near a smooth point of , Abhyankar's lemma expresses the normalization, étale locally, as a disjoint union of covers obtained by adjoining with , where defines and . Since is transverse, choose a second local parameter with . The restriction is locally over this smooth line, hence has regular local parameter . This proves smoothness everywhere on .
A connected smooth curve is irreducible. Removing the finitely many points above leaves a connected Galois cover of of degree . Therefore the restricted incidence cover has geometric monodromy . The arithmetic group preserves each , since every component is defined over , and so is a subgroup of . It contains the geometric group, already equal to that product. The two groups coincide.
Finally apply Entin's Theorem 3 to the incidence cover restricted to . Its base is a geometrically irreducible open subset of . Its morphism complexity is bounded in terms of : the equations for , incidence, membership in and exclusion of have bounded degree in fixed-dimensional projective products. The arithmetic-to-geometric quotient is trivial, so the theorem's constant-field factor is one. Summing its estimate over the conjugacy classes having no fixed point on any component gives
There are at most omitted pencil parameters. Adding any of them which also miss the rational points changes the count by , proving (5).
The exceptional lines were defined over . A non-rational geometric line contains at most one -point; choose any rational line through that point if it exists. This replaces by at most the same number of rational lines covering all its rational points, as required.
The restriction proof includes singular curves. A projection of a branch of multiplicity at least three can have ramification index at least three for every centre; avoiding flex tangents does not make all its inertia transpositions. The proof uses transpositions to determine the monodromy of the whole family and uses tame local models, allowing higher ramification indices, to restrict that family to the pencil.
Source interfaces and reading depth
These are external premises of the author-recorded proof, not claims of independent verification.
- Hefez, Non-reflexive curves, Compositio Math. 69 (1989), Section 2, equation (2.1) and the consequence at the top of printed p. 5 (article): a nonlinear irreducible curve of degree less than the characteristic is reflexive. The consequence and its generic-contact context were inspected at statement level. The original generic-contact proof, attributed there to Hefez and Kleiman, and the Segre--Wallace separability criterion were not reconstructed.
- Entin, Monodromy of hyperplane sections of curves and decomposition statistics over finite fields, arXiv:1805.05454v3: Proposition 2.1 identifies reflexivity with quasireflexivity in odd characteristic; Theorem 2 gives the full product monodromy for a quasireflexive union; Theorem 3 counts Frobenius classes in finite étale covers with error uniform in morphism complexity. Sections 2--5, including the monodromy and twisting proofs, were read in the v3 TeX. The cited general contact, monodromy-action, descent and Lang--Weil theorems remain external inputs. No comparison with the journal edition was made.
- The Stacks Project, Lemma 58.31.5, tag 0EYG: a finite étale cover tame in codimension one along a regular effective Cartier divisor is étale locally a disjoint union of the standard root covers. Its statement and proof were read. It is used only near the smooth points of , where the base is a regular surface and the branch divisor is regular.
- The Stacks Project, Lemmas 30.17.1--2, tag 01XO, supply Serre vanishing and preservation of ampleness by a finite surjective pullback. Their statements and proofs were read. Lemma 48.27.5 and Remark 48.27.6, tag 0FVU, supply Serre duality on a proper Cohen--Macaulay scheme. Their statements and displayed derivations were read; the underlying duality theory was not reconstructed. Here the scheme is the normal projective surface , the sheaf being dualized is the invertible sheaf , and its dimension is two.
For completeness, summing (5) through (1) gives the global lower bound
Indeed, at most rational points lie on , by counting their incidences with all lines, none of which is a component of . At most lie on the exceptional lines. Thus points contribute at least each to (1), which proves (6) for large . This also recovers the lower bound needed from the global source estimate.
For conics the first proposition gives the stronger conclusion, with finitely many exceptional points and explicit constants, in every odd characteristic, by an elementary argument. For cubics the evidence entry point computes every at for a Fermat, a nodal, a cuspidal and a smooth cubic. All but , , and points off the curve satisfy . The exceptions of the Fermat cubic are the three coordinate points, from which the projection is a cyclic cover. They lie on its flex tangents, such as through with , which are rational because , as Proposition 2 permits. For a cubic with a conic and for two cubics, the same bound with and fails at only and points. These main terms are the products of the component densities; the empirical constant and the exact exception counts are finite observations, not consequences of Proposition 2. The two-cubic example has total degree six and , outside that proposition's convenient sufficient characteristic range. None of these examples verifies the uniform estimate.
The sharpened reduction
Theorem A. Fix positive integers . For all sufficiently large primes , every set meeting each line in to points, and every nonzero homogeneous form of degree at most , satisfy
Proof. Discard the line components of and its components that are not geometrically irreducible, at a cost of at most points of , as in the curve reduction. Let be the remaining union and . If is empty, . Otherwise Proposition 2 summed through (1), or the source estimate of the curve reduction, together with the bound of that page, gives . At most points of lie on the exceptional lines of Proposition 2, and each lies on at most lines. So (2) gives
Dividing by , which is at least , gives . Adding back the discarded components costs .
For unions of lines and conics the corollary above proves Theorem A by the elementary argument, in every odd order.
Theorem B. Fix a cap and assume the following.
Positive-proportion extraction . There are , an integer and such that, for all sufficiently large primes , every meeting each line in at most points and having has at least points on some curve defined over of degree at most .
Then no set in PG meets every line in to points once is large. If holds for every , then along the primes, and Problem 1159 has a negative answer.
Proof. Let be such a set and . While , apply to , which still meets each line in at most points, to obtain , and put . Then and , by counting incidences, so the process stops after at most steps, a number independent of . If it stops at step , the product has degree at most , and . This contradicts Theorem A at degree once is large.
Compared with the repeated-extraction test of the curve reduction, the contraction condition disappears: any fixed suffices, because the threshold for exceptional points no longer decreases as the total degree grows. The residual hypothesis also disappears. Each residual keeps the cap and its size stays at least until the iteration stops, and is asked of arbitrary bounded-cap sets, not of blocking sets.
A relative invariant with tangents
A weaker extraction premise suffices. In the preceding proof each residual meets every line missing , because meets every line. To use that weaker premise, the quantifiers must still be uniform: choose first and then . Require the extraction statement for each , every degree-at-most- curve (with ), and every cap- set of size at least blocking the lines missing , with one threshold for . Allowing or to deteriorate with without a termination bound does not establish this premise.
There is a stronger valid invariant which retains minimality and tangents, provided the covered points, not just their containing curve, stay in the state. Initially delete to an inclusion-minimal blocking set , and keep this same throughout. Put
Then is an inclusion-minimal blocking set for the line family . It blocks that family because . For each , a tangent to the original minimal avoids and meets only at , proving relative minimality. The line cap holds for the union , as well as for the residual.
Thus one can replace by an extraction theorem for these triples , with the same uniform constants through . The required curve must capture a fraction of , not merely a fraction of . An extraction theorem stated only for minimal blocking sets does not imply this: its captured points could all belong to .
The family includes the lines which meet only outside . Deleting points merely because the lines missing the whole curve remain blocked can uncover such a line. Likewise a tangent to at a residual point need not miss the whole curve. The two relative line families cannot be interchanged.
Standing
The first proposition and its corollary are author-recorded proofs resting on Weil's bound. Proposition 2 and Theorem A are author-recorded proofs with the external interfaces and reading depth specified above. Theorem B proves a conditional implication from . None has independent review, and no result here settles Problem 1159.
is the remaining structural premise. Nothing here proves it for any , and no counterexample to it is supplied. It concerns arbitrary bounded-cap sets, so it is not vacuous: a conic and unions of boundedly many nonlinear curves give examples of sets to which it applies for suitable caps. The heuristic that bounded line intersections require structure does not show that the structure is algebraic.
Given the source estimate, restricting the curve reduction's approximation premise to inclusion-minimal cap- blocking sets is logically equivalent to their nonexistence in large prime planes. The forward direction is the counting contradiction; the reverse direction is vacuity. This equivalence does not rule out a useful proof by contradiction exploiting the covering and tangent hypotheses. It identifies what that restricted approximation theorem would have to establish, without supplying it.
Because Theorem A leaves about points off every curve, extraction is needed only for sets of at least points, with any fixed . For arcs this case is known. Ball and Lavrauw, Arcs in finite projective spaces (arXiv:1908.10772v2), Theorem 52, state that in PG with prime an arc of more than points lies on a conic, attributing it to Voloch, J. Geom. 38 (1990), 198–200. Only the statement in the survey's extracted text was read; the original was not. So holds with , and , but cap-two blocking sets are already excluded by L27. For no comparable theorem is known to us. Segre's method behind such results uses the few tangent lines of a nearly maximal arc; a set of about points with cap can have a positive proportion of lines of every load through each of its points, and no proof of is supplied here. Random sets of linear size have line intersections growing with , so they supply no test cases.
Next discriminating test
The decisive input is , or the uniform relative blocking version above, for every fixed (an unbounded sequence of caps would also suffice). Together with Theorem A it would give a negative answer to Problem 1159. A result only for small caps would raise lower bounds without answering the problem.
A direct attack can instead exploit the product of the dual covering lines; the covering-polynomial account retains its exact identities and the point where the freeness route fails to produce a fixed-degree extraction. No implication from those identities to is known here.