{"id":"e-fa60549745d63218","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-3005506063937011","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":"b9c7bd2a06ceb512909c5f334de0077e925bd7716922d84daa8263144ad5d29a","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":11868,"certificate_compressed_size":2211,"conclusion_name":"basis_map_A013609 of Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-e8e64448d4c6498a","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.","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-3005506063937011","claim":"real_rooted"},{"node_id":"n-3005506063937011","claim":"one_signed_coefficients"},{"node_id":"n-3005506063937011","claim":"hadamard_kernel"}]}