op_1239_coefficients_force_not_log_concave
Any finite simple graph whose partial Petrial coefficients in ranks 27, 28, and 29 are respectively 256, 32640, and 4666944 fails partial Petrial log-concavity.
Statement
theorem op_1239_coefficients_force_not_log_concave {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (h1 : petrial_coeff G 27 = 256) (h2 : petrial_coeff G 28 = 32640) (h3 : petrial_coeff G 29 = 4666944) : ¬ petrial_log_concave G
- Source
- Candidate for OP-1239; computations 28328 and 28332 checks the standard leaf-deletion recurrence from arXiv:2611.07503, Lemma 1.
- Verified
- 16 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- 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_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 1
- op_1239_candidate36_not_log_concaveThe partial Petrial polynomial of op_1239_candidate36 is not log-concave.
The proof, explained
The proof proceeds by contradiction. Assuming that the partial Petrial coefficients of G are log-concave, we specialize the condition to rank 28. Using the non-zero coefficients at ranks 27 and 29 to satisfy the boundary preconditions, log-concavity asserts that c₂₇ · c₂₉ ≤ c₂₈². Substituting the given values gives 256 × 4666944 ≤ 32640², which fails because 1194737664 > 1065369600.
Assume, for contradiction, that G has log-concave partial Petrial coefficients.
We introduce the negation of the goal as the hypothesis h, assuming petrial_log_concave G.
intro hLog-concavity at rank 28 implies petrial_coeff G (28 - 1) * petrial_coeff G (28 + 1) ≤ petrial_coeff G 28 ^ 2.
We instantiate the log-concavity hypothesis at rank k = 28. The definition requires a non-zero coefficient at some rank below 28 and at some rank above 28. We provide rank 27 as the lower witness (since 27 < 28 and petrial_coeff G 27 = 256 ≠ 0) and rank 29 as the upper witness (since 29 > 28 and petrial_coeff G 29 = 4666944 ≠ 0).
have h' := h 28 (by refine ⟨27, by omega, ?_⟩; rw [h1]; norm_num) (by refine ⟨29, by omega, ?_⟩; rw [h3]; norm_num)
The inequality at rank 28 reduces to 256 * 4666944 ≤ 32640 ^ 2.
Evaluating the index arithmetic 28 - 1 = 27 and 28 + 1 = 29 and substituting the given coefficient values from hypotheses h1, h2, and h3 rewrites the inequality into pure integer arithmetic.
rw [show 28-1=27 by decide, show 28+1=29 by decide, h1, h2, h3] at h'
The inequality is false, yielding a contradiction. automation
Direct computation gives 256 * 4666944 = 1194737664 and 32640 ^ 2 = 1065369600. Since 1194737664 ≤ 1065369600 is false, norm_num derives False and closes the proof.
norm_num at h'
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
theorem op_1239_coefficients_force_not_log_concave {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (h1 : petrial_coeff G 27 = 256) (h2 : petrial_coeff G 28 = 32640) (h3 : petrial_coeff G 29 = 4666944) : ¬ petrial_log_concave G := by intro h have h' := h 28 (by refine ⟨27, by omega, ?_⟩; rw [h1]; norm_num) (by refine ⟨29, by omega, ?_⟩; rw [h3]; norm_num) rw [show 28-1=27 by decide, show 28+1=29 by decide, h1, h2, h3] at h' norm_num at h'