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) read by rows: coefficient of [x^k] of the polynomial p_n(x)=(5-x)*p_{n-1}(x)-p_{n-2}(x), p_0=1, p_1=5-x.
- Premises
- Triangle T(n,k) read by rows: coefficient of [x^k] of the polynomial p_n(x)=(5-x)*p_{n-1}(x)-p_{n-2}(x), p_0=1, p_1=5-x.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (3, 7)
- Triangle T(n,k) read by rows: coefficient of [x^k] of the polynomial p_n(x)=(5-x)*p_{n-1}(x)-p_{n-2}(x), p_0=1, p_1=5-x.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-f2a95836fb5b09ee· 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": { "lower": { "closed": false, "value": "2" }, "upper": { "closed": false, "value": "6" } } }{ "claim": "interlacing", "from_index": 1, "kind": "weak", "orientation": "unordered" }- Certificate
preserver_image, SHA-256d536006ae1c3e4413820927b75e56f2112cdb1d9bf3a8ff2b9c27d2306a6acd7, 18,602 bytes (3,491 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-a9419a0f5f0cae19(real_rooted)n-a9419a0f5f0cae19(one_signed_coefficients)n-a9419a0f5f0cae19(interlacing)