Technical Lean evidence record

Checked Artifact: Erdős–Ko–Rado 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: Finset.erdos_ko_rado
Module: Mathlib.Combinatorics.SetFamily.KruskalKatona
Source file checked: Mathlib/Combinatorics/SetFamily/KruskalKatona.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-family theorem for 𝒜 : Finset (Finset (Fin n)). The family is pairwise intersecting, every member has exactly r elements, and the hypothesis is exactly r ≤ n / 2. The selected declaration proves only #𝒜 ≤ (n−1).choose (r−1); it does not construct a star family, prove a separate sharpness result, or classify equality cases.

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