{"id":"e-2afa26d454582b20","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-51b4f5e7901c2b50","premise_count":0,"theorem":"Iterated real-rootedness preservers (induction on n): if P_m is nonzero and real-rooted with every root in a closed region R and, for every n > m, P_n = a_n(x) S_n(P_(n-1)) where S_n maps every polynomial that is zero or real-rooted with every root in R to zero or a real-rooted polynomial with every root in R and a_n is real-rooted with every root in R, then every P_n is real-rooted with every root in R (the roots of a product are the roots of its factors); an exact degree step keeps every row nonzero; here S_n is the identity","lean_route":null,"lean_declarations":[],"certificate_hash":"8095e9e1b65b4db8674b2aaf6ee5d69676e755f059a5bcef6e9d1409d3b60bcf","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":3034,"certificate_compressed_size":1154,"conclusion_name":"Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"}],"premises":[],"cited_by":[{"node_id":"n-51b4f5e7901c2b50","claim":"one_signed_coefficients"},{"node_id":"n-51b4f5e7901c2b50","claim":"hadamard_kernel"},{"node_id":"n-51b4f5e7901c2b50","claim":"interlacing"},{"node_id":"n-51b4f5e7901c2b50","claim":"real_rooted"}]}