Results
Results
submission
Lean accepted this proof on 9 Nov 2026. What happens to it next is decided by people, and that decision is recorded below.
Provenance
Review decision
Already solved before this submissionNOT_NOVEL
The team rejected the bounty under manual-review v4, reason NOT_NOVEL. On October 9, 2026, Quanyu Tang and Zuoqin Wang published a complete proof of the strict Dirichlet Pólya inequality for every bounded simply connected planar domain and every positive eigenvalue index. Each convex domain in this submission is simply connected, and the strict bound implies the requested non-strict bound for the same Dirichlet spectrum. The November 9, 2026 submission therefore formalizes a previously established result. The Lean proof passed verification. Codex and Claude Fable 5.2 agreed after checking the statement and the prior proof, including its passage to general domains. The contributor may request reconsideration from the review team with contrary evidence about the date, scope or completeness of the earlier proof. Primary source: https://arxiv.org/html/2610.13139v1
Rejected · decided 10 Nov 2026
Formal statement
Math30.Polya.Target27Verification report
Every box below had to hold before the proof counted. They are grouped in the order the verifier reaches them.
Manifest valid - Passed
The task bundle held together: the exact file set, a strict manifest, and every trusted hash matching the bytes on disk.
Task commitment matches - Passed
The bundle digest the submission committed to is the digest of the bundle that was actually verified.
Production task - Passed
The task came from the production pool rather than a test fixture.
Trusted file hashes match - Passed
The pinned dependencies agree across the manifest, the lockfile and the checkout, down to the same Formal Conjectures commit.
Submission policy respected - Passed
The submitted source passed the static scan: no imports, no axiom declarations, no sorry, no native_decide, no unsafe options.
Production sandbox - Passed
The run happened under real isolation, Landrun with seccomp, and the sandbox passed its own live self-test before the proof was touched.
Challenge built - Passed
The trusted Challenge.lean, which contains no miner code, compiled on its own.
Source type hash matches - Passed
The source theorem in the compiled environment still hashes to the type recorded in the task, so the statement has not drifted upstream.
Solution built - Passed
The submitted Solution.lean compiled.
Statement unchanged - Passed
The theorem the proof establishes has exactly the same canonical type as the task's target - it was not weakened or restated.
Only permitted axioms - Passed
The transitive axiom closure of the proof stays inside the axioms this task permits.
Lean kernel accepted - Passed
The Lean kernel replayed the proof and accepted it.
Nanoda accepted - Not run
A second kernel, written independently of Lean's, also accepted the proof.
One kernel, not two
This task does not require a second, independent kernel, so Nanoda was not run. The verdict rests on a single kernel implementation.
Theorems established
Stage COMPLETED · Axioms permitted: propext, Quot.sound, Classical.choice