Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of theta_plus_one of Triangle read by rows: T(n,k) is the number of permutations of 1..n arranged in a circle with exactly k descents.
- Premises
- theta_plus_one of Triangle read by rows: T(n,k) is the number of permutations of 1..n arranged in a circle with exactly k descents.
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) is the number of permutations of 1..n arranged in a circle with exactly k descents.
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-8afc695378468948· JSON- Operation
- Image under a real-rootedness preserver
{ "index_shift": 0, "operation": "preserver_image", "operator": "{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}" } - Claims
{ "claim": "real_rooted", "from_index": 1, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-256c01061c5ed9d9452aad04447fa76373635951ad9da339788922a505b3c40b8c8, 9,515 bytes (2,198 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-9b67fd9b7ecdcab9(real_rooted)n-9b67fd9b7ecdcab9(one_signed_coefficients)n-9b67fd9b7ecdcab9(hadamard_kernel)