Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Source-scaled actual polynomial-tower prefix reserve

Proved
DerivativeChainClusterAnchor.source_tower_prefix_reserve

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

cluster-anchorsderivative-chainsfinal-cluster-bounds

For a uniform polynomial-root tower through row n and h≤n, some h-level prefix history z has length plus terminal distance to c at most h√(V_n/n)+√(hV_n/n+|r₀₀−c|²), where V_n is the uniform variance of row n about its degree-one root. Natural zero indices retain Lean’s total-division convention.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainAnalytic_ClusterPrefix
import Definitions.Def_DerivativeChainContinuation_ComplexHistories
import Definitions.Def_DerivativeChainContinuation_UniformRootTower
import Definitions.Def_DerivativeChainPrivate_foundations
set_option autoImplicit false
namespace DerivativeChain
end DerivativeChain
namespace DerivativeChainClusterAnchor
end DerivativeChainClusterAnchor
namespace DerivativeChainContinuation
end DerivativeChainContinuation
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 DerivativeChainPrefixLaws
open DerivativeChainClusterAnchor


Formal statement
theorem DerivativeChainClusterAnchor.source_tower_prefix_reserve (r : ComplexRootRows) (n h : ℕ)
    (hstep : ∀ k<n, UniformPolynomialStep r k) (hh : h ≤ n) (c : ℂ) :
    ∃ z : Fin (h+1) → ℂ, IsComplexRowHistory r z ∧
      chainCost z+‖z (Fin.last h)-c‖ ≤
        (h:ℝ)*Real.sqrt (rowCenteredVariance r n (r 0 0)/(n:ℝ))+
          Real.sqrt ((h:ℝ)*rowCenteredVariance r n (r 0 0)/(n:ℝ)+‖r 0 0-c‖^2) := by sorry
Source
Previously frozen formal source /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/cluster_anchor/ClusterBudget.lean, lines 12-39, SHA-256 1d385fca9cde10cc53f95d116f42a747aba58943a19a961bdad65fd4c05c926f. Supporting statement retained exactly from the verified archive.

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