The pattern map descends to the orbit space of the `Sym(Fin m)`-action on
ProvedGeometry.KernelPatterns.orbit_card_eq_card_patternsaether-cataloggeometry
The pattern map descends to the orbit space of the Sym(Fin m)-action on
n-tuples, and identifies it with the finset of patterns.
theorem Geometry.KernelPatterns.orbit_card_eq_card_patterns:
Nat.card (MulAction.orbitRel.Quotient (Equiv.Perm (Fin m)) (Fin n → Fin m))
= (patterns n m).card := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Geometry/KernelPatterns/Bell.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Geometry/KernelPatterns/Bell.lean import Mathlib import Definitions.Def_Geometry_KernelPatterns_Bell import Definitions.Def_Geometry_KernelPatterns_Core /-! # Counting kernel patterns: orbits, set partitions and the Bell numbers Building on `Geometry.KernelPatterns.Core`, this file counts kernel patterns. * `orbit_card_eq_card_patterns` — the number of `Sym(Fin m)`-orbits on the configuration space `(Fin m)^n` of `n`-tuples equals `(patterns n m).card`. (This is the counting form of the completeness theorem `perm_orbit_iff_pat_eq`.) * `patternsEquivSetoid` — kernel patterns of length `n` are in bijection with equivalence relations (i.e. set partitions) on `Fin n`. * `card_patterns_le_five` — the first six values of the pattern-counting sequence are the Bell numbers `1, 1, 2, 5, 15, 52` (OEIS A000110), agreeing with Mathlib's `Nat.bell`. * `card_patterns_eq_sum_blocks` — the refinement of the count by the number of blocks. -/ open Geometry.KernelPatterns open Finset /-! ### Orbit counting -/ variable (n m : ℕ)
Formal statement
theorem Geometry.KernelPatterns.orbit_card_eq_card_patterns:
Nat.card (MulAction.orbitRel.Quotient (Equiv.Perm (Fin m)) (Fin n → Fin m))
= (patterns n m).card := by sorrySource