{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","-4","8","4","-8"],["2","-2","2","-6","-12"],["1","3","-2","-24","0"],["-1","7","-12","0","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-4","4","4","-12","8"],["2","0","-8","-14","4","0"],["1","5","-12","-16","0","0"],["-1","7","-12","0","0","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-4","0","-4","8"],["0","2","-10","-8","16","0"],["0","2","-10","8","0","0"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","2","-6","4"],["-1","0","2","4"],["-2","2","8","0"],["-1","4","0","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","2","-6","4"],["-1","0","2","4"],["-2","2","8","0"],["-1","4","0","0"]]},"deriv_order":1,"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","0"],["0","8","-14","4"],["1","-10","8","0"],["-1","4","0","0"]]},"terms":[{"coeff":{"coeffs":[["0","6","-16","14","-4"],["3","-13","30","-42","12"],["-4","18","-34","24","0"],["1","-7","12","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","4","-16","20","-8"],["0","2","-10","24","-16","0"],["0","-2","10","-8","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1","2","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":0,"offset":2,"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":[["0","-2"],["1","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-2","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","-8","32","-40","16"],["0","0","4","-12","24","-48","32"],["0","0","12","-20","-32","24","16"],["0","0","12","-36","-8","32","0"],["0","0","4","-20","16","0","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-8","32","-40","16"],["0","0","4","-12","24","-48","32"],["0","0","12","-20","-32","24","16"],["0","0","12","-36","-8","32","0"],["0","0","4","-20","16","0","0"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","-4","4"],["0","0","-8","8"],["0","0","-4","4"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","-4","8","-4"],["0","0","-8","16","-8"],["0","0","-4","8","-4"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","8","-16","8"],["0","0","0","8","-16","8"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-4","8","-4"],["0","0","-4","8","-4"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","0"],["-1","2"],["-1","4"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-2","2"],["0","4","-8"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-4","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","-16","16"],["0","0","-12","-20","32"],["0","0","-24","8","16"],["0","0","-12","12","0"]]},"deriv_order":0}],"step_multiplier":{"coeffs":[["0","0","0","0","16","-32","16"],["0","0","0","0","48","-96","48"],["0","0","0","0","48","-96","48"],["0","0","0","0","16","-32","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","-32","160","-224","96"],["0","0","0","0","-112","576","-816","352"],["0","0","0","0","-144","768","-1104","480"],["0","0","0","0","-80","448","-656","288"],["0","0","0","0","-16","96","-144","64"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","32","-160","224","-96"],["0","0","0","0","0","128","-576","768","-320"],["0","0","0","0","0","160","-672","864","-352"],["0","0","0","0","0","64","-256","320","-128"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","-64","192","-192","64"],["0","0","0","0","0","0","-128","384","-384","128"],["0","0","0","0","0","0","-64","192","-192","64"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","0","0","-32","128","-160","64"],["0","0","0","0","-80","336","-432","176"],["0","0","0","0","-64","288","-384","160"],["0","0","0","0","-16","80","-112","48"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","32","-96","96","-32"],["0","0","0","0","0","64","-192","192","-64"],["0","0","0","0","0","32","-96","96","-32"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","-4","4"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","-1","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-2"]]},"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 + (1) D; 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":"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 [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 + (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":0,"initial_polynomials":[["1"],["0","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-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 >= 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) = (2) x, V_n(x) = 0, W_n(x) = (1) x + (-1) x^2; open hypotheses: seed_roots_negative: P_1 is zero, not real-rooted, or has a root >= 0 (exact); constant_term_positive: fails at n = 2: A_n(0) = 0 = 0 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":"Q_n = A_n(x) Q_(n-1) + B_n(x) Q_(n-2) for n >= 2, with A_n(x) = (2), B_n(x) = (-1) + (1) x; Q_n = x^(n - 0) P_n(1/x) for n >= 0 (the reversal at the nominal degree deg P_0 + n - 0, an upper bound for deg P_n), which satisfies the rule below: 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, Q_(n-1) interlaces Q_n (weakly, in the sense of Liu and Wang; no interlacing of the P_n is claimed)","route":"liu_wang_three_term","success":true,"variant":"liu_wang_three_term"}],"conditional_on":[],"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 + (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"}