Proof step e-33f9ec87155c6d6e

preserver_image affine, shift 0 → concludes about shift_x_plus_one of Triangle T(n,k) (n >= 1, 0 <= k <= floor((n-1)/2)) read by rows, where T(n,k) = (k+1)T(n-1,k) + (2n-4k)T(n-1,k-1). JSON

Theorem

Affine, reversal and Möbius substitutions (elementary) polytool ?

Lean (RealRooted): Polynomial.Splits.comp_of_degree_le_one

Operation

Image under a real-rootedness preserver

{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"
}

Premises

• Triangle T(n,k) (n >= 1, 0 <= k <= floor((n-1)/2)) read by rows, where T(n,k) = (k+1)T(n-1,k) + (2n-4k)T(n-1,k-1). (sequence)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "-1" } } }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: preserver_image, SHA-256 17bd9e292d34279081756abdf10a51ca9da2e34b9a6471b482229a359d78bf77, 25,959 bytes (4,415 compressed); download JSON

Cited by

• n-e8d6574c8023ca59 (real_rooted)
• n-e8d6574c8023ca59 (one_signed_coefficients)
• n-e8d6574c8023ca59 (hadamard_kernel)