You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
I've also been trying to learn more about the Riemann Hypothesis for varieties over finite fields - part of the Weil Conjectures - and how it's connected to motives. I'm giving a talk about that at the Grothendieck conference next week on Wednesday, and here are my slides:
(If anyone sees mistakes please let me know! I'm being a bit vague here and there, and I'll fill in some details when I talk... but there could also be actual serious errors.)
Just a tip: I had trouble at first seeing the 'Next' Button on the web page where the slides begin, off in the left-hand corner. That and the 'Previous' button on the pages afterwards are used to navigate.
Very cool!
Now I wonder how the concrete numbers one gets for eg the elliptic curve you give are related to the objects in the category of motives...
I've been having trouble getting straight talk on that issue, David. I'm sure its understood but I haven't found a full explanation I can understand - it's probably too easy for the experts.
I believe any elliptic curve over a finite field breaks up into 3 or 4 motives.
They all contain one copy of the "point" - the motive corresponding to a 1-point variety.
And they all contain the square of the Lefschetz motive: that's that provides the leading term in Hasse's formula for the number of points, which is over the field with elements.
The fun part of an elliptic curve (or any curve) is the "1-dimensional" part - technically the motive of "weight 1".
I hear that generically this is an irreducible (simple) object in the category of motives, while for a curve with complex multiplication it breaks into 2 irreducible parts.
So we get 3 or 4 irreducible summands: the weight-0 summand (the "point"), one or two weight-1 summands, and the weight-2 summand (the square of the Leftschetz motive).
And now I finally sorta see why we get two weight-1 summands when the curve "has complex multiplication". I'm not sure you know this jargon, but it just means the curve has an endomorphism other than . When we have such a nontrivial endomorphism, meaning one that's not just a multiple of the identity, I bet it induces an nontrivial endomorphism of the curves weight-1 motive, so that motive can't be simple!
Just for some context, @David Michael Roberts: every -dimensional (connected) smooth projective variety breaks up into motives of "weights" - where "weight" acts like the degree in the deRham cohomology of a complex variety.
Say we're given a scheme over that gives a complex variety whose kth deRham cohomology group has dimension . Then its etale cohomology have rank . And the weight- part of its motive can break up into a sum of at most simple summands... I think. (I don't know this for sure but that's how I think it works.)
Let's assume that's right.
Then an elliptic curve over has a 2-dimensional 1st deRham cohomology, so the weight-1 part of its motive can break up into 1 or 2 simple summands.
The first case holds iff this weight-1 motive has only multiples of the identity as its endomorphisms: this is just the definition of "simple", but it should remind us of Schur's Lemma.
In the second case, the endomorphisms of this weight-1 motive has endomorphisms that are not multiples of the identity.
If we have an elliptic curve with "complex multiplication", it has endomorphisms that are not a multiple of the identity, and these give endomorphisms of that are not multiples of the identity.
And since cohomology factors through taking the motive, the weight-1 motive of has endomorphisms that are not multiples of the identity, so it can't be simple. So, by the dichotomy I mentioned above, this weight-1 motive must break into two simple summands - that's the only other choice!
Thanks for asking about this; it pressured me to figure out a lot of stuff.
I should really work through some concrete examples, though: an elliptic curve over or that does have complex multiplication, and one that doesn't.
@John Baez Thanks! So I guess the obvious question is: the example elliptic curve that you give, does it have CM?
Oh, so you're making me do even more work, eh?
I could resolve this if I were allowed to assume any endomorphism of the elliptic curve
is of the form
Then working over I could just brutally check all choices of
and see which if give endomorphisms.
If I don't get to assume any endomorphism is of that form (and I don't really why I would be allowed to assume it), I'd have to sweat even harder.
Well, not making. Just wondering if you happened to already knew.
Just kidding. I feel like I'm just a fake if I don't even know what's going on in the example I'm talking about. So if you ask them, I feel I have to figure them out.
It turns out Sage knows how to do it: https://math.stackexchange.com/questions/1154687/how-to-test-if-a-given-elliptic-curve-has-complex-multiplication, as long as you can get it in Weierstrass form
sage: E = EllipticCurve([a, b])
sage: E.has_rational_cm()
But this is over Q, not over a finite field!
Aha, the command has_rational_cm
can take a field as an argument, and check for CM over it.
Hmm, nice! Alas, mine is not quite in Weierstrass form; it's
Oh, but it wants a field of characteristic 0 :-(
Yes, that doesn't help, but it turns out to be moot.
What does that mean?
It means I needed to edit what I wrote!
Oh. Fixed.
Oh, characteristic zero.
I really don't know how the endomorphisms of this curve thought of as being defined over compare to them when it's defined over .
A priori there's no reason to expect them to be related, but all this stuff about how deRham cohomology is like etale makes me feel they should be related somehow.
Yeah, and over a finite field there's always the Frobenius, in addition to multiplication by n (giving End rank at least 2), so it seems that I should double back and check how you're using CM for the elliptic curve here. Does it mean CM over Q or an extension thereof (this is the sage command E.has_cm()
), and then the point counting over prime-power-order fields is a different thing?
I believe the statement depends on complex multiplication for the curve defined over the finite field.
Hmm, ok. Interesting.
I'm having trouble finding where I read about this. It was just a couple sentences somewhere. But someone should know a lot!
I've sent out a call on Twitter for experts to weigh in.
Thanks!
In Milne's paper Motives: Grothendieck's dream, in section 3 he mentions there are 3 choices for the endomorphism algebra of an elliptic curve over a finite field: the field itself, a degree 2 extension of that field, or a quaternion algebra over that field!
Maybe the third choice should be called an elliptic curve with "quaternionic multiplication"! :surprise:
My naive guess would be to look at the curve over F_4, and try some easy coordinate transformation tricks like Example 5 in https://www.mit.edu/~lindrew/18.784p.pdf, remembering the minimal polynomial that gives this quadratic extension.
The third choice gets the adjective supersingular https://en.wikipedia.org/wiki/Supersingular_elliptic_curve
And there are sage commands that allow one to check this
Thanks - I didn't know about that. That page says an elliptic curve is supersingular iff its Frobenius induces the endomorphism 0 on .
Hey, David - look at the examples on that Wikipedia page!!!
:tada:
Heh. I didn't read past the definition! And here's me learning the sage commands to check it myself in a hurry :-)
As it says in Lean, Goal Accomplished! :tada:
Yeah, thanks!
Now, of course, this has to link back to your original story: what is happening with the motive...
Probably the guy who told me this was a good example knew that this curve was supersingular.
Presumably it's the cohomological characterisation that's important, given the link to motives.
David Michael Roberts said:
Now, of course, this has to link back to your original story: what is happening with the motive...
So, the theoretical stuff I sketched out - partially conjectural - says that this curve will have a weight-1 motive that's not simple, because it has too many endomorphisms.
And it says this weight-1 motive must split as a sum of two simple objects, like .
So I guess there's a quaternion algebra acting on this object .
Since and are 1-dimensional, I think the only way this is possible is that : if they're nonisomorphic simple objects then
and that's a commutative algebra.
So assume . Then
is something like a 2x2 matrix algebra... over I guess??? (I don't know exactly what's going on here.)
But I wouldn't be shocked if a 2x2 matrix algebra over was a quaternion algebra.
Oh yeah, a 2x2 matrix algebra over any field counts as a quaternion algebra in the algebraist's sense of that term.
Presumably complex conjugation swapping the two numbers in the prime counting function is a reflection of that isomorphism between X_1 and X_2?
Well, the funny thing is that every elliptic curve has that complex conjugation thing going on.
That's one of the things that was bugging me: I can't distinguish between my two claimed cases by looking at the prime counting function.
That is, the case where the weight-1 part of the curves motive is irreducible, vs when it's the sum of two irreducibles. (Or, I hope equivalently, when the curve does not have complex multiplication, and when it does.)
But maybe this is just the way it goes - I don't see a contradiction, I just feel a sense of dissonance.
Well, I guess the obvious first guess is that passing from the motive to the numbers in the zeta function is losing information, so if one gets complex conjugates like that, it's no big deal (the same possibility occurred to me just now as I was away from the computer)
One interesting thing is that for any smooth projective variety over the count of points over is a sum of terms like where the numbers are all algebraic integers... and the collection of these numbers is fixed under the action of !
So if some number shows up, so must its complex conjugate.
Hmm, I guess this also shows that for an elliptic curve, where the count of points is , the number needs to be a quadratic irrational, so that it's only Galois conjugate is its usual complex conjugate.
John Baez said:
So assume . Then
is something like a 2x2 matrix algebra... over I guess??? (I don't know exactly what's going on here.)
I was getting demoralized at this point and that led me to mix up the finite field our elliptic curve is defined in and the field of coefficients we're using to define cohomology and motives - these are actually separate decisions, and a nice field of coefficients would be or . So I should have said a 2x2 matrix algebra over one of these.
Hmm, in positive characteristic that's a whole 'nother can of worms. I'd expect based on nothing but naivete to see .
Or its algebraic closure.
Categories of [[pure motives]] are defined in a way that depends on a choice of field, a choice of "adequate equivalence relation" on cycles in varieties over that field, and a choice of coefficients which you use to take linear combinations of cycles. The last can be any commutative ring.
One of the Standard Conjectures implies that all the adequate equivalence relations give the same category of pure motives!
But pure Chow motives, which I'm using in my talk, use the finest adequate equivalence relation - "rational equvalence".
John Baez said:
I could resolve this if I were allowed to assume any endomorphism of the elliptic curve
is of the form
John Baez said:
I could resolve this if I were allowed to assume any endomorphism of the elliptic curve
is of the form
Actually over this may not be so hard. In this field for both and , and similarly no matter what is. So every pair lies on this curve!
So, the whole algebra of linear transformations of acts on this curve.
(Note the elliptic curve has all these points plus a point at infinity. In theory I'd need to check that this action preserves the group structure, since the group structure is part of the elliptic curve. But in fact any regular map from an elliptic curve to itself preserves the group structure if it preserves a base point, which here we can take to be . A "regular" map is one locally defined by polynomials, and these linear maps are.)
So, we're getting an action of on our elliptic curve. This is a quaternion algebra over !
I believe this proves our elliptic curve is supersingular. (Here I'm pointing back to the Wikipedia link you showed me.)
So this makes me wonder: what does the zeta function for a non-supersingular curve look like? Or, what I really, mean, what numbers appear in the place of those complex conjugate pairs?
The Wikipedia page tells me that if I take p = 5, then is not supersingular (I would need a prime p that is 3 mod 4). Wolfram Alpha tells me that there are 3 (finite) solutions: (0,0), (2,0) and (3,0). These are invariant under (x,y) |--> (-x,y).
Not sure what next one could do.
The zeta function for any elliptic curve over looks like this, where and are the complex conjugate numbers that show up in the formula for how many points the curve has over , namely
with , .
So, you can't stare at the zeta function, or the count of points, and detect whether the curve is supersingular or not... unless you can read it off from the algebraic integer , which I'm unable to do... either because it's impossible or out of sheer ignorance.
I think was just trying to test the boundary of how much information we have lost by passing from the motive to the zeta function. It seems like quite a lot!
I'm pretty sure the zeta function of a variety over knows exactly how many points that variety has over for each , no more and no less.
So, I was a bit puzzled when you changed the conversation from the count of points to the zeta function.
But anyway, then there's the question of how much more information a motive has than its zeta function, or "count of points".
Now the "count of points" can be negative, so I think what we really mean here is the supertrace of each of power of the Frobenius.
I don't yet know examples where the motive itself contains more information than this! The stuff about supersingular curves doesn't prove anything - as far as I can tell. But I also have no reason to think that all the information about a motive is contained in this "count of points".
Yeah, I was being a bit sloppy. I mean the function of n that "counts" the points . I know this is all just spitballing, and happy to get an answer of the form "don't know"/"that's too far afield". Thanks for your patience!
But actually I was mixed up. While lighting the barbecue grill this evening I remembered the motives that appear when we break up an elliptic curve into moves do know if that curve is supersingular, because if so, there are 2 weight-1 motives in that decomposition, whereas otherwise there's just 1.
And yet this distinction is lost, or at least not very apparent, when we go to the count of points: that's always for some algebraic integer .
Maybe you can read off supersingularity just from knowing , but if so I know not how.
On the other hand I've been told that sometimes you can tell if an elliptic curve is supersingular just from the count of points!
For example, if an elliptic curve over has a number of points (over ) that's not a multiple of , the curve must be supersingular!
This follows from the first of many equivalent definitions of supersingular elliptic curve listed here.
Thanks for talking to me about this - you're making me learn a lot of stuff and figure out a bunch of stuff.
Is is possible that is real? So that you get ? This seems to be at least a possibility that needs to be ruled out...
But , so the only options are , if is real. If the count oscillates over and under , then we really should only get . But this is completely insensitive to what the curve is, which is a bit worrying...
Well, depends on the curve. Maybe some curves have or . I really don't know what are possible, just that they're algebraic integers.
The case is really revealing - that is, the case where we count points over . The Weil conjecture, or really this special case proved by Hasse, says this number of points needs to be .
So, just from knowing the number of points over we can figure out . And we know .
So we know a circle that lies on, and also a vertical line it lies on, so we know it up to complex conjugation... which is all there is to know since and play equivalent roles in this game!
So Hasse's theorem says if you know the number of points over you can work it out for for any .
Further, we know is an integer, which is very constraining, and so we can't have real, after all...
Right!
I was actually going to say that, but I was forced to stop typing and go to sleep.
So the "correction term" to the count of points, , must oscillate with a period of more than 2 (while it grows exponentially).
For the example in my talk, as soon as we know we've got a curve over we know is an algebraic integer where is an integer and . That's quite a few constraints!
For starters, the last two constraints imply is -1, -1/2, 0, 1/2 or 1.
Then we can work out all the possibilities of from and see which are algebraic integers.
For the curve in my talk we get .
Theoretically we could have a curve with .
Can we have ?
Well, if we must have , so , so .
So we're getting .
But I think that's not an algebraic integer, since 7 is not one more than a multiple of 4.
If I didn't screw up, I think the same argument rules out .
So for the only possibilities are , , and - oh yeah, also
We can use this method to grind out finitely many possibilities for for any prime . is always going to be in a quadratic number field, so we can recognize when it's an algebraic integer and rule out some options like I just did.
I think I made a mistake somewhere above. It seems the possibilities I listed all give curves with an odd number of points over , and such curves are necessarily supersingular.
The requirements that and imply
so that the number of points over is
I know elliptic curves with 1, 3, or 5 points over , and I know these are supersingular because they have an odd number of points.
But if the cases are ruled out as I claimed they were above, then there'd be no elliptic curves with 2 or 4 points over , and all curves over would be supersingular, which seems... weird.
Using the first entry in https://en.m.wikipedia.org/wiki/Supersingular_elliptic_curve#Examples, we can look at those of the form , for , and these should be non-supersingular.
And I note that to get an elliptic curve we need the curve to be smooth, so this rules out some options, I presume both a's being 0
And here's a handy blog post working out all the options: https://www.johndcook.com/blog/2019/03/11/elliptic-curves-gf2-gf3/
My guess above with only a term and no other 's turns out not to be an elliptic curve at all! There needs to be cross terms, which the WP page didn't have as an option.
in its example
So, for instance, y² + xy = x³ + 1 has 4 points over according to Cook's blog post (including the point at infinity), so that , so that . Hmmm...
And for completeness, here's a curve with two points (including infinity): y² + xy = x³ + x² + x
But note that Cook is giving actual place cubic curves here, not working up to isomorphism. So it's possible his lists are overcounting actual elliptic curves.
Thanks. Let me count the points of the elliptic curve corresponding to the equation over .
If the left hand side is zero so we need , which gives two solutions, and .
If the left side is so we need , which gives two solutions and .
So that's 4 solutions, but then I believe there's a point at infinity, which makes 5 points on the elliptic curve. (There's always an extra point at infinity, right???)
Did I screw up or does this elliptic curve really have 5 points rather than 4 as John Cook (or maybe you) claimed?
Now let me check y² + xy = x³ + x² + x.
If the left side is zero so we need , which gives one solution, .
If the left side is so we need which has no solutions.
So that's 1 solution, which together with a point at infinity makes 2 points on the elliptic curve.
So in this case we have no disagreement.
So this case seems to be giving by my earlier calculation:
The requirements that and imply
so that the number of points over is
John Baez said:
If the left hand side is zero so we need , which gives two solutions, and .
This only gives one solution, doesn't it?
in the field with two elements, no?
but
Oh, duh.
Okay, good.
So we get 4 points in this case, as claimed.
So now my problem is that both these cases - elliptic curves over with 4 or 2 points - give that's not an algebraic integer... unless I've made yet another mistake.
So maybe I'm just confused in thinking that is supposed to be an algebraic integer.
I was probably just misremembering this....
Yeah, I'm not finding that claimed anywhere. Okay, good!
So, all 5 cases actually show up, and now I can get around to some further questions raised by @David Michael Roberts , like: can we tell from , or equivalently the number of points over , whether our elliptic curve is supersingular or not?
Results in the linked Wikipedia page imply that if the number of points is odd then the curve is supersingular.
(If you're not keeping score, remember I'm interested in this because I believe the way the motive of the curve breaks into summands depends on whether the curve is supersingular or not.)
Hmm, I think the same criterion tells us that if the number of points is even, the curve is not supersingular.
Here it is:
There are many different but equivalent ways of defining supersingular elliptic curves that have been used. Some of the ways of defining them are given below. Let be a field with [[algebraic closure]] and an [[elliptic curve]] over .
The -valued points have the structure of an [[abelian group]]. For every n, we have a multiplication map . Its kernel is denoted by . Now assume that the characteristic of is . Then one can show that either
or
for = 1, 2, 3, ... In the first case, is called supersingular. Otherwise it is called ordinary. In other words, an elliptic curve is supersingular if and only if the group of geometric points of order is trivial.
So, David, it now seems to me that the count of points over , and a fortiori the zeta function, of an elliptic curve over , is enough to tell whether that curve is supersingular (and thus breaks into a sum of 4 motives) or not (and thus only 3).
Even better, the quoted stuff seems to solve the problem for any prime!
An elliptic curve is supersingular iff has no nontrivial p-torsion points over , which I believe is true iff the number of p-torsion points is not divisible by p.
(This is because a finite abelian group has nontrivial p-torsion iff its order is divisible by p.)
Nice! I have no idea how to match this up to the early observation relating the motive to the naive view of cycles on the complex points of the elliptic curve (treating the elliptic curves here over finite fields as being reductions of elliptic curves over the integers). Even just how one should think of the motive of an 'ordinary' elliptic curve is a bit mysterious. Perhaps it's to do with whether the number is an algebraic integer or not? Just a random guess based on the musings here.
Yes, the reason I focused so much on elliptic curves in my talk was because they're the simplest example that illustrates the mystery of motives.
Some of the mystery - the way the cohomology of the curve over influences its properties as a curve over a finite field - is explained (to some extent) by etale cohomology.
In particular the curve's number of points over is the supertrace of the nth power of the Frobenius acting on its etale cohomology... which is closely connected to the ordinary (say deRham) cohomology of the curve over .
But bringing this down to earth is still a lot of work (for me at least).
My vague mental image of an elliptic curve over is this:
When we work over the biggest chunk, with "weight 2", contributes points.
The smallest chunk, with weight 0, contributes points.
The two other chunks, with weight 1, contribute points where .
And these are the mysterious chunks!
This was a fantastic talk! I'm so glad that the conference is being recorded so that this talk will be available for posterity. I had no idea that things like motives and the Riemann hypothesis were so closely related to ideas that are near and dear to my heart like traces in symmetric monoidal categories.
Thanks a lot, Mike! Yes, I hope they recorded the questions and answers, where the traces showed up thanks to your question.
When the recording shows up on YouTube I'll tell people about it.
When you say "supertrace", is that just a fancy way of saying that you take traces in the category of chain complexes (or graded abelian groups) where the symmetry of the tensor product introduces a sign?
Yes, that's just a fancy, or at least quick, way of saying that.
Yes, after I wrote that I realized that what I wrote afterwards certainly sounds "fancier". (-:O
But in my world, that's always the "correct" symmetric monoidal structure on chain complexes, so taking traces with respect to it doesn't need to be emphasized with a prefix like "super-".
Okay!
Are there contexts where one actually does want to use the other symmetric monoidal structure without signs?
If the recording of the talk shows up, you'll see I said "trace of the Frobenius" and then someone like Kevin Buzzard "corrected" me by saying "the alternating sum of the traces", and then I said "supertrace".
That's right! So I guess I should ask Kevin why he felt the need to "correct" you. (-:
I'm getting hit from both sides. :upside_down:
It sounds like you're more on my side.
Yes, I'm on your side.
There is a place where people feel the need to "correct" the symmetry in the category of chain complexes - or actually motives! - but I find it sort of confusing, because I don't yet know what these people consider the "default" symmetry.
Maybe this is another example like Kevin's where there is more than one "canonical isomorphism"...
It's also intriguing to me that the extraction of point counts from motives, as you described them, seem only to be using the additivity of traces with respect to direct sums, whereas traces in appropriate contexts are also additive on exact sequences / cofiber sequences / distinguished triangles. Does that more general sort of additivity ever come up for motives? Is the restriction to direct sums just a simplification that you introduced for us newbies?
How about the multiplicativity of traces?
Oh, maybe the fact that direct sums seem to suffice has to do with the "standard conjecture" consequence of semisimplicity?
If you read
John Baez said:
There is a place where people feel the need to "correct" the symmetry in the category of chain complexes - or actually motives! - but I find it sort of confusing, because I don't yet know what these people consider the "default" symmetry.
You can see this in the article [[motivic Galois group]]. It cryptically says a "slight variant" of the category of motives is tannakian, i.e. the category of representations of an algebraic group, which gets called the "motivic Galois group".
If you read around you'll see this "slight variant" involves sticking extra minus signs in the symmetry, keeping the same monoidal category but getting a new symmetric monoidal category! However, I haven't yet read a really detailed explanation, so I can't tell if they're correcting the "bad" symmetry to get the one you and I would call "good", or vice versa!
It seems possible that the category of motives is "super-Tannakian", i.e. the category of graded representations of an algebraic group, with the symmetry that you and I like. This is what I'm hoping!
Urs has written a lot of stuff about Deligne's theorem on tensor categories, which is about this business.
Anyway, if I spend a bit more time reading papers I should be able to straighten out this sign issue.
Mike Shulman said:
It's also intriguing to me that the extraction of point counts from motives, as you described them, seem only to be using the additivity of traces with respect to direct sums, whereas traces in appropriate contexts are also additive on exact sequences / cofiber sequences / distinguished triangles. Does that more general sort of additivity ever come up for motives? Is the restriction to direct sums just a simplification that you introduced for us newbies?
It's probably just a simplification for us newbies, but one thing here is that the Standard Conjectures imply the category of pure Chow motives - the kind of motives I was talking about - is abelian and even semisimple! If so, all we really need to think about in this particular case is direct sums. But if one wants "unconditional" results not depending on these conjectures, maybe one needs more general things like non-split exact sequences or distinguished triangles. I don't know what people do about this.
There's another category of motives, "pure numerical motives", which is known to be abelian and semisimple and tannakian. I believe if the Standard Conjectures are true this category is equivalent to the category of pure Chow motives.
Okay, it turns out that I was not completely confused about that algebraic integer business... just partially confused.
There's a lot of nice information here:
In particular, he classifies simple objects in the category of pure numerical motives. These are like the pure Chow motives I've been talking about, but defined using an a priori coarser equivalence relation on cycles, called numerical equivalence.
The category of pure numerical motives is known to be abelian and semisimple, while for the pure Chow motives in my talk this is still just conjectured.
Milne classifies the simple objects in the category of pure numerical motives over .
To do this he defines a Weil -number to be a number whose Galois conjugates, say are all such that for some and also is an algebraic integer for big enough .
This is the kind of we've been talking about, which shows up in the Riemann Hypothesis for finite fields. But I'm listing more conditions on it now!
Anyway, Milne shows that simple objects in the category of pure numerical motives correspond to equivalence classes of Weil -numbers... where two are equivalent if they're in the same orbit of the absolute Galois group! (That's what I meant by "Galois conjugates" above.)
So this is great: it means the 's I've been talking about, or at least equivalence classes of them, really are the same as the basic building blocks in the world of motives, at least if we use pure numerical motives.
So rather than algebraic integers, they are "algebraic -ary fractions" ...
Yeah! I'd never thought about them before.
I'm learning more about motives from Milne's paper Motives over finite fields, and it's really great: way over my head, but full of facts whose statements I at least comprehend.
John Baez said:
Milne classifies the simple objects in the category of pure numerical motives over .
To do this he defines a Weil -number to be a number whose Galois conjugates, say , are all such that for some and also is an algebraic integer for big enough .
Milne shows that simple objects in the category of pure numerical motives correspond to equivalence classes of Weil -numbers... where two are equivalent if they're in the same orbit of the absolute Galois group! (That's what I meant by "Galois conjugates" above.)
Actually he does all this assuming the Tate conjecture. Wikipedia says:
Like the Hodge conjecture, the Tate conjecture would imply most of Grothendieck's standard conjectures on algebraic cycles. Namely, it would imply the Lefschetz standard conjecture (that the inverse of the Lefschetz isomorphism is defined by an algebraic correspondence); that the Künneth components of the diagonal are algebraic; and that numerical equivalence and homological equivalence of algebraic cycles are the same.
So we are living in the world of "conditional results" I mentioned in a series of tweets yesterday:
But I am struggling to understand the reasoning a bit better, and in particular the role of algebraic integers vs. what @James Deikun called "algebraic p-ary fractions".
I had made an embarrassing number of basic mistakes trying to straighten out the motives that appear in elliptic curves over finite fields, but everything turns out to be very nice. For an elliptic curve over , Hasse's theorem says the number of points over is
where is an algebraic integer with . Taking , we see the number of points over is
In this thread we've seen examples where the number of points is any of these numbers:
These are clearly the only options since the projective plane over has just 5 points.
These options correspond to
respectively, and using we get these options for :
These are all algebraic integers, despite my foolish doubts!
So, all this is consistent with the following: for any effective numerical motive over , the 'number of points' (that is, the trace of the Frobenius) over is a sum of terms where is an algebraic integer with for some .
(I'm too lazy to explain 'effective numerical motives' right now, but the motives that show up when we count points on an elliptic curve or indeed any smooth projective variety are that kind. The examples I've been talking about have , .
When we 'formally invert the Lefschetz motive' we get a larger class of motives called 'pure numerical motives', and for these the trace of the Frobenius over can be a sum of terms where is any Weil -number. Recall:
... a Weil -number to be a number whose Galois conjugates, say are all such that for some and also is an algebraic integer for big enough .
I have the feeling I'm making some small mistakes even now, but more on the order of typos. I'm not running into any apparent 'contradictions' as I was before (caused by mistakes in calculation).