{"id":"e-0cd0209be356c72c","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-f00f6de2d4bbc6f5","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":"82bf5956c33a7a691c72faf29546eb60d468227cd03ecdfb4620b0e3f14602b1","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"preserver_image","certificate_raw_size":8838,"certificate_compressed_size":2704,"conclusion_name":"Triangle read by rows: the reversed x = 1+q Narayana triangle at m=2.","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-4479b0484a11b442","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0).","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}],"cited_by":[{"node_id":"n-f00f6de2d4bbc6f5","claim":"one_signed_coefficients"},{"node_id":"n-f00f6de2d4bbc6f5","claim":"hadamard_kernel"},{"node_id":"n-f00f6de2d4bbc6f5","claim":"real_rooted"}]}