First-order definability of affine Campana points in the projective line over a number field
Juan Pablo De Rasis
TL;DR
This work establishes a $\forall\exists$-definability framework for affine Campana points on $\mathbb{P}^1_K$, constructing a uniform, parameter-free description that realises a filtration between the number field $K$ and its rings of $S$-integers $\mathcal{O}_{K,S}$. The authors marry quaternion algebras, Hilbert symbols, and carefully engineered diophantine sets to encode local valuations and finite-place data, enabling a globally uniform description of Campana points with explicit quantifier and degree bounds. They prove that for any number field $K$, finite $S$ containing the archimedean places, and $n\ge 2$, the Campana set $C_{K,S,n}$ is $\forall\exists$-definable with a fixed, explicit quantifier structure and a polynomial degree bound, uniform in $S$. The approach extends to Campana points with arbitrary divisors, yielding a principled way to express $S$-integers and generalized Campana sets via first-order logic, with potential implications for the study of decidability and definability in number fields. The results provide a concrete, computable bridge between $K$ and $\mathcal{O}_{K,S}$ through a well-controlled logical framework and paves the way for further applications to Darmon-type points and related Diophantine constructions.
Abstract
We offer a $\forall\exists$-definition for (affine) Campana points over $\mathbb{P}^1_K$ (where $K$ is a number field), which constitute a set-theoretical filtration between $K$ and $\mathcal{O}_{K,S}$ ($S$-integers), which are well-known to be universally defined (Koenigsmann 2010, Park 2012, Eisentraeger & Morrison 2016). We also show that our formulas are uniform with respect to all possible $S$, are parameter-free as such, and we count the number of involved quantifiers and offer a bound for the degree of the defining polynomial.
