7
$\begingroup$

I have some naive questions about polynomial-count affine varieties over $\mathbb{C}$:

  1. Are all reductive algebraic groups strongly polynomial-count?

  2. Are products of strongly polynomial-count varieties also strongly polynomial-count? What about (disjoint) unions?

  3. If X is strongly polynomial-count variety, and F is a finite group acting on X, is X//F also polynomial-count? More generally, is the property of strongly polynomial-count invariant under étale equivalence.

  4. If G is reductive algebraic group acting on a variety X, and the orbit-type stratification of X consists of strongly polynomial count quasi-projective subvarieties, then is X//G also strongly polynomial-count?

  5. Are there general conditions on a variety X and algebraic group G for X//G to be strongly polynomial count?

Basically, I would like to know if there are operations that allows one to cook up polynomial count varieties from other polynomial count varieties.

See the Appendix here for the definition of polynomial count: here

EDIT: Just to be completely honest, when I posted this, I did have a sense for some of the questions, but I wanted to learn more about a concept I am just now learning to work with, and felt that they all fit a general theme so just included them all without detailing what I thought I knew and didn't.

$\endgroup$

1 Answer 1

7
$\begingroup$

A combination of easy and hard questions here. The easy ones:

(1) No. For example, the group scheme $\{ (x,y) : x^2+y^2=1 \}$, with multiplication $(x_1, y_1) (x_2, y_2) = (x_1 x_2 - y_1 y_2, x_1 y_2 + x_2 y_1)$ has $q - (-1)^{(q-1)/2}$ points over a field with $q$ elements. Or, similarly, the group scheme $x^3=1$ has $1$ or $3$ points depending on whether $q$ is $1$ or $2$ mod $3$. However, connected split reductive groups are polynomial point count. Moreover, we can make an arbitrary reductive group be polynomial strongly point count by changing the base ring $R$: For example, switching from $\mathbb{Z}$ to $\mathbb{Z}[i]$ in the first example or from $\mathbb{Z}$ to $\mathbb{Z}[(-1+\sqrt{-3})/2]$ in the second.

(2) Yes and yes, this is immediate from the definition.

(3) Polynomial point count is not invariant under etale equivalence, because it is easy to build examples where $X$ is polynomial point count and $X/G$ is not. For example, take $X$ to be the elliptic curve $y^2=x^3-x$ with the points $(x,y) = (-1,0)$, $(0,0)$ and $(0,1)$ deleted. $X$ is not polynomial point count. Let $G = \mathbb{Z}/2$ act on $X$ by $(x,y) \mapsto (x,-y)$. Then the quotient is the affine line with $3$ points deleted, with point count $q-3$.

It is harder to find an example the other way, with $X$ polynomial point count and $X/G$ not polynomial point count. Here is one. Let $E \subset \mathbb{P}^2$ be a smooth cubic curve. Take two copies of $\mathbb{P}^2$, each with $E$ embedded in them, and glue them along $E$. Then take the disjoint union of that with another copy of $E$. Call this $\bar{X}$. So $\bar{X}$ has $2(q^2+q+1) - \#E(\mathbb{F}_q) + \#E(\mathbb{F}_q)= 2(q^2+q+1)$ points over $\mathbb{F}_q$. Let $X$ be $\bar{X}$ with four points deleted from the copy of $E$ which is disjoint from the projective planes. So $X$ has point count $2(q^2+q+1)-4$, another polynomial. Let $\mathbb{Z}/2$ act trivially on the $2$-dimensional component of $X$ and act by a fixed point free involution on $E$ with the $4$ points deleted. So the quotient of the one dimension component is $\mathbb{P}^1$ minus $4$ points, and the point count of the whole quotient is $2 (q^2+q+1) - \#E(\mathbb{F}_q) + (q-4)$.

This mostly demonstrates that polynomial point count is a weird notion; a better condition is that all the eigenvalues of Frobenius on compactly supported cohomology be powers of $q$. I believe that this does pass to quotients as I think (but I am not an expert) that $H^{\ast}(X/G, A) = H^{\ast}(X,A)^G$ whenever $|G|$ is invertible in the coefficient ring $A$.

(4) seems harder to me.

$\endgroup$
5
  • 2
    $\begingroup$ I agree with you that "all Frobenius eigenvalues powers of q" is a better notion than pure "polynomial point count." But I think "some power of Frobenius eigenvalue is a power of q" is better still, and takes care of examples like your (1). $\endgroup$
    – JSE
    May 22, 2013 at 3:27
  • $\begingroup$ Yeah, that is also a good condition. Just to check, you want it to be an integral power of $q$, right? So a super-singular elliptic curve doesn't count. $\endgroup$ May 22, 2013 at 12:17
  • $\begingroup$ Thank you for the examples in (3)! And yes, (2) was just thrown in to get the conversation rolling :) Do you have a reference for the connected split reductive result? What about homogeneous spaces G/H where each of G and H is of that type? Here is another example: C^* mod Z/2Z which is acting by x↦1/x. The quotient is C which is polynomial-count (PC) and C^* is also PC. So what goes right, where the other examples go wrong? Here is another question which perhaps related to (5): when does #X//G(F_q)=#X(F_q)/#G(F_q)? Perhaps if G is connected & reductive and acting scheme-theoretically free? $\endgroup$ May 22, 2013 at 15:48
  • $\begingroup$ Here is a naive attempted sketch for (4) assuming now that G is split reductive. Using Seshadri's extension of GIT to schemes perhaps one can find under good conditions (like everything is a Z[1/n]-scheme) a spreading out that respects the orbit stratification. Then maybe each strata X_H is a G/H-bundle. If then G/H is polynomial count (the fiber), and the strata X_H is by assumption, then maybe the bundle condition implies that #(X_H//G)(F_q)=#X_H(F_q)#H(F_q)/#G(F_q). Then by additivity (unions) of strata and the X_H's, H's, and G being PC perhaps gives the result. $\endgroup$ May 22, 2013 at 16:29
  • $\begingroup$ In the above comment, I seem to be using that the quotient is parametrized by closed orbits and they will have reductive stabilizers H. But maybe I need H to be split reductive too. Is it true that a reductive subgroup of a split reductive subgroup is itself always split? $\endgroup$ May 23, 2013 at 5:19

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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