Technical Lean evidence record
Checked Artifact: Erdős–Ginzburg–Ziv Theorem (mathlib)
Proof Atlas collected build, no-sorry, axiom, and clean-source evidence directly from the pinned upstream declaration.
ProofAtlas record
What has been checked
These states distinguish upstream identity, local reproduction, review, and Atlas acceptance. This page is part of the public, read-only Mathlib landmark collection.
Mechanical evidence
- Declaration checked
ZMod.erdos_ginzburg_ziv- Module
Mathlib.Combinatorics.Additive.ErdosGinzburgZiv- Source file checked
Mathlib/Combinatorics/Additive/ErdosGinzburgZiv.lean- Package commit
5e932f97dd25535344f80f9dd8da3aab83df0fe6- Build
- passed · transcript retained
- Unfinished proof steps
- None found by the recorded no-sorry scan
- Axiom closure
- Classical.choice, Quot.sound, propext
- Clean collection provenance
- Recorded
Evidence boundary
This page indexes Mathlib’s finite indexed-family theorem in ZMod n. The hypothesis is 2*n−1 ≤ |s|, and the conclusion selects a subset t of exactly n distinct indices whose indexed values sum to zero. Values at different indices may repeat. The statement includes n=0 through the empty selection; it does not require exactly 2n−1 input indices, assert uniqueness, count witnesses, or provide an extraction algorithm.
This checker record is evidence for the exact formal statement only. It does not establish novelty, transfer a historical acceptance decision, or authorize publication.