Erdős problem 90
Conjectured upper bound on how many pairs among points in the plane can be exactly one unit apart.
Sources
FormalConjectures/ErdosProblems/
90.lean
Sawin's Lemmas 11–12 / Remarks Proposition 2.3: the totally real tower.
There exist and a *single* infinite set of rational primes such that for every one can find a totally real number field of degree with bounded root discriminant in which *every* prime splits completely.
The load-bearing feature is the quantifier order: is fixed *before* , so the same primes split completely in fields of *unbounded* degree. (For a single fixed , Chebotarev already gives infinitely many completely split primes , so a per-field statement would be vacuous.) This uniform splitting in an unbounded tower is the key arithmetic input to the disproof. It is proved as Lemmas 11–12 of Sawin, [arXiv:2605.20579](https://arxiv.org/abs/2605.20579), and as Proposition 2.3 of the [Remarks](https://arxiv.org/abs/2605.20695) paper, via the Golod–Shafarevich inequality for pro- groups together with the Hajir–Maire–Ramakrishna (2003) tower construction.
A "completely split" rational prime in is one for which is the product of exactly distinct maximal ideals.
∃ rdBound Q, Q.Infinite ∧ (∀ q ∈ Q, Nat.Prime q ∧ q % 4 = 1) ∧ ∀ (N : ℕ), ∃ F x, ∃ (x_1 : CharZero F) (x_2 : NumberField F) (_ : NumberField.IsTotallyReal F), N ≤ Module.finrank ℚ F ∧ |↑(NumberField.discr F)| ^ (1 / ↑(Module.finrank ℚ F)) ≤ rdBound ∧ ∀ q ∈ Q, ∃ factors, factors.card = Module.finrank ℚ F ∧ ∀ p ∈ factors, p.IsMaximal ∧ ↑q ∈ p