{"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"]],"recurrence":{"denominator":{"coeffs":[["0"],["24"],["50"],["35"],["10"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["24","12"],["50","65"],["35","98"],["10","55"],["1","10"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","36","0"],["0","123","-24"],["0","108","-87"],["0","33","-69"],["0","3","-15"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","12","12"],["0","0","37","37"],["0","0","28","28"],["0","0","6","6"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"theta_plus_one of Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <= m, columns <= n and entries <= 3."},"identifying_rows":2,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-60","0"],["-47","-35"],["-12","-45"],["-1","-10"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","-100","0"],["0","-39","51"],["0","-3","15"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","-20","-20"],["0","0","-6","-6"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["0"],["20"],["9"],["1"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["0"],["2"]],"recurrence":{"denominator":{"coeffs":[["-12"],["5"],["6"],["1"]]},"terms":[{"coeff":{"coeffs":[["24","0"],["26","-25"],["9","15"],["1","10"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","64","36"],["0","33","-21"],["0","3","-15"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","14","14"],["0","0","6","6"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":1,"multiplier":["120","274","225","85","15","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["0"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["24"],["50"],["35"],["10"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["24","12"],["50","65"],["35","98"],["10","55"],["1","10"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","36","0"],["0","123","-24"],["0","108","-87"],["0","33","-69"],["0","3","-15"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","12","12"],["0","0","37","37"],["0","0","28","28"],["0","0","6","6"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":1,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["0","0","0","0"],["0","0","20","20"],["0","0","9","9"],["0","0","1","1"]]},"deriv_order":1}],"shift":0}],"row_annihilation":{"annihilator":[{"coeff":{"coeffs":[["0"],["-2"],["-3"],["-1"]]},"deriv_order":0},{"coeff":{"coeffs":[["3","0"],["0","3"],["0","3"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","5","0"],["0","0","-3"]]},"deriv_order":2},{"coeff":{"coeffs":[["0","0","1","1"]]},"deriv_order":3}],"kind":"single","quotient":[{"coeff":{"coeffs":[["0","0","-2400","-2400"],["0","0","-4540","-4540"],["0","0","-3177","-3177"],["0","0","-1048","-1048"],["0","0","-165","-165"],["0","0","-10","-10"]]},"deriv_order":0}],"row_multiplier":["0","0","1","1"],"start_base":1,"step_multiplier":{"coeffs":[["0","0","0","0","0","0","1","3","3","1"]]},"step_quotient":[{"coeff":{"coeffs":[["0","0","0","0","0","0","423","1509","1989","1143","240"],["0","0","0","0","0","0","724","2878","4290","2842","706"],["0","0","0","0","0","0","450","2139","3717","2817","789"],["0","0","0","0","0","0","130","808","1644","1384","418"],["0","0","0","0","0","0","18","159","369","333","105"],["0","0","0","0","0","0","1","13","33","31","10"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","469","1212","822","-116","-195"],["0","0","0","0","0","0","0","672","1551","621","-723","-465"],["0","0","0","0","0","0","0","317","567","-201","-835","-384"],["0","0","0","0","0","0","0","57","42","-216","-330","-129"],["0","0","0","0","0","0","0","3","-6","-36","-42","-15"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","0","0","0","0","83","332","498","332","83"],["0","0","0","0","0","0","0","0","111","444","666","444","111"],["0","0","0","0","0","0","0","0","46","184","276","184","46"],["0","0","0","0","0","0","0","0","6","24","36","24","6"]]},"deriv_order":2}]},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["-120","-240"],["-274","-706"],["-225","-789"],["-85","-418"],["-15","-105"],["-1","-10"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-303","195"],["0","-450","465"],["0","-225","384"],["0","-45","129"],["0","-3","15"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-83","-83"],["0","0","-111","-111"],["0","0","-46","-46"],["0","0","-6","-6"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["120"],["274"],["225"],["85"],["15"],["1"]]},"deriv_order":0,"shift":1}]},"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"]],"recurrence":{"denominator":{"coeffs":[["0"],["24"],["50"],["35"],["10"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["24","12"],["50","65"],["35","98"],["10","55"],["1","10"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","36","0"],["0","123","-24"],["0","108","-87"],["0","33","-69"],["0","3","-15"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","12","12"],["0","0","37","37"],["0","0","28","28"],["0","0","6","6"]]},"deriv_order":2,"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":"hypergeometric_row","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 leader is not a nonzero constant","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: LHS must be a nonzero constant; fixed_delay_predecessor_window: LHS must be a nonzero constant)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"not applicable: the theorem needs at least two seed rows","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":"not applicable: the theorem needs two seed rows","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":"not applicable: the theorem needs two seed rows","route":"liu_wang_three_term","success":false,"variant":"liu_wang_three_term"},{"detail":"HypothesisFailed: P_n = a_n(x) S_n(P_(n-1)) for n >= 1, with a_n(x) = (1) ((1)) and S_n = (A + B D + C D^2 with A = 24 n + 50 n^2 + 35 n^3 + 10 n^4 + n^5 + 12 n x + 65 n^2 x + 98 n^3 x + 55 n^4 x + 10 n^5 x, B = 36 x + 123 n x + 108 n^2 x + 33 n^3 x + 3 n^4 x - 24 n x^2 - 87 n^2 x^2 - 69 n^3 x^2 - 15 n^4 x^2, C = 12 x^2 + 37 n x^2 + 28 n^2 x^2 + 6 n^3 x^2 + 12 x^3 + 37 n x^3 + 28 n^2 x^3 + 6 n^3 x^3) / (n^5 + 10 n^4 + 35 n^3 + 50 n^2 + 24 n); open hypotheses: weyl_step_discriminant_nonnegative: at n = 1: B^2 - 4 A C = -1371691425115268940894502718874303/96446709165622301995040768 < 0 at x = -157374851/22749184: T is not a real-rootedness preserver on the whole line (Borcea--Branden 2010, Theorem 1.3, necessary condition); weyl_step_leading_coefficients_same_sign: fails at n = 1: A_1 B_lead = -150 n^9 - 1515 n^8 - 6135 n^7 - 12762 n^6 - 14511 n^5 - 8835 n^4 - 2604 n^3 - 288 n^2 = -46800 there (exact); weyl_step_interlacing: fails at n = 1: B_2 (B_2 A_0^2 - B_1 A_0 A_1 + B_0 A_1^2) = 675 n^18 + 20565 n^17 + 282321 n^16 + 2315682 n^15 + 12679560 n^14 + 49021740 n^13 + 137969370 n^12 + 287084268 n^11 + 443778021 n^10 + 507473055 n^9 + 423552861 n^8 + 251763858 n^7 + 102390984 n^6 + 26676000 n^5 + 3950208 n^4 + 248832 n^3 = 2249208000 there (exact); weyl_step_leading_coefficients_one_signed: fails at n = 1: A_a B_(a+1) = -150 n^9 - 1515 n^8 - 6135 n^7 - 12762 n^6 - 14511 n^5 - 8835 n^4 - 2604 n^3 - 288 n^2 = -46800 there (exact)","route":"iterated_preserver","success":false,"variant":"iterated_preserver"},{"detail":"row relation p(n, k) [x^k] P_n + q(n, k) [x^(k-1)] P_n = 0, n >= 0, with p = (-1) (k) (k) (k + 2), q = (-1) (k - n - 3) (k - n - 2) (k - n - 1); valuation v(n) = 0, degree d(n) = n: every P_n, n >= 0, is nonzero and real-rooted with every root in (-inf, 0): for n >= 0 the coefficients U_j (U_j = [x^(j + v(n))] P_n, v(n) = 0) satisfy U_j = U_0(n) prod_(t <= j) R(n, t), R(n, j) = (-1) (j - n - 3) (j - n - 2) (j - n - 1) / ((j) (j) (j + 2)), so sum_j U_j y^j is U_0(n) times the image of (1 + y)^(n) under a nonnegative multiplier sequence, and U_0(n) != 0 for n >= 0 by its scalar recurrence","route":"hypergeometric_row","success":true,"variant":"hypergeometric_row"}],"conditional_on":[],"route":"hypergeometric_row","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"}