## When can a family of polynomials get a weight function to be made orthogonal?

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Let $\lbrace P_n(z)\rbrace_{n\in\mathbb N_0}$ be a family of polynomials defined by a generating function $g(t,z)=\sum\limits_{n=0}^\infty P_n(z)t^n$ or by a contour integral $P_n(z)=\frac1{2\pi i}\oint\frac{g(t,z)}{t^{n+1}}dt$. Are there known sufficient conditions on $g$ or on the $P_n$ themselves that guarantee the existence of a weight function $w:I\to \mathbb R^+_0$ (where $I\subset\mathbb R$ is an appropriate interval) such that the $P_n$ are orthogonal w.r.t. $w$?

-

2
Orthogonal polynomials must satisfy a three-term recursion $x P_{n+1}(x) = A_n P_n(x) - B_n P_{n-1}(x)$ and have real interlaced roots. Not clear how to test these necessary conditions from a generating function or contour integral, let alone give sufficient conditions. – Noam D. Elkies Jan 27 2012 at 23:06

2
Oops, I started writing my answer before this comment appeared. The three-term recurrence should be $xP_{n}(x) = P_{n+1}(x) + A_n P_n(x) - B_n P_{n-1}(x)$ with $B_n>0$, and then it actually implies that the roots are interlaced. – Henry Cohn Jan 27 2012 at 23:18
(But you're right that this isn't a particularly useful condition for proving that polynomials are orthogonal. I view Favard's theorem as having mainly psychological value: if you observe a suitable recurrence experimentally, then you really ought to look for an orthogonality proof to explain it. It's sometimes possible to prove the recurrence directly and work from there, but this is generally not the most flexible or illuminating approach.) – Henry Cohn Jan 27 2012 at 23:21
Henry is right, and I apologize for the typo. – Noam D. Elkies Jan 27 2012 at 23:56

## 2 Answers

Favard's theorem characterizes this in terms of the three-term recurrence. Suppose the polynomials $P_n$ are normalized so that they are monic. Then they are orthogonal polynomials with respect to some Borel measure if and only if there are constants $\alpha_n$ and $\beta_n$ such that $P_n(x) = (x+\alpha_n) P_{n-1}(x) + \beta_n P_{n-2}(x)$ and $\beta_n < 0$. (The sign condition on $\beta_n$ is needed to get a positive measure. I think you still get a signed measure if you have a three-term recurrence with $\beta_n \ge 0$, but I'm not certain offhand.)

This is pretty easy to test for in practice if you are given a sequence of polynomials numerically. Strictly speaking, it doesn't guarantee a weight function as specified in your question, since the measure may not be absolutely continuous with respect to Lebesgue measure, but I assume that's not what you really care about. If it is, then I'm not sure offhand how to characterize that case.

-

Thank you. That's about what I expected: that one of the necessary conditions is essentially sufficient. Like Noam D. Elkies, I didn't really expect there to be any hope of deriving anything directly from a generating function. Let alone the even more hopeless question: If only $g(t,z)$ is given, is there even a way to know, without doing a Taylor expansion, that the coefficients will actually be polynomials in $z$? – spanferkel Jan 28 2012 at 10:24

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Hello everybody, Can anybody help me in finding out the weight function needed to orthogonalize a polynomial. Actually, in a paper they claim their polynomials are orthogonal, but I'm unable to verify. They have a three term recurrence relation.

-

Who is "they?" Formulating this as a question instead of an answer might give you better chances of a response, though it would be helpful if you flesh out your problem more. What, specifically, are you trying to do? What paper are you following? What specific problems are you having? – Emilio Pisanty Jul 20 at 15:57
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 21, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9431701302528381, "perplexity_flag": "head"}