DOCSLIB.ORG

Properties of Isometric Mappings

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Properties of Isometric Mappings Journal of Mathematical Analysis and Applications 235, 108᎐121Ž. 1999 Article ID jmaa.1999.6363, available online at http:rrwww.idealibrary.com on Properties of Isometric Mappings Themistocles M. Rassias Department of Mathematics, National Technical Uni¨ersity of Athens, Zografou Campus, 15780 Athens, Greece E-mail: [email protected] Submitted by William F. Ames Received February 9, 1999 DEDICATED TO THE MEMORY OF MOSHE FLATO IN ADMIRATION Some relations between isometry and linearity are examined. In particular, generalizations of the Mazur᎐Ulam theorem and open problems are discussed. ᮊ 1999 Academic Press Key Words: isometric mappings; Mazur᎐Ulam theorem; Banach spaces; strictly convex; topological vector spaces; approximate isometries; conservative distances. 1. INTRODUCTION The main theme of this article is the relation between isometry and linearity, that is, the Mazur᎐Ulam theorem and its generalizations. For a discussion of several other aspects of isometries on Banach spaces see the article by Fleming and Jamisonwx 19 . All vector spaces mentioned in this article are assumed to be real unless otherwise stated. Mazur and Ulam wx31 proved the following resultŽ see also Banachwx 5. THEOREM 1.1. Let U be an isometric transformation from a normed ¨ector space X onto a normed ¨ector space Y with UŽ.0 s 0. Then U is linear. Since continuity is implied by isometry it is only necessary to show that the isometric transformation U is additive, and additivity follows easily providing one can prove that U satisfies the functional equation q x12x 11 U s UxŽ.q Ux Ž.;1.1Ž. ž/2212 2 that is, U maps the midpoint of the line segment joining x12and x onto the midpoint of the line segment joining UxŽ.1212and Ux Ž.for all x and x 108 0022-247Xr99 $30.00 Copyright ᮊ 1999 by Academic Press All rights of reproduction in any form reserved. PROPERTIES OF ISOMETRIC MAPPINGS 109 in X. For the special case where both X and Y are strictly convex the proof ofŽ. 1.1 is immediate. A normed vector space E is called strictly con¨ex ŽClarksonwx 15. if, for each pair u, ¨ of nonzero elements in E such that 555555u q ¨ s u q ¨ , it follows that u s c¨ for some c ) 0. When X is strictly convex the only solution m of the pair of equations 5555y s y 555555y q y s y m x12x m and m x12x m x 21x Ž.1.2 s 11q s s is m 22x12x , with an analogous statement for y1UxŽ. 1and y 2 UxŽ.2 in Y. Thus, for strictly convex spaces the equationsŽ. 1.2 provide a metric characterization of the midpoint of the segment joining x12and x in X as well as that of the segment joining UxŽ.12and Ux Ž.in Y, so the linearity of U is demonstrated. A well-known example of a space which is not strictly convex is R2 with the norm 5Ž.a, b 5 s maxw<<<<a , b x. If we take s s x12Ž.0, 0 and x Ž.2, 0 in Ž. 1.2 , we find that every point on the line segment joining the pointsŽ.Ž. 1, y1 and 1, 1 is a solution of Ž. 1.2 . In order to prove that U is linear Mazur and Ulam needed to find a metric characterization of the midpoint of a pair of points that is valid for all normed spaces. They did this by constructing the following sequence of s sets Hm, m 1, 2, 3, . , where H1 is the set of solutions ofŽ. 1.2 ; thus s g 555555y s y s 1 y H11Ä4x X : x x x x22 x1x2 and s g 55y F 1 ␦ g HmmÄ4x H y1 : x z 2 Ž.Hmy1 for all z Hmy1 , m s 2,3,..., ␦ where Ž.Hmy1 designates the diameter of the set Hmy1. The intersection of these sets Hm is called the metric center of x12and x . Mazur and Ulam 11q proved that it consists of a single point 22x12x . In Section 2 we often deal with metric vector spaces. For these we use the following terminology. A real vector space with a metric dŽ.и, и satisfying duŽ.Ž.q ¨, w q ¨ s du, w for all u, ¨, w, and for which the operations of addition and scalar multiplication are jointly continuous will be called a metric ¨ector space. A complete metric vector space will be called an F-space, following BanachŽwx 5 , p. 35. It is often convenient to introduce the functional 55u s duŽ., 0 and call it the quasi-norm for the space. It clearly has the properties Ž.a 55u s 0 if and only if u s 0, Ž.b 555555u q ¨ F u q ¨ , Ž.1.3 Ž.c 5555y u s u , ␤ ª ␤ 55y ª 5␤ y ␤ 5ª Ž.d mmand u u 0 imply mumu 0 ¨ ␤ ␤ for u, , ummin the space and , real numbers. 110 THEMISTOCLES M. RASSIAS We note that the quasi-norm fails to be a norm since it is not required to be positive homogeneous. With the above definition of an F-space, local convexity is not required. We will use some standard definitions concern- ing topological vector spaces, including those of a semi-norm and a bounded set. A topological vector space is called locally bounded if every neighborhood of the origin contains a bounded open setŽ see Hyersw 22, 23x. 2. GENERALIZATIONS OF THE MAZUR᎐ULAM THEOREM The question of whether the Mazur᎐Ulam theorem holds for all metric vector spaces still seems to be open. The finite dimensional case was dealt with by Charzynskiwx 13 . He proved the theorem for a mapping U: E ª H with UŽ.0 s 0 which is an isometry between metric vector spaces E and H of the same finite dimension n. First he showed that it is sufficient to prove the theorem for the case H s E. Next, by a lengthy proof, he succeeded in defining a semi-norm sŽ.и on E which satisfies the condition sUwŽŽ.y Uz Ž..s sw Žy z .for all w, z in E. In the special case n s 1 the semi-norm is actually a norm, and the linearity of U follows from the Mazur᎐Ulam theorem. The rest of the proof is carried out by means of an induction on n. Rolewiczwx 44, 45 considered the class of metric vector spaces which are locally bounded and whose quasi-norms are conca¨e; that is, for each element u of the space, the function ␸: R ª R defined by ␸Ž.t s 55tu is concave for positive t. When both E and H are F-spaces subject to these two conditons, Rolewicz proved that each surjective isometry U: E ª H satisfying UŽ.0 s 0 is linear. Using both local boundedness and the concav- ity condition he first proved the following: LEMMA 2.1. Let E be a locally bounded F-space whose quasi-norm is ¨ s 555 5F ) conca e, and put mŽ. r supÄ u :2u r4. Then there exists r0 0 such - - - that mŽ. r r for 0 r r0. Rolewicz's proof now proceeds by a method analogous to that of Mazur᎐Ulam, but by first restricting points u and ¨ of E by the condition 55y ¨ - r u q ¨ ¨ u r0 2 in characterizing 22as the metric center of u and and later removing this restriction. A different kind of generalization of the Mazur᎐Ulam theorem was given by Daywx 16, pp. 110, 111 . He adapted their proof to the following situation. Let X and Y be locally convex topological vector spaces and let ª wx T: X Y carry a separating family ps of semi-norms to another such w X x X y s y family pssson Y by the rule pTxŽ.Ž.Ty px y , where T is surjec- tive and TŽ.0 s 0. Then T is linear. PROPERTIES OF ISOMETRIC MAPPINGS 111 In each of the theorems quoted above on the linearity of an isometry Ž.except Charzynski's , the hypothesis of surjectivity of the isometry was required. The necessity of this condition in general is shown by an example. Figielwx 18 cites the following. Let R have the usual absolute value as 2 5 5 s w<<<<x ª 2 norm and let R have the norm Ž.y12, y max y1, y 2, with T: R R given by TxŽ.s Žx, sin x .. Then T is an isometry of R into R2 with TŽ.0 s 0 which is not linear. Other examples are given by Bakerwx 4 , including that of a mapping F: R2 ª R3, where R2 has the Euclidean norm while the norm for R32is 5Ž.x, y, z 5 s maxÄ'x q y 2, <<z 4, such that F is a nonlinear isometry and is homogeneous of degree one. In the same paper Baker proves that if X and Y are normed vector spaces and Y is strictly convex, then every isometry T: X ª Y with TŽ.0 s 0 is linear. This provides another exception to the requirement of surjectivity in addition to Charzynski's theoremŽ see also Theorem 12, p. 145, of Aczel and Dhom- breswx 1. Wobstwx 50 generalized Charzynski's theorem as follows. THEOREM 2.2. Let E and F be metric ¨ector spaces with E finite dimen- sional. Let T: E ª F be a surjecti¨e isometry with TŽ.0 s 0. Then T is a linear mapping. He also proved that every isometry of a locally compact connected metric group with translation invariant metric into itself is surjective.
Load more

Recommended publications
  • Functional Analysis Lecture Notes Chapter 3. Banach
    FUNCTIONAL ANALYSIS LECTURE NOTES CHAPTER 3. BANACH SPACES CHRISTOPHER HEIL 1. Elementary Properties and Examples Notation 1.1. Throughout, F will denote either the real line R or the complex plane C. All vector spaces are assumed to be over the field F. Definition 1.2. Let X be a vector space over the field F. Then a semi-norm on X is a function k · k: X ! R such that (a) kxk ≥ 0 for all x 2 X, (b) kαxk = jαj kxk for all x 2 X and α 2 F, (c) Triangle Inequality: kx + yk ≤ kxk + kyk for all x, y 2 X. A norm on X is a semi-norm which also satisfies: (d) kxk = 0 =) x = 0. A vector space X together with a norm k · k is called a normed linear space, a normed vector space, or simply a normed space. Definition 1.3. Let I be a finite or countable index set (for example, I = f1; : : : ; Ng if finite, or I = N or Z if infinite). Let w : I ! [0; 1). Given a sequence of scalars x = (xi)i2I , set 1=p jx jp w(i)p ; 0 < p < 1; 8 i kxkp;w = > Xi2I <> sup jxij w(i); p = 1; i2I > where these quantities could be infinite.:> Then we set p `w(I) = x = (xi)i2I : kxkp < 1 : n o p p p We call `w(I) a weighted ` space, and often denote it just by `w (especially if I = N). If p p w(i) = 1 for all i, then we simply call this space ` (I) or ` and write k · kp instead of k · kp;w.
    [Show full text]
  • Elements of Linear Algebra, Topology, and Calculus
    00˙AMS September 23, 2007 © Copyright, Princeton University Press. No part of this book may be distributed, posted, or reproduced in any form by digital or mechanical means without prior written permission of the publisher. Appendix A Elements of Linear Algebra, Topology, and Calculus A.1 LINEAR ALGEBRA We follow the usual conventions of matrix computations. Rn×p is the set of all n p real matrices (m rows and p columns). Rn is the set Rn×1 of column vectors× with n real entries. A(i, j) denotes the i, j entry (ith row, jth column) of the matrix A. Given A Rm×n and B Rn×p, the matrix product Rm×p ∈ n ∈ AB is defined by (AB)(i, j) = k=1 A(i, k)B(k, j), i = 1, . , m, j = 1∈, . , p. AT is the transpose of the matrix A:(AT )(i, j) = A(j, i). The entries A(i, i) form the diagonal of A. A Pmatrix is square if is has the same number of rows and columns. When A and B are square matrices of the same dimension, [A, B] = AB BA is termed the commutator of A and B. A matrix A is symmetric if −AT = A and skew-symmetric if AT = A. The commutator of two symmetric matrices or two skew-symmetric matrices− is symmetric, and the commutator of a symmetric and a skew-symmetric matrix is skew-symmetric. The trace of A is the sum of the diagonal elements of A, min(n,p ) tr(A) = A(i, i). i=1 X We have the following properties (assuming that A and B have adequate dimensions) tr(A) = tr(AT ), (A.1a) tr(AB) = tr(BA), (A.1b) tr([A, B]) = 0, (A.1c) tr(B) = 0 if BT = B, (A.1d) − tr(AB) = 0 if AT = A and BT = B.
    [Show full text]
  • On Isometries on Some Banach Spaces: Part I
    Introduction Isometries on some important Banach spaces Hermitian projections Generalized bicircular projections Generalized n-circular projections On isometries on some Banach spaces { something old, something new, something borrowed, something blue, Part I Dijana Iliˇsevi´c University of Zagreb, Croatia Recent Trends in Operator Theory and Applications Memphis, TN, USA, May 3{5, 2018 Recent work of D.I. has been fully supported by the Croatian Science Foundation under the project IP-2016-06-1046. Dijana Iliˇsevi´c On isometries on some Banach spaces Introduction Isometries on some important Banach spaces Hermitian projections Generalized bicircular projections Generalized n-circular projections Something old, something new, something borrowed, something blue is referred to the collection of items that helps to guarantee fertility and prosperity. Dijana Iliˇsevi´c On isometries on some Banach spaces Introduction Isometries on some important Banach spaces Hermitian projections Generalized bicircular projections Generalized n-circular projections Isometries Isometries are maps between metric spaces which preserve distance between elements. Definition Let (X ; j · j) and (Y; k · k) be two normed spaces over the same field. A linear map ': X!Y is called a linear isometry if k'(x)k = jxj; x 2 X : We shall be interested in surjective linear isometries on Banach spaces. One of the main problems is to give explicit description of isometries on a particular space. Dijana Iliˇsevi´c On isometries on some Banach spaces Introduction Isometries on some important Banach spaces Hermitian projections Generalized bicircular projections Generalized n-circular projections Isometries Isometries are maps between metric spaces which preserve distance between elements. Definition Let (X ; j · j) and (Y; k · k) be two normed spaces over the same field.
    [Show full text]
  • Computing the Complexity of the Relation of Isometry Between Separable Banach Spaces
    Computing the complexity of the relation of isometry between separable Banach spaces Julien Melleray Abstract We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation is Borel bireducible to the universal relation for Borel actions of Polish groups. 1 Introduction Over the past fteen years or so, the theory of complexity of Borel equivalence relations has been a very active eld of research; in this paper, we compute the complexity of a relation of geometric nature, the relation of (linear) isom- etry between separable Banach spaces. Before stating precisely our result, we begin by quickly recalling the basic facts and denitions that we need in the following of the article; we refer the reader to [3] for a thorough introduction to the concepts and methods of descriptive set theory. Before going on with the proof and denitions, it is worth pointing out that this article mostly consists in putting together various results which were already known, and deduce from them after an easy manipulation the complexity of the relation of isometry between separable Banach spaces. Since this problem has been open for a rather long time, it still seems worth it to explain how this can be done, and give pointers to the literature. Still, it seems to the author that this will be mostly of interest to people with a knowledge of descriptive set theory, so below we don't recall descriptive set-theoretic notions but explain quickly what Lipschitz-free Banach spaces are and how that theory works.
    [Show full text]
  • PROBLEM SHEET-I IST, Functional Analysis, Bhaskaracharya Pratishthana, Pune (Oct.23-Nov.4, 2017)
    PROBLEM SHEET-I IST, Functional Analysis, Bhaskaracharya Pratishthana, Pune (Oct.23-Nov.4, 2017) 1. Given a finite family of Banach spaces , show that the product {푋푖; 1 ≤ 푖 ≤ } 푛 푋 = ∏ 푋푖 = {푥 = 푥푖푖=1; 푥푖 ∈ 푋푖,1 ≤ 푖 ≤ } is a Banach space when푖 =equipped 1 with the norm: 푛 푛 ‖푥‖ = ∑‖푥푖‖ , 푥 = 푥푖푖=1 ∈ 푋. 2. Show that a normed space X is complete푖=1 if and only if absolutely convergent series in X are convergent. 3. Compute in C[0, 1] where ‖ + ‖ 4. Show that it is possible that two푥 = metrics 푠푖휋푥, on 푥a set= 푐푠휋푥.are equivalent whereas one of them is complete and that the other is incomplete. 5. Show that the closure of a subspace/convex subset of a normed space is a subspace/convex subset. How about the convex hull of a closed set? 6. Prove that a linear functional on a normed space is continuous if and only Kerf is a closed subspace of X. 7. For show that 1 ≤ < < ∞, ℓ ⊊ ℓ . PROBLEM SHEET-II IST, Functional Analysis, Bhaskaracharya Pratishthana, Pune (Oct.23-Nov.4, 2017) 1. Give an example of a discontinuous linear map between Banach spaces. 2. Prove that two equivalent norms are complete or incomplete together. 3. Show that a normed space is finite dimensional if all norms on it are equivalent. 4. Given that a normed space X admits a finite total subset of X*, can you say that it is finite dimensional? 5. What can you say about a normed space if it is topologically homeomorphic to a a finite dimensional normed space.
    [Show full text]
  • Isometries and the Plane
    Chapter 1 Isometries of the Plane \For geometry, you know, is the gate of science, and the gate is so low and small that one can only enter it as a little child. (W. K. Clifford) The focus of this first chapter is the 2-dimensional real plane R2, in which a point P can be described by its coordinates: 2 P 2 R ;P = (x; y); x 2 R; y 2 R: Alternatively, we can describe P as a complex number by writing P = (x; y) = x + iy 2 C: 2 The plane R comes with a usual distance. If P1 = (x1; y1);P2 = (x2; y2) 2 R2 are two points in the plane, then p 2 2 d(P1;P2) = (x2 − x1) + (y2 − y1) : Note that this is consistent withp the complex notation. For P = x + iy 2 C, p 2 2 recall that jP j = x + y = P P , thus for two complex points P1 = x1 + iy1;P2 = x2 + iy2 2 C, we have q d(P1;P2) = jP2 − P1j = (P2 − P1)(P2 − P1) p 2 2 = j(x2 − x1) + i(y2 − y1)j = (x2 − x1) + (y2 − y1) ; where ( ) denotes the complex conjugation, i.e. x + iy = x − iy. We are now interested in planar transformations (that is, maps from R2 to R2) that preserve distances. 1 2 CHAPTER 1. ISOMETRIES OF THE PLANE Points in the Plane • A point P in the plane is a pair of real numbers P=(x,y). d(0,P)2 = x2+y2. • A point P=(x,y) in the plane can be seen as a complex number x+iy.
    [Show full text]
  • Isometry and Automorphisms of Constant Dimension Codes
    Isometry and Automorphisms of Constant Dimension Codes Isometry and Automorphisms of Constant Dimension Codes Anna-Lena Trautmann Institute of Mathematics University of Zurich \Crypto and Coding" Z¨urich, March 12th 2012 1 / 25 Isometry and Automorphisms of Constant Dimension Codes Introduction 1 Introduction 2 Isometry of Random Network Codes 3 Isometry and Automorphisms of Known Code Constructions Spread codes Lifted rank-metric codes Orbit codes 2 / 25 isometry classes are equivalence classes automorphism groups of linear codes are useful for decoding automorphism groups are canonical representative of orbit codes Isometry and Automorphisms of Constant Dimension Codes Introduction Motivation constant dimension codes are used for random network coding 3 / 25 automorphism groups of linear codes are useful for decoding automorphism groups are canonical representative of orbit codes Isometry and Automorphisms of Constant Dimension Codes Introduction Motivation constant dimension codes are used for random network coding isometry classes are equivalence classes 3 / 25 automorphism groups are canonical representative of orbit codes Isometry and Automorphisms of Constant Dimension Codes Introduction Motivation constant dimension codes are used for random network coding isometry classes are equivalence classes automorphism groups of linear codes are useful for decoding 3 / 25 Isometry and Automorphisms of Constant Dimension Codes Introduction Motivation constant dimension codes are used for random network coding isometry classes are equivalence classes automorphism groups of linear codes are useful for decoding automorphism groups are canonical representative of orbit codes 3 / 25 Definition Subspace metric: dS(U; V) = dim(U + V) − dim(U\V) Injection metric: dI (U; V) = max(dim U; dim V) − dim(U\V) Isometry and Automorphisms of Constant Dimension Codes Introduction Random Network Codes Definition n n The projective geometry P(Fq ) is the set of all subspaces of Fq .
    [Show full text]
  • Linear Spaces
    Chapter 2 Linear Spaces Contents FieldofScalars ........................................ ............. 2.2 VectorSpaces ........................................ .............. 2.3 Subspaces .......................................... .............. 2.5 Sumofsubsets........................................ .............. 2.5 Linearcombinations..................................... .............. 2.6 Linearindependence................................... ................ 2.7 BasisandDimension ..................................... ............. 2.7 Convexity ............................................ ............ 2.8 Normedlinearspaces ................................... ............... 2.9 The `p and Lp spaces ............................................. 2.10 Topologicalconcepts ................................... ............... 2.12 Opensets ............................................ ............ 2.13 Closedsets........................................... ............. 2.14 Boundedsets......................................... .............. 2.15 Convergence of sequences . ................... 2.16 Series .............................................. ............ 2.17 Cauchysequences .................................... ................ 2.18 Banachspaces....................................... ............... 2.19 Completesubsets ....................................... ............. 2.19 Transformations ...................................... ............... 2.21 Lineartransformations.................................. ................ 2.21
    [Show full text]
  • Introduction to Functional Analysis Part III, Autumn 2004
    Introduction to Functional Analysis Part III, Autumn 2004 T. W. KÄorner October 21, 2004 Small print This is just a ¯rst draft for the course. The content of the course will be what I say, not what these notes say. Experience shows that skeleton notes (at least when I write them) are very error prone so use these notes with care. I should very much appreciate being told of any corrections or possible improvements and might even part with a small reward to the ¯rst ¯nder of particular errors. Contents 1 Some notes on prerequisites 2 2 Baire category 4 3 Non-existence of functions of several variables 5 4 The principle of uniform boundedness 7 5 Zorn's lemma and Tychonov's theorem 11 6 The Hahn-Banach theorem 15 7 Banach algebras 17 8 Maximal ideals 21 9 Analytic functions 21 10 Maximal ideals 23 11 The Gelfand representation 24 1 12 Finding the Gelfand representation 26 13 Three more uses of Hahn-Banach 29 14 The Rivlin-Shapiro formula 31 1 Some notes on prerequisites Many years ago it was more or less clear what could and what could not be assumed in an introductory functional analysis course. Since then, however, many of the concepts have drifted into courses at lower levels. I shall therefore assume that you know what is a normed space, and what is a a linear map and that you can do the following exercise. Exercise 1. Let (X; k kX ) and (Y; k kY ) be normed spaces. (i) If T : X ! Y is linear, then T is continuous if and only if there exists a constant K such that kT xkY · KkxkX for all x 2 X.
    [Show full text]
  • Basic Differentiable Calculus Review
    Basic Differentiable Calculus Review Jimmie Lawson Department of Mathematics Louisiana State University Spring, 2003 1 Introduction Basic facts about the multivariable differentiable calculus are needed as back- ground for differentiable geometry and its applications. The purpose of these notes is to recall some of these facts. We state the results in the general context of Banach spaces, although we are specifically concerned with the finite-dimensional setting, specifically that of Rn. Let U be an open set of Rn. A function f : U ! R is said to be a Cr map for 0 ≤ r ≤ 1 if all partial derivatives up through order r exist for all points of U and are continuous. In the extreme cases C0 means that f is continuous and C1 means that all partials of all orders exists and are continuous on m r r U. A function f : U ! R is a C map if fi := πif is C for i = 1; : : : ; m, m th where πi : R ! R is the i projection map defined by πi(x1; : : : ; xm) = xi. It is a standard result that mixed partials of degree less than or equal to r and of the same type up to interchanges of order are equal for a C r-function (sometimes called Clairaut's Theorem). We can consider a category with objects nonempty open subsets of Rn for various n and morphisms Cr-maps. This is indeed a category, since the composition of Cr maps is again a Cr map. 1 2 Normed Spaces and Bounded Linear Oper- ators At the heart of the differential calculus is the notion of a differentiable func- tion.
    [Show full text]
  • Isometry Test for Coordinate Transformations Sudesh Kumar Arora
    Isometry test for coordinate transformations Sudesh Kumar Arora Isometry test for coordinate transformations Sudesh Kumar Arora∗y Date January 30, 2020 Abstract A simple scheme is developed to test whether a given coordinate transformation of the metric tensor is an isometry or not. The test can also be used to predict the time dilation caused by any type of motion for a given space-time metric. Keywords and phrases: general relativity; coordinate transformation; diffeomorphism; isometry; symmetries. 1 Introduction Isometry is any coordinate transformation which preserves the distances. In special relativity, Minkowski metric has Poincare as the group of isometries, and the corresponding coordinate transformations leave the physical properties of the metric like distance invariant. In general relativity any infinitesimal trans- formation along Killing vector fields is an isometry. These are infinitesimal transformations generated by one parameter x0µ = xµ + V µ (1) Here V (x) = V µ@µ can be thought of like a vector field with components given as dx0µ V µ(x) = (x) (2) d All coordinate transformations generated such can be checked for isometry by calculating Lie deriva- tive of the metric tensors along the vector field V . If the Lie derivative vanishes then the transformation is an isometry (1; 2) and vector field V is called Killing Vector field. Killing vector fields are used to study the symmetries of the space-time metrics and the associated conserved quantities. But there are some challenges in using Killing equations for checking isometry. Coordinate transformations which are either discrete (not generated by the one-parameter ) or not possible to define as integral curves of a vectors field cannot be checked for isometry using this scheme.
    [Show full text]
  • Embedding Banach Spaces
    Embedding Banach spaces. Daniel Freeman with Edward Odell, Thomas Schlumprecht, Richard Haydon, and Andras Zsak January 24, 2009 Daniel Freeman with Edward Odell, Thomas Schlumprecht, Richard Haydon, andEmbedding Andras Zsak Banach spaces. Definition (Banach space) A normed vector space (X ; k · k) is called a Banach space if X is complete in the norm topology. Definition (Schauder basis) 1 A sequence (xi )i=1 ⊂ X is called a basis for X if for every x 2 X there exists a 1 P1 unique sequence of scalars (ai )i=1 such that x = i=1 ai xi . Question (Mazur '36) Does every separable Banach space have a basis? Theorem (Enflo '72) No. Background Daniel Freeman with Edward Odell, Thomas Schlumprecht, Richard Haydon, andEmbedding Andras Zsak Banach spaces. Definition (Schauder basis) 1 A sequence (xi )i=1 ⊂ X is called a basis for X if for every x 2 X there exists a 1 P1 unique sequence of scalars (ai )i=1 such that x = i=1 ai xi . Question (Mazur '36) Does every separable Banach space have a basis? Theorem (Enflo '72) No. Background Definition (Banach space) A normed vector space (X ; k · k) is called a Banach space if X is complete in the norm topology. Daniel Freeman with Edward Odell, Thomas Schlumprecht, Richard Haydon, andEmbedding Andras Zsak Banach spaces. Question (Mazur '36) Does every separable Banach space have a basis? Theorem (Enflo '72) No. Background Definition (Banach space) A normed vector space (X ; k · k) is called a Banach space if X is complete in the norm topology. Definition (Schauder basis) 1 A sequence (xi )i=1 ⊂ X is called a basis for X if for every x 2 X there exists a 1 P1 unique sequence of scalars (ai )i=1 such that x = i=1 ai xi .
    [Show full text]