University of Cambridge > Talks.cam > Number Theory Seminar > The relative Breuil-Kisin classification of p-divisible groups

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The relative Breuil-Kisin classification of p-divisible groups

Download to your calendar using vCal

If you have a question about this talk, please contact Tom Fisher .

Let p>2 be a prime, and let O_K be a p-adically complete discrete valuation ring with perfect residue field. Then Kisin proved that p-divisible groups over O_K can be classified by some concrete semi-linear algebra object, which are often called Kisin modules (or sometimes, Breuil-Kisin modules; or even, Breuil modules).

In this talk, we generalise this result to p-divisible groups over an affine formal base which is formally smooth over some p-adic dvr, under some mild finiteness hypothesis on the base—for example, we allow the base to be the completion of an affine smooth scheme over Zp along the special fibre. We also show compatibility of various construction of (Zp-lattice) Galois representations, including the relative version of Faltings’ integral comparison theorem for p-divisible groups.

This talk is part of the Number Theory Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lewin Stroke & Rehabilitation Unit, Seminar Room, R2, Addenbrooke's Hospital Alice Fisher Lecture Theatre, S Block, Addenbrooke's Site Union Society Building, 9a Bridge Street

Other talks

TBC Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa Title to be confirmed TBC Director's Briefing The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity