Proof step e-c012cb3d271aa10d

preserver_image affine, shift 0 → concludes about shift_x_plus_one of Triangular array read by rows. T(n,k) = A008277(n,k)*2^k; n >= 1, 1 <= 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

• Triangular array read by rows. T(n,k) = A008277(n,k)*2^k; n >= 1, 1 <= 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" } } }
• { "claim": "interlacing", "from_index": 1, "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 19b02450de551cc601b0ea0e297ae86d639630843ab091d9998e2e0d8bcf8031, 11,666 bytes (2,951 compressed); download JSON

Cited by

• n-1bf471426fab0fa9 (real_rooted)
• n-1bf471426fab0fa9 (one_signed_coefficients)
• n-1bf471426fab0fa9 (hadamard_kernel)
• n-1bf471426fab0fa9 (interlacing)