pmms3c_check_220
theoremverified
Kernel check of the stored certificates for the 729 allocations that give chores 0, 1, 2 to agents 2, 2, 0.
Statement
theorem pmms3c_check_220 : ∀ d e f g h k : Fin 3, pmms3c_verify ![2, 2, 0, d, e, f, g, h, k] (pmms3c_tree_get pmms3c_cert [2, 2, 0, d, e, f, g, h, k]) = true- Source
- step towards pmms_chores_three_agents_may_not_exist (three-agent chores PMMS, not posed in arXiv:2609.10493) (kernel-checked violation certificates over all 3^9 allocations)
- Verified
- 26 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- pmms3c_verifyChecks a violation certificate w = i + 3j + 9T for allocation σ: i ≠ j, the bitmask T lies inside X_i ∪ X_j, and both T and (X_i ∪ X_j) \…
- pmms3c_tree_getLookup in the ternary tree: follow branch d_1, then d_2, and so on, and return the leaf reached.
- pmms3c_certA table giving, for every one of the 3^9 = 19683 allocations of the nine chores to the three agents, an agent i, another agent j and a…
- Used by 1
- pmms3c_checkEvery one of the 3^9 allocations passes the certificate check.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem pmms3c_check_220 : ∀ d e f g h k : Fin 3, pmms3c_verify ![2, 2, 0, d, e, f, g, h, k] (pmms3c_tree_get pmms3c_cert [2, 2, 0, d, e, f, g, h, k]) = true := by decide +kernel