Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of basis_map_A013611 of Triangle read by rows: T(n,k) = binomial(k,n-k).
- Premises
- basis_map_A013611 of Triangle read by rows: T(n,k) = binomial(k,n-k).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- basis_map_A013611 of Triangle read by rows: T(n,k) = binomial(k,n-k).
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-959a0b874aaa1477· 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-2562614c0014fa687ea76d7ffff302bfca264038e619db288fcdc64b901bc498c78, 11,879 bytes (3,613 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-c543221da2eb63df(real_rooted)n-c543221da2eb63df(one_signed_coefficients)n-c543221da2eb63df(hadamard_kernel)