Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- Triangle of coefficients, read by rows, where the n-th row forms the polynomial P(n,x) = {Sum_{k=1..n} 1/(k+x)}*{Product_{k=1..n} (k+x)}.
- Premises
- theta_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increas…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- theta_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increas…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-06fcede0b2b895b6· 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-25689b8bcdcc14970dee1adb2e2502b575427dfc923f0932607ddb9aed23c94ee34, 8,888 bytes (2,602 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-714479c216bddb04(one_signed_coefficients)n-714479c216bddb04(hadamard_kernel)n-714479c216bddb04(real_rooted)