Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Actual root-slot tower with source-scaled variance control

Proved
DerivativeChainPrefixLaws.source_uniform_variance_controlled_tower

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

cluster-anchorsderivative-chainsradial-prefix

For every list a of n+1 complex root slots, there is a uniform polynomial-root tower whose top row is exactly a and whose degree-one row is the source centroid. At every h≤n, its variance about that centroid is at most (h/n) times the source variance, with Lean’s total division at n=0.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainContinuation_CollinearTransport
import Definitions.Def_DerivativeChainContinuation_UniformRootTower
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 backward.isDefEq.respectTransparency false
set_option maxHeartbeats 1500000
open scoped BigOperators
open Polynomial DerivativeChainContinuation DerivativeChainPrivate
open DerivativeChainPrefixLaws






Formal statement
theorem DerivativeChainPrefixLaws.source_uniform_variance_controlled_tower (n : ℕ) (a : Fin (n+1) → ℂ) :
    ∃ r : ComplexRootRows, r n=a ∧ (∀ k<n, UniformPolynomialStep r k) ∧
      r 0 0=complexCentroid a ∧
      ∀ h≤n, (∑ j : Fin (h+1), (h+1:ℝ)⁻¹*‖r h j-complexCentroid a‖^2) ≤
        (h:ℝ)/(n:ℝ)*(∑ j : Fin (n+1), (n+1:ℝ)⁻¹*‖a j-complexCentroid a‖^2) := by sorry
Source
New frozen formal source /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/prefix_laws/RowVarianceAdapters.lean, lines 27-37, SHA-256 6b87d4c1da11fa2c9ccefccb13f22e2e861a44d071ac3464a6bbc9ff36817f3d. The source manifest pins the author receipts and analytic provenance. This new code is not attributed to the older public checkpoint. Shared variance prerequisite; the exact owner-frozen formal proof and compiler receipts are the source.

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