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_section_2_0 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
- Premises
- veronese_section_2_0 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- veronese_section_2_0 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 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-68de572e63ababc1· 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-2566645f6cbb65d4a04f5b3e51a08bf9703ae110c00891622ce98a733edff729da7, 11,932 bytes (3,149 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-fa2ea18f13501719(real_rooted)n-fa2ea18f13501719(one_signed_coefficients)n-fa2ea18f13501719(hadamard_kernel)