{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"mobius"},"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":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-120","360","0","-1200","1800","-1080","240"],["-274","664","790","-4320","5690","-3256","706"],["-225","336","1695","-5640","6765","-3720","789"],["-85","7","1240","-3330","3755","-2005","418"],["-15","-30","375","-900","975","-510","105"],["-1","-5","40","-90","95","-49","10"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-303","1710","-4005","4980","-3465","1278","-195"],["0","-450","2715","-6825","9150","-6900","2775","-465"],["0","-225","1509","-4170","6090","-4965","2145","-384"],["0","-45","354","-1095","1740","-1515","690","-129"],["0","-3","30","-105","180","-165","78","-15"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","-83","332","-415","0","415","-332","83"],["0","0","-111","444","-555","0","555","-444","111"],["0","0","-46","184","-230","0","230","-184","46"],["0","0","-6","24","-30","0","30","-24","6"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["120","-600","1200","-1200","600","-120"],["274","-1370","2740","-2740","1370","-274"],["225","-1125","2250","-2250","1125","-225"],["85","-425","850","-850","425","-85"],["15","-75","150","-150","75","-15"],["1","-5","10","-10","5","-1"]]},"deriv_order":0,"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"],["24","72","72","24"],["50","150","150","50"],["35","105","105","35"],["10","30","30","10"],["1","3","3","1"]]},"terms":[{"coeff":{"coeffs":[["0","36","168","336","360","204","48"],["24","195","542","772","654","329","76"],["50","250","329","-99","-521","-379","-86"],["35","163","187","-137","-428","-302","-70"],["10","65","169","237","197","94","20"],["1","11","45","91","98","54","12"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","36","228","648","1032","948","468","96"],["0","123","715","1878","2822","2503","1215","248"],["0","108","491","960","1090","800","363","76"],["0","33","64","-138","-532","-623","-324","-64"],["0","3","-12","-102","-228","-237","-120","-24"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","12","84","240","360","300","132","24"],["0","0","37","259","740","1110","925","407","74"],["0","0","28","196","560","840","700","308","56"],["0","0","6","42","120","180","150","66","12"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["120","274","225","85","15","1"],"operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"mobius"},"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":[["120","-600","1200","-1200","600","-120"],["274","-1370","2740","-2740","1370","-274"],["225","-1125","2250","-2250","1125","-225"],["85","-425","850","-850","425","-85"],["15","-75","150","-150","75","-15"],["1","-5","10","-10","5","-1"]]},"deriv_order":0}],"shift":0}],"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 = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0); 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":"the schedule d_n depends on n","status":"none"},"lean_declarations":["RealRooted.splits_fPolynomial"],"lean_route":"fTransform","lift_summary":{"hypotheses":[{"evidence":"lambda(n) = 1","name":"gauge_finite_nonzero","statement":"lambda(n) is finite and nonzero for every n >= n0","status":{"kind":"verified"}}],"identity":{"method":"forward_division","status":"certified"},"input_first_index":0,"input_interlacing":{"reason":"the schedule d_n depends on n","status":"not_proved"},"lean_replay":"not_attempted","operation":{"description":"((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0)","kind":"preserver_image","operator":{"a":"1","b":"0","c":"1","e":"1","schedule":{"first_degree":0,"first_index":0,"step":1},"shape":"mobius"}},"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 = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0), 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 [-1, 0]","input_root_region":{"lower":{"closed":true,"value":"-1"},"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":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically"},"verdict":"proved"},"notes":[],"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 = ((1) x + (1))^(d_n) P(((1) x + (0))/((1) x + (1))), d_n = 0 + 1 (n - 0) 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 [-1, 0]"},"kind":"preserver_image"}