{"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"],["1","2"],["1","8","3"],["1","22","33","4"]],"recurrence":{"denominator":{"coeffs":[["3"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","-12"],["0","0","40"],["0","0","-63"],["0","0","59"],["0","0","-32"],["0","0","9"],["0","0","-1"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","-4","-8"],["0","10","20"],["0","-12","-20"],["0","8","10"],["0","-2","-2"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-3"],["1","-4","3"],["-1","10","-1"],["0","-8","0"],["0","2","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","6"],["-4","-6"],["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"theta_plus_one of Triangle T(n, k) = coefficients of p(x, n) where p(x,n) = (x+1)*p(x, n-1) + n*(n-1)*x*p(x, n-2), read by rows."},"identifying_rows":4,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["0","0","156","-624","936","-624","156"],["0","0","448","-1792","2688","-1792","448"],["0","0","507","-2028","3042","-2028","507"],["0","0","293","-1172","1758","-1172","293"],["0","0","92","-368","552","-368","92"],["0","0","15","-60","90","-60","15"],["0","0","1","-4","6","-4","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","156","-504","456","96","-324","120"],["0","214","-684","596","176","-474","172"],["0","108","-340","280","120","-260","92"],["0","24","-74","56","36","-64","22"],["0","2","-6","4","4","-6","2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["13","-194","653","-932","623","-170","7"],["7","-232","863","-1272","853","-224","5"],["1","-110","431","-644","431","-110","1"],["0","-24","96","-144","96","-24","0"],["0","-2","8","-12","8","-2","0"]]},"deriv_order":0,"shift":2},{"coeff":{"coeffs":[["-20","66","-64","-4","36","-14"],["-12","38","-32","-12","28","-10"],["-2","6","-4","-4","6","-2"]]},"deriv_order":0,"shift":3},{"coeff":{"coeffs":[["7","-28","42","-28","7"],["5","-20","30","-20","5"],["1","-4","6","-4","1"]]},"deriv_order":0,"shift":4}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0,1,2,3],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"],["1","3"],["1","10","12"],["1","25","80","60"]],"recurrence":{"denominator":{"coeffs":[["3","6","3"],["-3","-6","-3"],["1","2","1"]]},"terms":[{"coeff":{"coeffs":[["0","0","-12","-48","-72","-48","-12"],["0","0","40","160","240","160","40"],["0","0","-63","-252","-378","-252","-63"],["0","0","59","236","354","236","59"],["0","0","-32","-128","-192","-128","-32"],["0","0","9","36","54","36","9"],["0","0","-1","-4","-6","-4","-1"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","-4","-24","-48","-40","-12"],["0","10","60","120","100","30"],["0","-12","-68","-132","-108","-32"],["0","8","42","78","62","18"],["0","-2","-10","-18","-14","-4"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-1","-6","-15","-16","-6"],["1","0","-3","-2","0"],["-1","6","23","24","8"],["0","-8","-24","-24","-8"],["0","2","6","6","2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","18","24","10"],["-4","-18","-24","-10"],["2","8","10","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["7","5","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"],["1","2"],["1","8","3"],["1","22","33","4"]],"recurrence":{"denominator":{"coeffs":[["3"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","-12"],["0","0","40"],["0","0","-63"],["0","0","59"],["0","0","-32"],["0","0","9"],["0","0","-1"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","-4","-8"],["0","10","20"],["0","-12","-20"],["0","8","10"],["0","-2","-2"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-3"],["1","-4","3"],["-1","10","-1"],["0","-8","0"],["0","2","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","6"],["-4","-6"],["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_leader_shift":4,"parent_valid_from_base":0,"quotients":[{"differentiations":[{"coeff":{"coeffs":[["7","-28","42","-28","7"],["5","-20","30","-20","5"],["1","-4","6","-4","1"]]},"deriv_order":0}],"shift":0}],"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","156"],["0","0","448"],["0","0","507"],["0","0","293"],["0","0","92"],["0","0","15"],["0","0","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","156","120"],["0","214","172"],["0","108","92"],["0","24","22"],["0","2","2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["13","-142","7"],["7","-204","5"],["1","-106","1"],["0","-24","0"],["0","-2","0"]]},"deriv_order":0,"shift":2},{"coeff":{"coeffs":[["-20","-14"],["-12","-10"],["-2","-2"]]},"deriv_order":0,"shift":3},{"coeff":{"coeffs":[["7"],["5"],["1"]]},"deriv_order":0,"shift":4}]},"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 4 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"],["1","2"],["1","8","3"],["1","22","33","4"]],"recurrence":{"denominator":{"coeffs":[["3"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","-12"],["0","0","40"],["0","0","-63"],["0","0","59"],["0","0","-32"],["0","0","9"],["0","0","-1"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","-4","-8"],["0","10","20"],["0","-12","-20"],["0","8","10"],["0","-2","-2"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-3"],["1","-4","3"],["-1","10","-1"],["0","-8","0"],["0","2","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","6"],["-4","-6"],["2","2"]]},"deriv_order":0,"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":{"statement":"open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only)","status":"open"},"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":"open"},"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 rule is not f(n) P_n = c_1(n, x) P_(n-1) + c_2(n, x) P_(n-2) with both terms nonzero","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 rule is not f(n) P_n = c_0(n, x) P_(n-1) + c_1(n, x) P'_(n-1) + c_2(n, x) P_(n-2) with a derivative or a lag term","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 rule is not f(n) P_n = c_1(n, x) P_(n-1) + c_d(n, x) P'_(n-1) + c_2(n, x) P_(n-2) with a nonzero lag term and a nonzero P_(n-1) or P'_(n-1) term","route":"liu_wang_three_term","success":false,"variant":"liu_wang_three_term"}],"conditional_on":[],"rows_checked":10,"statement":"open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only)","status":"not_proved"},"rows_compared":16,"schema":"polytool.recurrence-preserver-image.v1","statement":"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 is certified; the lift is Open (open: no route proved that every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign; the first 10 parent rows pass the exact check (evidence only))"},"kind":"preserver_image"}