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 read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.
- Premises
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-d7a9ec29e7776a16· 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-2569069331151a75c2b615231ad3bea2ee8ef9ec0a6ea510b5a8906e35c1160c4a4, 26,906 bytes (4,677 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-5d7c3f4772a9d8bb(real_rooted)n-5d7c3f4772a9d8bb(one_signed_coefficients)n-5d7c3f4772a9d8bb(hadamard_kernel)