formal verification 2abundant numbers 1geometric non-embeddability 1kochen-specker theorem 1lean theorem prover 1lean theorem proving 1number theory 1odd covering systems 1rational certificates 1
From the 2 of 2 linked papers with an AI index.
2 papers
cs.LO2026
Machine-Checked Certificates for the Geometric Half of the Minimum Kochen-Specker Bound
Shayaan Siddique, Ibrahim Mian
The paper provides fully machine-checked certificates for the geometric part of the Kochen‑Specker minimum‑vector bound proof, using exact rational methods and independent checkers…
cs.LO2026
Kernel-Checked Exclusions for the ErdÅs-Selfridge Odd Covering Problem: Any Odd Covering of Has lcm Exceeding 10000
Ibrahim Mian, Shayaan Siddique
The paper presents a Lean 4 formalisation, fully checked by the proof kernel, that any covering of the integers by distinct odd moduli greater than 1 must have a least common multi…