DOCSLIB.ORG

INNER PRODUCTS and NORMS

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
INNER PRODUCTS and NORMS INNER PRODUCTS and NORMS Professor Dan A. Simovici UMB Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 1 / 46 1 Norms 2 Inequalities 3 Metric Spaces 4 Norms on Rn 5 Norms for Matrices 6 Inner Products Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 2 / 46 Seminorms and Norms A seminorm on an linear space V is a mapping ν : V −→ R that satisfies the following conditions: ν(x + y ) ≤ ν(x )+ ν(y ) (subadditivity), and ν(axx)= |a|ν(x ) (positive homogeneity), for x ,y ∈ V and a ∈ F . Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 3 / 46 Example A seminorm can be defined on every linear space. Indeed, if B is a basis of V , B = {v i | i ∈ I }, J is a finite subset of I , and x = i∈I xiv i , define νJ (x ) as P 0 if x = 0, νJ (x )= ( j∈J |aj | otherwise for x ∈ V . P Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 4 / 46 If V is a real or complex linear space and ν : V −→ R is a seminorm on V , then ν(x − y ) ≥ |ν(x ) − ν(y )|, for x ,y ∈ V . If p : V −→ R is a seminorm on V , then p(x ) ≥ 0 for x ∈ V . Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 5 / 46 A norm on an F -linear space V is a seminorm ν : V −→ R such that ν(x ) = 0 implies x = 0 for x ∈ V . The pair (V ,ν) is referred to as a normed linear space. Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 6 / 46 Example The set of real-valued continuous functions defined on the interval [−1, 1] is a real linear space. The addition of two such functions f , g, is defined by (f + g)(x)= f (x)+ g(x) for x ∈ [−1, 1]; the multiplication of f by a scalar a ∈ R is (af )(x)= af (x) for x ∈ [−1, 1]. Define ν(f ) = sup{|f (x)| | x ∈ [−1, 1]}. Since |f (x)|≤ ν(f ) and |g(x)|≤ ν(g) for x ∈ [−1, 1]}, it follows that |(f + g)(x)| ≤ |f (x)| + |g(x)|≤ ν(f )+ ν(g). Thus, ν(f + g) ≤ ν(f )+ ν(g). Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 7 / 46 Preliminaries R 1 1 Let p, q ∈ − {0, 1} such that p + q = 1. Then p > 1 if and only if q > 1. Furthermore, one of the numbers p, q belongs to the interval (0, 1) if and only if the other number is negative. R 1 1 Let p, q ∈ − {0, 1} be two numbers such that p + q = 1 and p > 1. Then, for every a, b ∈ R≥0, we have ap bq ab ≤ + , p q − 1 where the equality holds if and only if a = b 1−p . Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 8 / 46 The H¨older Inequality Let a1,..., an and b1,..., bn be 2n nonnegative numbers, and let p and q 1 1 be two numbers such that p + q = 1 and p > 1. We have 1 1 n n p n q p q ai bi ≤ ai · bi . i i ! i ! X=1 X=1 X=1 Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 9 / 46 Theorem Let a1,..., an and b1,..., bn be 2n numbers and let p and q be two 1 1 numbers such that p + q = 1 and p > 1. We have 1 1 n n p n q p q ai bi ≤ |ai | · |bi | . ! ! i=1 i=1 i=1 X X X Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 10 / 46 The Cauchy-Schwarz Inequality for Rn Let a1,..., an and b1,..., bn be 2n real numbers. We have n n n 2 2 ai bi ≤ ai · bi . v v i=1 u i=1 u i=1 X uX uX t t Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 11 / 46 Minkowski Inequality Let a1,..., an and b1,..., bn be 2n nonnegative real numbers. If p ≥ 1, we have 1 1 1 n p n p n p p p p (ai + bi ) ≤ ai + bi . i ! i ! i ! X=1 X=1 X=1 Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 12 / 46 Definition 2 A function d : S −→ R≥0 is a metric if it has the following properties: d(x, y)=0 if and only if x = y for x, y ∈ S; d(x, y)= d(y, x) for x, y ∈ S; d(x, y) ≤ d(x, z)+ d(z, y) for x, y, z ∈ S. The pair (S, d) will be referred to as a metric space. If the first property is replaced by the weaker requirement that d(x, x) = 0 for x ∈ S, then we refer to d as a semimetric Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 13 / 46 Example 2 Let S be a nonempty set. Define the mapping d : S −→ R≥0 by 1 if u 6= v, d(u, v)= (0 otherwise, for x, y ∈ S. Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 14 / 46 Example 2 R Consider the mapping d : (Seqn(S)) −→ ≥0 defined by d(p,q)= |{i | 0 ≤ i ≤ n − 1 and p(i) 6= q(i)}| for all sequences p,q of length n on the set S. Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 15 / 46 Example The Euclidean metric is the mapping n d (x ,y )= (x − y )2. 2 v i i u i=1 uX t Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 16 / 46 Spheres Let (S, d) be a metric space. The closed sphere centered in x ∈ S of radius r is the set Bd (x, r)= {y ∈ S|d(x, y) ≤ r}. The open sphere centered in x ∈ S of radius r is the set Cd (x, r)= {y ∈ S|d(x, y) < r}. Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 17 / 46 Definition n For p ≥ 1, the function νp : R −→ R≥0 defined by 1 n p p νp(x1,..., xn)= |xi | , i ! X=1 n n where x = (x1,..., xn) ∈ R , is a norm on R . Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 18 / 46 Examples The following are norms on Rn: n The mapping ν1 : R −→ R given by ν1(x )= |x1| + |x2| + · · · + |xn|, n for x = (x1,..., xn) ∈ R . n ν∞ : R −→ R≥0 given by ν∞(x ) = max{|xi | | 1 ≤ i ≤ n} n for x = (x1,..., xn) ∈ R . k x k2 is the Euclidean norm Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 19 / 46 Any norm generates a metric Each norm ν : V −→ R≥0 on a real linear space V generates a metric on the set V defined by dν(x ,y )= ν(x − y ) for x ,y ∈ V . Note that ν can be expressed using dν as ν(x )= dν(x ,00) for x ∈ V . For p ≥ 1, dp denotes the metric dνp induced by the norm νp on the linear space Rn known as the Minkowski metric. on Rn. Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 20 / 46 Metrics induced by norms p = 2: the Euclidean metric on Rn is n n d (x ,y )= |x − y |2 = (x − y )2. 2 v i i v i i u i=1 u i=1 uX uX t t p = 1: n d1(x ,y )= |xi − yi |. i X=1 This metric is known also as the city-block metric. The norm ν∞ generates the metric d∞ given by d∞(x ,y ) = max{|xi − yi | | 1 ≤ i ≤ n}, also known as the Chebyshev metric. Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 21 / 46 If x = (x0, x1) and y = (y0, y1), then d2(x ,y ) is the length of the hypotenuse of the right triangle and d1(x ,y ) is the sum of the lengths of the two legs of the triangle. 6 y = (y0, y1) x = (x0, x1) (y0, x1) - Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 22 / 46 Projections on Closed Sets Theorem n n Let U be a closed subset of R such that U 6= ∅ and let x 0 ∈ R − U. Then, there exists x 1 ∈ U such that k x − x 0 k2≥k x 1 − x 0 k2 for every x ∈ U. Let p and q be two positive numbers such that p ≤ q. For every n u ∈ R , we have k u kp≥k u kq. Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 23 / 46 Comparisons between norms Let a1,..., an be n positive numbers. If p and q are two positive numbers such that p ≤ q, then 1 1 p p p q q q a1 + · · · + an ≥ a1 + · · · + an . Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 24 / 46 Spheres Bdp (00, 1) for p =1, 2, ∞ 6 6 6 @ @ - '$- - @ @ (a)&% (b) (c) Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 25 / 46 Matrix Vectorization The (m × n)-vectorization mapping is the mapping vec : Cm×n −→ Rmn defined by a11 . . a m1 . vec(A)= . , a n 1 . . amn obtained by reading A column-wise. Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 26 / 46 Example For the matrix In we have e 1 e 2 vec(In)= . . e n Professor Dan A. Simovici (UMB) INNER PRODUCTS and NORMS 27 / 46 Vectorial Norms of Matrices Let ν be a vector norm on the space Rmn.
Load more

Recommended publications
  • Introduction to Linear Bialgebra
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by University of New Mexico University of New Mexico UNM Digital Repository Mathematics and Statistics Faculty and Staff Publications Academic Department Resources 2005 INTRODUCTION TO LINEAR BIALGEBRA Florentin Smarandache University of New Mexico, smarand@unm.edu W.B. Vasantha Kandasamy K. Ilanthenral Follow this and additional works at: https://digitalrepository.unm.edu/math_fsp Part of the Algebra Commons, Analysis Commons, Discrete Mathematics and Combinatorics Commons, and the Other Mathematics Commons Recommended Citation Smarandache, Florentin; W.B. Vasantha Kandasamy; and K. Ilanthenral. "INTRODUCTION TO LINEAR BIALGEBRA." (2005). https://digitalrepository.unm.edu/math_fsp/232 This Book is brought to you for free and open access by the Academic Department Resources at UNM Digital Repository. It has been accepted for inclusion in Mathematics and Statistics Faculty and Staff Publications by an authorized administrator of UNM Digital Repository. For more information, please contact amywinter@unm.edu, lsloane@salud.unm.edu, sarahrk@unm.edu. INTRODUCTION TO LINEAR BIALGEBRA W. B. Vasantha Kandasamy Department of Mathematics Indian Institute of Technology, Madras Chennai – 600036, India e-mail: vasantha@iitm.ac.in web: http://mat.iitm.ac.in/~wbv Florentin Smarandache Department of Mathematics University of New Mexico Gallup, NM 87301, USA e-mail: smarand@gallup.unm.edu K. Ilanthenral Editor, Maths Tiger, Quarterly Journal Flat No.11, Mayura Park, 16, Kazhikundram Main Road, Tharamani, Chennai – 600 113, India e-mail: ilanthenral@gmail.com HEXIS Phoenix, Arizona 2005 1 This book can be ordered in a paper bound reprint from: Books on Demand ProQuest Information & Learning (University of Microfilm International) 300 N.
    [Show full text]
  • Introduction to Clifford's Geometric Algebra
    解説：特集 コンピューテーショナル・インテリジェンスの新展開 —クリフォード代数表現など高次元表現を中心として— Introduction to Clifford’s Geometric Algebra Eckhard HITZER＊ ＊Department of Applied Physics, University of Fukui, Fukui, Japan ＊E-mail: hitzer@mech.u-fukui.ac.jp Key Words：hypercomplex algebra, hypercomplex analysis, geometry, science, engineering. JL 0004/12/5104–0338 C 2012 SICE erty 15), 21) that any isometry4 from the vector space V Abstract into an inner-product algebra5 A over the field6 K can Geometric algebra was initiated by W.K. Clifford over be uniquely extended to an isometry7 from the Clifford 130 years ago. It unifies all branches of physics, and algebra Cl(V )intoA. The Clifford algebra Cl(V )is has found rich applications in robotics, signal process- the unique associative and multilinear algebra with this ing, ray tracing, virtual reality, computer vision, vec- property. Thus if we wish to generalize methods from tor field processing, tracking, geographic information algebra, analysis, calculus, differential geometry (etc.) systems and neural computing. This tutorial explains of real numbers, complex numbers, and quaternion al- the basics of geometric algebra, with concrete exam- gebra to vector spaces and multivector spaces (which ples of the plane, of 3D space, of spacetime, and the include additional elements representing 2D up to nD popular conformal model. Geometric algebras are ideal subspaces, i.e. plane elements up to hypervolume ele- to represent geometric transformations in the general ments), the study of Clifford algebras becomes unavoid- framework of Clifford groups (also called versor or Lip- able. Indeed repeatedly and independently a long list of schitz groups). Geometric (algebra based) calculus al- Clifford algebras, their subalgebras and in Clifford al- lows e.g., to optimize learning algorithms of Clifford gebras embedded algebras (like octonions 17))ofmany neurons, etc.
    [Show full text]
  • A Bit About Hilbert Spaces
    A Bit About Hilbert Spaces David Rosenberg New York University October 29, 2016 David Rosenberg (New York University ) DS-GA 1003 October 29, 2016 1 / 9 Inner Product Space (or “Pre-Hilbert” Spaces) An inner product space (over reals) is a vector space V and an inner product, which is a mapping h·,·i : V × V ! R that has the following properties 8x,y,z 2 V and a,b 2 R: Symmetry: hx,yi = hy,xi Linearity: hax + by,zi = ahx,zi + b hy,zi Postive-definiteness: hx,xi > 0 and hx,xi = 0 () x = 0. David Rosenberg (New York University ) DS-GA 1003 October 29, 2016 2 / 9 Norm from Inner Product For an inner product space, we define a norm as p kxk = hx,xi. Example Rd with standard Euclidean inner product is an inner product space: hx,yi := xT y 8x,y 2 Rd . Norm is p kxk = xT y. David Rosenberg (New York University ) DS-GA 1003 October 29, 2016 3 / 9 What norms can we get from an inner product? Theorem (Parallelogram Law) A norm kvk can be generated by an inner product on V iff 8x,y 2 V 2kxk2 + 2kyk2 = kx + yk2 + kx - yk2, and if it can, the inner product is given by the polarization identity jjxjj2 + jjyjj2 - jjx - yjj2 hx,yi = . 2 Example d `1 norm on R is NOT generated by an inner product. [Exercise] d Is `2 norm on R generated by an inner product? David Rosenberg (New York University ) DS-GA 1003 October 29, 2016 4 / 9 Pythagorean Theroem Definition Two vectors are orthogonal if hx,yi = 0.
    [Show full text]
  • True False Questions from 4,5,6
    (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. Math 217: True False Practice Professor Karen Smith 1. For every 2 × 2 matrix A, there exists a 2 × 2 matrix B such that det(A + B) 6= det A + det B. Solution note: False! Take A to be the zero matrix for a counterexample. 2. If the change of basis matrix SA!B = ~e4 ~e3 ~e2 ~e1 , then the elements of A are the same as the element of B, but in a different order. Solution note: True. The matrix tells us that the first element of A is the fourth element of B, the second element of basis A is the third element of B, the third element of basis A is the second element of B, and the the fourth element of basis A is the first element of B. 6 6 3. Every linear transformation R ! R is an isomorphism. Solution note: False. The zero map is a a counter example. 4. If matrix B is obtained from A by swapping two rows and det A < det B, then A is invertible. Solution note: True: we only need to know det A 6= 0. But if det A = 0, then det B = − det A = 0, so det A < det B does not hold. 5. If two n × n matrices have the same determinant, they are similar. Solution note: False: The only matrix similar to the zero matrix is itself. But many 1 0 matrices besides the zero matrix have determinant zero, such as : 0 0 6.
    [Show full text]
  • The Determinant Inner Product and the Heisenberg Product of Sym(2)
    INTERNATIONAL ELECTRONIC JOURNAL OF GEOMETRY VOLUME 14 NO. 1 PAGE 1–12 (2021) DOI: HTTPS://DOI.ORG/10.32323/IEJGEO.602178 The determinant inner product and the Heisenberg product of Sym(2) Mircea Crasmareanu (Dedicated to the memory of Prof. Dr. Aurel BEJANCU (1946 - 2020)Cihan Ozgur) ABSTRACT The aim of this work is to introduce and study the nondegenerate inner product < ·; · >det induced by the determinant map on the space Sym(2) of symmetric 2 × 2 real matrices. This symmetric bilinear form of index 2 defines a rational symmetric function on the pairs of rays in the plane and an associated function on the 2-torus can be expressed with the usual Hopf bundle projection 3 2 1 S ! S ( 2 ). Also, the product < ·; · >det is treated with complex numbers by using the Hopf invariant map of Sym(2) and this complex approach yields a Heisenberg product on Sym(2). Moreover, the quadratic equation of critical points for a rational Morse function of height type generates a cosymplectic structure on Sym(2) with the unitary matrix as associated Reeb vector and with the Reeb 1-form being half of the trace map. Keywords: symmetric matrix; determinant; Hopf bundle; Hopf invariant AMS Subject Classification (2020): Primary: 15A15 ; Secondary: 15A24; 30C10; 22E47. 1. Introduction This short paper, whose nature is mainly expository, is dedicated to the memory of Professor Dr. Aurel Bejancu, who was equally a gifted mathematician and a dedicated professor. As we hereby present an in memoriam paper, we feel it would be better if we choose an informal presentation rather than a classical structured discourse, where theorems and propositions are followed by their proofs.
    [Show full text]
  • Inner Product Spaces
    CHAPTER 6 Woman teaching geometry, from a fourteenth-century edition of Euclid’s geometry book. Inner Product Spaces In making the definition of a vector space, we generalized the linear structure (addition and scalar multiplication) of R2 and R3. We ignored other important features, such as the notions of length and angle. These ideas are embedded in the concept we now investigate, inner products. Our standing assumptions are as follows: 6.1 Notation F, V F denotes R or C. V denotes a vector space over F. LEARNING OBJECTIVES FOR THIS CHAPTER Cauchy–Schwarz Inequality Gram–Schmidt Procedure linear functionals on inner product spaces calculating minimum distance to a subspace Linear Algebra Done Right, third edition, by Sheldon Axler 164 CHAPTER 6 Inner Product Spaces 6.A Inner Products and Norms Inner Products To motivate the concept of inner prod- 2 3 x1 , x 2 uct, think of vectors in R and R as x arrows with initial point at the origin. x R2 R3 H L The length of a vector in or is called the norm of x, denoted x . 2 k k Thus for x .x1; x2/ R , we have The length of this vector x is p D2 2 2 x x1 x2 . p 2 2 x1 x2 . k k D C 3 C Similarly, if x .x1; x2; x3/ R , p 2D 2 2 2 then x x1 x2 x3 . k k D C C Even though we cannot draw pictures in higher dimensions, the gener- n n alization to R is obvious: we define the norm of x .x1; : : : ; xn/ R D 2 by p 2 2 x x1 xn : k k D C C The norm is not linear on Rn.
    [Show full text]
  • Inner Product Spaces Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (March 2, 2007)
    MAT067 University of California, Davis Winter 2007 Inner Product Spaces Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (March 2, 2007) The abstract definition of vector spaces only takes into account algebraic properties for the addition and scalar multiplication of vectors. For vectors in Rn, for example, we also have geometric intuition which involves the length of vectors or angles between vectors. In this section we discuss inner product spaces, which are vector spaces with an inner product defined on them, which allow us to introduce the notion of length (or norm) of vectors and concepts such as orthogonality. 1 Inner product In this section V is a finite-dimensional, nonzero vector space over F. Definition 1. An inner product on V is a map ·, · : V × V → F (u, v) →u, v with the following properties: 1. Linearity in first slot: u + v, w = u, w + v, w for all u, v, w ∈ V and au, v = au, v; 2. Positivity: v, v≥0 for all v ∈ V ; 3. Positive definiteness: v, v =0ifandonlyifv =0; 4. Conjugate symmetry: u, v = v, u for all u, v ∈ V . Remark 1. Recall that every real number x ∈ R equals its complex conjugate. Hence for real vector spaces the condition about conjugate symmetry becomes symmetry. Definition 2. An inner product space is a vector space over F together with an inner product ·, ·. Copyright c 2007 by the authors. These lecture notes may be reproduced in their entirety for non- commercial purposes. 2NORMS 2 Example 1. V = Fn n u =(u1,...,un),v =(v1,...,vn) ∈ F Then n u, v = uivi.
    [Show full text]
  • 5.2. Inner Product Spaces 1 5.2
    5.2. Inner Product Spaces 1 5.2. Inner Product Spaces Note. In this section, we introduce an inner product on a vector space. This will allow us to bring much of the geometry of Rn into the infinite dimensional setting. Definition 5.2.1. A vector space with complex scalars hV, Ci is an inner product space (also called a Euclidean Space or a Pre-Hilbert Space) if there is a function h·, ·i : V × V → C such that for all u, v, w ∈ V and a ∈ C we have: (a) hv, vi ∈ R and hv, vi ≥ 0 with hv, vi = 0 if and only if v = 0, (b) hu, v + wi = hu, vi + hu, wi, (c) hu, avi = ahu, vi, and (d) hu, vi = hv, ui where the overline represents the operation of complex conju- gation. The function h·, ·i is called an inner product. Note. Notice that properties (b), (c), and (d) of Definition 5.2.1 combine to imply that hu, av + bwi = ahu, vi + bhu, wi and hau + bv, wi = ahu, wi + bhu, wi for all relevant vectors and scalars. That is, h·, ·i is linear in the second positions and “conjugate-linear” in the first position. 5.2. Inner Product Spaces 2 Note. We can also define an inner product on a vector space with real scalars by requiring that h·, ·i : V × V → R and by replacing property (d) in Definition 5.2.1 with the requirement that the inner product is symmetric: hu, vi = hv, ui. Then Rn with the usual dot product is an example of a real inner product space.
    [Show full text]
  • Inner Product Spaces
    Part VI Inner Product Spaces 475 Section 27 The Dot Product in Rn Focus Questions By the end of this section, you should be able to give precise and thorough answers to the questions listed below. You may want to keep these questions in mind to focus your thoughts as you complete the section. What is the dot product of two vectors? Under what conditions is the dot • product defined? How do we find the angle between two nonzero vectors in Rn? • How does the dot product tell us if two vectors are orthogonal? • How do we define the length of a vector in any dimension and how can the • dot product be used to calculate the length? How do we define the distance between two vectors? • What is the orthogonal projection of a vector u in the direction of the vector • v and how do we find it? What is the orthogonal complement of a subspace W of Rn? • Application: Hidden Figures in Computer Graphics In video games, the speed at which a computer can render changing graphics views is vitally im- portant. To increase a computer’s ability to render a scene, programs often try to identify those parts of the images a viewer could see and those parts the viewer could not see. For example, in a scene involving buildings, the viewer could not see any images blocked by a solid building. In the mathematical world, this can be visualized by graphing surfaces. In Figure 27.1 we see a crude image of a house made up of small polygons (this is how programs generally represent surfaces).
    [Show full text]
  • 17. Inner Product Spaces Definition 17.1. Let V Be a Real Vector Space
    17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function h ; i: V × V −! R; which is • symmetric, that is hu; vi = hv; ui: • bilinear, that is linear (in both factors): hλu, vi = λhu; vi; for all scalars λ and hu1 + u2; vi = hu1; vi + hu2; vi; for all vectors u1, u2 and v. • positive that is hv; vi ≥ 0: • non-degenerate that is if hu; vi = 0 for every v 2 V then u = 0. We say that V is a real inner product space. The associated quadratic form is the function Q: V −! R; defined by Q(v) = hv; vi: Example 17.2. Let A 2 Mn;n(R) be a real matrix. We can define a function n n h ; i: R × R −! R; by the rule hu; vi = utAv: The basic rules of matrix multiplication imply that this function is bi- linear. Note that the entries of A are given by t aij = eiAej = hei; eji: In particular, it is symmetric if and only if A is symmetric that is At = A. It is non-degenerate if and only if A is invertible, that is A has rank n. Positivity is a little harder to characterise. Perhaps the canonical example is to take A = In. In this case if t P u = (r1; r2; : : : ; rn) and v = (s1; s2; : : : ; sn) then u Inv = risi. Note 1 P 2 that if we take u = v then we get ri . The square root of this is the Euclidean distance.
    [Show full text]
  • Riesz Representation Theorem on Generalized N-Inner Product Spaces
    Int. Journal of Math. Analysis, Vol. 7, 2013, no. 18, 873 - 882 HIKARI Ltd, www.m-hikari.com Riesz Representation Theorem on Generalized n-Inner Product Spaces Pudji Astuti Faculty of Mathematics and Natural Sciences Institut Teknologi Bandung Jln. Ganesha 10 Bandung 40132, Indonesia pudji@math.itb.ac.id Copyright c 2013 Pudji Astuti. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper we develop a generalization of Riesz representation theorem on generalized n-inner product spaces. We show that any al- ternating n-linear functional on a finitely generated standard general- ized n-inner product space can be represented by a finite number of n-tuples of vectors. The proof of the theorem utilizes an inner product on a quotient tensor product space induced by the generalized n-inner product. Mathematics Subject Classification: 47A07, 46C05, 15A69 Keywords: Riesz representation theorem, inner products, generalized n- inner products, n-linear functional, alternating, tensor products 1 Introduction This paper deals with a generalization of Riesz representation theorem on gen- eralized n-inner product spaces. The concept of generalized n-inner product was introduced by Trenˇcevsky and Malˇceski [8] as a generalization of an n- inner product by Misiak [5]. Following this introduction, a number of results concerning the structure and properties of generalized n-inner product spaces can be found in literature (see [1], [2] and [6]). Gozali etal. [3] exposed a ques- tion whether Riesz type representation theorem holds on standard generalized 874 P.
    [Show full text]
  • An Elementary Construction of the Geometric Algebra
    An elementary construction of the geometric algebra Alan Macdonald Department of Mathematics, Luther College Decorah IA, 52101 U.S.A. macdonal@luther.edu March 30, 2016 Abstract We give a simple, elementary, direct, and motivated construction of the geometric algebra over Rn. Mathematics Subject Classification 2000. Primary 15A66. Keywords: Geometric Algebra, Clifford Algebra. 1. Introduction. We give here a new construction of the geometric al- gebra GA(n) over Rn with the standard inner product. (We then extend to an inner product of arbitrary signature.) A construction of GA(n) proves that a structure satisfying the axioms of GA(n) exists. Simply stating the axioms and proceeding, as is commonly done, is a practical approach. But then there is no guarantee that GA(n) exists, as the axioms might be inconsistent. A mathematically complete presentation must show that GA(n) exists. One can consider the construction given here as the latest step in the well known sequence of constructions of number systems based on the natural num- bers: the integers are equivalence classes of ordered pairs of natural numbers, the rational numbers are equivalence classes of ordered pairs of integers, the real numbers are Dedekind cuts or equivalence classes of Cauchy sequences of rational numbers, and the inner product space Rn consists of n-tuples of real numbers [3]. Each step in the sequence uses only the previously constructed system. (It is a stretch to call Rn a \number system", but it becomes one when the geometric algebra structure is imposed on it. Then we do not need to construct the standard complex numbers or quaternions, as they are embedded in GA(2) and GA(3), respectively.) My goal is to provide a construction of GA(n) suitable for someone with only an elementary knowledge of Rn.
    [Show full text]