{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","2","1"],["-1","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","1"],["6","2"]]},"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 Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1)."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-144","-804","-1536","-1230","-396","-48"],["-112","-1084","-2900","-2957","-1142","-151"],["0","-336","-1680","-2438","-1197","-183"],["0","0","-300","-811","-555","-106"],["0","0","0","-92","-111","-29"],["0","0","0","0","-7","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["64","336","308","-320","-390","-4","12"],["0","48","-836","-3452","-3875","-1330","-137"],["0","0","-528","-3152","-4858","-2311","-317"],["0","0","0","-708","-2001","-1353","-246"],["0","0","0","0","-260","-309","-79"],["0","0","0","0","0","-21","-9"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","80","816","2596","3824","2895","1084","147"],["0","0","368","1936","3660","3288","1478","244"],["0","0","0","264","680","632","403","107"],["0","0","0","0","-60","-271","-165","-16"],["0","0","0","0","0","-72","-81","-19"],["0","0","0","0","0","0","-7","-3"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","16","192","680","1072","825","296","39"],["0","0","0","96","604","1312","1249","524","79"],["0","0","0","0","120","472","614","320","58"],["0","0","0","0","0","48","108","78","18"],["0","0","0","0","0","0","4","6","2"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["48","204","240","90","12"],["16","188","404","261","40"],["0","40","216","242","51"],["0","0","36","91","31"],["0","0","0","12","9"],["0","0","0","0","1"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","144","612","720","270","36"],["0","48","564","1212","783","120"],["0","0","120","648","726","153"],["0","0","0","108","273","93"],["0","0","0","0","36","27"],["0","0","0","0","0","3"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","48","204","240","90","12"],["0","0","16","188","404","261","40"],["0","0","0","40","216","242","51"],["0","0","0","0","36","91","31"],["0","0","0","0","0","12","9"],["0","0","0","0","0","0","1"]]},"deriv_order":2,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["32","56","16","-8","0"],["16","108","80","2","0"],["0","40","108","41","2"],["0","0","36","43","5"],["0","0","0","12","4"],["0","0","0","0","1"]]},"terms":[{"coeff":{"coeffs":[["32","56","16","-8","0","0"],["112","412","440","146","4","2"],["0","336","780","557","128","9"],["0","0","300","443","181","20"],["0","0","0","92","76","14"],["0","0","0","0","7","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-16","-96","-196","-184","-86","-20","-2"],["0","-96","-364","-512","-329","-94","-9"],["0","0","-120","-328","-314","-122","-16"],["0","0","0","-48","-92","-54","-10"],["0","0","0","0","-4","-6","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["27","27","9","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","2","1"],["-1","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","1"],["6","2"]]},"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":[["-9","-3"],["-7","-3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["4","6","2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["3"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["1728","12528","36288","55620","49680","26622","8424","1458","108"],["1728","16848","60912","112968","120312","76113","28026","5481","432"],["576","8496","40608","93492","119052","87714","36855","8100","711"],["64","1904","13440","40076","61780","52988","25341","6282","625"],["0","160","2208","9288","17880","18096","9942","2804","318"],["0","0","144","1084","2800","3463","2236","727","94"],["0","0","0","48","204","336","267","102","15"],["0","0","0","0","4","12","13","6","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","5184","37584","108864","166860","149040","79866","25272","4374","324"],["0","5184","50544","182736","338904","360936","228339","84078","16443","1296"],["0","1728","25488","121824","280476","357156","263142","110565","24300","2133"],["0","192","5712","40320","120228","185340","158964","76023","18846","1875"],["0","0","480","6624","27864","53640","54288","29826","8412","954"],["0","0","0","432","3252","8400","10389","6708","2181","282"],["0","0","0","0","144","612","1008","801","306","45"],["0","0","0","0","0","12","36","39","18","3"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","1728","12528","36288","55620","49680","26622","8424","1458","108"],["0","0","1728","16848","60912","112968","120312","76113","28026","5481","432"],["0","0","576","8496","40608","93492","119052","87714","36855","8100","711"],["0","0","64","1904","13440","40076","61780","52988","25341","6282","625"],["0","0","0","160","2208","9288","17880","18096","9942","2804","318"],["0","0","0","0","144","1084","2800","3463","2236","727","94"],["0","0","0","0","0","48","204","336","267","102","15"],["0","0","0","0","0","0","4","12","13","6","1"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["18","27","9"],["12","18","6"],["2","3","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["-24","-60","-48","-12"],["-38","-95","-76","-19"],["-16","-40","-32","-8"],["-2","-5","-4","-1"]]},"deriv_order":0},{"coeff":{"coeffs":[["96","288","312","144","24"],["56","168","182","84","14"],["8","24","26","12","2"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["-192","-576","-624","-288","-48"],["-112","-336","-364","-168","-28"],["-16","-48","-52","-24","-4"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["1"],["1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","0"],["-4","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["2","3","1"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","-6048","-25920","-21168","61128","152226","141642","64881","14148","1107"],["0","-6048","-31104","-23544","117288","295920","293544","145071","34830","3159"],["0","-2016","-13824","-10296","83016","223812","242208","131355","35118","3663"],["0","-224","-2688","-2440","27464","83884","101888","61830","18596","2210"],["0","0","-192","-376","4240","16086","22906","15975","5464","733"],["0","0","0","-32","240","1412","2568","2147","846","127"],["0","0","0","0","0","36","108","117","54","9"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-2592","-13392","-19872","6912","50382","58509","31509","8235","837"],["0","0","-2592","-16848","-28728","14580","99144","124416","72738","20736","2322"],["0","0","-864","-7920","-16776","9972","76464","106470","68472","21402","2628"],["0","0","-96","-1648","-4984","2812","29676","47140","33756","11600","1552"],["0","0","0","-128","-760","284","6090","11405","9213","3487","505"],["0","0","0","0","-48","0","620","1428","1322","552","86"],["0","0","0","0","0","0","24","72","78","36","6"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["108","324","351","162","27"],["108","324","351","162","27"],["36","108","117","54","9"],["4","12","13","6","1"]]},"step_quotients":[[{"coeff":{"coeffs":[["288","864","936","432","72"],["696","2088","2262","1044","174"],["620","1860","2015","930","155"],["260","780","845","390","65"],["52","156","169","78","13"],["4","12","13","6","1"]]},"deriv_order":0},{"coeff":{"coeffs":[["-864","-2880","-3672","-2232","-648","-72"],["-1368","-4656","-6102","-3846","-1170","-138"],["-768","-2648","-3528","-2270","-708","-86"],["-184","-640","-862","-562","-178","-22"],["-16","-56","-76","-50","-16","-2"]]},"deriv_order":1},{"coeff":{"coeffs":[["288","1296","2376","2268","1188","324","36"],["264","1188","2178","2079","1089","297","33"],["80","360","660","630","330","90","10"],["8","36","66","63","33","9","1"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["1584","5184","6444","3780","1044","108"],["2460","8208","10479","6381","1857","207"],["1364","4608","5981","3723","1115","129"],["324","1104","1449","915","279","33"],["28","96","127","81","25","3"]]},"deriv_order":0},{"coeff":{"coeffs":[["-576","-2592","-4752","-4536","-2376","-648","-72"],["-528","-2376","-4356","-4158","-2178","-594","-66"],["-160","-720","-1320","-1260","-660","-180","-20"],["-16","-72","-132","-126","-66","-18","-2"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["4","12","13","6","1"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1","2","1"],["1","2","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-15","-5"],["-6","-2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["4"],["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 = f(n, theta) = 1 + (2) theta + (1) theta^2; 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.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"lift_summary":{"hypotheses":[{"evidence":"the polynomial with ascending coefficients [1, 2, 1] is fixed; exact check: real-rooted = true, coefficients of one sign = true","name":"euler_polynomial_roots_nonpositive","statement":"the polynomial in theta is real-rooted with every root <= 0 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":"f(n, theta) = 1 + (2) theta + (1) theta^2","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["2"]},{"denominator":["1"],"numerator":["1"]}],"shape":"euler_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","2","1"],["-1","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","1"],["6","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = f(n, theta) = 1 + (2) theta + (1) theta^2, 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 multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(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":"Unresolved: P_n = (a_n + b_n (x + 1)) P_(n-1) - c_n (x + 1)^2 P_(n-2) for n >= 2, with a_n = (4 n + 2)/(n + 2), b_n = (2 n + 1)/(n + 2), c_n = (n - 1)/(n + 2); Q_n(y) = y^(d_n) P_n(1/y - 1), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2); open hypotheses: root_region: the region contains the pole x = -1 of the coordinate change y = 1/(x + 1)","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) = ((6 n + 3)/(n + 2)) + ((2 n + 1)/(n + 2)) x, V_n(x) = 0, W_n(x) = ((-n + 1)/(n + 2)) + ((-2 n + 2)/(n + 2)) x + ((-n + 1)/(n + 2)) x^2; 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 = 1 (not a disproof): fails at n = 2: [x^1] W_n = -1/2 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 = 1 (not a disproof): fails at n = 2: [x^1] W_n = -1/2 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) = ((6 n + 3)/(n + 2)) + ((2 n + 1)/(n + 2)) x, B_n(x) = ((-n + 1)/(n + 2)) + ((-2 n + 2)/(n + 2)) x + ((-n + 1)/(n + 2)) x^2: 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, 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) = ((6 n + 3)/(n + 2)) + ((2 n + 1)/(n + 2)) x, B_n(x) = ((-n + 1)/(n + 2)) + ((-2 n + 2)/(n + 2)) x + ((-n + 1)/(n + 2)) x^2","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, 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; Proposition 3.3 (the case B_n(x) = -(c_n x + d_n)^2)"},"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 = f(n, theta) = 1 + (2) theta + (1) theta^2 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"}