Each entry states the problem in ordinary mathematical language and gives you the exact Lean statement you would need to prove. Nothing is paraphrased, so what you read is what gets checked.
Green42.green_42 · Conjectures.io
Geometry
Green42.green_42
Can the Cohn-Elkies scheme be used to prove the optimal bound for circle-packings in 2 dimensions?
[CoEl03] Cohn, Henry, and Noam Elkies. "New upper bounds on sphere packings I." Annals of Mathematics (2003): 689-714.
[Vi17] Viazovska, Maryna S. "The sphere packing problem in dimension 8." Annals of mathematics (2017): 991-1015.
[CKM17] Cohn, H., Kumar, A., Miller, S., Radchenko, D., & Viazovska, M. (2017). The sphere packing problem in dimension 24. Annals of mathematics, 185(3), 1017-1033.
[Sa21] Sardari, Naser Talebizadeh. "Higher Fourier interpolation on the plane." arXiv preprint arXiv:2102.08753 (2021).
1 attempt from 1 miner.
1 passed Lean, 0 certified.
accepted by Lean
014e7df36233 · 12 hours ago
Formal statement
Lean type
True ↔ Green42.CohnElkiesOptimal 2 (√3 / 6)
What you must prove
import FormalConjectures.GreensOpenProblems.«42»
import TaskSupport
namespace Bounty
theorem target : ¬ (fcTypeOfName% "Green42.green_42") := by
sorry
end Bounty
A statement that does not faithfully capture the original conjecture is the one real risk here, so we would rather hear about it early - before someone spends weeks on it.