{"certification":{"candidate":{"basis":{"family":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"name":"A060821"},"coefficient_family":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},"coefficient_roots":{"parent_proof":{"route":"basis_map_coefficient_roots(periodic_product)","statement":"every coefficient row R_n, n >= 0, is zero or real-rooted with every root in (-inf, 0]","status":"proved"},"source_interval":{},"target_interval":{"upper":{"closed":true,"value":"0"}},"upper_bound":{"attempts":[{"detail":"c and the seeds are nonzero, real-rooted and of one sign, so P_(n0 + k m + i) = c^m P_(n0 + i) is too","route":"periodic_product","success":true,"variant":"P_(n+k) = c(x) P_n"}],"conditional_on":[],"route":"periodic_product","rows_checked":10,"statement":"every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","status":"proved"}},"conclusion":{"hypotheses":["multiplier_slope_positive","kappa_positive","initial_row_real_rooted"],"input_interval":{},"nonnegative_coefficients":false,"output_interval":{},"sharp":true,"statement":"every real-rooted input has a real-rooted image"},"identity":{"certificate":{"basis":{"family":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"name":"A060821"},"coefficient_family":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"direction":"input_by_transported","exceptional_bases":[],"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"multiplier":["1"],"quotients":[{"row":[[{"coeff":{"coeffs":[["1"]]},"deriv_order":0}]],"shift":0}]},"status":"certified"},"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"lift_summary":{"hypotheses":[{"evidence":"exact","name":"multiplier_slope_positive","statement":"b > 0","status":{"kind":"verified"}},{"evidence":"exact","name":"kappa_positive","statement":"kappa > 0","status":{"kind":"verified"}},{"evidence":"exact root isolation","name":"initial_row_real_rooted","statement":"g = P_0 is nonzero and real-rooted","status":{"kind":"verified"}}],"identity":{"method":"basis_map_division_input_by_transported","status":"certified"},"input_first_index":0,"input_interlacing":{"reason":"the parent route periodic_product proves no interlacing of consecutive parent rows","status":"not_proved"},"lean_replay":"not_attempted","operation":{"basis":"A060821","basis_family":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"kind":"basis_map","source_interval":"(-inf, +inf)","target_interval":"(-inf, +inf)"},"parent":{"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = T_P(R_n), T_P(u^k) = P_(0 + k), P the basis family A060821"},"parent_proof":{"route":"basis_map_coefficient_roots(periodic_product)","statement":"every coefficient row R_n, n >= 0, is zero or real-rooted with every root in (-inf, 0]","status":"proved"},"root_transfer":{"input_conclusion":"every input row Q_n, n >= 0, is zero or real-rooted with every root in (-inf, +inf)","input_root_region":{},"parent_hypothesis":"every coefficient row R_n is zero or real-rooted with every root in the source interval of the map theorem","parent_root_region":{"upper":{"closed":true,"value":"0"}},"theorem":"Hermite-type operators L f = (a + b t) f - kappa f', b > 0, kappa >= 0: every shift L - rho keeps real-rootedness (the derivative coefficient is <= 0 everywhere: Ma and Wang, EJC 15 (2008) R17, Theorem 2), and T(p) = c prod_j (L - rho_j) g for p = c prod_j (u - rho_j); so every real-rooted input has a real-rooted image"},"verdict":"proved"},"map_theorem":{"basis":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"basis_name":"A060821","conclusions":[{"hypotheses":["multiplier_slope_positive","kappa_positive","initial_row_real_rooted"],"input_interval":{},"nonnegative_coefficients":false,"output_interval":{},"sharp":true,"statement":"every real-rooted input has a real-rooted image"}],"hypotheses":[{"evidence":"exact","name":"multiplier_slope_positive","statement":"b > 0","status":{"kind":"verified"}},{"evidence":"exact","name":"kappa_positive","statement":"kappa > 0","status":{"kind":"verified"}},{"evidence":"exact root isolation","name":"initial_row_real_rooted","statement":"g = P_0 is nonzero and real-rooted","status":{"kind":"verified"}}],"lean_replay":"not_attempted","schema":"polytool.recurrence-basis-map-theorem.v1","shape":{"a":"0","b":"2","initial_row":["1"],"kappa":"1","kind":"hermite_differential"},"status":"proved","theorem":"Hermite-type operators L f = (a + b t) f - kappa f', b > 0, kappa >= 0: every shift L - rho keeps real-rootedness (the derivative coefficient is <= 0 everywhere: Ma and Wang, EJC 15 (2008) R17, Theorem 2), and T(p) = c prod_j (L - rho_j) g for p = c prod_j (u - rho_j); so every real-rooted input has a real-rooted image"},"schema":"polytool.recurrence-basis-map-lift.v1"},"kind":"basis_map"}