Computably Categorical Fields via Fermats Last Theorem

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically computable (infinite) transcendence basis.

💡 Research Summary

The paper addresses a long‑standing gap in computable model theory: the existence of a computable field of infinite transcendence degree over ℚ that is also computably categorical. After reviewing the notions of computable structures, computable copies, and computable categoricity, the authors introduce the Fermat polynomials (F_n(X,Y)=X^{n}+Y^{n}-1) for each integer (n\ge 3). By Fermat’s Last Theorem, these equations have no non‑trivial integer solutions, which guarantees that the associated algebraic curves are smooth, irreducible, and have no rational points other than the trivial ones. This property is exploited to generate a sequence of independent transcendental extensions.

For each (n) the authors adjoin two new transcendental elements (t_n) and (s_n) satisfying the relation (t_n^{,n}+s_n^{,n}=1). The key technical lemma shows that the pairs ({t_n,s_n}) are algebraically independent over the field generated by all earlier pairs. The proof uses dimension theory of varieties and the fact that the defining polynomial is absolutely irreducible, ensuring that any algebraic dependence would produce a rational point on a Fermat curve, contradicting FLT. By iterating this construction, they obtain a field (F) that is the union of an increasing chain of finitely generated extensions, each adding a fresh independent pair. Consequently, (F) has infinite transcendence degree over ℚ.

The authors then establish that (F) is a computable structure. They provide explicit algorithms for enumerating the elements, evaluating field operations, and handling the defining equations. Each step of the construction is effective: given a code for an element at stage (k), one can compute its image at stage (k+1) by solving the polynomial equation (X^{n}+Y^{n}=1) for the new variables, a task that is decidable because the polynomial is monic in each variable. Hence the domain and operations of (F) are recursively enumerable and, in fact, recursive.

To prove computable categoricity, the paper shows that any two computable copies (F_1) and (F_2) of the same field are computably isomorphic. The isomorphism is built inductively: at stage (n) one matches the pair ((t_n,s_n)) in (F_1) with the unique pair in (F_2) satisfying the same Fermat equation. Because the minimal polynomial of each new element is known (the Fermat polynomial itself), the matching is uniquely determined and can be carried out by a Turing machine. The inductive limit of these partial isomorphisms yields a total computable isomorphism between (F_1) and (F_2).

Finally, the authors demonstrate that (F) possesses an intrinsically computable transcendence basis. The set ({t_n\mid n\ge 3}) serves as a transcendence basis, and each (t_n) is uniquely characterized by the monic polynomial (X^{n}+Y^{n}-1) together with the condition that the accompanying (s_n) also satisfies the same equation. Since these defining data are uniform and effective, any computable presentation of (F) can recover the same basis by a uniform algorithm. Thus the basis is not merely computable in a particular copy but is intrinsic to the field’s structure.

In summary, the paper constructs a concrete example of a computable, computably categorical field of infinite transcendence degree, using the arithmetic rigidity of Fermat curves. It bridges techniques from algebraic geometry, number theory, and computable model theory, and it settles the open question of whether such fields can have an intrinsically computable transcendence basis. The work opens new avenues for exploring the interplay between algebraic independence and effective categoricity in higher‑dimensional algebraic structures.