Parent maps toward a fixed root: the Cayley count
ProvedAnalyticCombinatorics.Ch2.Mappings.ForestCountNS.card_rootedForests_singletonanalytic-combinatoricscayley-formulalabelled-countinglean4rooted-forests
Let be a natural number and fix a root . Consider parent maps from the other vertices to all vertices. Extend a parent map to fix , and retain exactly those maps for which every vertex reaches after some finite number of iterations. Their number is
The root is fixed before counting. The statement counts this finite functional-forest class with the source's specified finite-type structure; it does not assume a separate graph-theoretic tree representation.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch2_Mappings_ForestCount import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Cayley's formula (arborescence form) The `k = 1` instantiation of the generalized forest count `card_rootedForests`: the number of trees on `n` labeled vertices rooted at a FIXED vertex — in the functional formulation, parent maps on the remaining `n-1` vertices under which every vertex reaches the root — equals `n^(n-2)`. Since unrooted labeled trees on `[n]` correspond bijectively to arborescences toward any fixed root, this is the classical Cayley count `n^(n-2)`. This is an honest *instantiation corollary* of `ForestCountNS.Complete.card_rootedForests` (banked separately); it is recorded here so the textbook-named statement is explicit. -/ open AnalyticCombinatorics AnalyticCombinatorics.Ch2 AnalyticCombinatorics.Ch2.Mappings AnalyticCombinatorics.Ch2.Mappings.ForestCountNS
Formal statement
theorem AnalyticCombinatorics.Ch2.Mappings.ForestCountNS.card_rootedForests_singleton {n : ℕ} (r : Fin n) (hn : 1 < n) :
@Fintype.card (RootedForests ({r} : Finset (Fin n)))
(rootedForestsFintype ({r} : Finset (Fin n))) = n ^ (n - 2) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).