Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of reversal of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
- Premises
- reversal of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- reversal of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-cf2481f3b4c8561c· 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": 1, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-2562ed40cd5abc8e147b99b3e2a09a763b4a3f4ee49d9a982c99f671236e390b669, 9,948 bytes (2,630 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-ab6ae8e31e413a35(real_rooted)n-ab6ae8e31e413a35(one_signed_coefficients)n-ab6ae8e31e413a35(hadamard_kernel)