Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- shift_x_plus_one of basis_map_A013610 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 le…
- Premises
- basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal leng…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal leng…
- Theorem
- polytool ?
- Lean
- RealRooted
route
reversedRealRooted.X_pow_mul_reverse_eq_zero_or_splits,RealRooted.reflect_eq_zero_or_splits - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-99b66bb3dfeecb18· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}" } - Claims
{ "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-256e0a77aba363ffb57ee2a94e81895e6f9c0e58c804cc8c6e97575099cbfc76506, 8,021 bytes (2,372 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-db0f883a735747d6(one_signed_coefficients)n-db0f883a735747d6(hadamard_kernel)n-db0f883a735747d6(real_rooted)