{"id":"e-b76eec14ee8e8c71","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-a1540a6d32c29f8f","premise_count":0,"theorem":"affine current multiplier with an affine initial row (module documentation, \"The affine-current theorem\"): with beta = b/d, K = beta^2 + a beta - c > 0 and eta = m/d >= 0, every real polynomial with all roots in E = [-beta - sqrt(K), -beta + sqrt(K)] has a real-rooted image, and no interval of positive length outside E works (Theorem 1); for eta > 0 the images lie in I = [(-a - 2 beta - 2 sqrt(K))/d, (-a - 2 beta + 2 sqrt(K))/d] if and only if eta >= 1/2 and (s - (2 eta - 1) beta)^2 <= (2 eta - 1)^2 K, s = l - eta a (Theorem 2); with a >= 0, K >= beta^2, a + 2 beta >= 0, a^2 + 4c >= 0, l >= 0 and the scalar criterion, PF inputs with roots in [-R, 0], R = beta + sqrt(K), have PF images, sharply (the common-interlacer proof; the Chebyshev case is Iserles and Saff, Math. Proc. Cambridge Philos. Soc. 105 (1989), Theorem 1; the scalar criterion is RealRooted orderTwoConstants_nonneg_iff)","lean_route":null,"lean_declarations":[],"certificate_hash":"f2a1b6202373508ce5dca77951a88b85d65d09be9b769b87ce6e668be56ddfd8","verification_polytool":"replayed","verification_lean":"not_attempted","certificate_kind":"basis_map_theorem","certificate_raw_size":4406,"certificate_compressed_size":1441,"conclusion_name":"Square array A(n,r), the number of neighbors at a sharp Manhattan distance r in a finite n-hypercube lattice, read by upwards antidiagonals; A(n,r) = Sum_{k=0..min(n,r)} binomial(r-1,k-1)*binomial(n,k)* 2^k.","claims":[{"claim":"basis_map_preserver","input_interval":"[-1 - sqrt(2), -1 + sqrt(2)]","output_interval":"(-inf, +inf)","statement":"every real polynomial with all roots in E = [-1 - sqrt(2), -1 + sqrt(2)] has a real-rooted image"},{"claim":"basis_map_preserver","input_interval":"[-1 - sqrt(2), 0]","output_interval":"(-inf, 0]","statement":"every PF input with all roots in [-1 - sqrt(2), 0] has a PF image; no larger [-R, 0] works"}],"premises":[],"cited_by":[{"node_id":"n-a1540a6d32c29f8f","claim":"basis_map_preserver"}]}