AFTD Auto-Formalizing Theoretical Domains

is_admissible_inflection_set

def

A finite set I : Finset (ℕ × ℕ) is an admissible inflection set (is_admissible_inflection_set I) if there exist n : ℕ and a permutation σ : Equiv.Perm (Fin n) such that perm_inflection_set σ = I.

Statement

def is_admissible_inflection_set (I : Finset (ℕ × ℕ)) : Prop
Defined in
arXiv:2610.38237, Definition 3.1
Verified
07 Nov 2026
Axioms
none listed
Built on 1
  • perm_inflection_setFor a permutation σ : Equiv.Perm (Fin n), the inflection set perm_inflection_set σ : Finset (ℕ × ℕ) is the filter of pairs (m, p) in…
Used by 3
  • 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_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

A finite set of pairs of natural numbers $I$ is an admissible inflection set if and only if there exists a natural number $n$ and a permutation $\sigma$ of $\mathrm{Fin}(n)$ such that $I$ is the inflection set of $\sigma$ (perm_inflection_set σ).

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

/-- Predicate that a set of pairs is the inflection set of some permutation. -/
def is_admissible_inflection_set (I : Finset (ℕ × ℕ)) : Prop := ∃ (n : ℕ) (σ : Equiv.Perm (Fin n)), perm_inflection_set σ = I
See it in the graphDiscuss this resultChallenge it