Proof step e-a3a653eabafbad6b

preserver_image reversal, shift 0 → concludes about Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n). 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\":0,\"first_degree\":0,\"step\":1}}"
}

Premises

• Exponential Riordan array (1, x(1+x/2)). (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": "0" } } }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: preserver_image, SHA-256 1166a1e3664934c7e4aecad018c31854f1bfd5bbafe222e0468aac5b74e7715e, 8,766 bytes (2,400 compressed); download JSON

Cited by

• n-97b51734d39ede6c (real_rooted)
• n-97b51734d39ede6c (one_signed_coefficients)
• n-97b51734d39ede6c (hadamard_kernel)