Proof step
Affine, reversal and Möbius substitutions (elementary)
Image under a real-rootedness preserver affine, shift 0
- Concludes
- shift_x_plus_one of shift_x_plus_one of Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pi…
- Premises
- shift_x_plus_one of Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pi…
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- shift_x_plus_one of Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pi…
- Theorem
- polytool ?
- Lean
- RealRooted
Polynomial.Splits.comp_of_degree_le_one - Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-03d2d28fe0c44949· 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": 0, "region": { "upper": { "closed": true, "value": "-1" } } }- Certificate
preserver_image, SHA-256c27b1c0a55abbe1774d0eb5da15cb27a6a9d530e44a742c6a2777a9da0a9960f, 27,280 bytes (4,815 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-e578e8a486e97399(real_rooted)n-e578e8a486e97399(one_signed_coefficients)n-e578e8a486e97399(hadamard_kernel)