{"id":"e-5b14554a44082fcc","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-eea87339949eb904","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":"eaeba238b5516d27b24d15f3292f821a351c446a6f90eb349bfc9e317dfef9cc","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"preserver_image","certificate_raw_size":14165,"certificate_compressed_size":2934,"conclusion_name":"shift_x_plus_one of Triangle, T(n, k) = (1/2)*(n+2)! * [x^k]( p(x, n) ), where p(x,0) = 1, p(x,1) = -x, P(x, n) = (1/(n+1))*( (2*n-x)*P(x, n-1) - n*P(x, n-2) ), read by rows.","claims":[{"claim":"real_rooted","from_index":1,"region":{}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-cfb1b41332b76420","role":"sequence","name":"Triangle, T(n, k) = (1/2)*(n+2)! * [x^k]( p(x, n) ), where p(x,0) = 1, p(x,1) = -x, P(x, n) = (1/(n+1))*( (2*n-x)*P(x, n-1) - n*P(x, n-2) ), read by rows.","uses":{"claim":"real_rooted","from_index":1,"region":{}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)"}],"cited_by":[{"node_id":"n-eea87339949eb904","claim":"real_rooted"},{"node_id":"n-eea87339949eb904","claim":"interlacing"}]}