Proof step e-3cf80f21f053e148

preserver_image reversal, shift 0 → concludes about reversal of Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= 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\":1,\"first_degree\":0,\"step\":1}}"
}

Premises

• Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n). (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 50c457e1b8c8275fea36c2118836280045f775433c8b9696eeac9faf1cdb1884, 10,128 bytes (2,693 compressed); download JSON

Cited by

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