{"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"],["3","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-4","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013609 of Even row Pascal-square read by antidiagonals."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-12","20","12","-36","16"],["-16","24","24","-56","24"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["5","3","-23","1","30","-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":[["-9","-58","-128","-118","-39"],["21","110","196","146","39"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-5","-43","-138","-206","-145","-39"]]},"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"],["3","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-4","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","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":[["-12","-16"],["-16","-24"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["5","18","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":[["80","288","256"],["160","576","512"],["80","288","256"]]},"step_quotients":[[{"coeff":{"coeffs":[["-80","-448","-832","-512"],["-160","-896","-1664","-1024"],["-80","-448","-832","-512"]]},"deriv_order":0},{"coeff":{"coeffs":[["100","720","1936","2304","1024"],["100","720","1936","2304","1024"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-100","-720","-1936","-2304","-1024"],["-100","-720","-1936","-2304","-1024"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["8"],["16"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["2","8"],["-20","-32"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["5","18","16"]]},"deriv_order":2,"shift":0}]},"quotient":[],"step_multiplier":{"coeffs":[["1600","11520","30976","36864","16384"],["4800","34560","92928","110592","49152"],["4800","34560","92928","110592","49152"],["1600","11520","30976","36864","16384"]]},"step_quotients":[[{"coeff":{"coeffs":[["9600","69120","185856","221184","98304"],["35200","253440","681472","811008","360448"],["48000","345600","929280","1105920","491520"],["28800","207360","557568","663552","294912"],["6400","46080","123904","147456","65536"]]},"deriv_order":0},{"coeff":{"coeffs":[["-7200","-61440","-208512","-351744","-294912","-98304"],["-22400","-193280","-664064","-1135616","-966656","-327680"],["-23200","-202240","-702592","-1216000","-1048576","-360448"],["-8000","-70400","-247040","-432128","-376832","-131072"]]},"deriv_order":1},{"coeff":{"coeffs":[["2000","21600","96960","231552","310272","221184","65536"],["4000","43200","193920","463104","620544","442368","131072"],["2000","21600","96960","231552","310272","221184","65536"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["5600","46720","154496","252928","204800","65536"],["17600","149120","502016","839168","696320","229376"],["18400","158080","540544","919552","778240","262144"],["6400","55680","193024","333312","286720","98304"]]},"deriv_order":0},{"coeff":{"coeffs":[["-2000","-21600","-96960","-231552","-310272","-221184","-65536"],["-4000","-43200","-193920","-463104","-620544","-442368","-131072"],["-2000","-21600","-96960","-231552","-310272","-221184","-65536"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["4"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1","4","4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-3","-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"],["3","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-4","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","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: coefficient of P_(n-1) must be 1 after normalization; fixed_delay_predecessor_window: coefficient of P_(n-1) must be 1 (+ w(n) t) after normalization)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"Unresolved: P_n = (a_n + b_n (x + 1/2)) P_(n-1) - c_n (x + 1/2)^2 P_(n-2) for n >= 2, with a_n = 1, b_n = 4, c_n = 4; Q_n(y) = y^(d_n) P_n(1/y - 1/2), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2); open hypotheses: root_region: the region contains the pole x = -1/2 of the coordinate change y = 1/(x + 1/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) = (3) + (4) x, V_n(x) = 0, W_n(x) = (-1) + (-4) x + (-4) x^2; open hypotheses: multipliers_vanish_at_zero: [x^0] c_2(n, x) = -1 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 = 1 (not a disproof): fails at n = 2: [x^1] W_n = -4 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 = 1 (not a disproof): fails at n = 2: [x^1] W_n = -4 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) = (3) + (4) x, B_n(x) = (-1) + (-4) x + (-4) x^2: every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, 0) (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) = (3) + (4) x, B_n(x) = (-1) + (-4) x + (-4) x^2","every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, 0) (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; Proposition 3.3 (the case B_n(x) = -(c_n x + d_n)^2)"},"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"}