2000 character limit reached
A uniqueness theorem for bounded analytic functions on the polydisc
Published 15 Dec 2010 in math.CV | (1012.3412v2)
Abstract: For each n,N>0 we construct a set of points x_1,...,x_M in Dn with the following property: if f is a rational inner function on Dn of degree strictly less than N and g is an analytic function mapping Dn to D that satisfies g(x_i)=f(x_i) for each i=1,...,M, then g=f on Dn. In terms of the Pick problem on Dn, our result implies that for any rational inner f of degree less than N, the Pick problem with data x_1,...,x_M and f(x_1),...,f(x_M) has a unique solution.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.