MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Assuming the standard conjectures (and whatever is needed in addition), is there a nice proof of the Weil-conjectures written completely in the language of motives?

share|cite|improve this question… duplicate? – David Corwin Jul 30 '13 at 19:34
up vote 6 down vote accepted

See Theorem 5.6 in Kleiman's article "The Standard Conjectures", in the Motives volume (PSPM 55.1). I'm not quite sure what you mean by "written completely in the language of motives", so it might not be exactly what you are looking for.

I initially posted this as a comment, but it really should be an answer, so I'm re-posting it as one.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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