A Lean formalisation of the disproof of Ramaekers's conjecture
We describe Redhill, a Lean formalisation of the major results in H\"olzl, Kleine and Stephan's"Improved Lower Bounds for Strong $n$-Conjectures"(arXiv:2409.13439). Design decisions regarding types and data structures are justified as enabling canonical versions of the paper's claims, and from there the most direct pro...