{"id":"e-b6645f2226a58079","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-e734a631f8279507","premise_count":0,"theorem":"polytool parent provers, route paper_theorem: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"13880fbb2bbb46a7635515f999c5ba361e6b15f08551f5fc78711df344219b2d","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"parent_provers","certificate_raw_size":1995,"certificate_compressed_size":858,"conclusion_name":"Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.","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-e734a631f8279507","claim":"one_signed_coefficients"},{"node_id":"n-e734a631f8279507","claim":"hadamard_kernel"},{"node_id":"n-e734a631f8279507","claim":"interlacing"},{"node_id":"n-e734a631f8279507","claim":"real_rooted"}]}