DOCSLIB.ORG

Linear and Complex Analysis for Applications John P. D'angelo

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Linear and Complex Analysis for Applications John P. D’Angelo DEPT. OF MATHEMATICS,UNIV. OF ILLINOIS, 1409 W. GREEN ST., URBANA IL 61801 E-mail address: [email protected] c 2014 by John P. D’Angelo Contents Chapter 1. Linear algebra 9 1. Linear equations 9 2. Matrices and row operations 15 3. Vector spaces 21 4. Dimension 25 5. Eigenvalues and eigenvectors 29 6. Bases and the matrix of a linear map 32 7. Determinants 37 8. Diagonalization and generalized eigenspaces 41 9. Characteristic and minimal polynomials 44 10. Similarity 46 Chapter 2. Complex numbers 49 1. Basic definitions 49 2. Limits 51 3. The exponential function and trig 53 4. Subsets of C 58 5. Complex logarithms 59 6. Linear fractional transformations 63 7. Linear fractional transformations and matrices 66 8. The Riemann sphere 69 Chapter 3. Vector analysis 73 1. Euclidean geometry 73 2. Differentiable functions 75 3. Line integrals and work 80 4. Surface integrals and flux 84 5. The divergence theorem 88 6. The classical Stokes’ theorem 91 7. A quick look at Maxwell’s equations 94 8. Differential forms 96 9. Inverse and implicit functions 101 Chapter 4. Complex analysis 105 1. Open subsets of C 105 2. Complex differentiation 106 3. Complex integration 109 4. The Cauchy theory 110 3 4 CONTENTS 5. Polynomials and power series 114 6. Singularities 117 7. Residues 119 8. More residue computations 123 Chapter 5. Transform methods 131 1. Laplace transforms 131 2. Generating functions and the Z-transform 139 3. Fourier series 148 4. Fourier transforms on R 152 Chapter 6. Hilbert spaces 161 1. Inner products and norms 161 2. Orthonormal expansion 164 3. Linear transformations 166 4. Adjoints 167 5. Hermitian and unitary operators 170 6. L2 spaces 176 7. Sturm-Liouville equations 179 8. The Green’s function 182 9. Additional techniques 186 10. Spectral theory 189 11. Orthonormal expansions in eigenvectors 191 Chapter 7. Examples and applications 195 1. Least squares 195 2. The wave equation 199 3. Legendre polynomials 203 4. Probability 206 5. Quantum mechanics 211 6. The Dirichlet problem and conformal mapping 217 References 223 Index 225 CONTENTS 5 Preface This book is based on a course taught in Spring 2014 at the University of Illinois. The course, Elec- trical and Computer Engineering (ECE) 493, is cross-listed as Math 487. Twenty-one students, including several graduate students, completed the class. Areas of specialization were electrical, mechanical, and civil engineering, engineering physics, and mathematics. Background and interests varied considerably; communicating with all these students at the same time and in the same notation was challenging. The course began with three reviews. We discussed elementary linear algebra and differential equations, basic complex variables, and some multi-variable calculus. The students took two diagnostic exams on these topics. The first three chapters include these reviews but also introduce additional material. The author feels that spiral learning works well here; in the classroom he prefers (for example) to introduce differential forms when reviewing line and surface integrals rather than to start anew. Thus the course used these reviews to gradually seduce the student into a more abstract point of view. This seduction is particularly prominent in the material on Hilbert spaces. This book aims to develop understanding of sophisticated tools by using them rather than by filling in all the details, and hence it is not completely rigorous. The review material helped students relearn things better while creating a desire to see powerful ideas in action. After the reviews, the course began anew, with about 4 weeks of complex analysis, 1 week on the Laplace transform, 3 weeks on Hilbert spaces and orthonormal expansion. We discussed Sturm-Liouville theory to give examples of orthonormal expansion, and we briefly discussed generating functions (and the so-called Z-transform) to provide a discrete analogue of the Laplace transform. The unifying theme of the class remained linearity and related spectral methods. The course sketched a proof of the Sturm-Liouville theorem, but filling in the details was not possible because student backgrounds in analysis were so varied. The book itself includes much more material than was discussed in the course, and it is quite flexible as a potential text. Mathematical prerequisites include three semesters of calculus, a beginning course in differential equations, and some elementary linear algebra. Complex variable theory is developed in the book, and hence is not a prerequisite. First year courses in Physics are useful but not strictly necessary. Several possible courses can be based upon this book. Covering the first three chapters in the first half of the semester and then choosing topics from the last four chapters in the second half make a nice course at the junior or senior level. Such a course should appeal to faculty in engineering who want an integrated treatment of linear algebra and complex analysis, including applications and also reviewing vector analysis. After covering the first four chapters, students in mathematics and physics can continue with the Hilbert space chapter and conclude with the sections on probability and quantum mechanics. The first five chapters together with the last section of Chapter 7 make a coherent applied complex variables course. Students with strong backgrounds can read the first three chapters on their own as review, and take a one semester course based on the last four chapters. Such a course would be ideal for many graduate students in applied mathematics, physics, and engineering. More than 300 exercises of considerably varying difficulty and feeling appear here. They are placed at the ends of sections, rather than at the end of chapters, to encourage the reader to solve them as she reads. Many of the exercises are routine and a few are difficult. Others introduce new material or new settings where the techniques can be used. Most of the exercises come from mathematics; users of the book can provide additional exercises coming from engineering and physics. The text weaves abstract mathematics, routine computational problems, and applications into a coherent whole, whose unifying theme is linear systems. The author hopes that readers from diverse backgrounds will appreciate the mathematics, while recognizing that not all readers will find the many topics equally compelling. The book itself has three primary goals. One goal is to develop enough linear analysis and complex variable theory to prepare students in engineering or applied mathematics for advanced work. The second goal is to unify many distinct and seemingly isolated topics. The third goal is to reveal mathematics as both 6 CONTENTS interesting and useful, especially via the juxtaposition of examples and theorems. We give some examples of how we achieve these goals: • A Fourier series is a particular type of orthonormal expansion; we include many examples of orthonormal expansion as well as the general theory. • Many aspects of the theory of linear equations are the same in finite and infinite dimensions; we glimpse both the similarities and the differences in Chapter 1 and develop the ideas in detail in Chapter 6. • One recurring theme concerns functions of operators. We regard diagonalization of a matrix and taking Laplace or Fourier transforms as similar (pun intended) techniques. Early in the course, and somewhat out of the blue, the author asked the class whatp would it mean to take “half of a derivative”. One bright engineering student said “multiply by s”. • The idea of choosing coordinates and notation in which computations are easy is a major theme in this book. Complex variables illustrate this theme throughout. For example, we use complex exponentials rather than trig functions nearly always. • We state the spectral theorem for compact operators on Hilbert space as part of our discussion of Sturm-Liouville equations, hoping that many readers will want to study more operator theory. • We express Maxwell’s equations in terms of both vector fields and differential forms, hoping that many readers want to study differential geometry. Many of the examples will be accessible yet new to nearly all readers. The author hopes the reader appreci- ates these examples as both science and art. This book contains many topics and examples not found in other books on engineering mathematics. Here are some examples. To illustrate the usefulness of changing basis, we determine which polynomials with rational coefficients map the integers to the integers. We mention the scalar field consisting of two elements, and include several exercises about lights-out puzzles to illuminate linear algebra involving this field. We compute line and surface integrals using both differential forms and the classical notation of vector analysis, and we include a section on Maxwell’s equations expressed using differential forms. To illustrate sine series, we prove the Wirtinger inequality relating the L2 norms of a function and its derivative. Throughout the book we develop connections between finite and infinite dimensional linear algebra, and many of these ideas will be new to most readers. For example, we compute ζ(2) by finding the trace of the Green’s operator for the second derivative. We introduce enough probability to say a bit about quantum mechanics; for example, we prove the Heisenberg uncertainty principle. We also include exercises on dice with strange properties. Our discussion of generating functions (Z-transforms) includes a derivation of PN p a general formula for the sums n=1 n (using Bernoulli numbers) as well as (the much easier) Binet’s formula for the Fibonacci numbers. The section on generating functions contains several unusual exercises, including a test for rationality and the notion of Abel summability. There we also discuss the precise meaning −1 of the notorious but dubious formula 1 + 2 + 3 + ::: = 12 , and we mention the concept of zeta function regularization.
Recommended publications
  • The Integral Geometry of Line Complexes and a Theorem of Gelfand-Graev Astérisque, Tome S131 (1985), P

    The Integral Geometry of Line Complexes and a Theorem of Gelfand-Graev Astérisque, Tome S131 (1985), P

    Astérisque VICTOR GUILLEMIN The integral geometry of line complexes and a theorem of Gelfand-Graev Astérisque, tome S131 (1985), p. 135-149 <http://www.numdam.org/item?id=AST_1985__S131__135_0> © Société mathématique de France, 1985, tous droits réservés. L’accès aux archives de la collection « Astérisque » (http://smf4.emath.fr/ Publications/Asterisque/) implique l’accord avec les conditions générales d’uti- lisation (http://www.numdam.org/conditions). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ Société Mathématique de France Astérisque, hors série, 1985, p. 135-149 THE INTEGRAL GEOMETRY OF LINE COMPLEXES AND A THEOREM OF GELFAND-GRAEV BY Victor GUILLEMIN 1. Introduction Let P = CP3 be the complex three-dimensional projective space and let G = CG(2,4) be the Grassmannian of complex two-dimensional subspaces of C4. To each point p E G corresponds a complex line lp in P. Given a smooth function, /, on P we will show in § 2 how to define properly the line integral, (1.1) f(\)d\ d\. = f(p). d A complex hypersurface, 5, in G is called admissible if there exists no smooth function, /, which is not identically zero but for which the line integrals, (1,1) are zero for all p G 5. In other words if S is admissible, then, in principle, / can be determined by its integrals over the lines, Zp, p G 5. In the 60's GELFAND and GRAEV settled the problem of characterizing which subvarieties, 5, of G have this property.
  • CR Singular Immersions of Complex Projective Spaces

    CR Singular Immersions of Complex Projective Spaces

    Beitr¨agezur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 2, 451-477. CR Singular Immersions of Complex Projective Spaces Adam Coffman∗ Department of Mathematical Sciences Indiana University Purdue University Fort Wayne Fort Wayne, IN 46805-1499 e-mail: Coff[email protected] Abstract. Quadratically parametrized smooth maps from one complex projective space to another are constructed as projections of the Segre map of the complexifi- cation. A classification theorem relates equivalence classes of projections to congru- ence classes of matrix pencils. Maps from the 2-sphere to the complex projective plane, which generalize stereographic projection, and immersions of the complex projective plane in four and five complex dimensions, are considered in detail. Of particular interest are the CR singular points in the image. MSC 2000: 14E05, 14P05, 15A22, 32S20, 32V40 1. Introduction It was shown by [23] that the complex projective plane CP 2 can be embedded in R7. An example of such an embedding, where R7 is considered as a subspace of C4, and CP 2 has complex homogeneous coordinates [z1 : z2 : z3], was given by the following parametric map: 1 2 2 [z1 : z2 : z3] 7→ 2 2 2 (z2z¯3, z3z¯1, z1z¯2, |z1| − |z2| ). |z1| + |z2| + |z3| Another parametric map of a similar form embeds the complex projective line CP 1 in R3 ⊆ C2: 1 2 2 [z0 : z1] 7→ 2 2 (2¯z0z1, |z1| − |z0| ). |z0| + |z1| ∗The author’s research was supported in part by a 1999 IPFW Summer Faculty Research Grant. 0138-4821/93 $ 2.50 c 2002 Heldermann Verlag 452 Adam Coffman: CR Singular Immersions of Complex Projective Spaces This may look more familiar when restricted to an affine neighborhood, [z0 : z1] = (1, z) = (1, x + iy), so the set of complex numbers is mapped to the unit sphere: 2x 2y |z|2 − 1 z 7→ ( , , ), 1 + |z|2 1 + |z|2 1 + |z|2 and the “point at infinity”, [0 : 1], is mapped to the point (0, 0, 1) ∈ R3.
  • An Introduction to Complex Analysis and Geometry John P. D'angelo

    An Introduction to Complex Analysis and Geometry John P. D'angelo

    An Introduction to Complex Analysis and Geometry John P. D'Angelo Dept. of Mathematics, Univ. of Illinois, 1409 W. Green St., Urbana IL 61801 [email protected] 1 2 c 2009 by John P. D'Angelo Contents Chapter 1. From the real numbers to the complex numbers 11 1. Introduction 11 2. Number systems 11 3. Inequalities and ordered fields 16 4. The complex numbers 24 5. Alternative definitions of C 26 6. A glimpse at metric spaces 30 Chapter 2. Complex numbers 35 1. Complex conjugation 35 2. Existence of square roots 37 3. Limits 39 4. Convergent infinite series 41 5. Uniform convergence and consequences 44 6. The unit circle and trigonometry 50 7. The geometry of addition and multiplication 53 8. Logarithms 54 Chapter 3. Complex numbers and geometry 59 1. Lines, circles, and balls 59 2. Analytic geometry 62 3. Quadratic polynomials 63 4. Linear fractional transformations 69 5. The Riemann sphere 73 Chapter 4. Power series expansions 75 1. Geometric series 75 2. The radius of convergence 78 3. Generating functions 80 4. Fibonacci numbers 82 5. An application of power series 85 6. Rationality 87 Chapter 5. Complex differentiation 91 1. Definitions of complex analytic function 91 2. Complex differentiation 92 3. The Cauchy-Riemann equations 94 4. Orthogonal trajectories and harmonic functions 97 5. A glimpse at harmonic functions 98 6. What is a differential form? 103 3 4 CONTENTS Chapter 6. Complex integration 107 1. Complex-valued functions 107 2. Line integrals 109 3. Goursat's proof 116 4. The Cauchy integral formula 119 5.
  • Math 311 - Introduction to Proof and Abstract Mathematics Group Assignment # 15 Name: Due: at the End of Class on Tuesday, March 26Th

    Math 311 - Introduction to Proof and Abstract Mathematics Group Assignment # 15 Name: Due: at the End of Class on Tuesday, March 26Th

    Math 311 - Introduction to Proof and Abstract Mathematics Group Assignment # 15 Name: Due: At the end of class on Tuesday, March 26th More on Functions: Definition 5.1.7: Let A, B, C, and D be sets. Let f : A B and g : C D be functions. Then f = g if: → → A = C and B = D • For all x A, f(x)= g(x). • ∈ Intuitively speaking, this definition tells us that a function is determined by its underlying correspondence, not its specific formula or rule. Another way to think of this is that a function is determined by the set of points that occur on its graph. 1. Give a specific example of two functions that are defined by different rules (or formulas) but that are equal as functions. 2. Consider the functions f(x)= x and g(x)= √x2. Find: (a) A domain for which these functions are equal. (b) A domain for which these functions are not equal. Definition 5.1.9 Let X be a set. The identity function on X is the function IX : X X defined by, for all x X, → ∈ IX (x)= x. 3. Let f(x)= x cos(2πx). Prove that f(x) is the identity function when X = Z but not when X = R. Definition 5.1.10 Let n Z with n 0, and let a0,a1, ,an R such that an = 0. The function p : R R is a ∈ ≥ ··· ∈ 6 n n−1 → polynomial of degree n with real coefficients a0,a1, ,an if for all x R, p(x)= anx +an−1x + +a1x+a0.
  • Complex Algebraic Geometry

    Complex Algebraic Geometry

    Complex Algebraic Geometry Jean Gallier∗ and Stephen S. Shatz∗∗ ∗Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104, USA e-mail: [email protected] ∗∗Department of Mathematics University of Pennsylvania Philadelphia, PA 19104, USA e-mail: [email protected] February 25, 2011 2 Contents 1 Complex Algebraic Varieties; Elementary Theory 7 1.1 What is Geometry & What is Complex Algebraic Geometry? . .......... 7 1.2 LocalStructureofComplexVarieties. ............ 14 1.3 LocalStructureofComplexVarieties,II . ............. 28 1.4 Elementary Global Theory of Varieties . ........... 42 2 Cohomologyof(Mostly)ConstantSheavesandHodgeTheory 73 2.1 RealandComplex .................................... ...... 73 2.2 Cohomology,deRham,Dolbeault. ......... 78 2.3 Hodge I, Analytic Preliminaries . ........ 89 2.4 Hodge II, Globalization & Proof of Hodge’s Theorem . ............ 107 2.5 HodgeIII,TheK¨ahlerCase . .......... 131 2.6 Hodge IV: Lefschetz Decomposition & the Hard Lefschetz Theorem............... 147 2.7 ExtensionsofResultstoVectorBundles . ............ 162 3 The Hirzebruch-Riemann-Roch Theorem 165 3.1 Line Bundles, Vector Bundles, Divisors . ........... 165 3.2 ChernClassesandSegreClasses . .......... 179 3.3 The L-GenusandtheToddGenus .............................. 215 3.4 CobordismandtheSignatureTheorem. ........... 227 3.5 The Hirzebruch–Riemann–Roch Theorem (HRR) . ............ 232 3 4 CONTENTS Preface This manuscript is based on lectures given by Steve Shatz for the course Math 622/623–Complex Algebraic Geometry, during Fall 2003 and Spring 2004. The process for producing this manuscript was the following: I (Jean Gallier) took notes and transcribed them in LATEX at the end of every week. A week later or so, Steve reviewed these notes and made changes and corrections. After the course was over, Steve wrote up additional material that I transcribed into LATEX. The following manuscript is thus unfinished and should be considered as work in progress.
  • 1 Monoids and Groups

    1 Monoids and Groups

    1 Monoids and groups 1.1 Definition. A monoid is a set M together with a map M × M ! M; (x; y) 7! x · y such that (i) (x · y) · z = x · (y · z) 8x; y; z 2 M (associativity); (ii) 9e 2 M such that x · e = e · x = x for all x 2 M (e = the identity element of M). 1.2 Examples. 1) Z with addition of integers (e = 0) 2) Z with multiplication of integers (e = 1) 3) Mn(R) = fthe set of all n × n matrices with coefficients in Rg with ma- trix multiplication (e = I = the identity matrix) 4) U = any set P (U) := fthe set of all subsets of Ug P (U) is a monoid with A · B := A [ B and e = ?. 5) Let U = any set F (U) := fthe set of all functions f : U ! Ug F (U) is a monoid with multiplication given by composition of functions (e = idU = the identity function). 1.3 Definition. A monoid is commutative if x · y = y · x for all x; y 2 M. 1.4 Example. Monoids 1), 2), 4) in 1.2 are commutative; 3), 5) are not. 1 1.5 Note. Associativity implies that for x1; : : : ; xk 2 M the expression x1 · x2 ····· xk has the same value regardless how we place parentheses within it; e.g.: (x1 · x2) · (x3 · x4) = ((x1 · x2) · x3) · x4 = x1 · ((x2 · x3) · x4) etc. 1.6 Note. A monoid has only one identity element: if e; e0 2 M are identity elements then e = e · e0 = e0 1.7 Definition.
  • Ishikawa-Oyama.Pdf

    Ishikawa-Oyama.Pdf

    Proc. of 15th International Workshop Journal of Singularities on Singularities, Sao˜ Carlos, 2018 Volume 22 (2020), 373-384 DOI: 10.5427/jsing.2020.22v TOPOLOGY OF COMPLEMENTS TO REAL AFFINE SPACE LINE ARRANGEMENTS GOO ISHIKAWA AND MOTOKI OYAMA ABSTRACT. It is shown that the diffeomorphism type of the complement to a real space line arrangement in any dimensional affine ambient space is determined only by the number of lines and the data on multiple points. 1. INTRODUCTION Let A = f`1;`2;:::;`dg be a real space line arrangement, or a configuration, consisting of affine 3 d d-lines in R . The different lines `i;` j(i 6= j) may intersect, so that the union [i=1`i is an affine real algebraic curve of degree d in R3 possibly with multiple points. In this paper we determine the topological 3 d type of the complement M(A ) := R n([i=1`i) of A , which is an open 3-manifold. We observe that the topological type M(A ) is determined only by the number of lines and the data on multiple points of A . Moreover we determine the diffeomorphism type of M(A ). n n i j i j Set D := fx 2 R j kxk ≤ 1g, the n-dimensional closed disk. The pair (D × D ;D × ¶(D )) with i + j = n; 0 ≤ i;0 ≤ j, is called an n-dimensional handle of index j (see [17][1] for instance). Now take one D3 and, for any non-negative integer g, attach to it g-number of 3-dimensional handles 2 1 2 1 (Dk × Dk;Dk × ¶(Dk)) of index 1 (1 ≤ k ≤ g), by an attaching embedding g G 2 1 3 2 j : (Dk × ¶(Dk)) ! ¶(D ) = S k=1 such that the obtained 3-manifold 3 S Fg 2 1 Bg := D j ( k=1(Dk × Dk)) is orientable.
  • Lecture 3 Partially Ordered Sets

    Lecture 3 Partially Ordered Sets

    Lecture 3 Partially ordered sets Now for something totally different. In life, useful sets are rarely “just” sets. They often come with additional structure. For example, R isn’t useful just because it’s some set. It’s useful because we can add its elements, multiply its elements, and even compare its elements. If A is, for example, the set of all bananas and apples on earth, it’s not as natural to do any of these things with elements of A. Today, we’ll talk about a structure called a partial order. 3.1 Preliminaries First, let me remind you of something called the Cartesian product, or direct product of sets. Definition 3.1.1. Let A and B be sets. Then the Cartesian product of A and B is defined to be the set consisting of all pairs (a, b) where a A and œ b B. We denote the Cartesian product by œ A B. ◊ Example 3.1.2. R2 is the Cartesian product R R. ◊ Example 3.1.3. Let T be the set of all t-shirts in Hiro’s closet, and S the set of all shorts in Hiro’s closet. Then S T represents the collection of all ◊ possible outfits Hiro is willing to consider in August. (I.e., Hiro is willing to consider putting on any of his shorts together with any of his t-shirts.) 23 24 LECTURE 3. PARTIALLY ORDERED SETS Note that we can “repeat” the Cartesian product operation, or apply it many times at once. Example 3.1.4.
  • Lecture 19: Alternating Group

    Lecture 19: Alternating Group

    MATH 433 Applied Algebra Lecture 19: Alternating group. Abstract groups. Sign of a permutation Theorem 1 For any n ≥ 2 there exists a unique function sgn : S(n) → {−1, 1} such that • sgn(πσ)= sgn(π) sgn(σ) for all π, σ ∈ S(n), • sgn(τ)= −1 for any transposition τ in S(n). A permutation π is called even if it is a product of an even number of transpositions, and odd if it is a product of an odd number of transpositions. It turns out that π is even if sgn(π)=1 and odd if sgn(π)= −1. Theorem 2 (i) sgn(πσ)= sgn(π) sgn(σ) for any π, σ ∈ S(n). (ii) sgn(π−1)= sgn(π) for any π ∈ S(n). (iii) sgn(id) = 1. (iv) sgn(τ)= −1 for any transposition τ. (v) sgn(σ)=(−1)r−1 for any cycle σ of length r. Alternating group Given an integer n ≥ 2, the alternating group on n symbols, denoted An or A(n), is the set of all even permutations in the symmetric group S(n). Theorem (i) For any two permutations π, σ ∈ A(n), the product πσ is also in A(n). (ii) The identity function id is in A(n). (iii) For any permutation π ∈ A(n), the inverse π−1 is in A(n). In other words, the product of even permutations is even, the identity function is an even permutation, and the inverse of an even permutation is even. Theorem The alternating group A(n) has n!/2 elements.
  • Theoretical Probability and Statistics

    Theoretical Probability and Statistics

    Theoretical Probability and Statistics Charles J. Geyer Copyright 1998, 1999, 2000, 2001, 2008 by Charles J. Geyer September 5, 2008 Contents 1 Finite Probability Models 1 1.1 Probability Mass Functions . 1 1.2 Events and Measures . 5 1.3 Random Variables and Expectation . 6 A Greek Letters 9 B Sets and Functions 11 B.1 Sets . 11 B.2 Intervals . 12 B.3 Functions . 12 C Summary of Brand-Name Distributions 14 C.1 The Discrete Uniform Distribution . 14 C.2 The Bernoulli Distribution . 14 i Chapter 1 Finite Probability Models The fundamental idea in probability theory is a probability model, also called a probability distribution. Probability models can be specified in several differ- ent ways • probability mass function (PMF), • probability density function (PDF), • distribution function (DF), • probability measure, and • function mapping from one probability model to another. We will meet probability mass functions and probability measures in this chap- ter, and will meet others later. The terms “probability model” and “probability distribution” don’t indicate how the model is specified, just that it is specified somehow. 1.1 Probability Mass Functions A probability mass function (PMF) is a function pr Ω −−−−→ R which satisfies the following conditions: its values are nonnegative pr(ω) ≥ 0, ω ∈ Ω (1.1a) and sum to one X pr(ω) = 1. (1.1b) ω∈Ω The domain Ω of the PMF is called the sample space of the probability model. The sample space is required to be nonempty in order that (1.1b) make sense. 1 CHAPTER 1. FINITE PROBABILITY MODELS 2 In this chapter we require all sample spaces to be finite sets.
  • Linear Algebra I: Vector Spaces A

    Linear Algebra I: Vector Spaces A

    Linear Algebra I: Vector Spaces A 1 Vector spaces and subspaces 1.1 Let F be a field (in this book, it will always be either the field of reals R or the field of complex numbers C). A vector space V D .V; C; o;˛./.˛2 F// over F is a set V with a binary operation C, a constant o and a collection of unary operations (i.e. maps) ˛ W V ! V labelled by the elements of F, satisfying (V1) .x C y/ C z D x C .y C z/, (V2) x C y D y C x, (V3) 0 x D o, (V4) ˛ .ˇ x/ D .˛ˇ/ x, (V5) 1 x D x, (V6) .˛ C ˇ/ x D ˛ x C ˇ x,and (V7) ˛ .x C y/ D ˛ x C ˛ y. Here, we write ˛ x and we will write also ˛x for the result ˛.x/ of the unary operation ˛ in x. Often, one uses the expression “multiplication of x by ˛”; but it is useful to keep in mind that what we really have is a collection of unary operations (see also 5.1 below). The elements of a vector space are often referred to as vectors. In contrast, the elements of the field F are then often referred to as scalars. In view of this, it is useful to reflect for a moment on the true meaning of the axioms (equalities) above. For instance, (V4), often referred to as the “associative law” in fact states that the composition of the functions V ! V labelled by ˇ; ˛ is labelled by the product ˛ˇ in F, the “distributive law” (V6) states that the (pointwise) sum of the mappings labelled by ˛ and ˇ is labelled by the sum ˛ C ˇ in F, and (V7) states that each of the maps ˛ preserves the sum C.
  • Inverse Monoids Associated with the Complexity Class NP

    Inverse Monoids Associated with the Complexity Class NP

    Inverse monoids associated with the complexity class NP J.C. Birget 6 March 2017 Abstract We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective one-way functions (with respect to worst-case complexity) exist. 1 Introduction We give a few definitions before motivating the monoid approach to the P versus NP problem. Some of these notions appeared already in [3]. By function we mean a partial function A∗ → A∗, where A is a finite alphabet (usually, A = {0, 1}), and A∗ denotes the set of all finite strings over A. Let Dom(f) (⊆ A∗) denote the domain of f, i.e., {x ∈ A∗ : f(x) is defined}; and let Im(f) (⊆ A∗) denote the image (or range) of f, i.e., {f(x) : x ∈ ∗ ∗ Dom(f)}. The length of x ∈ A is denoted by |x|. The restriction of f to X ⊆ A is denoted by f|X , and the identity function on X is denoted by idX or id|X . Definition 1.1 (inverse, co-inverse, mutual inverse) A function f ′ is an inverse of a function f iff f ◦ f ′ ◦ f = f. In that case we also say that f is a co-inverse of f ′. If f ′ is both an inverse and a co-inverse of f, we say that f ′ is a mutual inverse of f, or that f ′ and f are mutual inverses (of each other).1 It is easy to see that f ′ is an inverse of f iff for every y ∈ Im(f): f ′(y) is defined and f ′(y) ∈ f −1(y).