BehroozMoosavi/tugofwar_formalization
- result
- builds, no sorry
- commit
- 6884ed06c327
- lean
- leanprover/lean4:v4.34.0-rc2
- axioms
- not checked (this result is from before the axiom check was added)
- checked
- 2026-11-17
Papers that link it
- A formally verified convergence theorem for the tug-of-war scheme of the normalized $p$-Laplacian arXiv:2611.20169 · 2026-11-17
What this checks
Paperlane cloned the repository, installed the Lean version named in lean-toolchain, downloaded Mathlib's cache when the project uses Mathlib and ran lake build on a clean machine. It counted the declaration uses sorry warnings. After a passing build it listed every axiom that the project's theorems rest on, as #print axioms would, and reports any beyond propext, Classical.choice and Quot.sound. An extra axiom can be a declared axiom or a use of native_decide. A passing build shows the project compiles at that commit. It does not show that the Lean statements match the theorems in the paper.
The check runs again when a new version of a paper links the repository. To ask for a check sooner or to report a wrong result, open an issue.
Add the badge to your README
The badge shows the newest result and links back to this page.
[](https://pragyaangaur.dev/Paperlane/lean/BehroozMoosavi/tugofwar_formalization.html)
<a href="https://pragyaangaur.dev/Paperlane/lean/BehroozMoosavi/tugofwar_formalization.html"><img src="https://pragyaangaur.dev/Paperlane/lean/BehroozMoosavi/tugofwar_formalization.svg" alt="Paperlane Lean: builds"></a>