AFTD Auto-Formalizing Theoretical Domains

op_686_two_three_three_four_admissible

theoremverified

The two-element set {(2, 3), (3, 4)} is an admissible inflection set (is_admissible_inflection_set {(2, 3), (3, 4)}).

Statement

theorem op_686_two_three_three_four_admissible :
    is_admissible_inflection_set {(2, 3), (3, 4)}
Source
arXiv:2610.38237, Section 3
Verified
07 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • 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_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

The set of pairs of natural numbers {(2, 3), (3, 4)} is an admissible inflection set: there exists a natural number n and a permutation σ of Fin n such that the inflection set of σ is precisely {(2, 3), (3, 4)}.

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 show that $\{(2, 3), (3, 4)\}$ is an admissible inflection set, the proof provides an explicit witness: the symmetric group $S_5$ and the transposition $(2\; 3)$. The second derivatives of this permutation at positions $2, 3, 4$ evaluate to $1, -3, 3$, so adjacent sign changes occur precisely on the pairs $(2, 3)$ and $(3, 4)$. This finite set equality is then confirmed directly by computational evaluation.

  1. It suffices to show that the transposition $(2\; 3) \in S_5$ has inflection set $\{(2, 3), (3, 4)\}$.

    By definition, a set of pairs is an admissible inflection set if it is the inflection set of some permutation in some symmetric group $S_n$. We supply the candidate witness $n = 5$ and the permutation $\sigma = (2\; 3) \in S_5$, which transposes $2$ and $3$ while fixing $0, 1,$ and $4$.

    line 4

    uses Equiv.swap

      use 5, Equiv.swap (2 : Fin 5) (3 : Fin 5)
  2. The inflection set of $(2\; 3) \in S_5$ is exactly $\{(2, 3), (3, 4)\}$. automation

    This finite equality is verified by evaluating the discrete second derivative $\sigma(\ell) + \sigma(\ell - 2) - 2\sigma(\ell - 1)$ for $\ell \in \{2, 3, 4\}$, which evaluates to $1, -3, 3$ respectively. The product of consecutive values is negative across $(2, 3)$ and $(3, 4)$, and no intermediate values exist, so the decision procedure `decide` closes the goal by exhaustive computation.

    line 5

      decide
Equiv.swap
the permutation that swaps two elements and leaves all other elements fixed

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

/-- The minimal two-element inflection set {(2, 3), (3, 4)} is admissible, witnessed by swap 2 3 in Sym 5. -/theorem op_686_two_three_three_four_admissible :    is_admissible_inflection_set {(2, 3), (3, 4)} := by  use 5, Equiv.swap (2 : Fin 5) (3 : Fin 5)  decide
See it in the graphDiscuss this resultChallenge it