Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- basis_map_A007318 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
- Premises
- Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-ca10311f35e45708· 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" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-2568918113db96f7f3cfff87edad6d758bbd34afe3f80bb8be2fc0bc83947c0060f, 10,775 bytes (2,827 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-df44f407d23e429d(one_signed_coefficients)n-df44f407d23e429d(hadamard_kernel)n-df44f407d23e429d(interlacing)n-df44f407d23e429d(real_rooted)