Proof step e-a119db10a83a7e8e

preserver_image affine, shift 0 → concludes about basis_map_A007318 of Triangle read by rows: T(n,k) = binomial(n+4,4) * 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) = binomial(n+4,4) * 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" } } }
• { "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 8ef80f02e03ebbf4dd1dc940ab5c0c4f421e9ad2ff3ead71e81bfa305d718e6b, 11,634 bytes (2,930 compressed); download JSON

Cited by

• n-fe7b03c8bdb96043 (one_signed_coefficients)
• n-fe7b03c8bdb96043 (hadamard_kernel)
• n-fe7b03c8bdb96043 (interlacing)
• n-fe7b03c8bdb96043 (real_rooted)