Poisson star product

Multiplication by a fixed polynomial $f$ in the Poisson star product $\star_c$ preserves Pólya frequency polynomials exactly when $f$ is Pólya frequency (for $c\ge0$) or a nonnegative constant (for $c<0$). For an associative derivative product $\star$, the root location of the images of the map $t^n\mapsto g^{\star n}$ is decided by the one-factor levels $g-r$.

Results

For $c\in\mathbb R$ let $$ f\star_c g=\sum_{j\ge0}\frac{c^j}{j!}\,x^jf^{(j)}g^{(j)}. $$ This product is symmetric, associative and bilinear, has unit $1$, and equals the ordinary product at $c=0$. A polynomial is PF if it has nonnegative coefficients and is zero or has only real nonpositive roots.

Theorem (fixed PF factors). Let $c\in\mathbb R$. Then $f\star_cg$ is PF for every PF polynomial $g$ if and only if $f$ is PF, when $c\ge0$, and if and only if $f$ is a nonnegative constant, when $c<0$.

Theorem (real-rootedness preservers). Let $f\ne0$. The following are equivalent:

  1. $f\star_cg$ is zero or real-rooted for every real-rooted $g$;
  2. $f\star_c(a+bx)$ is real-rooted for all real $a,b$;
  3. $f$ is real-rooted and $cr\le0$ for every root $r$ of $f$;
  4. the Euler pencil $x\,(f+cf')+yf$ is stable in the upper half-plane;
  5. the signed Weyl symbol $f\bigl(z(1-cw)\bigr)$ is stable.

Theorem (product powers). Let $\star$ be an associative derivative product $f\star g=\sum_k\lambda_k\,\omega^kf^{(k)}g^{(k)}$ with $\omega=Ax^2+Bx+C$, $A\ge0$, $s>0$ and $\lambda_k=s^k/\bigl(k!\prod_{j<k}(1+sAj)\bigr)$; the Poisson product $\star_s$ is the case $\omega=x$. For a polynomial $g$ let $S_g$ be the linear map with $S_g(t^n)=g^{\star n}$, and call a polynomial rooted in a set if it is nonzero, real-rooted and has all its roots in that set.

Further results give the degree and leading coefficient of $S_g(p)$, the case $\omega\le0$ on $\mathbb R$, where real-rootedness of the levels $g-r$ suffices, and the affine recurrences $P_{n+1}=(a_n+b_nx)P_n+c\,b_nxP_n'$ with $c,a_n,b_n>0$, whose rows are PF with simple negative roots and interlace without common roots.

Use

The fixed-factor family of derivative products is classified on the derivative product kernel page, and the Touchard transform turns products into Poisson products.

Proof

For $c\ge0$, sufficiency is Brändén's theorem [Bra06, Theorem 3.11]. The falling-factorial transform $\Phi_c$ with step $c$ satisfies $\Phi_c(f\star_cg)=\Phi_c(f)\,\Phi_c(g)$, which gives associativity, and a root $r$ with $cr>0$ is excluded by $(x-r)\star_c(x-r-c)=(x-r)^2+cr$. For product powers, $S_g\bigl((t-r)p\bigr)=(g-r)\star S_g(p)$ reduces the claim to the levels $g-r$; on an interval all levels share the derivative $g'$, so the two endpoint levels control the others.

References

  1. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8), 3697-3716, 2006.
    BibTeX
    @article{Branden2006,
      title = {On linear transformations preserving the {P}{\'{o}}lya frequency property},
      volume = {358},
      ISSN = {1088-6850},
      url = {http://dx.doi.org/10.1090/S0002-9947-06-03856-6},
      DOI = {10.1090/s0002-9947-06-03856-6},
      number = {8},
      journal = {Transactions of the American Mathematical Society},
      publisher = {American Mathematical Society (AMS)},
      author = {Br{\"a}nd{\'e}n, Petter},
      year = {2006},
      month = feb,
      pages = {3697--3716}
    }

Definitions

  • The product power g^{⋆n} of a derivative product

    RealRooted.derivProductPowsource
    def derivProductPow (w : ℝ[X]) (c : ℕ → ℝ) (g : ℝ[X]) (n : ℕ) : ℝ[X] :=
      (derivProductLinearMap w c g ^ n) 1
  • The linear map S_g sending t^n to the product power g^{⋆n}

    RealRooted.derivProductPowMapsource
    def derivProductPowMap (w : ℝ[X]) (c : ℕ → ℝ) (g : ℝ[X]) : ℝ[X] →ₗ[ℝ] ℝ[X] :=
      basisTransformₗ (derivProductPow w c g)
  • The map S_g for the Poisson product

    RealRooted.Poisson.starCPowMapsource
    abbrev starCPowMap (c : ℝ) (g : ℝ[X]) : ℝ[X] →ₗ[ℝ] ℝ[X] :=
      derivProductPowMap X (fun k : ℕ ↦ c ^ k / (k.factorial : ℝ)) g

Theorems

  • The univariate Poisson product is symmetric

    RealRooted.Poisson.starC_commsource
    theorem starC_comm (c : ℝ) (f g : ℝ[X]) :
        starC c f g = starC c g f
  • Formula for affine right inputs

    RealRooted.Poisson.starC_affine_rightsource
    theorem starC_affine_right (c a b : ℝ) (f : ℝ[X]) :
        starC c f (C a + C b * X) =
          C a * f + C b * X * (f + C c * f.derivative)
  • Nonnegative inputs give nonnegative coefficients

    RealRooted.Poisson.starC_nonnegsource
    theorem starC_nonneg {c : ℝ} (hc : 0 ≤ c) {f g : ℝ[X]}
        (hf : HasNonnegCoeffs f) (hg : HasNonnegCoeffs g) :
        HasNonnegCoeffs (starC c f g)
  • Affine test for a single linear factor

    RealRooted.Poisson.PreservesAffineRealRooted.linear_iffsource
    theorem PreservesAffineRealRooted.linear_iff (c r : ℝ) :
        PreservesAffineRealRooted c (X - C r) ↔ c * r ≤ 0
  • A root of the wrong sign obstructs real-rootedness

    RealRooted.Poisson.starC_root_obstruction_not_splitssource
    theorem starC_root_obstruction_not_splits {c r : ℝ} (hcr : 0 < c * r) :
        ¬(starC c (X - C r) (X - C (r + c))).Splits
  • Signed-symbol stability from the root-sign condition

    RealRooted.Poisson.poissonSignedSymbol_stablesource
    theorem poissonSignedSymbol_stable {c : ℝ} {f : ℝ[X]} (hf : f ≠ 0)
        (hfs : f.Splits) (hroot : ∀ r ∈ f.roots, c * r ≤ 0) :
        MvUpperHalfPlaneStable (poissonSignedSymbol c f)
  • PF preservers at a negative parameter

    RealRooted.Poisson.PreservesPF.iff_of_negsource
    theorem PreservesPF.iff_of_neg {c : ℝ} (hc : c < 0) (f : ℝ[X]) :
        PreservesPF c f ↔ ∃ a : ℝ, 0 ≤ a ∧ f = C a
  • Real-rootedness preservers at parameter zero

    RealRooted.PreservesRealRootedOrZero.poissonStar_zero_iffsource
    theorem _root_.RealRooted.PreservesRealRootedOrZero.poissonStar_zero_iff {f : ℝ[X]} (hf : f ≠ 0) :
        PreservesRealRootedOrZero (starCLinearMap 0 f) ↔ f.Splits
  • PF preservers at parameter zero

    RealRooted.Poisson.PreservesPF.zero_iffsource
    theorem PreservesPF.zero_iff (f : ℝ[X]) :
        PreservesPF 0 f ↔ IsPFPolynomial f
  • Complete PF-preserver classification for every parameterMain result

    RealRooted.Poisson.PreservesPF.iffsource
    theorem PreservesPF.iff (c : ℝ) (f : ℝ[X]) :
        PreservesPF c f ↔
          if 0 ≤ c then IsPFPolynomial f
          else ∃ a : ℝ, 0 ≤ a ∧ f = C a
  • Real-rootedness preservation is equivalent to Euler-pencil stability

    RealRooted.Poisson.realRootedOrZero_iff_eulerPencil_stablesource
    theorem realRootedOrZero_iff_eulerPencil_stable
        {c : ℝ} {f : ℝ[X]} (hf0 : f ≠ 0) :
        PreservesRealRootedOrZero (starCLinearMap c f) ↔
          IsUpperHalfPlaneStablePencil (X * (f + C c * f.derivative)) f
  • Affine preservation is equivalent to Euler-pencil stability

    RealRooted.Poisson.affineRealRooted_iff_eulerPencil_stablesource
    theorem affineRealRooted_iff_eulerPencil_stable
        {c : ℝ} {f : ℝ[X]} (hf0 : f ≠ 0) :
        PreservesAffineRealRooted c f ↔
          IsUpperHalfPlaneStablePencil (X * (f + C c * f.derivative)) f
  • Euler-pencil stability is equivalent to root-sign admissibility

    RealRooted.Poisson.isUpperHalfPlaneStablePencil_euler_iff_isAdmissiblesource
    theorem isUpperHalfPlaneStablePencil_euler_iff_isAdmissible
        {c : ℝ} {f : ℝ[X]} (hf0 : f ≠ 0) :
        IsUpperHalfPlaneStablePencil (X * (f + C c * f.derivative)) f ↔
          IsAdmissible c f
  • Euler-pencil stability is equivalent to signed-symbol stability

    RealRooted.Poisson.eulerPencil_stable_iff_signedSymbol_stablesource
    theorem eulerPencil_stable_iff_signedSymbol_stable
        {c : ℝ} {f : ℝ[X]} (hf0 : f ≠ 0) :
        IsUpperHalfPlaneStablePencil (X * (f + C c * f.derivative)) f ↔
          MvUpperHalfPlaneStable (poissonSignedSymbol c f)
  • Five-way classification for positive affine Poisson recurrences

    RealRooted.Poisson.poisson_affine_recurrence_strictsource
    theorem poisson_affine_recurrence_strict
        {c : ℝ} {a b : ℕ → ℝ} {P : ℕ → ℝ[X]}
        (hc : 0 < c) (ha : ∀ n, 0 < a n) (hb : ∀ n, 0 < b n)
        (hP0 : P 0 = 1)
        (hrec : ∀ n, P (n + 1) =
          (C (a n) + C (b n) * X) * P n +
            C (c * b n) * X * (P n).derivative) (n : ℕ) :
        IsPFPolynomial (P n) ∧ HasSimpleRoots (P n) ∧
          (∀ r, (P n).IsRoot r → r < 0) ∧ StrictInterl (P n) (P (n + 1)) ∧
            ∀ r, (P n).IsRoot r → ¬ (P (n + 1)).IsRoot r
  • The falling-factorial transform is multiplicative for the Poisson product

    RealRooted.Poisson.fallingFactorialTransform_starCsource
    theorem fallingFactorialTransform_starC (c : ℝ) (f g : ℝ[X]) :
        fallingFactorialTransform c (starC c f g) =
          fallingFactorialTransform c f * fallingFactorialTransform c g
  • Associativity of the univariate Poisson product

    RealRooted.Poisson.starC_assocsource
    theorem starC_assoc (c : ℝ) (f g h : ℝ[X]) :
        starC c (starC c f g) h = starC c f (starC c g h)
  • Functional calculus: S_g((t − r) p) = (g − r) ⋆ S_g(p)RealRooted original

    RealRooted.derivProductPowMap_X_sub_C_mulsource
    theorem derivProductPowMap_X_sub_C_mul (hc0 : c 0 = 1) (r : ℝ) (p : ℝ[X]) :
        derivProductPowMap w c g ((X - C r) * p) =
          derivProduct w c (g - C r) (derivProductPowMap w c g p)
  • For an associative product, S_g(p q) = S_g(p) ⋆ S_g(q)RealRooted original

    RealRooted.derivProductPowMap_mulsource
    theorem derivProductPowMap_mul (p q : ℝ[X]) :
        derivProductPowMap w c g (p * q) =
          derivProduct w c (derivProductPowMap w c g p) (derivProductPowMap w c g q)
  • Levels rooted in a ⋆-closed class give images rooted in that classRealRooted original

    RealRooted.isRealRootedIn_derivProductPowMapsource
    theorem isRealRootedIn_derivProductPowMap (hc0 : c 0 = 1) {T J : Set ℝ}
        (hclosed : ∀ f q : ℝ[X], IsRealRootedIn T f → IsRealRootedIn T q →
          IsRealRootedIn T (derivProduct w c f q))
        (hg : ∀ r ∈ J, IsRealRootedIn T (g - C r)) {p : ℝ[X]} (hp : IsRealRootedIn J p) :
        IsRealRootedIn T (derivProductPowMap w c g p)
  • Source-interval reduction to the one-factor levels g − rRealRooted original

    RealRooted.forall_isRealRootedIn_derivProductPowMap_iffsource
    theorem forall_isRealRootedIn_derivProductPowMap_iff (hc0 : c 0 = 1) {T J : Set ℝ}
        (hclosed : ∀ f q : ℝ[X], IsRealRootedIn T f → IsRealRootedIn T q →
          IsRealRootedIn T (derivProduct w c f q)) :
        (∀ p : ℝ[X], IsRealRootedIn J p → IsRealRootedIn T (derivProductPowMap w c g p)) ↔
          ∀ r ∈ J, IsRealRootedIn T (g - C r)
  • The image of a real-rooted input has degree deg(p) deg(g)RealRooted original

    RealRooted.natDegree_derivProductPowMapsource
    theorem natDegree_derivProductPowMap (hg : g.natDegree ≠ 0) {S : Set ℝ} {p : ℝ[X]}
        (hp : IsRealRootedIn S p) :
        derivProductPowMap w c g p ≠ 0 ∧
          (derivProductPowMap w c g p).natDegree = p.natDegree * g.natDegree
  • Leading coefficient of the image for a weight with vanishing quadratic partRealRooted original

    RealRooted.leadingCoeff_derivProductPowMapsource
    theorem leadingCoeff_derivProductPowMap (hg : g.natDegree ≠ 0) (hA0 : w.coeff 2 = 0)
        {S : Set ℝ} {p : ℝ[X]} (hp : IsRealRootedIn S p) :
        (derivProductPowMap w c g p).leadingCoeff = p.leadingCoeff * g.leadingCoeff ^ p.natDegree
  • If two constant levels of g split, every intermediate level splitsRealRooted original

    RealRooted.splits_sub_C_of_mem_Iccsource
    theorem splits_sub_C_of_mem_Icc {f : ℝ[X]} {a b s : ℝ} (hdeg : f.natDegree ≠ 0)
        (hs : s ∈ Icc a b) (ha_splits : (f - C a).Splits) (hb_splits : (f - C b).Splits) :
        (f - C s).Splits
  • Polynomials rooted in (−∞, 0] are closed under the Poisson productRealRooted original

    RealRooted.Poisson.isRealRootedIn_Iic_starCsource
    theorem isRealRootedIn_Iic_starC {c : ℝ} (hc : 0 ≤ c) {f g : ℝ[X]}
        (hf : IsRealRootedIn (Iic 0) f) (hg : IsRealRootedIn (Iic 0) g) :
        IsRealRootedIn (Iic 0) (starC c f g)
  • Two endpoint levels rooted in (−∞, 0] give all intermediate levelsRealRooted original

    RealRooted.Poisson.isRealRootedIn_Iic_sub_C_of_mem_Iccsource
    theorem isRealRootedIn_Iic_sub_C_of_mem_Icc {g : ℝ[X]} (hg : g.natDegree ≠ 0) {a b r : ℝ}
        (hr : r ∈ Icc a b) (ha : IsRealRootedIn (Iic 0) (g - C a))
        (hb : IsRealRootedIn (Iic 0) (g - C b)) : IsRealRootedIn (Iic 0) (g - C r)
  • Poisson powers map [a, b]-rooted inputs to (−∞, 0]-rooted outputs iff both ends doRealRooted original

    RealRooted.Poisson.forall_isRealRootedIn_starCPowMap_Icc_iffsource
    theorem forall_isRealRootedIn_starCPowMap_Icc_iff {c : ℝ} (hc : 0 ≤ c) {g : ℝ[X]}
        (hg : g.natDegree ≠ 0) {a b : ℝ} (hab : a ≤ b) :
        (∀ p : ℝ[X], IsRealRootedIn (Icc a b) p → IsRealRootedIn (Iic 0) (starCPowMap c g p)) ↔
          IsRealRootedIn (Iic 0) (g - C a) ∧ IsRealRootedIn (Iic 0) (g - C b)
  • The same criterion, degree by degreeRealRooted original

    RealRooted.Poisson.forall_mapsRealRootedIn_starCPowMap_Icc_iffsource
    theorem forall_mapsRealRootedIn_starCPowMap_Icc_iff {c : ℝ} (hc : 0 ≤ c) {g : ℝ[X]}
        (hg : g.natDegree ≠ 0) {a b : ℝ} (hab : a ≤ b) :
        (∀ n, MapsRealRootedIn (starCPowMap c g) n (Icc a b) (Iic 0)) ↔
          IsRealRootedIn (Iic 0) (g - C a) ∧ IsRealRootedIn (Iic 0) (g - C b)
  • Degree and leading coefficient of the Poisson sequence mapRealRooted original

    RealRooted.Poisson.natDegree_leadingCoeff_starCPowMapsource
    theorem natDegree_leadingCoeff_starCPowMap {c : ℝ} (hc : 0 ≤ c) {g : ℝ[X]}
        (hg : g.natDegree ≠ 0) {S : Set ℝ} {p : ℝ[X]} (hp : IsRealRootedIn S p) :
        starCPowMap c g p ≠ 0 ∧ (starCPowMap c g p).natDegree = p.natDegree * g.natDegree ∧
          (starCPowMap c g p).leadingCoeff = p.leadingCoeff * g.leadingCoeff ^ p.natDegree
  • Self-product lemma: (q ⋆ q)(x) > 0 wherever the weight is positiveRealRooted original

    RealRooted.eval_assocProduct_self_possource
    theorem eval_assocProduct_self_pos (ha : 0 < a) (hA : 0 ≤ w.coeff 2) (hq : q ≠ 0) {x : ℝ}
        (hx : 0 < w.eval x) : 0 < (assocProduct a w q q).eval x
  • A real-rooted self-product has all its roots in {w ≤ 0}RealRooted original

    RealRooted.isRealRootedIn_of_splits_assocProduct_selfsource
    theorem isRealRootedIn_of_splits_assocProduct_self (ha : 0 < a) (hw : w.natDegree ≤ 2)
        (hA : 0 ≤ w.coeff 2) (hq : q ≠ 0) (hs : (assocProduct a w q q).Splits) :
        IsRealRootedIn {r | w.eval r ≤ 0} (assocProduct a w q q)
  • The square of left multiplication preserves real-rootedness iff q ⋆ q is real-rootedRealRooted original

    RealRooted.assocProduct_self_splits_iffsource
    theorem assocProduct_self_splits_iff (ha : 0 < a) (hw : w.natDegree ≤ 2) (hA : 0 ≤ w.coeff 2)
        (hq : q ≠ 0) :
        (assocProduct a w q q).Splits ↔ ∀ p : ℝ[X], IsRealRootedIn univ p →
          IsRealRootedIn univ (assocProduct a w q (assocProduct a w q p))
  • All product powers are real-rooted iff q and q ⋆ q areRealRooted original

    RealRooted.forall_isRealRootedIn_derivProductPow_iffsource
    theorem forall_isRealRootedIn_derivProductPow_iff (ha : 0 < a) (hw : w.natDegree ≤ 2)
        (hA : 0 ≤ w.coeff 2) (hq : q ≠ 0) :
        (∀ n : ℕ, IsRealRootedIn univ (derivProductPow w (assocCoeff a (w.coeff 2)) q n)) ↔
          q.Splits ∧ (assocProduct a w q q).Splits
  • A singleton source root is tested by g − r and (g − r) ⋆ (g − r)RealRooted original

    RealRooted.forall_isRealRootedIn_derivProductPowMap_singleton_iffsource
    theorem forall_isRealRootedIn_derivProductPowMap_singleton_iff (ha : 0 < a)
        (hw : w.natDegree ≤ 2) (hA : 0 ≤ w.coeff 2) {g : ℝ[X]} {r : ℝ} (hgr : g - C r ≠ 0) :
        (∀ p : ℝ[X], IsRealRootedIn {r} p →
          IsRealRootedIn univ (derivProductPowMap w (assocCoeff a (w.coeff 2)) g p)) ↔
          (g - C r).Splits ∧ (assocProduct a w (g - C r) (g - C r)).Splits
  • If w ≤ 0 on ℝ, the one-factor levels decide every source setRealRooted original

    RealRooted.derivProductPowMap_realRooted_iff_of_nonpossource
    theorem derivProductPowMap_realRooted_iff_of_nonpos (ha : 0 < a)
        (hw : w.natDegree ≤ 2) (hA : 0 ≤ w.coeff 2) (hW : ∀ x : ℝ, w.eval x ≤ 0) {J : Set ℝ}
        {g : ℝ[X]} :
        (∀ p : ℝ[X], IsRealRootedIn J p →
          IsRealRootedIn univ (derivProductPowMap w (assocCoeff a (w.coeff 2)) g p)) ↔
          ∀ r ∈ J, IsRealRootedIn univ (g - C r)

Lean source RealRooted/Challenges/Preservers/UnivariatePoissonStar.lean at revision d6670742. Formalized 2026-10-12.