AFTD Auto-Formalizing Theoretical Domains

perm_inflection_set

def

For a permutation σ : Equiv.Perm (Fin n), the inflection set perm_inflection_set σ : Finset (ℕ × ℕ) is the filter of pairs (m, p) in Finset.Icc 2 (n - 1) ×ˢ Finset.Icc 2 (n - 1) satisfying m < p, perm_second_derivative σ m * perm_second_derivative σ p < 0, and perm_second_derivative σ ℓ = 0 for all ℓ ∈ Finset.Ioo m p.

Statement

def perm_inflection_set {n : ℕ} (σ : Equiv.Perm (Fin n)) : Finset (ℕ × ℕ)
Defined in
arXiv:2610.38237, Definition 1.3
Verified
07 Nov 2026
Axioms
none listed
Built on 1
  • perm_second_derivativeFor a permutation σ : Equiv.Perm (Fin n) and a natural number ℓ : ℕ, the discrete second derivative perm_second_derivative σ ℓ : ℤ is (σ…
Used by 6
  • op_686_single_element_admissibleFor all natural numbers k, m : ℕ satisfying 2 ≤ k and k < m, the single-element set {(k, m)} is an admissible inflection set…
  • op_686_two_three_three_four_admissibleThe two-element set {(2, 3), (3, 4)} is an admissible inflection set (is_admissible_inflection_set {(2, 3), (3, 4)}).
  • 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_inflection_set_trans_revPermReversing the values of a permutation σ of Fin n (σ.trans Fin.revPerm) does not change its inflection set: perm_inflection_set (σ.trans…
  • perm_inflection_set_eq_two_of_sign_patternIf a permutation σ has discrete second derivative that is non-negative on [2, k₁), positive at k₁, zero on (k₁, m₁), negative at m₁,…
  • is_vanishing_inflection_setA finite set I : Finset (ℕ × ℕ) is a vanishing inflection set (is_vanishing_inflection_set I) if is_admissible_inflection_set I holds and…

Read back from the Lean

perm_inflection_set is a definition parameterized by a natural number n and a permutation σ of Fin n. It defines the finite set of pairs of natural numbers (m, p) such that: 1. Both m and p belong to the closed interval of natural numbers [2, n - 1]; 2. m < p; 3. The product perm_second_derivative σ m * perm_second_derivative σ p is strictly negative (i.e., the second derivatives have opposite nonzero signs); 4. For every natural number ℓ strictly between m and p (m < ℓ < p), perm_second_derivative σ ℓ = 0.

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

/-- The set of pairs (m, p) of indices where permutation σ changes sign in its second derivative. -/
def perm_inflection_set {n : ℕ} (σ : Equiv.Perm (Fin n)) : Finset (ℕ × ℕ) := (Finset.Icc 2 (n - 1) ×ˢ Finset.Icc 2 (n - 1)).filter fun ⟨m, p⟩ =>
    m < p ∧
    perm_second_derivative σ m * perm_second_derivative σ p < 0 ∧
    ∀ ℓ ∈ Finset.Ioo m p, perm_second_derivative σ ℓ = 0
See it in the graphDiscuss this resultChallenge it