Let H and J be as in the above lemma. The result of the lemma shows that the integral


 Julia McCormick
 1 years ago
 Views:
Transcription
1 Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined; we denote it by f(x, y)dxdy Theorem Let and be compact topogroups and f K( ). Then f(x, y)dxdy = f = f(x, y)dydx. Proof. We show that by setting M (f) = f(x, y)dxdy = f. Define a mapping M : K( ) C f(x, y)dxdy for every f K( ). We show that M is linear mapping and M satisfies Conditions a) l, b) and c) of Theorem We show first that M is linear. Let f, f K( ) and c C. Then ( M (cf + f) ( = cf(x, y) + f(x, ) ) ( y) dx dy = cf(x, y)dx + = c f(x, y)dxdy + f(x, y)dxdy = c f(x, y)dxdy + f(x, y)dxdy = cm (f) + M ( f). a ) f(x, y)dx dy We have shown that M is linear. Condition c) of Theorem 7.13 holds, since M (1) = ( 1dx) dy = 1dy = 1. To show that also Conditions a) l and b) are satisfied, we choose f K( ) and we define a function l : C by the formula l(y) = f(x, y)dx. Then M (f) = l(y)dy. Let (h, j). Then M ( (h,j) f) = = ( ) (h,j)f(x, y)dxdy = f(hx, jy)dx dy ( ) f(x, jy)dx dy = l(jy)dy = l(y)dy = M (f). We have shown such that Condition a) l is satisfied. Next we assume that f K + ( ). Then, for every y, the function x f(x, y) belongs to K + (), and it follows that l(y) = f(x, y)dx 0. ence we have l K +() and therefore M (f) = l 0. We have shown that Condition b) is satisfied. By Theorem 7.13, M is the invariant integral of. As a consequence, we have f(x, y)dxdy = f for every j K( ). Similarly, we see that f(x, y)dydx = f. 69
2 8. Linear groups and representations of topological groups. We use the symbol GL(n) to denote the collection of all n n regular (i.e., invertible ) C valued matrices. Then GL(n) is a group with respect to matrix multiplication. Let τ be the topology which GL(n) inherits from the topology of C n2 via the identification a 1,1 a 1,n.. (a 11,..., a 1n, a 21,..., a n1,..., a nn ). a n,1 a n,n We shall show later that the triple (GL(n),,τ) is a topogroup. The topogroups GL(n) are called general linear topogroups. The topogroups GL(n) and some of their closed subgroups are called classical topogroups and they are of central importance in investigations of the structure of compact topogroups. The usefulness of linear topogroups in the theory of compact groups is a consequence of the famous Peter Weyl Theorem, which states that every compact T 1 topogroup has enough continuous finitedimensional representations. A (continuous, finitedimensional) representation of a topogroup G is a continuous homomorphism G GL(n) for some n = 1, 2,... The Peter Weyl Theorem is the following result: if G is a compact T 1 topogroup with neutral element e, then for every g G \ {0}, there exists a representation φ of G such that φ(g) φ(e). To prove the Peter Weyl Theorem, it is useful to represent linear topogroups in a more abstract form, as groups of operators of finitedimensional normed spaces. We start by reviewing some basic concepts and results dealing with normed spaces. In the following, a linear space always means a linear space over the complex numbers. A norm of a linear space V is a mapping v v from V to R such that the following conditions are satisfied for all u, v V and c C: 1 u 0, and u = 0 only if u = 0. 2 u + v u + v. 3 cu = c u 8.1 Lemma Let be a norm of the linear space V. Then is an invariant length function of the group (V, +). For every v V, the sets {u V : u v < ε}, ε > 0, form a neighborhood base of v in the group topology determined by. 70
3 Proof. Condition 3 above shows that v = v for every v V. It follows, by Conditions 1 and 2, that is a length function of the group (V, +). Since the group (V, +) is commutative, the length function is invariant. The sets V,ε = {w V : w < ε}, ε > 0, form a neighborhood base for the neutral element 0 of the group (V, +) in the group topology τ determined by the length function. For all v V and ε > 0, we have v + V,ε = {v + w : W V and w < ε} = {u V : u v < ε}. The last assertion of the lemma follows, since the sets v + V,ε, ε > 0, form a neighborhood base for v in the topology τ. A normed space is a couple (V, ), where V is a linear space and is a norm of V. The norm topology of a normed space (V, ) is the group topology determined by the length function of the group (V, +). We show that, in a finitedimensional linear space, all norms determine the same topology. 8.2 Theorem In a finitedimensional linear space, all norms determine the same topology, and this topology is locally compact. Proof. Let V be a finitedimensional linear space and let {v 1,..., v n } be a basis of V. Denote by π the Euclidean topology of C n. We define a mapping f : C n V by the formula f(c 1,...c n ) = c 1 v 1 + c n v n. The mapping f is a group isomorphism from (C n, +) onto (V, +). We show that for every norm topology τ of V, the mapping f is a homeomorphism (C n,π) (V,τ). The stated result then follows, since the topology π is locally compact. Let be a norm of V and let τ be the topology of V determined by. We show that f is a continuous mapping (C n,π) (V,τ). By Theorem 2.29, it suffices to to show that f is continuous at the point (0,..., 0) C n. Let O be a neighborhood of the point f(0,..., 0) = 0 in the topology τ. Then there exists ε > 0 such that {v V : v < ε} O. Let M = max( v 1,..., v n ). For every (c 1,..., c n ) C, if c c n < ε M, then f(c 1,..., c n ) = c 1 v 1 + +c n v n c 1 v c n v n M ( c c n ) < ε. 71
4 As a consequence, { (c1,..., c n ) C : c c n < ε } f 1 ( {v V : v < ε} ) f 1 (O). M Since the leftmost set above is a neighborhood of the point (0,..., 0) in the topology π, we have shown that f is continuous at the point (0,..., 0). By the foregoing, f is continuous mapping (C n,π) (V,τ). We show that f is an open mapping at the point (0,..., 0) C n. Let ε positive number. The subset K = {(c 1,..., c n ) : c c n = ε} of (C n,π) is compact. It follows, by continuity of the mapping f, that the subset f(k) of the space (V,τ) is compact. Since 0 / f(k), we have v > 0 for every v f(k). By the remark made after Definition 4.10, the function is continuous topology with respect to the topology τ. It follows that the number δ = inf{ w : w f(k)} is positive. For every v = c 1 v c n v n V, if 0 < v < δ, then the following holds for the point ε c c n (c 1,..., c n ) of K: ( ) v < δ f ε c c n (c 1,..., c n ) = ε c c n v. ence we have c c n < ε. From the foregoing it follows that {v V : v < δ} f({(c 1,..., c n ) C n : c c n < ε}). We have shown that f is an open mapping C n at the point (0,..., 0). By Theorem 2.29, f is and open mapping. As a consequence, f is a homeomorphism. We now use the above result to show that linear mappings between finitedimensional vector spaces are automatically continuous. 8.3 Corollary Every linear mapping between finitedimensional normed spaces is continuous with respect to the norm topologies. Proof. Let (V, ) and (W, ) be finitedimensional normed spaces and let L : V W be a linear mapping. We define a function : V R by the formula v = v + Lv. It is easy to see that is a norm of V. Let τ, τ and τ be the topologies determined by the norms, and,respectively. For every v V we have Lv v. As a consequence, L is a continuous mapping (V,τ ) (W,τ ). By Theorem 8.2, we have τ = τ. It follows that L is a continuous mapping (V,τ) (W,τ ). 72
5 In particular, a onetoone onto linear mapping between finitedimensional normed spaces is a homeomorphism. We move on to consider operators. Let V be a normed space with norm. An operator of V is a mapping L : V V, which satisfies the following conditions: 1 L(cu + dv) = clu + dlv for all u, v V and c, d C. 2 sup{ Lu : u V and u 1} <. Condition 1 just requires that L is a linear mapping V V. Linear mappings satisfying Condition 2 are called bounded linear mappings. We see easily that a linear mapping L : V V is bounded if, and only if, L is continuous with respect to the norm topology of V. We use the symbol L(V ) to denote the collection of all operators of the normed space V. The set L(V ) is made into a linear space by defining, for all L, T L(V ) and c C, mappings L + T and cl by the formulas (L + T)v = Lv + Tv and (cl)v = c(lv). It is easy to see that L + T L(V ) and cl L(V ). We define a norm in the linear space L(V ) by setting, for every L L(V ), L = sup{ Lv : v V and v 1}. 8.4 Lemma The function is a norm of L(V ). Proof. We have L 0 for every L L(V ). The zeroelement of L(V ) is the constant mapping 0 : 0(v) = 0 for every v V. Clearly, 0 = 0. If L 0, then there exists u V such that Lu 0. Since L0 = 0, we have u 0. Let v = u u. Then v = 1 and Lv = Lu 0. It follows that L 0. u Let L, T L(V ) and c C. For every v V, we have (L + T)v = Lv + Tv Lv + Tv and (cl)v = c Lu. As a consequence, we have L + T L + T and cl = c L. The function is called the operator norm of L(V ). It is easy to see an operator L L(V ) has norm L = sup{ Lu : u V and u = 1}, and that Lv L v for every v V. Besides addition, we can define another binary operation in the set L(V ). For all L, T L(V ), we denote in the usual way L T the composition of the mappings L and T. We show that is, indeed, an operation in L(V ). 73
6 8.5 Lemma Let V be a normed pace. For all L, T L(V ), we have L T L(V ) and L T L T. Proof. Clearly, a composition of linear mappings is linear. For every v V, we have Lv L v and Tv T v. It folllows that, for every u V, we have (L T)u = L(Tu) L Tu L T u. From this it follows that L T is bounded and its norm satisfies the inequality L T L T. We move on to consider the finitedimensional case. First we note that, by Corollary 8.3, the following result obtains. 8.6 Lemma Let V be a finitedimensional linear space. Then every linear mapping V V is V operator. Up to isomorphism, operator spaces of finitedimensional linear spaces can be characterized as spaces formed by complex matrices. For every n N, denote by M(n) the set of all complex n n matrices. The set M(n) is made into a linear space by defining addition and scalar multiplication by the formulas (a ij ) + (b ij ) = (a ij + b ij ) and c(a ij ) = (ca ij ). Besides addition, we can also define multiplication in M(n). We use the formula (a ij )(b ij ) = ( n k=1 a ikb kj ). The recall the following result from linear algebra. 8.7 Lemma Let V be an n dimensional normed space, 0 < n <. Then there exists a linear onetoone onto mapping ϕ : L(V ) M(n) such that, for all L, T L(V ), we have ϕ(l T) = ϕ(l)ϕ(t). Clearly, the elements (c kl ij ) of M(n), where ckl kl = 1 and ckl ij = 0 for every (i, j) (k, l), form a basis of the linear space M(n). ence it follows from the above lemma that the linear space L(V ) is n 2 dimensional when V is an n dimensional normed space. An operator L of a normed space V is regular, if L is a onetoone mapping from V onto V and the inverse mapping L 1 is an operator of V. The inverse mapping L 1 of a linear onetoone onto mapping L : V V is linear. ence L 1 is an operator of V if, and only if, L 1 is bounded. Denote by L s (V ) the set of all regular operators of V. The topology, which L s (V ) inherits from the operator norm topology of L(V ), is called the norm topology of L s (V ) 74
7 8.8 Theorem Let V be a normed space and let τ be the norm topology of L s (V ). Then the triple (L s (V ),,τ) is a topogroup. Proof. We see easily that the pair (L s (V ), ) is a group. Denote by the norm of V (and that of L(V )). For every L L s (V ), the sets {T L s (V ) : T L < ε}, where ε > 0, form a neighborhood base of L in the topology τ of L s (V ). We use Theorem 1.31 to show that τ is a group topology of the group (L s (V ), ). We show that the translations L T L and L L T are continuous with respect to τ. Let T L s (V ). By Lemma 8.5 we have, for all L, L L s (V ), T L T L = T (L L ) T L L and It follows that if L L < L T L T = (L L ) T L L T. ε T +1, then T L T L < ε and L T L T < ε. By the foregoing, the translations L T L and L l T are continuous. Let I be the neutral element of L s (V ), that is, the identity mapping of V. We show that the mapping (L, T) L T is continuous at the point (I, I) of the product space L s (V ) L s (V ). For all L, T L s (V ), we have L T I = (L I) (T I) + (L I) + (T I) and hence L T I (L I) (T I) + (L I) + (T I). It follows from the foregoing that if 0 < ε < 1 and L I < ε 3 and T I < ε 3, then L T I < ε. As a consequence, the mapping (L, T) L T is continuous at the point (I, I). It remains to show that the mapping L L 1 is continuous at the point I of L s (V ). For every L L s (V ), we have L 1 I = L 1 (I L) = (L 1 I + I) (I L) = (L 1 I) (I L) + (I L) 75
8 and hence, further, L 1 I L 1 I L I + L I. From the foregoing it follows that L 1 I L I 1 L I Therefore, if L I < 1 2 ε < 1 2, then L 1 I < 1 2 ε 1 2 L L 1 is continuous at the point I. whenever L I 1. = ε. It follows that the mapping We have shown that the topology τ satisfies the conditions of Theorem By the theorem, τ is a group topology of the group (L s (V ), ). We now present the promised abstract characterization of general linear topogroups. 8.9 Theorem Let n be a positive integer. Then GL(n) is a topogroup. If V is an n dimensional normed space, then L s (V ) = GL(n). Proof. By Lemma 8.7, there exists linear onetoone mapping ϕ from L(V ) onto M(n) such that, for all T, L L(V ), we have ϕ(t L) = ϕ(t)ϕ(l). Denote by ϕ the restriction of the mapping ϕ to the set L s (V ). Results of linear algebra show that ϕ isomorphism (L s (V ), ) (M(n), ). is a group We show that ϕ is a homeomorphism. We define a function : M(n) R by the formula (a ij ) = max{ a ij : 1 i, j n}. We see easily that is a norm of M(n). Denote by τ the topology of M(n) determined by the normn. Clearly, the topology of GL(n), as defined in the beginning of this chapter, is the same as the relative topology of GL(n) in the space (M(n),τ). Denote by π the operator norm topology of the linear space L(V ). Then the norm topology of L s (V ) is the same as the relative topology of L s (V ) in the space (L(V ),π). By Corollary 8.3, the linear onetoone onto mapping ϕ is a homeomorphism L(V ) M(n), with respect to the topologies π and τ. Since ϕ(l s (V )) = GL(n), the restriction ϕ of ϕ to the set L s (V ) is a homeomorphism L s (V ) GL(n). From this it follows, since ϕ is a group isomorphism and L s (V ) is a topogroup (by Theorem 8.8), that GL(n) is a topogroup and L s (V ) = GL(n). 76
9 Besides L s (V ), we shall consider another subset of the set L(V ) of all operators of a normed space V. Let be the norm of V. A mapping L : V V is a linear isometry of V if L is a linear mapping and we have Lv = v for every v V. Denote by L i (V ) the set of all linear isometries of V. Clearly, L i (V ) L(V ) and L = 1 for every L L i (V ). We show that if V is finitedimensional, then L i (V ) is a subgroup of the group L s (V ). First we recall a result from linear algebra Lemma The following conditions are mutually equivalent when V is a finitedimensional linear space and L is a linear mapping V V : a) L is one to one. b) L is onto Theorem Let V be a finitedimensional normed space. Then the topogroup L s (V ) is locally compact and L i (V ) is a compact subgroup of L s (V ). Proof. We show first that if A is a subset of a finitedimensional normed space (W, ) such that sup a A a <, then the closure A of A in the topology of W determined by the norm is compact. Let M R be such that sup a A a M. Using the triangle inequality satisfied by a norm (Condition 2 ), we see that sup a A a M. By Lemma 8.2, the space W is locally compact. ence 0 has a compact neighborhood K. Let ε > 0 be such that {w W : w ε} K, and let n N satisfy the inequality nε M. The closed subset C = {w W : w ε} of the compact set K is compact. It follows by Theorem 1.27 that the set nc is compact. We see easily that nc = {w W : w nε} and it follows, since nε M, that the set {w W : w M} is compact. Since A {w W : w M}, it follows that A is compact. Next we show that L s (V ) is locally compact. By Theorem 8.2 and the remark made after Theorem 8.7, the norm topology of L(V ) is locally compact. Since L s (V ) is a subspace of L(V ), local compactness of L s (V ) follows once we show that L s (V ) is an open subset of L(V ). Let L L s (V ). Set s = inf{ Lv : v V and v = 1}. Since the mappings v Lv and u u are continuous and the set {v V : v = 1} 77
10 is compact, there exists an element a of V such that a = 1 and La = s. Since L is regular and a 0, we have La 0 and hence s = La > 0. Let ε = 1 2 s and O = {T L(V ) : T L < ε}. Then O η L (L(V )). We show that O L s (V ). Let T O. For every u V, if u = 1, then Tu Lu Tu Lu = Lu (T L)u Lu T L 2ε ε > 0. From the foregoing it follows that T is one to one mapping and from this it follows, by Lemmas 8.10 and 8.6, that T L s (V ). We have shown that O L s (V ). By the foregoing, L s (V ) is an open subset of L(V ). Since every L L i (V ) is one to one mapping, Lemmas 8.10 and 8.6 show that L i (V ) L s (V ). We see easily that, for all L, T L i (V ), we have L 1 L i (V ) and L T L i (V ); hence L i (V ) is a subgroup of the group (L s (V ), ). We show that L i (V ) is a compact subset of L s (V ). Since L s (V ) has the relative topology from L(V ) and since L i (V ) is contained in the compact subset {L L(V ) : L = 1} of L(V ), we see that compactness of L i (V ) follows once we show that L i (V ) is closed in L(V ). Let L n L i (V ) for n = 1, 2,..., and let L L(V ) be such that L n L 0 when n. We show that L L i (V ). Let v V. If v = 0, then Lv = 0 = v. We assume that v 0, and we show that also then the equation Lv = v holds. For every n N, we have 0 L n v Lv L n L v. It follows that L n v Lv 0 when n. Moreover, for every n N, we have Ln v Lv Ln v Lv. It follows from the foregoing that L n v Lv when n. Since {L 1, L 2,...} L i (V ), we have L n v = v for every n = 1, 2,..... As a consequence, Lv = v. We have shown that L L i (V ). We have shown that L i (V ) is closed in L(V ). We now give a new definition for the concept of a representation. By Theorem 8.9, the new definition is, essentially, equivalent with the previous definition Definition Let G be a topogroup. A representation of G is a continuous homomorphism G L s (V ), where V is some finitedimensional normed space. 78
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationCourse 221: Analysis Academic year , First Semester
Course 221: Analysis Academic year 200708, First Semester David R. Wilkins Copyright c David R. Wilkins 1989 2007 Contents 1 Basic Theorems of Real Analysis 1 1.1 The Least Upper Bound Principle................
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationCourse 421: Algebraic Topology Section 1: Topological Spaces
Course 421: Algebraic Topology Section 1: Topological Spaces David R. Wilkins Copyright c David R. Wilkins 1988 2008 Contents 1 Topological Spaces 1 1.1 Continuity and Topological Spaces...............
More information1 Norms and Vector Spaces
008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by MenGen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationDefinition: Group A group is a set G together with a binary operation on G, satisfying the following axioms: a (b c) = (a b) c.
Algebraic Structures Abstract algebra is the study of algebraic structures. Such a structure consists of a set together with one or more binary operations, which are required to satisfy certain axioms.
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus ndimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationRieszFredhölm Theory
RieszFredhölm Theory T. Muthukumar tmk@iitk.ac.in Contents 1 Introduction 1 2 Integral Operators 1 3 Compact Operators 7 4 Fredhölm Alternative 14 Appendices 18 A AscoliArzelá Result 18 B Normed Spaces
More information1 Orthogonal projections and the approximation
Math 1512 Fall 2010 Notes on least squares approximation Given n data points (x 1, y 1 ),..., (x n, y n ), we would like to find the line L, with an equation of the form y = mx + b, which is the best fit
More informationIntroduction to Topology
Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................
More information1 Local Brouwer degree
1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.
More informationSection 6.1  Inner Products and Norms
Section 6.1  Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationChapter 10. Abstract algebra
Chapter 10. Abstract algebra C.O.S. Sorzano Biomedical Engineering December 17, 2013 10. Abstract algebra December 17, 2013 1 / 62 Outline 10 Abstract algebra Sets Relations and functions Partitions and
More informationRi and. i=1. S i N. and. R R i
The subset R of R n is a closed rectangle if there are n nonempty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationMetric Spaces. Chapter 1
Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More information6. Metric spaces. In this section we review the basic facts about metric spaces. d : X X [0, )
6. Metric spaces In this section we review the basic facts about metric spaces. Definitions. A metric on a nonempty set X is a map with the following properties: d : X X [0, ) (i) If x, y X are points
More information{f 1 (U), U F} is an open cover of A. Since A is compact there is a finite subcover of A, {f 1 (U 1 ),...,f 1 (U n )}, {U 1,...
44 CHAPTER 4. CONTINUOUS FUNCTIONS In Calculus we often use arithmetic operations to generate new continuous functions from old ones. In a general metric space we don t have arithmetic, but much of it
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationChapter 1. Metric Spaces. Metric Spaces. Examples. Normed linear spaces
Chapter 1. Metric Spaces Metric Spaces MA222 David Preiss d.preiss@warwick.ac.uk Warwick University, Spring 2008/2009 Definitions. A metric on a set M is a function d : M M R such that for all x, y, z
More information7  Linear Transformations
7  Linear Transformations Mathematics has as its objects of study sets with various structures. These sets include sets of numbers (such as the integers, rationals, reals, and complexes) whose structure
More informationFinite dimensional C algebras
Finite dimensional C algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for selfadjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationTriangle deletion. Ernie Croot. February 3, 2010
Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,
More informationSec 4.1 Vector Spaces and Subspaces
Sec 4. Vector Spaces and Subspaces Motivation Let S be the set of all solutions to the differential equation y + y =. Let T be the set of all 2 3 matrices with real entries. These two sets share many common
More informationPROPERTIES OF SOME NEW SEMINORMED SEQUENCE SPACES DEFINED BY A MODULUS FUNCTION
STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume L, Number 3, September 2005 PROPERTIES OF SOME NEW SEMINORMED SEQUENCE SPACES DEFINED BY A MODULUS FUNCTION YAVUZ ALTIN AYŞEGÜL GÖKHAN HIFSI ALTINOK Abstract.
More information4.6 Null Space, Column Space, Row Space
NULL SPACE, COLUMN SPACE, ROW SPACE Null Space, Column Space, Row Space In applications of linear algebra, subspaces of R n typically arise in one of two situations: ) as the set of solutions of a linear
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More information16.3 Fredholm Operators
Lectures 16 and 17 16.3 Fredholm Operators A nice way to think about compact operators is to show that set of compact operators is the closure of the set of finite rank operator in operator norm. In this
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More information4. Expanding dynamical systems
4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,
More informationLinear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
More informationLecture 18  Clifford Algebras and Spin groups
Lecture 18  Clifford Algebras and Spin groups April 5, 2013 Reference: Lawson and Michelsohn, Spin Geometry. 1 Universal Property If V is a vector space over R or C, let q be any quadratic form, meaning
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationA MIXED TYPE IDENTIFICATION PROBLEM RELATED TO A PHASEFIELD MODEL WITH MEMORY
Guidetti, D. and Lorenzi, A. Osaka J. Math. 44 (27), 579 613 A MIXED TYPE IDENTIFICATION PROBLEM RELATED TO A PHASEFIELD MODEL WITH MEMORY DAVIDE GUIDETTI and ALFREDO LORENZI (Received January 23, 26,
More information4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION
4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:
More information1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 0050615 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationMATH 240 Fall, Chapter 1: Linear Equations and Matrices
MATH 240 Fall, 2007 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 9th Ed. written by Prof. J. Beachy Sections 1.1 1.5, 2.1 2.3, 4.2 4.9, 3.1 3.5, 5.3 5.5, 6.1 6.3, 6.5, 7.1 7.3 DEFINITIONS
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationContinuous firstorder model theory for metric structures Lecture 2 (of 3)
Continuous firstorder model theory for metric structures Lecture 2 (of 3) C. Ward Henson University of Illinois Visiting Scholar at UC Berkeley October 21, 2013 Hausdorff Institute for Mathematics, Bonn
More informationMetric Spaces Joseph Muscat 2003 (Last revised May 2009)
1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of
More informationInfinite product spaces
Chapter 7 Infinite product spaces So far we have talked a lot about infinite sequences of independent random variables but we have never shown how to construct such sequences within the framework of probability/measure
More informationON A GLOBALIZATION PROPERTY
APPLICATIONES MATHEMATICAE 22,1 (1993), pp. 69 73 S. ROLEWICZ (Warszawa) ON A GLOBALIZATION PROPERTY Abstract. Let (X, τ) be a topological space. Let Φ be a class of realvalued functions defined on X.
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More information8.1 Examples, definitions, and basic properties
8 De Rham cohomology Last updated: May 21, 211. 8.1 Examples, definitions, and basic properties A kform ω Ω k (M) is closed if dω =. It is exact if there is a (k 1)form σ Ω k 1 (M) such that dσ = ω.
More informationORIENTATIONS. Contents
ORIENTATIONS Contents 1. Generators for H n R n, R n p 1 1. Generators for H n R n, R n p We ended last time by constructing explicit generators for H n D n, S n 1 by using an explicit nsimplex which
More informationMA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
More informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More informationMEASURE AND INTEGRATION. Dietmar A. Salamon ETH Zürich
MEASURE AND INTEGRATION Dietmar A. Salamon ETH Zürich 12 May 2016 ii Preface This book is based on notes for the lecture course Measure and Integration held at ETH Zürich in the spring semester 2014. Prerequisites
More informationA Note on Di erential Calculus in R n by James Hebda August 2010.
A Note on Di erential Calculus in n by James Hebda August 2010 I. Partial Derivatives o Functions Let : U! be a real valued unction deined in an open neighborhood U o the point a =(a 1,...,a n ) in the
More informationv w is orthogonal to both v and w. the three vectors v, w and v w form a righthanded set of vectors.
3. Cross product Definition 3.1. Let v and w be two vectors in R 3. The cross product of v and w, denoted v w, is the vector defined as follows: the length of v w is the area of the parallelogram with
More informationChapter 6. Linear Transformation. 6.1 Intro. to Linear Transformation
Chapter 6 Linear Transformation 6 Intro to Linear Transformation Homework: Textbook, 6 Ex, 5, 9,, 5,, 7, 9,5, 55, 57, 6(a,b), 6; page 7 In this section, we discuss linear transformations 89 9 CHAPTER
More informationMA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins
MA2C03 Mathematics School of Mathematics, Trinity College Hilary Term 2016 Lecture 59 (April 1, 2016) David R. Wilkins The RSA encryption scheme works as follows. In order to establish the necessary public
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More information(a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.
Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product
More informationThe Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationx pn x qn 0 as n. Every convergent sequence is Cauchy. Not every Cauchy sequence in a normed space E converges to a vector in
78 CHAPTER 3. BANACH SPACES 3.2 Banach Spaces Cauchy Sequence. A sequence of vectors (x n ) in a normed space is a Cauchy sequence if for everyε > 0 there exists M N such that for all n, m M, x m x n
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More informationMathematical Methods of Engineering Analysis
Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More information17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function
17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):
More informationOrthogonal Matrices. u v = u v cos(θ) T (u) + T (v) = T (u + v). It s even easier to. If u and v are nonzero vectors then
Part 2. 1 Part 2. Orthogonal Matrices If u and v are nonzero vectors then u v = u v cos(θ) is 0 if and only if cos(θ) = 0, i.e., θ = 90. Hence, we say that two vectors u and v are perpendicular or orthogonal
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More informationLinear Transformations
a Calculus III Summer 2013, Session II Tuesday, July 23, 2013 Agenda a 1. Linear transformations 2. 3. a linear transformation linear transformations a In the m n linear system Ax = 0, Motivation we can
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationMath 333  Practice Exam 2 with Some Solutions
Math 333  Practice Exam 2 with Some Solutions (Note that the exam will NOT be this long) Definitions (0 points) Let T : V W be a transformation Let A be a square matrix (a) Define T is linear (b) Define
More informationMath 315: Linear Algebra Solutions to Midterm Exam I
Math 35: Linear Algebra s to Midterm Exam I # Consider the following two systems of linear equations (I) ax + by = k cx + dy = l (II) ax + by = 0 cx + dy = 0 (a) Prove: If x = x, y = y and x = x 2, y =
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationAn Advanced Course in Linear Algebra. Jim L. Brown
An Advanced Course in Linear Algebra Jim L. Brown July 20, 2015 Contents 1 Introduction 3 2 Vector spaces 4 2.1 Getting started............................ 4 2.2 Bases and dimension.........................
More informationDefinition 12 An alternating bilinear form on a vector space V is a map B : V V F such that
4 Exterior algebra 4.1 Lines and 2vectors The time has come now to develop some new linear algebra in order to handle the space of lines in a projective space P (V ). In the projective plane we have seen
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More information9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ?
9. Quotient Groups Given a group G and a subgroup H, under what circumstances can we find a homomorphism φ: G G ', such that H is the kernel of φ? Clearly a necessary condition is that H is normal in G.
More informationFunctional analysis and its applications
Department of Mathematics, London School of Economics Functional analysis and its applications Amol Sasane ii Introduction Functional analysis plays an important role in the applied sciences as well as
More informationCompactness in metric spaces
MATHEMATICS 3103 (Functional Analysis) YEAR 2012 2013, TERM 2 HANDOUT #2: COMPACTNESS OF METRIC SPACES Compactness in metric spaces The closed intervals [a, b] of the real line, and more generally the
More informationGeometry 2: Remedial topology
Geometry 2: Remedial topology Rules: You may choose to solve only hard exercises (marked with!, * and **) or ordinary ones (marked with! or unmarked), or both, if you want to have extra problems. To have
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More information0.1 Linear Transformations
.1 Linear Transformations A function is a rule that assigns a value from a set B for each element in a set A. Notation: f : A B If the value b B is assigned to value a A, then write f(a) = b, b is called
More informationAssignment 7; Due Friday, November 11
Assignment 7; Due Friday, November 9.8 a The set Q is not connected because we can write it as a union of two nonempty disjoint open sets, for instance U = (, 2) and V = ( 2, ). The connected subsets are
More informationMATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix.
MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An mbyn matrix is a rectangular array of numbers that has m rows and n columns: a 11
More informationSequences and Convergence in Metric Spaces
Sequences and Convergence in Metric Spaces Definition: A sequence in a set X (a sequence of elements of X) is a function s : N X. We usually denote s(n) by s n, called the nth term of s, and write {s
More informationON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING. 0. Introduction
ON SEQUENTIAL CONTINUITY OF COMPOSITION MAPPING Abstract. In [1] there was proved a theorem concerning the continuity of the composition mapping, and there was announced a theorem on sequential continuity
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
More informationDeterminants, Areas and Volumes
Determinants, Areas and Volumes Theodore Voronov Part 2 Areas and Volumes The area of a twodimensional object such as a region of the plane and the volume of a threedimensional object such as a solid
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More information