AFTD Auto-Formalizing Theoretical Domains

identity_array

def

The identity array of order $m$ is the identity function on $\mathrm{Fin}\,m$.

Statement

def identity_array (m : ℕ) : Arr m
Defined in
arXiv:2611.05397, Section 2.2, Definition 1: Ranking and Unranking Permutations in Heap's Order
Verified
08 Nov 2026
Axioms
none listed
Built on 1
  • ArrThe set of arrangement arrays of order $m$ is represented as the type of functions from $\mathrm{Fin}\,m$ to $\mathrm{Fin}\,m$.

Read back from the Lean

For a given natural number $m$, identity_array m is defined to be the identity function on Fin m (as an element of Arr m).

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 identity array of order m. -/
def identity_array (m : ℕ) : Arr m := id
See it in the graphDiscuss this resultChallenge it