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 read by rows: T(n,k) is the number of binary words of length n having degree of asymmetry equal to k (n >= 0; …
- Premises
- shift_x_plus_one of Triangle read by rows: T(n,k) is the number of binary words of length n having degree of asymmetry equal to k (n >= 0; …
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of Triangle read by rows: T(n,k) is the number of binary words of length n having degree of asymmetry equal to k (n >= 0; …
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-8e38c083dc895a86· 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-256440d56448f377996bacf4249f0f75d9a7862ebe34834b4e27d4f7937ccaa7ec4, 26,903 bytes (4,733 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-fd2095bd14a92d5d(one_signed_coefficients)n-fd2095bd14a92d5d(hadamard_kernel)n-fd2095bd14a92d5d(real_rooted)