AFTD Auto-Formalizing Theoretical Domains

is_perm_cover

def

For a natural number k and a finite set C of natural numbers, is_perm_cover k C holds if every d in C is strictly positive (0 < d), and for every permutation σ of Fin k, there exists d in C such that the order of σ divides d.

Statement

def is_perm_cover (k : ℕ) (C : Finset ℕ) : Prop
Defined in
arXiv:2610.11098, Definition 3.2
Verified
25 Oct 2026
Axioms
none listed
Used by 3

Read back from the Lean

A definition stating that a finite set of natural numbers C is a permutation cover for a natural number k if and only if: 1. Every element d ∈ C is strictly positive (0 < d), and 2. For every permutation σ of Fin k (i.e., σ : Equiv.Perm (Fin k)), there exists an element d ∈ C such that the order of σ divides d.

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

/-- A finite set C of natural numbers covers the element orders of Equiv.Perm (Fin k) if all elements are positive and every order divides some d ∈ C. -/
def is_perm_cover (k : ℕ) (C : Finset ℕ) : Prop := (∀ d ∈ C, 0 < d) ∧ ∀ σ : Equiv.Perm (Fin k), ∃ d ∈ C, orderOf σ ∣ d
See it in the graphDiscuss this resultChallenge it