qedbot

Erdős·erdos:607

Erdős 607

problem formal record: unclassified source: proved$250 F2 declared

No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.

A Palomar registration names this problem. It is shown below but not counted as a check of the claim.

Fidelity F2: The correspondence is declared through an alignment table and written divergences.

geometry·Source

AI activity

How grades work

No AI contribution recorded against this statement.

F2 declared. The correspondence is declared through an alignment table and written divergences.

declares divergences from its source reviewed by its authors only

Checks

1
  • verified·Palomar

    Registered by Palomar at 45ef2462: Comparator confirmed 1 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel. The project names this problem, which does not establish that it proves the result claimed here, so it is not counted as a check of it

    project registered at a pinned commit·2026-10-11·commit 45ef2462f0a9

    PALOMAR-2026-10-11-000015 — names this problem; not counted as a check of the claim

Declared by the projects

1

As each project's formalization.yaml states it.

Erdos607raphaeldelors-code/palomar-erdos607 · joined by names · Palomar

Read formalization.yaml

authors
Raphael Delors
method
agent — qwen3.8-27b
review
self-assessed
sorry
0 unproved goals declared
sources
Geometric corollary settling Erdős 607: F(n) <= exp(c·√n) for the number of distinct line-size sets of n plane points — other, authors n/a; Block Sizes in Pairwise Balanced Designs — background, authors not-contacted; Extremal problems in discrete geometry — background, authors not-contacted; Erdős problem 607 — background, authors n/a
divergences
The Colbourn–Phelps–Rödl (1984) Theorem 2.4 PBD profile bound is taken as a hypothesis (hCPR) rather than re-proved, and the bound is stated for n ≥ 2, the range in which it is meaningful (so the hypothesis is non-vacuous). The formalization proves the reduction from Erdős 607 multiplicity sets to PBD profile sets and the resulting geometric corollary exp(c·√n) conditional on that published theorem. The new element is the geometric corollary (the bound applied to point-set line PBD families), not the underlying PBD bound, which is cited. The matching Szemerédi–Trotter (1983) lower bound F(n) ≥ exp(c'·√n), used to state the order of growth F(n) = exp(Θ(√n)), is cited and not re-proved or formalized. See PROVENANCE.md for the prior-art search.
checked by
Palomar

Follow and discuss

All discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 0

No formal statement located.

Cited proofs · 0

No proof artifact cited by the formal record.

Also known as · 1
  • https://www.erdosproblems.com/607

Cite this record

qed.bot, “Erdős 607”, https://qed.bot/s/erdos-607, as of 20 Nov 2026.

This record as plain text, with each claim, its grades and its sources.