Proof step e-34e3d9a08d46fb54

preserver_image affine, shift 0 → concludes about shift_x_plus_one of Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n). 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 read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n). (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 8b8f5561c651b800b885af4c0d6f7b5c2ae9bd6e01f04fdf28d10151cda30800, 7,266 bytes (2,002 compressed); download JSON

Cited by

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