AFTD Auto-Formalizing Theoretical Domains

pathCertEdgeCountCancel

theoremverified

Across a four-color path edge the signed number of the seven crossing indicators is zero.

Statement

open scoped BigOperators in
theorem pathCertEdgeCountCancel (a b : Fin 4) :
    (∑ j : Fin 7, pathCertSign j * (if Nat.testBit (pathCertMask j) a.val != Nat.testBit (pathCertMask j) b.val then (1 : ℤ) else 0)) = 0
Source
Four-color word certificate for path cut-rank inequalities, using the transition table of experiment 22529.
Verified
11 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • pathCertMaskThe seven party-union masks for a four-color path word.
  • pathCertSignThe signs of the seven terms in the tripartite cut-rank sum.
Used by 1

Lean source view module on GitHub

open scoped BigOperators in
theorem pathCertEdgeCountCancel (a b : Fin 4) :
    (∑ j : Fin 7, pathCertSign j * (if Nat.testBit (pathCertMask j) a.val != Nat.testBit (pathCertMask j) b.val then (1 : ℤ) else 0)) = 0 := by
  revert a b
  decide
See it in the graphDiscuss this resultChallenge it