{"id":"e-5ae79da95504cf7f","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-e1c721301bf80375","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":"a11ab028f935a50f289ac015c3319ab1eb82f3fe36812a7671e4ab6293b18150","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"theorem_check","certificate_raw_size":3756,"certificate_compressed_size":1215,"conclusion_name":"Triangle read by rows giving successive states of cellular automaton generated by \"Rule 84\" initiated with a single ON (black) cell.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[],"cited_by":[{"node_id":"n-e1c721301bf80375","claim":"real_rooted"},{"node_id":"n-e1c721301bf80375","claim":"one_signed_coefficients"},{"node_id":"n-e1c721301bf80375","claim":"hadamard_kernel"}]}