{"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"],["1","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","4"]]},"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 Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["292","1568","1536","-512","-1024"],["472","160","-896","-512","0"],["-672","-512","512","0","0"],["128","0","0","0","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["327","1836","1888","-1664","-3328","-1024"],["532","288","-1792","-2560","-1024","0"],["-752","-896","256","0","0","0"],["128","0","0","0","0","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["35","268","352","-1152","-2304","-1024"],["60","128","-896","-2048","-1024","0"],["-80","-384","-256","0","0","0"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","0"],["-60","-336","-320","256"],["-48","128","256","0"],["64","0","0","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","0","0","0"],["-60","-336","-320","256"],["-48","128","256","0"],["64","0","0","0"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[1],"index_shift":0,"input":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-52","464","576","-256"],["228","-592","-832","256"],["-240","128","256","0"],["64","0","0","0"]]},"terms":[{"coeff":{"coeffs":[["980","-896","-2944","0","1024"],["-2200","-1184","1920","512","0"],["1056","512","-512","0","0"],["-128","0","0","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["105","244","-992","-896","1280","1024"],["-220","-896","384","2048","1024","0"],["80","384","256","0","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["0","0","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":1,"initial_polynomials":[["1"],["1","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","4"]]},"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":1,"quotients":[],"row_annihilation":{"kind":"system","system":{"generators":[{"annihilator":{"terms":[{"coeff":{"coeffs":[["-12","-16"],["8","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-5","-24","-16"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0"],["4"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["-1200","-17280","-92416","-217088","-184320","32768","65536"],["-960","-5888","6144","90112","147456","65536","0"],["1280","11264","28672","16384","0","0","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["-1200","-17280","-92416","-217088","-184320","32768","65536"],["-960","-5888","6144","90112","147456","65536","0"],["1280","11264","28672","16384","0","0","0"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","0","0"],["0","0","0","0"],["80","704","1792","1024"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","0","0","0"],["240","2432","8192","10240","4096"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0"],["-100","-1360","-6784","-14848","-13312","-4096"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","0","0","0"],["-100","-960","-2944","-3072","-1024"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["16","64"],["-32","-64"],["16","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["36","192","192"],["-20","-96","-64"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["5","44","112","64"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","0"],["0","0","0","0","0"],["-640","-8192","-36864","-65536","-32768"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["0","0","0","0","0","0","0"],["1600","28160","195584","671744","1163264","917504","262144"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0"],["0","-25600","-450560","-3129344","-10747904","-18612224","-14680064","-4194304"],["6400","112640","782336","2686976","4653056","3670016","1048576","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["6400","151040","1509376","8282112","27033600","53084160","60293120","35651584","8388608"],["-8000","-179200","-1679360","-8503296","-25067520","-43253760","-41943040","-20971520","-4194304"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0","0"],["2000","52800","599040","3805184","14770176","35880960","53739520","47185920","22020096","4194304"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0"],["-1600","-21760","-82944","110592","1523712","3735552","3407872","1048576"],["-3200","-56320","-391168","-1343488","-2326528","-1835008","-524288","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","0"],["0","0","0","0","0","0","0","0","0"],["2000","44800","419840","2125824","6266880","10813440","10485760","5242880","1048576"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["80","704","1792","1024"]]},"start_base":1}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-1","-4"]]},"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 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 >= 1 (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 >= 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"],["1","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","4"]]},"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 = 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: 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 >= 3, with A_n(x) = (1) + (4) x, V_n(x) = 0, W_n(x) = (1) + (4) x; 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 = 0 (not a disproof): fails at n = 3: [x^0] W_n = 1 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 = 3: [x^0] W_n = 1 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 >= 3, with A_n(x) = (1) + (4) x, B_n(x) = (1) + (4) x: every P_n, n >= 1, is nonzero and real-rooted with every root in (-inf, -1/4] (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) = (1) + (4) x, B_n(x) = (1) + (4) x","every P_n, n >= 1, is nonzero and real-rooted with every root in (-inf, -1/4] (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"}