# The Erdős–Ulam problem

A statement in qed.bot, the register of claims of AI work in mathematics. The register grades the evidence attached to each claim; it never rules on whether a proof is correct.

- Identifier: wikipedia:ErdosUlamProblem
- Collection: Wikipedia
- Page: https://qed.bot/s/wikipedia-erdosulamproblem
- Formal record: mixed
- Machine-checked: yes, by Palomar
- Fidelity F3: The project checks its proof with Comparator against a statement from a corpus written separately from the proof, and held here.
- Source: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/ErdosUlamProblem.lean

## AI claims

No AI contribution is recorded against this statement.

## Checks

- verified, by Palomar: Registered by Palomar at 5b3e4ae1: Comparator confirmed 1 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel (https://palomar-registry.org/entry.html?id=PALOMAR-2026-11-09-000002)

## Formal statements

- FormalConjectures/Wikipedia/ErdosUlamProblem.lean, https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/Wikipedia/ErdosUlamProblem.lean

Cite as: qed.bot, "The Erdős–Ulam problem", https://qed.bot/s/wikipedia-erdosulamproblem, as of 20 Nov 2026. The register's data is published under CC BY 4.0: https://creativecommons.org/licenses/by/4.0/
