{"id":"n-9ae8d431f7b33f22","revision":1,"first_index":0,"fingerprint":"f6-3d213e09756fa2d2","name":"chebyshev_t","polytool_family":"chebyshev_t","interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":false,"rows":[["1"],["0","1"],["-1","0","2"],["0","-3","0","4"],["1","0","-8","0","8"],["0","5","0","-20","0","16"],["-1","0","18","0","-48","0","32"],["0","-7","0","56","0","-112","0","64"],["1","0","-32","0","160","0","-256","0","128"],["0","9","0","-120","0","432","0","-576","0","256"],["-1","0","50","0","-400","0","1120","0","-1280","0","512"],["0","-11","0","220","0","-1232","0","2816","0","-2816","0","1024"],["1","0","-72","0","840","0","-3584","0","6912","0","-6144","0","2048"],["0","13","0","-364","0","2912","0","-9984","0","16640","0","-13312","0","4096"],["-1","0","98","0","-1568","0","9408","0","-26880","0","39424","0","-28672","0","8192"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","1","1","1","1","1","1","1","1","1","1","1","1","1","1"],"nonn":false,"definitions":[{"position":0,"source":"named_family:chebyshev_t","source_kind":"named_family","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["0","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158193,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)","region_exact":null,"edges":["e-efd5e57f56b3429d"]},{"id":158194,"position":1,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-5437345511af69a3","e-efd5e57f56b3429d"]},{"id":158195,"position":2,"claim":"real_rooted","from_index":0,"region_key":"(-1, 1)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-1"},"upper":{"closed":false,"value":"1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-1, 1)","region_exact":null,"edges":["e-5437345511af69a3"]},{"id":158196,"position":3,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"[-1, 1]","output_interval":"(-inf, +inf)","statement":"every real polynomial with all roots in E = [-1, 1] has a real-rooted image"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in [-1, 1] to roots in (-inf, +inf): every real polynomial with all roots in E = [-1, 1] has a real-rooted image","region_exact":null,"edges":["e-85b780ace6aa61d5"]},{"id":158197,"position":4,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"[-1, 1]","output_interval":"[-1, 1]","statement":"every real polynomial with all roots in E = [-1, 1] has an image with all roots in I = [-1, 1]"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in [-1, 1] to roots in [-1, 1]: every real polynomial with all roots in E = [-1, 1] has an image with all roots in I = [-1, 1]","region_exact":null,"edges":["e-85b780ace6aa61d5"]}],"region_exact":{},"incoming_edges":[{"id":"e-85b780ace6aa61d5","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-9ae8d431f7b33f22","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":"9975ea3d03f1993255073427961470e6bb69b3f5cacfd93c7dc329098e9ccefb","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"basis_map_preserver","input_interval":"[-1, 1]","output_interval":"(-inf, +inf)","statement":"every real polynomial with all roots in E = [-1, 1] has a real-rooted image"},{"claim":"basis_map_preserver","input_interval":"[-1, 1]","output_interval":"[-1, 1]","statement":"every real polynomial with all roots in E = [-1, 1] has an image with all roots in I = [-1, 1]"}],"premises":[]},{"id":"e-5437345511af69a3","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-9ae8d431f7b33f22","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"7ee55dd53825b530984a01921df5e270bdc69f6b05187dfaa0645d9dff07315e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-1"},"upper":{"closed":false,"value":"1"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-efd5e57f56b3429d","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-9ae8d431f7b33f22","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"66e6b0f531aad4a7e342bc9e4dd593f6424d6ea8be5b890cd6af3e3d97d0b77b","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-298ee5f2391f30e9","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-5fc5274bb6446a33","conclusion_name":"shift_x_plus_one of chebyshev_t"},{"id":"e-525fe5a9d9abc075","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-4408f155e5aec2f8","conclusion_name":"one_plus_derivative of chebyshev_t"},{"id":"e-c1cd3b615621d834","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-6ee7e6c62309a510","conclusion_name":"derivative of chebyshev_t"}],"used_by_total":3,"links":[{"id":"l-73e1e1f571c68a55","kind":"fingerprint_related","node_a_id":"n-9ae8d431f7b33f22","node_b_id":"n-dbf182f3ecfeda2a","fingerprint":"f6-3d213e09756fa2d2","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3d213e09756fa2d2"},"other_id":"n-dbf182f3ecfeda2a","other":{"id":"n-dbf182f3ecfeda2a","name":"Triangle of coefficients of cos(x)^n in polynomial for cos(nx).","first_index":0,"fingerprint":"f6-3d213e09756fa2d2","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":0,"preview_rows":[["1"],["1"],["2","0","-1"]],"card_rows":[["1"],["1"],["2","0","-1"],["4","0","-3"]],"row_sums_preview":["1","1","1","1","1","1","1","1"],"regions":["(-inf, +inf)"],"region_exact":{},"oeis_ids":["A039991"],"derivation":{"root":"n-dbf182f3ecfeda2a","steps":[],"edges":[],"text":"A039991"},"headline":"A039991: Triangle of coefficients of cos(x)^n in polynomial for cos(nx).","chain":null}},{"id":"l-268baae892d80a5d","kind":"oeis_match","node_a_id":"n-9ae8d431f7b33f22","node_b_id":null,"fingerprint":null,"oeis_id":"A053120","in_catalog":0,"target":"triangle","row_alignment":"tabl","rows_matched":12,"oeis_nonn":0,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":12,"target":"triangle","terms_compared":78},"in_catalog":false,"oeis_id":"A053120","oeis_nonn":false},"other_id":null,"other":null},{"id":"l-8d90b00b1167965d","kind":"oeis_match","node_a_id":"n-9ae8d431f7b33f22","node_b_id":null,"fingerprint":null,"oeis_id":"A039991","in_catalog":1,"target":"reversed_triangle","row_alignment":"tabl","rows_matched":12,"oeis_nonn":0,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":12,"target":"reversed_triangle","terms_compared":78},"in_catalog":true,"oeis_id":"A039991","oeis_nonn":false},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A039991","relation":"match_reversed_triangle"},{"oeis_id":"A053120","relation":"match_triangle"}],"bfiles":[{"node_id":"n-9ae8d431f7b33f22","oeis_id":"A039991","target":"reversed_triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":78,"oeis_terms_agreeing":78,"oeis_terms_available":78,"term_count":990,"raw_size":9722},{"node_id":"n-9ae8d431f7b33f22","oeis_id":"A053120","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":78,"oeis_terms_agreeing":78,"oeis_terms_available":78,"term_count":990,"raw_size":9722}],"oeis_texts":[{"oeis_id":"","target":"node","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:  1;\n  1:  0,  1;\n  2: -1,  0,   2;\n  3:  0, -3,   0,    4;\n  4:  1,  0,  -8,    0,   8;\n  5:  0,  5,   0,  -20,   0,   16;\n  6: -1,  0,  18,    0, -48,    0,   32;\n  7:  0, -7,   0,   56,   0, -112,    0,   64;\n  8:  1,  0, -32,    0, 160,    0, -256,    0, 128;\n  9:  0,  9,   0, -120,   0,  432,    0, -576,   0, 256;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*x*P(n-1,x) - P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := x;\nP[n_, x_] := P[n, x] = Expand[2*x*P[n - 1, x] - P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = x; for(n = 2, N, my(i = n + 1); v[i] = 2*x*v[i - 1] - v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}},{"oeis_id":"A039991","target":"reversed_triangle","first_row":0,"oeis_offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:   1;\n  1:   1, 0;\n  2:   2, 0,   -1;\n  3:   4, 0,   -3, 0;\n  4:   8, 0,   -8, 0,   1;\n  5:  16, 0,  -20, 0,   5, 0;\n  6:  32, 0,  -48, 0,  18, 0,   -1;\n  7:  64, 0, -112, 0,  56, 0,   -7, 0;\n  8: 128, 0, -256, 0, 160, 0,  -32, 0, 1;\n  9: 256, 0, -576, 0, 432, 0, -120, 0, 9, 0;\n","recurrence_sentence":"Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = 2*x*P(n-1,x) - P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := x;\nP[n_, x_] := P[n, x] = Expand[2*x*P[n - 1, x] - P[n - 2, x]];\nTable[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = x; for(n = 2, N, my(i = n + 1); v[i] = 2*x*v[i - 1] - v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":true,"trim_zeros":"none","regular_triangle":true}},{"oeis_id":"A053120","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:  1;\n  1:  0,  1;\n  2: -1,  0,   2;\n  3:  0, -3,   0,    4;\n  4:  1,  0,  -8,    0,   8;\n  5:  0,  5,   0,  -20,   0,   16;\n  6: -1,  0,  18,    0, -48,    0,   32;\n  7:  0, -7,   0,   56,   0, -112,    0,   64;\n  8:  1,  0, -32,    0, 160,    0, -256,    0, 128;\n  9:  0,  9,   0, -120,   0,  432,    0, -576,   0, 256;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = 2*x*P(n-1,x) - P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := x;\nP[n_, x_] := P[n, x] = Expand[2*x*P[n - 1, x] - P[n - 2, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = x; for(n = 2, N, my(i = n + 1); v[i] = 2*x*v[i - 1] - v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true}}],"derivation":{"root":"n-9ae8d431f7b33f22","steps":[],"edges":[],"text":"chebyshev_t"},"headline":"chebyshev_t","chain":null}