Pi as Detection of Discreteness

If physical circle quotients have an attained best approximation to the unattainable pi — that is, if there is a smallest positive error epsilon_min > 0 that no physical circle quotient can beat, and that best error is actually attained (P-obs) — then the length system S is discrete and finite. This paper proves the Detection Theorem: assume P-obs (over admissible diameters), then S is discrete and finite. The thesis is conditional: we prove if P-obs, then discrete and finite. We do not prove P-obs. Version 8 / LAGAD 11 is a reference-verification version. No proofs changed. Four references corrected from searched sources: [6] Niven given year 1947 and DOI 10.1090/s0002-9904-1947-08821-2; [4] Kaczorowski given Zenodo record 14648252; [2] KSO given full title, corrected publication date 12 Dec 2025 (not 19 Dec), and Zenodo record 18263754, no longer 'unpublished'; [5] Gauss split so the circle problem is no longer claimed to be in Disquisitiones Arithmeticae 1801, but cited via Hardy 1959. Related work: Hellman, B. Pi as an Unattainable Limit in a Finite Discrete Universe. Zenodo, 13 Nov 2026. DOI: 10.5281/zenodo.24203370. Version 9 / LAGAD 12 adds DOI and copyright line to front page only. No proofs changed. No references changed. Content otherwise identical to Version 8 / LAGAD 11. DOI: 10.5281/zenodo.24252012. © 2026 Björn Hellman. Licensed under CC BY 4.0.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-15
DOI
https://doi.org/10.5281/zenodo.24252011
Primary Topic
History and Theory of Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Pi as Detection of Discreteness

Björn Hellman
Zenodo (CERN European Organization for Nuclear Research)
History and Theory of Mathematics
preprint

Pi as Detection of Discreteness

Björn Hellman
preprint en

Abstract

If physical circle quotients have an attained best approximation to the unattainable pi — that is, if there is a smallest positive error epsilon_min > 0 that no physical circle quotient can beat, and that best error is actually attained (P-obs) — then the length system S is discrete and finite. This paper proves the Detection Theorem: assume P-obs (over admissible diameters), then S is discrete and finite. The thesis is conditional: we prove if P-obs, then discrete and finite. We do not prove P-obs. Version 8 / LAGAD 11 is a reference-verification version. No proofs changed. Four references corrected from searched sources: [6] Niven given year 1947 and DOI 10.1090/s0002-9904-1947-08821-2; [4] Kaczorowski given Zenodo record 14648252; [2] KSO given full title, corrected publication date 12 Dec 2025 (not 19 Dec), and Zenodo record 18263754, no longer 'unpublished'; [5] Gauss split so the circle problem is no longer claimed to be in Disquisitiones Arithmeticae 1801, but cited via Hardy 1959. Related work: Hellman, B. Pi as an Unattainable Limit in a Finite Discrete Universe. Zenodo, 13 Nov 2026. DOI: 10.5281/zenodo.24203370. Version 9 / LAGAD 12 adds DOI and copyright line to front page only. No proofs changed. No references changed. Content otherwise identical to Version 8 / LAGAD 11. DOI: 10.5281/zenodo.24252012. © 2026 Björn Hellman. Licensed under CC BY 4.0.

Zenodo (CERN European Organization for Nuclear Research)
History and Theory of Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon