{"id":"e-591efb281478fca5","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-6aa546735711342f","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":"d6553337236ec7f25eb551614d3fa1d4c1f31d5f477ca577f98ab8c2782234ca","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":15287,"certificate_compressed_size":2830,"conclusion_name":"basis_map_A013609 of Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":4,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-ab5ae7f91c188f17","role":"sequence","name":"Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m.","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-6aa546735711342f","claim":"one_signed_coefficients"},{"node_id":"n-6aa546735711342f","claim":"hadamard_kernel"},{"node_id":"n-6aa546735711342f","claim":"interlacing"},{"node_id":"n-6aa546735711342f","claim":"real_rooted"}]}
