{"id":"e-d44342e831d15698","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-75ccd0453a9b6cec","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":"c6427e3653d85a17c08c386733e315d619b36aff514e70d97aa9cec813d9b7e9","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"parent_provers","certificate_raw_size":2409,"certificate_compressed_size":1010,"conclusion_name":"Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","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-75ccd0453a9b6cec","claim":"real_rooted"},{"node_id":"n-75ccd0453a9b6cec","claim":"one_signed_coefficients"},{"node_id":"n-75ccd0453a9b6cec","claim":"hadamard_kernel"},{"node_id":"n-75ccd0453a9b6cec","claim":"interlacing"}]}