This pinned Lean source formalizes the following mathematical result: Kernel-checked Lean proof that an explicit 12-vertex regular bipartite tournament has no Hamilton decomposition. The statement matches the unrestricted formulation recorded by Granet and Liebenau–Pehova. Download the complete checked closure, open the endpoint, or browse its supporting modules to study the proof or develop an extension.
Each ZIP contains the checked first-party local Lean import closure, exact statements and boundaries, license, notice, evidence, a source-footprint manifest, and an agent continuation file. Mathlib and other third-party dependencies are not bundled; this is not a portable whole-repository release.
How counting works: Line counts exclude blank lines; comments and documentation count. The total is the deduplicated, commit-pinned first-party Lean import closure; Mathlib and other third-party dependencies are excluded. Declaration count means names covered by the artifact's recorded evidence; it is not a count of every declaration in the source. Source footprint is not a difficulty or proof-quality score.
This is the hash-matched main Lean file. Its complete tracked local Lean import closure is browsable once below; checker evidence remains separate for this exact theorem.
This closure supports the theorem evidence record above.
Browse complete checked source · 6 files
Every listed file is read from the same pinned Git commit. File links open raw source in a new tab; use the ZIP download for the complete package. External Mathlib modules are dependency-locked but are not copied into this first-party source tree.
The endpoint and every listed local import come from the exact recorded Git commit, and the endpoint matches the stored source hash byte for byte. The locally authored package material is licensed under Apache-2.0 by Lech Mazur; Mathlib and cited third-party material remain under their own terms. Machine-readable checker evidence is included.