Date added
Withdrawn 10 Nov 2026
Tang and Wang published the strict Dirichlet Pólya inequality for all bounded simply connected planar domains and every positive index on October 9, 2026. This includes the bounded convex domains covered by this target. The proof predates the November 9 submission. See https://arxiv.org/html/2610.13139v1.
Read the recorded decision1 proof submitted, 13 days ago
Formal statement
Proof target
import Mathlib
import FormalConjectures.ResearchTargets.Math30
import TaskSupport
namespace Bounty
theorem target : fcTypeOfName% "Math30Catalog.source27" := by
sorry
end Bounty
Original conjecture (Lean type)
Math30.Polya.Target27Original conjecture source: FormalConjectures/ResearchTargets/Math30.lean
The audit patch changes this file, so the upstream version can differ from the statement above.
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.