Finite descent obstruction and non-abelian reciprocity
Otto Overkamp

TL;DR
This paper compares the finite descent obstruction and Kim's iterative construction for locating rational points on algebraic varieties over number fields, showing their essential equivalence.
Contribution
It demonstrates that the finite descent obstruction and Kim's iterative approach are fundamentally equivalent methods for understanding rational points.
Findings
Finite descent obstruction and Kim's construction are essentially equivalent.
The main result bridges two prominent approaches in Diophantine Geometry.
Provides a unified perspective on rational point detection methods.
Abstract
For a nice algebraic variety over a number field , one of the central problems of Diophantine Geometry is to locate precisely the set inside , where denotes the ring of ad\`eles of . One approach to this problem is provided by the finite descent obstruction, which is defined to be the set of adelic points which can be lifted to twists of torsors for (certain) finite \'etale group schemes over on . More recently, Kim proposed an iterative construction of another subset of which contains the set of rational points. In this paper, we compare the two constructions. Our main result shows that the two approaches are essentially equivalent.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
