Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver reversal, shift 0
- Concludes
- reversal of theta_plus_one of Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).
- Premises
- theta_plus_one of Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).
sequence: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
- theta_plus_one of Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).
- Theorem
- polytool ?
- Lean
- RealRooted
route
reversedRealRooted.X_pow_mul_reverse_eq_zero_or_splits,RealRooted.reflect_eq_zero_or_splits - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-47088e65c22f45c1· JSON- 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}}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "0" } } }- Certificate
preserver_image, SHA-256855a9f9d283817846e3838fd12555b253bb053cf72680c0b75ab457c46bf098b, 17,204 bytes (3,318 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-f623090076ebd096(real_rooted)n-f623090076ebd096(one_signed_coefficients)n-f623090076ebd096(hadamard_kernel)