Courtade–Kumar proof module `CKLaneC.RSC2.S09_Top (piece 1 of 3)` (transplant)
DefinitionCK_CKLaneC_RSC2_S09_Top_q00Verbatim transplant of the Lean module CKLaneC.RSC2.S09_Top (piece 1 of 3) of the machine-checked proof of the general Courtade–Kumar theorem (the most informative Boolean function conjecture), so that the complete proof can be verified on this platform.
It is the original source with only two mechanical changes. Imports of project modules are redirected to their transplanted bundles Definitions.Def_CK_*. Declarations that already exist in earlier platform definition bundles of this mission are removed, and those bundles are imported instead, so every constant keeps a single platform identity.
The module contains both definitions and the lemmas proved alongside them in the source. They are kept together so the transplant stays faithful and every proof is re-checked by the server.
Source: Z. Chen, A. Gohari, A. Javanmard, H. Lin, V. Mirrokni, C. Nair, D. P. Woodruff, A Proof of the Most Informative Boolean Function Conjecture, arXiv:2609.24931 (2026). Lean development: https://github.com/dpwoodru/general-courtade-kumar-lean (Apache-2.0), module CKLaneC.RSC2.S09_Top (piece 1 of 3) from release v1.0 (sources_v3.tar.zst).
import Definitions.Def_CK_CKLaneC_RSCell_RegionI import Definitions.Def_CK_CKLaneC_RSC2_S09_Top_t010 import Definitions.Def_CK_CKLaneC_RSC2_S09_Top_t021 /-! RA-stat cover: root assembly (generated by tools/emit_cover2.py). -/ namespace CKLaneC.RSC2.S09_Top open CKLaneC.RSCell theorem root0 : RegionPosI 288230376151711744 576460752303423488 0 18446744073709551616 2305843009213693952 18446744073709551616 := (RegionPosI.split_s 6917529027641081856 CKLaneC.RSC2.S09_Top.t_010 CKLaneC.RSC2.S09_Top.t_021) end CKLaneC.RSC2.S09_Top