AFTD Auto-Formalizing Theoretical Domains

pathCertWord

def

The sequence of cut-crossing flags for one party-union mask along a colored vertex word.

Statement

open scoped BigOperators in
def pathCertWord (a : Fin 4) : List (Fin 4) → Fin 7 → List Bool
Source
Four-color word certificate for path cut-rank inequalities, using the transition table of experiment 22529.
Verified
11 Nov 2026
Axioms
none listed
Built on 1
  • pathCertMaskThe seven party-union masks for a four-color path word.
Used by 6
  • path_cut_word_odd_run_ineqFor a four-partition A,B,C,D of the vertices of the path P_n, the sum of the numbers of maximal odd-length crossing runs for A, B, C and D…
  • pathCertRun_eq_greedyThe automaton output equals the signed sum of seven greedy edge counts.
  • pathCertWordCountCancelAcross a four-color word the signed sum of the seven crossing-edge counts vanishes.
  • 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…
  • path_cert_word_eq_cut_wordThe Boolean edge word used by the finite-state certificate is the ordinary path cut word of the corresponding color mask.
  • 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
def pathCertWord (a : Fin 4) : List (Fin 4) → Fin 7 → List Bool
  | [], _ => []
  | b :: bs, j => (Nat.testBit (pathCertMask j) a.val != Nat.testBit (pathCertMask j) b.val) :: pathCertWord b bs j
See it in the graphDiscuss this resultChallenge it