Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Root probability extension

Proved
DerivativeChainPhaseLock.root_probability_extension

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

covariancederivative-chainsfinite-history-lawsprefix-laws

For each natural number kkk, write Ik={0,…,k−1}I_k=\{0,\ldots,k-1\}Ik​={0,…,k−1}, with I0=∅I_0=\varnothingI0​=∅. Let n∈Nn\in \mathbb Nn∈N, a ⁣:(I(n+2)⟶C)a\colon \bigl(I_{\left(n + 2\right)}\longrightarrow \mathbb C\bigr)a:(I(n+2)​⟶C), b ⁣:(I(n+1)⟶C)b\colon \bigl(I_{\left(n + 1\right)}\longrightarrow \mathbb C\bigr)b:(I(n+1)​⟶C), u∈Cu\in \mathbb Cu∈C, κ∈Typeκ\in \mathsf{Type}κ∈Type, inst._@.RootProbabilityExtension.3941136416._hygCtx._hyg.33∈Fintype⁡ ⁣(κ)\mathit{inst.\_@.RootProbabilityExtension.3941136416.\_hygCtx.\_hyg.33}\in \operatorname{Fintype}\!\left(κ\right)inst._@.RootProbabilityExtension.3941136416._hygCtx._hyg.33∈Fintype(κ), L∈FiniteBalancedHistoryLaw⁡ ⁣(b,u,κ)L\in \operatorname{FiniteBalancedHistoryLaw}\!\left(b, u, κ\right)L∈FiniteBalancedHistoryLaw(b,u,κ). Assume

(D ⁣(fromRoots⁡ ⁣(a))=(C⁡ ⁣((n+2)) fromRoots⁡ ⁣(b)))\begin{aligned} &\left(\mathrm D\!\left(\operatorname{fromRoots}\!\left(a\right)\right) = \left(\operatorname{C}\!\left(\left(n + 2\right)\right) \, \operatorname{fromRoots}\!\left(b\right)\right)\right) \end{aligned}​(D(fromRoots(a))=(C((n+2))fromRoots(b)))​

Then

∃M∈FiniteBalancedHistoryLaw⁡ ⁣(a,u,Prod⁡ ⁣(κ,Subtype⁡ ⁣((x∈C⟼(x∈toFinset⁡ ⁣(roots⁡ ⁣(fromRoots⁡ ⁣(a)))))))),(∀ij∈Prod⁡ ⁣(κ,Subtype⁡ ⁣((x1∈C⟼(x1∈toFinset⁡ ⁣(roots⁡ ⁣(fromRoots⁡ ⁣(a))))))),(weights⁡ ⁣(M,ij)=(weights⁡ ⁣(L,fst⁡ ⁣(ij)) rootKernel⁡ ⁣(a,L,fst⁡ ⁣(ij),snd⁡ ⁣(ij))))∧(∀ij1∈Prod⁡ ⁣(κ,Subtype⁡ ⁣((x2∈C⟼(x2∈toFinset⁡ ⁣(roots⁡ ⁣(fromRoots⁡ ⁣(a))))))),(paths⁡ ⁣(M,ij1)=snoc⁡ ⁣(paths⁡ ⁣(L,fst⁡ ⁣(ij1)),snd⁡ ⁣(ij1)))∧((endpointVariance⁡ ⁣(M)=parentVariance⁡ ⁣(a,L,rootKernel⁡ ⁣(a,L)))∧((edgeSquareEnergy⁡ ⁣(a,L,rootKernel⁡ ⁣(a,L))=(endpointVariance⁡ ⁣(M)−endpointVariance⁡ ⁣(L)))∧(meanSquareCost⁡ ⁣(M)≤(meanSquareCost⁡ ⁣(L)+(endpointVariance⁡ ⁣(M)−endpointVariance⁡ ⁣(L))))))))\exists M\in \operatorname{FiniteBalancedHistoryLaw}\!\left(a, u, \operatorname{Prod}\!\left(κ, \operatorname{Subtype}\!\left(\bigl(x\in \mathbb C\longmapsto \left(x\in \operatorname{toFinset}\!\left(\operatorname{roots}\!\left(\operatorname{fromRoots}\!\left(a\right)\right)\right)\right)\bigr)\right)\right)\right),\quad \left(\forall \mathit{ij}\in \operatorname{Prod}\!\left(κ, \operatorname{Subtype}\!\left(\bigl(x_{1}\in \mathbb C\longmapsto \left(x_{1}\in \operatorname{toFinset}\!\left(\operatorname{roots}\!\left(\operatorname{fromRoots}\!\left(a\right)\right)\right)\right)\bigr)\right)\right),\quad \left(\operatorname{weights}\!\left(M, \mathit{ij}\right) = \left(\operatorname{weights}\!\left(L, \operatorname{fst}\!\left(\mathit{ij}\right)\right) \, \operatorname{rootKernel}\!\left(a, L, \operatorname{fst}\!\left(\mathit{ij}\right), \operatorname{snd}\!\left(\mathit{ij}\right)\right)\right)\right) \land \left(\forall \mathit{ij}_{1}\in \operatorname{Prod}\!\left(κ, \operatorname{Subtype}\!\left(\bigl(x_{2}\in \mathbb C\longmapsto \left(x_{2}\in \operatorname{toFinset}\!\left(\operatorname{roots}\!\left(\operatorname{fromRoots}\!\left(a\right)\right)\right)\right)\bigr)\right)\right),\quad \left(\operatorname{paths}\!\left(M, \mathit{ij}_{1}\right) = \operatorname{snoc}\!\left(\operatorname{paths}\!\left(L, \operatorname{fst}\!\left(\mathit{ij}_{1}\right)\right), \operatorname{snd}\!\left(\mathit{ij}_{1}\right)\right)\right) \land \left(\left(\operatorname{endpointVariance}\!\left(M\right) = \operatorname{parentVariance}\!\left(a, L, \operatorname{rootKernel}\!\left(a, L\right)\right)\right) \land \left(\left(\operatorname{edgeSquareEnergy}\!\left(a, L, \operatorname{rootKernel}\!\left(a, L\right)\right) = \left(\operatorname{endpointVariance}\!\left(M\right) - \operatorname{endpointVariance}\!\left(L\right)\right)\right) \land \left(\sqrt{\operatorname{meanSquareCost}\!\left(M\right)} \le \left(\sqrt{\operatorname{meanSquareCost}\!\left(L\right)} + \sqrt{\left(\operatorname{endpointVariance}\!\left(M\right) - \operatorname{endpointVariance}\!\left(L\right)\right)}\right)\right)\right)\right)\right)\right)∃M∈FiniteBalancedHistoryLaw(a,u,Prod(κ,Subtype((x∈C⟼(x∈toFinset(roots(fromRoots(a)))))))),(∀ij∈Prod(κ,Subtype((x1​∈C⟼(x1​∈toFinset(roots(fromRoots(a))))))),(weights(M,ij)=(weights(L,fst(ij))rootKernel(a,L,fst(ij),snd(ij))))∧(∀ij1​∈Prod(κ,Subtype((x2​∈C⟼(x2​∈toFinset(roots(fromRoots(a))))))),(paths(M,ij1​)=snoc(paths(L,fst(ij1​)),snd(ij1​)))∧((endpointVariance(M)=parentVariance(a,L,rootKernel(a,L)))∧((edgeSquareEnergy(a,L,rootKernel(a,L))=(endpointVariance(M)−endpointVariance(L)))∧(meanSquareCost(M)​≤(meanSquareCost(L)​+(endpointVariance(M)−endpointVariance(L))​))))))

The named functions DerivativeChainFiniteHistory.FiniteBalancedHistoryLaw, DerivativeChainFiniteHistory.FiniteBalancedHistoryLaw.endpointVariance, DerivativeChainFiniteHistory.FiniteBalancedHistoryLaw.meanSquareCost, DerivativeChainFiniteHistory.FiniteBalancedHistoryLaw.paths, DerivativeChainFiniteHistory.FiniteBalancedHistoryLaw.weights, DerivativeChainPhaseLock.edgeSquareEnergy, DerivativeChainPhaseLock.parentVariance, DerivativeChainPhaseLock.rootKernel, DerivativeChainPrivate.fromRoots retain their exact imported definitions. Use the actual Gauss–Lucas root-probability kernel, including its shared-root branch, to instantiate the retained-prefix extension.

Formalization Note. Natural-number subtraction is truncated. Named functions, index embeddings and field projections use their exact imported definitions.

Preamble
import Mathlib
import Definitions.Def_DerivativeChainAnalytic_BarycentricExtension
import Definitions.Def_DerivativeChainAnalytic_BarycentricMoments
import Definitions.Def_DerivativeChainAnalytic_FiniteBalancedHistoryLaw
import Definitions.Def_DerivativeChainAnalytic_RootProbabilityExtension
import Definitions.Def_DerivativeChainPrivate_foundations
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 1500000
open scoped BigOperators
open Polynomial DerivativeChainPrivate DerivativeChainFiniteHistory
universe v
open DerivativeChainPhaseLock






Formal statement
theorem DerivativeChainPhaseLock.root_probability_extension {n : ℕ} (a : Fin (n+2) → ℂ) (b : Fin (n+1) → ℂ)
    (u : ℂ) {κ : Type v} [Fintype κ]
    (hderiv : (fromRoots a).derivative=C (n+2:ℂ)*fromRoots b)
    (L : FiniteBalancedHistoryLaw b u κ) :
    ∃ M : FiniteBalancedHistoryLaw a u (κ × (fromRoots a).roots.toFinset),
      (∀ ij,M.weights ij=L.weights ij.1*rootKernel a L ij.1 ij.2) ∧
      (∀ ij,M.paths ij=Fin.snoc (L.paths ij.1) (ij.2:ℂ)) ∧
      M.endpointVariance=parentVariance a L (rootKernel a L) ∧
      edgeSquareEnergy a L (rootKernel a L)=M.endpointVariance-L.endpointVariance ∧
      Real.sqrt M.meanSquareCost ≤ Real.sqrt L.meanSquareCost+
        Real.sqrt (M.endpointVariance-L.endpointVariance) := by sorry
Source
New frozen formal source /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/phase_lock/RootProbabilityExtension.lean, lines 26-49, SHA-256 92d0de0dd5da52595a16d6e296fec96efcd94ba9db1b78bac107940cc7800634. 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.

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