arxiv: 2604.09965 · v2 · submitted 2026-04-11 · 🧮 math.LO

Recognition: unknown

On Cohesive Products of Fields

Henry J. Klatt, Keshav Srinivasan, Rumen Dimitrov, Valentina Harizanov

Pith reviewed 2026-05-10 16:42 UTC · model grok-4.3

classification 🧮 math.LO

keywords cohesive productscohesive powersGalois groupshyper-automorphismscomputable fieldsinfinite Galois extensionsfield extensionsultraproducts

0 comments

The pith

Cohesive products of fields characterize their infinite Galois groups through hyper-automorphism groups for large classes of computable extensions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops cohesive products as effective analogs of ultraproducts for fields, replacing ultrafilters with cohesive sets that cannot be split into two infinite parts by any computably enumerable set. These products are used to study interactions with finite and infinite Galois extensions, including the first-order theories and definability properties of cohesive powers of number fields. For many infinite Galois extensions, the work characterizes the infinite Galois groups of the resulting cohesive powers and introduces hyper-automorphisms that preserve the nonstandard field operations. A complete description of the hyper-automorphism groups for cohesive powers of computable Galois extensions then yields a description of the classical infinite Galois groups of the original fields.

Core claim

For a large class of infinite Galois extensions of computable fields, the hyper-automorphism groups of their cohesive powers admit a complete description, and these groups in turn determine the classical infinite Galois groups of the base fields.

What carries the argument

Cohesive product (or cohesive power) of a field, an effective ultraproduct construction that uses a cohesive set in place of an ultrafilter to preserve computability while enabling analysis of Galois actions and hyper-automorphisms.

Load-bearing premise

The fields and Galois extensions under study admit computable presentations that allow cohesive sets to interact effectively with the algebraic structures.

What would settle it

A specific computable Galois extension where the hyper-automorphism group of a cohesive power fails to match the claimed complete description or does not recover the original infinite Galois group.

read the original abstract

We develop the foundations of effective ultraproducts of fields and their Galois groups using the methods of computability theory. These computability-theoretic analogs of ultraproducts are called cohesive products, since the role of an ultrafilter is played by a cohesive set. A set of natural numbers is cohesive if it is infinite and cannot be partitioned into two infinite subsets by any computably enumerable set. In particular, we investigate the way cohesive products interact with field extensions with emphasis on both finite and infinite Galois extensions, and the associated Galois groups. We study the first-order theories and definability of cohesive powers of number fields, and characterize the infinite Galois groups of cohesive powers for a large class of infinite Galois extensions. Finally, we introduce hyper-automorphisms, which are automorphisms of a cohesive power that respect non-standard field operations, and give a complete description of the hyper-automorphism groups of cohesive powers of a large class of computable Galois extensions, and use them to describe the classical infinite Galois groups of such fields.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Cohesive products give a computable stand-in for ultraproducts on fields and let hyper-automorphisms recover classical infinite Galois groups in effective cases.

read the letter

Hi, the main point is that this paper builds cohesive products of fields by swapping ultrafilters for cohesive sets, then uses the resulting structures to study Galois extensions and introduces hyper-automorphisms to connect back to ordinary Galois groups. The construction is new in this corner of computable algebra and rests on the standard definition of cohesive sets as infinite sets that no c.e. set splits into two infinite pieces. They show the products remain fields, examine how they interact with finite and infinite Galois extensions, work out first-order theories and definability for cohesive powers of number fields, and give explicit descriptions of the infinite Galois groups for a large class of computable extensions. The hyper-automorphism groups are then described completely for those same computable cases, and the authors recover the classical Galois groups from them. That last step is the part that feels most useful if the details hold up. The work is grounded in ordinary computability notions and does not appear to rely on circular definitions. The main limitation is the restriction to computable presentations; everything is effective by design, which is honest but means the results do not immediately apply to arbitrary fields or non-recursive extensions. The abstract claims are stated cleanly, and the stress-test finds no load-bearing gaps once the computability hypotheses are granted, though without the full proofs in front of me it is still hard to judge the technical tightness of the arguments. This is for people already working in computable model theory or effective algebra who want concrete tools for Galois groups. A reader in that subfield would get usable constructions and characterizations. I would not cite it in my own papers in the next year because the scope is narrow, but the ideas are coherent and the approach is straightforward enough that it deserves a serious referee. Recommendation: send it out for peer review.

Referee Report

0 major / 3 minor

Summary. The paper develops foundations for effective ultraproducts of fields called cohesive products, in which cohesive sets (infinite sets not splittable into two infinite c.e. sets) replace ultrafilters. It examines preservation of field structure and Galois extensions under these products, studies first-order theories and definability for cohesive powers of number fields, characterizes infinite Galois groups of cohesive powers for a large class of infinite Galois extensions, introduces hyper-automorphisms (automorphisms respecting non-standard operations), and gives explicit descriptions of the hyper-automorphism groups of cohesive powers of computable Galois extensions, using these to recover descriptions of the classical infinite Galois groups.

Significance. If the central characterizations hold, the work supplies a computability-theoretic framework for studying infinite Galois groups that is more effective than classical ultraproduct methods. The explicit descriptions of hyper-automorphism groups and their reduction to classical Galois groups constitute a concrete advance in effective Galois theory. The constructions rest on standard definitions of cohesive sets and fields without evident circularity, and the restriction to computable presentations is stated explicitly, allowing the results to be assessed within that scope.

minor comments (3)

The abstract states that the characterizations apply to 'a large class' of extensions; the introduction or §2 should give a precise statement of the class (e.g., via a list of closure properties or a named family of fields) so that the scope is unambiguous.
Notation for the cohesive product operation and for hyper-automorphisms should be fixed early and used consistently; occasional shifts between functional and relational notation for the non-standard operations could be clarified.
The paper would benefit from a short table or diagram contrasting the properties of cohesive products with those of ordinary ultraproducts (e.g., which first-order sentences transfer, which Galois-theoretic features are preserved).

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading, positive summary, and assessment of the significance of our work. The recommendation of minor revision is noted, and we will make any necessary adjustments to improve clarity or presentation in the revised version.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper develops cohesive products from the standard definition of cohesive sets in computability theory and applies them to field extensions and Galois groups using classical constructions. All characterizations of hyper-automorphism groups and infinite Galois groups follow directly from the effective definitions and preservation properties without any self-definitional loops, fitted inputs renamed as predictions, or load-bearing self-citations. The work remains self-contained against external benchmarks in computability and field theory.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 2 invented entities

The paper rests on standard background from computability theory and field theory; it introduces two new constructions without independent evidence outside the definitions themselves.

axioms (2)

standard math Cohesive sets exist and satisfy the stated partition properties
Standard definition in computability theory invoked to replace ultrafilters.
domain assumption Fields admit computable presentations when required for the constructions
Assumed for the characterizations of Galois groups of cohesive powers.

invented entities (2)

cohesive product no independent evidence
purpose: Effective analog of an ultraproduct of fields
New construction defined in the paper using cohesive sets.
hyper-automorphism no independent evidence
purpose: Automorphism of a cohesive power that respects non-standard field operations
Introduced to describe symmetries and recover classical Galois groups.

pith-pipeline@v0.9.0 · 5483 in / 1411 out tokens · 56316 ms · 2026-05-10T16:42:07.073779+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

37 extracted references · 4 canonical work pages

[2]

Ash and Julia Knight,Computable Structures and the Hyperarithmetical Hierarchy, Studies in Logic and the Foundations of Mathematics, vol

Christopher J. Ash and Julia Knight,Computable Structures and the Hyperarithmetical Hierarchy, Studies in Logic and the Foundations of Mathematics, vol. 144, North-Holland Publishing Co., Amsterdam, 2000. 44 DIMITROV, HARIZANOV, KLATT, AND SRINIVASAN

2000
[3]

II, Transactions of the American Mathematical Society257(1980), no

Jan Denef,Diophantine sets of algebraic integers. II, Transactions of the American Mathematical Society257(1980), no. 1, 227–236

1980
[4]

2, 111–132

Rumen Dimitrov,A class ofΣ 0 3 modular lattices embeddable as principal filters in L∗(V∞), Archive for Mathematical Logic47(2008), no. 2, 111–132

2008
[5]

Sv. Kliment Ohridski

,Cohesive powers of computable structures, Godishnik na Sofi˘ ıskiya Universitet “Sv. Kliment Ohridski”. Fakultet po Matematika i Informatika. Annuaire de l’Universit´ e de Sofia “St. Kliment Ohridski”. Facult´ e de Math´ ematiques et Informatique99(2009), 193–201

2009
[6]

6, 440–477

Rumen Dimitrov and Valentina Harizanov,Orbits of maximal vector spaces, Algebra and Logic54(2016), no. 6, 440–477. (English translation)

2016
[7]

1989–2009

,Countable nonstandard models: following Skolem’s approach, Handbook of the History and Philosophy of Mathematical Practice, 2024, pp. 1989–2009

2024
[8]

,Effective ultrapowers and applications, Lecture Notes Series 42, Institute for Mathematical Sciences, National University of Singapore: Aspects of Computation and Automata Theory with Applications, 2024, pp. 201–221

2024
[9]

Mourad,Isomorphisms on non-standard fields and Ash’s conjecture, Lecture Notes in Computer Science 8493: Language, Life, Limits, Springer, Cham, 2014, pp

Rumen Dimitrov, Valentina Harizanov, Russell Miller, and Karim J. Mourad,Isomorphisms on non-standard fields and Ash’s conjecture, Lecture Notes in Computer Science 8493: Language, Life, Limits, Springer, Cham, 2014, pp. 143–152

2014
[10]

Rumen Dimitrov, Valentina Harizanov, Andrey Morozov, Paul Shafer, Alexandra Soskova, and Stefan Vatev,Cohesive powers of linear orders, Lecture Notes in Computer Science 11558: Computing with Foresight and Industry, Springer, Cham, 2019, pp. 168–180

2019
[11]

,On cohesive powers of linear orders, Journal of Symbolic Logic88(2023), 947–1004

2023
[12]

Dummit and Richard M

David S. Dummit and Richard M. Foote,Abstract algebra, 3rd ed., John Wiley & Sons, Hoboken, NJ, 2004

2004
[13]

Scott, and Stanley Tennenbaum,Models of arithmetic through function rings, Notices of the American Mathematical Society6(1959), no

Solomon Feferman, Dana S. Scott, and Stanley Tennenbaum,Models of arithmetic through function rings, Notices of the American Mathematical Society6(1959), no. 2, 173–174. Abstract 556-31

1959
[14]

Fokina, Valentina Harizanov, and Alexander G

Ekaterina B. Fokina, Valentina Harizanov, and Alexander G. Melnikov,Computable model theory, Turing’s Legacy: Developments from Turing’s Ideas in Logic, 2014, pp. 124–194

2014
[15]

Shepherdson,Effective procedures in field theory, Philosophical Transactions of the Royal Society of London, Series A: Mathematical and Physical Sciences248(1956), no

Albrecht Fr¨ ohlich and Jon C. Shepherdson,Effective procedures in field theory, Philosophical Transactions of the Royal Society of London, Series A: Mathematical and Physical Sciences248(1956), no. 950, 407–432, available at https://royalsocietypublishing.org/rsta/article-pdf/248/950/407/266608/rsta.1956.0003.pdf

work page arXiv 1956
[16]

Valentina Harizanov and Keshav Srinivasan,Cohesive powers of structures, Archive for Mathematical Logic63(2024), 679–702

2024
[17]

2, 111–126

Yoram Hirschfeld,Models of arithmetic and recursive functions, Israel Journal of Mathematics20(1975), no. 2, 111–126

1975
[18]

Wheeler,Forcing, Arithmetic, Division Rings, Lecture Notes in Mathematics, vol

Yoram Hirschfeld and William H. Wheeler,Forcing, Arithmetic, Division Rings, Lecture Notes in Mathematics, vol. 454, Springer-Verlag, Berlin–New York, 1975

1975
[19]

Keisler,The ultraproduct construction, Contemporary mathematics, 2010, pp

Jerome H. Keisler,The ultraproduct construction, Contemporary mathematics, 2010, pp. 163–179

2010
[20]

Jochen Koenigsmann,DefiningZinQ,Annals of Mathematics183(2016), 73–93

2016
[21]

preprint, https://arxiv.org/pdf/2412.01768

Peter Koymans and Carlo Pagano,Hilbert’s tenth problem via additive combinatorics, 2024. preprint, https://arxiv.org/pdf/2412.01768

work page arXiv 2024
[22]

ON COHESIVE PRODUCTS OF FIELDS 45

Manuel Lerman,Recursive functions modulo co- r-maximal sets, Transactions of the American Mathematical Society148 (1970), 429–444. ON COHESIVE PRODUCTS OF FIELDS 45

1970
[23]

,Degrees of Unsolvability: Local and Global Theory, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1983

1983
[24]

McLaughlin,Some extension and rearrangement theorems for Nerode semirings, Zeitschrift f¨ ur Mathematische Logik und Grundlagen der Mathematik35(1989), 197–209

Thomas G. McLaughlin,Some extension and rearrangement theorems for Nerode semirings, Zeitschrift f¨ ur Mathematische Logik und Grundlagen der Mathematik35(1989), 197–209

1989
[25]

Milne,Fields and Galois theory, Kea Books, Ann Arbor, MI, 2022

James S. Milne,Fields and Galois theory, Kea Books, Ann Arbor, MI, 2022

2022
[26]

Antonio Montalb´ an,Computable Structure Theory: Within the Arithmetic, Perspectives in Logic, Cambridge University Press, Cambridge, 2021

2021
[27]

Antonio Montalb´ an,Computable Structure Theory: Beyond the Arithmetic, Perspectives in Logic, Cambridge University Press, 2026

2026
[28]

5, 961–980

Jennifer Park,A universal first-order formula defining the ring of integers in a number field, Mathematical Research Letters20(2013), no. 5, 961–980

2013
[29]

Pohst,Factoring polynomials over global fields I, Journal of Symbolic Computation39(2005), no

Michael E. Pohst,Factoring polynomials over global fields I, Journal of Symbolic Computation39(2005), no. 6, 617–630

2005
[30]

Bjorn Poonen,Using elliptic curves of rank one towards the undecidability of Hilbert’s tenth problem over rings of algebraic integers, Algorithmic Number Theory, 2002, pp. 33–42

2002
[31]

Rabin,Computable algebra, general theory and theory of computable fields, Transactions of the American Mathematical Society95(1960), no

Michael O. Rabin,Computable algebra, general theory and theory of computable fields, Transactions of the American Mathematical Society95(1960), no. 2, 341–360

1960
[32]

Julia Robinson,Definability and decision problems in arithmetic, Journal of Symbolic Logic14(1949), 98–114

1949
[33]

preprint, https://arxiv.org/abs/2202.04998

Paul Shafer,Effective powers of ω over∆ 2 cohesive sets and infiniteΠ 1 sets without ∆2 cohesive subsets, 2023. preprint, https://arxiv.org/abs/2202.04998

work page arXiv 2023
[34]

Alexandra Shlapentokh,Rings of algebraic numbers in infinite extensions of Q and elliptic curves retaining their rank, Archive for Mathematical Logic48(2009), 77–114

2009
[35]

Thoralf Skolem, ¨Uber die nicht-charakterisierbarkeit der Zahlenreihe mittels endlich oder abz¨ ahlbar unendlich vieler aussagen mit ausschliesslich Zahlenvariablen, Fundamenta Mathematicae23(1934), 150–161

1934
[36]

Soare,Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987

Robert I. Soare,Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1987

1987
[37]

,Turing Computability, Springer-Verlag, Berlin, 2016

2016
[38]

preprint, https://arxiv.org/abs/2505.16960

David Zywina,Rank one elliptic curves and rank stability, 2025. preprint, https://arxiv.org/abs/2505.16960. 46 DIMITROV, HARIZANOV, KLATT, AND SRINIVASAN Department of Mathematics & Philosophy, Western Illinois University, 476 Morgan Hall, 1 University Circle, Macomb, IL 61455, USA Email address:rd-dimitrov@wiu.edu URL:http://www.wiu.edu/users/rdd104/ Dep...

work page arXiv 2025