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