AFTD Auto-Formalizing Theoretical Domains

petrial_leaf_restriction

def

Restrict a finite vertex subset to the complement of vertices u and v.

Statement

noncomputable def petrial_leaf_restriction {V : Type*} [Fintype V] [DecidableEq V] (v u : V) (F : Finset V) : Finset (({u, v}ᶜ : Set V))
Source
Auxiliary definition for the partial Petrial leaf recurrence.
Verified
16 Nov 2026
Axioms
none listed
Used by 4
  • 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_zero_pivotFor a graph with a leaf v and unique neighbor u, if v is absent from the perturbation then its matrix rank is two plus the rank on the…
  • petrial_leaf_restriction_bijectiveFor distinct vertices v and u, a vertex subset omitting v is uniquely determined by its membership bit at u and its restriction to the…

Lean source view module on GitHub

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