h(D) preserves PF polynomials of degree at most N exactly when h(D) X^N is PFMain resultRealRooted original
theorem PreservesPFUpTo.iff_finiteDifferentialTest
(N : ℕ) (h : ℝ[X]) :
PreservesPFUpTo N h ↔ IsPFPolynomial (finiteDifferentialTest N h)
The finite free additive convolution with the test is the differential operatorRealRooted original
theorem finiteFreeAdditiveConvolution_finiteDifferentialTest
(N : ℕ) (h p : ℝ[X]) (hpdeg : p.natDegree ≤ N) :
finiteFreeAdditiveConvolution N (finiteDifferentialTest N h) p =
applyAsDifferentialOperator h p
Ordered PF images through degree N are detected by the two degree-N testsRealRooted original
theorem _root_.RealRooted.PreservesOrderedPFUpTo.iff_differentialTests
(N : ℕ) (h k : ℝ[X]) :
PreservesOrderedPFUpTo N h k ↔
IsPFPolynomial (finiteDifferentialTest N h) ∧
IsPFPolynomial (finiteDifferentialTest N k) ∧
Interl (finiteDifferentialTest N h) (finiteDifferentialTest N k)
The same criterion through the reversed (Jensen) testsRealRooted original
theorem _root_.RealRooted.PreservesOrderedPFUpTo.iff_jensenDifferentialTests
(N : ℕ) (h k : ℝ[X]) :
PreservesOrderedPFUpTo N h k ↔
IsPFPolynomial (jensenDifferentialTest N h) ∧
IsPFPolynomial (jensenDifferentialTest N k) ∧
Interl (jensenDifferentialTest N k)
(jensenDifferentialTest N h)
Binomial symbols with Jensen tests (sX + 1)^r, (sX + 1)^(r-1): ordered PF imagesRealRooted original
theorem _root_.RealRooted.PreservesOrderedPFUpTo.binomialDifferentialSymbol
{N r : ℕ} {s : ℝ} (hr : r ≠ 0) (hrN : r ≤ N) (hs : 0 ≤ s) :
PreservesOrderedPFUpTo N (binomialDifferentialSymbol N r s)
(binomialDifferentialSymbol N (r - 1) s)
A binomial differential recurrence row is PF and preceded by the leading imageRealRooted original
theorem binomialDifferentialRecurrence_pf_and_interl
{N r : ℕ} {s a : ℝ} (hr : r ≠ 0) (hrN : r ≤ N)
(hs : 0 ≤ s) (ha : 0 ≤ a) {p : ℝ[X]}
(hp : IsPFPolynomial p) (hpdeg : p.natDegree ≤ N) :
IsPFPolynomial
(X * applyAsDifferentialOperator
(binomialDifferentialSymbol N r s) p +
C a * applyAsDifferentialOperator
(binomialDifferentialSymbol N (r - 1) s) p) ∧
Interl
(applyAsDifferentialOperator (binomialDifferentialSymbol N r s) p)
(X * applyAsDifferentialOperator
(binomialDifferentialSymbol N r s) p +
C a * applyAsDifferentialOperator
(binomialDifferentialSymbol N (r - 1) s) p)
An ordered PF pair of images gives a PF row X h(D)p + a k(D)p preceded by h(D)pRealRooted original
theorem differentialRecurrence_pf_and_interl {h k p : ℝ[X]}
(hh : IsPFPolynomial (applyAsDifferentialOperator h p))
(hk : IsPFPolynomial (applyAsDifferentialOperator k p))
(horder : Interl (applyAsDifferentialOperator h p)
(applyAsDifferentialOperator k p)) {a : ℝ} (ha : 0 ≤ a) :
IsPFPolynomial
(X * applyAsDifferentialOperator h p +
C a * applyAsDifferentialOperator k p) ∧
Interl (applyAsDifferentialOperator h p)
(X * applyAsDifferentialOperator h p +
C a * applyAsDifferentialOperator k p)
Multishift recurrence rows are PF and preceded by the full-symbol imageRealRooted original
theorem multishiftDifferentialRecurrence_pf_and_interl
{N r : ℕ} {s a : Fin (r + 1) → ℝ}
(hrN : r + 1 ≤ N) (hs : ∀ i, 0 ≤ s i) (ha : ∀ i, 0 ≤ a i)
{p : ℝ[X]} (hp : IsPFPolynomial p) (hpdeg : p.natDegree ≤ N) :
IsPFPolynomial (multishiftDifferentialRecurrence N s a p) ∧
Interl
(applyAsDifferentialOperator (multishiftDifferentialSymbol N s) p)
(multishiftDifferentialRecurrence N s a p)
Induction along a multishift recurrence from a PF seedRealRooted original
theorem multishiftDifferentialRecurrence_induction
{m : ℕ} {P : ℕ → ℝ[X]} {r : ℕ → ℕ}
{s a : (n : ℕ) → Fin (r n + 1) → ℝ}
(hseed : IsPFPolynomial (P m)) (hseeddeg : (P m).natDegree ≤ m)
(hr : ∀ n, m ≤ n → r n + 1 ≤ n)
(hs : ∀ n i, 0 ≤ s n i) (ha : ∀ n i, 0 ≤ a n i)
(hrec : ∀ n, m ≤ n →
P (n + 1) = multishiftDifferentialRecurrence n (s n) (a n) (P n)) :
∀ n, m ≤ n → IsPFPolynomial (P n) ∧ (P n).natDegree ≤ n
For PF h ≠ 0: k is PF with k ≪ h iff k is a nonnegative sum of h and h/(x − u)RealRooted original
theorem isPFPolynomial_and_interl_iff_hasKreinCompanionExpansion
{h k : ℝ[X]} (hh : IsPFPolynomial h) (hh0 : h ≠ 0) :
IsPFPolynomial k ∧ Interl k h ↔ HasKreinCompanionExpansion h k
All-degree ordered PF preservation by (h, k) is equivalent to k being PF and k ≪ hRealRooted original
theorem forall_differential_images_iff_isPFPolynomial_and_interl
{h k : ℝ[X]} (hh : IsPFPolynomial h) (hh0 : h ≠ 0) :
(∀ p : ℝ[X], IsPFPolynomial p →
IsPFPolynomial (applyAsDifferentialOperator h p) ∧
IsPFPolynomial (applyAsDifferentialOperator k p) ∧
Interl (applyAsDifferentialOperator h p)
(applyAsDifferentialOperator k p)) ↔
IsPFPolynomial k ∧ Interl k h
Δ_c preserves PF through degree N iff Δ_c(xᴺ) is real-rooted iff p_N is real-rootedRealRooted original
theorem evenDerivative_preservesPF_tfae (hc0 : c 0 = 1) (hc : ∀ k, 0 ≤ c k) (N : ℕ) :
List.TFAE
[∀ f : ℝ[X], IsPFPolynomial f → f.natDegree ≤ N → IsPFPolynomial (evenDerivativeOperator c f),
(evenDerivativeOperator c (X ^ N)).Splits,
(evenDerivativeTest c N).Splits]
If p_N is real-rooted, Δ_c maps PF polynomials of degree at most N to PF polynomialsRealRooted original
theorem isPFPolynomial_evenDerivativeOperator (hc0 : c 0 = 1) (hc : ∀ k, 0 ≤ c k) {N : ℕ}
(htest : (evenDerivativeTest c N).Splits) {f : ℝ[X]} (hf : IsPFPolynomial f)
(hdeg : f.natDegree ≤ N) : IsPFPolynomial (evenDerivativeOperator c f)
If p_n is real-rooted, Δ_c ∏ (x + rᵢ) is real-rooted for rᵢ ≥ 0RealRooted original
theorem splits_evenDerivativeOperator_prod (hc : c 0 = 1) {n : ℕ}
(htest : (evenDerivativeTest c n).Splits) (r : Fin n → ℝ) (hr : ∀ i, 0 ≤ r i) :
(evenDerivativeOperator c (∏ i, (X + C (r i)))).Splits
The polarization of p_n is real stable (Grace–Walsh–Szegő)RealRooted original
theorem mvRealStable_evenDerivativePolarization (hc : c 0 = 1) {n : ℕ}
(h : (evenDerivativeTest c n).Splits) : MvRealStable (evenDerivativePolarization c n)
Composition with −z²: Δ_c(xᴺ)(−z²) = (−1)ᴺ zᴺ p_N(z)RealRooted original
theorem evenDerivativeOperator_X_pow_comp (N : ℕ) :
(evenDerivativeOperator c (X ^ N)).comp (-(X ^ 2)) =
C ((-1) ^ N) * X ^ N * evenDerivativeTest c N
If p_N is real-rooted, then p_n is real-rooted for all n ≤ NRealRooted original
theorem splits_evenDerivativeTest_of_le {n N : ℕ} (hn : n ≤ N)
(h : (evenDerivativeTest c N).Splits) : (evenDerivativeTest c n).Splits
Consecutive monomial images Δ_c(xᵐ) and Δ_c(xᵐ⁺¹) interlaceRealRooted original
theorem strictInterl_evenDerivativeOperator_X_pow_succ (hc0 : c 0 = 1) (hc : ∀ k, 0 ≤ c k)
{m N : ℕ} (hmN : m + 1 ≤ N) (htest : (evenDerivativeTest c N).Splits) :
StrictInterl (evenDerivativeOperator c (X ^ m)) (evenDerivativeOperator c (X ^ (m + 1)))
Δ_c preserves interlacing of nonnegative-coefficient pairs through degree NRealRooted original
theorem strictInterl_evenDerivativeOperator (hc0 : c 0 = 1) (hc : ∀ k, 0 ≤ c k) {N : ℕ}
(htest : (evenDerivativeTest c N).Splits) {f g : ℝ[X]} (hfg : StrictInterl f g)
(hf : HasNonnegCoeffs f) (hg : HasNonnegCoeffs g) (hgdeg : g.natDegree ≤ N) :
StrictInterl (evenDerivativeOperator c f) (evenDerivativeOperator c g)
Δ_c preserves zero-aware interlacing of PF pairs through degree NRealRooted original
theorem interl_evenDerivativeOperator (hc0 : c 0 = 1) (hc : ∀ k, 0 ≤ c k) {N : ℕ}
(htest : (evenDerivativeTest c N).Splits) {f g : ℝ[X]} (hf : IsPFPolynomial f)
(hg : IsPFPolynomial g) (hgdeg : g.natDegree ≤ N) (h : Interl f g) :
Interl (evenDerivativeOperator c f) (evenDerivativeOperator c g)
Δ_c((x + a) h) is real-rooted for PF h and every real aRealRooted original
theorem splits_evenDerivativeOperator_X_add_C_mul (hc0 : c 0 = 1) (hc : ∀ k, 0 ≤ c k) {N : ℕ}
(htest : (evenDerivativeTest c N).Splits) {h : ℝ[X]} (hh : IsPFPolynomial h) (a : ℝ)
(hdeg : h.natDegree + 1 ≤ N) : (evenDerivativeOperator c ((X + C a) * h)).Splits
Finitely supported c with a real-rooted signed symbol: p_N is real-rooted for every NRealRooted original
theorem splits_evenDerivativeTest_of_splits_symbol (hc0 : c 0 = 1) (hM : ∀ k, M < k → c k = 0)
(hs : (evenDerivativeSymbol c M).Splits) (N : ℕ) : (evenDerivativeTest c N).Splits
For c = (1, 1, 1, 0, …): Δ_c(x⁴) = x²(x² + 12x + 24)RealRooted original
theorem evenDerivativeOperator_capTwo_X_pow_four :
evenDerivativeOperator evenDerivativeCapTwo (X ^ 4) = X ^ 2 * (X ^ 2 + 12 * X + 24)
For c = (1, 1, 1, 0, …): Δ_c(x⁵) = x³(x² + 20x + 120)RealRooted original
theorem evenDerivativeOperator_capTwo_X_pow_five :
evenDerivativeOperator evenDerivativeCapTwo (X ^ 5) = X ^ 3 * (X ^ 2 + 20 * X + 120)
For c = (1, 1, 1, 0, …) the operator preserves PF polynomials through degree fourRealRooted original
theorem IsPFPolynomial.evenDerivativeCapTwo_of_natDegree_le_four {f : ℝ[X]}
(hf : IsPFPolynomial f) (hdeg : f.natDegree ≤ 4) :
IsPFPolynomial (evenDerivativeOperator evenDerivativeCapTwo f)
For c = (1, 1, 1, 0, …) Δ_c(x⁵) is not real-rooted: preservation fails in degree fiveRealRooted original
theorem not_splits_evenDerivativeOperator_capTwo_X_pow_five :
¬ (evenDerivativeOperator evenDerivativeCapTwo (X ^ 5)).Splits
For c = (1, 2, 1, 0, …), f + 2x f'' + x² f^(4) preserves PF polynomials in every degreeRealRooted original
theorem isPFPolynomial_evenDerivativeOperator_square {f : ℝ[X]} (hf : IsPFPolynomial f) :
IsPFPolynomial (evenDerivativeOperator evenDerivativeSquare f)
For c = (1, 2, 1, 0, …) the images of (x + 1)³ and (x + 1)⁴ interlaceRealRooted original
theorem strictInterl_evenDerivativeOperator_square_X_add_one_pow :
StrictInterl (X ^ 3 + 15 * X ^ 2 + 15 * X + 1)
(X ^ 4 + 28 * X ^ 3 + 78 * X ^ 2 + 28 * X + 1)