AFTD Auto-Formalizing Theoretical Domains

pathCertMask

def

The seven party-union masks for a four-color path word.

Statement

open scoped BigOperators in
def pathCertMask (j : Fin 7) : ℕ
Source
Finite-state path cut-matching certificate for OP-827; exhaustive transition check in experiment 22529.
Verified
11 Nov 2026
Axioms
none listed
Used by 8
  • 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.
  • pathCertEdgeCountCancelAcross a four-color path edge the signed number of the seven crossing indicators is zero.
  • 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.
  • pathCertWordThe sequence of cut-crossing flags for one party-union mask along a colored vertex word.
  • pathCertTakeGreedy matching choice for one cut when a path edge is appended.

Lean source view module on GitHub

open scoped BigOperators in
def pathCertMask (j : Fin 7) : ℕ := ![1,2,4,3,5,6,7] j
See it in the graphDiscuss this resultChallenge it