{"id":"e-4a75a906a42b865f","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-072d2adffaa6f5e5","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"d233d779ba06a9a13a42651c101169be89e9dbaf1b6b0db6e30a87328ecd6511","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":14969,"certificate_compressed_size":3012,"conclusion_name":"basis_map_A013610 of basis_map_A013611 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-b5ebaf3676d81658","role":"sequence","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}],"cited_by":[{"node_id":"n-072d2adffaa6f5e5","claim":"real_rooted"},{"node_id":"n-072d2adffaa6f5e5","claim":"one_signed_coefficients"},{"node_id":"n-072d2adffaa6f5e5","claim":"hadamard_kernel"},{"node_id":"n-072d2adffaa6f5e5","claim":"interlacing"}]}
