{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"mobius"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","8"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013611 of A Jacobsthal triangle."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-4","-4","36","-44","16"],["16","-48","48","-16","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-9","-13","77","-63","-8","16"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["4","-12","12","-4"],["4","-12","12","-4"]]},"deriv_order":0,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["4","8","4"]]},"terms":[{"coeff":{"coeffs":[["29","152","282","224","65"],["-25","-124","-238","-204","-65"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["9","85","266","378","253","65"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1","1"],"operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"mobius"},"parent":{"first_index":0,"initial_polynomials":[["1"],["1","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","8"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":0,"quotients":[],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["-4","-16"],["16","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-9","-40","-16"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["4"],["4"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["4","-12","12","-4"],["4","-12","12","-4"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["144","1216","2816","1024"],["288","2432","5632","2048"],["144","1216","2816","1024"]]},"step_quotients":[[{"coeff":{"coeffs":[["720","6656","18944","16384","4096"],["1440","13312","37888","32768","8192"],["720","6656","18944","16384","4096"]]},"deriv_order":0},{"coeff":{"coeffs":[["-324","-4176","-19072","-35328","-21504","-4096"],["-324","-4176","-19072","-35328","-21504","-4096"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-324","-2880","-7552","-5120","-1024"],["-324","-2880","-7552","-5120","-1024"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","0"],["16","-64"],["32","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["24","128","128"],["-36","-160","-64"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["9","76","176","64"]]},"deriv_order":2,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["5184","87552","572416","1785856","2605056","1441792","262144"],["15552","262656","1717248","5357568","7815168","4325376","786432"],["15552","262656","1717248","5357568","7815168","4325376","786432"],["5184","87552","572416","1785856","2605056","1441792","262144"]]},"step_quotients":[[{"coeff":{"coeffs":[["62208","967680","5468160","12271616","2686976","-24379392","-19922944","-4194304"],["228096","3603456","20983808","51101696","28901376","-61603840","-57671680","-12582912"],["311040","5004288","30142464","79675392","70582272","-38535168","-53477376","-12582912"],["186624","3068928","19206144","55132160","65208320","10223616","-13631488","-4194304"],["41472","700416","4579328","14286848","20840448","11534336","2097152","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["-15552","-304128","-2334720","-8536064","-12943360","3407872","29360128","20971520","4194304"],["-77760","-1603584","-13406208","-57442304","-129925120","-138936320","-42991616","8388608","4194304"],["-108864","-2294784","-19808256","-89276416","-221020160","-288096256","-174063616","-46137344","-4194304"],["-46656","-995328","-8736768","-40370176","-104038400","-145752064","-101711872","-33554432","-4194304"]]},"deriv_order":1},{"coeff":{"coeffs":[["11664","295488","3179520","18829312","66379776","140476416","171180032","110100480","34603008","4194304"],["23328","590976","6359040","37658624","132759552","280952832","342360064","220200960","69206016","8388608"],["11664","295488","3179520","18829312","66379776","140476416","171180032","110100480","34603008","4194304"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["-36288","-592128","-3656704","-10211328","-11091968","327680","3932160","1048576"],["-93312","-1534464","-9603072","-27566080","-32604160","-5111808","6815744","2097152"],["-77760","-1292544","-8236032","-24498176","-31932416","-11206656","1835008","1048576"],["-20736","-350208","-2289664","-7143424","-10420224","-5767168","-1048576","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["11664","248832","2184192","10092544","26009600","36438016","25427968","8388608","1048576"],["23328","497664","4368384","20185088","52019200","72876032","50855936","16777216","2097152"],["11664","248832","2184192","10092544","26009600","36438016","25427968","8388608","1048576"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["4"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-2","-8"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","-4"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":2}]},"statement":"w(n) E = sum_nu H_nu S^nu L' (with any remainder removed by row annihilators of the parent), where L' is the parent rule at P'_n = P_(n+0) (valid from base 0) and E the input rule gauged by lambda(n)/delta(n) and composed with (or conjugated through) T = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0); so the candidate rows satisfy the input rule at every base n >= 0 (the exceptional bases checked exactly), and agreement on the 1 identifying rows gives Q_n = lambda(n) T_n(P_(n+0)) for every n >= 0"},"method":"operator_division"},"status":"certified"},"input_first_index":0,"interlacing":{"reason":"the schedule d_n depends on n","status":"none"},"lean_declarations":["RealRooted.splits_fPolynomial"],"lean_route":"fTransform","lift_summary":{"hypotheses":[{"evidence":"lambda(n) = 1","name":"gauge_finite_nonzero","statement":"lambda(n) is finite and nonzero for every n >= n0","status":{"kind":"verified"}}],"identity":{"method":"forward_division","status":"certified"},"input_first_index":0,"input_interlacing":{"reason":"the schedule d_n depends on n","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0)","kind":"preserver_image","operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"mobius"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","8"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0), for every n >= 0"},"parent_proof":{"route":"liu_wang_three_term","statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 0, is zero or real-rooted with roots in [-1, 0]","input_root_region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}},"parent_hypothesis":"every parent row used is zero or real-rooted with all roots in (-inf, 0] (coefficients of one sign)","parent_root_region":{"upper":{"closed":true,"value":"0"}},"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"},"verdict":"proved"},"notes":["the division remainder is removed by row annihilators of the shifted parent"],"parent_proof":{"attempts":[{"detail":"the rule is not P_(n+k) = c(x) P_n with c free of n","route":"periodic_product","success":false,"variant":"P_(n+k) = c(x) P_n"},{"detail":"not applicable: expected one nonzero lag term","route":"product_recurrence","success":false,"variant":"product_recurrence"},{"detail":"no theorem matched (weighted_renewal_window: support must satisfy offset = 1 + ell * t_degree; fixed_delay_predecessor_window: only P_(n-1) and one term w(n) t P_(n-L) are supported)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"not applicable: c_2(n, x) = gamma(n) w(x) with w neither constant nor a constant times a square (x + v_0)^2","route":"three_term_recurrence","success":false,"variant":"three_term_recurrence"},{"detail":"not applicable: the rule is not f(n) P_n = c_0(n, x) P_(n-1) + c_1(n, x) P'_(n-1)","route":"liu_wang","success":false,"variant":"liu_wang"},{"detail":"HypothesisFailed: P_n = A_n(x) P_(n-1) + V_n(x) P'_(n-1) + W_n(x) P_(n-2) for n >= 2, with A_n(x) = (1) + (4) x, V_n(x) = 0, W_n(x) = (2) + (8) x; open hypotheses: multipliers_vanish_at_zero: [x^0] c_2(n, x) = 2 is not the zero polynomial; lag_coefficient_nonpositive: W_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] W_n <= 0 fails for k = 0 (not a disproof): fails at n = 2: [x^0] W_n = 2 there (exact); derivative_or_lag_coefficient_negative: W_n is not separable with a factor of one sign on (-inf, 0), and the sufficient monomial test (-1)^k [x^k] W_n <= 0 fails for k = 0 (not a disproof): fails at n = 2: [x^0] W_n = 2 there (exact)","route":"liu_wang_derivative_lag","success":false,"variant":"liu_wang_derivative_lag"},{"detail":"not applicable: the rule is not f(n) P_n = c_0(n, x) P_(n-1) + gamma(n) (x - L)(x - U) P'_(n-1)","route":"ma_wang_interval","success":false,"variant":"ma_wang_interval"},{"detail":"P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 2, with A_n(x) = (1) + (4) x, B_n(x) = (2) + (8) x: every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, -1/4] (so its coefficients have one sign); for n >= 1, P_(n-1) interlaces P_n (weakly, in the sense of Liu and Wang), and deg P_n - deg P_(n-1) is 0 or 1 for n >= 2","route":"liu_wang_three_term","success":true,"variant":"liu_wang_three_term"}],"conditional_on":[],"interlacing":{"from_index":1,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = A_n(x) P_(n-1) + B_n(x) P_(n-2) for n >= 2, with A_n(x) = (1) + (4) x, B_n(x) = (2) + (8) x","every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, -1/4] (so its coefficients have one sign); for n >= 1, P_(n-1) interlaces P_n (weakly, in the sense of Liu and Wang), and deg P_n - deg P_(n-1) is 0 or 1 for n >= 2"],"theorem":"liu_wang_three_term: L. L. Liu and Y. Wang, Adv. Appl. Math. 38 (2007) 542-560, Theorem 2.1 and Corollary 2.4 (A unified approach to polynomial sequences with only real zeros; the lag row as the interlacer, b_n = 0), weak interlacing of consecutive rows, with nonnegativity of the coefficients replaced, where a root region is certified, by an exact root-location induction"},"kind":"weak","orientation":"previous_interlaces_next"},"route":"liu_wang_three_term","rows_checked":10,"statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"proved: Q_n = lambda(n) T_n(P_(n+0)) with T = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0) for every n >= 0, the side conditions hold for every n, and every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 0, is zero or real-rooted with roots in [-1, 0]"},"kind":"preserver_image"}