Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of veronese_section_2_0 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A…
- Premises
- veronese_section_2_0 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- veronese_section_2_0 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-4ea4269ef8cba4ff· 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-2563daccafbb7f8a16b16d653247b6ab77b9d8f25be1d8d28a455eabd8561d6cc11, 10,159 bytes (2,824 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-2ca20f5a0bd85ef7(real_rooted)n-2ca20f5a0bd85ef7(one_signed_coefficients)n-2ca20f5a0bd85ef7(hadamard_kernel)