Proof step

Affine, reversal and Möbius substitutions (elementary)

Image under a real-rootedness preserver mobius, shift 0

Concludes

mobius_x_over_x_plus_one of reversal of Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a(n-1,k) for n+k odd.

Premises

reversal of Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a(n-1,k) for n+k odd.
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Theorem

polytool ?

Lean

RealRooted route fTransform RealRooted.splits_fPolynomial

Checked

polytool replayed · Lean not attempted

Technical details

Step id

e-2ebc405f97fe63ca · JSON

Operation

Image under a real-rootedness preserver

{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":0,\"first_degree\":2,\"step\":1}}"
}

Claims

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

Certificate

preserver_image, SHA-256 a4d7db06bc2700f1b8b1f7bf2ad0c5da903641c96b476c03dc5e48a526e506ac, 8,297 bytes (2,439 compressed); download

polytool replayed the certificate when the step was written.

Cited by

n-22aa0691270f8663 (real_rooted)
n-22aa0691270f8663 (one_signed_coefficients)
n-22aa0691270f8663 (hadamard_kernel)