{"input":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","2","-1"],["0","0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","0","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"kind":"row_factor","lift":{"cofactor":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"exponent_offset":0,"exponent_slope":1,"factor":["1","1"],"factor_real_rooted":true,"factor_roots_nonpositive":true,"identity":{"certificate":{"cofactor":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"cofactor_relation":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["0","-1"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-1","1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":1}]},"cofactor_valid_from_base":0,"derivative_order":1,"exceptional_bases":[],"exponent_offset":0,"exponent_slope":1,"factor":["1","1"],"identifying_indices":[0],"input_leader_shift":1,"input_relation":{"terms":[{"coeff":{"coeffs":[["-1","-2","-1"],["0","0","-2"]]},"deriv_order":0,"shift":0},{"coeff":{"coeffs":[["0","-1","0","1"]]},"deriv_order":1,"shift":0},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"shift":1}]},"input_valid_from_base":0,"removed_factor_power":2,"statement":"M_S = F^h M'_S with an x-free leader, so the cofactor rows S_n are polynomials; F^(e(n)) S_n satisfies the input rule at every base n >= 0 and agrees with Q_n on the 1 identifying rows, so Q_n = F^(e(n)) S_n for every n >= 0"},"status":"certified"},"lift_summary":{"hypotheses":[{"evidence":"exact real-root count (is_real_rooted_bigint_coeffs)","name":"factor_real_rooted","statement":"F = 1 + 1 x is real-rooted","status":{"kind":"verified"}}],"identity":{"method":"substitution_division","status":"certified"},"input_first_index":0,"input_interlacing":{"reason":"the exponent e(n) = 1 n +0 depends on n, so Q_(n-1) and Q_n carry different powers of F","status":"not_proved"},"lean_replay":"not_attempted","operation":{"exponent_offset":0,"exponent_slope":1,"factor":["1","1"],"kind":"row_factor"},"parent":{"index_shift":0,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"},"relation":"Q_n = (1 + 1 x)^(1 n +0) S_n for every n >= 0"},"parent_proof":{"route":"root_domain","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 cofactor row S_n 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 product of polynomials is real-rooted iff every factor is; its roots are the union of theirs"},"verdict":"proved"},"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":"not applicable: expected one nonzero lag term","route":"product_recurrence","success":false,"variant":"product_recurrence"},{"detail":"no theorem matched (weighted_renewal_window: coefficients must be index-independent; fixed_delay_predecessor_window: derivatives and alternating signs are unsupported)","route":"paper_theorem","success":false,"variant":"match_recurrence_theorems"},{"detail":"no unconditional all-index source claim with roots in (-inf, 0]","route":"root_domain","success":false,"variant":"identity (affine 1, 0)"},{"detail":"source claim: every P_n, n >= 0, is real-rooted in (-inf, 0] (CertifiedFamilyInvariant): the completed induction for Q_n and real_mobius_equivalence (target to source; every map condition certified for all indices); deg Q_n = d_n by the degree formula, so no root of P_n is added at the image of infinity","route":"root_domain","success":true,"variant":"f_polynomial"}],"conditional_on":[],"route":"root_domain","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}}