An algorithm for corona solutions on H^(D)

DOI10.1007/S00020-007-1538-5MaRDI QIDQ2476173zbMATH OpenOpenAlexFDO

Authors Tavan T. Trent

Publication date 12 March 2008

Published in Integral Equations and Operator Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00020-007-1538-5

zbMATH Keywords

bounded analytic functionscorona problempolynomials

Mathematics Subject Classification ID

Spaces of bounded analytic functions of one complex variable (30H05) Banach algebras of differentiable or analytic functions, (H^p)-spaces (46J15)

Review text

Let \(D\) be the unit disk in \(\mathbb{C}\). The corona theorem states that for any \(\{f_j\}_{j=1}^m\subset H^\infty(D)\) satisfying \(0<\varepsilon^2\leq\sum_{j=1}^m| f_j(z)| ^2\leq1\), \(z\in D\), there exists \(\{u_j\}_{j=1}^m\subset H^\infty(D)\) such that \(\sum_{j=1}^mf_j(z)u_j(z)\equiv 1\) in \(D\) and \(\sup_{z\in D}\sum_{j=1}^n| u_j(z)| ^2\leq M(\varepsilon)\). The best known value for \(M(\varepsilon)\) was found by Uchiyama: for \(0<\varepsilon<1/e\) we can take \(M(\varepsilon)=M_0(\varepsilon):=(8\varepsilon^{-2}\log\varepsilon^{-2})^2\). A constructive method to solve the problem was suggested by \textit{Peter W. Jones} [J. Funct. Anal. 39, 162--181 (1980; Zbl 0471.30023)] but it is too complicated to see how it could be realized explicitly. The author gives a new constructive method for the case when \(f_j\) are polynomials of maximal degree \(n\) (for \(M(\varepsilon)=M_0(\varepsilon)\)). It is subdivided into four steps. The first one is to find an analytic polynomial \(F\) with prescribed square of modulus on \(\partial D\) (Fejer-Riesz factorization). Three other steps have pure algebraic nature and use matrix operations such as Cholesky decomposition and finding of inverse matrix. The elements of the considered matrices depend on the coefficients of \(f_j\) and \(F\). The solution to the corona problems is obtained as a set \(\{u_j\}_{j=1}^n\subset H^\infty(D)\) of rational functions of maximal order \(n\). The suggested method is illustrated by an example for \(m=2\) and \(n=1\) (\(f_1(z)=1-z\), \(f_2(z)=z\)).

Recommendations

• scientific article; zbMATH DE number 624599
• An \(H^{2}\)-corona theorem on the bidisk for infinitely many functions.
• A vector-valued \(H^{p}\) corona theorem on the polydisk
• Estimates of solutions of the \(H^p\) and \(BMOA\) corona problem
• scientific article; zbMATH DE number 624598

Cited in

(12)

• Zero-forcing precoding for frequency selective MIMO channels with \(H^\infty \) criterion and causality constraint
• On a generalization of the Corona problem
• A counterexample to the corona theorem for operators on H^ 2( D^ n).
• A constructive proof of the Leech theorem for rational matrix functions
• State space formulae for stable rational matrix solutions of a Leech problem
• Rational matrix solutions to the Leech equation: the Ball-Trent approach revisited
• Rational matrix solutions of a Bezout type equation on the half-plane
• scientific article; zbMATH DE number 624598 (Why is no real title available?)
• Estimates for the corona Theorem on H^∞_ᵔ0(ᵓb)
• scientific article; zbMATH DE number 5049207 (Why is no real title available?)
• Sharp estimates of the solutions to Bézout's polynomial equation and a corona theorem
• Right invertible multiplication operators and stable rational matrix solutions to an associate Bezout equation. I: The least squares solution

This page was built for publication: An algorithm for corona solutions on \(H^{\infty}(D)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476173)