{"id":"e-49a2a295aea4e98b","operation":{"map":"A013611","operation":"basis_map"},"operation_detail":"A013611","conclusion_id":"n-59d248804051c160","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":"ce5419df19691635136befe1c50f61c390396c5fd362060e7e83f1d8228d3bf8","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":14977,"certificate_compressed_size":2910,"conclusion_name":"basis_map_A013610 of basis_map_A013611 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-51fcbaaf07b9691b","role":"sequence","name":"basis_map_A013610 of Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}],"cited_by":[{"node_id":"n-59d248804051c160","claim":"real_rooted"},{"node_id":"n-59d248804051c160","claim":"one_signed_coefficients"},{"node_id":"n-59d248804051c160","claim":"hadamard_kernel"},{"node_id":"n-59d248804051c160","claim":"interlacing"}]}
