| ⊢theorem | Delayed renewal rows are reciprocal shifts of PF-factor numerators in each residue classRealRooted originalRealRooted.BrandenLeite.renewalPolynomial_eq_reciprocalShift_pfFactorNumerator | Chain polynomials of totally nonnegative matrices | source |
| ⊢theorem | Delayed renewal rows of a PF polynomial are PFRealRooted originalRealRooted.renewalPolynomial_isPF_of_isPFPolynomial | Chain polynomials of totally nonnegative matrices | source |
| ⊢theorem | Deleting a simplicial clique interlaces the weighted independence polynomialRealRooted originalRealRooted.Graph.strictInterl_weightedIndepPolyOn_sdiff_of_simplicialClique | Weighted matchings of the square of a path and simplicial-clique deletion | source |
| ⊢theorem | Deleting a vertex interlaces the matching polynomialRealRooted.interlaces_matchingPolyOn_erase | Heilmann–Lieb theorem | source |
| ⊢theorem | Deleting a vertex: the weighted matching polynomial of G - v interlaces that of GRealRooted originalRealRooted.Graph.matchingPolynomial_strictInterl_deleteVertex | Weighted matchings of the square of a path and simplicial-clique deletion | source |
| ⊢theorem | Deleting every barred letter: x A_{k,[k]} is the second-order Eulerian polynomialRealRooted.JacobiStirlingDescent.X_mul_descentPoly_Icc | Jacobi–Stirling descent polynomials | source |
| ≔definition | Derangement descent polynomial Σ x^des πRealRooted.EulerianCompendium.derangementDescentPolynomial | Eulerian-type polynomials | source |
| ≔definition | Derangement polynomials by excedancesRealRooted.sturmDerangementsExc | Sturm sequences from derivative recurrences | source |
| ≔definition | Derangement transform x^j ↦ d_jRealRooted.DerangementTransform.transform | Interlacing and real roots under symmetric decompositions | source |
| ⊢theorem | Derangements counted by excedances give the derangement polynomials d_nRealRooted.DerangementStatistic.derangementExcGenPoly_eq_polynomial | Interlacing and real roots under symmetric decompositions | source |
| ⊢theorem | Derivative of the weighted cross-product quotientPolynomial.Sonin.hasDerivAt_cross_div | Sonin envelopes | source |
| ⊢theorem | Derivative of the weighted envelope quotientPolynomial.Sonin.hasDerivAt_envelope_div | Sonin envelopes | source |
| ⊢theorem | Derivative products with a PF multiplier sequence preserve real-rootednessRealRooted.derivProduct_isRealRootedIn_univ | Associative derivative products with a fixed factor | source |
| ⊢theorem | Derivatives to the right of all roots have the sign of the leading coefficientRealRooted originalRealRooted.IsRealRootedIn.leadingCoeff_mul_eval_iterate_derivative_nonneg | Touchard transform | source |
| ⊢theorem | Descartes budget for the quadratic parameter evaluation of an interlacing chainRealRooted originalRealRooted.quadraticParameterEvaluation_positiveRootCount_le | Interlacing from a monomial chain | source |
| ⊢theorem | Descartes' rule of signsMain resultPolynomial.descartes_rule_of_signs | Descartes' rule of signs | source |
| ⊢theorem | Descartes' rule of signs for negative rootsPolynomial.descartes_rule_of_signs_negative | Descartes' rule of signs | source |
| ≔definition | Descent enumerator of the separable permutationsRealRooted.SeparablePermutations.descentEnumerator | Descent polynomials of separable permutations | source |
| ≔definition | Descent polynomial of parking functionsRealRooted.ParkingFunctions.parkingDescentPolynomial | Parking functions | source |
| ≔definition | Descent polynomial of tieless parking functionsRealRooted.ParkingFunctions.tielessParkingDescentPolynomial | Parking functions | source |
| ⊢theorem | Descent polynomials of 132-avoiders are real-rooted and interlaceRealRooted.Avoid132.strictInterl_descentGeneratingPolynomial_succ | Narayana polynomials | source |
| ⊢theorem | Descent polynomials of derangements are real-rootedCoauthored paperRealRooted.EulerianCompendium.Challenges.derangementDescent_realRooted | Eulerian-type polynomials | source |
| ≔definition | Descent polynomials S_n = (1 + t)^{n-1} Γ_n(t/(1+t)^2)RealRooted.SeparablePermutations.descentPolynomial | Descent polynomials of separable permutations | source |
| ⊢theorem | det (A + r J) = det A for d >= 2RealRooted originalRealRooted.det_add_smul_runJ_eq | Hessenberg rows of TP2 matrices | source |
| ⊢theorem | det (I + X B) = det (I + X A)^2 for the block matrix BRealRooted originalRealRooted.hessenbergDet_parityBlock | Hessenberg rows of TP2 matrices | source |
| ⊢theorem | det B = B_dd prod (B_ii - B_{i+1,i}) for a matrix with constant upper-triangular columnsRealRooted originalRealRooted.det_eq_last_mul_prod_of_forall_le | Hessenberg rows of TP2 matrices | source |
| ⊢theorem | det(I + X A) is a PF polynomial for a totally nonnegative matrix ARealRooted originalMatrix.IsTotallyNonneg.isPFPolynomial_det_one_add_X_smul | Determinant pencils of totally nonnegative matrices | source |
| ⊢theorem | det(M + X · checkerboard L) is PF for totally nonnegative M, L with det M > 0Main resultRealRooted originalMatrix.IsTotallyNonneg.isPFPolynomial_det_map_add_X_smul_checkerboard | Determinant pencils of totally nonnegative matrices | source |
| ≔definition | Determinant of a linear matrix pencilRealRooted.mvDetPencil | Real stability | source |
| ⊢theorem | Determinantal pencils are stable or zeroRealRooted.mvUpperHalfPlaneStableOrZero_detPencil | Real stability | source |
| ⊢theorem | Determinants of signed weighted kernels are coefficients of negative powersRealRooted originalRealRooted.BrandenLeite.det_weightedDerivativeKernel_subst_binomialSeries_neg | Chain polynomials of totally nonnegative matrices | source |
| ≔definition | Diagonal of a multivariate polynomialRealRooted.diagonalProjection | Grace's apolarity theorem | source |
| ≔definition | Diagonal operator of a sequenceRealRooted.diagonalOperator | Multiplier sequences | source |
| ≔definition | Differential action F(−∂)GRealRooted.applyNegDifferential | Grace's apolarity theorem | source |
| ⊢theorem | Differentiation in a variable with constant leading coefficient preserves stabilityRealRooted.MvUpperHalfPlaneStable.pderiv_none_of_top_coeff_C | Real stability | source |
| ⊢theorem | Differentiation preserves interlacing when the left polynomial is nonconstantRealRooted.StrictInterl.derivative | Interlacing of derivatives of real-rooted polynomials | source |
| ⊢theorem | Differentiation preserves interlacing, allowing zero polynomialsRealRooted.Interl.derivative | Interlacing of derivatives of real-rooted polynomials | source |
| ⊢theorem | Differentiation raises the annihilating power of a shift polynomial by oneRealRooted originalRealRooted.shiftAction_pow_succ_sequenceDerivative_eq_zero | Finite certificates for differential recurrences | source |
| ⊢theorem | Differentiation shifts the parameter a to a + 1RealRooted.derivative_jacobiCoefficientPolynomial | Jacobi polynomials | source |
| ≔definition | Discrepancy of a prefix row from the geometric tailRealRooted.geometricDiscrepancy | Basis transforms preserving real-rootedness and PF | source |
| ⊢theorem | Discrete Hermite–Poulain theoremMain resultRealRooted.forall_finiteDifferenceOp_meshGE_iff | Mesh and finite differences | source |
| ≔definition | Discrete multiplier sequenceRealRooted.IsDiscreteMultiplierSequence | Mesh and finite differences | source |
| ⊢theorem | Discrete multiplier sequences are multiplier sequencesRealRooted.IsDiscreteMultiplierSequence.isMultiplierSequence | Mesh and finite differences | source |
| ⊢theorem | Discrete multiplier sequences increase where they are positiveRealRooted.IsDiscreteMultiplierSequence.le_succ | Mesh and finite differences | source |
| ≔definition | Discriminant of the normal formPolynomial.Sonin.disc | Sonin envelopes | source |
| ⊢theorem | Duplicated-row families have negative roots under all stretchesRealRooted originalRealRooted.Schur.roots_repeatColumns_double_neg | Schur elementary-coordinate substitutions | source |
| ⊢theorem | Duplicating rows gives real-rooted families for every even moving coordinateRealRooted originalRealRooted.Schur.repeatColumns_double_isRealRooted | Schur elementary-coordinate substitutions | source |
| ⊢theorem | Dyck paths of semilength n with k peaks are Narayana-counted, except n = 1, k = 0DyckWord.card_semilength_peakCount | Narayana polynomials | source |
| ⊢theorem | E sends x(x − 1)⋯(x − n + 1) to n! xⁿRealRooted.brandenE_descPochhammer | Brändén's E transform | source |
| ⊢theorem | E_n^{(1)}(-q) > 0 whenever q > 0 and q 2^(n+1) ≤ 1RealRooted.eval_neg_generalizedEulerian_one_pos | Eulerian polynomials | source |
| ⊢theorem | Each candidate eigenspace is one-dimensionalRealRooted.Kostov.linearPart_eigenspace_line | Kostov's eigenpolynomials | source |
| ⊢theorem | Each Chow derangement polynomial is zero or real-rootedRealRooted.BrandenVecchi.chowDerangement_eq_zero_or_splits_of_isTotallyNonneg | Chow polynomials of totally nonnegative matrices | source |
| ⊢theorem | Each Chow polynomial is zero or real-rootedRealRooted.BrandenVecchi.chowPolynomial_eq_zero_or_splits_of_isTotallyNonneg | Chow polynomials of totally nonnegative matrices | source |
| ⊢theorem | Each coordinate interlaces the same coordinate after one stepMain resultRealRooted originalRealRooted.separatedCharacteristicRows_interl_succ | Recurrences with separated characteristic parameters | source |
| ≔definition | Edge-variable matching polynomialRealRooted.Graph.multivariateMatchingPolynomialByEdges | Same-phase stability for graph polynomials | source |
| ≔definition | Edge-weighted matching-generating polynomialRealRooted.Graph.weightedMatchingPolynomialByEdges | Heilmann–Lieb theorem | source |
| ⊢theorem | Edrei: a Pólya frequency sequence with a₀ = 1 has a canonical product representationMain resultRealRooted.EdreiThoma.exists_canonicalProduct_representation | Edrei–Thoma theorem | source |
| ≔definition | Eigenvalue candidates for the Schur–Szegő coefficient mapRealRooted.Kostov.eigenvalue | Kostov's eigenpolynomials | source |
| ≔definition | Eigenvalues of a Hermitian matrix in decreasing orderRealRooted.sortedEigenvalues | Courant–Fischer min-max theorem | source |
| ⊢theorem | Eigenvalues of a principal submatrix interlaceMain resultRealRooted.cauchy_interlacing | Cauchy interlacing | source |
| ≔definition | Eigenvalues of a symmetric matrix in increasing orderRealRooted.increasingEigenvalues | Jacobi deformation | source |
| ⊢theorem | Elementary skew Jacobi–Trudi matrices are totally nonnegativeRealRooted originalRealRooted.Schur.elementaryMatrix_isTotallyNonneg | Schur elementary-coordinate substitutions | source |
| ≔definition | Elementary-coordinate specialization defined by a determinantRealRooted.Schur.elementarySubstitution | Schur elementary-coordinate substitutions | source |
| ⊢theorem | Endpoint signs across a nonvanishing familyRealRooted.eval_endpoint_pos_of_forall_ne_zero | Continuity of roots | source |
| ⊢theorem | Endpoint-pair real-rootednessRealRooted.isRealRooted_of_endpoint_sum_then_X_pair_sequence | Interlacing for linear recurrences | source |
| ⊢theorem | Endpoint-pair strict interlacingRealRooted.strictInterl_endpoint_sum_then_X_pair_sequence | Interlacing for linear recurrences | source |
| ⊢theorem | Endpoint-power pair liftRealRooted.isRealRooted_of_endpoint_sum_then_X_pair_lift_sequence | Interlacing for linear recurrences | source |
| ⊢theorem | Eneström–Kakeya annulus for positive coefficientsPolynomial.norm_mem_Icc_of_isRoot_of_coeff_pos | Eneström–Kakeya theorem | source |
| ⊢theorem | Eneström–Kakeya: increasing coefficients give zeros in the unit diskMain resultPolynomial.norm_le_one_of_isRoot_of_coeff_monotone | Eneström–Kakeya theorem | source |
| ⊢theorem | Engström: weighted independence polynomials of claw-free graphs are real-rootedRealRooted.Graph.weightedIndepPoly_splits_of_clawFree | Heilmann–Lieb theorem | source |
| ⊢theorem | Equal degrees, no common root, real-rooted positive combinations: common interleaverRealRooted.pairHasCommonInterleaver_of_posCombo_sameDegree | Common interleavers and compatible families | source |
| ⊢theorem | Equal-degree positive-combination pairs: root counts above x differ by at most 1RealRooted.sameDegree_rootCountAbove_bounds_of_posCombo_noCommon | Common interleavers and compatible families | source |
| ⊢theorem | Euler bidiagonal steps preserve PF polynomialsRealRooted.IsPFPolynomial.eulerBidiagonal_step | Operators preserving interlacing | source |
| ⊢theorem | Euler factors preserve the PF property of the Pochhammer Jensen modelRealRooted.eulerPochhammerPolynomial_isPF | Pólya frequency polynomials from a hypergeometric coefficient ratio | source |
| ≔definition | Euler insertion operator E_{c,d}RealRooted.eulerInsertionStep | Eulerian-type polynomials | source |
| ≔definition | Euler numerator of a polynomial-value sequenceRealRooted.polynomialValueEulerNumerator | Pólya frequency sequences with polynomial tails | source |
| ⊢theorem | Euler-pencil stability is equivalent to root-sign admissibilityRealRooted.Poisson.isUpperHalfPlaneStablePencil_euler_iff_isAdmissible | Poisson star product | source |
| ⊢theorem | Euler-pencil stability is equivalent to signed-symbol stabilityRealRooted.Poisson.eulerPencil_stable_iff_signedSymbol_stable | Poisson star product | source |
| ⊢theorem | Eulerian polynomials are real-rootedRealRooted.isRealRooted_eulerianTilde | Eulerian polynomials | source |
| ≔definition | Eulerian transformation 1 ↦ 1, x^n ↦ x A_n(x)RealRooted.EulerianTransform.transform | Refined Hodge–Poincaré polynomials of uniform matroids | source |
| ≔definition | Evaluation arrays of symmetric real characteristic pencilsRealRooted.symmetricPencilEvaluationRange | Reduction of bivariate determinantal representations | source |
| ⊢theorem | Even rows: P_{2m}(t) = V_m(t^2)RealRooted originalRealRooted.parityRow_zero_two_mul | Hessenberg rows of TP2 matrices | source |
| ⊢theorem | Even-binomial Riordan rows split with nonpositive rootsRealRooted originalRealRooted.PFRiordan.evenBinomialRow_splits_and_roots_nonpos | Totally nonnegative left production matrices | source |
| ≔definition | Even-top descent polynomial of permutationsRealRooted.EulerianCompendium.evenTopDescentPolynomial | Eulerian-type polynomials | source |
| ⊢theorem | Even-top descent polynomials have negative roots that strictly alternateCoauthored paperRealRooted.EulerianCompendium.Challenges.evenTopDescent_strictAlternation | Eulerian-type polynomials | source |
| ⊢theorem | Eventual recurrences pass to every Veronese sectionLinearRecurrence.veronese_recurrence_of_eventually | Veronese sections | source |
| ⊢theorem | Every coordinate of every iterate of an ordered PF seed is a PF polynomialRealRooted originalRealRooted.separatedCharacteristicRows_isPFPolynomial | Recurrences with separated characteristic parameters | source |
| ⊢theorem | Every eigenvalue candidate has a nonzero eigenvectorRealRooted.Kostov.linearPart_hasEigenvector | Kostov's eigenpolynomials | source |
| ⊢theorem | Every f_{k,1} has simple rootsRealRooted originalRealRooted.hasSimpleRoots_hessenbergVector_zero | Hessenberg rows of TP2 matrices | source |
| ⊢theorem | Every Hoggatt polynomial is real-rooted, for all m ≥ 1RealRooted.Hoggatt.normalized_splits | Hoggatt polynomials | source |
| ⊢theorem | Every horizontal stretch is real-rooted under even boundary parityRealRooted originalRealRooted.Schur.repeatColumns_isRealRooted | Schur elementary-coordinate substitutions | source |
| ⊢theorem | Every horizontal stretch is real-rooted under odd boundary parityRealRooted originalRealRooted.Schur.repeatColumns_isRealRooted_of_odd | Schur elementary-coordinate substitutions | source |
| ⊢theorem | Every lower-unitriangular TNN matrix is a Whitney-elimination network path matrixRealRooted originalRealRooted.BrandenLeite.networkMatrix_resolutionLambda_eq | Chain polynomials of totally nonnegative matrices | source |
| ⊢theorem | Every multiplier sequence is a PF one up to signsRealRooted.IsMultiplierSequence.exists_pf_sign_normalization | Multiplier sequences | source |
| ⊢theorem | Every nonnegative split is bounded by the canonical pivotsRealRooted.canonicalSecondFactor_maximal | Totally nonnegative matrices | source |
| ⊢theorem | Every normalized eigenfunction of D_q in the downset is real stableMain resultRealRooted.LiuZhang.MvRealStable.morrisEigenfunction | Morris flow | source |
| ⊢theorem | Every reachable parameter pair (total Lah time, atoms) comes from a valid wordRealRooted originalRealRooted.TranslationLahParameters.exists_word | Basis transforms preserving real-rootedness and PF | source |
| ≔definition | Every real combination is real stable or zeroRealRooted.AllComboMvRealStableOrZero | Multivariate Hermite–Kakeya–Obreschkoff theorem | source |
| ≔definition | Every real combination is real-rooted or zeroRealRooted.AllComboRealRooted | Obreschkoff’s theorem | source |
| ⊢theorem | Every real combination of the gamma-pencil components is real-rootedRealRooted.gammaUV_allComboRealRooted | Gamma transform | source |
| ⊢theorem | Every real zero is positive for positive parametersRealRooted.Hypergeometric.isRoot_threeFTwo_pos | Terminating ₃F₂ polynomials | source |
| ⊢theorem | Every root lies in (0, 1)RealRooted.shiftedJacobi_isRoot_mem_Ioo | Jacobi polynomials | source |
| ⊢theorem | Every root of A_n is negativeRealRooted originalRealRooted.BigDescents321.neg_of_isRoot_bigDescentPoly | Big-descent polynomials of 321-avoiding permutations | source |
| ⊢theorem | Every root of p is a value A(x) / B(x) at a root x of the substitutionRealRooted originalRealRooted.exists_mem_eq_eval_div_of_isRoot | Rational substitutions | source |
| ⊢theorem | Every row has only simple rootsRealRooted originalRealRooted.ToeplitzPerturbation.hasSimpleRoots_row | Signed Toeplitz perturbations of the Chebyshev rows | source |
| ⊢theorem | Every row is real-rootedRealRooted originalRealRooted.ToeplitzPerturbation.splits_row | Signed Toeplitz perturbations of the Chebyshev rows | source |
| ⊢theorem | Every row is real-rootedRealRooted originalRealRooted.weightedThreeStateRow_isRealRooted | Weighted three-state recurrence | source |
| ⊢theorem | Every row of an admissible quartic state is PFRealRooted originalRealRooted.quarticInterlacingRow_isPFPolynomial | Ordered PF states for cubic and quartic recurrences | source |
| ⊢theorem | Every row of P(n+2) = θP(n+1) + Xθ P(n) with P(0) = 1, P(1) = X splitsRealRooted originalRealRooted.OperatorMatrix.EulerDerivativeLag.splits_of_recurrence_one_X | Operator matrices preserving ordered PF vectors | source |
| ⊢theorem | Every row of the cubic family is PFRealRooted originalRealRooted.cubicTransitionFamily_isPFPolynomial | Ordered PF states for cubic and quartic recurrences | source |
| ≔definition | Every row-generating polynomial is Pólya-frequencyRealRooted.LowerTriangularMatrix.RowGeneratingFunctionsPF | Narayana polynomials | source |
| ⊢theorem | Every signed rectangular specialization has negative rootsRealRooted originalRealRooted.Schur.roots_rectangularElementarySubstitution_neg | Schur elementary-coordinate substitutions | source |
| ⊢theorem | Every signed rectangular specialization is real-rootedRealRooted originalRealRooted.Schur.rectangularElementarySubstitution_isRealRooted | Schur elementary-coordinate substitutions | source |
| ⊢theorem | Every stage of the vector recursion is an interlacing sequenceRealRooted originalRealRooted.isInterlacingSeqNonneg_hessenbergVector | Hessenberg rows of TP2 matrices | source |
| ⊢theorem | Every-third subsequence of a cubic recurrence: the cubed-roots recurrenceRealRooted originalRealRooted.cubicRecurrence_residue_three | Ordered PF states for cubic and quartic recurrences | source |
| ⊢theorem | Exact coefficient and discriminant criterion for the grouped cubic (X + a)((X + b)² + w)RealRooted originalRealRooted.isPFPolynomial_touchard_linear_mul_quadratic_iff | Touchard transform | source |
| ⊢theorem | Exact entries of the matrix of multiplication by c² on the centered basisRealRooted originalRealRooted.CenteredEulerian.rMat_decomp | Zig-zag Eulerian polynomials | source |
| ⊢theorem | Exact Rayleigh criterion for a fresh affine extensionMvPolynomial.isRayleigh_add_X_mul_iff_of_fresh | Real stability | source |
| ⊢theorem | Exact source interval for an interval-operator basis mapRealRooted originalRealRooted.intervalBasisMap_maps_realRootedIn_iff | Basis transforms preserving real-rootedness and PF | source |
| ⊢theorem | Exact source ray for a ray-operator basis mapRealRooted originalRealRooted.rayBasisMap_maps_realRootedIn_iff | Basis transforms preserving real-rootedness and PF | source |
| ⊢theorem | Exactly 18 nondegenerate matrices preserve interlacingRealRooted.Atomic2x2Matrix.ncard_isNondegenerate_and_preservesInterlacing | Small matrices preserving interlacing sequences | source |
| ⊢theorem | Exactly the two alternating identity/Euler transitions preserve ordered PF vectorsRealRooted originalRealRooted.OperatorMatrix.PreservesOrderedPF.eulerDerivativeLag_transition_iff | Operator matrices preserving ordered PF vectors | source |
| ⊢theorem | Excedances of derangements are asymptotically normalRealRooted.tendsto_standardizedCoeffDistribution_sturmDerangementsExc | Central limit theorems for real-rooted coefficient distributions | source |
| ⊢theorem | Explicit parameter coefficients of the logarithmic rowsRealRooted originalRealRooted.BrandenLeite.coeff_affineLogCoeff_of_ne_zero | Chain polynomials of totally nonnegative matrices | source |
| ≔definition | Explicit section-matrix determinant in the coefficient variablePolynomial.veroneseNorm | Veronese sections | source |
| ≔definition | Exponential generating functionRealRooted.complexExpGeneratingFunction | Multiplier sequences | source |
| ⊢theorem | f interlaces ((x-a)(x-b)f)' when its roots lie in [a,b]RealRooted.strictInterl_derivative_endpointProduct | Interlacing and root intervals of endpoint-derivative sequences | source |
| ⊢theorem | f interlaces (x-a)(x-b)f' when its roots lie in [a,b]Main resultRealRooted.strictInterl_endpointDerivative | Interlacing and root intervals of endpoint-derivative sequences | source |
| ⊢theorem | f is real-rooted iff f′ is real-rooted and both Laguerre forms are nonnegativeMain resultRealRooted originalRealRooted.splits_iff_splits_derivative_and_forms_nonneg | Laguerre inequalities | source |
| ⊢theorem | f ≪ F when F f' ≤ 0 at the simple zeros of fRealRooted.strictInterl_of_eval_mul_derivative_nonpos | The Liu–Wang and Ma–Wang interlacing criteria | source |
| ⊢theorem | f ≪ F when g interlaces f without common zeros and F g ≤ 0 at the zeros of fRealRooted.strictInterl_of_interlaces_eval_mul_nonpos | The Liu–Wang and Ma–Wang interlacing criteria | source |
| ⊢theorem | f ≪ g gives f ≪ (x - r)g for equal degrees and all roots at least rRealRooted.StrictInterl.of_mul_X_sub_C_right_of_roots_ge | The f-polynomial transform | source |
| ⊢theorem | f' interlaces f - s whenever s lies between two real-rooted levelsRealRooted originalRealRooted.derivative_interlaces_sub_C_of_mem_Icc | Chebyshev level polynomials | source |
| ⊢theorem | F(n−1,m) strictly interlaces F(n,m) for n ≥ m ≥ 2RealRooted.Hoggatt.polynomial_pred_interlaces | Hoggatt polynomials | source |
| ⊢theorem | f_m(u) ≪ (x + 1) f_m(v) gives f_k(u) ≪ f_{k+1}(v) for k ≥ mRealRooted.StrictInterl.fPolynomial_pad_of_mul_X_add_one | The f-polynomial transform | source |
| ⊢theorem | f_{m,1} and f_{m+1,q+1} have no common rootRealRooted originalRealRooted.not_isRoot_parityVector_zero_succ_index | Hessenberg rows of TP2 matrices | source |
| ⊢theorem | Factor certificate for the characteristic polynomial of every-third subsequencesRealRooted originalRealRooted.cubicCharacteristic_mul_certificate | Ordered PF states for cubic and quartic recurrences | source |
| ≔definition | Factorial Hadamard productRealRooted.factorialHadamardProduct | Hadamard products and Schur–Szegő composition | source |
| ≔definition | Factorial-compression operatorRealRooted.FactorialCompression.compression | Descent polynomials of separable permutations | source |
| ⊢theorem | Factorization of a reciprocal shiftRealRooted.reciprocalShift_eq_X_pow_mul_reverse | Reciprocal shifts and interlacing | source |
| ≔definition | Falling factorialsRealRooted.fallingFactorialPolynomial | Narayana polynomials | source |
| ⊢theorem | Falling-factorial coefficients alternate in signRealRooted.neg_one_pow_mul_descPochhammerBasis_repr_nonneg | Mesh and finite differences | source |
| ⊢theorem | Falling-factorial truncation preserves real-rootednessRealRooted.splits_fallingSchur | Falling-factorial truncations | source |
| ≔definition | Families reachable from the base familyRealRooted.Applications.PeakPolynomials.PeakFamily.IsReachable | Peak polynomials on Ferrers boards | source |
| ≔definition | Favard three-term recurrenceRealRooted.SatisfiesFavardRecurrence | Favard recurrences: real roots, interlacing and orthogonality | source |
| ⊢theorem | Ferrers deletion recurrenceRealRooted.Permanent.ferrersPermanent_eq_recurrenceRhs | Monotone column permanent theorem | source |
| ≔definition | Ferrers matrixMatrix.IsFerrers | Monotone column permanent theorem | source |
| ⊢theorem | Ferrers permanents are real stableRealRooted.Permanent.ferrersPermanent_mvRealStable | Monotone column permanent theorem | source |
| ⊢theorem | Ferromagnetic Ising partition functionRealRooted.LeeYang.ising_norm_eq_one | Lee–Yang circle theorem | source |
| ⊢theorem | Filtered finite check: vanishing of the first h·k terms sufficesMain resultRealRooted originalRealRooted.FilteredOperator.apply_eq_zero_iff | Finite certificates for differential recurrences | source |
| ≔definition | Filtered operator built from shift, index multiplication and differentiationRealRooted.FilteredOperator | Finite certificates for differential recurrences | source |
| ⊢theorem | Finite canonical prefixes are Pólya-frequencyRealRooted.EdreiThoma.isPolyaFreqSeries_canonicalPrefixProduct | Edrei–Thoma theorem | source |
| ≔definition | Finite free additive convolutionRealRooted.finiteFreeAdditiveConvolution | Finite free convolutions | source |
| ⊢theorem | Finite free additive convolution preserves multivariate real stabilityRealRooted.finiteFreeAdditiveConvolutionAt_realStableOrZero | Finite free convolutions | source |
| ≔definition | Finite free multiplicative convolutionRealRooted.finiteFreeMultiplicativeConvolution | Finite free convolutions | source |
| ⊢theorem | Finite linear product sequencesRealRooted.finiteLinearProductSequence_realRooted | Interlacing for linear recurrences | source |
| ≔definition | Finite multiplier sequenceRealRooted.IsFiniteMultiplierSequence | Multiplier sequences | source |
| ≔definition | Finite PF multiplier sequenceRealRooted.IsFinitePFMultiplierSequence | Multiplier sequences | source |
| ⊢theorem | Finite PF multipliers preserve directed interlacingMain resultRealRooted.IsFinitePFMultiplierSequence.interl_diagonalOperator | Diagonal operators of PF multiplier sequences and interlacing | source |
| ⊢theorem | Finite PF multipliers preserve ordered PF listsRealRooted.IsInterlacingSeq0NonnegRealRooted.diagonalOperator_of_finitePF | Diagonal operators of PF multiplier sequences and interlacing | source |
| ⊢theorem | Finite products of linear factorsRealRooted.isRealRooted_finset_prod_X_sub_C | Interlacing for linear recurrences | source |
| ⊢theorem | Finite Pólya–Schur theoremRealRooted.Hadamard.finiteMultiplierSequence_iff_jensen_isPFPolynomial | Hadamard products and Schur–Szegő composition | source |
| ⊢theorem | Finite Pólya–Schur theorem, alternating signsRealRooted.isFiniteMultiplierSequence_iff_jensenPolynomial_roots_nonneg | Hadamard products and Schur–Szegő composition | source |
| ⊢theorem | Finite rational products have Pólya frequency coefficientsRealRooted originalRealRooted.PFRiordan.rationalPFCoeff_isPolyaFreqSeq | Totally nonnegative left production matrices | source |
| ⊢theorem | Finite words of translations and Lah flows with nonnegative parameters preserve PFRealRooted originalRealRooted.translationLahWordTransform_isPFPolynomial | Basis transforms preserving real-rootedness and PF | source |
| ⊢theorem | Finitely supported c with a real-rooted signed symbol: p_N is real-rooted for every NRealRooted originalRealRooted.splits_evenDerivativeTest_of_splits_symbol | Finite-degree tests for differential operators | source |
| ≔definition | First Laguerre form L₁ f = f′² − f f''RealRooted.laguerreForm | Laguerre inequalities | source |
| ⊢theorem | First-derivative transport through a homogeneous substitutionRealRooted originalRealRooted.homogenizedSubstitution_firstDerivative | Rational substitutions | source |
| ⊢theorem | First-kind rows are Pólya-frequency polynomials for z ≥ −1RealRooted.JacobiStirling.firstKindRow_isPFPolynomial | Jacobi–Stirling numbers | source |
| ⊢theorem | First-maximum recurrence for weak alternating wordsRealRooted.ZigzagEulerian.weakUpDownWordCount_recurrence | Zig-zag Eulerian polynomials | source |
| ≔definition | First-order form 2ay' + byPolynomial.Sonin.lin | Sonin envelopes | source |
| ⊢theorem | Five interlacing conditions on p = a + xb are equivalentMain resultRealRooted.BrandenSolus.strictInterl_iff_of_isIdDecomposition | Interlacing and real roots under symmetric decompositions | source |
| ⊢theorem | Five-way classification for positive affine Poisson recurrencesRealRooted.Poisson.poisson_affine_recurrence_strict | Poisson star product | source |
| ⊢theorem | Fixed delay L: rows A and B interlace when A ≤ B ≤ A + LRealRooted.strictInterl_of_fixedDelay_recurrence | Interlacing for linear recurrences | source |
| ⊢theorem | Fixed derivatives have roots in any interval containing a and the roots of qRealRooted.roots_iterate_derivative_mul_X_sub_C_pow_mem_Icc | Interlacing for linear recurrences | source |
| ⊢theorem | Fixed derivatives of q (X - a)^n and q (X - a)^(n+1) interlaceRealRooted.strictInterl_iterate_derivative_mul_X_sub_C_pow_succ | Interlacing for linear recurrences | source |
| ⊢theorem | Fixed derivatives of q (X - a)^n are real-rooted with positive leading coefficientRealRooted.iterate_derivative_mul_X_sub_C_pow_standard | Interlacing for linear recurrences | source |
| ⊢theorem | Fixed Schur–Szegő composition maps root rays, allowing zero outputRealRooted.IsRealRootedIn.maps_schurSzegoComp_Icc_zero | Hadamard products and Schur–Szegő composition | source |
| ⊢theorem | Fixed Schur–Szegő composition maps strict root intervalsRealRooted.IsRealRootedIn.maps_schurSzegoComp_Icc | Hadamard products and Schur–Szegő composition | source |
| ⊢theorem | Fixed Schur–Szegő composition postcomposes a polynomial-sequence operatorRealRooted.basisTransformₗ_schurSzegoComp | Hadamard products and Schur–Szegő composition | source |
| ⊢theorem | Fixed-delay recurrences started from a constant prefix: interlacing of rowsRealRooted.strictInterl_of_constant_prefix_fixed_delay_recurrence | Interlacing for linear recurrences | source |
| ⊢theorem | Fixed-factor criterion: preservation holds iff g is real-rooted with w ≤ 0 on its rootsMain resultRealRooted.assocProduct_kernel_tfae | Associative derivative products with a fixed factor | source |
| ⊢theorem | For 0 < δ < 1 the roots are simple, interlace J′_{m,0} and share no root with itRealRooted originalRealRooted.JacobiDeformation.interlaces_derivative_polynomial_zero | Jacobi deformation | source |
| ⊢theorem | For 5ρ² < 8 the orbit has non-real roots in all large ranksRealRooted originalRealRooted.IsQuadraticDifferentialOrbit.exists_forall_exists_nonreal_root | Second-order differential operators preserving PF polynomials | source |
| ⊢theorem | For a > 0 the image keeps the degree n and the input interlaces itRealRooted.intervalEulerOperator_degree_pos_strictInterl | The f-polynomial transform | source |
| ⊢theorem | For a split p, the substitution is lc(p) times the product of A - r B over the roots rRealRooted originalRealRooted.rationalSubstitution_eq_prod_of_splits | Rational substitutions | source |
| ⊢theorem | For a, b > -1 the family is Pólya frequencyRealRooted.jacobiCoefficientPolynomial_isPFPolynomial | Jacobi polynomials | source |
| ⊢theorem | For a, b, t ≥ 0 the ray semigroup maps PF polynomials to PF polynomialsRealRooted originalRealRooted.raySemigroupTransform_isPFPolynomial | Basis transforms preserving real-rootedness and PF | source |
| ⊢theorem | For an associative product, S_g(p q) = S_g(p) ⋆ S_g(q)RealRooted originalRealRooted.derivProductPowMap_mul | Poisson star product | source |
| ⊢theorem | For c = (1, 1, 1, 0, …) the operator preserves PF polynomials through degree fourRealRooted originalRealRooted.IsPFPolynomial.evenDerivativeCapTwo_of_natDegree_le_four | Finite-degree tests for differential operators | source |
| ⊢theorem | For c = (1, 1, 1, 0, …) Δ_c(x⁵) is not real-rooted: preservation fails in degree fiveRealRooted originalRealRooted.not_splits_evenDerivativeOperator_capTwo_X_pow_five | Finite-degree tests for differential operators | source |
| ⊢theorem | For c = (1, 1, 1, 0, …): Δ_c(x⁴) = x²(x² + 12x + 24)RealRooted originalRealRooted.evenDerivativeOperator_capTwo_X_pow_four | Finite-degree tests for differential operators | source |
| ⊢theorem | For c = (1, 1, 1, 0, …): Δ_c(x⁵) = x³(x² + 20x + 120)RealRooted originalRealRooted.evenDerivativeOperator_capTwo_X_pow_five | Finite-degree tests for differential operators | source |
| ⊢theorem | For c = (1, 2, 1, 0, …) the images of (x + 1)³ and (x + 1)⁴ interlaceRealRooted originalRealRooted.strictInterl_evenDerivativeOperator_square_X_add_one_pow | Finite-degree tests for differential operators | source |
| ⊢theorem | For c = (1, 2, 1, 0, …), f + 2x f'' + x² f^(4) preserves PF polynomials in every degreeRealRooted originalRealRooted.isPFPolynomial_evenDerivativeOperator_square | Finite-degree tests for differential operators | source |
| ⊢theorem | For c > 0, E_n^{(c)} interlaces E_{n+1}^{(c)}Main resultRealRooted.interlaces_generalizedEulerian_succ | Eulerian polynomials | source |
| ⊢theorem | For c > 0, E_n^{(c)} is real-rootedRealRooted.generalizedEulerian_splits | Eulerian polynomials | source |
| ⊢theorem | For d >= 2 and det A > 0: simple positive roots, no common roots of consecutive rowsRealRooted originalRealRooted.hessenbergRow_strict | Hessenberg rows of TP2 matrices | source |
| ⊢theorem | For d ≥ 2 and a positive coordinate, the image lies between A_d and d_dRealRooted.DerangementTransform.transform_magicExpansion_strictInterl | Interlacing and real roots under symmetric decompositions | source |
| ⊢theorem | For deg f ≤ m: f ⊞_D g = f ⊞_m (m!/D!) g^(D−m)RealRooted.finiteFreeAdditiveConvolution_eq_lowerDegree | Finite free convolutions | source |