{"id":"e-21fbe97b7e7a11ac","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-765f9e2b013b3c68","premise_count":0,"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":"86c2dbe8939518d3502c12a64f4e11672ed35150a9d63b3dd5afe371eed03ac3","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map_theorem","certificate_raw_size":1971,"certificate_compressed_size":789,"conclusion_name":"Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n).","claims":[{"claim":"basis_map_preserver","input_interval":"(-inf, +inf)","output_interval":"(-inf, +inf)","statement":"every real-rooted input has a real-rooted image (an affine substitution times g)"},{"claim":"basis_map_preserver","input_interval":"(-inf, 1]","output_interval":"(-inf, 0]","statement":"an input root r <= 1 gives the root (r - a)/d <= 0; a larger root gives a positive root"}],"premises":[],"cited_by":[{"node_id":"n-765f9e2b013b3c68","claim":"basis_map_preserver"}]}