9
$\begingroup$

I am looking for a modern proof of the so-called "Theorem of the Base"--that the Neron-Severi rank of a smooth projective variety is finite. One can prove this for varieties over $\mathbb{C}$ easily via transcendental methods---however, the most recent proof I can find which works e.g. in positive characteristic is due to Lang and Neron and is written in the language of Weil's foundations. (Lang includes a similar proof in his book "Diophantine Geometry.")

Does anyone know of a proof written in the language of schemes?

My motivation is that I'd like to have a brief reading seminar on this theorem with some graduate students at my institution---while it looks like the Lang/Neron paper is translatable, I think that this sort of translation is a serious burden for seminar participants. So it would be nice to have a more modern reference.

$\endgroup$
3
  • 1
    $\begingroup$ SGA 6, Exp. XIII $\endgroup$ – Jason Starr Jul 31 '12 at 21:57
  • 2
    $\begingroup$ In the article by B. Kahn, "Sur le groupe des classes d’un schéma arithmétique (avec un appendice de Marc Hindry), Bull. Soc. Math. France 134 (2006), 395–415 in par. 1, p. 400 a survey of the available proofs is given. It seems that Lang and Néron proof was never translated. $\endgroup$ – Damian Rössler Aug 1 '12 at 9:21
  • 2
    $\begingroup$ Thanks Damian--that's a nice article. The appendix actually contains a (brief) exposition of the essential arithmetic content of the Lang/Neron proof, which is also contained here (math.stanford.edu/~conrad/papers/Kktrace.pdf) in rather more detail (BCnrd pointed me to this article via email). I think I can extract the geometric content from Lang, so this probably suffices. $\endgroup$ – Daniel Litt Aug 1 '12 at 17:46
8
$\begingroup$

SGA 6, Exp. XIII

$\endgroup$
1
  • $\begingroup$ Ah, thanks--I also just found a proof in Milne's "Etale Cohomology." I'm still interested in knowing if there's a writeup of Neron's proof relating the theorem to Mordell-Weil. $\endgroup$ – Daniel Litt Jul 31 '12 at 21:59

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.