| ⊢theorem | For deg p ≤ d the f-transform splits exactly when p splitsMain resultRealRooted.splits_fPolynomial_iff | The f-polynomial transform | source |
| ⊢theorem | For every m ≥ 2, consecutive Hoggatt rows strictly interlaceMain resultRealRooted.Hoggatt.normalized_interlaces_and_isCoprime | Hoggatt polynomials | source |
| ⊢theorem | For every δ ≥ 0 all roots are real and negativeMain resultRealRooted originalRealRooted.JacobiDeformation.polynomial_all_rank_nonneg_parameter | Jacobi deformation | source |
| ⊢theorem | For every δ ≥ 0 the deformation is a PF polynomialRealRooted originalRealRooted.JacobiDeformation.isPFPolynomial_polynomial | Jacobi deformation | source |
| ⊢theorem | For f with nonnegative coefficients and c > 0 all roots of the image are nonpositiveRealRooted originalRealRooted.powerDerivativeShift_roots_nonpos | The operator D^m (D + c) x^m | source |
| ⊢theorem | For g(0) = 0 and deg g = deg f + 1 with nonnegative coefficients: f ≪ g iff g/X ≪ fRealRooted.strictInterl_iff_divX_strictInterl_of_coeff_zero | Common interleavers and compatible families | source |
| ⊢theorem | For i ∈ {1, 2, 3, k − 2, k − 1}, nonnegative combinations of A_{k,S} are real-rootedMain resultRealRooted.JacobiStirlingDescent.weightedDescentSum_splits_simple_neg | Jacobi–Stirling descent polynomials | source |
| ⊢theorem | For k ≥ 1, A_{k,S} has degree 2k − |S| − 1, constant term 1, simple negative rootsRealRooted.JacobiStirlingDescent.isGood_descentPoly | Jacobi–Stirling descent polynomials | source |
| ⊢theorem | For m = 3, the Hoggatt polynomials are the Baxter descent polynomials (A056939)RealRooted.Hoggatt.normalized_three_eq_baxter | Hoggatt polynomials | source |
| ⊢theorem | For n ≥ 1, M_n has degree n and n simple negative rootsRealRooted.BorosMoll.bmM_roots | Log-concavity transform of the Boros–Moll rows | source |
| ⊢theorem | For n ≥ 1, the Boros–Moll row d(n) is infinitely log-concaveRealRooted.BorosMoll.borosMollRow_isInfinitelyLogConcave | Log-concavity transform of the Boros–Moll rows | source |
| ⊢theorem | For n ≥ 1, the dual Chow polynomial interlaces the augmented oneRealRooted.HosterStump.strictInterl_chowOfFlagH_dualFlagH_augChowOfFlagH_flagH | Chow polynomials of simplicial posets | source |
| ⊢theorem | For n ≥ 2, the refined descent polynomials form interlacing diagramsRealRooted.HosterStump.isInterlacingDiagram_range | Chow polynomials of simplicial posets | source |
| ⊢theorem | For n ≥ 3, M_{n-2} interlaces A_n; both have simple roots and no common rootMain resultRealRooted originalRealRooted.BigDescents321.motzkinRef_interl_bigDescentPoly_and_noCommonRoots | Big-descent polynomials of 321-avoiding permutations | source |
| ⊢theorem | For PF h ≠ 0: k is PF with k ≪ h iff k is a nonnegative sum of h and h/(x − u)RealRooted originalRealRooted.isPFPolynomial_and_interl_iff_hasKreinCompanionExpansion | Finite-degree tests for differential operators | source |
| ⊢theorem | For positive β, consecutive Favard polynomials interlaceRealRooted.favardInterlacing | Favard recurrences: real roots, interlacing and orthogonality | source |
| ⊢theorem | For positive β, Favard polynomials are nonzero and real-rootedRealRooted.isRealRooted_of_favard | Favard recurrences: real roots, interlacing and orthogonality | source |
| ⊢theorem | For positive β, the pairing is positive definiteRealRooted.SatisfiesFavardRecurrence.pairing_posDef | Favard recurrences: real roots, interlacing and orthogonality | source |
| ⊢theorem | For quadratic data on the boundary of the parameter cone the ray quantifier is eliminatedRealRooted originalRealRooted.OperatorMatrix.couplingRayCriterion_quadratic_iff_of_boundary | Operator matrices preserving ordered PF vectors | source |
| ⊢theorem | For r = 1 and positive [u²]Q or [u²]B: simple roots, no common roots in consecutive rowsRealRooted originalRealRooted.BrandenLeite.affineNegativePowerCoeff_factor_simple_and_disjoint | Chain polynomials of totally nonnegative matrices | source |
| ⊢theorem | For R(0) > 0, consecutive renewal rows in a residue class are nonzero and interlaceRealRooted originalRealRooted.strictInterl_renewalPolynomial_residue_succ | Chain polynomials of totally nonnegative matrices | source |
| ⊢theorem | For s < 0, the exact condition is that the roots of p lie in [1/(4s), 0]RealRooted originalRealRooted.quadraticSubstitution_splits_and_roots_nonpos_iff_of_neg | Rational substitutions | source |
| ⊢theorem | For s ≥ 0, nonpositive roots are preserved exactly for split p with nonpositive rootsRealRooted originalRealRooted.quadraticSubstitution_splits_and_roots_nonpos_iff_of_nonneg | Rational substitutions | source |
| ⊢theorem | For the kernel u = 1 the run sum is the product of (1 + z_i)RealRooted originalRealRooted.siteWeightedRuns_one_by_one | Hessenberg rows of TP2 matrices | source |
| ⊢theorem | For the sequence 0, 0, 0, 1, 1, ..., c_6 = x² + x + 1 is not real-rootedRealRooted.BrandenVecchi.chowPolynomial_three_zero_prefix_six_not_splits | Chow polynomials of totally nonnegative matrices | source |
| ⊢theorem | For u > 0 the n-th polynomial has degree ⌊n/2⌋RealRooted originalRealRooted.PathSquareEdge.polynomial_natDegree | Weighted matchings of the square of a path and simplicial-clique deletion | source |
| ⊢theorem | For |h| < 1 the roots are simple and lie in (-2/λ, 0)RealRooted originalRealRooted.Chebyshev.affineLevel_splits_simple_roots_mem_Ioo | Chebyshev level polynomials | source |
| ⊢theorem | For |h| < 1 the roots of T_n - h are simple and lie in (-1, 1)RealRooted originalRealRooted.Chebyshev.T_sub_C_splits_simple_roots_mem_Ioo | Chebyshev level polynomials | source |
| ⊢theorem | For α, λ > 0 and |h| ≤ 1 the affine level polynomials are PFRealRooted originalRealRooted.Chebyshev.affineLevel_isPFPolynomial | Chebyshev level polynomials | source |
| ⊢theorem | For β = -m the polynomial solutions are multiples of (1 + X)^m times a Jacobi polynomialRealRooted.eq_C_mul_endpoint_factor_of_reflectedJacobiOperator_eq_zero | Jacobi polynomials | source |
| ⊢theorem | For γ < α + 1, L_n + γ L_{n-1} has simple positive rootsRealRooted.laguerreCombinationOne_splits_simple_roots_pos | Generalized Laguerre polynomials | source |
| ⊢theorem | For γ > 0 all roots of the cubic family are negativeRealRooted originalRealRooted.cubicTransitionFamily_roots_neg | Ordered PF states for cubic and quartic recurrences | source |
| ⊢theorem | For γ, w > 0 consecutive rows in each residue class modulo three interlaceRealRooted originalRealRooted.cubicTransitionFamily_residue_interlaces | Ordered PF states for cubic and quartic recurrences | source |
| ⊢theorem | For γ, w > 0 the nth row of the cubic family has degree ⌊n/3⌋RealRooted originalRealRooted.cubicTransitionFamily_natDegree | Ordered PF states for cubic and quartic recurrences | source |
| ⊢theorem | For λ ≥ 0 the Bessel operator maps real-rooted polynomials to real-rooted polynomialsRealRooted originalRealRooted.besselOperator_splits | Bessel operators and imaginary central differences | source |
| ⊢theorem | For ℓ ≥ 1, consecutive super-Eulerian polynomials interlace, without common rootsCoauthored paperRealRooted.SuperEulerian.strictInterl_superEulerian_succ | Eulerian-type polynomials | source |
| ⊢theorem | For ℓ ≥ 1, super-Eulerian polynomials are nonzero and real-rootedCoauthored paperRealRooted.SuperEulerian.isRealRooted_superEulerian | Eulerian-type polynomials | source |
| ⊢theorem | Forests: the minima polynomial is the acyclic sink polynomial of the line graphCoauthored paperRealRooted.Graph.minimaPolynomial_eq_ordinaryAcyclicSinkPolynomial_lineGraph | Minima polynomial of local edge orders | source |
| ⊢theorem | Formula for affine right inputsRealRooted.Poisson.starC_affine_right | Poisson star product | source |
| ⊢theorem | Forward direction: Rolle and the two Laguerre inequalitiesRealRooted.splits_derivative_and_forms_nonneg_of_splits | Laguerre inequalities | source |
| ⊢theorem | Four Euler insertion images have a common left interleaverRealRooted originalRealRooted.crossedEulerCompletion_commonLeftInterleaver | Eulerian-type polynomials | source |
| ⊢theorem | Full truncated staircases have rook polynomial PₙRealRooted.GeneralizedSnakePosets.FiniteSkewBoard.rookPolynomial_full_eq_modifiedNarayana | Rook polynomials of generalized snake posets | source |
| ⊢theorem | Functional calculus: S_g((t − r) p) = (g − r) ⋆ S_g(p)RealRooted originalRealRooted.derivProductPowMap_X_sub_C_mul | Poisson star product | source |
| ⊢theorem | Fu–Lin–Zeng / Zhang: the descent enumerator equals S_{n+1}RealRooted.SeparablePermutations.descentEnumerator_eq_descentPolynomial | Descent polynomials of separable permutations | source |
| ⊢theorem | Fu–Lin–Zeng's cubic for the gamma-polynomials (via Lagrange inversion)RealRooted.SeparablePermutations.gammaPolynomial_cubic | Descent polynomials of separable permutations | source |
| ≔definition | Gamma transformRealRooted.gammaTransform | Gamma transform | source |
| ⊢theorem | Gamma transforms of adjacent degree preserve interlacingRealRooted.strictInterl_gammaTransform_succ_iff | Gamma transform | source |
| ⊢theorem | Gamma transforms of real-rooted nonnegative polynomialsRealRooted.GammaTransform.isRealRooted_gammaTransform_of_hasNonnegCoeffs | Gamma transform | source |
| ≔definition | Gamma-pencil operatorRealRooted.gammaOperator | Gamma transform | source |
| ≔definition | Gamma-polynomials Γ_n through the factorial-compression representationRealRooted.SeparablePermutations.gammaPolynomial | Descent polynomials of separable permutations | source |
| ⊢theorem | Gantmacher–Krein: primitive compounds give a simple positive spectrumMatrix.exists_charpoly_eq_prod_strictAnti_of_compounds_primitive | Totally nonnegative matrices | source |
| ⊢theorem | Garloff–Wagner: Hadamard products of PF polynomials are PFRealRooted.IsPFPolynomial.hadamardProduct | Hadamard products and Schur–Szegő composition | source |
| ⊢theorem | Garloff–Wagner: Hadamard products preserve interlacingMain resultRealRooted.StrictInterl.interl_hadamardProduct | Hadamard products and Schur–Szegő composition | source |
| ⊢theorem | Garloff–Wagner: the factorial Hadamard product preserves interlacingRealRooted.Interl.factorialHadamardProduct_right | Hadamard products and Schur–Szegő composition | source |
| ≔definition | Gaussian weightRealRooted.hermiteGaussianWeight | Hermite polynomials | source |
| ⊢theorem | General form: f ≪ af + Σ bᵢgᵢ from the combined flux at the zeros of fMain resultRealRooted.LiuWang.strictInterl_mul_add_sum_mul_of_combined_flux_of_pos | The Liu–Wang and Ma–Wang interlacing criteria | source |
| ≔definition | Generalized Eulerian polynomialsRealRooted.generalizedEulerian | Eulerian polynomials | source |
| ≔definition | Generalized Jensen multiplierMvPolynomial.jensen | Multivariate Szász growth bound | source |
| ≔definition | Generalized Laguerre polynomialsPolynomial.generalizedLaguerre | Generalized Laguerre polynomials | source |
| ⊢theorem | Generalized Laguerre polynomials are orthogonal on the half-lineRealRooted.generalizedLaguerre_integral_orthogonal | Generalized Laguerre polynomials | source |
| ⊢theorem | Generalized Laguerre polynomials are real-rootedRealRooted.generalizedLaguerre_splits | Generalized Laguerre polynomials | source |
| ⊢theorem | Generalized Laguerre polynomials have simple rootsRealRooted.generalizedLaguerre_hasSimpleRoots | Generalized Laguerre polynomials | source |
| ≔definition | Generalized Narayana polynomialsRealRooted.narayanaPolynomial | Narayana polynomials | source |
| ⊢theorem | Generalized Narayana polynomials are Pólya-frequencyRealRooted.narayanaPolynomialRootLocation | Narayana polynomials | source |
| ⊢theorem | Generalized Narayana polynomials are real-rootedRealRooted.splits_narayanaPolynomial | Narayana polynomials | source |
| ≔definition | Generalized rising factorialsRealRooted.risingFactorialPolynomial | Narayana polynomials | source |
| ≔definition | Generating polynomial of the log-concavity transform of a Boros–Moll rowRealRooted.BorosMoll.bmM | Log-concavity transform of the Boros–Moll rows | source |
| ⊢theorem | Geometric factor is Pólya-frequencyRealRooted.EdreiThoma.isPolyaFreqSeries_geometricFactor | Edrei–Thoma theorem | source |
| ⊢theorem | Goncharov: Stirling numbers of the first kind are asymptotically normalPolynomial.tendsto_standardizedCoeffDistribution_prod_X_add_natCast | Central limit theorems for real-rooted coefficient distributions | source |
| ⊢theorem | Grace's apolarity theorem for closed disksMain resultRealRooted.exists_isRoot_mem_closedBall_of_areApolar | Grace's apolarity theorem | source |
| ⊢theorem | Grace's apolarity theorem for closed half-planesRealRooted.exists_isRoot_le_im_of_areApolar | Grace's apolarity theorem | source |
| ⊢theorem | Grace–Walsh–Szegő coincidence theorem for closed disksRealRooted.exists_eval_const_eq_of_mem_closedBall | Grace's apolarity theorem | source |
| ⊢theorem | Grace–Walsh–Szegő, real form: real stable iff the diagonal is real-rootedRealRooted.mvRealStable_iff_aeval_X_ne_zero_and_splits | Grace's apolarity theorem | source |
| ⊢theorem | Grace–Walsh–Szegő: a symmetric multiaffine polynomial is stable iff its diagonal isRealRooted.mvUpperHalfPlaneStable_iff_eval_diagonalProjection_ne_zero | Grace's apolarity theorem | source |
| ⊢theorem | Gribinski–Marcus: the rectangular convolution preserves nonnegative rootsRealRooted.HasOnlyNonnegRoots.rectangularAdditiveConvolution | Finite free convolutions | source |
| ⊢theorem | Gurvits' univariate coefficient inequalityRealRooted.Gurvits.mul_le_coeff_one_of_splits | Van der Waerden permanent bound | source |
| ⊢theorem | Gurvits: capacity drops by at most ((d−1)/d)^(d−1) per variableRealRooted.Gurvits.gurvitsFactor_mul_capacity_le_capacity_step | Van der Waerden permanent bound | source |
| ⊢theorem | Gustafsson–Solus Lemma 3.4: row-threshold matrices preserve interlacingRealRooted.isInterlacingSeq0Nonneg_gustafssonSolusAction | Threshold matrices | source |
| ⊢theorem | Gårding: hyperbolicity cones are convexRealRooted.convex_hyperbolicityCone | Real stability | source |
| ⊢theorem | h(D) preserves PF polynomials of degree at most N exactly when h(D) X^N is PFMain resultRealRooted originalRealRooted.PreservesPFUpTo.iff_finiteDifferentialTest | Finite-degree tests for differential operators | source |
| ⊢theorem | H_y has simple real roots in [-1, 0) for 0 ≤ y ≤ 1/3RealRooted originalRealRooted.normalizedQuadraticFamily_splits_simple_roots_mem_Ico | Interlacing of quadratics | source |
| ⊢theorem | H_y interlaces (X + 1) H_z exactly when z ≤ yRealRooted originalRealRooted.normalizedQuadraticFamily_interlaces_mul_X_add_one_iff | Interlacing of quadratics | source |
| ⊢theorem | H_y interlaces H_z exactly when z ≤ yRealRooted originalRealRooted.normalizedQuadraticFamily_strictInterl_iff | Interlacing of quadratics | source |
| ≔definition | Hadamard productRealRooted.hadamardProduct | Hadamard products and Schur–Szegő composition | source |
| ⊢theorem | Hadamard products of Hurwitz-stable polynomials are stableMain resultRealRooted.IsHurwitzStable.hadamardProduct | Hadamard products of Hurwitz-stable polynomials | source |
| ⊢theorem | Haglund–Zhang threshold matrices preserve interlacing sequencesRealRooted.HaglundZhang.isInterlacingSeq0Nonneg_matPolyAction | Threshold matrices | source |
| ⊢theorem | Haglund–Zhang: binomial Eulerian polynomials are real-rootedRealRooted.HaglundZhang.binomialEulerianPolynomial_splits | Threshold matrices | source |
| ⊢theorem | Half-growth sequences transfer consecutive interlacingRealRooted.StrictInterl.fPolynomial_sequence | The f-polynomial transform | source |
| ⊢theorem | Hankel (Cauchy–Schwarz) inequality for the first three momentsRealRooted originalRealRooted.sq_integral_pow_one_le_mul_zero_two | Basis transforms preserving real-rootedness and PF | source |
| ⊢theorem | Harper: real-rooted coefficient distributions are asymptotically normalPolynomial.tendsto_standardizedCoeffDistribution | Central limit theorems for real-rooted coefficient distributions | source |
| ⊢theorem | Hausdorff inequalities for finite positive measures on [0, β]RealRooted originalRealRooted.sum_alternating_choose_mul_integral_pow_nonneg | Basis transforms preserving real-rootedness and PF | source |
| ⊢theorem | Heilmann–Lieb root bound |x| ≤ 2√(Δ − 1)RealRooted.abs_le_of_isRoot_matchingPolyOn | Heilmann–Lieb theorem | source |
| ⊢theorem | Heilmann–Lieb: the matching polynomial is real-rootedRealRooted.Graph.matchingPolynomialByEdges_splits | Heilmann–Lieb theorem | source |
| ⊢theorem | Heilmann–Lieb: μ_S is real-rootedRealRooted.splits_matchingPolyOn | Heilmann–Lieb theorem | source |
| ≔definition | Hermite matrix of Newton power sumsPolynomial.hermiteMatrix | Sturm root counting | source |
| ⊢theorem | Hermite polynomials are orthogonal for the Gaussian weightRealRooted.hermiteReal_integral_orthogonal | Hermite polynomials | source |
| ⊢theorem | Hermite polynomials are real-rootedRealRooted.hermiteReal_isRealRooted | Hermite polynomials | source |
| ⊢theorem | Hermite polynomials form a Sturm sequenceRealRooted.hermiteReal_isSturmSeq | Hermite polynomials | source |
| ⊢theorem | Hermite polynomials have simple rootsRealRooted.hermiteReal_hasSimpleRoots | Hermite polynomials | source |
| ⊢theorem | Hermite polynomials satisfy a Favard recurrenceRealRooted.hermiteReal_satisfiesFavardRecurrence | Hermite polynomials | source |
| ⊢theorem | Hermite–Biehler, converse: f + ig without such zeros implies g ≪ fRealRooted.strictInterl_of_upperHalfPlaneStable_hermiteBiehler | Hermite–Biehler and Hurwitz stability criteria | source |
| ⊢theorem | Hermite–Biehler: g ≪ f implies f + ig has no zeros with positive imaginary partRealRooted.hermiteBiehlerForwardPos | Hermite–Biehler and Hurwitz stability criteria | source |
| ⊢theorem | Hermite–Kakeya–Obreschkoff converse: a stable real span gives proper positionMain resultRealRooted.AllComboMvRealStableOrZero.eq_zero_or_properPosition | Multivariate Hermite–Kakeya–Obreschkoff theorem | source |
| ⊢theorem | Hermite–Kakeya–Obreschkoff: proper position gives a stable real spanRealRooted.MvProperPosition.allComboMvRealStableOrZero | Multivariate Hermite–Kakeya–Obreschkoff theorem | source |
| ⊢theorem | Hermite–Poulain operators preserve interlacingRealRooted.HermitePoulain.interl_or_interl_applyAsDifferentialOperator | Hermite–Poulain theorem | source |
| ⊢theorem | Hermite–Poulain theoremMain resultRealRooted.HermitePoulain.applyAsDifferentialOperator_eq_zero_or_splits | Hermite–Poulain theorem | source |
| ⊢theorem | Hermite–Sylvester: real-rooted iff the Hermite matrix is PSDMain resultPolynomial.splits_iff_hermiteMatrix_posSemidef | Sturm root counting | source |
| ⊢theorem | Hlavacek–Solus: interlacing shelling pieces give a real-rooted h-polynomialRealRooted.HlavacekSolus.isRealRooted_hPolynomial_of_perm_isInterlacingSeqNonneg | Closure of interlacing under cones, affine combinations and shifts | source |
| ⊢theorem | Hoggar: log-concavity without internal zeros is closed under productsMain resultRealRooted.coeffLogConcaveUpTo_mul | Hoggar's theorem | source |
| ⊢theorem | Homogenization in any degree at least the total degree preserves real stabilityRealRooted.MvRealStable.ordinaryHomogenization_of_totalDegree_le | Real stability | source |
| ⊢theorem | Homogenization preserves real stabilityRealRooted.MvRealStable.ordinaryHomogenization | Real stability | source |
| ≔definition | Horizontal stretching by repetition of column heightsRealRooted.Schur.repeatColumns | Schur elementary-coordinate substitutions | source |
| ⊢theorem | Hurwitz criterion: stable iff the Hurwitz matrix is totally nonnegativeRealRooted.isHurwitzStable_iff_hurwitz_isTotallyNonneg | Hermite–Biehler and Hurwitz stability criteria | source |
| ≔definition | Hurwitz stable: nonnegative coefficients and no zeros with positive real partRealRooted.IsHurwitzStable | Hermite–Biehler and Hurwitz stability criteria | source |
| ⊢theorem | Hutchinson: such power series are Laguerre–Pólya entire functionsMain resultRealRooted.Hutchinson.isLaguerrePolya_tsum | Hutchinson's theorem | source |
| ≔definition | Hyperbolic in a directionMvPolynomial.HyperbolicAt | Real stability | source |
| ⊢theorem | Hyperbolicity is constant on path components of the nonvanishing locusRealRooted.MvPolynomial.HyperbolicAt.of_joinedIn | Real stability | source |
| ≔definition | Hypergeometric polynomials R_dRealRooted.ParkingFunctions.ToricContribution.rPolynomial | Toric g-contribution polynomials | source |
| ⊢theorem | Identical invertible maps can have non-real-rooted rowwise Schur squaresRealRooted.rowwiseNormalizedSchurProduct_counterexample | Hadamard products and Schur–Szegő composition | source |
| ⊢theorem | If A(R) ≤ R² - 1 and B(R) ≤ 1, consecutive rows strictly interlaceMain resultRealRooted originalRealRooted.ToeplitzPerturbation.strictInterl_row_succ | Signed Toeplitz perturbations of the Chebyshev rows | source |
| ⊢theorem | If f ≪ g and both have nonnegative coefficients, then g ≪ xfRealRooted.strictInterl_mul_X_of_strictInterl_of_nonneg | Wagner’s lemma | source |
| ⊢theorem | If f ≪ g, then af + bg ≪ g for a, b ≥ 0 not both zeroRealRooted.StrictInterl.nonneg_combo_right | Wagner’s lemma | source |
| ⊢theorem | If f ≪ g, then f ≪ af + bg for a, b ≥ 0 not both zeroRealRooted.StrictInterl.nonneg_combo_left | Wagner’s lemma | source |
| ⊢theorem | If f ≺ g, deg g = deg f + 1 and deg f < L, then D_L f ≺ D_{L+1} gRealRooted.JacobiStirlingDescent.StrictInterleave.insertion_succ | Jacobi–Stirling descent polynomials | source |
| ⊢theorem | If p ≪ q have nonnegative coefficients, the Lace matrix of (q, p) is totally nonnegativeRealRooted.StrictInterl.fullyInterlacingPair | Hermite–Biehler and Hurwitz stability criteria | source |
| ⊢theorem | If p_N is real-rooted, then p_n is real-rooted for all n ≤ NRealRooted originalRealRooted.splits_evenDerivativeTest_of_le | Finite-degree tests for differential operators | source |
| ⊢theorem | If p_N is real-rooted, Δ_c maps PF polynomials of degree at most N to PF polynomialsRealRooted originalRealRooted.isPFPolynomial_evenDerivativeOperator | Finite-degree tests for differential operators | source |
| ⊢theorem | If p_n is real-rooted, Δ_c ∏ (x + rᵢ) is real-rooted for rᵢ ≥ 0RealRooted originalRealRooted.splits_evenDerivativeOperator_prod | Finite-degree tests for differential operators | source |
| ⊢theorem | If q(x²) + x p(x²) is Hurwitz stable, the Lace matrix of (q, p) is totally nonnegativeRealRooted.fullyInterlacingPair_of_isHurwitzStable_oddEvenPolynomial | Hermite–Biehler and Hurwitz stability criteria | source |
| ⊢theorem | If two constant levels of g split, every intermediate level splitsRealRooted originalRealRooted.splits_sub_C_of_mem_Icc | Poisson star product | source |
| ⊢theorem | If w ≤ 0 on ℝ, the one-factor levels decide every source setRealRooted originalRealRooted.derivProductPowMap_realRooted_iff_of_nonpos | Poisson star product | source |
| ≔definition | Images E(x^k (x + 1)^(n − k))RealRooted.brandenBasisImage | Brändén's E transform | source |
| ≔definition | Imaginary parts of the powers of a complex rootRealRooted.aswKarlinRootVector | Aissen–Schoenberg–Whitney theorem | source |
| ⊢theorem | Implicit derivative of a simple output root in one input rootRealRooted.exists_hasDerivAt_finRootPolynomial_shift | Interlacing from a monomial chain | source |
| ⊢theorem | In the half-height range η ≤ a/2 the n-th row has degree ⌊n/2⌋RealRooted originalRealRooted.weightedThreeStateRow_natDegree_halfHeight | Weighted three-state recurrence | source |
| ⊢theorem | Increasing-column permanent is real stableRealRooted.Permanent.columnPermanent_mvRealStable_of_increasingColumns | Monotone column permanent theorem | source |
| ≔definition | Increasing-run polynomial of ternary wordsRealRooted.EulerianCompendium.ternaryWordRunEnumerator | Eulerian-type polynomials | source |
| ≔definition | Independence polynomialRealRooted.Graph.indepPoly | Claw-free independence polynomials | source |
| ⊢theorem | Independence polynomials of path powers ∑ C(m − rk, k) xᵏ are real-rootedRealRooted.splits_sum_choose_sub_mul | Sturm sequences from derivative recurrences | source |
| ≔definition | Index set of a Toeplitz minorRealRooted.StrictToeplitzMinorIndex | Lindström–Gessel–Viennot lemma and total positivity | source |
| ⊢theorem | Induction along a multishift recurrence from a PF seedRealRooted originalRealRooted.multishiftDifferentialRecurrence_induction | Finite-degree tests for differential operators | source |
| ≔definition | Infinitely log-concave: every iterate of the transform is nonnegativeRealRooted.Branden.IsInfinitelyLogConcave | Log-concavity transform of the Boros–Moll rows | source |
| ⊢theorem | Inserting a conjugate pair in the disk of squared radius 13/3 keeps simple interval rootsRealRooted originalRealRooted.IntervalDifferential.zigzagQuadraticFactor_roots | Zig-zag Eulerian polynomials | source |
| ⊢theorem | Inserting a real factor inserts a simple root into each gapRealRooted originalRealRooted.IntervalDifferential.zigzagLinearFactor_roots | Zig-zag Eulerian polynomials | source |
| ⊢theorem | Interlacing after one linear factorRealRooted.interlaces_self_mul_of_natDegree_eq_one | Interlacing for linear recurrences | source |
| ⊢theorem | Interlacing as stability of the bivariate pencil f(z) + w g(z)RealRooted.mvUpperHalfPlaneStable_bivariatePencil_iff_strictInterl | Obreschkoff’s theorem | source |
| ≔definition | Interlacing f ≪ g of nonzero real-rooted polynomialsRealRooted.StrictInterl | Interlacing | source |
| ⊢theorem | Interlacing families: some leaf's largest root is at most the root node'sRealRooted.RootSelectionTree.Valid.exists_leaf_largestRoot_le | Common interleavers and compatible families | source |
| ⊢theorem | Interlacing from a linear division remainderRealRooted.strictInterl_linear_of_remainder | Interlacing for linear recurrences | source |
| ⊢theorem | Interlacing from a quadratic division remainderRealRooted.strictInterl_quadratic_of_remainder | Interlacing for linear recurrences | source |
| ⊢theorem | Interlacing gives a nonnegative WronskianRealRooted.wronskian_eval_nonneg_of_strictInterl | Wronskian criterion for interlacing | source |
| ⊢theorem | Interlacing gives a real-rooted pencilRealRooted.allComboRealRooted_of_strictInterl | Obreschkoff’s theorem | source |
| ⊢theorem | Interlacing implies interlacing in the sense allowing zero polynomialsRealRooted.StrictInterl.toInterl | Interlacing | source |
| ⊢theorem | Interlacing is a nonnegative Wronskian plus a multiplicity boundMain resultRealRooted.strictInterl_iff_wronskian_eval_nonneg | Wronskian criterion for interlacing | source |
| ⊢theorem | Interlacing of parity productsRealRooted.interlaces_of_parityProduct | Interlacing for linear recurrences | source |
| ⊢theorem | Interlacing polynomials differ in degree by at most oneRealRooted.StrictInterl.natDegree_eq_or_eq_succ | Interlacing | source |
| ≔definition | Interlacing sequenceRealRooted.IsInterlacingSeq | Toric g-contribution polynomials | source |
| ≔definition | Interlacing sequence of real-rooted polynomials with nonnegative coefficientsRealRooted.IsInterlacingSeqNonneg | Matrices preserving interlacing sequences | source |
| ⊢theorem | Interlacing symbols reverse proper positionRealRooted.HermitePoulain.eq_zero_pair_or_stablePencil_applyAsDifferentialOperator | Hermite–Poulain theorem | source |
| ⊢theorem | Interlacing transferred through reversalRealRooted.interlaces_of_eq_reflect | Interlacing for linear recurrences | source |
| ⊢theorem | Interlacing when each next row has its roots in the next windowRealRooted.derivativeRecurrence_interlaces_of_endpoint_windows | Interlacing for linear recurrences | source |
| ⊢theorem | Interlacing with a degree gap of oneMain resultRealRooted.Interlaces.iff_strictInterl_and_natDegree | Interlacing | source |
| ⊢theorem | Interlacing with a moving lower boundRealRooted.derivativeRecurrence_interlaces_of_roots_mem_Icc_mono_div | Interlacing for linear recurrences | source |
| ⊢theorem | Interlacing with a moving upper boundRealRooted.derivativeRecurrence_interlaces_of_roots_le_mono_div | Interlacing for linear recurrences | source |
| ⊢theorem | Interlacing with an upper root boundRealRooted.derivativeRecurrence_interlaces_of_roots_le | Interlacing for linear recurrences | source |
| ≔definition | Interlacing with degrees differing by oneRealRooted.Interlaces | Interlacing | source |
| ≔definition | Interlacing, allowing zero polynomialsRealRooted.Interl | Interlacing | source |
| ⊢theorem | Inversion in one variable preserves real stabilityRealRooted.MvRealStable.invertVariable | Real stability | source |
| ⊢theorem | Inversion in one variable preserves stabilityRealRooted.MvUpperHalfPlaneStable.invertVariable | Real stability | source |
| ⊢theorem | Inversion of equal-length interleavingsRealRooted.interleaves_reverse_map_one_div_of_length_eq | Reciprocal shifts and interlacing | source |
| ⊢theorem | Inversion of length-shifted interleavingsRealRooted.interleaves_reverse_map_one_div_of_length_add_one_eq | Reciprocal shifts and interlacing | source |
| ⊢theorem | Inversion preserves stability of univariate polynomialsRealRooted.IsUpperHalfPlaneStable.reflect_comp_neg_X | Real stability | source |
| ≔definition | Inversion z^d P(−1/z) in one variableRealRooted.invertVariable | Real stability | source |
| ⊢theorem | Irreducible matrices have a positive eigenvectorMain resultMatrix.exists_positive_eigenvector_of_irreducible | Perron–Frobenius theorem | source |
| ⊢theorem | Iterated causal differences of polynomial values are the Euler numeratorRealRooted originalRealRooted.polynomialValueSeq_causalFwdDiff_iter | Pólya frequency sequences with polynomial tails | source |
| ⊢theorem | Iterated derivatives of the substitution in terms of derivatives of pRealRooted originalRealRooted.homogenizedSubstitution_iterateDerivative | Rational substitutions | source |
| ⊢theorem | Iterated Laguerre raising steps preserve simple negative rootsRealRooted.laguerreRaisingSteps_splits_simple_roots_neg | Generalized Laguerre polynomials | source |
| ≔definition | Iterated rows of the matrix from a seed vectorRealRooted.separatedCharacteristicRows | Recurrences with separated characteristic parameters | source |
| ⊢theorem | Iterates of an interlacing seed remain interlacing sequencesRealRooted originalRealRooted.separatedCharacteristicRows_interlacing | Recurrences with separated characteristic parameters | source |
| ⊢theorem | Iterating ((x-a)(x-b)f)' gives a chain P_n ≪ P_{n+1}RealRooted.strictInterl_derivative_endpointProduct_sequence | Interlacing and root intervals of endpoint-derivative sequences | source |
| ⊢theorem | Iterating ((x-a)(x-b)f)' gives nonzero real-rooted rowsRealRooted.isRealRooted_derivative_endpointProduct_sequence | Interlacing and root intervals of endpoint-derivative sequences | source |
| ⊢theorem | Iterating ((x-a)(x-b)f)' with degrees rising by one: differ-by-one interlacingRealRooted.interlaces_derivative_endpointProduct_sequence | Interlacing and root intervals of endpoint-derivative sequences | source |
| ⊢theorem | Iterating (x-a)(x-b)f' gives a chain P_n ≪ P_{n+1}RealRooted.strictInterl_endpointDerivative_sequence | Interlacing and root intervals of endpoint-derivative sequences | source |
| ⊢theorem | Iterating (x-a)(x-b)f' gives nonzero real-rooted rowsRealRooted.isRealRooted_endpointDerivative_sequence | Interlacing and root intervals of endpoint-derivative sequences | source |
| ⊢theorem | Iterating (x-a)(x-b)f' with degrees rising by one: differ-by-one interlacingRealRooted.interlaces_endpointDerivative_sequence | Interlacing and root intervals of endpoint-derivative sequences | source |
| ⊢theorem | J_n maps PF polynomials of degree at most n to PF polynomialsRealRooted.IsPFPolynomial.binaryRunTransform | Binary-run transformation | source |
| ⊢theorem | J_n of (n+1)g - 2Θg interlaces J_{n+1} gRealRooted.strictInterl_binaryRunTransform_succ | Binary-run transformation | source |
| ⊢theorem | J_n preserves interlacing on inputs of degree at most (n+1)/2Main resultRealRooted.strictInterl_binaryRunTransform | Binary-run transformation | source |
| ≔definition | Jacobi–Stirling numbers of the first kindRealRooted.JacobiStirling.firstKind | Jacobi–Stirling numbers | source |
| ≔definition | Jacobi–Stirling numbers of the second kindRealRooted.JacobiStirling.secondKind | Jacobi–Stirling numbers | source |
| ≔definition | Jensen polynomialsRealRooted.jensenPolynomial | Multiplier sequences | source |
| ≔definition | Jensen-multiplier operatorMvPolynomial.jensenOp | Multivariate Szász growth bound | source |
| ≔definition | Jensen-pencil certificateRealRooted.BidiagonalJensenPencilCertificate | Multiplier sequences | source |
| ⊢theorem | Jensen: non-real zeros of p' lie in Jensen disksPolynomial.exists_mem_jensenDisk_of_isRoot_derivative | Interlacing of derivatives of real-rooted polynomials | source |
| ⊢theorem | k + r is a PF multiplier sequence for r ≥ 0RealRooted.isPFMultiplierSequence_natCast_add | Multiplier sequences | source |
| ⊢theorem | Karlin window matrices of PF sequences are totally nonnegativeRealRooted.IsPolyaFreqSeq.aswKarlinMatrix_isTotallyNonnegRect | Aissen–Schoenberg–Whitney theorem | source |
| ≔definition | Karlin's repeated coefficient-window matrixRealRooted.aswKarlinMatrix | Aissen–Schoenberg–Whitney theorem | source |
| ⊢theorem | Karlin's repeated matrices force many sign variations on the sine vectorRealRooted.aswKarlinRepeatedSineVariationLowerBound | Aissen–Schoenberg–Whitney theorem | source |
| ≔definition | Karlin's sector threshold mπ/(m+d−1)RealRooted.aswSectorThreshold | Aissen–Schoenberg–Whitney theorem | source |
| ⊢theorem | Karlin: Gaussian matrices are strictly totally positiveMatrix.det_gaussianMatrix_submatrix_pos | Totally nonnegative matrices | source |