{"id":"e-05825bc088f68f52","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-42f2f1f6d4fd3019","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":"f1c5a16c84f28d543faa374ecb2a118a6399b8d8d0a758731fec68c02483d58f","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":14407,"certificate_compressed_size":2856,"conclusion_name":"basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs of consecutive 0's (0<=k<=ceiling(n/2)).","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-6120ac587df8130e","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs of consecutive 0's (0<=k<=ceiling(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-42f2f1f6d4fd3019","claim":"one_signed_coefficients"},{"node_id":"n-42f2f1f6d4fd3019","claim":"hadamard_kernel"},{"node_id":"n-42f2f1f6d4fd3019","claim":"interlacing"},{"node_id":"n-42f2f1f6d4fd3019","claim":"real_rooted"}]}