{"id":"e-a4c8bd871ea20676","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-c8b3f39d03de798f","premise_count":0,"theorem":"constant current multiplier: P_0 = 1, P_1 = s, P_(k+2) = a P_(k+1) + (b t + c) P_k with a, s >= 0, b > 0.  P_k(t) = Q_k(b t + c) for the rows Q_k with b = 1, c = 0, whose map sends PF inputs to PF outputs (an interlacing-preserving 2 x 2 matrix, Branden, arXiv:1410.6601, Theorem 8.5), so every PF input has a real-rooted image with roots <= -c/b; PF inputs (also those with roots in any [-R, 0]) have PF images if and only if every P_k(0) >= 0, if and only if a^2 + 4c >= 0 and (2s >= a or c >= s^2 - a s) (RealRooted orderTwoBasis_pf_equivalences, basisTransform_orderTwoBasis_preserves_bounded_pf_iff)","lean_route":null,"lean_declarations":[],"certificate_hash":"0e577a35c4229481ab3fe79d3236c1e70cd92b7908d45972ed48dc273f2bd2d4","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map_theorem","certificate_raw_size":3123,"certificate_compressed_size":1024,"conclusion_name":"Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","claims":[{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a real-rooted image with every root <= -c/b = 0"},{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"every PF input has a PF image (zero allowed)"}],"premises":[],"cited_by":[{"node_id":"n-c8b3f39d03de798f","claim":"basis_map_preserver"}]}