Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of basis_map_A013611 of Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
- Premises
- basis_map_A013611 of Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013611 of Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-dfb72fb5d4e3c7a6· 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" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-25650d88b59288ee10b1e0f8a7bdc74f773307ff70d9675d271013d0fcee80b275a, 11,692 bytes (2,959 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-206b227355e1bd60(real_rooted)n-206b227355e1bd60(one_signed_coefficients)n-206b227355e1bd60(hadamard_kernel)n-206b227355e1bd60(interlacing)