petrial_log_concave
A simple graph G on a finite type V with decidable equality and decidable adjacency has a log-concave partial Petrial polynomial if for every k : ℕ, whenever there exists i < k such that petrial_coeff G i ≠ 0 and there exists j > k such that petrial_coeff G j ≠ 0, we have petrial_coeff G (k - 1) * petrial_coeff G (k + 1) ≤ (petrial_coeff G k) ^ 2.
Statement
def petrial_log_concave {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : Prop
- Defined in
- arXiv:2611.07503, Section 2
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 1
- 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…
- Used by 3
- petrial_log_concave_of_card_le_oneEvery simple graph on at most 1 vertex satisfies petrial_log_concave G.
- op_1239_at_most_two_nonzero_coeffs_log_concaveEvery simple graph G on a finite type V with decidable equality and decidable adjacency for which the number of k in the range from 0 to…
- op_1239_path_graph_petrial_log_concaveFor every n : ℕ, the path graph pathGraph n has a log-concave partial Petrial polynomial (petrial_log_concave (SimpleGraph.pathGraph n)).
Read back from the Lean
Given a finite type V with decidable equality and a simple graph G on V with decidable adjacency, petrial_log_concave G asserts that for every natural number k:
if there exists a natural number i < k such that petrial_coeff G i ≠ 0, and
there exists a natural number j > k such that petrial_coeff G j ≠ 0,
then petrial_coeff G (k - 1) * petrial_coeff G (k + 1) ≤ petrial_coeff G k ^ 2.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Log-concavity of the nonzero coefficient sequence of the partial Petrial polynomial. -/ def petrial_log_concave {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] : Prop := ∀ k : ℕ, (∃ i < k, petrial_coeff G i ≠ 0) → (∃ j > k, petrial_coeff G j ≠ 0) → petrial_coeff G (k - 1) * petrial_coeff G (k + 1) ≤ petrial_coeff G k ^ 2