AFTD Auto-Formalizing Theoretical Domains

petrial_log_concave_of_card_le_one

theoremverified

Every simple graph on at most 1 vertex satisfies petrial_log_concave G.

Statement

theorem petrial_log_concave_of_card_le_one
    {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj]
    (hcard : Fintype.card V ≤ 1) :
    petrial_log_concave G
Source
step towards op_1239_max_degree_three_tree_petrial_log_concave
Verified
15 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • petrial_log_concaveA simple graph G on a finite type V with decidable equality and decidable adjacency has a log-concave partial Petrial polynomial if for…
  • petrial_coeff_eq_zero_of_gt_cardFor any finite simple graph G and any integer k strictly greater than the number of vertices, petrial_coeff G k equals 0.
  • 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…

Lean source view module on GitHub

/-- Any simple graph on at most one vertex has log-concave partial Petrial polynomial. -/
theorem petrial_log_concave_of_card_le_one
    {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj]
    (hcard : Fintype.card V ≤ 1) :
    petrial_log_concave G := by
  intro k ⟨i, hi, hni⟩ ⟨j, hj, hnj⟩
  have hj_gt : Fintype.card V < j := by omega
  have hj_zero := petrial_coeff_eq_zero_of_gt_card G hj_gt
  exact (hnj hj_zero).elim
See it in the graphDiscuss this resultChallenge it