Computability in infinite Galois theory and algorithmically random algebraic fields
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929408666763264 |
|---|---|
| author | Calvert, Wesley Harizanov, Valentina Shlapentokh, Alexandra |
| author_facet | Calvert, Wesley Harizanov, Valentina Shlapentokh, Alexandra |
| contents | We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic fields which are not random. We also partially characterize the index set, relative to an oracle, of the set of random algebraic fields computable relative to that oracle.
In order to carry out this investigation of randomness for fields, we develop computability in the context of infinite Galois theory (where the relevant Galois groups are uncountable), including definitions of computable and computably enumerable Galois groups and computability of Haar measure on the Galois groups. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_04741 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Computability in infinite Galois theory and algorithmically random algebraic fields Calvert, Wesley Harizanov, Valentina Shlapentokh, Alexandra Logic Number Theory 03C57, 03D45, 11u39, 03D32 We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic fields which are not random. We also partially characterize the index set, relative to an oracle, of the set of random algebraic fields computable relative to that oracle. In order to carry out this investigation of randomness for fields, we develop computability in the context of infinite Galois theory (where the relevant Galois groups are uncountable), including definitions of computable and computably enumerable Galois groups and computability of Haar measure on the Galois groups. |
| title | Computability in infinite Galois theory and algorithmically random algebraic fields |
| topic | Logic Number Theory 03C57, 03D45, 11u39, 03D32 |
| url | https://arxiv.org/abs/2312.04741 |