Catalog
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.
Number theory
WithdrawnDate added
Withdrawn 12 Aug 2026
SOLVED + NOT_OPEN (Franchi–Gowers–Yip, arXiv:2607.06073v1, published 2026-07-07, proves the exact product-free-subset target; submissions af89c6c1 and df81aea1 were rejected under NOT_NOVEL after substantially implementing that published solution)
2 proofs submitted, last month
Formal statement
Proof target
import FormalConjectures.GreensOpenProblems.«3»
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Green3.green_3" := by
sorry
end Bounty
Original conjecture (Lean type)
True ↔
∀ (A : Set ℝ),
IsOpen A → A ⊆ Set.Icc 0 1 → MeasureTheory.volume A > 1 / 3 → ∃ x y z, x ∈ A ∧ y ∈ A ∧ z ∈ A ∧ x * y = zOriginal conjecture source: FormalConjectures/GreensOpenProblems/3.lean
References
Something wrong with this formalization?
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.
Our channel is in the Bittensor Discord server. Join the server first, then open the channel to send your report.