Skip to content

Erdős problem 90

Conjectured upper bound on how many pairs among nn points in the plane can be exactly one unit apart.

Sources

Browse retained paths and inspect the exact material available for this Problem.

9 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

90.lean

Retained formal statement7 of 8

Sawin's Lemmas 11–12 / Remarks Proposition 2.3: the totally real tower.

There exist rdBound:RrdBound : \mathbb{R} and a *single* infinite set QQ of rational primes q1(mod4)q \equiv 1 \pmod 4 such that for every NN one can find a totally real number field F/QF/\mathbb{Q} of degree N\ge N with bounded root discriminant discF1/[F:Q]rdBound|disc F|^{1/[F:\mathbb{Q}]} \le rdBound in which *every* prime qQq \in Q splits completely.

The load-bearing feature is the quantifier order: QQ is fixed *before* FF, so the same primes split completely in fields of *unbounded* degree. (For a single fixed FF, Chebotarev already gives infinitely many completely split primes 1(mod4)\equiv 1 \pmod 4, 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-22 groups together with the Hajir–Maire–Ramakrishna (2003) tower construction.

A "completely split" rational prime qq in FF is one for which (q)(q) is the product of exactly [F:Q][F:\mathbb{Q}] distinct maximal ideals.

FormalConjectures/ErdosProblems/90.leanErdos90.sawin_totally_real_tower9 linesExact file
rdBound Q,  Q.Infinite    (∀ qQ, Nat.Prime qq % 4 = 1) ∧      ∀ (N : ℕ),F x,          ∃ (x_1 : CharZero F) (x_2 : NumberField F) (_ : NumberField.IsTotallyReal F),            NModule.finrankF              |↑(NumberField.discr F)| ^ (1 / ↑(Module.finrankF)) ≤ rdBoundqQ, ∃ factors, factors.card = Module.finrankF ∧ ∀ pfactors, p.IsMaximal ∧ ↑qp
SolvedStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page