{"id":"n-b835ff4ca4ba76ba","revision":1,"first_index":1,"fingerprint":"f6-d17e9e22f050fa67","name":"shifted_legendre","polytool_family":"shifted_legendre","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","2"],["1","-6","6"],["-1","12","-30","20"],["1","-20","90","-140","70"],["-1","30","-210","560","-630","252"],["1","-42","420","-1680","3150","-2772","924"],["-1","56","-756","4200","-11550","16632","-12012","3432"],["1","-72","1260","-9240","34650","-72072","84084","-51480","12870"],["-1","90","-1980","18480","-90090","252252","-420420","411840","-218790","48620"],["1","-110","2970","-34320","210210","-756756","1681680","-2333760","1969110","-923780","184756"],["-1","132","-4290","60060","-450450","2018016","-5717712","10501920","-12471030","9237800","-3879876","705432"],["1","-156","6006","-100100","900900","-4900896","17153136","-39907296","62355150","-64664600","42678636","-16224936","2704156"],["-1","182","-8190","160160","-1701700","11027016","-46558512","133024320","-261891630","355655300","-327202876","194699232","-67603900","10400600"],["1","-210","10920","-247520","3063060","-23279256","116396280","-399072960","960269310","-1636014380","1963217256","-1622493600","878850700","-280816200","40116600"],["-1","240","-14280","371280","-5290740","46558512","-271591320","1097450640","-3155170590","6544057520","-9816086280","10546208400","-7909656300","3931426800","-1163381400","155117520"]],"degrees":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15],"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:shifted_legendre","source_kind":"named_family","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["-1","2"],["1","-6","6"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","-2"],["-2","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158206,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)","region_exact":null,"edges":["e-b8dd03e52ce06706"]},{"id":158207,"position":1,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"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 >= 2","region_exact":null,"edges":["e-8b7097919aa29e45","e-b8dd03e52ce06706"]},{"id":158208,"position":2,"claim":"real_rooted","from_index":1,"region_key":"(0, 1)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"0"},"upper":{"closed":false,"value":"1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (0, 1)","region_exact":null,"edges":["e-8b7097919aa29e45"]},{"id":158209,"position":3,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":true,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n(-x) have one sign","region_exact":null,"edges":["e-8b7097919aa29e45"]}],"region_exact":{},"incoming_edges":[{"id":"e-8b7097919aa29e45","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-b835ff4ca4ba76ba","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":"6b3d04f26ed87e05fce4380ef152e4f6e1af02d45aa48dd1d95f4ef1f4f3a734","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":false,"value":"0"},"upper":{"closed":false,"value":"1"}}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-b8dd03e52ce06706","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-b835ff4ca4ba76ba","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":"1ecddb307f102852b9a5180fa402642c3365393a1663c8d7e833a64dec5af65e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{}},{"claim":"interlacing","from_index":2,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[],"used_by_total":0,"links":[],"oeis":[],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1: -1,    2;\n   2:  1,   -6,     6;\n   3: -1,   12,   -30,     20;\n   4:  1,  -20,    90,   -140,     70;\n   5: -1,   30,  -210,    560,   -630,     252;\n   6:  1,  -42,   420,  -1680,   3150,   -2772,     924;\n   7: -1,   56,  -756,   4200, -11550,   16632,  -12012,     3432;\n   8:  1,  -72,  1260,  -9240,  34650,  -72072,   84084,   -51480,   12870;\n   9: -1,   90, -1980,  18480, -90090,  252252, -420420,   411840, -218790,   48620;\n  10:  1, -110,  2970, -34320, 210210, -756756, 1681680, -2333760, 1969110, -923780, 184756;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = -(2*n-1-(4*n-2)*x)*P(n-1,x) - (n-1)*P(n-2,x) for n >= 3, with P(1,x) = -1 + 2*x, P(2,x) = 1 - 6*x + 6*x^2.","mathematica":"P[1, x_] := -1 + 2*x;\nP[2, x_] := 1 - 6*x + 6*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 1 - (4*n - 2)*x)*P[n - 1, x] - (n - 1)*P[n - 2, x])/(n)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = -1 + 2*x; v[2] = 1 - 6*x + 6*x^2; for(n = 3, N, my(i = n); v[i] = (-(2*n - 1 - (4*n - 2)*x)*v[i - 1] - (n - 1)*v[i - 2])/(n)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-b835ff4ca4ba76ba","steps":[],"edges":[],"text":"shifted_legendre"},"headline":"shifted_legendre","chain":null}