How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Roots of unity and étale Tate twists
PDF p. 5: Property (5); PDF p. 6: Choice of a primitive root of unity
Definition
Let be an integer invertible on a scheme : its image in every local ring of is a unit. Work on a size-bounded small étale site of whose objects are étale -schemes, whose covering families are jointly surjective étale families, and which includes the open restrictions and covers used below.
For an object put , with multiplication and restriction of functions. The sheaf of th roots of unity is the sheafification of this presheaf. Its group law is written multiplicatively; multiplication by an integer means taking that power. As every section is annihilated by , is a sheaf of -modules. Here denotes both the quotient ring and, on the site, the constant sheaf obtained by sheafifying the constant presheaf with that value.
For , define the Tate twist to be the -fold tensor product over the constant sheaf : form the objectwise tensor product presheaf and sheafify it. Set . Only nonnegative twists are defined here.
If is a scheme over a field and a primitive th root is chosen, meaning an element of multiplicative order exactly , then necessarily is prime to the characteristic of . The map induces an isomorphism of -sheaves and hence, for every , an isomorphism sending to when and to when . For both sides are zero modules. These isomorphisms depend on the chosen root for positive .
This definition alone asserts no motivic-to-étale comparison. In particular, in characteristic it does not treat as a prime-to-characteristic coefficient sheaf.
Definition references
Justification
The restriction maps preserve products and the equation , so is a presheaf of abelian groups. The sheafification construction and its universal property are supplied by Scheme sites and sheafification. Group operations and the -action descend through sheafification: matching families can be added or multiplied after passing to a common covering sieve, and the relations hold locally and therefore in the sheafification. The same construction applied to objectwise tensor products gives the stated tensor sheaf; its universal property follows by applying the presheaf tensor universal property locally and gluing. Thus the constructions do not depend on representatives of local sections.
For the trivialization, if and the characteristic divided , writing would give because in a field of characteristic the equation has only the root ; this contradicts the order . Hence is invertible in . The elements are distinct, and their pairwise differences are units on every -scheme. Consequently with pairwise comaximal factors. If , apply the Chinese remainder idempotents to on each affine open of : the resulting finite disjoint open decomposition has on its th part. Open restrictions are étale, and these decompositions cover . Thus is locally surjective. It is locally injective because distinct are units, so equality can occur only on the empty scheme. The sheafification universal property and the sheaf gluing condition therefore make the induced map an isomorphism. Tensoring this isomorphism times and using the canonical multiplication isomorphism gives the displayed twist trivialization. For the root and coefficient groups are trivial, giving the same conclusion.
Depends on
Dependency tree · 3 levels
Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text. The view shows up to three dependency steps; open a prerequisite to continue.