History law endpoint weights
ProvedDerivativeChainPrefixLaws.history_law_endpoint_weightsFor each natural number , write , with . Let , , , , , . Then
The named functions DerivativeChainContinuation.complexCentroid, DerivativeChainFiniteHistory.FiniteBalancedHistoryLaw, DerivativeChainFiniteHistory.FiniteBalancedHistoryLaw.endpointVariance, DerivativeChainFiniteHistory.FiniteBalancedHistoryLaw.meanSquareCost, DerivativeChainPrefixLaws.BalancedWeights, DerivativeChainPrefixLaws.rootLawSquareCost, DerivativeChainPrefixLaws.rootLawVariance retain their exact imported definitions. Combine weights of histories sharing an endpoint and compare their costs with the actual endpoint minima. This gives a balanced endpoint law with no larger square-cost budget.
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_FiniteBalancedHistoryLaw import Definitions.Def_DerivativeChainAnalytic_KappaDefinitions import Definitions.Def_DerivativeChainContinuation_CollinearTransport 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 DerivativeChainContinuation DerivativeChainPrivate DerivativeChainFiniteHistory universe v open DerivativeChainPrefixLaws
theorem DerivativeChainPrefixLaws.history_law_endpoint_weights {n : ℕ} {a : Fin (n+1) → ℂ} {u : ℂ}
{κ : Type v} [Fintype κ] (L : FiniteBalancedHistoryLaw a u κ) :
∃ W : Fin (n+1) → ℝ, BalancedWeights a (complexCentroid a) W ∧
rootLawVariance a W=L.endpointVariance ∧ rootLawSquareCost a W ≤ L.meanSquareCost := by sorry