Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of shift_x_plus_one of Triangle read by rows: T(n, k) = [z^k] P(n, z) where P(n, z) = Sum_{k=0..n} binomial(n, k) * Pochhammer(n - k + c, k) *…
- Premises
- shift_x_plus_one of Triangle read by rows: T(n, k) = [z^k] P(n, z) where P(n, z) = Sum_{k=0..n} binomial(n, k) * Pochhammer(n - k + c, k) *…
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of Triangle read by rows: T(n, k) = [z^k] P(n, z) where P(n, z) = Sum_{k=0..n} binomial(n, k) * Pochhammer(n - k + c, k) *…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-39d2a9264f65405a· 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-25661f65fbbe5b1371ce14beef1b50fe5319b38bc162d4f078f19c374e88be6151c, 8,285 bytes (2,434 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-ff62bf19b729c3e5(real_rooted)n-ff62bf19b729c3e5(one_signed_coefficients)n-ff62bf19b729c3e5(hadamard_kernel)