DOCSLIB.ORG

Chapter 3 Inner Products and Norms

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Chapter 3 Inner Products and Norms The geometry of Euclidean space relies on the familiar properties of length and angle. The abstract concept of a norm on a vector space formalizes the geometrical notion of the length of a vector. In Euclidean geometry, the angle between two vectors is governed by their dot product, which is itself formalized by the abstract concept of an inner prod- uct. Inner products and norms lie at the heart of analysis, both linear and nonlinear, in both ¯nite-dimensional vector spaces and in¯nite-dimensional function spaces. It is im- possible to overemphasize their importance for both theoretical developments, practical applications, and in the design of numerical solution algorithms. We begin this chapter with a discussion of the basic properties of inner products, illustrated by some of the most important examples. Mathematical analysis is founded on inequalities. The most basic is the Cauchy{ Schwarz inequality, which is valid in any inner product space. The more familiar triangle inequality for the associated norm is then derived as a simple consequence. Not every norm arises from an inner product, and, in more general norms, the triangle inequality becomes part of the de¯nition. Both inequalities retain their validity in both ¯nite-dimensional and in¯nite-dimensional vector spaces. Indeed, their abstract formulation helps us focus on the key ideas in the proof, avoiding all distracting complications resulting from the explicit formulas. In Euclidean space Rn, the characterization of general inner products will lead us to an extremely important class of matrices. Positive de¯nite matrices play a key role in a variety of applications, including minimization problems, least squares, mechanical systems, electrical circuits, and the di®erential equations describing dynamical processes. Later, we will generalize the notion of positive de¯niteness to more general linear operators, governing the ordinary and partial di®erential equations arising in continuum mechanics and dynamics. Positive de¯nite matrices most commonly appear in so-called Gram matrix form, consisting of the inner products between selected elements of an inner product space. The test for positive de¯niteness is based on Gaussian elimination. Indeed, the associated matrix factorization can be reinterpreted as the process of completing the square for the associated quadratic form. So far, we have con¯ned our attention to real vector spaces. Complex numbers, vectors and functions also play an important role in applications, and so, in the ¯nal section, we formally introduce complex vector spaces. Most of the formulation proceeds in direct analogy with the real version, but the notions of inner product and norm on complex vector spaces requires some thought. Applications of complex vector spaces and their inner products are of particular importance in Fourier analysis and signal processing, and absolutely essential in modern quantum mechanics. 2/25/04 88 c 2004 Peter J. Olver ° v v v 3 v2 v 2 v 1 v1 Figure 3.1. The Euclidean Norm in R2 and R3. 3.1. Inner Products. The most basic example of an inner product is the familiar dot product n v ; w = v w = v w + v w + + v w = v w ; (3:1) h i ¢ 1 1 2 2 ¢ ¢ ¢ n n i i i = 1 X T T between (column) vectors v = ( v1; v2; : : : ; vn ) ; w = ( w1; w2; : : : ; wn ) lying in the Eu- clidean space Rn. An important observation is that the dot product (3.1) can be identi¯ed with the matrix product w1 w2 v w = vT w = ( v v : : : v ) 0 . 1 (3:2) ¢ 1 2 n . B C B w C B n C between a row vector vT and a column vector w. @ A The dot product is the cornerstone of Euclidean geometry. The key fact is that the dot product of a vector with itself, v v = v2 + v2 + + v2 ; ¢ 1 2 ¢ ¢ ¢ n is the sum of the squares of its entries, and hence, as a consequence of the classical Pythagorean Theorem, equal to the square of its length; see Figure 3.1. Consequently, the Euclidean norm or length of a vector is found by taking the square root: v = p v v = v2 + v2 + + v2 : (3:3) k k ¢ 1 2 ¢ ¢ ¢ n Note that every nonzero vector v = 0 has ppositive length, v 0, while only the zero vector has length 0 = 0. The dot6 product and Euclideank normk ¸ satisfy certain evident properties, and thesek servk e to inspire the abstract de¯nition of more general inner products. De¯nition 3.1. An inner product on the real vector space V is a pairing that takes two vectors v; w V and produces a real number v ; w R. The inner product is 2 h i 2 required to satisfy the following three axioms for all u; v; w V , and c; d R. 2 2 2/25/04 89 c 2004 Peter J. Olver ° (i) Bilinearity: c u + d v ; w = c u ; w + d v ; w ; h i h i h i (3:4) u ; c v + d w = c u ; v + d u ; w : h i h i h i (ii) Symmetry: v ; w = w ; v : (3:5) h i h i (iii) Positivity: v ; v > 0 whenever v = 0; while 0 ; 0 = 0: (3:6) h i 6 h i A vector space equipped with an inner product is called an inner product space. As we shall see, a given vector space can admit many di®erent inner products. Veri¯cation of the inner product axioms for the Euclidean dot product is straightforward, and left to the reader. Given an inner product, the associated norm of a vector v V is de¯ned as the positive square root of the inner product of the vector with itself: 2 v = v ; v : (3:7) k k h i The positivity axiom implies that v 0pis real and non-negative, and equals 0 if and only if v = 0 is the zero vector. k k ¸ Example 3.2. While certainly the most basic inner product on R2, the dot product v w = v1 w1 + v2 w2 is by no means the only possibility. A simple example is provided by the¢ weighted inner product v w v ; w = 2v w + 5v w ; v = 1 ; w = 1 : (3:8) h i 1 1 2 2 v w µ 2 ¶ µ 2 ¶ Let us verify that this formula does indeed de¯ne an inner product. The symmetry axiom (3.5) is immediate. Moreover, c u + d v ; w = 2(cu + dv )w + 5(cu + dv )w h i 1 1 1 2 2 2 = c(2u w + 5u w ) + d(2v w + 5v w ) = c u ; w + d v ; w ; 1 1 2 2 1 1 2 2 h i h i which veri¯es the ¯rst bilinearity condition; the second follows by a very similar computa- tion. (Or, one can use the symmetry axiom to deduce the second bilinearity identity from the ¯rst; see Exercise .) Moreover, 0 ; 0 = 0, while h i v ; v = 2v2 + 5v2 > 0 whenever v = 0; h i 1 2 6 since at least one of the summands is strictly positive, verifying the positivity requirement (3.6). This serves to establish (3.8) as an legitimate inner product on R2. The associated 2 2 weighted norm v = 2v1 + 5v2 de¯nes an alternative, \non-Pythagorean" notion of length of vectorsk andk distance between points in the plane. p A less evident example of an inner product on R2 is provided by the expression v ; w = v w v w v w + 4v w : (3:9) h i 1 1 ¡ 1 2 ¡ 2 1 2 2 2/25/04 90 c 2004 Peter J. Olver ° Bilinearity is veri¯ed in the same manner as before, and symmetry is obvious. Positivity is ensured by noticing that v ; v = v2 2v v + 4v2 = (v v )2 + 3v2 0; h i 1 ¡ 1 2 2 1 ¡ 2 2 ¸ and is strictly positive for all v = 0. Therefore, (3.9) de¯nes another inner product on R 2, 6 with associated norm v = v2 2v v + 4v2 . k k 1 ¡ 1 2 2 Example 3.3. Let c1; : :p: ; cn be a set of positive numbers. The corresponding weighted inner product and weighted norm on Rn are de¯ned by n n v ; w = c v w ; v = v ; v = c v2 : (3:10) h i i i i k k h i v i i i = 1 u i = 1 X p u X t th The numbers ci > 0 are the weights. The larger the weight ci, the more the i coordinate of v contributes to the norm. Weighted norms are particularly important in statistics and data ¯tting, where one wants to emphasize certain quantities and de-emphasize others; this is done by assigning suitable weights to the di®erent components of the data vector v. Section 4.3 on least squares approximation methods will contain further details. Inner Products on Function Space Inner products and norms on function spaces play an absolutely essential role in mod- ern analysis and its applications, particularly Fourier analysis, boundary value problems, ordinary and partial di®erential equations, and numerical analysis. Let us introduce the most important examples. Example 3.4. Let [a; b] R be a bounded closed interval. Consider the vector space C0[a; b] consisting of all con½tinuous scalar functions f(x) de¯ned for a x b. The integral of the product of two continuous functions · · b f ; g = f(x) g(x) dx (3:11) h i Za de¯nes an inner product on the vector space C0[a; b], as we shall prove below.
Recommended publications
  • 21. Orthonormal Bases

    21. Orthonormal Bases

    21. Orthonormal Bases The canonical/standard basis 011 001 001 B C B C B C B0C B1C B0C e1 = B.C ; e2 = B.C ; : : : ; en = B.C B.C B.C B.C @.A @.A @.A 0 0 1 has many useful properties. • Each of the standard basis vectors has unit length: q p T jjeijj = ei ei = ei ei = 1: • The standard basis vectors are orthogonal (in other words, at right angles or perpendicular). T ei ej = ei ej = 0 when i 6= j This is summarized by ( 1 i = j eT e = δ = ; i j ij 0 i 6= j where δij is the Kronecker delta. Notice that the Kronecker delta gives the entries of the identity matrix. Given column vectors v and w, we have seen that the dot product v w is the same as the matrix multiplication vT w. This is the inner product on n T R . We can also form the outer product vw , which gives a square matrix. 1 The outer product on the standard basis vectors is interesting. Set T Π1 = e1e1 011 B C B0C = B.C 1 0 ::: 0 B.C @.A 0 01 0 ::: 01 B C B0 0 ::: 0C = B. .C B. .C @. .A 0 0 ::: 0 . T Πn = enen 001 B C B0C = B.C 0 0 ::: 1 B.C @.A 1 00 0 ::: 01 B C B0 0 ::: 0C = B. .C B. .C @. .A 0 0 ::: 1 In short, Πi is the diagonal square matrix with a 1 in the ith diagonal position and zeros everywhere else.
  • Quadratic Forms and Automorphic Forms

    Quadratic Forms and Automorphic Forms

    Quadratic Forms and Automorphic Forms Jonathan Hanke May 16, 2011 2 Contents 1 Background on Quadratic Forms 11 1.1 Notation and Conventions . 11 1.2 Definitions of Quadratic Forms . 11 1.3 Equivalence of Quadratic Forms . 13 1.4 Direct Sums and Scaling . 13 1.5 The Geometry of Quadratic Spaces . 14 1.6 Quadratic Forms over Local Fields . 16 1.7 The Geometry of Quadratic Lattices – Dual Lattices . 18 1.8 Quadratic Forms over Local (p-adic) Rings of Integers . 19 1.9 Local-Global Results for Quadratic forms . 20 1.10 The Neighbor Method . 22 1.10.1 Constructing p-neighbors . 22 2 Theta functions 25 2.1 Definitions and convergence . 25 2.2 Symmetries of the theta function . 26 2.3 Modular Forms . 28 2.4 Asymptotic Statements about rQ(m) ...................... 31 2.5 The circle method and Siegel’s Formula . 32 2.6 Mass Formulas . 34 2.7 An Example: The sum of 4 squares . 35 2.7.1 Canonical measures for local densities . 36 2.7.2 Computing β1(m) ............................ 36 2.7.3 Understanding βp(m) by counting . 37 2.7.4 Computing βp(m) for all primes p ................... 38 2.7.5 Computing rQ(m) for certain m ..................... 39 3 Quaternions and Clifford Algebras 41 3.1 Definitions . 41 3.2 The Clifford Algebra . 45 3 4 CONTENTS 3.3 Connecting algebra and geometry in the orthogonal group . 47 3.4 The Spin Group . 49 3.5 Spinor Equivalence . 52 4 The Theta Lifting 55 4.1 Classical to Adelic modular forms for GL2 ..................
  • 171 Composition Operator on the Space of Functions

    171 Composition Operator on the Space of Functions

    Acta Math. Univ. Comenianae 171 Vol. LXXXI, 2 (2012), pp. 171{183 COMPOSITION OPERATOR ON THE SPACE OF FUNCTIONS TRIEBEL-LIZORKIN AND BOUNDED VARIATION TYPE M. MOUSSAI Abstract. For a Borel-measurable function f : R ! R satisfying f(0) = 0 and Z sup t−1 sup jf 0(x + h) − f 0(x)jp dx < +1; (0 < p < +1); t>0 R jh|≤t s n we study the composition operator Tf (g) := f◦g on Triebel-Lizorkin spaces Fp;q(R ) in the case 0 < s < 1 + (1=p). 1. Introduction and the main result The study of the composition operator Tf : g ! f ◦ g associated to a Borel- s n measurable function f : R ! R on Triebel-Lizorkin spaces Fp;q(R ), consists in finding a characterization of the functions f such that s n s n (1.1) Tf (Fp;q(R )) ⊆ Fp;q(R ): The investigation to establish (1.1) was improved by several works, for example the papers of Adams and Frazier [1,2 ], Brezis and Mironescu [6], Maz'ya and Shaposnikova [9], Runst and Sickel [12] and [10]. There were obtained some necessary conditions on f; from which we recall the following results. For s > 0, 1 < p < +1 and 1 ≤ q ≤ +1 n s n s n • if Tf takes L1(R ) \ Fp;q(R ) to Fp;q(R ), then f is locally Lipschitz con- tinuous. n s n • if Tf takes the Schwartz space S(R ) to Fp;q(R ), then f belongs locally to s Fp;q(R). The first assertion is proved in [3, Theorem 3.1].
  • Comparative Programming Languages

    Comparative Programming Languages

    CSc 372 Comparative Programming Languages 10 : Haskell — Curried Functions Department of Computer Science University of Arizona [email protected] Copyright c 2013 Christian Collberg 1/22 Infix Functions Declaring Infix Functions Sometimes it is more natural to use an infix notation for a function application, rather than the normal prefix one: 5+6 (infix) (+) 5 6 (prefix) Haskell predeclares some infix operators in the standard prelude, such as those for arithmetic. For each operator we need to specify its precedence and associativity. The higher precedence of an operator, the stronger it binds (attracts) its arguments: hence: 3 + 5*4 ≡ 3 + (5*4) 3 + 5*4 6≡ (3 + 5) * 4 3/22 Declaring Infix Functions. The associativity of an operator describes how it binds when combined with operators of equal precedence. So, is 5-3+9 ≡ (5-3)+9 = 11 OR 5-3+9 ≡ 5-(3+9) = -7 The answer is that + and - associate to the left, i.e. parentheses are inserted from the left. Some operators are right associative: 5^3^2 ≡ 5^(3^2) Some operators have free (or no) associativity. Combining operators with free associativity is an error: 5==4<3 ⇒ ERROR 4/22 Declaring Infix Functions. The syntax for declaring operators: infixr prec oper -- right assoc. infixl prec oper -- left assoc. infix prec oper -- free assoc. From the standard prelude: infixl 7 * infix 7 /, ‘div‘, ‘rem‘, ‘mod‘ infix 4 ==, /=, <, <=, >=, > An infix function can be used in a prefix function application, by including it in parenthesis. Example: ? (+) 5 ((*) 6 4) 29 5/22 Multi-Argument Functions Multi-Argument Functions Haskell only supports one-argument functions.
  • Glossary of Linear Algebra Terms

    Glossary of Linear Algebra Terms

    INNER PRODUCT SPACES AND THE GRAM-SCHMIDT PROCESS A. HAVENS 1. The Dot Product and Orthogonality 1.1. Review of the Dot Product. We first recall the notion of the dot product, which gives us a familiar example of an inner product structure on the real vector spaces Rn. This product is connected to the Euclidean geometry of Rn, via lengths and angles measured in Rn. Later, we will introduce inner product spaces in general, and use their structure to define general notions of length and angle on other vector spaces. Definition 1.1. The dot product of real n-vectors in the Euclidean vector space Rn is the scalar product · : Rn × Rn ! R given by the rule n n ! n X X X (u; v) = uiei; viei 7! uivi : i=1 i=1 i n Here BS := (e1;:::; en) is the standard basis of R . With respect to our conventions on basis and matrix multiplication, we may also express the dot product as the matrix-vector product 2 3 v1 6 7 t î ó 6 . 7 u v = u1 : : : un 6 . 7 : 4 5 vn It is a good exercise to verify the following proposition. Proposition 1.1. Let u; v; w 2 Rn be any real n-vectors, and s; t 2 R be any scalars. The Euclidean dot product (u; v) 7! u · v satisfies the following properties. (i:) The dot product is symmetric: u · v = v · u. (ii:) The dot product is bilinear: • (su) · v = s(u · v) = u · (sv), • (u + v) · w = u · w + v · w.
  • QUADRATIC FORMS and DEFINITE MATRICES 1.1. Definition of A

    QUADRATIC FORMS and DEFINITE MATRICES 1.1. Definition of A

    QUADRATIC FORMS AND DEFINITE MATRICES 1. DEFINITION AND CLASSIFICATION OF QUADRATIC FORMS 1.1. Definition of a quadratic form. Let A denote an n x n symmetric matrix with real entries and let x denote an n x 1 column vector. Then Q = x’Ax is said to be a quadratic form. Note that a11 ··· a1n . x1 Q = x´Ax =(x1...xn) . xn an1 ··· ann P a1ixi . =(x1,x2, ··· ,xn) . P anixi 2 (1) = a11x1 + a12x1x2 + ... + a1nx1xn 2 + a21x2x1 + a22x2 + ... + a2nx2xn + ... + ... + ... 2 + an1xnx1 + an2xnx2 + ... + annxn = Pi ≤ j aij xi xj For example, consider the matrix 12 A = 21 and the vector x. Q is given by 0 12x1 Q = x Ax =[x1 x2] 21 x2 x1 =[x1 +2x2 2 x1 + x2 ] x2 2 2 = x1 +2x1 x2 +2x1 x2 + x2 2 2 = x1 +4x1 x2 + x2 1.2. Classification of the quadratic form Q = x0Ax: A quadratic form is said to be: a: negative definite: Q<0 when x =06 b: negative semidefinite: Q ≤ 0 for all x and Q =0for some x =06 c: positive definite: Q>0 when x =06 d: positive semidefinite: Q ≥ 0 for all x and Q = 0 for some x =06 e: indefinite: Q>0 for some x and Q<0 for some other x Date: September 14, 2004. 1 2 QUADRATIC FORMS AND DEFINITE MATRICES Consider as an example the 3x3 diagonal matrix D below and a general 3 element vector x. 100 D = 020 004 The general quadratic form is given by 100 x1 0 Q = x Ax =[x1 x2 x3] 020 x2 004 x3 x1 =[x 2 x 4 x ] x2 1 2 3 x3 2 2 2 = x1 +2x2 +4x3 Note that for any real vector x =06 , that Q will be positive, because the square of any number is positive, the coefficients of the squared terms are positive and the sum of positive numbers is always positive.
  • A Some Basic Rules of Tensor Calculus

    A Some Basic Rules of Tensor Calculus

    A Some Basic Rules of Tensor Calculus The tensor calculus is a powerful tool for the description of the fundamentals in con- tinuum mechanics and the derivation of the governing equations for applied prob- lems. In general, there are two possibilities for the representation of the tensors and the tensorial equations: – the direct (symbolic) notation and – the index (component) notation The direct notation operates with scalars, vectors and tensors as physical objects defined in the three dimensional space. A vector (first rank tensor) a is considered as a directed line segment rather than a triple of numbers (coordinates). A second rank tensor A is any finite sum of ordered vector pairs A = a b + ... +c d. The scalars, vectors and tensors are handled as invariant (independent⊗ from the choice⊗ of the coordinate system) objects. This is the reason for the use of the direct notation in the modern literature of mechanics and rheology, e.g. [29, 32, 49, 123, 131, 199, 246, 313, 334] among others. The index notation deals with components or coordinates of vectors and tensors. For a selected basis, e.g. gi, i = 1, 2, 3 one can write a = aig , A = aibj + ... + cidj g g i i ⊗ j Here the Einstein’s summation convention is used: in one expression the twice re- peated indices are summed up from 1 to 3, e.g. 3 3 k k ik ik a gk ∑ a gk, A bk ∑ A bk ≡ k=1 ≡ k=1 In the above examples k is a so-called dummy index. Within the index notation the basic operations with tensors are defined with respect to their coordinates, e.
  • The Dot Product

    The Dot Product

    The Dot Product In this section, we will now concentrate on the vector operation called the dot product. The dot product of two vectors will produce a scalar instead of a vector as in the other operations that we examined in the previous section. The dot product is equal to the sum of the product of the horizontal components and the product of the vertical components. If v = a1 i + b1 j and w = a2 i + b2 j are vectors then their dot product is given by: v · w = a1 a2 + b1 b2 Properties of the Dot Product If u, v, and w are vectors and c is a scalar then: u · v = v · u u · (v + w) = u · v + u · w 0 · v = 0 v · v = || v || 2 (cu) · v = c(u · v) = u · (cv) Example 1: If v = 5i + 2j and w = 3i – 7j then find v · w. Solution: v · w = a1 a2 + b1 b2 v · w = (5)(3) + (2)(-7) v · w = 15 – 14 v · w = 1 Example 2: If u = –i + 3j, v = 7i – 4j and w = 2i + j then find (3u) · (v + w). Solution: Find 3u 3u = 3(–i + 3j) 3u = –3i + 9j Find v + w v + w = (7i – 4j) + (2i + j) v + w = (7 + 2) i + (–4 + 1) j v + w = 9i – 3j Example 2 (Continued): Find the dot product between (3u) and (v + w) (3u) · (v + w) = (–3i + 9j) · (9i – 3j) (3u) · (v + w) = (–3)(9) + (9)(-3) (3u) · (v + w) = –27 – 27 (3u) · (v + w) = –54 An alternate formula for the dot product is available by using the angle between the two vectors.
  • Concept of a Dyad and Dyadic: Consider Two Vectors a and B Dyad: It Consists of a Pair of Vectors a B for Two Vectors a a N D B

    Concept of a Dyad and Dyadic: Consider Two Vectors a and B Dyad: It Consists of a Pair of Vectors a B for Two Vectors a a N D B

    1/11/2010 CHAPTER 1 Introductory Concepts • Elements of Vector Analysis • Newton’s Laws • Units • The basis of Newtonian Mechanics • D’Alembert’s Principle 1 Science of Mechanics: It is concerned with the motion of material bodies. • Bodies have different scales: Microscropic, macroscopic and astronomic scales. In mechanics - mostly macroscopic bodies are considered. • Speed of motion - serves as another important variable - small and high (approaching speed of light). 2 1 1/11/2010 • In Newtonian mechanics - study motion of bodies much bigger than particles at atomic scale, and moving at relative motions (speeds) much smaller than the speed of light. • Two general approaches: – Vectorial dynamics: uses Newton’s laws to write the equations of motion of a system, motion is described in physical coordinates and their derivatives; – Analytical dynamics: uses energy like quantities to define the equations of motion, uses the generalized coordinates to describe motion. 3 1.1 Vector Analysis: • Scalars, vectors, tensors: – Scalar: It is a quantity expressible by a single real number. Examples include: mass, time, temperature, energy, etc. – Vector: It is a quantity which needs both direction and magnitude for complete specification. – Actually (mathematically), it must also have certain transformation properties. 4 2 1/11/2010 These properties are: vector magnitude remains unchanged under rotation of axes. ex: force, moment of a force, velocity, acceleration, etc. – geometrically, vectors are shown or depicted as directed line segments of proper magnitude and direction. 5 e (unit vector) A A = A e – if we use a coordinate system, we define a basis set (iˆ , ˆj , k ˆ ): we can write A = Axi + Ay j + Azk Z or, we can also use the A three components and Y define X T {A}={Ax,Ay,Az} 6 3 1/11/2010 – The three components Ax , Ay , Az can be used as 3-dimensional vector elements to specify the vector.
  • Derivation of the Two-Dimensional Dot Product

    Derivation of the Two-Dimensional Dot Product

    Derivation of the two-dimensional dot product Content 1. Motivation ....................................................................................................................................... 1 2. Derivation of the dot product in R2 ................................................................................................. 1 2.1. Area of a rectangle ...................................................................................................................... 2 2.2. Area of a right-angled triangle .................................................................................................... 2 2.3. Pythagorean Theorem ................................................................................................................. 2 2.4. Area of a general triangle using the law of cosines ..................................................................... 3 2.5. Derivation of the dot product from the law of cosines ............................................................... 5 3. Geometric Interpretation ................................................................................................................ 5 3.1. Basics ........................................................................................................................................... 5 3.2. Projection .................................................................................................................................... 6 4. Summary.........................................................................................................................................
  • Quadratic Form - Wikipedia, the Free Encyclopedia

    Quadratic Form - Wikipedia, the Free Encyclopedia

    Quadratic form - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Quadratic_form Quadratic form From Wikipedia, the free encyclopedia In mathematics, a quadratic form is a homogeneous polynomial of degree two in a number of variables. For example, is a quadratic form in the variables x and y. Quadratic forms occupy a central place in various branches of mathematics, including number theory, linear algebra, group theory (orthogonal group), differential geometry (Riemannian metric), differential topology (intersection forms of four-manifolds), and Lie theory (the Killing form). Contents 1 Introduction 2 History 3 Real quadratic forms 4 Definitions 4.1 Quadratic spaces 4.2 Further definitions 5 Equivalence of forms 6 Geometric meaning 7 Integral quadratic forms 7.1 Historical use 7.2 Universal quadratic forms 8 See also 9 Notes 10 References 11 External links Introduction Quadratic forms are homogeneous quadratic polynomials in n variables. In the cases of one, two, and three variables they are called unary, binary, and ternary and have the following explicit form: where a,…,f are the coefficients.[1] Note that quadratic functions, such as ax2 + bx + c in the one variable case, are not quadratic forms, as they are typically not homogeneous (unless b and c are both 0). The theory of quadratic forms and methods used in their study depend in a large measure on the nature of the 1 of 8 27/03/2013 12:41 Quadratic form - Wikipedia, the free encyclopedia http://en.wikipedia.org/wiki/Quadratic_form coefficients, which may be real or complex numbers, rational numbers, or integers. In linear algebra, analytic geometry, and in the majority of applications of quadratic forms, the coefficients are real or complex numbers.
  • Tropical Arithmetics and Dot Product Representations of Graphs

    Tropical Arithmetics and Dot Product Representations of Graphs

    Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies 5-2015 Tropical Arithmetics and Dot Product Representations of Graphs Nicole Turner Utah State University Follow this and additional works at: https://digitalcommons.usu.edu/etd Part of the Mathematics Commons Recommended Citation Turner, Nicole, "Tropical Arithmetics and Dot Product Representations of Graphs" (2015). All Graduate Theses and Dissertations. 4460. https://digitalcommons.usu.edu/etd/4460 This Thesis is brought to you for free and open access by the Graduate Studies at DigitalCommons@USU. It has been accepted for inclusion in All Graduate Theses and Dissertations by an authorized administrator of DigitalCommons@USU. For more information, please contact [email protected]. TROPICAL ARITHMETICS AND DOT PRODUCT REPRESENTATIONS OF GRAPHS by Nicole Turner A thesis submitted in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE in Mathematics Approved: David E. Brown Brynja Kohler Major Professor Committee Member LeRoy Beasley Mark McLellan Committee Member Vice President for Research Dean of the School of Graduate Studies UTAH STATE UNIVERSITY Logan, Utah 2015 ii Copyright c Nicole Turner 2015 All Rights Reserved iii ABSTRACT Tropical Arithmetics and Dot Product Representations of Graphs by Nicole Turner, Master of Science Utah State University, 2015 Major Professor: Dr. David Brown Department: Mathematics and Statistics A dot product representation (DPR) of a graph is a function that maps each vertex to a vector and two vertices are adjacent if and only if the dot product of their function values is greater than a given threshold. A tropical algebra is the antinegative semiring on IR[f1; −∞} with either minfa; bg replacing a+b and a+b replacing a·b (min-plus), or maxfa; bg replacing a + b and a + b replacing a · b (max-plus), and the symbol 1 is the additive identity in min-plus while −∞ is the additive identity in max-plus; the multiplicative identity is 0 in min-plus and in max-plus.