{"id":"e-ecb3a914f88de7f3","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-e93f0e54dbc33ad5","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"7b9a88055748da8c7a56b1af290e54e0bb2a34b2c7e80c322c777fd1e2e6d234","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"preserver_image","certificate_raw_size":11656,"certificate_compressed_size":2940,"conclusion_name":"basis_map_A007318 of Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-dd4aa31f3d11d152","role":"sequence","name":"Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).","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-e93f0e54dbc33ad5","claim":"one_signed_coefficients"},{"node_id":"n-e93f0e54dbc33ad5","claim":"hadamard_kernel"},{"node_id":"n-e93f0e54dbc33ad5","claim":"interlacing"},{"node_id":"n-e93f0e54dbc33ad5","claim":"real_rooted"}]}