Proof step e-515982525d76b9fb

preserver_image reversal, shift 0 → concludes about Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals. JSON

Theorem

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

Lean (RealRooted): route reversed RealRooted.X_pow_mul_reverse_eq_zero_or_splits, RealRooted.reflect_eq_zero_or_splits

Operation

Image under a real-rootedness preserver

{
  "index_shift": 0,
  "operation": "preserver_image",
  "operator": "{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"
}

Premises

• Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward 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": "0" } } }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: preserver_image, SHA-256 6edf9fb08ae3ef17e5ec90b4ef2ab94c75ec352cd6f0db8e52f97a5f03f572c6, 9,591 bytes (2,504 compressed); download JSON

Cited by

• n-c8b3f39d03de798f (real_rooted)
• n-c8b3f39d03de798f (one_signed_coefficients)
• n-c8b3f39d03de798f (hadamard_kernel)