Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of reversal 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) * z^k / k…
- Premises
- reversal 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) * z^k / k…
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- reversal 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) * z^k / k…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-249c4f48e62aed37· 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" } } }{ "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-25659cf627c20b1f0853f2fe7d4df8b94de2d5fcde197c0d20123caa6815b27bfe5, 13,538 bytes (3,208 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-a50ebe9c8bf98776(real_rooted)n-a50ebe9c8bf98776(one_signed_coefficients)n-a50ebe9c8bf98776(hadamard_kernel)n-a50ebe9c8bf98776(interlacing)