{"id":"e-3a8d1c447a607f39","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-df97cd413ec843e8","premise_count":0,"theorem":"index-dependent scalar term: P_(k+1) = (L + k s) P_k with L f = (a + b t) f + kappa (t - h) f' gives T = U_g o R_s (RealRooted basisMap_factorization_of_scalarIndex_recurrence), where R_s(u^k) = u (u + s) ... (u + (k-1) s) keeps every root <= 0 for s >= 0 (Su, Yang and Zhang, Australas. J. Combin. 56 (2013), Theorem 4; Brenti, Mem. AMS 413 (1989), Theorem 2.4.3; RealRooted NewtonParametersAffine.preservesNonposRooted) and U_g(u^k) = L^k g sends (-inf, a + b h + kappa m] into (-inf, h] (RealRooted rayBasisMap_maps_realRootedIn_iff)","lean_route":null,"lean_declarations":[],"certificate_hash":"24415c785dea991d07306967675be1012c5bc574b317da450d072e9e8bc4b650","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map_theorem","certificate_raw_size":2679,"certificate_compressed_size":1083,"conclusion_name":"Triangle read by rows, the Bell transform of the triple factorial numbers A007559(n+1) without column 0.","claims":[{"claim":"basis_map_preserver","input_interval":"(-inf, 0]","output_interval":"(-inf, 0]","statement":"(-inf, 0] -> (-inf, 0] through R_s, s = 3, and U_g"}],"premises":[],"cited_by":[{"node_id":"n-df97cd413ec843e8","claim":"basis_map_preserver"}]}