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 parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).
- Premises
- veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-247c19f1e460b924· 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-256820b32f7fdcd999328bd692b8cdad3a6e243bcd72117a29ce3a9c4bfa2a6621d, 4,842 bytes (1,501 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-a9043bb05acfd8df(real_rooted)n-a9043bb05acfd8df(one_signed_coefficients)n-a9043bb05acfd8df(hadamard_kernel)