Breuil's classification conjecture for pp-divisible groups and finite flat group schemes

About 16 years old · traced to

Let kk be a perfect field of characteristic pp, let W(k)W(k) be its ring of Witt vectors, let K0=W(k)[1/p]K_0=W(k)[1/p], and let KK be a finite totally ramified extension of K0K_0 with ring of integers OK\mathscr{O}_K. Set S=W(k)[[u]]\mathfrak{S}=W(k)[[u]], equipped with Frobenius φ(u)=up\varphi(u)=u^p. Write Mod⁡‾S(φ)⩽1\underline{\operatorname{Mod}}_{\mathfrak{S}}(\varphi)^{\leqslant 1} for the category of Kisin modules of height at most 11, and (Mod⁡/S)⩽1(\operatorname{Mod}/\mathfrak{S})^{\leqslant1} for the corresponding torsion category. Let GK∞=Gal⁡(K‾/K∞)\boldsymbol{\mathcal{G}}_{K_\infty}=\operatorname{Gal}(\overline K/K_\infty), and let TS∗T^*_{\mathfrak{S}} denote the associated contravariant functors. Breuil's conjecture. There exists an exact anti-equivalence of categories

G↭MGG\leftrightsquigarrow\mathfrak{M}_G

between pp-divisible groups over OK\mathscr{O}_K and Mod⁡‾S(φ)⩽1\underline{\operatorname{Mod}}_{\mathfrak{S}}(\varphi)^{\leqslant1}, compatible with contravariant Dieudonné crystals and inducing a natural GK∞\boldsymbol{\mathcal{G}}_{K_\infty}-equivariant isomorphism Tp(G)≅TS∗(MG)T_p(G)\cong T^*_{\mathfrak{S}}(\mathfrak{M}_G). Likewise, there exists an exact anti-equivalence

H↭MHH\leftrightsquigarrow\mathfrak{M}_H

between pp-power order finite flat group schemes over OK\mathscr{O}_K and (Mod⁡/S)⩽1(\operatorname{Mod}/\mathfrak{S})^{\leqslant1}, compatible with contravariant Dieudonné crystals and inducing a natural GK∞\boldsymbol{\mathcal{G}}_{K_\infty}-equivariant isomorphism H(K‾)≅TS∗(MH)H(\overline K)\cong T^*_{\mathfrak{S}}(\mathfrak{M}_H). The paper proves this conjecture, including the compatibility with crystalline Dieudonné theory and the associated Galois representations.

References

Primary source

Wausu Kim, “The classification of p-divisible groups over 2-adic discrete valuation rings”, arXiv:1007.1904 (2011).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.