DOCSLIB.ORG

Dual Space from Wikipedia, the Free Encyclopedia Contents

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Dual Space from Wikipedia, the Free Encyclopedia Contents Dual space From Wikipedia, the free encyclopedia Contents 1 Defective matrix 1 1.1 Jordan block ............................................. 1 1.2 Example ............................................... 1 1.3 See also ................................................ 2 1.4 Notes ................................................. 2 1.5 References ............................................... 2 2 Definite quadratic form 3 2.1 Associated symmetric bilinear form .................................. 3 2.2 Example ................................................ 3 2.3 See also ................................................ 3 2.4 References ............................................... 4 3 Delta operator 5 3.1 Examples ............................................... 5 3.2 Basic polynomials ........................................... 6 3.3 See also ................................................ 6 3.4 References .............................................. 6 4 Dependence relation 7 4.1 Examples ............................................... 7 4.2 See also ................................................ 7 5 Determinant 8 5.1 Definition ............................................... 8 5.1.1 2 × 2 matrices ......................................... 9 5.1.2 3 × 3 matrices ......................................... 11 5.1.3 n × n matrices ......................................... 11 5.2 Properties of the determinant ..................................... 13 5.2.1 Multiplicativity and matrix groups .............................. 15 5.2.2 Laplace’s formula and the adjugate matrix .......................... 15 5.2.3 Sylvester’s determinant theorem ............................... 15 5.3 Properties of the determinant in relation to other notions ....................... 16 5.3.1 Relation to eigenvalues and trace ............................... 16 i ii CONTENTS 5.3.2 Cramer’s rule ......................................... 18 5.3.3 Block matrices ........................................ 18 5.3.4 Derivative ........................................... 19 5.4 Abstract algebraic aspects ....................................... 20 5.4.1 Determinant of an endomorphism .............................. 20 5.4.2 Exterior algebra ........................................ 20 5.4.3 Square matrices over commutative rings and abstract properties ............... 21 5.5 Generalizations and related notions .................................. 22 5.5.1 Infinite matrices ........................................ 22 5.5.2 Related notions for non-commutative rings .......................... 22 5.5.3 Further variants ........................................ 22 5.6 Calculation ............................................... 22 5.6.1 Decomposition methods ................................... 22 5.6.2 Further methods ....................................... 23 5.7 History ................................................. 23 5.8 Applications .............................................. 24 5.8.1 Linear independence ..................................... 24 5.8.2 Orientation of a basis ..................................... 24 5.8.3 Volume and Jacobian determinant .............................. 25 5.8.4 Vandermonde determinant (alternant) ............................ 25 5.8.5 Circulants ........................................... 26 5.9 See also ................................................ 26 5.10 Notes ................................................. 26 5.11 References ............................................... 28 5.12 External links ............................................. 28 6 Dieudonné determinant 29 6.1 Properties ............................................... 29 6.2 Tannaka–Artin problem ........................................ 29 6.3 See also ................................................ 29 6.4 References ............................................... 30 7 Dimension (vector space) 31 7.1 Examples ............................................... 31 7.2 Facts ................................................. 31 7.3 Generalizations ............................................ 32 7.3.1 Trace ............................................. 32 7.4 See also ................................................ 32 7.5 Notes ................................................. 33 7.6 References .............................................. 33 7.7 External links ............................................. 33 CONTENTS iii 8 Direct sum of modules 34 8.1 Construction for vector spaces and abelian groups .......................... 34 8.1.1 Construction for two vector spaces .............................. 34 8.1.2 Construction for two abelian groups ............................. 35 8.2 Construction for an arbitrary family of modules ........................... 35 8.3 Properties ............................................... 36 8.4 Internal direct sum .......................................... 37 8.5 Universal property .......................................... 37 8.6 Grothendieck group .......................................... 37 8.7 Direct sum of modules with additional structure ........................... 37 8.7.1 Direct sum of algebras .................................... 37 8.7.2 Direct sum of Banach spaces ................................. 38 8.7.3 Direct sum of modules with bilinear forms .......................... 38 8.7.4 Direct sum of Hilbert spaces ................................. 38 8.8 See also ................................................ 39 8.9 References .............................................. 39 9 Direction vector 41 9.1 Parametric equation for a line ..................................... 41 9.2 Generative versus predicate forms ................................... 41 9.3 Predicate form of 2D line equation .................................. 41 9.4 See also ................................................ 42 9.5 External links ............................................. 42 10 Dot product 43 10.1 Definition ............................................... 43 10.1.1 Algebraic definition ...................................... 43 10.1.2 Geometric definition ..................................... 44 10.1.3 Scalar projection and first properties ............................. 44 10.1.4 Equivalence of the definitions ................................. 45 10.2 Properties ............................................... 46 10.2.1 Application to the cosine law ................................. 47 10.3 Triple product expansion ....................................... 47 10.4 Physics ................................................. 48 10.5 Generalizations ............................................ 49 10.5.1 Complex vectors ....................................... 49 10.5.2 Inner product ......................................... 49 10.5.3 Functions ........................................... 49 10.5.4 Weight function ........................................ 50 10.5.5 Dyadics and matrices ..................................... 50 10.5.6 Tensors ............................................ 50 10.6 See also ................................................ 50 iv CONTENTS 10.7 References ............................................... 50 10.8 External links ............................................. 50 11 Dual basis 51 11.1 A categorical and algebraic construction of the dual space ...................... 51 11.2 Existence and uniqueness ....................................... 51 11.3 Introduction .............................................. 52 11.4 Examples ............................................... 52 11.5 See also ................................................ 53 11.6 References ............................................... 53 12 Dual basis in a field extension 54 13 Dual norm 55 13.1 Examples ............................................... 55 13.2 Notes ................................................. 55 13.3 References .............................................. 56 14 Dual number 57 14.1 Linear representation ......................................... 57 14.2 Geometry ............................................... 57 14.2.1 Cycles ............................................. 58 14.3 Algebraic properties .......................................... 58 14.4 Generalization ............................................. 58 14.5 Differentiation ............................................. 58 14.6 Superspace ............................................... 59 14.7 Division ................................................ 59 14.8 Projective line ............................................. 60 14.9 See also ................................................ 60 14.10Notes and references ......................................... 60 14.11Further reading ............................................ 61 15 Dual space 62 15.1 Algebraic dual space ......................................... 62 15.1.1 Finite-dimensional case ................................... 62 15.1.2 Infinite-dimensional case ................................... 63 15.1.3 Bilinear products and dual spaces .............................. 64 15.1.4 Injection into the double-dual ................................ 64 15.1.5 Transpose of a linear map .................................. 65 15.1.6 Quotient spaces and annihilators ............................... 65 15.2 Continuous dual space ........................................ 66 15.2.1 Examples ........................................... 67 15.2.2 Transpose of a continuous linear map ............................ 67 CONTENTS v 15.2.3 Annihilators ........................................
Load more

Recommended publications
  • Hyper-Dual Numbers for Exact Second-Derivative Calculations
    49th AIAA Aerospace Sciences Meeting including the New Horizons Forum and Aerospace Exposition AIAA 2011-886 4 - 7 January 2011, Orlando, Florida The Development of Hyper-Dual Numbers for Exact Second-Derivative Calculations Jeffrey A. Fike∗ andJuanJ.Alonso† Department of Aeronautics and Astronautics Stanford University, Stanford, CA 94305 The complex-step approximation for the calculation of derivative information has two significant advantages: the formulation does not suffer from subtractive cancellation er- rors and it can provide exact derivatives without the need to search for an optimal step size. However, when used for the calculation of second derivatives that may be required for approximation and optimization methods, these advantages vanish. In this work, we develop a novel calculation method that can be used to obtain first (gradient) and sec- ond (Hessian) derivatives and that retains all the advantages of the complex-step method (accuracy and step-size independence). In order to accomplish this task, a new number system which we have named hyper-dual numbers and the corresponding arithmetic have been developed. The properties of this number system are derived and explored, and the formulation for derivative calculations is presented. Hyper-dual number arithmetic can be applied to arbitrarily complex software and allows the derivative calculations to be free from both truncation and subtractive cancellation errors. A numerical implementation on an unstructured, parallel, unsteady Reynolds-Averaged Navier Stokes (URANS) solver,
    [Show full text]
  • Linear Systems and Control: a First Course (Course Notes for AAE 564)
    Linear Systems and Control: A First Course (Course notes for AAE 564) Martin Corless School of Aeronautics & Astronautics Purdue University West Lafayette, Indiana [email protected] August 25, 2008 Contents 1 Introduction 1 1.1 Ingredients..................................... 4 1.2 Somenotation................................... 4 1.3 MATLAB ..................................... 4 2 State space representation of dynamical systems 5 2.1 Linearexamples.................................. 5 2.1.1 Afirstexample .............................. 5 2.1.2 Theunattachedmass........................... 6 2.1.3 Spring-mass-damper ........................... 6 2.1.4 Asimplestructure ............................ 7 2.2 Nonlinearexamples............................... 8 2.2.1 Afirstnonlinearsystem ......................... 8 2.2.2 Planarpendulum ............................. 9 2.2.3 Attitudedynamicsofarigidbody. .. 9 2.2.4 Bodyincentralforcemotion. 10 2.2.5 Ballisticsindrag ............................. 11 2.2.6 Doublependulumoncart . .. .. 12 2.2.7 Two-linkroboticmanipulator . .. 13 2.3 Discrete-timeexamples . ... 14 2.3.1 Thediscreteunattachedmass . 14 2.4 Generalrepresentation . ... 15 2.4.1 Continuous-time ............................. 15 2.4.2 Discrete-time ............................... 18 2.4.3 Exercises.................................. 20 2.5 Vectors....................................... 22 2.5.1 Vector spaces and IRn .......................... 22 2.5.2 IR2 andpictures.............................. 24 2.5.3 Derivatives ...............................
    [Show full text]
  • Linear Algebra: Example Sheet 2 of 4
    Michaelmas Term 2014 SJW Linear Algebra: Example Sheet 2 of 4 1. (Another proof of the row rank column rank equality.) Let A be an m × n matrix of (column) rank r. Show that r is the least integer for which A factorises as A = BC with B 2 Matm;r(F) and C 2 Matr;n(F). Using the fact that (BC)T = CT BT , deduce that the (column) rank of AT equals r. 2. Write down the three types of elementary matrices and find their inverses. Show that an n × n matrix A is invertible if and only if it can be written as a product of elementary matrices. Use this method to find the inverse of 0 1 −1 0 1 @ 0 0 1 A : 0 3 −1 3. Let A and B be n × n matrices over a field F . Show that the 2n × 2n matrix IB IB C = can be transformed into D = −A 0 0 AB by elementary row operations (which you should specify). By considering the determinants of C and D, obtain another proof that det AB = det A det B. 4. (i) Let V be a non-trivial real vector space of finite dimension. Show that there are no endomorphisms α; β of V with αβ − βα = idV . (ii) Let V be the space of infinitely differentiable functions R ! R. Find endomorphisms α; β of V which do satisfy αβ − βα = idV . 5. Find the eigenvalues and give bases for the eigenspaces of the following complex matrices: 0 1 1 0 1 0 1 1 −1 1 0 1 1 −1 1 @ 0 3 −2 A ; @ 0 3 −2 A ; @ −1 3 −1 A : 0 1 0 0 1 0 −1 1 1 The second and third matrices commute; find a basis with respect to which they are both diagonal.
    [Show full text]
  • S-96.510 Advanced Field Theory Course for Graduate Students Lecture Viewgraphs, Fall Term 2004
    S-96.510 Advanced Field Theory Course for graduate students Lecture viewgraphs, fall term 2004 I.V.Lindell Helsinki University of Technology Electromagnetics Laboratory Espoo, Finland I.V.Lindell: Advanced Field Theory, 2004 Helsinki University of Technology 00.01 1 Contents [01] Complex Vectors and Dyadics [02] Dyadic Algebra [03] Basic Electromagnetic Equations [04] Conditions for Fields and Media [05] Duality Transformation [06] Affine Transformation [07] Electromagnetic Field Solutions [08] Singularities and Complex Sources [09] Plane Waves [10] Source Equivalence [11] Huygens’ Principle [12] Field Decompositions Vector Formulas, Dyadic Identites as an appendix I.V.Lindell: Advanced Field Theory, 2004 Helsinki University of Technology 00.02 2 Foreword This lecture material contains all viewgraphs associated with the gradu- ate course S-96.510 Advanced Field Theory given at the Department of Electrical and Communications Engineering, fall 2004. The course is based on Chapters 1–6 of the book Methods for Electromagnetic Field Analysis (Oxford University Press 1992, 2nd edition IEEE Press, 1995, 3rd printing Wiley 2002) by this author. The figures drawn by hand on the blackboard could not be added to the present material. Otaniemi, September 13 2004 I.V. Lindell I.V.Lindell: Advanced Field Theory, 2004 Helsinki University of Technology 00.03 3 I.V.Lindell: Advanced Field Theory, 2004 Helsinki University of Technology 00.04 4 S-96.510 Advanced Field Theory 1. Complex Vectors and Dyadics I.V.Lindell I.V.Lindell: Advanced Field Theory, 2004
    [Show full text]
  • Lecture Notes in Galois Theory
    Lecture Notes in Galois Theory Lectures by Dr Sheng-Chi Liu Throughout these notes, signifies end proof, and N signifies end of example. Table of Contents Table of Contents i Lecture 1 Review of Group Theory 1 1.1 Groups . 1 1.2 Structure of cyclic groups . 2 1.3 Permutation groups . 2 1.4 Finitely generated abelian groups . 3 1.5 Group actions . 3 Lecture 2 Group Actions and Sylow Theorems 5 2.1 p-Groups . 5 2.2 Sylow theorems . 6 Lecture 3 Review of Ring Theory 7 3.1 Rings . 7 3.2 Solutions to algebraic equations . 10 Lecture 4 Field Extensions 12 4.1 Algebraic and transcendental numbers . 12 4.2 Algebraic extensions . 13 Lecture 5 Algebraic Field Extensions 14 5.1 Minimal polynomials . 14 5.2 Composites of fields . 16 5.3 Algebraic closure . 16 Lecture 6 Algebraic Closure 17 6.1 Existence of algebraic closure . 17 Lecture 7 Field Embeddings 19 7.1 Uniqueness of algebraic closure . 19 Lecture 8 Splitting Fields 22 8.1 Lifts are not unique . 22 Notes by Jakob Streipel. Last updated December 6, 2019. i TABLE OF CONTENTS ii Lecture 9 Normal Extensions 23 9.1 Splitting fields and normal extensions . 23 Lecture 10 Separable Extension 26 10.1 Separable degree . 26 Lecture 11 Simple Extensions 26 11.1 Separable extensions . 26 11.2 Simple extensions . 29 Lecture 12 Simple Extensions, continued 30 12.1 Primitive element theorem, continued . 30 Lecture 13 Normal and Separable Closures 30 13.1 Normal closure . 31 13.2 Separable closure . 31 13.3 Finite fields .
    [Show full text]
  • On the Second Dual of the Space of Continuous Functions
    ON THE SECOND DUAL OF THE SPACE OF CONTINUOUS FUNCTIONS BY SAMUEL KAPLAN Introduction. By "the space of continuous functions" we mean the Banach space C of real continuous functions on a compact Hausdorff space X. C, its first dual, and its second dual are not only Banach spaces, but also vector lattices, and this aspect of them plays a central role in our treatment. In §§1-3, we collect the properties of vector lattices which we need in the paper. In §4 we add some properties of the first dual of C—the space of Radon measures on X—denoted by L in the present paper. In §5 we imbed C in its second dual, denoted by M, and then identify the space of all bounded real functions on X with a quotient space of M, in fact with a topological direct summand. Thus each bounded function on X represents an entire class of elements of M. The value of an element/ of M on an element p. of L is denoted as usual by/(p.)- If/lies in C then of course f(u) =p(f) (usually written J fdp), and thus the multiplication between Afand P is an extension of the multiplication between L and C. Now in integration theory, for each pEL, there is a stand- ard "extension" of ffdu to certain of the bounded functions on X (we confine ourselves to bounded functions in this paper), which are consequently called u-integrable. The question arises: how is this "extension" related to the multi- plication between M and L.
    [Show full text]
  • A Nestable Vectorized Templated Dual Number Library for C++11
    cppduals: a nestable vectorized templated dual number library for C++11 Michael Tesch1 1 Department of Chemistry, Technische Universität München, 85747 Garching, Germany DOI: 10.21105/joss.01487 Software • Review Summary • Repository • Archive Mathematical algorithms in the field of optimization often require the simultaneous com- Submitted: 13 May 2019 putation of a function and its derivative. The derivative of many functions can be found Published: 05 November 2019 automatically, a process referred to as automatic differentiation. Dual numbers, close rela- License tives of the complex numbers, are of particular use in automatic differentiation. This library Authors of papers retain provides an extremely fast implementation of dual numbers for C++, duals::dual<>, which, copyright and release the work when replacing scalar types, can be used to automatically calculate a derivative. under a Creative Commons A real function’s value can be made to carry the derivative of the function with respect to Attribution 4.0 International License (CC-BY). a real argument by replacing the real argument with a dual number having a unit dual part. This property is recursive: replacing the real part of a dual number with more dual numbers results in the dual part’s dual part holding the function’s second derivative. The dual<> type in this library allows this nesting (although we note here that it may not be the fastest solution for calculating higher order derivatives.) There are a large number of automatic differentiation libraries and classes for C++: adolc (Walther, 2012), FAD (Aubert & Di Césaré, 2002), autodiff (Leal, 2019), ceres (Agarwal, Mierle, & others, n.d.), AuDi (Izzo, Biscani, Sánchez, Müller, & Heddes, 2019), to name a few, with another 30-some listed at (autodiff.org Bücker & Hovland, 2019).
    [Show full text]
  • MRD Codes: Constructions and Connections
    MRD Codes: Constructions and Connections John Sheekey April 12, 2019 This preprint is of a chapter to appear in Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics, K.-U. Schmidt and A. Winterhof (eds.). The tables on clas- sifications will be periodically updated (in blue) when further results arise. If you have any data that you would like to share, please contact the author. Abstract Rank-metric codes are codes consisting of matrices with entries in a finite field, with the distance between two matrices being the rank of their difference. Codes with maximum size for a fixed minimum distance are called Maximum Rank Distance (MRD) codes. Such codes were constructed and studied independently by Delsarte (1978), Gabidulin (1985), Roth (1991), and Cooperstein (1998). Rank-metric codes have seen renewed interest in recent years due to their applications in random linear network coding. MRD codes also have interesting connections to other topics such as semifields (finite nonassociative division algebras), finite geometry, linearized polynomials, and cryptography. In this chapter we will survey the known constructions and applications of MRD codes, and present some open problems. arXiv:1904.05813v1 [math.CO] 11 Apr 2019 1 Definitions and Preliminaries 1.1 Rank-metric codes Coding theory is the branch of mathematics concerned with the efficient and accurate transfer of information. Error-correcting codes are used when communication is over a channel in which errors may occur. This requires a set equipped with a distance function, and a subset of allowed codewords; if errors are assumed to be small, then a received message is decoded to the nearest valid codeword.
    [Show full text]
  • Bornologically Isomorphic Representations of Tensor Distributions
    Bornologically isomorphic representations of distributions on manifolds E. Nigsch Thursday 15th November, 2018 Abstract Distributional tensor fields can be regarded as multilinear mappings with distributional values or as (classical) tensor fields with distribu- tional coefficients. We show that the corresponding isomorphisms hold also in the bornological setting. 1 Introduction ′ ′ ′r s ′ Let D (M) := Γc(M, Vol(M)) and Ds (M) := Γc(M, Tr(M) ⊗ Vol(M)) be the strong duals of the space of compactly supported sections of the volume s bundle Vol(M) and of its tensor product with the tensor bundle Tr(M) over a manifold; these are the spaces of scalar and tensor distributions on M as defined in [?, ?]. A property of the space of tensor distributions which is fundamental in distributional geometry is given by the C∞(M)-module isomorphisms ′r ∼ s ′ ∼ r ′ Ds (M) = LC∞(M)(Tr (M), D (M)) = Ts (M) ⊗C∞(M) D (M) (1) (cf. [?, Theorem 3.1.12 and Corollary 3.1.15]) where C∞(M) is the space of smooth functions on M. In[?] a space of Colombeau-type nonlinear generalized tensor fields was constructed. This involved handling smooth functions (in the sense of convenient calculus as developed in [?]) in par- arXiv:1105.1642v1 [math.FA] 9 May 2011 ∞ r ′ ticular on the C (M)-module tensor products Ts (M) ⊗C∞(M) D (M) and Γ(E) ⊗C∞(M) Γ(F ), where Γ(E) denotes the space of smooth sections of a vector bundle E over M. In[?], however, only minor attention was paid to questions of topology on these tensor products.
    [Show full text]
  • Scientific Computing: an Introductory Survey
    Eigenvalue Problems Existence, Uniqueness, and Conditioning Computing Eigenvalues and Eigenvectors Scientific Computing: An Introductory Survey Chapter 4 – Eigenvalue Problems Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction permitted for noncommercial, educational use only. Michael T. Heath Scientific Computing 1 / 87 Eigenvalue Problems Existence, Uniqueness, and Conditioning Computing Eigenvalues and Eigenvectors Outline 1 Eigenvalue Problems 2 Existence, Uniqueness, and Conditioning 3 Computing Eigenvalues and Eigenvectors Michael T. Heath Scientific Computing 2 / 87 Eigenvalue Problems Eigenvalue Problems Existence, Uniqueness, and Conditioning Eigenvalues and Eigenvectors Computing Eigenvalues and Eigenvectors Geometric Interpretation Eigenvalue Problems Eigenvalue problems occur in many areas of science and engineering, such as structural analysis Eigenvalues are also important in analyzing numerical methods Theory and algorithms apply to complex matrices as well as real matrices With complex matrices, we use conjugate transpose, AH , instead of usual transpose, AT Michael T. Heath Scientific Computing 3 / 87 Eigenvalue Problems Eigenvalue Problems Existence, Uniqueness, and Conditioning Eigenvalues and Eigenvectors Computing Eigenvalues and Eigenvectors Geometric Interpretation Eigenvalues and Eigenvectors Standard eigenvalue problem : Given n × n matrix A, find scalar λ and nonzero vector x such that A x = λ x λ is eigenvalue, and x is corresponding eigenvector
    [Show full text]
  • Solution: the First Element of the Dual Basis Is the Linear Function Α
    Homework assignment 7 pp. 105 3 Exercise 2. Let B = f®1; ®2; ®3g be the basis for C defined by ®1 = (1; 0; ¡1) ®2 = (1; 1; 1) ®3 = (2; 2; 0): Find the dual basis of B. Solution: ¤ The first element of the dual basis is the linear function ®1 such ¤ ¤ ¤ that ®1(®1) = 1; ®1(®2) = 0 and ®1(®3) = 0. To describe such a function more explicitly we need to find its values on the standard basis vectors e1, e2 and e3. To do this express e1; e2; e3 through ®1; ®2; ®3 (refer to the solution of Exercise 1 pp. 54-55 from Homework 6). For each i = 1; 2; 3 you will find the numbers ai; bi; ci such that e1 = ai®1 + bi®2 + ci®3 (i.e. the coordinates of ei relative to the ¤ ¤ ¤ basis ®1; ®2; ®3). Then by linearity of ®1 we get that ®1(ei) = ai. Then ®2(ei) = bi, ¤ and ®3(ei) = ci. This is the answer. It can also be reformulated as follows. If P is the transition matrix from the standard basis e1; e2; e3 to ®1; ®2; ®3, i.e. ¡1 t (®1; ®2; ®3) = (e1; e2; e3)P , then (P ) is the transition matrix from the dual basis ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¤ ¡1 t e1; e2; e3 to the dual basis ®1; ®2; a3, i.e. (®1; ®2; a3) = (e1; e2; e3)(P ) . Note that this problem is basically the change of coordinates problem: e.g. ¤ 3 the value of ®1 on the vector v 2 C is the first coordinate of v relative to the basis ®1; ®2; ®3.
    [Show full text]
  • A Novel Dual Approach to Nonlinear Semigroups of Lipschitz Operators
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 357, Number 1, Pages 409{424 S 0002-9947(04)03635-9 Article electronically published on August 11, 2004 A NOVEL DUAL APPROACH TO NONLINEAR SEMIGROUPS OF LIPSCHITZ OPERATORS JIGEN PENG AND ZONGBEN XU Abstract. Lipschitzian semigroup refers to a one-parameter semigroup of Lipschitz operators that is strongly continuous in the parameter. It con- tains C0-semigroup, nonlinear semigroup of contractions and uniformly k- Lipschitzian semigroup as special cases. In this paper, through developing a series of Lipschitz dual notions, we establish an analysis approach to Lips- chitzian semigroup. It is mainly proved that a (nonlinear) Lipschitzian semi- group can be isometrically embedded into a certain C0-semigroup. As ap- plication results, two representation formulas of Lipschitzian semigroup are established, and many asymptotic properties of C0-semigroup are generalized to Lipschitzian semigroup. 1. Introduction Let X and Y be Banach spaces over the same coefficient field K (= R or C), and let C ⊂ X and D ⊂ Y be their subsets. A mapping T from C into D is called Lipschitz operator if there exists a real constant M>0 such that (1.1) k Tx− Ty k≤ M k x − y k; 8x; y 2 C; where the constant M is commonly referred to as a Lipschitz constant of T . Clearly, if the mapping T is a constant (that is, there exists a vector y0 2 D such that Tx= y0 for all x 2 C), then T is a Lipschitz operator. Let Lip(C; D) denote the space of Lipschitz operators from C into D,andfor every T 2 Lip(C; D)letL(T ) denote the minimum Lipschitz constant of T , i.e., k Tx− Ty k (1.2) L(T )= sup : x;y2C;x=6 y k x − y k Then, it can be shown that the nonnegative functional L(·)isaseminormof Lip(C; D) and hence (Lip(C; D);L(·)) is a seminormed linear space.
    [Show full text]