AFTD Auto-Formalizing Theoretical Domains

pathCertDelta

def

The signed change of the seven greedy matching counts for one appended vertex.

Statement

open scoped BigOperators in
def pathCertDelta (a b : Fin 4) (s : Fin 128) : ℤ
Source
Finite-state path cut-matching certificate for OP-827; exhaustive transition check in experiment 22529.
Verified
11 Nov 2026
Axioms
none listed
Built on 2
  • pathCertTakeGreedy matching choice for one cut when a path edge is appended.
  • pathCertSignThe signs of the seven terms in the tripartite cut-rank sum.
Used by 4
  • pathCertRun_eq_greedyThe automaton output equals the signed sum of seven greedy edge counts.
  • pathCertStepEach reachable transition remains reachable and respects the path certificate potential.
  • pathCertRunBoundThe accumulated signed greedy count is bounded by the finite-state potential.
  • pathCertRunRun the seven simultaneous greedy matching counters on a colored path suffix.

Lean source view module on GitHub

open scoped BigOperators in
def pathCertDelta (a b : Fin 4) (s : Fin 128) : ℤ :=
  ∑ j : Fin 7, if pathCertTake a b s j then pathCertSign j else 0
See it in the graphDiscuss this resultChallenge it