2000 character limit reached
Log-decay -isocrystals on higher dimensional varieties
Published 13 Feb 2019 in math.NT and math.AG | (1902.04730v1)
Abstract: Let be a perfect field of positive characteristic and let be a smooth irreducible quasi-compact scheme over . The Drinfeld-Kedlaya theorem states that for an irreducible -isocrystal on , the gap between consecutive generic slopes is bounded by one. In this note we provide a new proof of this theorem. Our proof utilizes the theory of -isocrystals with -log decay. We first show that a rank one -isocrystal with -log decay is overconvergent if $r<1$. Next, we establish a connection between slope gaps and the rate of log-decay of the slope filtration. The Drinfeld-Kedlaya theorem then follows from a simple patching argument.
Paper Prompts
Sign up for free to create and run prompts on this paper.