{"certification":{"candidate":{"gauge":{"kind":"none"},"index_shift":0,"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["2","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"parent_name":"Triangle read by rows: T(n,k) = (n+k+1)*binomial(n,k), 0 <= k <= n."},"identifying_rows":1,"identity":{"certificate":{"certificate":{"dividend_relation":{"terms":[{"coeff":{"coeffs":[["-5","-13","-11","-3"],["-5","-13","-10","-2"],["-1","-3","-2","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-5","-13","-11","-3"],["-5","-13","-10","-2"],["-1","-3","-2","0"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1","2","1"],["3","4","2"],["1","2","0"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["1","2","1"],["3","4","2"],["1","2","0"]]},"deriv_order":1,"shift":1}]},"exceptional_bases":[],"gauge":{"kind":"none"},"identifying_indices":[0],"index_shift":0,"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-1","0","-1"],["1","0","2"],["1","2","0"]]},"terms":[{"coeff":{"coeffs":[["1","3","3","1"],["3","7","6","2"],["1","3","2","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"input_valid_from_base":0,"multiplier":["1/4","1","1"],"operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"},"parent":{"first_index":0,"initial_polynomials":[["1"],["2","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-1"]]},"deriv_order":0,"offset":2,"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":[["-2","-3"],["-1","0"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-1","-3","-2"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"],["2"]]},"deriv_order":0,"shift":1}]},"quotient":[{"coeff":{"coeffs":[["1","6","15","20","15","6","1"],["7","42","106","144","111","46","8"],["18","112","290","402","316","134","24"],["21","140","379","538","426","180","32"],["11","80","231","338","264","104","16"],["2","16","50","76","56","16","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["1","6","15","20","15","6","1"],["7","42","106","144","111","46","8"],["18","112","290","402","316","134","24"],["21","140","379","538","426","180","32"],["11","80","231","338","264","104","16"],["2","16","50","76","56","16","0"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["1","4","6","4","1"],["6","26","42","30","8"],["13","62","109","84","24"],["12","64","124","104","32"],["4","24","52","48","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["3","15","30","30","15","3"],["15","82","178","192","103","22"],["27","163","387","453","262","60"],["21","140","365","466","292","72"],["6","44","126","176","120","32"]]},"deriv_order":0},{"coeff":{"coeffs":[["-1","-7","-20","-30","-25","-11","-2"],["-4","-30","-92","-148","-132","-62","-12"],["-5","-41","-137","-239","-230","-116","-24"],["-2","-18","-66","-126","-132","-72","-16"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["0","0","0","0","0","0"],["1","7","19","25","16","4"],["3","22","63","88","60","16"],["2","16","50","76","56","16"]]},"deriv_order":0},{"coeff":{"coeffs":[["-1","-8","-26","-44","-41","-20","-4"],["-3","-25","-85","-151","-148","-76","-16"],["-2","-18","-66","-126","-132","-72","-16"]]},"deriv_order":1}]]},{"annihilator":{"terms":[{"coeff":{"coeffs":[["0","0"],["-2","-1"],["-1","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["1","2","1"],["1","3","2"]]},"deriv_order":1,"shift":0}]},"quotient":[{"coeff":{"coeffs":[["-1","-1","8","22","23","11","2"],["-4","-5","37","113","127","64","12"],["-6","-11","56","201","244","128","24"],["-5","-14","27","140","184","96","16"],["-2","-8","-2","28","40","16","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["1","7","20","30","25","11","2"],["6","41","115","171","143","64","12"],["12","83","234","347","288","128","24"],["9","66","193","288","232","96","16"],["2","16","50","76","56","16","0"]]},"deriv_order":1}],"step_multiplier":{"coeffs":[["1","4","6","4","1"],["6","26","42","30","8"],["13","62","109","84","24"],["12","64","124","104","32"],["4","24","52","48","16"]]},"step_quotients":[[{"coeff":{"coeffs":[["-3","-15","-30","-30","-15","-3"],["-16","-87","-188","-202","-108","-23"],["-32","-191","-449","-521","-299","-68"],["-30","-197","-506","-637","-394","-96"],["-13","-94","-265","-364","-244","-64"],["-2","-16","-50","-76","-56","-16"]]},"deriv_order":0},{"coeff":{"coeffs":[["2","13","35","50","40","17","3"],["9","63","182","278","237","107","20"],["14","107","335","551","503","242","48"],["9","75","255","453","444","228","48"],["2","18","66","126","132","72","16"]]},"deriv_order":1}],[{"coeff":{"coeffs":[["3","15","30","30","15","3"],["12","63","131","135","69","14"],["16","89","192","201","102","20"],["9","52","113","114","52","8"],["2","12","26","24","8","0"]]},"deriv_order":0},{"coeff":{"coeffs":[["2","15","46","74","66","31","6"],["7","55","177","299","280","138","28"],["7","59","203","365","362","188","40"],["2","18","66","126","132","72","16"]]},"deriv_order":1}]]}],"restart_bases":[],"row_multiplier":{"coeffs":[["4","16","24","16","4"],["8","40","72","56","16"],["4","24","52","48","16"]]},"start_base":0}},"shifted_parent_relation":{"terms":[{"coeff":{"coeffs":[["1","2","1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["-2","-2"]]},"deriv_order":0,"shift":1},{"coeff":{"coeffs":[["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 = phi(n, D) = 1 + (1) D; 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.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"lift_summary":{"hypotheses":[{"evidence":"the polynomial with ascending coefficients [1, 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 + (1) D","kind":"preserver_image","operator":{"coefficients":[{"denominator":["1"],"numerator":["1"]},{"denominator":["1"],"numerator":["1"]}],"shape":"derivative_polynomial"}},"parent":{"gauge":{"kind":"none"},"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = lambda(n) T_n(P_(n+0)) with T = phi(n, D) = 1 + (1) D, 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 (-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":"open"},"notes":["the division remainder is removed by row annihilators of the shifted parent"],"parent_proof":{"attempts":[{"detail":"the rule is not P_(n+k) = c(x) P_n with c free of n","route":"periodic_product","success":false,"variant":"P_(n+k) = c(x) P_n"},{"detail":"no theorem matched (weighted_renewal_window: coefficient of P_(n-1) must be 1 after normalization; fixed_delay_predecessor_window: coefficient of P_(n-1) must be 1 (+ w(n) t) after normalization)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"HypothesisFailed: 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 = 0, b_n = 2, c_n = 1; 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: leading_coefficient_nonzero: fails at n = 2: f(n) a_n = 0 = 0 there (exact); first_coefficient_positive: a_2 or c_2 is undefined or a_2 = 0; recurrence_coefficient_positive: fails at n = 3: the denominator of beta_n = 1 vanishes there; 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) = (2) + (2) x, V_n(x) = 0, W_n(x) = (-1) + (-2) x + (-1) x^2; open hypotheses: lag_degree_step_nonnegative: fails at n = 2: mu_n = -1 = -1 there (exact); multipliers_vanish_at_zero: [x^0] c_2(n, x) = -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 = -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 = -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":"the parent equals the flagged entry, but the flag gives real-rootedness only and one-signed coefficients are not shown: the weight of the coefficient of x^s of P_(n-2) in the coefficient of x^(s+0) is not shown to be >= 0 for n >= 2","route":"attestation","success":false,"variant":"oeis_catalog:A347823:lean_proved"},{"detail":"no lean_proved catalog entry equals the parent; 3 with the same first index and seeds differ in the rule or in later initial rows (oeis_catalog:A029600:lean_proved, oeis_catalog:A124932:lean_proved, oeis_catalog:A132774:lean_proved)","route":"attestation","success":false,"variant":"oeis_catalog"}],"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 = phi(n, D) = 1 + (1) D 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"}