{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":1,"initial_polynomials":[["1"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-3","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle T(n,k), read by rows, given by (2,1/2,3/2,0,0,0,0,0,0,0,...) DELTA (0,1/2,-1/2,0,0,0,0,0,0,0,...) where DELTA is the operator defined in A084938."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-82","-112","6","4"],["95","133","-2","-4"],["-8","-20","-4","0"],["-5","-1","0","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["50","36","-22","-32","8"],["77","97","-12","4","0"],["-14","-24","-2","0","0"],["-5","-1","0","0","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["132","148","-28","-36","8"],["-18","-36","-10","8","0"],["-6","-4","2","0","0"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["24","36","-8"],["-26","-44","8"],["0","8","0"],["2","0","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["24","36","-8"],["-26","-44","8"],["0","8","0"],["2","0","0"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1,2],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"],["2"]],"recurrence":{"denominator":{"coeffs":[["48","88","-16"],["-20","-60","8"],["-6","8","0"],["2","0","0"]]},"terms":[{"coeff":{"coeffs":[["180","264","-4","-8"],["-96","-170","-6","4"],["-7","17","4","0"],["5","1","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-144","-180","16","44","-8"],["6","28","14","-8","0"],["6","4","-2","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":2,"multiplier":["1","-2","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":1,"initial_polynomials":[["1"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-3","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":2,"parent_valid_from_base":1,"quotients":[],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["5","1"],["-5","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6","-4","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-2"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["576","1248","192","-416","64"],["-1200","-2720","-496","896","-128"],["624","1664","432","-544","64"],["48","-160","-144","64","0"],["-48","-32","16","0","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["576","1248","192","-416","64"],["-1200","-2720","-496","896","-128"],["624","1664","432","-544","64"],["48","-160","-144","64","0"],["-48","-32","16","0","0"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["-48","-32","16"],["96","64","-32"],["-48","-32","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0"],["72","24","-40","8"],["-72","-24","40","-8"]]},"deriv_order":0},{"coeff":{"coeffs":[["-144","-192","32","64","-16"],["144","192","-32","-64","16"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["72","96","-16","-32","8"],["-72","-96","16","32","-8"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["2"],["-3"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["2","10"],["-4","-4"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-12","-8","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["240","-32","-208","64"],["-528","32","432","-128"],["336","32","-240","64"],["-48","-32","16","0"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["-1152","-1536","256","512","-128"],["3456","4608","-768","-1536","384"],["-3456","-4608","768","1536","-384"],["1152","1536","-256","-512","128"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["-576","-768","128","256","-64"],["1728","2304","-384","-768","192"],["-1728","-2304","384","768","-192"],["576","768","-128","-256","64"]]},"deriv_order":0},{"coeff":{"coeffs":[["-1152","1920","4864","-256","-1664","384"],["0","-9216","-12288","2048","4096","-1024"],["3456","12672","9984","-3328","-3200","896"],["-2304","-5376","-2560","1536","768","-256"]]},"deriv_order":1},{"coeff":{"coeffs":[["-6912","-13824","-2304","7168","768","-1536","256"],["13824","27648","4608","-14336","-1536","3072","-512"],["-6912","-13824","-2304","7168","768","-1536","256"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["576","-960","-2432","128","832","-192"],["1728","6336","4992","-1664","-1600","448"],["-5184","-9792","-2688","2944","704","-320"],["2880","4416","128","-1408","64","64"]]},"deriv_order":0},{"coeff":{"coeffs":[["3456","6912","1152","-3584","-384","768","-128"],["-6912","-13824","-2304","7168","768","-1536","256"],["3456","6912","1152","-3584","-384","768","-128"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["-48","-32","16"]]},"start_base":2}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["3","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-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 1) and E the input rule gauged by lambda(n)/delta(n) and composed with (or conjugated through) T = phi(n, D) = 1 + (1) D; so the candidate rows satisfy the input rule at every base n >= 2 (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 >= 1"},"method":"operator_division"},"status":"certified"},"input_first_index":1,"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 [1, 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 [1, +inf) (exact; Taylor shift: the coefficients of delta(n) at n = 1 + 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":"1","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":1,"input_interlacing":{"reason":"no parent theorem report with an interlacing conclusion","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"phi(n, D) = 1 + (1) D","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-3","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = phi(n, D) = 1 + (1) D, for every n >= 1"},"parent_proof":{"route":"liu_wang_three_term","statement":"every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign","status":"proved"},"root_transfer":{"input_conclusion":"every Q_n, n >= 1, 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 >= 3, with A_n(x) = (4), V_n(x) = 0, W_n(x) = (-3) + (1) x; open hypotheses: seed_degree_step: degrees 0 and 0 (exact); seed_strict_interlacing: the Bezout test fails or the degrees do not differ by one (exact); degree_step_positive: fails at n = 3: lambda_n = 0 = 0 there (exact); multipliers_vanish_at_zero: [x^0] c_2(n, x) = -3 is not the zero polynomial","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 >= 3, with A_n(x) = (4), B_n(x) = (-3) + (1) x: every P_n, n >= 1, is nonzero and real-rooted with every root in (-inf, 0) (so its coefficients have one sign); for n >= 2, 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 >= 3","route":"liu_wang_three_term","success":true,"variant":"liu_wang_three_term"}],"conditional_on":[],"interlacing":{"from_index":2,"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 >= 3, with A_n(x) = (4), B_n(x) = (-3) + (1) x","every P_n, n >= 1, is nonzero and real-rooted with every root in (-inf, 0) (so its coefficients have one sign); for n >= 2, 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 >= 3"],"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 >= 1, 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 + (1) D for every n >= 1, the side conditions hold for every n, and every parent row P_n, n >= 1, is zero or real-rooted with coefficients of one sign; so every Q_n, n >= 1, is zero or real-rooted with roots in (-inf, 0]"},"kind":"preserver_image"}