LOWER BOUNDS IN THE MATRIX CORONA THEOREM AND THE CODIMENSION…在矩阵定理和中的下限.pdfVIP

LOWER BOUNDS IN THE MATRIX CORONA THEOREM AND THE CODIMENSION ONE CONJECTURE. SERGEI TREIL Abstract. Main result of this paper is the following theorem: given δ, 0 δ 1/3 an n ∈ N there exists an (n +1) ×n inner matrix function F ∈ H∞ such that (n+1)×n ∗ 2 I ≥ F (z)F (z) ≥ δ I ∀z ∈ D, but the norm of any left inverse for F is at least [δ/(1 − δ)]−n ≥ (3 δ)−n . This gives a lower boun dfor the solution of the Matrix Corona 2 Problem, which is pretty close to the best known upper boun C · δ−n−1 log δ−2n obtaine drecently by T. Trent [16]. In particular, both estimates grow exponentially in n; the (only) previously known lower boun Cδ−2 2 log(δ n + 1) (obtaine dby the author [13]) grew logarith- mically in n. Also, the lower boun dis obtaine dfor (n + 1) × n matri- ces, thus giving the negative answer to the so-calle d“codimension one conjecture.” Another important result is Theorem 2.4 connecting left invertiblity in H∞ an dco-analytic orthogonal complements. Contents Notation 1 0. Introduction 2 1. Main results 4 2. Co-analytic complements and their role in the Corona Problem 5 3. Main construction and the proo fo fTheorem 1.1. 10 4. Proo fo fTheorem 1.2. 12 5. Some open proble