Weak approximation for Fano complete intersections in positive characteristic (Q2675331)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    Weak approximation for Fano complete intersections in positive characteristic
    scientific article

      Statements

      Weak approximation for Fano complete intersections in positive characteristic (English)
      0 references
      0 references
      0 references
      0 references
      21 September 2022
      0 references
      Let \(k\) be an algebraically closed field of characteristic \(p\geq 0\), and let \(B\) be a smooth connected curve defined over \(k\). Let \[ X_B \subset B\times_{\mathrm{Spec}\, k}\mathbb{P}^n_k \] be a complete intersection of multidegree \((d_1,\dots,d_c)\). If \(X_B\) is Fano, i.e. if \(n+1-(d_1+\dots d_c)>0\), the complete intersection \(X_B\) has at least one \(k(B)\)-point by Tsen's theorem. If \(X_B\) is singular, this statement is optimal, as shown by a cone over a Calabi-Yau hypersurface without \(k(B)\)-points. If \(X_B\) is Fano and smooth one expects that there are infinitely many \(k(B)\)-points, and even that weak approximation holds, i.e. density of \(k(B)\)-points on the set of adelic points. In characteristic \(p=0\), the work of \textit{B. Hassett} and \textit{Y. Tschinkel} [Invent. Math. 163, No. 1, 171--190 (2006; Zbl 1095.14049)] and two of the authors [J. Reine Angew. Math. 752, 1--23 (2019; Zbl 1419.14028)] implies weak approximation at places of (strong) potentially good reduction. In this paper they prove a similar result in positive characteristic: assume that \(p>\max(d_1, \dots,d_c)\) and \(n+1-(d_1+\dots d_c)>1\). Then weak approximation holds for (strong) potentially good reduction complete intersections of this type. The same statement holds for Fano index one, i.e. \(n+1-(d_1+\dots d_c)=1\), if one also assumes that \(p\) is prime to the Gromov-Witten invariant of \(1\)-pointed conics.
      0 references
      weak approximation
      0 references
      separably rationally connected
      0 references
      stability
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references