Processing math: 100%

The Stacks project

Remark 64.30.1. Here are some observations concerning this notion.

  1. If modeling projective curves then we can use cohomology and we don't need factor q^ n.

  2. The only examples I know are \Gamma = \pi _1(X, \overline\eta ) where X is smooth, geometrically irreducible and K(\pi , 1) over finite field. In this case q = (\# k)^{\dim X}. Modulo the proposition, we proved this for curves in this course.

  3. Given the integer q then the sets S_ d are uniquely determined. (You can multiple q by an integer m and then replace S_ d by m^ d copies of S_ d without changing the formula.)


Comments (0)


Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.