AFTD Auto-Formalizing Theoretical Domains

pathCertWordCountCancel

theoremverified

Across a four-color word the signed sum of the seven crossing-edge counts vanishes.

Statement

open scoped BigOperators in
theorem pathCertWordCountCancel (a : Fin 4) (xs : List (Fin 4)) :
    (∑ j : Fin 7, pathCertSign j * ((pathCertWord a xs j).countP id : ℤ)) = 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 4
  • pathCertWordThe sequence of cut-crossing flags for one party-union mask along a colored vertex word.
  • pathCertEdgeCountCancelAcross a four-color path edge the signed number of the seven crossing indicators is zero.
  • pathCertSignThe signs of the seven terms in the tripartite cut-rank sum.
  • pathCertMaskThe seven party-union masks for a four-color path word.
Used by 2
  • path_cut_word_count_cancelFor a four-partition A,B,C,D of the vertices of the path P_n, the total number of edges crossing the cuts defined by A, B, C, D equals the…
  • pathCertOddRunIneqFor any four-color path word, the signed sum of odd crossing-run counts for the seven masks is nonpositive.

Lean source view module on GitHub

open scoped BigOperators in
theorem pathCertWordCountCancel (a : Fin 4) (xs : List (Fin 4)) :
    (∑ j : Fin 7, pathCertSign j * ((pathCertWord a xs j).countP id : ℤ)) = 0 := by
  induction xs generalizing a with
  | nil => simp [pathCertWord]
  | cons b bs ih =>
    simp only [pathCertWord, List.countP_cons, Nat.cast_add, Nat.cast_ite, Nat.cast_one, Nat.cast_zero, mul_add, Finset.sum_add_distrib]
    rw [ih b]
    simpa only [id_eq, zero_add] using pathCertEdgeCountCancel a b
See it in the graphDiscuss this resultChallenge it