Erdős Problem 607: line-size sets

What Lean checks

Lean proves the exact realizability and geometric counting identity for every natural point count, the coefficientwise and analytic generating functions, Fourier extraction, the actual finite-product limit and domination, and the sharp asymptotic for the actual record count with prefactor 3/(16√(6π)A^(1/4)), where A=π²/12+(log 2)²/2. No unproved local-limit, tail, or coefficient-transfer premise remains.

Collection · Catalogue · Verification · Lean status

Result

Erdős Problem 607 / OEIS A401948: sharp counting asymptotic with exact leading prefactor.

Proof and sources

Read the proof for the original problem, assumptions, argument, and cited sources. These notes are unrefereed.

Verification

Run from the repository root:

python3 results/erdos-607-line-sizes/verify.py

See the verification guide for dependencies and the distinction between computational checks and formal proofs.

Formalization

The exact realizability criterion is proved for actual finite sets of real plane points. The geometric construction, filling, padding, ordinary-line theorem, and collinear cases give equality of the geometric record count with the canonical tuple count for every natural n. The core/gap weight equivalence is also checked. The Sylvester–Gallai dependency is a pinned CC0 port with its license and provenance preserved.

The exact saddle constant, unique saddle, curvature, global phase bound, and mean/variance identities have passed source, axiom, and independent kernel checks. The exponential-series integral supplies the constant.

Canonical core/tail reconstruction, cumulative cost counting, and the exact corrected finite Euler product are also checked. The Euler proof includes the square-root factor and a uniform logarithmic error estimate on positive compact ranges of the scaled core length. Its eight-module closure passed strict source, the 122-theorem axiom audit, and independent kernel replay.

The exact coefficientwise formal generating function is now checked. Its 14-module closure passed strict source checking, a 496-theorem axiom audit, and independent kernel replay. See the receipt.

The analytic generating function, absolute convergence, and exact Fourier coefficient identity are now checked. The 39-module closure passed strict sources, an 867-theorem standard-axiom audit, and independent kernel replay. Generating-function receipt.

The complete sharp asymptotic is also checked for the actual geometric count:

F(n)∼3166πA1/4n−1/4e2An,A=π212+(log2)22.F(n)\sim \frac{3}{16\sqrt{6\pi}\,A^{1/4}}\, n^{-1/4}e^{2\sqrt{An}},\qquad A=\frac{\pi^2}{12}+\frac{(\log 2)^2}{2}.

All finite-product limits, Fourier bounds, measurability, domination, lattice steps, Gaussian integrals, and normalization identities are supplied by its 78-module closure. Strict sources, the 1,582-theorem standard-axiom audit, and independent pinned-kernel replay passed. Asymptotic receipt.

This completes the stated note. Checked components · Exact formalized scope.