petrial_coeff_eq_zero_of_gt_card
theoremverified
For any finite simple graph G and any integer k strictly greater than the number of vertices, petrial_coeff G k equals 0.
Statement
theorem petrial_coeff_eq_zero_of_gt_card {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] {k : ℕ} (hk : Fintype.card V < k) : petrial_coeff G k = 0
- Source
- step towards op_1239_max_degree_three_tree_petrial_log_concave
- Verified
- 15 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- petrial_coeffGiven a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and k : ℕ, petrial_coeff G k is the…
- petrial_matrix_rank_le_cardFor any finite simple graph G and any subset F of vertices, the rank of the petrial matrix of G and F over ZMod 2 is at most the number of…
- petrial_matrixGiven a finite type V with decidable equality, a simple graph G on V with decidable adjacency, and a finite subset F : Finset V,…
- Used by 1
- petrial_log_concave_of_card_le_oneEvery simple graph on at most 1 vertex satisfies petrial_log_concave G.
Lean source view module on GitHub
/-- The partial Petrial coefficient vanishes for indices strictly exceeding |V|. -/ theorem petrial_coeff_eq_zero_of_gt_card {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] {k : ℕ} (hk : Fintype.card V < k) : petrial_coeff G k = 0 := by unfold petrial_coeff simp only [Finset.card_eq_zero, Finset.filter_eq_empty_iff] intro x hx have h_le := petrial_matrix_rank_le_card G x omega