Metraipolis › archive › dc_cf3ff3e5b820

The set of primes is supernatural: a Lean formalization of the statement of the conjecture — arXiv:2608.08643

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.08643
License (as archived)
CC0-1.0
Archived
2026-10-19T09:17:55.625Z
SHA-256 of the archived text
ab886cf7128f18655e3563a65167dc4c368ce79813883f07e52e3a7800c1776b
Stable URL of this page
https://metraipolis.com/documento/dc_cf3ff3e5b820

How to cite

The set of primes is supernatural: a Lean formalization of the statement of the conjecture — arXiv:2608.08643 — arXiv (en), https://arxiv.org/abs/2608.08643 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cf3ff3e5b820 (Metraipolis archive dc_cf3ff3e5b820, sha256 ab886cf7128f18655e3563a65167dc4c368ce79813883f07e52e3a7800c1776b)
BibTeX
@misc{dccf3ff3e5b820,
  title = {The set of primes is supernatural: a Lean formalization of the statement of the conjecture — arXiv:2608.08643},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.08643},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cf3ff3e5b820; sha256 ab886cf7128f18655e3563a65167dc4c368ce79813883f07e52e3a7800c1776b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08643. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The paper \emph{Conjecture: the set of prime numbers is supernatural} conjectures that no non-constant function built from the identity and constants by finitely many pointwise additions, multiplications, and exponentiations maps every positive integer to a prime. We give a complete Lean~4 formalization of that paper over Mathlib: every definition, example, remark, numbered result, and experimental table row has a machine-checked counterpart, with no \lcode{sorry}. The conjecture and similar generalizations are stated exactly, as named open problems. So stated, the conjecture becomes a precise target: an automated reasoning system can now attempt a kernel-checked proof.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.08643 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:14:28.539Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).