Proof step e-84166154a2dbd6d5

preserver_image affine, shift 0 → concludes about shift_x_plus_one of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals. 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

• Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals. (sequence)
  uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]

Claims

• { "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "-1" } } }
• { "claim": "interlacing", "from_index": 2, "kind": "weak", "orientation": "unordered" }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: preserver_image, SHA-256 8030a57769f42e647466a362516a8af6e6fa1d339fd1780c25f44275b0087ea8, 19,086 bytes (4,070 compressed); download JSON

Cited by

• n-85a14e0b559789f0 (real_rooted)
• n-85a14e0b559789f0 (one_signed_coefficients)
• n-85a14e0b559789f0 (hadamard_kernel)
• n-85a14e0b559789f0 (interlacing)