{"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"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["1","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-12","-22","-12","-8","-2"],["-4","-12","-5","0","0"],["3","3","1","0","0"],["1","1","0","0","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-24","-54","-44","-24","-6"],["-14","-36","-23","-4","0"],["1","-1","-1","0","0"],["1","1","0","0","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-12","-32","-32","-16","-4"],["-10","-24","-18","-4","0"],["-2","-4","-2","0","0"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["4","6","2","2"],["2","5","2","0"],["0","1","0","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["4","6","2","2"],["2","5","2","0"],["0","1","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":[["2","2","0","2"],["2","3","2","0"],["0","1","0","0"]]},"terms":[{"coeff":{"coeffs":[["6","8","6","8","2"],["7","15","7","0","0"],["0","0","-1","0","0"],["-1","-1","0","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["4","12","16","12","4"],["6","16","14","4","0"],["2","4","2","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["1","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"]]},"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":[["-4","-2"],["1","2"],["-1","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-6","-10","-2"],["4","4","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["-4","-8","-4"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","128","704","1600","1984","1536","832","320","64"],["0","0","64","416","1088","1472","1088","416","64","0"],["0","0","0","32","128","192","128","32","0","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","128","704","1600","1984","1536","832","320","64"],["0","0","64","416","1088","1472","1088","416","64","0"],["0","0","0","32","128","192","128","32","0","0"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","0","512","3072","7680","10240","7680","3072","512"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","0","512","3072","7680","10240","7680","3072","512"],["0","0","0","-256","-1024","-768","2560","6400","6144","2816","512"],["0","0","0","-256","-1536","-3840","-5120","-3840","-1536","-256","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-512","-4608","-17408","-36352","-46080","-36352","-17408","-4608","-512"],["0","0","0","1024","7168","21504","35840","35840","21504","7168","1024","0"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","-1024","-8192","-28672","-57344","-71680","-57344","-28672","-8192","-1024"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","-512","-3584","-10240","-14848","-10240","-512","4096","2560","512"],["0","-512","-3840","-11776","-18688","-15360","-4352","2560","2304","512"],["0","0","-256","-1536","-3840","-5120","-3840","-1536","-256","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","1024","7680","24064","39936","35328","11264","-7680","-9216","-3584","-512"],["0","0","1024","7168","21504","35840","35840","21504","7168","1024","0"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","-1024","-8192","-28672","-57344","-71680","-57344","-28672","-8192","-1024"]]},"deriv_order":2}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","0","0"],["2","1","-2"],["0","1","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-4","-2","6","2"],["0","-4","-4","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","4","8","4"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","-64","-192","-128","192","448","448","256","64"],["0","-96","-288","-128","448","672","352","64","0"],["0","-32","-96","-64","64","96","32","0","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","128","704","1600","1984","1536","832","320","64"],["0","64","416","1088","1472","1088","416","64","0"],["0","0","32","128","192","128","32","0","0"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","0","512","3072","7680","10240","7680","3072","512"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","0","512","3584","10240","14848","10240","512","-4096","-2560","-512"],["0","0","0","512","3840","11776","18688","15360","4352","-2560","-2304","-512"],["0","0","0","0","256","1536","3840","5120","3840","1536","256","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-1024","-7680","-24064","-39936","-35328","-11264","7680","9216","3584","512"],["0","0","0","0","-1024","-7168","-21504","-35840","-35840","-21504","-7168","-1024","0"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","1024","8192","28672","57344","71680","57344","28672","8192","1024"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","1024","7168","20992","32768","28160","11264","-512","-2048","-512"],["0","0","1024","7424","22528","36608","33280","15104","1024","-1792","-512"],["0","0","0","256","1536","3840","5120","3840","1536","256","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-2048","-15872","-52736","-97280","-107008","-68608","-20992","1024","2560","512"],["0","0","0","-1024","-7168","-21504","-35840","-35840","-21504","-7168","-1024","0"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","1024","8192","28672","57344","71680","57344","28672","8192","1024"]]},"deriv_order":2}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","64","256","384","256","64"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["-1","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","-1"]]},"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"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["1","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"]]},"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 >= 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: coefficients must be index-independent; 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) + (1) x, V_n(x) = 0, W_n(x) = (n - 1) + (n - 1) x; open hypotheses: multipliers_vanish_at_zero: [x^0] c_2(n, x) = n - 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 = 2: [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 = 2: [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 >= 2, with A_n(x) = (2) + (1) x, B_n(x) = (n - 1) + (n - 1) x: every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, -1] (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) = (2) + (1) x, B_n(x) = (n - 1) + (n - 1) x","every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, -1] (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 + (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"}