AFTD Auto-Formalizing Theoretical Domains

petrial_leaf_flip

def

For vertices v and u and a vertex subset F, restrict F to the complement of v and toggle membership of u.

Statement

noncomputable def petrial_leaf_flip {V : Type*} [Fintype V] [DecidableEq V] (v u : V) (F : Finset V) : Finset (({v}ᶜ : Set V))
Source
Diagonal toggle in the leaf-elimination recurrence for OP-1239.
Verified
15 Nov 2026
Axioms
none listed
Used by 4
  • petrial_leaf_flip_bijectiveFor distinct vertices v and u, restricting a vertex subset containing v to the complement of v and toggling u is a bijection onto all…
  • petrial_nullity_poly_leaf_recFor a finite graph G with a degree-one vertex v whose neighbour is u, the nullity generating polynomial of G equals the nullity generating…
  • op_1239_candidate36_petrial_coefficientsThe partial Petrial coefficients of op_1239_candidate36 in ranks 27, 28, and 29 are respectively 256, 32640, and 4666944.
  • petrial_leaf_one_pivotIf v is a leaf with unique neighbor u and the diagonal perturbation includes v, the perturbed matrix rank is one plus the rank on the…

Lean source view module on GitHub

noncomputable def petrial_leaf_flip {V : Type*} [Fintype V] [DecidableEq V] (v u : V) (F : Finset V) : Finset (({v}ᶜ : Set V)) := Finset.univ.filter (fun x => (x.1 ∈ F ∧ x.1 ≠ u) ∨ (x.1 ∉ F ∧ x.1 = u))
See it in the graphDiscuss this resultChallenge it