The exact mean number of cyclic points is Ramanujan Q
ProvedAnalyticCombinatorics.Ch2.Mappings.CyclicPointsNS.expected_cyclicPoints_eq_qanalytic-combinatoricslean4mappingssymbolic-method
Let be all functions from to itself. A point is periodic if for some integer . Define in the real numbers. Write . For ,
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch2_Mappings_RamanujanQ import Definitions.Def_AnalyticCombinatorics_Ch2_Mappings_ConnectedMappings import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Cyclic points in random mappings This file counts mappings for which a fixed point is cyclic and derives the expected number of cyclic points from Ramanujan's finite `Q`-function. -/ open Filter Asymptotics open scoped BigOperators Topology open AnalyticCombinatorics AnalyticCombinatorics.Ch2 AnalyticCombinatorics.Ch2.Mappings open AnalyticCombinatorics.Ch2.Mappings.ConnectedMappingsNS
Formal statement
theorem AnalyticCombinatorics.Ch2.Mappings.CyclicPointsNS.expected_cyclicPoints_eq_q {n : ℕ} (hn : 0 < n) :
(∑ f : Fin n → Fin n, ((periodicPointsFinset f).card : ℝ)) / (n : ℝ)^n =
AnalyticCombinatorics.Ch2.Mappings.RamanujanQNS.ramanujanQ n := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).