Proof step e-c92b2c850587f23b

preserver_image mobius, shift 0 → concludes about mobius_x_over_x_plus_one of Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1). JSON

Theorem

Affine, reversal and Möbius substitutions (elementary) polytool ?

Lean (RealRooted): route fTransform RealRooted.splits_fPolynomial

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\":1,\"first_degree\":0,\"step\":1}}"
}

Premises

• Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1). (sequence)
  uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-4, 0)

Claims

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

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: preserver_image, SHA-256 52015165e6697ab394e7cb63ae6364a1bf14bd440bc1aab4d2cb16ae3d9db79c, 16,994 bytes (3,132 compressed); download JSON

Cited by

• n-4d6b9eb76ece53c0 (real_rooted)
• n-4d6b9eb76ece53c0 (one_signed_coefficients)
• n-4d6b9eb76ece53c0 (hadamard_kernel)