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.
The full top-weight map with its exact factorization
PDF p. 6: Proposition 2.6 proof
Statement
For finite type over algebraically closed , and invertible, let . The canonical map is an equivalence and factors as , where is the source map induced from by cdh localization. This statement uses the actual top-weight source comparison, rather than an arbitrary equivalence of complexes.
Facts & Assumptions
Given: The hypotheses in the statement.
Goal: Establish the stated exact map or descent conclusion.
Proof
The draft top-weight supplier [F1], importing the published Elmanto report Theorem 4, applies to every finite-type scheme over algebraically closed , with and any prime; its invertible-prime target is exactly . With its actual comparison is therefore an equivalence, without requiring affineness, smoothness or reducedness.
The draft source-composite supplier [F2] identifies this canonical motivic-to-étale map as . This is the same prime-field comparison used in the published report Theorem3(1) and Theorem4, by their explicit assertion that the equivalence is under the motivic-to-syntomic comparison. The preceding lemma defines , yielding the equation with actual maps. No equality is inferred from abstractly isomorphic groups.
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.