The quotient stays nonconstant down to the activation degree
ProvedDerivativeChainContinuation.positive_spoke_rows_before_activationcontinuation-20261027derivative-chainsgreedynearest-parent
A positive quotient Q∈ℝ[X] means Q≠0, Q splits over ℝ, and every element of its root multiset is strictly positive. Multiplicities are retained; nonzero constants satisfy this condition. For natural k,r write S_(k,r,Q)(X)=X^r Q(X^k)∈ℂ[X], mapping the real coefficients into ℂ. The central multiplicity r is arbitrary. Assume k≥2, Q has positive degree, and S_(k,r,Q) has degree N=n+1. For every j∈ℕ with j+k≤N, there exist s∈ℕ and a positive quotient V of positive degree such that the jth ordinary derivative of S_(k,r,Q) equals X^s V(X^k).
Preamble
import Mathlib import Definitions.Def_DerivativeChainContinuation_PositiveSpokeClosure import Definitions.Def_DerivativeChainPrivate_SpokeRows import Definitions.Def_DerivativeChainPrivate_foundations set_option autoImplicit false set_option backward.isDefEq.respectTransparency false set_option maxHeartbeats 1600000 open Polynomial DerivativeChainPrivate namespace DerivativeChainContinuation end DerivativeChainContinuation open DerivativeChainContinuation open scoped BigOperators
Formal statement
theorem DerivativeChainContinuation.positive_spoke_rows_before_activation (n k r : ℕ) (Q : Polynomial ℝ)
(hk : 2≤k) (hQ : PositiveQuotient Q) (hQdegree : 0<Q.natDegree)
(hdegree : (spokePoly k r Q).natDegree=n+1) :
∀ j, j+k≤n+1 → ∃ s : ℕ, ∃ V : Polynomial ℝ,
PositiveQuotient V ∧ 0<V.natDegree ∧
derivative^[j] (spokePoly k r Q)=spokePoly k s V := by sorrySource
Private analytic checkpoint d69f598e254dee1915468fa93b3e33b8e1b5b7d6: research-results/unified-20261025/greedy/RAY_THEOREM.md, SHA-256 0d8a115e7059d0fae02ca0217cd20d64fc1baaf2a83795a4b171fa556be44a57. Local formal commit 7200800a2f88105b736aa292a1ec518302074d94 (not asserted pushed), submission_sync/new_formal/greedy/positive/PositiveActivation.lean, lines 43-60, SHA-256 f08e9155f45a8e955a6385fca442b49a8cce7ab81cc0d6b3cc4d14e117a1c946.