Mean block count for genuine finite set partitions
ProvedAnalyticCombinatorics.Ch2.SetPartitions.expected_blocks_eqanalytic-combinatoricsbell-momentslean4symbolic-method
Let be the finite set of set partitions of , let be the number of blocks, and define . These are the source cardinality-defined Bell numbers. For every with ,
The averages are rational. The positivity premise is retained, and no identification with the separately defined Bell EGF class is assumed.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch2_SetPartitions_BellMean import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Bell numbers as finite set partitions This file uses `Finpartition (Finset.univ : Finset (Fin n))` as the type of genuine set partitions of `[n]`. -/ open AnalyticCombinatorics AnalyticCombinatorics.Ch2 AnalyticCombinatorics.Ch2.SetPartitions open Finset Function -- The equivalences below transport `Finpartition`s through finset/subtype complements; -- the larger heartbeat budget is for those local `simp`/`grind` calls. set_option maxHeartbeats 400000
Formal statement
theorem AnalyticCombinatorics.Ch2.SetPartitions.expected_blocks_eq (n : ℕ) (hB : 0 < bellNumber n) :
(∑ P : Finpartition (Finset.univ : Finset (Fin n)), (P.parts.card : ℚ)) / bellNumber n
= bellNumber (n + 1) / bellNumber n - 1 := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).