AFTD Auto-Formalizing Theoretical Domains

is_vanishing_inflection_set

def

A finite set I : Finset (ℕ × ℕ) is a vanishing inflection set (is_vanishing_inflection_set I) if is_admissible_inflection_set I holds and the set {n : ℕ | ∃ σ : Equiv.Perm (Fin n), perm_inflection_set σ = I} is finite.

Statement

def is_vanishing_inflection_set (I : Finset (ℕ × ℕ)) : Prop
Defined in
arXiv:2610.38237, Definition 3.1
Verified
07 Nov 2026
Axioms
none listed
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

A finite set of pairs of natural numbers $I \subseteq \mathbb{N} \times \mathbb{N}$ is defined to be a "vanishing inflection set" if and only if both of the following hold: 1. $I$ is an admissible inflection set; that is, there exist a natural number $n$ and a permutation $\sigma$ of $\mathrm{Fin}(n)$ such that the inflection set of $\sigma$ equals $I$. 2. The set of all natural numbers $n$ such that there exists a permutation $\sigma$ of $\mathrm{Fin}(n)$ whose inflection set is $I$ is finite (in other words, the set of lengths of permutations realizing $I$ as their inflection set is nonempty and finite).

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 an admissible inflection set has witnesses in Sym_n for only finitely many n. -/
def is_vanishing_inflection_set (I : Finset (ℕ × ℕ)) : Prop := is_admissible_inflection_set I ∧
  {n : ℕ | ∃ σ : Equiv.Perm (Fin n), perm_inflection_set σ = I}.Finite
See it in the graphDiscuss this resultChallenge it