Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Iterated derivative expansion with repeated root slots

Proved
DerivativeChainClusterAnchor.iterate_derivative_slot_product

by labuka · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

cluster-anchorsderivative-chainsradial-prefix

Let S be a finite set of distinct slot indices, let a assign any complex value to each slot, and let k≤|S|. The k-th derivative of ∏ᵢ∈S(X−aᵢ) equals k! times the sum of ∏ᵢ∈T(X−aᵢ) over all subsets T⊆S of size |S|−k. Equal root values in different slots are permitted.

Preamble
import Mathlib
set_option autoImplicit false
namespace DerivativeChain
end DerivativeChain
namespace DerivativeChainClusterAnchor
end DerivativeChainClusterAnchor
namespace DerivativeChainContinuation
end DerivativeChainContinuation
namespace DerivativeChainExtremal
end DerivativeChainExtremal
namespace DerivativeChainPrefixLaws
end DerivativeChainPrefixLaws
namespace DerivativeChainPrivate
end DerivativeChainPrivate

set_option autoImplicit false
set_option maxHeartbeats 1000000
open scoped BigOperators
open Polynomial Finset
open DerivativeChainClusterAnchor


-- Slot indices retain coincident root values as separate factors.
-- The proof extends Mathlib's iterate_derivative_prod_X_sub_C to a noninjective root map.
Formal statement
theorem DerivativeChainClusterAnchor.iterate_derivative_slot_product {ι : Type} [DecidableEq ι]
    (a : ι → ℂ) {S : Finset ι} {k : ℕ} (hk : k ≤ S.card) :
    derivative^[k] (∏ i ∈ S, (X-C (a i))) =
      (k.factorial : ℂ[X]) * ∑ T ∈ S.powersetCard (S.card-k), ∏ i ∈ T, (X-C (a i)) := by sorry
Source
New frozen formal source /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/cluster_anchor/ClusterSubsetProduct.lean, lines 11-48, SHA-256 a6d05e4fa5d192091e249eddae712315f75cec01915ba331061f322bcc396ae6. The source manifest pins the author receipts and analytic provenance. This new code is not attributed to the older public checkpoint. Mathematical source checkpoint f6f9312a25cdfb1cc2c359eb04374ae01c451978: /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/platform/new_analytic/analytic_sources/cluster/source_provenance/PROOF.md, SHA-256 58372fc49757644245d40862747bcba5a45990d6e2d3140f51b913629a2090df; /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/platform/new_analytic/analytic_sources/cluster/source_provenance/RESULT.md, SHA-256 32d429f3fdcc4e6ef33dbd5eeaa34d57ae0e0befad59d01cc01bee0cc1a90b9c; /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/platform/new_analytic/analytic_sources/cluster/source_provenance/VERIFICATION.md, SHA-256 29d6e418d33b3a3eae2f5ac59bc979c87b90e4288066c4a24705670ed682386a.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me