Table of Contents
Fetching ...

The model theory of perfectoid fields [after Jahnke and Kartas]

Sylvy Anscombe

Abstract

This text was written to support a Bourbaki seminar given in January 2026 on the subject of the model theory of perfectoid fields, especially on the work of Jahnke and Kartas in their paper "Beyond the Fontaine-Wintenberger theorem", J. Amer. Math. Soc. 38 (4), pp. 997-1047, 2025.

The model theory of perfectoid fields [after Jahnke and Kartas]

Abstract

This text was written to support a Bourbaki seminar given in January 2026 on the subject of the model theory of perfectoid fields, especially on the work of Jahnke and Kartas in their paper "Beyond the Fontaine-Wintenberger theorem", J. Amer. Math. Soc. 38 (4), pp. 997-1047, 2025.
Paper Structure (14 sections, 34 theorems, 47 equations, 3 figures)

This paper contains 14 sections, 34 theorems, 47 equations, 3 figures.

Key Result

Theorem 1.2

There is a computableA function $f:\mathbb{N}\rightarrow\mathbb{N}$ is computable if there is a Turing machine that halts with output $f(n)$ on input $n$, for each $n\in\mathbb{N}$, with appropriate coding of natural numbers. function $d\mapsto N_{d}$, such that for any $p>N_{d}$ and any form $F\in

Figures (3)

  • Figure 1: Underlying embedding lemma
  • Figure 2: Standard decomposition at $\pi$
  • Figure 3: Illustration of the proof of Theorem \ref{['thm:first']}

Theorems & Definitions (62)

  • Conjecture 1.1: Artin's Conjecture on forms over $\mathbb{Q}_{p}$
  • Theorem 1.2: AxKochen-IErshov65
  • Theorem 1.3: FontaineWintenberger
  • Remark 1.4
  • Example 1.6
  • Definition 1.7
  • Lemma 1.8: Hensel's Lemma
  • Example 1.10
  • Lemma 1.11: Fundamental equality
  • Lemma 1.12: Abhyankhar's inequality, Abhyankar
  • ...and 52 more