Complex multiset power sums
DefinitionDerivativeChainAnalytic_OddMomentPersistencecluster-anchorsderivative-chainsfinal-cluster-bounds
Define the kth power sum of a complex multiset as the sum of z^k over its entries, retaining repeated occurrences.
Definition code
import Mathlib set_option autoImplicit false namespace DerivativeChain end DerivativeChain namespace DerivativeChainContinuation end DerivativeChainContinuation namespace DerivativeChainFiniteHistory end DerivativeChainFiniteHistory namespace DerivativeChainPhaseLock end DerivativeChainPhaseLock namespace DerivativeChainPrefixLaws end DerivativeChainPrefixLaws namespace DerivativeChainPrivate end DerivativeChainPrivate set_option autoImplicit false set_option backward.isDefEq.respectTransparency false set_option maxHeartbeats 2000000 open scoped BigOperators open Polynomial DerivativeChainContinuation namespace DerivativeChainPhaseLock noncomputable section def multisetPowerSum (s : Multiset ℂ) (k : ℕ) : ℂ := (s.map (fun z => z^k)).sum end end DerivativeChainPhaseLock
Source
New frozen formal source /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/phase_lock/OddMomentPersistence.lean, lines 11-11, SHA-256 3b7b01e44879ac3b5fb5fcf6d523efdc4b62c381aafef36ee87c79383098a604. The source manifest pins the author receipts and analytic provenance. This new code is not attributed to the older public checkpoint. Shared canonical history and prefix interfaces. The phase26 and prefix-core19 frozen author manifests supply exact proof receipts and source provenance; no extension or new global U is included.