Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
- Premises
- Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-ddd00fc1a4f23d2e· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-256499f45f3c9e6dea7ed6d37a45afed96d02746383e20a948da90ecce5595d6f08, 8,212 bytes (2,266 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-8159f24e9c9fb552(real_rooted)n-8159f24e9c9fb552(one_signed_coefficients)n-8159f24e9c9fb552(hadamard_kernel)