{"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"],["2","3"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","9"],["0","0","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","3"],["4","6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"basis_map_A013610 of Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-96","-828","-1728","-1296"],["-160","-1986","-5094","-4077"],["-88","-1650","-5472","-4941"],["-16","-576","-2610","-2862"],["0","-72","-540","-783"],["0","0","-36","-81"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-160","-1080","-720","324"],["0","-352","-3906","-7434","-3699"],["0","-232","-3990","-11736","-8559"],["0","-48","-1584","-6750","-6642"],["0","0","-216","-1548","-2133"],["0","0","0","-108","-243"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","0","64","927","3852","3969"],["0","0","0","579","4716","6588"],["0","0","-48","-450","378","2889"],["0","0","-16","-396","-1260","-432"],["0","0","0","-72","-450","-513"],["0","0","0","0","-36","-81"]]},"deriv_order":2,"shift":0},{"coeff":{"coeffs":[["0","0","0","32","351","1116","1053"],["0","0","0","32","513","1962","2133"],["0","0","0","8","240","1170","1566"],["0","0","0","0","36","270","486"],["0","0","0","0","0","18","54"]]},"deriv_order":3,"shift":0},{"coeff":{"coeffs":[["48","126","108"],["64","375","360"],["28","354","459"],["4","135","279"],["0","18","81"],["0","0","9"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["0","144","378","324"],["0","192","1125","1080"],["0","84","1062","1377"],["0","12","405","837"],["0","0","54","243"],["0","0","0","27"]]},"deriv_order":1,"shift":1},{"coeff":{"coeffs":[["0","0","48","126","108"],["0","0","64","375","360"],["0","0","28","354","459"],["0","0","4","135","279"],["0","0","0","18","81"],["0","0","0","0","9"]]},"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":[["8","-12","0"],["20","0","0"],["16","57","18"],["4","63","45"],["0","18","36"],["0","0","9"]]},"terms":[{"coeff":{"coeffs":[["8","-12","0","0"],["32","126","0","54"],["40","354","522","243"],["16","288","810","540"],["0","72","360","378"],["0","0","36","81"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-8","-42","-72","-54"],["0","-16","-141","-360","-243"],["0","-8","-132","-468","-432"],["0","0","-36","-198","-270"],["0","0","0","-18","-54"]]},"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"],["2","3"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","9"],["0","0","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","3"],["4","6"]]},"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":[["-6","-9"],["-4","-9"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","2","6"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["3"],["1"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["0","0","432","3726","11664","16038","8748"],["0","0","864","9315","36450","60507","34992"],["0","0","684","9666","45927","88452","57591"],["0","0","268","5322","30321","67176","50625"],["0","0","52","1638","11286","29106","25758"],["0","0","4","267","2340","7263","7614"],["0","0","0","18","243","972","1215"],["0","0","0","0","9","54","81"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","1296","11178","34992","48114","26244"],["0","0","0","2592","27945","109350","181521","104976"],["0","0","0","2052","28998","137781","265356","172773"],["0","0","0","804","15966","90963","201528","151875"],["0","0","0","156","4914","33858","87318","77274"],["0","0","0","12","801","7020","21789","22842"],["0","0","0","0","54","729","2916","3645"],["0","0","0","0","0","27","162","243"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","0","432","3726","11664","16038","8748"],["0","0","0","0","864","9315","36450","60507","34992"],["0","0","0","0","684","9666","45927","88452","57591"],["0","0","0","0","268","5322","30321","67176","50625"],["0","0","0","0","52","1638","11286","29106","25758"],["0","0","0","0","4","267","2340","7263","7614"],["0","0","0","0","0","18","243","972","1215"],["0","0","0","0","0","0","9","54","81"]]},"deriv_order":2}],"step_multiplier":{"coeffs":[["0","9","27"],["0","6","18"],["0","1","3"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","-36","-108"],["0","0","-57","-171"],["0","0","-24","-72"],["0","0","-3","-9"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","24","144","216"],["0","0","14","84","126"],["0","0","2","12","18"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","-48","-288","-432"],["0","0","-28","-168","-252"],["0","0","-4","-24","-36"]]},"deriv_order":0}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0"],["3"],["3"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","0"],["-2","-6"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["0","1","3"]]},"deriv_order":2,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["0","0","0","0","10854","75087","157464","89667"],["0","0","0","0","23166","167427","379080","255879"],["0","0","0","0","19332","148959","371790","296703"],["0","0","0","0","7908","67338","190512","179010"],["0","0","0","0","1590","16137","53892","59373"],["0","0","0","0","126","1899","7992","10287"],["0","0","0","0","0","81","486","729"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","0","0","4617","35235","86751","67797"],["0","0","0","0","0","9882","80190","214326","188082"],["0","0","0","0","0","8262","73224","216270","212868"],["0","0","0","0","0","3384","34272","114264","125712"],["0","0","0","0","0","681","8631","33399","40905"],["0","0","0","0","0","54","1098","5130","6966"],["0","0","0","0","0","0","54","324","486"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["0","0","27","162","243"],["0","0","27","162","243"],["0","0","9","54","81"],["0","0","1","6","9"]]},"step_quotients":[[{"coeff":{"coeffs":[["0","0","216","1296","1944"],["0","0","522","3132","4698"],["0","0","465","2790","4185"],["0","0","195","1170","1755"],["0","0","39","234","351"],["0","0","3","18","27"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","-144","-1080","-2592","-1944"],["0","0","-204","-1638","-4320","-3726"],["0","0","-106","-894","-2502","-2322"],["0","0","-24","-210","-612","-594"],["0","0","-2","-18","-54","-54"]]},"deriv_order":1},{"coeff":{"coeffs":[["0","0","0","36","324","972","972"],["0","0","0","33","297","891","891"],["0","0","0","10","90","270","270"],["0","0","0","1","9","27","27"]]},"deriv_order":2}],[{"coeff":{"coeffs":[["0","0","288","2052","4536","2916"],["0","0","408","3069","7398","5589"],["0","0","212","1659","4230","3483"],["0","0","48","387","1026","891"],["0","0","4","33","90","81"]]},"deriv_order":0},{"coeff":{"coeffs":[["0","0","0","-72","-648","-1944","-1944"],["0","0","0","-66","-594","-1782","-1782"],["0","0","0","-20","-180","-540","-540"],["0","0","0","-2","-18","-54","-54"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["0","0","1","6","9"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["0","0","9"],["0","0","9"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-10","-15"],["-4","-6"]]},"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":{"from_index":1,"justification":"the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 1; T = f(n, theta) = 1 + (2) theta + (1) theta^2 is independent of n and maps every real-rooted polynomial to a real-rooted polynomial or zero, so by the Hermite--Kakeya--Obreschkoff theorem (both directions) T(P_(m-1)) and T(P_m) have weakly interlacing zeros; the nonzero gauge does not move zeros, so Q_(n-1) and Q_n interlace weakly (orientation not determined) for every n >= 1","kind":"weak","orientation":"unordered","status":"claimed"},"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":{"interlacing":{"from_index":1,"justification":{"premises":["the parent theorem (ThreeTermRecurrence) proves P_(m-1) strictly interlacing P_m for every m >= 1; T = f(n, theta) = 1 + (2) theta + (1) theta^2 is independent of n and maps every real-rooted polynomial to a real-rooted polynomial or zero, so by the Hermite--Kakeya--Obreschkoff theorem (both directions) T(P_(m-1)) and T(P_m) have weakly interlacing zeros; the nonzero gauge does not move zeros, so Q_(n-1) and Q_n interlace weakly (orientation not determined) for every n >= 1"],"theorem":"Hermite--Kakeya--Obreschkoff theorem (N. Obreschkoff, Verteilung und Berechnung der Nullstellen reeller Polynome, 1963; see S. Fisk, Polynomials, Roots, and Interlacing, arXiv:math/0612833): real polynomials f, g have weakly interlacing zeros iff alpha f + beta g is real-rooted or zero for all real alpha, beta; a linear T independent of n that maps every real-rooted polynomial to a real-rooted polynomial or zero therefore maps interlacing pairs to pairs with weakly interlacing zeros (orientation not determined)"},"kind":"weak","orientation":"unordered"},"status":"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"],["2","3"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","9"],["0","0","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","3"],["4","6"]]},"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":"three_term_recurrence","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_interlacing_report":{"conclusion":{"first_index":0,"interlacing":"strict","interlacing_from":1,"root_region":{"upper":{"closed":false,"value":"0"}},"simple_roots":true,"statement":"every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)"},"hypotheses":[{"evidence":"f(n) = n + 2 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) = n + 2 at n = 2 + u have one sign)","name":"left_factor_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["4","1"]},"numerator":["2","1"],"range":{"first":"2","last":null}},"decision":"holds"},"statement":"the left-hand factor f(n) is nonzero for every n >= 2","status":{"kind":"verified"}},{"evidence":"f(n) a_n = 4 n + 2 != 0 for every integer n in [2, +inf) (exact; Taylor shift: the coefficients of f(n) a_n = 4 n + 2 at n = 2 + u have one sign)","name":"leading_coefficient_nonzero","sign_decision":{"certificate":{"condition":"nonzero","denominator":["1"],"method":{"kind":"taylor_shift","shifted_denominator":["1"],"shifted_numerator":["10","4"]},"numerator":["2","4"],"range":{"first":"2","last":null}},"decision":"holds"},"statement":"a_n != 0 for every n >= 2","status":{"kind":"verified"}},{"evidence":"Q_0 has degree 0, Q_1 degree 1; simple real roots and strict interlacing checked exactly","name":"seeds_interlace","statement":"Q_0 and Q_1 have simple real roots, degrees e and e + 1, and Q_0 strictly interlaces Q_1","status":{"kind":"verified"}},{"evidence":"beta_2 = 9/20 (exact)","name":"first_coefficient_positive","statement":"beta_2 = c_2 L_0 / (a_2 L_1) > 0","status":{"kind":"verified"}},{"evidence":"beta_n = (9/16 n^2 - 9/16)/(n^2 - 1/4) > 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of beta_n = (9/16 n^2 - 9/16)/(n^2 - 1/4) at n = 3 + u have one sign)","name":"recurrence_coefficient_positive","sign_decision":{"certificate":{"condition":"positive","denominator":["-1/4","0","1"],"method":{"kind":"taylor_shift","shifted_denominator":["35/4","6","1"],"shifted_numerator":["9/2","27/8","9/16"]},"numerator":["-9/16","0","9/16"],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"beta_n = c_n / (a_n a_(n-1)) > 0 for every n >= 3","status":{"kind":"verified"}},{"evidence":"seeds checked exactly; positive-ratio induction at t = 0 with g(n) = (3/4 n + 3/2)/(n + 1/2) (the exact ratio r_n): g(n) > 0 for n >= 2, r_2 >= g(2) exactly, and (t - alpha_n) - beta_n/g(n-1) - g(n) >= 0 for every integer n in [3, +inf) (exact; Taylor shift: the coefficients of (t - alpha_n) - beta_n/g(n-1) - g(n) at n = 3 + u have one sign)","name":"root_upper_bound","sign_decision":{"certificate":{"condition":"nonnegative","denominator":["-1/16","-5/16","-1/4","1","2","1"],"method":{"kind":"taylor_shift","shifted_denominator":["1715/4","10339/16","1547/4","115","17","1"],"shifted_numerator":[]},"numerator":[],"range":{"first":"3","last":null}},"decision":"holds"},"statement":"every root of Q_n is < 0 for every n >= 0 (region (-inf, 0) for P)","status":{"kind":"verified"}}],"lean_replay":"not_attempted","normal_form":"P_n = (a_n + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 2, with a_n = (4 n + 2)/(n + 2), b_n = (6 n + 3)/(n + 2), c_n = (9 n - 9)/(n + 2); Q_n(y) = y^(d_n) P_n(1/y + 0), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","3"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","9"],["0","0","-9"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","3"],["4","6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"reference":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","requested_root_region":{"upper":{"closed":false,"value":"0"}},"schema":"polytool.recurrence-real-rootedness-theorem.v1","status":"proved","theorem":"three_term_recurrence"},"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":"P_n = (a_n + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 2, with a_n = (4 n + 2)/(n + 2), b_n = (6 n + 3)/(n + 2), c_n = (9 n - 9)/(n + 2); Q_n(y) = y^(d_n) P_n(1/y + 0), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2): every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)","route":"three_term_recurrence","success":true,"variant":"three_term_recurrence"}],"conditional_on":[],"interlacing":{"from_index":1,"justification":{"premises":["every hypothesis of the theorem is verified exactly for every index: P_n = (a_n + b_n (x + 0)) P_(n-1) - c_n (x + 0)^2 P_(n-2) for n >= 2, with a_n = (4 n + 2)/(n + 2), b_n = (6 n + 3)/(n + 2), c_n = (9 n - 9)/(n + 2); Q_n(y) = y^(d_n) P_n(1/y + 0), d_n = deg P_0 + n - 0, satisfies Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2)","every P_n, n >= 0, is nonzero and real-rooted, with simple roots from n = 0 on; P_(n-1) strictly interlaces P_n for n >= 1; every root lies in (-inf, 0)"],"theorem":"three_term_recurrence: three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction"},"kind":"strict","orientation":"previous_interlaces_next"},"route":"three_term_recurrence","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"}