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.
Finite rank strata detect Elmanto-Morrow motivic cohomology
PDF p. 8: Computations after the splitting principle
Statement
Assume AC and the article's field convention: is algebraically closed unless otherwise specified. Let be any qcqs -scheme and the finite common rank partition of finitely many finite locally free sheaves. For the actual Elmanto-Morrow motivic complex of every weight , restriction gives Thus for every and or with , the joint restriction map is an isomorphism and in particular injective. No smoothness, finite-type, noetherian, dimension or regularity hypothesis is required. Weights are not defined here unless an additional zero-weight convention has explicitly been adopted.
Facts & Assumptions
Given: AC, the field, scheme, family and integer/coefficient bounds above.
Goal: Prove the exact motivic detection property required by a varying-rank flag tower.
The common rank strata and their finite union are qcqs and clopen. Finite clopen common rank strata, The Axiom of Choice
The specified complex is the restriction from the prime field of a homotopy-coherent -valued Nisnevich sheaf on qcqs schemes. Elmanto–Morrow motivic complex input
Finite clopen descent for such a sheaf is the product equivalence, including its value zero on the empty scheme. Derived Nisnevich descent on a finite clopen partition
Integral motivic groups are of the complex; finite coefficients apply derived tensor with first. These operations commute with the finite product. Motivic complexes and cohomology, Finite derived products and motivic coefficient operations
Proof
Every -scheme under consideration is a scheme over the prime field by composition of structure maps, and its underlying qcqs property is unchanged. The clopen inclusions and their fiber products in [F1] remain the same Nisnevich cover after forgetting to . Thus [F2] supplies descent for precisely this cover, not a different smooth or cycle-theoretic cohomology.
Apply [F3] to the restricted weight- sheaf, with . It gives the displayed equivalence of actual motivic complexes, whose components are the restriction maps. The empty-base case is included by its empty-cover clause.
Applying the two operations in [F4] and their finite-product compatibility to step 2.1 gives the displayed group isomorphisms in every integer degree . Hence the joint restriction is injective. Only the hypotheses of the existing qcqs motivic sheaf and the finite clopen partition have been used, proving all claims.
Depends on
Used by · 1
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.