{"id":"e-4e33b7f82e7c19e2","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-d465d6a5ebc6ced7","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"b0dede5ee1e917bf388b49b255784ce5ac042affa68263704e2491f6fe68c52c","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map","certificate_raw_size":15049,"certificate_compressed_size":2971,"conclusion_name":"basis_map_A007318 of basis_map_A007318 of Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k.","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-9ac33c0e4aa39b7d","role":"sequence","name":"basis_map_A007318 of Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}],"cited_by":[{"node_id":"n-d465d6a5ebc6ced7","claim":"real_rooted"},{"node_id":"n-d465d6a5ebc6ced7","claim":"one_signed_coefficients"},{"node_id":"n-d465d6a5ebc6ced7","claim":"hadamard_kernel"},{"node_id":"n-d465d6a5ebc6ced7","claim":"interlacing"}]}