Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of 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
- 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).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- 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).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-6855597ed29b7ff8· 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-2562246faddb4e91a32e4fec63f59e89615a34d764d6ecf46bec844be351fa38253, 26,709 bytes (4,647 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-98e164af94aad52d(real_rooted)n-98e164af94aad52d(one_signed_coefficients)n-98e164af94aad52d(hadamard_kernel)