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