DOCSLIB.ORG

Quantum Query Complexity and Distributed Computing ILLC Dissertation Series DS-2004-01

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Query Complexity and Distributed Computing ILLC Dissertation Series DS-2004-01 Quantum Query Complexity and Distributed Computing ILLC Dissertation Series DS-2004-01 For further information about ILLC-publications, please contact Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam phone: +31-20-525 6051 fax: +31-20-525 5206 e-mail: [email protected] homepage: http://www.illc.uva.nl/ Quantum Query Complexity and Distributed Computing Academisch Proefschrift ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof.mr. P.F. van der Heijden ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Aula der Universiteit op dinsdag 27 januari 2004, te 12.00 uur door Hein Philipp R¨ohrig geboren te Frankfurt am Main, Duitsland. Promotores: Prof.dr. H.M. Buhrman Prof.dr.ir. P.M.B. Vit´anyi Overige leden: Prof.dr. R.H. Dijkgraaf Prof.dr. L. Fortnow Prof.dr. R.D. Gill Dr. S. Massar Dr. L. Torenvliet Dr. R.M. de Wolf Faculteit der Natuurwetenschappen, Wiskunde en Informatica The investigations were supported by the Netherlands Organization for Sci- entific Research (NWO) project “Quantum Computing” (project number 612.15.001), by the EU fifth framework projects QAIP, IST-1999-11234, and RESQ, IST-2001-37559, the NoE QUIPROCONE, IST-1999-29064, and the ESF QiT Programme. Copyright c 2003 by Hein P. R¨ohrig Revision 411 ISBN: 3–933966–04–3 v Contents Acknowledgments xi Publications xiii 1 Introduction 1 1.1 Computation is physical . 1 1.2 Quantum mechanics . 2 1.2.1 States . 2 1.2.2 Evolution . 5 1.2.3 Observables . 7 1.2.4 Entanglement . 12 1.2.5 Perspective . 16 1.3 Quantum computation and information . 17 1.3.1 Quantum circuits . 17 1.3.2 Quantum black-box algorithms . 19 1.3.3 Hallmark results . 23 I Quantum query complexity 25 2 Quantum search 27 2.1 Quantum amplitude amplification . 27 2.1.1 Grover’s algorithm . 27 2.1.2 Amplitude amplification . 33 2.2 Convolution products . 36 2.3 Search in the density-matrix formalism . 41 2.4 Energy levels of a Hamiltonian . 48 2.4.1 Sampling from the energy levels . 49 vii 2.4.2 Comparing degeneracy degrees . 52 2.4.3 Numerical simulations . 53 3 Property testing 57 3.1 Introduction . 57 3.2 Preliminaries . 58 3.3 Separating quantum and classical property testing . 59 3.4 An exponential separation . 62 3.5 Quantum lower bounds . 70 3.6 Further research . 73 4 Robustness 75 4.1 Introduction . 75 4.2 Robustly recovering all n bits . 78 4.3 The multiple-faulty-copies model . 83 4.4 Robust polynomials . 83 4.5 Discussion and open problems . 86 II Distributed quantum computing 87 5 Nonlocality 89 5.1 Introduction . 89 5.1.1 Bell inequalities . 91 5.1.2 Imperfections . 94 5.2 Definitions . 99 5.3 Bounds on multiparty nonlocality . 103 5.3.1 Combinatorial bounds . 103 5.3.2 Application to the GHZ correlations . 105 5.3.3 an addition theorem . 108 5.4 Reproducing quantum correlations . 110 5.5 Conclusions . 115 6 Quantum coin flipping 117 6.1 Introduction . 117 6.2 Two-party coin flipping with penalty for cheating . 120 6.3 The multiparty model . 122 6.3.1 Adversaries . 122 6.3.2 The broadcast channel . 123 6.4 Multiparty quantum coin-flipping protocols . 125 6.5 Lower bound . 128 6.5.1 The two-party bound . 128 viii 6.5.2 More than two parties . 132 6.6 Summary . 134 Bibliography 135 Index 147 Samenvatting 151 Abstract 155 ix Acknowledgments I am indebted to Harry Buhrman for his guidance, advice, and comradeship. Most problems addressed in this thesis were raised by him; his ideas also contributed to many of the solutions. I am also very grateful to Paul Vit´anyi, who offered me the PhD position and whose pragmatic yet highly competent management style I admire. Special thanks go to Ronald de Wolf. He was the first real quantum- computing researcher I ever talked to, the night before AQIP 98. His close reading of the thesis improved it a lot; all remaining errors are of course mine. He, John Tromp, and I shared an office—the drie ‘heren’ frequently were the only people at the institute at night and during the weekend. I also thank my other coauthors of the papers that are the foundation of this thesis: Andris Ambainis, Yevgeniy Dodis, Lance Fortnow, Peter Høyer, Serge Massar, and Ilan Newman. During my studies, I spent a substantial amount of time as guest of Lov Grover at Bell Labs. What I know about quantum search, I learned from him. Two long-time mentors deserve special mention here: Prof. Dr. Karl Hensen, my “Vertrauensdozent” in the Studienstiftung, was a constant point of reference outside my specialty. From Prof. Dr. Dr. h.c. mult. G¨unter Hotz I learned to critically review objectives of research in a wider context. For many pleasant, instructive, and fruitful scientific discussions, I thank Scott Aaronson, Luis Antunes, Eldar Fischer, P´eter G´acs, Mart de Graaf, Pe- ter Gr¨unwald, Jaap-Henk Hoepman, Troy Lee, Ashwin Nayak, Daniel Preda, Yaoyun Shi, Robert Spalek,ˇ and Arjen de Vries. For introducing me to new worlds, for advice and friendship, and generally a good time I thank Torben Hagerup, Ute R¨ohrig, Richard Hahnloser, Sebastian Seung, Tarmo Johannes, Dasha Beltsiukova, Liddy Shriver, Markus Jakobsson, and Susanne Wetzel. Thanks to Rudi Cilibrasi and Rudolf Janz for proofreading drafts of this the- sis and instructing me to exorcize parentheses; Stefan Manegold and Kolja Sulimma provided valuable advice about printing this thesis. I am grateful to my parents for their support throughout my studies. And Tzveta, thanks for always stimulating me to finish this thesis and for providing distraction from work! Hein R¨ohrig Amsterdam, December 2003 xi Publications The following publications are the base for Chapters 2–6. • H. Buhrman, L. Fortnow, I. Newman, and H. R¨ohrig. Quantum prop- erty testing. In Proceedings of 14th SODA, pages 480–488, 2003, quant- ph/0201117. • H. Buhrman, I. Newman, H. R¨ohrig, and R. de Wolf. Robust quantum algorithms and polynomials. Submitted, quant-ph/0309220. • H. Buhrman, P. Høyer, S. Massar, and H. R¨ohrig. Combinatorics and quantum nonlocality. Physical Review Letters, 91(4):047903, 2003, quant-ph/0209052. • H. Buhrman and H. R¨ohrig. Distributed quantum computing. In B. Rovan and P. Vojtas, editors, Mathematical Foundations of Com- puter Science 2003, volume 2747 of Lecture Notes in Computer Science, pages 1–20. Springer, 2003. • A. Ambainis, H. Buhrman, Y. Dodis, and H. R¨ohrig. Multiparty quan- tum coin flipping. Submitted, 2003, quant-ph/0304112. xiii Chapter 1 Introduction 1.1 Computation Is Physical The last two decades have seen a renewed interest in the relation between computation and physics. In particular, in the early 1980s Feynman [54, 55] pointed out that simulating quantum mechanics appears to be difficult in models of computation that were then thought to represent the strongest feasible form of computation. Moreover, he raised the question whether a quantum-mechanical computer could be more powerful than a “classical” computer, e.g., in analyzing other quantum-mechanical systems. Most physi- cists believe that the world is quantum-mechanical, or at least is more ac- curately described by quantum mechanics than by classical theories. In this case, it should in principle be possible to actually build such quantum com- puters. Conversely, quantum computers can also be regarded as experiments for verifying the predictions of quantum mechanics, and principal obstacles may very well indicate limitations of quantum mechanics. This would be of great interest since to date there is no experimental data contradicting quantum mechanics. Initially, interest among computer scientists was limited. In part this was due to the similarity of Feynman’s proposal to conventional “analog” com- puters. Deutsch [47] laid the theoretical groundwork for a “digital” variant of quantum computing, and in the 1980s and in the early 1990s a sequence of quantum algorithms appeared [48, 22, 109] that showed that quantum com- puters are in certain aspects significantly more powerful than classical com- puters. However, the area really became popular only after Shor presented an efficient quantum algorithm for factoring integers [108], a problem considered so difficult classically that the most important cryptographic systems both in theory and practice rely on its hardness. Further theoretical discoveries included the feasibility of correcting errors in quantum computation. This 1 2 Chapter 1. Introduction answered affirmatively the question whether an imperfect real-world quan- tum mechanical device could benefit from these theoretical advantages; thus, one could say that quantum error correction is an example of a contribution to physics by computer scientists. 1.2 Quantum Mechanics An atom is not a soccer ball: the measures and laws of classical physics, which describe the motion of a soccer ball in space, fail to explain physical phenomena at the atomic scale. For example, the laws of classical physics do not adequately describe the structure of the atomic nucleus, the wave-particle character of light, and discrete absorption spectra. These phenomena can be explained by the physical theory of quantum mechanics. This theory has been developed from 1925 on chiefly by Heisenberg and Schr¨odinger. Despite some seemingly “unnatural” model assumptions, quantum mechanics is today accepted by most physicists as the best tool to describe nature on the very small-scale level or where tiny differences of energy are involved. In the limit of many particles and great energy differences, quantum mechanical laws converge to their classical counterparts.
Load more

Recommended publications
  • Inverse Vs Implicit Function Theorems - MATH 402/502 - Spring 2015 April 24, 2015 Instructor: C
    Inverse vs Implicit function theorems - MATH 402/502 - Spring 2015 April 24, 2015 Instructor: C. Pereyra Prof. Blair stated and proved the Inverse Function Theorem for you on Tuesday April 21st. On Thursday April 23rd, my task was to state the Implicit Function Theorem and deduce it from the Inverse Function Theorem. I left my notes at home precisely when I needed them most. This note will complement my lecture. As it turns out these two theorems are equivalent in the sense that one could have chosen to prove the Implicit Function Theorem and deduce the Inverse Function Theorem from it. I showed you how to do that and I gave you some ideas how to do it the other way around. Inverse Funtion Theorem The inverse function theorem gives conditions on a differentiable function so that locally near a base point we can guarantee the existence of an inverse function that is differentiable at the image of the base point, furthermore we have a formula for this derivative: the derivative of the function at the image of the base point is the reciprocal of the derivative of the function at the base point. (See Tao's Section 6.7.) Theorem 0.1 (Inverse Funtion Theorem). Let E be an open subset of Rn, and let n f : E ! R be a continuously differentiable function on E. Assume x0 2 E (the 0 n n base point) and f (x0): R ! R is invertible. Then there exists an open set U ⊂ E n containing x0, and an open set V ⊂ R containing f(x0) (the image of the base point), such that f is a bijection from U to V .
    [Show full text]
  • 1. Inverse Function Theorem for Holomorphic Functions the Field Of
    1. Inverse Function Theorem for Holomorphic Functions 2 The field of complex numbers C can be identified with R as a two dimensional real vector space via x + iy 7! (x; y). On C; we define an inner product hz; wi = Re(zw): With respect to the the norm induced from the inner product, C becomes a two dimensional real Hilbert space. Let C1(U) be the space of all complex valued smooth functions on an open subset U of ∼ 2 C = R : Since x = (z + z)=2 and y = (z − z)=2i; a smooth complex valued function f(x; y) on U can be considered as a function F (z; z) z + z z − z F (z; z) = f ; : 2 2i For convince, we denote f(x; y) by f(z; z): We define two partial differential operators @ @ ; : C1(U) ! C1(U) @z @z by @f 1 @f @f @f 1 @f @f = − i ; = + i : @z 2 @x @y @z 2 @x @y A smooth function f 2 C1(U) is said to be holomorphic on U if @f = 0 on U: @z In this case, we denote f(z; z) by f(z) and @f=@z by f 0(z): A function f is said to be holomorphic at a point p 2 C if f is holomorphic defined in an open neighborhood of p: For open subsets U and V in C; a function f : U ! V is biholomorphic if f is a bijection from U onto V and both f and f −1 are holomorphic. A holomorphic function f on an open subset U of C can be identified with a smooth 2 2 mapping f : U ⊂ R ! R via f(x; y) = (u(x; y); v(x; y)) where u; v are real valued smooth functions on U obeying the Cauchy-Riemann equation ux = vy and uy = −vx on U: 2 2 For each p 2 U; the matrix representation of the derivative dfp : R ! R with respect to 2 the standard basis of R is given by ux(p) uy(p) dfp = : vx(p) vy(p) In this case, the Jacobian of f at p is given by 2 2 0 2 J(f)(p) = det dfp = ux(p)vy(p) − uy(p)vx(p) = ux(p) + vx(p) = jf (p)j : Theorem 1.1.
    [Show full text]
  • Inverse and Implicit Function Theorems for Noncommutative
    Inverse and Implicit Function Theorems for Noncommutative Functions on Operator Domains Mark E. Mancuso Abstract Classically, a noncommutative function is defined on a graded domain of tuples of square matrices. In this note, we introduce a notion of a noncommutative function defined on a domain Ω ⊂ B(H)d, where H is an infinite dimensional Hilbert space. Inverse and implicit function theorems in this setting are established. When these operatorial noncommutative functions are suitably continuous in the strong operator topology, a noncommutative dilation-theoretic construction is used to show that the assumptions on their derivatives may be relaxed from boundedness below to injectivity. Keywords: Noncommutive functions, operator noncommutative functions, free anal- ysis, inverse and implicit function theorems, strong operator topology, dilation theory. MSC (2010): Primary 46L52; Secondary 47A56, 47J07. INTRODUCTION Polynomials in d noncommuting indeterminates can naturally be evaluated on d-tuples of square matrices of any size. The resulting function is graded (tuples of n × n ma- trices are mapped to n × n matrices) and preserves direct sums and similarities. Along with polynomials, noncommutative rational functions and power series, the convergence of which has been studied for example in [9], [14], [15], serve as prototypical examples of a more general class of functions called noncommutative functions. The theory of non- commutative functions finds its origin in the 1973 work of J. L. Taylor [17], who studied arXiv:1804.01040v2 [math.FA] 7 Aug 2019 the functional calculus of noncommuting operators. Roughly speaking, noncommutative functions are to polynomials in noncommuting variables as holomorphic functions from complex analysis are to polynomials in commuting variables.
    [Show full text]
  • The Implicit Function Theorem and Free Algebraic Sets Jim Agler
    Washington University in St. Louis Washington University Open Scholarship Mathematics Faculty Publications Mathematics and Statistics 5-2016 The implicit function theorem and free algebraic sets Jim Agler John E. McCarthy Washington University in St Louis, [email protected] Follow this and additional works at: https://openscholarship.wustl.edu/math_facpubs Part of the Algebraic Geometry Commons Recommended Citation Agler, Jim and McCarthy, John E., "The implicit function theorem and free algebraic sets" (2016). Mathematics Faculty Publications. 25. https://openscholarship.wustl.edu/math_facpubs/25 This Article is brought to you for free and open access by the Mathematics and Statistics at Washington University Open Scholarship. It has been accepted for inclusion in Mathematics Faculty Publications by an authorized administrator of Washington University Open Scholarship. For more information, please contact [email protected]. The implicit function theorem and free algebraic sets ∗ Jim Agler y John E. McCarthy z U.C. San Diego Washington University La Jolla, CA 92093 St. Louis, MO 63130 February 19, 2014 Abstract: We prove an implicit function theorem for non-commutative functions. We use this to show that if p(X; Y ) is a generic non-commuting polynomial in two variables, and X is a generic matrix, then all solutions Y of p(X; Y ) = 0 will commute with X. 1 Introduction A free polynomial, or nc polynomial (nc stands for non-commutative), is a polynomial in non-commuting variables. Let Pd denote the algebra of free polynomials in d variables. If p 2 Pd, it makes sense to think of p as a function that can be evaluated on matrices.
    [Show full text]
  • Chapter 3 Inverse Function Theorem
    Chapter 3 Inverse Function Theorem (This lecture was given Thursday, September 16, 2004.) 3.1 Partial Derivatives Definition 3.1.1. If f : Rn Rm and a Rn, then the limit → ∈ f(a1,...,ai + h,...,an) f(a1,...,an) Dif(a) = lim − (3.1) h→0 h is called the ith partial derivative of f at a, if the limit exists. Denote Dj(Dif(x)) by Di,j(x). This is called a second-order (mixed) partial derivative. Then we have the following theorem (equality of mixed partials) which is given without proof. The proof is given later in Spivak, Problem 3-28. Theorem 3.1.2. If Di,jf and Dj,if are continuous in an open set containing a, then Di,jf(a)= Dj,if(a) (3.2) 19 We also have the following theorem about partial derivatives and maxima and minima which follows directly from 1-variable calculus: Theorem 3.1.3. Let A Rn. If the maximum (or minimum) of f : A R ⊂ → occurs at a point a in the interior of A and Dif(a) exists, then Dif(a) = 0. 1 n Proof: Let gi(x)= f(a ,...,x,...,a ). gi has a maximum (or minimum) i i ′ i at a , and gi is defined in an open interval containing a . Hence 0 = gi(a ) = 0. The converse is not true: consider f(x, y) = x2 y2. Then f has a − minimum along the x-axis at 0, and a maximum along the y-axis at 0, but (0, 0) is neither a relative minimum nor a relative maximum.
    [Show full text]
  • Aspects of Non-Commutative Function Theory
    Concr. Oper. 2016; 3: 15–24 Concrete Operators Open Access Research Article Jim Agler and John E. McCarthy* Aspects of non-commutative function theory DOI 10.1515/conop-2016-0003 Received October 30, 2015; accepted February 10, 2016. Abstract: We discuss non commutative functions, which naturally arise when dealing with functions of more than one matrix variable. Keywords: Noncommutative function, Free holomorphic function MSC: 14M99, 15A54 1 Motivation A non-commutative polynomial is an element of the algebra over a free monoid; an example is p.x; y/ 2x2 3xy 4yx 5x2y 6xyx: (1) D C C C Non-commutative function theory is the study of functions of non-commuting variables, which may be more general than non-commutative polynomials. It is based on the observation that matrices are natural objects on which to evaluate an expression like (1). 1.1 LMI’s A linear matrix inequality (LMI) is an inequality of the form M X A0 xi Ai 0: (2) C i 1 D m The Ai are given self-adjoint n-by-n matrices, and the object is to find x R such that (2) is satisfied (or to show 2 that it is never satisfied). LMI’s are very important in control theory, and there are efficient algorithms for finding solutions. See for example the book [9]. Often, the stability of a system is equivalent to whether a certain matrix valued function F .x/ is positive semi- definite; but the function F may be non-linear. A big question is when the inequality F .x/ 0 can be reduced to an LMI.
    [Show full text]
  • An Inverse Function Theorem Converse
    AN INVERSE FUNCTION THEOREM CONVERSE JIMMIE LAWSON Abstract. We establish the following converse of the well-known inverse function theorem. Let g : U → V and f : V → U be inverse homeomorphisms between open subsets of Banach spaces. If g is differentiable of class Cp and f if locally Lipschitz, then the Fr´echet derivative of g at each point of U is invertible and f must be differentiable of class Cp. Primary 58C20; Secondary 46B07, 46T20, 46G05, 58C25 Key words and phrases. Inverse function theorem, Lipschitz map, Banach space, chain rule 1. Introduction A general form of the well-known inverse function theorem asserts that if g is a differentiable function of class Cp, p ≥ 1, between two open subsets of Banach spaces and if the Fr´echet derivative of g at some point x is invertible, then locally around x, there exists a differentiable inverse map f of g that is also of class Cp. But in various settings, one may have the inverse function f readily at hand and want to know about the invertibility of the Fr´echet derivative of g at x and whether f is of class Cp. Our purpose in this paper is to present a relatively elementary proof of this arXiv:1812.03561v1 [math.FA] 9 Dec 2018 converse result under the general hypothesis that the inverse f is (locally) Lipschitz. Simple examples like g(x)= x3 at x = 0 on the real line show that the assumption of continuity alone is not enough. Thus it is a bit surprising that the mild strengthening to the assumption that the inverse is locally Lipschitz suffices.
    [Show full text]
  • Analyticity and Naturality of the Multi-Variable Functional Calculus Harald Biller Fachbereich Mathematik, Technische Universität Darmstadt, Schlossgartenstr
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Expo. Math. 25 (2007) 131–163 www.elsevier.de/exmath Analyticity and naturality of the multi-variable functional calculus Harald Biller Fachbereich Mathematik, Technische Universität Darmstadt, Schlossgartenstr. 7, 64289 Darmstadt, Germany Received 21 April 2004; received in revised form 28 August 2006 Abstract Mackey-complete complex commutative continuous inverse algebras generalize complex commu- tative Banach algebras. After constructing the Gelfand transform for these algebras, we develop the functional calculus for holomorphic functions on neighbourhoods of the joint spectra of finitely many elements and for holomorphic functions on neighbourhoods of the Gelfand spectrum. To this end, ∗ we study the algebra of holomorphic germs in weak -compact subsets of the dual. We emphasize the simultaneous analyticity of the functional calculus in both the function and its arguments and its naturality. Finally, we treat systems of analytic equations in these algebras. ᭧ 2006 Elsevier GmbH. All rights reserved. MSC 2000: 46H30; 32A38; 41A20; 46G20; 58B12 Keywords: Holomorphic functional calculus; Commutative continuous inverse algebra; Algebra of holomorphic germs 1. Introduction A continuous inverse algebra is a locally convex unital associative algebra in which the set of invertible elements is open and inversion is continuous. Such an algebra is called Mackey- complete if every smooth curve has a weak integral. This weak completeness property can also be defined in terms of the bounded structure, or in terms of the convergence of special Cauchy sequences. E-mail addresses: [email protected] 0723-0869/$ - see front matter ᭧ 2006 Elsevier GmbH.
    [Show full text]
  • On Frechet Derivatives with Application to the Inverse Function Theorem of Ordinary Differential Equations
    On Frechet Derivatives with Application to the Inverse Function Theorem of Ordinary Differential Equations Eziokwu, C. Emmanuel, Ph.D. † Abstract In this paper, the Frechet differentiation of functions on Banach space was reviewed. We also investigated it’s algebraic properties and its relation by applying the concept to the inverse function theorem of the ordinary differential equations. To achieve the feat, some important results were considered which finally concluded that the Frechet derivative can extensively be useful in the study of ordinary differential equations. Key Words: Banach space, Frechet differentiability Lipchitz function Inverse function theorem. Introduction The Frechet derivative, a result in mathematical analysis is derivative usually defined on Banach spaces. It is often used to formalize the functional derivatives commonly used in physics, particularly quantum field theory. The purpose of this work is to review some results obtained on the theory of the derivatives and apply it to the inverse function theorem in ordinary differential equations. 1.0 Derivatives Definition 1.1 [Kaplon (1958)]: Let f be an operator mapping a Banach space X into a Banach space Y. If there exists a bounded linear operator T from X into Y such that: Or, Or then P is said to be Frechet differentiable at x0, and the bounded linear operator Journal of Mathematical Sciences & Mathematics Education Vol. 14 No. 2 1 is called the first Frechet – derivative of f at x0. The limit in (1.1) is supposed to hold independent of the way that approaches 0. Moreover, the Frechet differential is an arbitrary close approximation to the difference relative to , for small.
    [Show full text]
  • M382D NOTES: DIFFERENTIAL TOPOLOGY 1. the Inverse And
    M382D NOTES: DIFFERENTIAL TOPOLOGY ARUN DEBRAY MAY 16, 2016 These notes were taken in UT Austin’s Math 382D (Differential Topology) class in Spring 2016, taught by Lorenzo Sadun. I live-TEXed them using vim, and as such there may be typos; please send questions, comments, complaints, and corrections to [email protected]. Thanks to Adrian Clough, Parker Hund, Max Reistenberg, and Thérèse Wu for finding and correcting a few mistakes. CONTENTS 1. The Inverse and Implicit Function Theorems: 1/20/162 2. The Contraction Mapping Theorem: 1/22/164 3. Manifolds: 1/25/16 6 4. Abstract Manifolds: 1/27/16 8 5. Examples of Manifolds and Tangent Vectors: 1/29/169 6. Smooth Maps Between Manifolds: 2/1/16 11 7. Immersions and Submersions: 2/3/16 13 8. Transversality: 2/5/16 15 9. Properties Stable Under Homotopy: 2/8/16 17 10. May the Morse Be With You: 2/10/16 19 11. Partitions of Unity and the Whitney Embedding Theorem: 2/12/16 21 12. Manifolds-With-Boundary: 2/15/16 22 13. Retracts and Other Consequences of Boundaries: 2/17/16 24 14. The Thom Transversality Theorem: 2/19/16 26 15. The Normal Bundle and Tubular Neighborhoods: 2/22/16 27 16. The Extension Theorem: 2/24/16 28 17. Intersection Theory: 2/26/16 30 18. The Jordan Curve Theorem and the Borsuk-Ulam Theorem: 2/29/16 32 19. Getting Oriented: 3/2/16 33 20. Orientations on Manifolds: 3/4/16 35 21. Orientations and Preimages: 3/7/16 36 22.
    [Show full text]
  • Arxiv:1901.09776V1 [Math.OA] 28 Jan 2019 E Od N Phrases
    EXISTENCE AND UNIQUENESS OF THE KARCHER MEAN ON UNITAL C∗-ALGEBRAS JIMMIE LAWSON Abstract. The Karcher mean on the cone Ω of invertible positive elements of the C∗-algebra B(E) of bounded operators on a Hilbert space E has recently been ex- tended to a contractive barycentric map on the space of L1- probability measures on Ω. In this paper we first show that the barycenter satisfies the Karcher equa- tion and then establish the uniqueness of the solution. Next we establish that the Karcher mean is real analytic in each of its coordinates, and use this fact to show that both the Karcher mean and Karcher barycenter map exist and are unique on any unital C∗-algebra. The proof depends crucially on a recent result of the author giving a converse of the inverse function theorem. Subject Classification: Primary: 47B65; Secondary: 47L07, 46L99 Key words and phrases. Karcher mean and barycenter, Karcher equation, C∗-algebra, cone of positive elements, integrable measures, Wasserstein distance, Bochner integral, real analytic 1. Introduction In the past 15 years there has been a rather intensive study of geometric matrix means, in particular, one that has been called the Fr´echet mean, Cartan mean, least arXiv:1901.09776v1 [math.OA] 28 Jan 2019 squares mean, or Karcher mean, and their extensions to barycentric maps on spaces of probability measures [12], [8]. H. Karcher [3] gave an equational characterization of this mean on Riemannian manifolds, and in [7] Y. Lim and the author showed that this equational characterization could be extended to the cone of positive invertible operators in the C∗-algebra of bounded linear maps on a Hilbert space.
    [Show full text]
  • Calculus of Variations (With Notes on Infinite-Dimesional Calculus)
    Calculus of Variations (with notes on infinite-dimesional calculus) J. B. Cooper Johannes Kepler Universit¨at Linz Contents 1 Introduction 2 1.1 Methods employed in the calculus of variations. 3 2 The Riemann mapping theorem. 5 3 Analysis in Banach spaces 7 3.1 Differentiation and integration of E-valued functions . 7 3.2 TheBochnerintegral . .. .. 12 3.3 TheOrlicz-PettisTheorem. 15 3.4 Holomorphic E-valuedfunctions. 16 3.5 Differentiability of functions on Banach spaces . 20 4 The calculus of variations 29 4.1 The Euler equations – application . 29 4.2 TheWeierstraßrepresentation:. 37 4.3 Applications to Physics: . 43 1 1 Introduction The calculus of variations deals with the problem of maximizing or minimiz- ing functionals i.e. functions which are defined not on subsets of Rn but on spaces of functions. As a simple example consider all parameterized curves (defined on [0, 1]) between two points x0 and x1 on the plane. Then the shortest such curve is characterized as that curve c with c(0) = x0, c(1) = x1 which minimizes the functional 1 L(c)= c˙(t) dt Z0 Of course this example is not particularly interesting since we know that the solution is the straight line segment from x0 to x1. However, it does become interesting and non trivial if we consider points in higher dimensional space and consider only those curves which lie on a given curved surface (the problem of geodetics). Further examples: 1. The Brachistone Problem. Given are two points O (the origin) and P with yP < 0. Find the curve from O to P for which 1 1 1 2 2 ds = c˙1(t) +c ˙2(t)dt c √ y 0 c (t) Z − Z − 2 q is a minimum.
    [Show full text]