Positive real powers: negative roots, exact degree and consecutive interlacingRealRooted original
theorem affineNegativePowerCoeff_factor_properties
{ι ν : Type*} (s : Finset ι) (hs : s.Nonempty) (α : ι → ℝ)
(hα : ∀ i ∈ s, 0 < α i) (t : Finset ν) (β : ν → ℝ)
(hβ : ∀ j ∈ t, 0 ≤ β j) {c κ : ℝ} (hc : 0 < c) (hκ : 0 < κ)
(r : ℕ) (hr : r ≠ 0) (n : ℕ) :
let Q : Polynomial ℝ
Logarithmic rows: negative roots, exact degree and consecutive interlacingRealRooted original
theorem affineLogCoeff_factor_properties
{ι ν : Type*} (s : Finset ι) (hs : s.Nonempty) (α : ι → ℝ)
(hα : ∀ i ∈ s, 0 < α i) (t : Finset ν) (β : ν → ℝ)
(hβ : ∀ j ∈ t, 0 ≤ β j) {c : ℝ} (hc : 0 < c)
(r : ℕ) (hr : r ≠ 0) (n : ℕ) (hn : n ≠ 0) :
let Q : Polynomial ℝ
For r = 1 and positive [u²]Q or [u²]B: simple roots, no common roots in consecutive rowsRealRooted original
theorem affineNegativePowerCoeff_factor_simple_and_disjoint
{ι ν : Type*} (s : Finset ι) (hs : s.Nonempty) (α : ι → ℝ)
(hα : ∀ i ∈ s, 0 < α i) (t : Finset ν) (β : ν → ℝ)
(hβ : ∀ j ∈ t, 0 ≤ β j) {c κ : ℝ} (hc : 0 < c) (hκ : 0 < κ) (n : ℕ) :
let Q : ℝ[X]
Consecutive chain polynomials interlaceMain resultRealRooted original
theorem interl_chainPolynomial_succ_of_isTotallyNonneg
(hunit : LowerTriangularMatrix.IsLowerUnitriangular R)
(hR : Matrix.IsTotallyNonneg R) (n : ℕ) :
Interl (chainPolynomial R n) (chainPolynomial R (n + 1))
Chain polynomials are real-rootedRealRooted original
theorem chainPolynomial_eq_zero_or_splits_of_isTotallyNonneg
(hunit : LowerTriangularMatrix.IsLowerUnitriangular R)
(hR : Matrix.IsTotallyNonneg R) (n : ℕ) :
chainPolynomial R n = 0 ∨ (chainPolynomial R n).Splits
Zeros of chain polynomials lie in [-1, 0]RealRooted original
theorem roots_chainPolynomial_mem_Icc_of_isTotallyNonneg
(hunit : LowerTriangularMatrix.IsLowerUnitriangular R)
(hR : Matrix.IsTotallyNonneg R) (n : ℕ) :
∀ x ∈ (chainPolynomial R n).roots, x ∈ Set.Icc (-1) 0
Chain polynomials have nonnegative coefficientsRealRooted original
theorem chainPolynomial_hasNonnegCoeffs_of_isTotallyNonneg
(hunit : LowerTriangularMatrix.IsLowerUnitriangular R)
(hR : Matrix.IsTotallyNonneg R) (n : ℕ) :
HasNonnegCoeffs (chainPolynomial R n)
Resolvable if and only if totally nonnegativeRealRooted original
theorem isResolvable_iff_lowerUnitriangular_and_isTotallyNonneg
{R : LowerTriangularMatrix ℝ} :
IsResolvable R ↔
LowerTriangularMatrix.IsLowerUnitriangular R ∧
Matrix.IsTotallyNonneg R
Chain polynomials with positive constant diagonal are PFRealRooted original
theorem chainPolynomial_isPFPolynomial_of_pos_constantDiagonal
{δ : ℝ} {A : LowerTriangularMatrix ℝ} (hδ : 0 < δ)
(hlower : LowerTriangularMatrix.IsLowerTriangular A)
(hdiag : ∀ n, A n n = δ) (hA : Matrix.IsTotallyNonneg A) (n : ℕ) :
IsPFPolynomial (chainPolynomial A n)
Rows of 1 / (1 - x h(z)) with h(0) = 0 are PF and interlaceRealRooted original
theorem compositionRows_isPFPolynomial_and_interl_of_zero
{f : ℕ → ℝ} (hf : IsPolyaFreqSeq f) (hf0 : f 0 = 0) :
(∀ n, IsPFPolynomial (compositionRow (PowerSeries.mk f) n)) ∧
∀ n, Interl (compositionRow (PowerSeries.mk f) n)
(compositionRow (PowerSeries.mk f) (n + 1))
Rows of g / (1 - x g h) are PF and interlaceRealRooted original
theorem twoKernelRows_pf_and_interl
{g h : ℕ → ℝ} (hg : IsPolyaFreqSeq g) (hh : IsPolyaFreqSeq h)
(hg0 : 0 < g 0) (hh0 : h 0 = 0) :
(∀ n, IsPFPolynomial
(twoKernelRow (PowerSeries.mk g) (PowerSeries.mk h) n)) ∧
∀ n, Interl
(twoKernelRow (PowerSeries.mk g) (PowerSeries.mk h) n)
(twoKernelRow (PowerSeries.mk g) (PowerSeries.mk h) (n + 1))
Rows of 1 / (1 - x z (1+z)^d) are PF and interlaceRealRooted original
theorem binomialCompositionRows_pf_and_interl (d : ℕ) :
(∀ n, IsPFPolynomial
(compositionRow (PowerSeries.mk (binomialCompositionKernel d)) n)) ∧
∀ n, Interl
(compositionRow (PowerSeries.mk (binomialCompositionKernel d)) n)
(compositionRow
(PowerSeries.mk (binomialCompositionKernel d)) (n + 1))
Rows of 1 / (1 - x z / (1-z)^e) are PF and interlaceRealRooted original
theorem inversePowerCompositionRows_pf_and_interl (e : ℕ) :
(∀ n, IsPFPolynomial
(compositionRow
(PowerSeries.mk (inversePowerCompositionKernel e)) n)) ∧
∀ n, Interl
(compositionRow
(PowerSeries.mk (inversePowerCompositionKernel e)) n)
(compositionRow
(PowerSeries.mk (inversePowerCompositionKernel e)) (n + 1))
Every lower-unitriangular TNN matrix is a Whitney-elimination network path matrixRealRooted original
theorem networkMatrix_resolutionLambda_eq
(R : LowerTriangularMatrix ℝ)
(hunit : LowerTriangularMatrix.IsLowerUnitriangular R)
(hR : Matrix.IsTotallyNonneg R) :
networkMatrix (resolutionLambda R) = R
Tiling polynomials of weighted lower shifts are PFRealRooted original
theorem weightedShiftTilingRow_separated_isPFPolynomial
{b : ℕ → ℝ} (hb : ∀ n, 0 ≤ b n)
{alphas : List ℝ} (halphas : ∀ a ∈ alphas, 0 ≤ a)
{w : ℕ → ℝ} (hw : ∀ n, 0 ≤ w n)
(N : ℕ) {r : ℕ} (hr : r ≠ 0) (i : Fin (N + 1)) :
IsPFPolynomial
(weightedShiftTilingRow b (alphas.map fun a n => a * w n) N r i)
Weighted derivative kernels of real-rooted nonnegative polynomials are TNNRealRooted original
theorem weightedDerivativeKernel_isTotallyNonneg {F : ℝ[X]} (hF : F.Splits)
(hnn : HasNonnegCoeffs F) {κ : ℝ} (hκ : 0 ≤ κ) :
(weightedDerivativeKernel κ F.coeff).IsTotallyNonneg
Rows of a negative power are determinants of an affine pencil of weighted kernelsRealRooted original
theorem det_weightedDerivativeKernel_affineNegativePowerCoeff
(κ : R) (Q B : PowerSeries R) (hQ : constantCoeff Q = 1)
(hB : constantCoeff B = 0) (n : ℕ) :
Matrix.det
((((weightedDerivativeKernel κ (fun k => (-1 : R) ^ k * coeff k Q)).submatrix
Fin.val Fin.val : Matrix (Fin n) (Fin n) R).map Polynomial.C) +
(Polynomial.X : Polynomial R) • (Matrix.checkerboard
((weightedDerivativeKernel κ (fun k => coeff k B)).submatrix
Fin.val Fin.val : Matrix (Fin n) (Fin n) R)).map Polynomial.C) =
(n.factorial : Polynomial R) * affineNegativePowerCoeff κ Q B n
Determinants of signed weighted kernels are coefficients of negative powersRealRooted original
theorem det_weightedDerivativeKernel_subst_binomialSeries_neg
(κ : R) (H : PowerSeries R) (hH : constantCoeff H = 1) (n : ℕ) :
((weightedDerivativeKernel κ (fun k => (-1 : R) ^ k * coeff k H)).submatrix
Fin.val Fin.val : Matrix (Fin n) (Fin n) R).det =
(n.factorial : R) * coeff n (subst (H - 1) (binomialSeries R (-κ)))
Signed kernel determinants are positive for products of factors 1 - αu, α > 0RealRooted original
theorem det_weightedDerivativeKernel_signed_prod_linear_pos {ι : Type*}
(s : Finset ι) (hs : s.Nonempty) (α : ι → ℝ)
(hα : ∀ i ∈ s, 0 < α i) {κ : ℝ} (hκ : 0 < κ) (n : ℕ) :
((weightedDerivativeKernel κ
(fun k ↦ (-1 : ℝ) ^ k * coeff k
(∏ i ∈ s, (1 - C (α i) * X : PowerSeries ℝ)))).submatrix
Fin.val Fin.val : Matrix (Fin n) (Fin n) ℝ).det > 0
A finite coefficient recurrence for the rows of a negative powerRealRooted original
theorem coeff_affineNegativePowerCoeff_recurrence
(κ : ℝ) (Q B : PowerSeries ℝ)
(hQ : constantCoeff Q = 1) (hB : constantCoeff B = 0)
(n i : ℕ) :
(affineNegativePowerCoeff κ Q B (n + 1)).coeff i =
-((n + 1 : ℕ) : ℝ)⁻¹ *
∑ k ∈ Finset.range (n + 1),
((n - k : ℕ) + κ * (k + 1 : ℕ)) *
∑ j ∈ Finset.range (i + 1),
(Polynomial.C (coeff (k + 1) Q) -
Polynomial.X * Polynomial.C (coeff (k + 1) B)).coeff j *
(affineNegativePowerCoeff κ Q B (n - k)).coeff (i - j)
Rows have degree ⌊n/r⌋ and positive coefficients up to that degreeRealRooted original
theorem natDegree_affineNegativePowerCoeff_and_coeff_pos
(Q B : PowerSeries ℝ) (κ : ℝ) (r : ℕ)
(hQ : constantCoeff Q = 1) (hr : r ≠ 0) (hκ : 0 < κ)
(hB : ∀ n, 0 ≤ coeff n B)
(hBzero : ∀ n < r, coeff n B = 0) (hBpos : 0 < coeff r B)
(hQpos : ∀ (k n : ℕ), 0 < coeff n
(subst (Q - 1) (binomialSeries ℝ (-κ - (k : ℝ))))) (n : ℕ) :
(affineNegativePowerCoeff κ Q B n).natDegree = n / r ∧
∀ k ≤ n / r, 0 < (affineNegativePowerCoeff κ Q B n).coeff k
Consecutive negative-power rows interlace when the linear coefficient of B is positiveRealRooted original
theorem interlaces_affineNegativePowerCoeff_succ
{κ : ℝ} (hκ : 0 < κ) (Q B : ℝ[X])
(hQ : Q.coeff 0 = 1) (hB : B.coeff 0 = 0) (hB₁ : 0 < B.coeff 1)
(hQs : (Q.comp (-Polynomial.X)).Splits)
(hQnn : HasNonnegCoeffs (Q.comp (-Polynomial.X)))
(hBs : B.Splits) (hBnn : HasNonnegCoeffs B) (n : ℕ) :
Interlaces (affineNegativePowerCoeff κ (Q : PowerSeries ℝ) B n)
(affineNegativePowerCoeff κ (Q : PowerSeries ℝ) B (n + 1))
Consecutive rows interlace for every nonzero split numerator B with B(0) = 0RealRooted original
theorem interl_affineNegativePowerCoeff_prod_linear_succ
{ι : Type*} (s : Finset ι) (hs : s.Nonempty) (α : ι → ℝ)
(hα : ∀ i ∈ s, 0 < α i) {κ : ℝ} (hκ : 0 < κ)
(B : ℝ[X]) (hBne : B ≠ 0) (hB0 : B.coeff 0 = 0)
(hBs : B.Splits) (hBnn : HasNonnegCoeffs B) (n : ℕ) :
Interl (affineNegativePowerCoeff κ
((∏ i ∈ s, (1 - C (α i) * X) : ℝ[X]) : PowerSeries ℝ) B n)
(affineNegativePowerCoeff κ
((∏ i ∈ s, (1 - C (α i) * X) : ℝ[X]) : PowerSeries ℝ) B (n + 1))
Rows with product-of-linear-factor denominators are PF polynomialsRealRooted original
theorem isPFPolynomial_affineNegativePowerCoeff_prod_linear
{ι : Type*} (s : Finset ι) (hs : s.Nonempty) (α : ι → ℝ)
(hα : ∀ i ∈ s, 0 < α i) {κ : ℝ} (hκ : 0 < κ)
(B : ℝ[X]) (hB : B.coeff 0 = 0) (hBs : B.Splits)
(hBnn : HasNonnegCoeffs B) (n : ℕ) :
IsPFPolynomial (affineNegativePowerCoeff κ
((∏ i ∈ s, (1 - Polynomial.C (α i) * Polynomial.X) : ℝ[X]) : PowerSeries ℝ)
B n)
The logarithmic row is the limit of q_n / κ as κ tends to 0 from aboveRealRooted original
theorem tendsto_coeff_affineNegativePowerCoeff_div
(Q B : PowerSeries ℝ) (hQ : constantCoeff Q = 1) (hB : constantCoeff B = 0)
{n : ℕ} (hn : n ≠ 0) (k : ℕ) :
Tendsto (fun a : ℝ => (affineNegativePowerCoeff a Q B n).coeff k / a)
(𝓝[>] 0) (𝓝 ((affineLogCoeff Q B n).coeff k))
Explicit parameter coefficients of the logarithmic rowsRealRooted original
theorem coeff_affineLogCoeff_of_ne_zero
(Q B : PowerSeries ℝ) (hQ : constantCoeff Q = 1) (hB : constantCoeff B = 0)
{n k : ℕ} (hn : n ≠ 0) (hk : k ≠ 0) :
(affineLogCoeff Q B n).coeff k =
(1 / (k : ℝ)) * coeff n
(B ^ k * subst (Q - 1) (binomialSeries ℝ (-(k : ℝ))))
Logarithmic rows have exact degree ⌊n/r⌋ and positive coefficientsRealRooted original
theorem natDegree_affineLogCoeff_and_coeff_pos
(Q B : PowerSeries ℝ) (r : ℕ) (hQ : constantCoeff Q = 1) (hr : r ≠ 0)
(hB : ∀ n, 0 ≤ coeff n B) (hBzero : ∀ n < r, coeff n B = 0)
(hBpos : 0 < coeff r B)
(hQpos : ∀ (k : ℕ), k ≠ 0 → ∀ m, 0 < coeff m
(subst (Q - 1) (binomialSeries ℝ (-(k : ℝ)))))
{n : ℕ} (hn : n ≠ 0) (hzero : 0 < (affineLogCoeff Q B n).coeff 0) :
(affineLogCoeff Q B n).natDegree = n / r ∧
∀ k ≤ n / r, 0 < (affineLogCoeff Q B n).coeff k
Logarithmic rows are PF polynomials and consecutive rows interlaceRealRooted original
theorem affineLogCoeff_factor_pf_and_interl
{ι ν : Type*} (s : Finset ι) (hs : s.Nonempty) (α : ι → ℝ)
(hα : ∀ i ∈ s, 0 < α i) (t : Finset ν) (β : ν → ℝ)
(hβ : ∀ j ∈ t, 0 ≤ β j) {c : ℝ} (hc : 0 < c)
(r : ℕ) (hr : r ≠ 0) (n : ℕ) (hn : n ≠ 0) :
let Q : Polynomial ℝ
Rational rod rows are the exponent-one negative-power rowsRealRooted original
theorem rationalRodRow_eq_affineNegativePowerCoeff
(ys : List ℝ) (c : ℝ) {r : ℕ} (hr : r ≠ 0)
(xs : List ℝ) (n : ℕ) :
rationalRodRow ys c r xs n =
affineNegativePowerCoeff 1 (rationalBackgroundDenominator ys)
(markedFactorSeries c r xs) n
Numerators of two PF factors are PF polynomials and consecutive rows interlaceRealRooted original
theorem pfFactorNumerators_pf_and_interl
{g h : ℕ → ℝ} (hg : IsPolyaFreqSeq g) (hh : IsPolyaFreqSeq h) :
(∀ n, IsPFPolynomial (pfFactorNumerator g h n)) ∧
∀ n, Interl (pfFactorNumerator g h n)
(pfFactorNumerator g h (n + 1))
With g(0), h(0) > 0 the zeros lie in [-1/(g(0) h(0)), 0]RealRooted original
theorem roots_pfFactorNumerator_mem_Icc_of_pos
{g h : ℕ → ℝ} (hg : IsPolyaFreqSeq g) (hh : IsPolyaFreqSeq h)
(hg0 : 0 < g 0) (hh0 : 0 < h 0) (n : ℕ) :
∀ x ∈ (pfFactorNumerator g h n).roots,
x ∈ Set.Icc (-((g 0) * h 0)⁻¹) 0
PF-factor numerators are the regularized kernel rows of the finite Toeplitz factorsRealRooted original
theorem pfFactorNumerator_eq_regularizedKernelRow_fin
(g h : ℕ → ℝ) {N : ℕ} (i : Fin (N + 1)) :
pfFactorNumerator g h i.val =
regularizedKernelRow (finiteToeplitz g N) (finiteToeplitz h N) i
Delayed renewal rows are reciprocal shifts of PF-factor numerators in each residue classRealRooted original
theorem renewalPolynomial_eq_reciprocalShift_pfFactorNumerator
(R : ℝ[X]) {m r : ℕ} (hrm : r < m) (q : ℕ) :
renewalPolynomial R m (m * q + r) =
reciprocalShift q
(pfFactorNumerator (R ^ r).coeff
(X * R ^ (m - r)).coeff q)
Delayed renewal rows of a PF polynomial are PFRealRooted original
theorem renewalPolynomial_isPF_of_isPFPolynomial
{R : ℝ[X]} (hR : IsPFPolynomial R)
{m r : ℕ} (hrm : r < m) (q : ℕ) :
IsPFPolynomial (renewalPolynomial R m (m * q + r))
For R(0) > 0, consecutive renewal rows in a residue class are nonzero and interlaceRealRooted original
theorem strictInterl_renewalPolynomial_residue_succ
{R : ℝ[X]} (hR : IsPFPolynomial R) (hR0 : 0 < R.coeff 0)
{m r : ℕ} (hrm : r < m) (q : ℕ) :
StrictInterl (renewalPolynomial R m (m * q + r))
(renewalPolynomial R m (m * (q + 1) + r))