Root probability extension
ProvedDerivativeChainPhaseLock.root_probability_extensionFor each natural number , write , with . Let , , , , , , . Assume
Then
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.
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
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