{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","6"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","6"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013609 of Riordan array (1, 3+3x)."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["48","168","144"],["-38","-60","0"],["4","0","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["21","102","156","72"],["-7","-20","-12","0"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0"],["-4","-12"],["2","0"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["0"],["6"]],"recurrence":{"denominator":{"coeffs":[["6","12"],["-8","-12"],["2","0"]]},"terms":[{"coeff":{"coeffs":[["-90","-228","-144"],["46","60","0"],["-4","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-28","-122","-168","-72"],["7","20","12","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["1","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","6"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","6"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","6"]]},"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":[["-6","-12"],["4","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-7","-20","-12"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","0"],["-28","-220","-616","-720","-288"],["14","68","104","48","0"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["28","136","208","96"],["56","272","416","192"],["28","136","208","96"]]},"step_quotients":[[{"coeff":{"coeffs":[["140","848","1856","1728","576"],["280","1696","3712","3456","1152"],["140","848","1856","1728","576"]]},"deriv_order":0},{"coeff":{"coeffs":[["-98","-756","-2256","-3232","-2208","-576"],["-98","-756","-2256","-3232","-2208","-576"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-98","-560","-1136","-960","-288"],["-98","-560","-1136","-960","-288"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","0"],["-8","-24"],["4","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["16","56","48"],["-14","-40","-24"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["7","34","52","24"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["42","204","312","144"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["392","3808","15072","30976","34688","19968","4608"],["1176","11424","45216","92928","104064","59904","13824"],["1176","11424","45216","92928","104064","59904","13824"],["392","3808","15072","30976","34688","19968","4608"]]},"step_quotients":[[{"coeff":{"coeffs":[["-784","-12320","-75840","-242816","-441088","-456192","-248832","-55296"],["-1568","-29344","-197376","-666496","-1253888","-1328640","-737280","-165888"],["0","-14112","-137088","-542592","-1115136","-1248768","-718848","-165888"],["1568","10528","14592","-56960","-232960","-336384","-221184","-55296"],["784","7616","30144","61952","69376","39936","9216","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["392","6944","50240","197248","463360","669184","580608","276480","55296"],["-1960","-20608","-85888","-169472","-116480","133120","313344","221184","55296"],["-5096","-62048","-322496","-930688","-1623040","-1741312","-1115136","-387072","-55296"],["-2744","-34496","-186368","-563968","-1043200","-1205248","-847872","-331776","-55296"]]},"deriv_order":1},{"coeff":{"coeffs":[["1372","19992","127680","468352","1085568","1645824","1629184","1013760","359424","55296"],["2744","39984","255360","936704","2171136","3291648","3258368","2027520","718848","110592"],["1372","19992","127680","468352","1085568","1645824","1629184","1013760","359424","55296"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["-392","-1456","7776","59456","151168","188160","115200","27648"],["-1568","-10528","-14592","56960","232960","336384","221184","55296"],["-1960","-16688","-52512","-64448","12416","108288","96768","27648"],["-784","-7616","-30144","-61952","-69376","-39936","-9216","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["1372","17248","93184","281984","521600","602624","423936","165888","27648"],["2744","34496","186368","563968","1043200","1205248","847872","331776","55296"],["1372","17248","93184","281984","521600","602624","423936","165888","27648"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["14","68","104","48"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-3","-6"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-3","-6"]]},"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 = phi(n, D) = (1) D; so the candidate rows satisfy the input rule at every base n >= 1 (the exceptional bases checked exactly), and agreement on the 2 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":"no parent theorem report with an interlacing conclusion","status":"none"},"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"lift_summary":{"hypotheses":[{"evidence":"the polynomial with ascending coefficients [0, 1] is fixed; exact check: real-rooted = true, coefficients of one sign = true","name":"derivative_polynomial_real_rooted","statement":"the polynomial in D is real-rooted for every n >= n0","status":{"kind":"verified"}},{"evidence":"lambda(n) = 1","name":"gauge_finite_nonzero","statement":"lambda(n) is finite and nonzero for every n >= n0","status":{"kind":"verified"}},{"evidence":"delta(n) != 0 for every integer n in [0, +inf) (exact; Taylor shift: the coefficients of delta(n) at n = 0 + u have one sign)","name":"operator_coefficients_defined","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["1"]},"numerator":["1"],"range":{"first":"0","last":null}},"decision":"holds"},"statement":"the operator coefficients are finite at every n >= n0 (their denominators do not vanish)","status":{"kind":"verified"}}],"identity":{"method":"forward_division","status":"certified"},"input_first_index":0,"input_interlacing":{"reason":"no parent theorem report with an interlacing conclusion","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"phi(n, D) = (1) D","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","6"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","6"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = phi(n, D) = (1) D, 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 (-inf, 0]","input_root_region":{"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":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n"},"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":"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) = (3) + (6) x, V_n(x) = 0, W_n(x) = (3) + (6) x; open hypotheses: multipliers_vanish_at_zero: [x^0] c_2(n, x) = 3 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 = 3 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 = 3 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) + (6) x, B_n(x) = (3) + (6) x: every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, -1/2] (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) + (6) x, B_n(x) = (3) + (6) x","every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, -1/2] (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 = phi(n, D) = (1) D 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 (-inf, 0]"},"kind":"preserver_image"}