{"id":"e-726c0b03589eafe2","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1/8\",\"intercept\":\"-1/8\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-512e5935bc8384f1","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":"39ed329647f586bed64b169470b8c8ac78a03c0ed689d523c8a292eb47adceed","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"preserver_image","certificate_raw_size":7406,"certificate_compressed_size":2241,"conclusion_name":"Triangle read by rows: T(n,k) is the number of binary sequences of length n containing k subsequences 001 (n,k>=0).","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"1"}}}],"premises":[{"position":0,"node_id":"n-0d55e0bb3c384646","role":"sequence","name":"Triangle read by rows, formed from antidiagonals of the antidiagonals (A011973) of Pascal's triangle (A007318).","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-512e5935bc8384f1","claim":"real_rooted"}]}