Concept

Crystalline cohomology

In mathematics, crystalline cohomology is a Weil cohomology theory for schemes X over a base field k. Its values Hn(X/W) are modules over the ring W of Witt vectors over k. It was introduced by and developed by . Crystalline cohomology is partly inspired by the p-adic proof in of part of the Weil conjectures and is closely related to the algebraic version of de Rham cohomology that was introduced by Grothendieck (1963). Roughly speaking, crystalline cohomology of a variety X in characteristic p is the de Rham cohomology of a smooth lift of X to characteristic 0, while de Rham cohomology of X is the crystalline cohomology reduced mod p (after taking into account higher Tors). The idea of crystalline cohomology, roughly, is to replace the Zariski open sets of a scheme by infinitesimal thickenings of Zariski open sets with divided power structures. The motivation for this is that it can then be calculated by taking a local lifting of a scheme from characteristic p to characteristic 0 and employing an appropriate version of algebraic de Rham cohomology. Crystalline cohomology only works well for smooth proper schemes. Rigid cohomology extends it to more general schemes. For schemes in characteristic p, crystalline cohomology theory can handle questions about p-torsion in cohomology groups better than p-adic étale cohomology. This makes it a natural backdrop for much of the work on p-adic L-functions. Crystalline cohomology, from the point of view of number theory, fills a gap in the l-adic cohomology information, which occurs exactly where there are 'equal characteristic primes'. Traditionally the preserve of ramification theory, crystalline cohomology converts this situation into Dieudonné module theory, giving an important handle on arithmetic problems. Conjectures with wide scope on making this into formal statements were enunciated by Jean-Marc Fontaine, the resolution of which is called p-adic Hodge theory.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.