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.
Slice localization and the actual root-of-unity coefficient map
PDF p. 6: Proposition 2.6 proof
Statement
Assume the Axiom of Choice and the fixed universe and site-size bounds of the supplied derived-localization constructions. Let be algebraically closed, invertible in , and qcqs, with the fixed choice and universe conventions. On use the qcqs prime-field cdh site, and on its induced slice topology. In this item and mean ordinary covering-family/Čech sheafification of -valued presheaves. With , restriction commutes with this localization, including its units: Choose a primitive th root . Its pullbacks give a natural coefficient equivalence , where and . Both restricted targets are ordinary local. Consequently, at the terminal slice object , the actual maps and correspond under these equivalences. No root over or equality of ordinary and hypercomplete reflectors on arbitrary inputs is assumed.
Facts & Assumptions
Choice and the stated bounds are inherited through the finite-coefficient locality, ordinary slice localization and derived-evaluation suppliers used below. The Axiom of Choice Given: The stated field, prime, scheme and fixed choice/universe conventions.
Goal: Compare ordinary localization units and the actual coefficient maps on the slice.
The source qcqs cdh site fixes the actual site. Its generating Nisnevich and finitely presented abstract blowup covers are stable under base change. Ordinary sheafification is the reflective localization into covering-family/Čech descent objects.
Roots of unity and étale Tate twists gives the primitive-root coefficient isomorphism on every small étale site over . Derived global sections on a scheme site fixes its derived evaluation.
Étale derived cdh locality on the actual qcqs site proves hypercomplete and hence ordinary locality of on the whole prime-field site. Only its ordinary consequence is needed here.
Proof
Define . These products remain qcqs. There is an adjunction : a map gives ; conversely a map restricts along the graph for every . The projection–graph identities make the constructions inverse, naturally on mapping spaces.
Restriction preserves ordinary sheaves because covers and their Čech diagrams over are exactly those over . The functor also preserves them: base change by carries the generators in [F1], their iterated pullbacks and their Čech diagrams to the same kind of covering diagrams on the slice. For an ordinary local equivalence and any slice sheaf , adjunction identifies with , an equivalence. Thus preserves ordinary local equivalences as well as local objects.
Restrict . By step 2.1 this is a local equivalence into a slice sheaf, so the reflective universal property identifies it with the slice localization unit. The resulting equivalence is natural and respects all maps induced by that unit. Evaluation at is evaluation of the ambient presheaf at .
Pull back to every scheme over . By [F2] these maps give the actual natural equivalence . By [F3] and step 2.1, is ordinary local; its equivalent target is therefore ordinary local too. Truncation, localization and the naturality of the units in step 3.1 now conjugate the two induced maps from localized truncations into those local targets. Evaluate at the terminal object to obtain the claimed actual comparison.
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.