Diophantine Equations over $\mathbb Z$: Universal Bounds and Parallel Formalization
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913918879793152 |
|---|---|
| author | Bayer, Jonas David, Marco Hassler, Malte Matiyasevich, Yuri Schleicher, Dierk |
| author_facet | Bayer, Jonas David, Marco Hassler, Malte Matiyasevich, Yuri Schleicher, Dierk |
| contents | This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers.
Hilbert's Tenth Problem (H10) asks about the decidability of Diophantine equations and has been answered negatively by Davis, Putnam, Robinson and Matiyasevich. It is natural to ask for which subclasses of Diophantine equations H10 remains undecidable. Such subclasses can be defined in terms of universal pairs: bounds on the number of variables $ν$ and degree $δ$ such that all Diophantine equations can be rewritten in at most this complexity. Our work develops explicit universal pairs $(ν, δ)$ for integer unknowns, achieving new bounds that cannot be obtained by naive translations from known results over $\mathbb N$.
In parallel, we have conducted a formal verification of our results using the proof assistant Isabelle. While formal proof verification has traditionally been applied a posteriori to known results, this project integrates formalization into the discovery and development process. In a final section, we describe key insights gained from this unusual approach and its implications for mathematical practice. Our work contributes both to the study of Diophantine equations and to the broader question of how mathematics is conducted in the 21st century. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_20909 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Diophantine Equations over $\mathbb Z$: Universal Bounds and Parallel Formalization Bayer, Jonas David, Marco Hassler, Malte Matiyasevich, Yuri Schleicher, Dierk Number Theory Logic in Computer Science This paper explores multiple closely related themes: bounding the complexity of Diophantine equations over the integers and developing mathematical proofs in parallel with formal theorem provers. Hilbert's Tenth Problem (H10) asks about the decidability of Diophantine equations and has been answered negatively by Davis, Putnam, Robinson and Matiyasevich. It is natural to ask for which subclasses of Diophantine equations H10 remains undecidable. Such subclasses can be defined in terms of universal pairs: bounds on the number of variables $ν$ and degree $δ$ such that all Diophantine equations can be rewritten in at most this complexity. Our work develops explicit universal pairs $(ν, δ)$ for integer unknowns, achieving new bounds that cannot be obtained by naive translations from known results over $\mathbb N$. In parallel, we have conducted a formal verification of our results using the proof assistant Isabelle. While formal proof verification has traditionally been applied a posteriori to known results, this project integrates formalization into the discovery and development process. In a final section, we describe key insights gained from this unusual approach and its implications for mathematical practice. Our work contributes both to the study of Diophantine equations and to the broader question of how mathematics is conducted in the 21st century. |
| title | Diophantine Equations over $\mathbb Z$: Universal Bounds and Parallel Formalization |
| topic | Number Theory Logic in Computer Science |
| url | https://arxiv.org/abs/2506.20909 |