Technical Lean evidence record

Checked Artifact: Euler’s Odd–Distinct Partition 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

Upstream indexedPinned source bytes verified locally

Locally reproducedExact upstream declaration replayed

Reviewed pageCurrent public presentation reviewed

Accepted Atlas resultNot recorded for the preferred artifact

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: Nat.Partition.card_odds_eq_card_distincts
Module: Mathlib.Combinatorics.Enumerative.Partition.Glaisher
Source file checked: Mathlib/Combinatorics/Enumerative/Partition/Glaisher.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 cardinality form of Euler’s partition theorem. For every natural n, odds n is the finite set of partitions of n all of whose parts are odd, while distincts n is the finite set of partitions of n whose parts multiset has no repetitions. The declaration says that these two finite sets have equal cardinality. It does not itself construct an explicit bijection, enumerate either family, or state a broader partition identity.

This checker record is evidence for the exact formal statement only. It does not establish novelty, transfer a historical acceptance decision, or authorize publication.