Plectis Atlas
Explicit triangular-cylinder cover below half area
Family 100: Cylinder coverings below the half-area bound
Candidate pairing
Theorem
The tetrahedron (eq:tetrahedron) has A_{\min}(K)=\sqrt2. For every 0<\eps\le1/2000, it admits a covering by m=2\lceil2/\eps^2\rceil cylinders with compact triangular perpendicular bases such that
The remainder has absolute value at most 2\eps^4, and the total base area is strictly less than A_{\min}(K)/2.
Finite angular cylinder covers below the half-area bound
TeX label thm:counterexample, build/sections/introduction.tex, line 32
The Lean statement says
theorem main : A_min = H ∧ MainAsymptotic ∧ NormalizedCounterexample := by sorryA Lean statement states the theorem and leaves its proof as sorry on purpose. OpenAI’s proof is in a separate solution module, and a program called Comparator checks that proof against this statement.