Algorithmic universal étale $(\varphi,Γ)$-modules
Abstract
Let be a finite extension and let be a connected reductive group with connected center satisfying (the Coxeter number). We write down explicit polynomial equations for the reduced Emerton-Gee stacks (the Borel and the twisted Borel versions that jointly cover the entire ), by introducing the mod Weil-Deligne stacks capturing derived structures of -modules in reduced families. This allows us to algorithmically compute the set of irreducible components of , thereby establishing its equidimensionality, and the existence of crystalline lifts by showing the total number of irreducible components equals the number of (mod ) crystalline (or potentially semistable) components. The last step of the arguments is to interpolate the rigid analytic Weil-Deligne stacks and the mod Weil-Deligne stacks to deduce the number of potentially semistable components. An initial implementation of the algorithms based on Gr\"obner basis establishes the existence of crystalline lifts in the case for all , and in the remaining , and cases for all but finitely many .
Cite
@article{arxiv.2608.01567,
title = {Algorithmic universal étale $(\varphi,Γ)$-modules},
author = {Zhongyipan Lin},
journal= {arXiv preprint arXiv:2608.01567},
year = {2026}
}
Comments
68 pages