Arr
abbrev
The set of arrangement arrays of order $m$ is represented as the type of functions from $\mathrm{Fin}\,m$ to $\mathrm{Fin}\,m$.
Statement
abbrev Arr (m : ℕ) : Type
- 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
- Used by 5
- rearrangement_operator_comp_applyFor any array $A$ of order $m$, index $i \in \mathrm{Fin}\,m$, and permutations $P, Q \in \mathrm{Equiv.Perm}(\mathrm{Fin}\,m)$, applying…
- identity_arrayThe identity array of order $m$ is the identity function on $\mathrm{Fin}\,m$.
- rearrangement_operator_anti_homomorphismUnder the source-index convention where the rearrangement operator $\widehat{P}$ acts on an array…
- rearrangement_operator_applyUnder the source-index convention, the entry at index $i$ of the rearranged array $\widehat{P}(A)$ equals $A(P(i))$ for any permutation…
- rearrangement_operatorFor a permutation $P \in \mathrm{Equiv.Perm}(\mathrm{Fin}\,m)$, the rearrangement operator $\widehat{P}$ acts on an array…
Read back from the Lean
Arr m is defined for any natural number m as the type of functions from Fin m to Fin m (endofunctions on the finite set of m elements $\{0, 1, \dots, m - 1\}$).
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 type of arrangement arrays of order m, represented as functions from Fin m to Fin m. -/ abbrev Arr (m : ℕ) : Type := Fin m → Fin m