AFTD Auto-Formalizing Theoretical Domains

restricted_cycle_exact_support_count

def

The number of permutations of Fin n with set of distinct cycle lengths exactly P, including fixed points as cycles of length 1.

Statement

noncomputable def restricted_cycle_exact_support_count (n : ℕ) (P : Finset ℕ) : ℕ
Source
Helper for global_gcd_agreement_r_ge_four, OP-746, inbox IN-440. arXiv:2610.40342v1 Proposition 11.3(i) and Appendix A.5 give the support decomposition. No novelty claim; the uniform conjecture in Question 14.10 remains open.
Verified
01 Nov 2026
Axioms
none listed
Built on 1
  • restricted_cycle_length_supportThe finite set of distinct cycle lengths of a permutation of Fin n, defined by the cardinalities of its SameCycle equivalence classes.…
Used by 3

Lean source view module on GitHub

noncomputable def restricted_cycle_exact_support_count (n : ℕ) (P : Finset ℕ) : ℕ := by
  classical
  exact (Finset.univ.filter fun σ : Equiv.Perm (Fin n) => restricted_cycle_length_support n σ = P).card
See it in the graphDiscuss this resultChallenge it