{"id":"e-f71cdfb9d254d483","operation":{"operation":"parent_provers","route":"root_domain"},"operation_detail":"root_domain","conclusion_id":"n-dfedc6a36c97eba4","premise_count":0,"theorem":"polytool parent provers, route root_domain: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"d6b6216c7c63f8fa9c5604a22db99453ba7d581cc4aa17d85198d84a898f6a62","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"parent_provers","certificate_raw_size":1453,"certificate_compressed_size":703,"conclusion_name":"Triangle read by rows: T(n, k) = t(n-k, k), where t(0,0) = 1, t(n,m) = 0 if n < 0 or m < 0, else t(n,m) = f(m)*t(n-1,m) + f(n)*t(n,m-1), and f(n) = 3*n + 3.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[],"cited_by":[{"node_id":"n-dfedc6a36c97eba4","claim":"one_signed_coefficients"},{"node_id":"n-dfedc6a36c97eba4","claim":"hadamard_kernel"},{"node_id":"n-dfedc6a36c97eba4","claim":"real_rooted"}]}