Cluster k0199
Weighted finite maps and traces, part one
Twenty-two files in a "transcendence traces" folder. They define a weight on a finite map of schemes (spaces built from rings): a way to count the points of each fibre, with whole-number multiplicities. The statements say weights are preserved by pullback, are locally constant and open-closed-friendly, and extend to bigger fields. A trace is then a cohomology map that sums over such a fibre. Statements say the trace of the identity map with constant weight is multiplication by that constant, and that traces are compatible with reducing coefficients. Almost all are conditional ("A and B give C"), so they rest on assumed facts.
7 import steps from the main theorem.
Proof status: on 21 Nov 2026 the Lean FRO and the Mathlib Initiative certified the Lean statement and proof (latest check). Names and descriptions on this map are written by Claude from samples of the code and may be wrong.
Prerequisite concepts
Schemes: spaces glued from rings (Spec, Zariski topology)Pullbacks (fibre products) and maps that "factor through"Chain complexes, homology and exact sequences
References
Milne, Étale Cohomology · ch. V, sec. 1 (trace maps)Background reading suggested by the AI namer · unchecked
Uses
Used by
23 Lean files, main folder Development.AutomorphicArithmetic.Foundations.GaloisRepresentations.TranscendenceTraces.