op_686_single_element_admissible
For all natural numbers k, m : ℕ satisfying 2 ≤ k and k < m, the single-element set {(k, m)} is an admissible inflection set (is_admissible_inflection_set {(k, m)}).
Statement
theorem op_686_single_element_admissible (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) :
is_admissible_inflection_set {(k, m)}- Formalizes
- arXiv:2610.38237, Corollary 5.15
- Verified
- 07 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- is_admissible_inflection_setA finite set I : Finset (ℕ × ℕ) is an admissible inflection set (is_admissible_inflection_set I) if there exist n : ℕ and a permutation σ…
- perm_second_derivativeFor a permutation σ : Equiv.Perm (Fin n) and a natural number ℓ : ℕ, the discrete second derivative perm_second_derivative σ ℓ : ℤ is (σ…
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - LinearOrder.toTotalPreorderEvery
LinearOrderis aTotalPreorder. - perm_inflection_setFor a permutation σ : Equiv.Perm (Fin n), the inflection set perm_inflection_set σ : Finset (ℕ × ℕ) is the filter of pairs (m, p) in…
Read back from the Lean
For any two natural numbers $k$ and $m$ such that $2 \le k < m$, the singleton set $\{(k, m)\}$ is an admissible inflection set. That is, there exist a natural number $n$ and a permutation $\sigma$ of $\{0, \dots, n - 1\}$ whose inflection set is exactly $\{(k, m)\}$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
To prove that every single-element set {(k, m)} with 2 ≤ k < m is an admissible inflection set, the proof constructs an explicit piecewise linear permutation on Fin(2m - k) known as the single-element gadget. The gadget consists of three linear pieces: the identity on [0, k), slope +2 on [k, m), and slope -2 on [m, 2m - k). The discrete second derivative of this permutation is shown to be identically zero everywhere except at k (where it equals 1) and at m (where it equals -3). Consequently, (k, m) is the unique pair of indices with opposite-sign second derivatives separated by vanishing intermediate derivatives, proving that the inflection set is precisely {(k, m)}.
For any natural number t < 2m - k, the gadget value g(t) is strictly less than 2m - k. automation
The gadget valuation g(t) is defined piecewise on [0, k), [k, m), and [m, 2m - k). Splitting into these three cases, linear integer arithmetic (`omega`) verifies that the output in each case is strictly less than 2m - k.
def op_686_single_element_admissible_gadget_val (k m t : ℕ) : ℕ := if t < k then t else if t < m then 2 * t - k + 1 else 4 * m - k - 2 - 2 * t theorem op_686_single_element_admissible_gadget_val_lt (k m t : ℕ) (hk : 2 ≤ k) (hkm : k < m) (ht : t < 2 * m - k) : op_686_single_element_admissible_gadget_val k m t < 2 * m - k := by unfold op_686_single_element_admissible_gadget_val; split_ifs <;> omega
The gadget valuation function is injective on the domain of integers strictly less than 2m - k. automation
Assuming g(t₁) = g(t₂) for t₁, t₂ < 2m - k, splitting across all combinations of piecewise branches produces 9 subcases, each of which is solved or shown contradictory by linear integer arithmetic (`omega`), yielding t₁ = t₂.
theorem op_686_single_element_admissible_gadget_val_inj (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : ∀ t1 t2 : ℕ, t1 < 2 * m - k → t2 < 2 * m - k → op_686_single_element_admissible_gadget_val k m t1 = op_686_single_element_admissible_gadget_val k m t2 → t1 = t2 := by intro t1 t2 ht1 ht2 h unfold op_686_single_element_admissible_gadget_val at h split_ifs at h <;> omega
The map induced by the gadget value on Fin(2m - k) is injective.
Given two elements a, b ∈ Fin(2m - k) with identical images under the gadget map, equality of their underlying integer values follows from the injectivity of the gadget valuation (`op_686_single_element_admissible_gadget_val_inj`), whence a = b by extensionality on Fin (`Fin.ext`, `congr_arg`, `Fin.val`).
uses
Fin.ext,congr_arg,Fin.val,op_686_single_element_admissible_gadget_val_injdef op_686_single_element_admissible_gadget_fn (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : Fin (2 * m - k) → Fin (2 * m - k) := fun t => ⟨op_686_single_element_admissible_gadget_val k m t.1, op_686_single_element_admissible_gadget_val_lt k m t.1 hk hkm t.2⟩ theorem op_686_single_element_admissible_gadget_fn_injective (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : Function.Injective (op_686_single_element_admissible_gadget_fn k m hk hkm) := by intro a b hab apply Fin.ext have h := congr_arg Fin.val hab exact op_686_single_element_admissible_gadget_val_inj k m hk hkm a.1 b.1 a.2 b.2 h
For any index ℓ ∈ [2, 2m - k - 1], the discrete second derivative of the gadget permutation at ℓ equals g(ℓ) + g(ℓ - 2) - 2 * g(ℓ - 1).
Unfolding the definition of the discrete second derivative of a permutation, the hypothesis 2 ≤ ℓ ≤ 2m - k - 1 ensures that ℓ, ℓ - 2, and ℓ - 1 are valid indices in the domain, allowing the second derivative to simplify directly to the second difference of the gadget values.
noncomputable def op_686_single_element_admissible_gadget_perm (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : Equiv.Perm (Fin (2 * m - k)) := Equiv.ofBijective (op_686_single_element_admissible_gadget_fn k m hk hkm) ((op_686_single_element_admissible_gadget_fn_injective k m hk hkm).bijective_of_finite) theorem op_686_single_element_admissible_gadget_d_eq (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) (ℓ : ℕ) (hℓ : 2 ≤ ℓ ∧ ℓ ≤ 2 * m - k - 1) : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) ℓ = (op_686_single_element_admissible_gadget_val k m ℓ : ℤ) + (op_686_single_element_admissible_gadget_val k m (ℓ - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (ℓ - 1) : ℤ) := by unfold perm_second_derivative split_ifs rfl
In the range 2 ≤ ℓ ≤ 2m - k - 1, the discrete second difference of gadget values is strictly positive if and only if ℓ = k. automation
Unfolding the gadget value definition and splitting on all branch conditions for ℓ, ℓ - 2, and ℓ - 1, linear integer arithmetic (`omega`) verifies that the second difference is strictly positive precisely when ℓ = k.
theorem op_686_single_element_admissible_gadget_d_pos (k m ℓ : ℕ) (hk : 2 ≤ k) (hkm : k < m) (hℓ : 2 ≤ ℓ ∧ ℓ ≤ 2 * m - k - 1) : 0 < (op_686_single_element_admissible_gadget_val k m ℓ : ℤ) + (op_686_single_element_admissible_gadget_val k m (ℓ - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (ℓ - 1) : ℤ) ↔ ℓ = k := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omega
The discrete second difference of gadget values at k equals 1. automation
Unfolding the gadget value definition at k, k - 2, and k - 1, linear integer arithmetic (`omega`) reduces the second difference (k + 1) + (k - 2) - 2(k - 1) to 1.
theorem op_686_single_element_admissible_gadget_d_k (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : (op_686_single_element_admissible_gadget_val k m k : ℤ) + (op_686_single_element_admissible_gadget_val k m (k - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (k - 1) : ℤ) = 1 := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omega
The discrete second difference of gadget values at m equals -3. automation
Unfolding the gadget value definition at m, m - 2, and m - 1, linear integer arithmetic (`omega`) reduces the second difference to -3.
theorem op_686_single_element_admissible_gadget_d_m (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : (op_686_single_element_admissible_gadget_val k m m : ℤ) + (op_686_single_element_admissible_gadget_val k m (m - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (m - 1) : ℤ) = -3 := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omega
The discrete second difference of gadget values vanishes for every ℓ strictly between k and m. automation
Unfolding the gadget value definition under the hypothesis k < ℓ < m, linear integer arithmetic (`omega`) shows that the linear structure of the middle piece ensures the second difference is 0.
theorem op_686_single_element_admissible_gadget_d_zero (k m ℓ : ℕ) (hk : 2 ≤ k) (hℓ : k < ℓ ∧ ℓ < m) : (op_686_single_element_admissible_gadget_val k m ℓ : ℤ) + (op_686_single_element_admissible_gadget_val k m (ℓ - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (ℓ - 1) : ℤ) = 0 := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omega
The discrete second difference of gadget values vanishes for every ℓ with 2 ≤ ℓ < k. automation
When ℓ < k, all three inputs ℓ, ℓ - 2, and ℓ - 1 lie in the identity segment [0, k), so the second difference ℓ + (ℓ - 2) - 2(ℓ - 1) is 0 by linear arithmetic (`omega`).
theorem op_686_single_element_admissible_gadget_d_lt_k_zero (k m ℓ : ℕ) (hℓ : 2 ≤ ℓ ∧ ℓ < k) : (op_686_single_element_admissible_gadget_val k m ℓ : ℤ) + (op_686_single_element_admissible_gadget_val k m (ℓ - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (ℓ - 1) : ℤ) = 0 := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omega
The gadget permutation's second derivative is 1 at k, -3 at m, and 0 on the open interval (k, m).
Setting n = 2m - k, both k and m satisfy the derivative domain bounds. Rewriting with the derivative formula (`op_686_single_element_admissible_gadget_d_eq`) and applying the specific evaluations (`op_686_single_element_admissible_gadget_d_k`, `op_686_single_element_admissible_gadget_d_m`, `op_686_single_element_admissible_gadget_d_zero`, `Finset.mem_Ioo`) establishes these values.
uses
op_686_single_element_admissible_gadget_d_eq,op_686_single_element_admissible_gadget_d_k,op_686_single_element_admissible_gadget_d_m,Finset.mem_Ioo,op_686_single_element_admissible_gadget_d_zerotheorem op_686_single_element_admissible_gadget_perm_inflection_set (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : perm_inflection_set (op_686_single_element_admissible_gadget_perm k m hk hkm) = {(k, m)} := by let n := 2 * m - k have hkn : 2 ≤ k ∧ k ≤ n - 1 := by dsimp [n]; omega have hmn : 2 ≤ m ∧ m ≤ n - 1 := by dsimp [n]; omega have hdk : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) k = 1 := by rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm k hkn] exact op_686_single_element_admissible_gadget_d_k k m hk hkm have hdm : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) m = -3 := by rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm m hmn] exact op_686_single_element_admissible_gadget_d_m k m hk hkm have hd_zero : ∀ ℓ ∈ Finset.Ioo k m, perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) ℓ = 0 := by intro ℓ hℓ rw [Finset.mem_Ioo] at hℓ have hℓn : 2 ≤ ℓ ∧ ℓ ≤ n - 1 := by dsimp [n]; omega rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm ℓ hℓn] exact op_686_single_element_admissible_gadget_d_zero k m ℓ hk hℓ
The pair (k, m) belongs to the inflection set of the gadget permutation.
By definition of `perm_inflection_set`, a pair lies in the inflection set if both elements are in [2, n - 1], the first is strictly less than the second, their second derivatives have strictly negative product, and the second derivative vanishes everywhere in between (`Finset.mem_filter`, `Finset.mem_product`, `Finset.mem_Icc`). All conditions hold for (k, m) because 1 * (-3) = -3 < 0 and the derivative vanishes on (k, m).
uses
Finset.mem_filter,Finset.mem_product,Finset.mem_Icchave h_mem : (k, m) ∈ perm_inflection_set (op_686_single_element_admissible_gadget_perm k m hk hkm) := by unfold perm_inflection_set rw [Finset.mem_filter, Finset.mem_product] refine ⟨⟨?_, ?_⟩, hkm, ?_, hd_zero⟩ · rw [Finset.mem_Icc]; exact hkn · rw [Finset.mem_Icc]; exact hmn · rw [hdk, hdm]; decide
Any pair (a, b) in the inflection set satisfies bounds, has derivative product < 0, and has zero derivatives in between; the derivative is positive only at k and zero below k.
Unpacking membership in the inflection set via extensionality (`Finset.mem_singleton`, `Finset.mem_filter`, `Finset.mem_product`, `Finset.mem_Icc`), any inflection pair (a, b) satisfies a < b, opposite derivative signs, and vanishing in between. Auxiliary characterizations (`op_686_single_element_admissible_gadget_d_eq`, `op_686_single_element_admissible_gadget_d_pos`, `op_686_single_element_admissible_gadget_d_lt_k_zero`) establish that the second derivative is strictly positive only at k and zero strictly below k.
uses
Finset.mem_singleton,Finset.mem_filter,Finset.mem_product,Finset.mem_Icc,op_686_single_element_admissible_gadget_d_eq,op_686_single_element_admissible_gadget_d_pos,op_686_single_element_admissible_gadget_d_lt_k_zeroext ⟨a, b⟩ rw [Finset.mem_singleton] constructor · intro hab unfold perm_inflection_set at hab rw [Finset.mem_filter, Finset.mem_product] at hab rcases hab with ⟨⟨ha_icc, hb_icc⟩, hab_lt, hab_prod, hab_mid⟩ rw [Finset.mem_Icc] at ha_icc hb_icc have h_pos_k : ∀ x, (2 ≤ x ∧ x ≤ n - 1) → (0 < perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) x ↔ x = k) := by intro x hx rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm x hx] exact op_686_single_element_admissible_gadget_d_pos k m x hk hkm hx have h_lt_k : ∀ x, 2 ≤ x → x < k → perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) x = 0 := by intro x h2x hxk have hxn : 2 ≤ x ∧ x ≤ n - 1 := by dsimp [n]; omega rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm x hxn] exact op_686_single_element_admissible_gadget_d_lt_k_zero k m x ⟨h2x, hxk⟩
The first component a of any inflection pair (a, b) must equal k.
Assume for contradiction a ≠ k. Then the second derivative at a cannot be positive, which implies the derivative at b must be positive since their product is negative. By the positivity characterization, b = k. But then a < b = k, so the derivative at a must vanish (as it lies strictly below k), contradicting that the product of the derivatives is strictly negative. Thus a = k.
have ha_eq_k : a = k := by by_contra ha_ne_k have hda_not_pos : ¬ (0 < perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) a) := by intro hpos exact ha_ne_k ((h_pos_k a ha_icc).mp hpos) have hdb_pos : 0 < perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) b := by nlinarith have hb_eq_k : b = k := (h_pos_k b hb_icc).mp hdb_pos have ha_lt_k : a < k := by omega have hda_zero : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) a = 0 := h_lt_k a ha_icc.1 ha_lt_k nlinarith
The second component b of any inflection pair (a, b) must equal m, hence (a, b) = (k, m).
If b ≠ m, then either b < m or b > m (`lt_or_gt_of_ne`). If b < m, then k < b < m, so the second derivative at b is 0 (`op_686_single_element_admissible_gadget_d_eq`, `op_686_single_element_admissible_gadget_d_zero`, `mul_zero`), contradicting that the product of derivatives is negative. If b > m, then m lies in the open interval (a, b) (`Finset.mem_Ioo`), forcing the second derivative at m to vanish, which contradicts that it equals -3. Hence b = m, and together with a = k this yields (a, b) = (k, m) (`Prod.ext`).
uses
lt_or_gt_of_ne,op_686_single_element_admissible_gadget_d_eq,op_686_single_element_admissible_gadget_d_zero,mul_zero,Finset.mem_Ioo,Prod.exthave hb_eq_m : b = m := by by_contra hb_ne_m rcases lt_or_gt_of_ne hb_ne_m with hb_lt_m | hb_gt_m · have hmid : k < b ∧ b < m := ⟨by omega, hb_lt_m⟩ have hdb_zero : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) b = 0 := by rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm b hb_icc] exact op_686_single_element_admissible_gadget_d_zero k m b hk hmid rw [hdb_zero, mul_zero] at hab_prod contradiction · have hm_in_mid : m ∈ Finset.Ioo a b := by rw [Finset.mem_Ioo] exact ⟨by omega, hb_gt_m⟩ have hdm_zero := hab_mid m hm_in_mid rw [hdm] at hdm_zero contradiction exact Prod.ext ha_eq_k hb_eq_m
The singleton set {(k, m)} is contained in the inflection set of the gadget permutation.
Any pair equal to (k, m) belongs to the inflection set by the previously established membership of (k, m).
· intro h cases h exact h_mem
The single-element set {(k, m)} is an admissible inflection set.
By definition of `is_admissible_inflection_set`, we exhibit the dimension n = 2m - k and the gadget permutation. The theorem follows immediately from `op_686_single_element_admissible_gadget_perm_inflection_set`.
uses
op_686_single_element_admissible_gadget_perm_inflection_set/-- Every single-element inflection set is admissible (arXiv:2610.38237, Corollary 5.15). -/ theorem op_686_single_element_admissible (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : is_admissible_inflection_set {(k, m)} := by use 2 * m - k, op_686_single_element_admissible_gadget_perm k m hk hkm exact op_686_single_element_admissible_gadget_perm_inflection_set k m hk hkm
Fin.ext- Two elements of Fin(n) are equal if and only if their underlying natural number values are equal.
Fin.val- The canonical projection from Fin(n) to ℕ representing the underlying index.
Finset.mem_Icc- An element belongs to the closed interval [a, b] in a locally finite order if and only if a ≤ x ≤ b.
Finset.mem_Ioo- An element belongs to the open interval (a, b) in a locally finite order if and only if a < x < b.
Finset.mem_filter- An element belongs to a filtered finset if and only if it belongs to the parent finset and satisfies the filtering predicate.
Finset.mem_product- A pair belongs to the Cartesian product of two finsets if and only if its first component belongs to the first finset and its second component belongs to the second finset.
Finset.mem_singleton- An element belongs to the singleton set {a} if and only if it is equal to a.
Prod.ext- Two ordered pairs are equal if and only if their first coordinates are equal and their second coordinates are equal.
congr_arg- Applying a function to equal inputs yields equal outputs.
lt_or_gt_of_ne- In any linear order, two unequal elements satisfy either a < b or b < a.
mul_zero- The product of any element with zero is zero.
op_686_single_element_admissible_gadget_d_eq- For 2 ≤ ℓ ≤ 2m - k - 1, the discrete second derivative of the gadget permutation at ℓ equals the second difference g(ℓ) + g(ℓ - 2) - 2 * g(ℓ - 1) of the gadget values.
op_686_single_element_admissible_gadget_d_k- The discrete second difference of the gadget values evaluated at k equals 1.
op_686_single_element_admissible_gadget_d_lt_k_zero- For any index ℓ with 2 ≤ ℓ < k, the discrete second difference of the gadget values is 0.
op_686_single_element_admissible_gadget_d_m- The discrete second difference of the gadget values evaluated at m equals -3.
op_686_single_element_admissible_gadget_d_pos- In the valid derivative range [2, 2m - k - 1], the discrete second difference of the gadget values is strictly positive if and only if ℓ = k.
op_686_single_element_admissible_gadget_d_zero- The discrete second difference of the gadget values vanishes for all ℓ strictly between k and m.
op_686_single_element_admissible_gadget_perm_inflection_set- The inflection set of the gadget permutation on Fin(2m - k) is precisely the singleton set {(k, m)}.
op_686_single_element_admissible_gadget_val_inj- For 2 ≤ k < m, the gadget valuation function is injective on the range of natural numbers strictly less than 2m - k.
- The piecewise arithmetic verification of the gadget value bounds and discrete second derivatives relies on the `omega` decision procedure for Presburger linear integer arithmetic.
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.
def op_686_single_element_admissible_gadget_val (k m t : ℕ) : ℕ := if t < k then t else if t < m then 2 * t - k + 1 else 4 * m - k - 2 - 2 * ttheorem op_686_single_element_admissible_gadget_val_lt (k m t : ℕ) (hk : 2 ≤ k) (hkm : k < m) (ht : t < 2 * m - k) : op_686_single_element_admissible_gadget_val k m t < 2 * m - k := by unfold op_686_single_element_admissible_gadget_val; split_ifs <;> omegatheorem op_686_single_element_admissible_gadget_val_inj (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : ∀ t1 t2 : ℕ, t1 < 2 * m - k → t2 < 2 * m - k → op_686_single_element_admissible_gadget_val k m t1 = op_686_single_element_admissible_gadget_val k m t2 → t1 = t2 := by intro t1 t2 ht1 ht2 h unfold op_686_single_element_admissible_gadget_val at h split_ifs at h <;> omegadef op_686_single_element_admissible_gadget_fn (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : Fin (2 * m - k) → Fin (2 * m - k) := fun t => ⟨op_686_single_element_admissible_gadget_val k m t.1, op_686_single_element_admissible_gadget_val_lt k m t.1 hk hkm t.2⟩theorem op_686_single_element_admissible_gadget_fn_injective (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : Function.Injective (op_686_single_element_admissible_gadget_fn k m hk hkm) := by intro a b hab apply Fin.ext have h := congr_arg Fin.val hab exact op_686_single_element_admissible_gadget_val_inj k m hk hkm a.1 b.1 a.2 b.2 hnoncomputable def op_686_single_element_admissible_gadget_perm (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : Equiv.Perm (Fin (2 * m - k)) := Equiv.ofBijective (op_686_single_element_admissible_gadget_fn k m hk hkm) ((op_686_single_element_admissible_gadget_fn_injective k m hk hkm).bijective_of_finite)theorem op_686_single_element_admissible_gadget_d_eq (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) (ℓ : ℕ) (hℓ : 2 ≤ ℓ ∧ ℓ ≤ 2 * m - k - 1) : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) ℓ = (op_686_single_element_admissible_gadget_val k m ℓ : ℤ) + (op_686_single_element_admissible_gadget_val k m (ℓ - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (ℓ - 1) : ℤ) := by unfold perm_second_derivative split_ifs rfltheorem op_686_single_element_admissible_gadget_d_pos (k m ℓ : ℕ) (hk : 2 ≤ k) (hkm : k < m) (hℓ : 2 ≤ ℓ ∧ ℓ ≤ 2 * m - k - 1) : 0 < (op_686_single_element_admissible_gadget_val k m ℓ : ℤ) + (op_686_single_element_admissible_gadget_val k m (ℓ - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (ℓ - 1) : ℤ) ↔ ℓ = k := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omegatheorem op_686_single_element_admissible_gadget_d_k (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : (op_686_single_element_admissible_gadget_val k m k : ℤ) + (op_686_single_element_admissible_gadget_val k m (k - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (k - 1) : ℤ) = 1 := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omegatheorem op_686_single_element_admissible_gadget_d_m (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : (op_686_single_element_admissible_gadget_val k m m : ℤ) + (op_686_single_element_admissible_gadget_val k m (m - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (m - 1) : ℤ) = -3 := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omegatheorem op_686_single_element_admissible_gadget_d_zero (k m ℓ : ℕ) (hk : 2 ≤ k) (hℓ : k < ℓ ∧ ℓ < m) : (op_686_single_element_admissible_gadget_val k m ℓ : ℤ) + (op_686_single_element_admissible_gadget_val k m (ℓ - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (ℓ - 1) : ℤ) = 0 := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omegatheorem op_686_single_element_admissible_gadget_d_lt_k_zero (k m ℓ : ℕ) (hℓ : 2 ≤ ℓ ∧ ℓ < k) : (op_686_single_element_admissible_gadget_val k m ℓ : ℤ) + (op_686_single_element_admissible_gadget_val k m (ℓ - 2) : ℤ) - 2 * (op_686_single_element_admissible_gadget_val k m (ℓ - 1) : ℤ) = 0 := by unfold op_686_single_element_admissible_gadget_val split_ifs <;> omegatheorem op_686_single_element_admissible_gadget_perm_inflection_set (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : perm_inflection_set (op_686_single_element_admissible_gadget_perm k m hk hkm) = {(k, m)} := by let n := 2 * m - k have hkn : 2 ≤ k ∧ k ≤ n - 1 := by dsimp [n]; omega have hmn : 2 ≤ m ∧ m ≤ n - 1 := by dsimp [n]; omega have hdk : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) k = 1 := by rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm k hkn] exact op_686_single_element_admissible_gadget_d_k k m hk hkm have hdm : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) m = -3 := by rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm m hmn] exact op_686_single_element_admissible_gadget_d_m k m hk hkm have hd_zero : ∀ ℓ ∈ Finset.Ioo k m, perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) ℓ = 0 := by intro ℓ hℓ rw [Finset.mem_Ioo] at hℓ have hℓn : 2 ≤ ℓ ∧ ℓ ≤ n - 1 := by dsimp [n]; omega rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm ℓ hℓn] exact op_686_single_element_admissible_gadget_d_zero k m ℓ hk hℓ have h_mem : (k, m) ∈ perm_inflection_set (op_686_single_element_admissible_gadget_perm k m hk hkm) := by unfold perm_inflection_set rw [Finset.mem_filter, Finset.mem_product] refine ⟨⟨?_, ?_⟩, hkm, ?_, hd_zero⟩ · rw [Finset.mem_Icc]; exact hkn · rw [Finset.mem_Icc]; exact hmn · rw [hdk, hdm]; decide ext ⟨a, b⟩ rw [Finset.mem_singleton] constructor · intro hab unfold perm_inflection_set at hab rw [Finset.mem_filter, Finset.mem_product] at hab rcases hab with ⟨⟨ha_icc, hb_icc⟩, hab_lt, hab_prod, hab_mid⟩ rw [Finset.mem_Icc] at ha_icc hb_icc have h_pos_k : ∀ x, (2 ≤ x ∧ x ≤ n - 1) → (0 < perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) x ↔ x = k) := by intro x hx rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm x hx] exact op_686_single_element_admissible_gadget_d_pos k m x hk hkm hx have h_lt_k : ∀ x, 2 ≤ x → x < k → perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) x = 0 := by intro x h2x hxk have hxn : 2 ≤ x ∧ x ≤ n - 1 := by dsimp [n]; omega rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm x hxn] exact op_686_single_element_admissible_gadget_d_lt_k_zero k m x ⟨h2x, hxk⟩ have ha_eq_k : a = k := by by_contra ha_ne_k have hda_not_pos : ¬ (0 < perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) a) := by intro hpos exact ha_ne_k ((h_pos_k a ha_icc).mp hpos) have hdb_pos : 0 < perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) b := by nlinarith have hb_eq_k : b = k := (h_pos_k b hb_icc).mp hdb_pos have ha_lt_k : a < k := by omega have hda_zero : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) a = 0 := h_lt_k a ha_icc.1 ha_lt_k nlinarith have hb_eq_m : b = m := by by_contra hb_ne_m rcases lt_or_gt_of_ne hb_ne_m with hb_lt_m | hb_gt_m · have hmid : k < b ∧ b < m := ⟨by omega, hb_lt_m⟩ have hdb_zero : perm_second_derivative (op_686_single_element_admissible_gadget_perm k m hk hkm) b = 0 := by rw [op_686_single_element_admissible_gadget_d_eq k m hk hkm b hb_icc] exact op_686_single_element_admissible_gadget_d_zero k m b hk hmid rw [hdb_zero, mul_zero] at hab_prod contradiction · have hm_in_mid : m ∈ Finset.Ioo a b := by rw [Finset.mem_Ioo] exact ⟨by omega, hb_gt_m⟩ have hdm_zero := hab_mid m hm_in_mid rw [hdm] at hdm_zero contradiction exact Prod.ext ha_eq_k hb_eq_m · intro h cases h exact h_mem/-- Every single-element inflection set is admissible (arXiv:2610.38237, Corollary 5.15). -/theorem op_686_single_element_admissible (k m : ℕ) (hk : 2 ≤ k) (hkm : k < m) : is_admissible_inflection_set {(k, m)} := by use 2 * m - k, op_686_single_element_admissible_gadget_perm k m hk hkm exact op_686_single_element_admissible_gadget_perm_inflection_set k m hk hkm