Proof step e-b2e3690a28625635

preserver_image reversal, shift 0 → concludes about Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = k <= n-1, T(n,k) = T(n-1,k-1) + T(n-1,k)… 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

• Triangular array T read by rows: T(n,0) = T(n,n) = 1 for all n >= 0, T(n,k) = T(n-1,k-1) + T(n-1,k) for odd n and 1< = k <= n-1, T(n,k) = T… (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 848ba9786e3d1fa96a1dcc65b7e82b4d1d4e57faf650774a04c94f1a6625324a, 5,158 bytes (1,582 compressed); download JSON

Cited by

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