DOCSLIB.ORG

Matrix Theory Over the Complex Quaternion Algebra

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Matrix Theory Over the Complex Quaternion Algebra Matrix Theory over the Complex Quaternion Algebra Yongge Tian Department of Mathematics and Statistics Queen’s University Kingston, Ontario, Canada K7L 3N6 email:[email protected] Abstract. We present in this paper some fundamental tools for developing matrix analysis over the complex quaternion algebra. As applications, we consider generalized inverses, eigenvalues and eigenvec- tors, similarity, determinants of complex quaternion matrices, and so on. AMS Mathematics Subject Classification: 15A06; 15A24; 15A33 Key words: complex quaternion; matrix representation; universal similarity factorization; generalized inverse; eigenvalues and eigenvectors; determinant. 1. Introduction The complex quaternion algebra (biquaternion algebra) Q is well known as a four dimensional vector space over the complex number field C with its basis 1, e1, e2, e3 satisfying the multipli- cation laws 2 2 2 e1 = e2 = e3 = −1, e1e2e3 = −1. (1.1) e1e2 = −e2e1 = e3, e2e3 = −e3e2 = e1, e3e1 = −e3e3 = e2, (1.2) and 1 acting as unity element. In that case, any element in Q can be written as a = a0 + a1e1 + a2e2 + a3e3, (1.3) arXiv:math/0004005v1 [math.RA] 1 Apr 2000 where a0—a3 ∈ C. According to this definition, real numbers, complex numbers, and real quaternions all can be regarded as the special cases of complex quaternions. A well-known fun- damental fact on the complex quaternion algebra Q (see, e. g., [4, 6, 7]) is that it is algebraically isomorphic to the 2 × 2 total matrix algebra C2×2 through the bijective map ψ : Q −→ C2×2 satisfying 1 0 i 0 0 −1 0 −i ψ(1) = , ψ(e )= , ψ(e )= , ψ(e )= . 0 1 1 0 −i 2 1 0 3 −i 0 These four matrices are well-known as Pauli matrices. Based on this map, every element a = a0 + a1e1 + a2e2 + a3e3 ∈ Q has a faithful complex matrix representation as follows a + a i −( a + a i ) ψ(a) := 0 1 2 3 ∈ C2×2, (1.4) a2 − a3i a0 − a1i 1 In this article, we shall reveal a deeper relationship between a and ψ(a), which can simply be stated that there is an independent invertible matrix Q of size 2 over Q such that all a ∈ Q satisfy the following universal similarity factorization equality Q−1diag( a, a )Q = ψ(a), where Q has no relation with the expression of a. Moreover we also extend this equality to all m×n matrices over Q. On the basis of these results, we shall consider several basic problems re- lated to complex quaternion matrices, such as, generalized inverse, eigenvalues and eigenvectors, similarity, and determinant of complex quaternion matrices. Some known terminology on complex quaternions are listed below (see, e.g., [6]). For a = a0 + a1e1 + a2e2 + a3e3 ∈ Q, the dual quaternion of a is a = a0 − a1e1 − a2e2 − a3e3; (1.5) the complex conjugate of a is ∗ a = a0 + a1e1 + a2e2 + a3e3; (1.6) the Hermitian conjugate of a is † ∗ a = (a) = a0 − a1e1 − a2e2 − a3e3; (1.7) the weak norm of a is 2 2 2 2 n(a)= a0 + a1 + a2 + a3. (1.8) A quaternion a ∈ Q is said to be real if a∗ = a, to be pure imaginary if a∗ = −a, to be scalar if a = a, to be Hermitian if a† = a. m×n n×m For any A = (ast) ∈ Q , the dual of A is A = (ats) ∈ Q ; the Hermitian conjugate of † † n×m A is A = (ats) ∈ Q . A square matrix A is said to be self-dual if A = A, it is Hermitian if A† = A, it is unitary if AA† = A†A = I, the indentity matrix, it is invertible if there is a matrix B over Q such that AB = BA = I. Some known basic properties on complex quaternions and matrices of complex quaternions are listed below. Lemma 1.1[1][6]. Let a, b ∈ Q be given. Then (a) a = a, (a∗)∗ = a, (a†)† = a. (b) a + b = a + b, (a + b)∗ = a∗ + b∗, (a + b)† = a† + b†. (c) ab = ba, (ab)∗ = a∗b∗, (ab)† = b†a†. (d) aa = aa = n(a)= n(a); (e) a is invertible if and only if n(a) 6= 0, in that case a−1 = n−1(a)a. Lemma 1.2[6]. Let A ∈ Qm×n, B ∈ Qn×p be given. Then (a) A = A, (A†)† = A. (b) AB = BA, (AB)† = B†A†. 2 (c) (AB)−1 = B−1A−1, if A and B are invertible. (d) (A)−1 = (A−1), (A†)−1 = (A−1)†, if A is invertible. 2. A universal similarity factorization equality over complex quaternion algebra We first present a general result on the universal similarity factorization of elements over 2 × 2 total matrix algebra. Lemma 2.1. Let M2(F) be the 2 × 2 total matrix algebra over an arbitrary field F with its basis e11, e12, e21 and e22 satisfying the following multiplication rules esq, t = p estepq = , s,t,p,q = 1, 2. (2.1) 0, t 6= p Then for any a = a11e11 + a12e12 + a21e21 + a22e22 ∈ M2(F), where ast ∈ F, the corresponding diagonal matrix diag( a, a ) satisfies the following universal similarity factorization equality a 0 a a Q Q−1 = 11 12 ∈ F 2×2, (2.2) 0 a a21 a22 where Q has the independent form e e Q = Q−1 = 11 21 . (2.3) e12 e22 Proof. According to Eq.(2.1), it is easy to verify that the unity element in M2(F) is e = e11 + e22. In that case, the matrix Q in Eq.(2.3) satisfies 2 2 e11 e21 e11 + e21e12 e11e21 + e21e22 e11 + e22 0 Q = = 2 = = eI2, e12 e22 e12e11 + e22e12 e12e21 + e22 0 e11 + e22 −1 which implies that Q is invertible over M2(F) and Q = Q . Next multiplying the three matrices in the left-hand side of Eq.(2.2) yields the right-hand side of Eq.(2.2). ✷ Theorem 2.2. Let a = a0 + a1e1 + a2e2 + a3e3 ∈ Q be given. Then the diagonal matrix diag( a, a ) satisfies the following universal factorization similarity equality a 0 a + a i −( a + a i ) Q Q = 0 1 2 3 = ψ(a) ∈ C2×2, (2.4) 0 a a2 − a3i a0 − a1i where Q is an unitary matrix over Q 1 1 − ie e + ie Q = A−1 = Q† = 1 2 3 . (2.5) 2 −e2 + ie3 1+ ie1 Proof. According to Eq.(2.4), we choose a new basis for Q as follows 1 1 1 1 e = ( 1 − ie ) , e = ( −e + ie ) , e = ( e + ie ) , e = (1+ ie ) . (2.6) 11 2 1 12 2 2 3 21 2 2 3 22 2 2 3 Then it is not difficult to verify that the above basis satisfies the multiplication rules in Eq.(2.1). Under this new basis, any element a = a0 + a1e1 + a2e2 + a3e3 ∈ Q can be expressed as a = ( a0 + ia1 )e11 + ( −a2 − ia3 )e12 + ( a2 − ia3 )e21 + ( a0 − ia1 )e22. (2.7) Substituting Eqs.(2.6) and (2.7) into Eq.(2.2), we obtain Eqs.(2.4) and (2.5). ✷ The equality in Eq.(2.4) can also equivalently be expressed as a a a 0 Q 11 12 Q = ∈ Q2×2, (2.8) a21 a22 0 a where ast ∈ C is arbitrary, Q is as in Eq.(2.5), and a has the form 1 1 1 1 a = ( a + a )+ ( a − a )ie + ( a − a )e + ( a + a )ie . (2.9) 2 11 22 2 22 11 1 2 21 12 2 2 12 21 3 This equality shows that every 2 × 2 complex matrix is uniformly similar to an diagonal matrix with the form aI2 over the complex quaternion algebra Q. The complex quaternions and their complex matrix representations satisfy the following operation properties. Theorem 2.3 Let a = a0 + a1e1 + a2e2 + a3e3, b ∈ Q, λ ∈ C be given. Then (a) a = b ⇐⇒ ψ(a)= ψ(b). (b) ψ(a + b)= ψ(a)+ ψ(b), ψ(ab)= ψ(a)ψ(b), ψ(λa)= ψ(aλ)= λψ(a), ψ(1) = I2. 0 1 0 −1 (c) ψ(a)= ψT (a) . −1 0 1 0 0 1 0 −1 (d) ψ(a∗)= ψ(a) . −1 0 1 0 T (e) ψ(a†)= ψ(a) = ψ∗(a), the conjugate transpose of ψ(a). 2 2 2 2 (f) det ψ(a)= n(a)= a0 + a1 + a2 + a3; 1 † (g) a = 4 E2 ψ(a) E2, where E2 = [ 1 − ie1, e2 + ie3 ]. (h) a is invertible if and only if ψ(a) is invertible, in that case, ψ(a−1) = ψ−1(a) and −1 1 −1 † a = 4 E2 ψ (a) E2. For a noninvertible element over Q, we can define its Moore-Penrose inverse as follows. Definition. Let a ∈ Q be given. If the following four equations axa = a, xax = x, (ax)† = ax, (xa)† = xa (2.10) have a common solution x, then this solution is called the Moore-Penrose inverse of a, and denoted by x = a+. The existence and the uniqueness of the Moore-Penrose inverse of a complex quaternion a can be determined by its matrix representation ψ(a) over C. In fact, according to Theorem 4 2.3(a), (b) and (e), the four equations in Eq.(2.10) are equivalent to the following four equations over C ψ(a)ψ(x)ψ(a) = ψ(a), ψ(x)ψ(a)ψ(x) = ψ(x), [ ψ(a)ψ(x) ]∗ = ψ(a)ψ(x), [ ψ(x)ψ(a) ]∗ = ψ(x)ψ(a). According to the complex matrix theory, the following four equations ψ(a)Y ψ(a)= ψ(a), Y ψ(a)Y = Y, [ ψ(a)Y ]∗ = ψ(a)Y, [ Y ψ(a) ]∗ = Y ψ(a).
Load more

Recommended publications
  • Math 651 Homework 1 - Algebras and Groups Due 2/22/2013
    Math 651 Homework 1 - Algebras and Groups Due 2/22/2013 1) Consider the Lie Group SU(2), the group of 2 × 2 complex matrices A T with A A = I and det(A) = 1. The underlying set is z −w jzj2 + jwj2 = 1 (1) w z with the standard S3 topology. The usual basis for su(2) is 0 i 0 −1 i 0 X = Y = Z = (2) i 0 1 0 0 −i (which are each i times the Pauli matrices: X = iσx, etc.). a) Show this is the algebra of purely imaginary quaternions, under the commutator bracket. b) Extend X to a left-invariant field and Y to a right-invariant field, and show by computation that the Lie bracket between them is zero. c) Extending X, Y , Z to global left-invariant vector fields, give SU(2) the metric g(X; X) = g(Y; Y ) = g(Z; Z) = 1 and all other inner products zero. Show this is a bi-invariant metric. d) Pick > 0 and set g(X; X) = 2, leaving g(Y; Y ) = g(Z; Z) = 1. Show this is left-invariant but not bi-invariant. p 2) The realification of an n × n complex matrix A + −1B is its assignment it to the 2n × 2n matrix A −B (3) BA Any n × n quaternionic matrix can be written A + Bk where A and B are complex matrices. Its complexification is the 2n × 2n complex matrix A −B (4) B A a) Show that the realification of complex matrices and complexifica- tion of quaternionic matrices are algebra homomorphisms.
    [Show full text]
  • Fast Singular Value Thresholding Without Singular Value Decomposition∗
    METHODS AND APPLICATIONS OF ANALYSIS. c 2013 International Press Vol. 20, No. 4, pp. 335–352, December 2013 002 FAST SINGULAR VALUE THRESHOLDING WITHOUT SINGULAR VALUE DECOMPOSITION∗ JIAN-FENG CAI† AND STANLEY OSHER‡ Abstract. Singular value thresholding (SVT) is a basic subroutine in many popular numerical schemes for solving nuclear norm minimization that arises from low-rank matrix recovery prob- lems such as matrix completion. The conventional approach for SVT is first to find the singular value decomposition (SVD) and then to shrink the singular values. However, such an approach is time-consuming under some circumstances, especially when the rank of the resulting matrix is not significantly low compared to its dimension. In this paper, we propose a fast algorithm for directly computing SVT for general dense matrices without using SVDs. Our algorithm is based on matrix Newton iteration for matrix functions, and the convergence is theoretically guaranteed. Numerical experiments show that our proposed algorithm is more efficient than the SVD-based approaches for general dense matrices. Key words. Low rank matrix, nuclear norm minimization, matrix Newton iteration. AMS subject classifications. 65F30, 65K99. 1. Introduction. Singular value thresholding (SVT) introduced in [7] is a key subroutine in many popular numerical schemes (e.g. [7, 12, 13, 52, 54, 66]) for solving nuclear norm minimization that arises from low-rank matrix recovery problems such as matrix completion [13–15,60]. Let Y Rm×n be a given matrix, and Y = UΣV T be its singular value decomposition (SVD),∈ where U and V are orthonormal matrices and Σ = diag(σ1, σ2,...,σs) is the diagonal matrix with diagonals being the singular values of Y .
    [Show full text]
  • A Simplex-Type Voronoi Algorithm Based on Short Vector Computations of Copositive Quadratic Forms
    Simons workshop Lattices Geometry, Algorithms and Hardness Berkeley, February 21st 2020 A simplex-type Voronoi algorithm based on short vector computations of copositive quadratic forms Achill Schürmann (Universität Rostock) based on work with Mathieu Dutour Sikirić and Frank Vallentin ( for Q n positive definite ) Perfect Forms 2 S>0 DEF: min(Q)= min Q[x] is the arithmetical minimum • x n 0 2Z \{ } Q is uniquely determined by min(Q) and Q perfect • , n MinQ = x Z : Q[x]=min(Q) { 2 } V(Q)=cone xxt : x MinQ is Voronoi cone of Q • { 2 } (Voronoi cones are full dimensional if and only if Q is perfect!) THM: Voronoi cones give a polyhedral tessellation of n S>0 and there are only finitely many up to GL n ( Z ) -equivalence. Voronoi’s Reduction Theory n t GLn(Z) acts on >0 by Q U QU S 7! Georgy Voronoi (1868 – 1908) Task of a reduction theory is to provide a fundamental domain Voronoi’s algorithm gives a recipe for the construction of a complete list of such polyhedral cones up to GL n ( Z ) -equivalence Ryshkov Polyhedron The set of all positive definite quadratic forms / matrices with arithmeticalRyshkov minimum Polyhedra at least 1 is called Ryshkov polyhedron = Q n : Q[x] 1 for all x Zn 0 R 2 S>0 ≥ 2 \{ } is a locally finite polyhedron • R is a locally finite polyhedron • R Vertices of are perfect forms Vertices of are• perfect R • R 1 n n ↵ (det(Q + ↵Q0)) is strictly concave on • 7! S>0 Voronoi’s algorithm Voronoi’s Algorithm Start with a perfect form Q 1.
    [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]
  • Combinatorial Optimization, Packing and Covering
    Combinatorial Optimization: Packing and Covering G´erard Cornu´ejols Carnegie Mellon University July 2000 1 Preface The integer programming models known as set packing and set cov- ering have a wide range of applications, such as pattern recognition, plant location and airline crew scheduling. Sometimes, due to the spe- cial structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integer, thus solving the problem. Sometimes, both the linear programming relaxation and its dual have integer optimal solutions. Under which conditions do such integrality properties hold? This question is of both theoretical and practical interest. Min-max theorems, polyhedral combinatorics and graph theory all come together in this rich area of discrete mathemat- ics. In addition to min-max and polyhedral results, some of the deepest results in this area come in two flavors: “excluded minor” results and “decomposition” results. In these notes, we present several of these beautiful results. Three chapters cover min-max and polyhedral re- sults. The next four cover excluded minor results. In the last three, we present decomposition results. We hope that these notes will encourage research on the many intriguing open questions that still remain. In particular, we state 18 conjectures. For each of these conjectures, we offer $5000 as an incentive for the first correct solution or refutation before December 2020. 2 Contents 1Clutters 7 1.1 MFMC Property and Idealness . 9 1.2 Blocker . 13 1.3 Examples .......................... 15 1.3.1 st-Cuts and st-Paths . 15 1.3.2 Two-Commodity Flows . 17 1.3.3 r-Cuts and r-Arborescences .
    [Show full text]
  • Chapter 1: Complex Numbers Lecture Notes Math Section
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Almae Matris Studiorum Campus Chapter 1: Complex Numbers Lecture notes Math Section 1.1: Definition of Complex Numbers Definition of a complex number A complex number is a number that can be expressed in the form z = a + bi, where a and b are real numbers and i is the imaginary unit, that satisfies the equation i2 = −1. In this expression, a is the real part Re(z) and b is the imaginary part Im(z) of the complex number. The complex number a + bi can be identified with the point (a; b) in the complex plane. A complex number whose real part is zero is said to be purely imaginary, whereas a complex number whose imaginary part is zero is a real number. Ex.1 Understanding complex numbers Write the real part and the imaginary part of the following complex numbers and plot each number in the complex plane. (1) i (2) 4 + 2i (3) 1 − 3i (4) −2 Section 1.2: Operations with Complex Numbers Addition and subtraction of two complex numbers To add/subtract two complex numbers we add/subtract each part separately: (a + bi) + (c + di) = (a + c) + (b + d)i and (a + bi) − (c + di) = (a − c) + (b − d)i Ex.1 Addition and subtraction of complex numbers (1) (9 + i) + (2 − 3i) (2) (−2 + 4i) − (6 + 3i) (3) (i) − (−11 + 2i) (4) (1 + i) + (4 + 9i) Multiplication of two complex numbers To multiply two complex numbers we proceed as follows: (a + bi)(c + di) = ac + adi + bci + bdi2 = ac + adi + bci − bd = (ac − bd) + (ad + bc)i Ex.2 Multiplication of complex numbers (1) (3 + 2i)(1 + 7i) (2) (i + 1)2 (3) (−4 + 3i)(2 − 5i) 1 Chapter 1: Complex Numbers Lecture notes Math Conjugate of a complex number The complex conjugate of the complex number z = a + bi is defined to be z¯ = a − bi.
    [Show full text]
  • Complex Inner Product Spaces
    MATH 355 Supplemental Notes Complex Inner Product Spaces Complex Inner Product Spaces The Cn spaces The prototypical (and most important) real vector spaces are the Euclidean spaces Rn. Any study of complex vector spaces will similar begin with Cn. As a set, Cn contains vectors of length n whose entries are complex numbers. Thus, 2 i ` 3 5i C3, » ´ fi P i — ffi – fl 5, 1 is an element found both in R2 and C2 (and, indeed, all of Rn is found in Cn), and 0, 0, 0, 0 p ´ q p q serves as the zero element in C4. Addition and scalar multiplication in Cn is done in the analogous way to how they are performed in Rn, except that now the scalars are allowed to be nonreal numbers. Thus, to rescale the vector 3 i, 2 3i by 1 3i, we have p ` ´ ´ q ´ 3 i 1 3i 3 i 6 8i 1 3i ` p ´ qp ` q ´ . p ´ q « 2 3iff “ « 1 3i 2 3i ff “ « 11 3iff ´ ´ p ´ qp´ ´ q ´ ` Given the notation 3 2i for the complex conjugate 3 2i of 3 2i, we adopt a similar notation ` ´ ` when we want to take the complex conjugate simultaneously of all entries in a vector. Thus, 3 4i 3 4i ´ ` » 2i fi » 2i fi if z , then z ´ . “ “ — 2 5iffi — 2 5iffi —´ ` ffi —´ ´ ffi — 1 ffi — 1 ffi — ´ ffi — ´ ffi – fl – fl Both z and z are vectors in C4. In general, if the entries of z are all real numbers, then z z. “ The inner product in Cn In Rn, the length of a vector x ?x x is a real, nonnegative number.
    [Show full text]
  • MATH 304 Linear Algebra Lecture 25: Complex Eigenvalues and Eigenvectors
    MATH 304 Linear Algebra Lecture 25: Complex eigenvalues and eigenvectors. Orthogonal matrices. Rotations in space. Complex numbers C: complex numbers. Complex number: z = x + iy, where x, y R and i 2 = 1. ∈ − i = √ 1: imaginary unit − Alternative notation: z = x + yi. x = real part of z, iy = imaginary part of z y = 0 = z = x (real number) ⇒ x = 0 = z = iy (purely imaginary number) ⇒ We add, subtract, and multiply complex numbers as polynomials in i (but keep in mind that i 2 = 1). − If z1 = x1 + iy1 and z2 = x2 + iy2, then z1 + z2 = (x1 + x2) + i(y1 + y2), z z = (x x ) + i(y y ), 1 − 2 1 − 2 1 − 2 z z = (x x y y ) + i(x y + x y ). 1 2 1 2 − 1 2 1 2 2 1 Given z = x + iy, the complex conjugate of z is z¯ = x iy. The modulus of z is z = x 2 + y 2. − | | zz¯ = (x + iy)(x iy) = x 2 (iy)2 = x 2 +py 2 = z 2. − − | | 1 z¯ 1 x iy z− = ,(x + iy) = − . z 2 − x 2 + y 2 | | Geometric representation Any complex number z = x + iy is represented by the vector/point (x, y) R2. ∈ y r φ 0 x 0 x = r cos φ, y = r sin φ = z = r(cos φ + i sin φ) = reiφ ⇒ iφ1 iφ2 If z1 = r1e and z2 = r2e , then i(φ1+φ2) i(φ1 φ2) z1z2 = r1r2e , z1/z2 = (r1/r2)e − . Fundamental Theorem of Algebra Any polynomial of degree n 1, with complex ≥ coefficients, has exactly n roots (counting with multiplicities).
    [Show full text]
  • Quadratic Forms and Their Applications
    Quadratic Forms and Their Applications Proceedings of the Conference on Quadratic Forms and Their Applications July 5{9, 1999 University College Dublin Eva Bayer-Fluckiger David Lewis Andrew Ranicki Editors Published as Contemporary Mathematics 272, A.M.S. (2000) vii Contents Preface ix Conference lectures x Conference participants xii Conference photo xiv Galois cohomology of the classical groups Eva Bayer-Fluckiger 1 Symplectic lattices Anne-Marie Berge¶ 9 Universal quadratic forms and the ¯fteen theorem J.H. Conway 23 On the Conway-Schneeberger ¯fteen theorem Manjul Bhargava 27 On trace forms and the Burnside ring Martin Epkenhans 39 Equivariant Brauer groups A. FrohlichÄ and C.T.C. Wall 57 Isotropy of quadratic forms and ¯eld invariants Detlev W. Hoffmann 73 Quadratic forms with absolutely maximal splitting Oleg Izhboldin and Alexander Vishik 103 2-regularity and reversibility of quadratic mappings Alexey F. Izmailov 127 Quadratic forms in knot theory C. Kearton 135 Biography of Ernst Witt (1911{1991) Ina Kersten 155 viii Generic splitting towers and generic splitting preparation of quadratic forms Manfred Knebusch and Ulf Rehmann 173 Local densities of hermitian forms Maurice Mischler 201 Notes towards a constructive proof of Hilbert's theorem on ternary quartics Victoria Powers and Bruce Reznick 209 On the history of the algebraic theory of quadratic forms Winfried Scharlau 229 Local fundamental classes derived from higher K-groups: III Victor P. Snaith 261 Hilbert's theorem on positive ternary quartics Richard G. Swan 287 Quadratic forms and normal surface singularities C.T.C. Wall 293 ix Preface These are the proceedings of the conference on \Quadratic Forms And Their Applications" which was held at University College Dublin from 5th to 9th July, 1999.
    [Show full text]
  • The Integration Problem for Complex Lie Algebroids
    The integration problem for complex Lie algebroids Alan Weinstein∗ Department of Mathematics University of California Berkeley CA, 94720-3840 USA [email protected] July 17, 2018 Abstract A complex Lie algebroid is a complex vector bundle over a smooth (real) manifold M with a bracket on sections and an anchor to the complexified tangent bundle of M which satisfy the usual Lie algebroid axioms. A proposal is made here to integrate analytic complex Lie al- gebroids by using analytic continuation to a complexification of M and integration to a holomorphic groupoid. A collection of diverse exam- ples reveal that the holomorphic stacks presented by these groupoids tend to coincide with known objects associated to structures in com- plex geometry. This suggests that the object integrating a complex Lie algebroid should be a holomorphic stack. 1 Introduction It is a pleasure to dedicate this paper to Professor Hideki Omori. His work arXiv:math/0601752v1 [math.DG] 31 Jan 2006 over many years, introducing ILH manifolds [30], Weyl manifolds [32], and blurred Lie groups [31] has broadened the notion of what constitutes a “space.” The problem of “integrating” complex vector fields on real mani- folds seems to lead to yet another kind of space, which is investigated in this paper. ∗research partially supported by NSF grant DMS-0204100 MSC2000 Subject Classification Numbers: Keywords: 1 Recall that a Lie algebroid over a smooth manifold M is a real vector bundle E over M with a Lie algebra structure (over R) on its sections and a bundle map ρ (called the anchor) from E to the tangent bundle T M, satisfying the Leibniz rule [a, fb]= f[a, b] + (ρ(a)f)b for sections a and b and smooth functions f : M → R.
    [Show full text]
  • Complex Numbers and Coordinate Transformations WHOI Math Review
    Complex Numbers and Coordinate transformations WHOI Math Review Isabela Le Bras July 27, 2015 Class outline: 1. Complex number algebra 2. Complex number application 3. Rotation of coordinate systems 4. Polar and spherical coordinates 1 Complex number algebra Complex numbers are ap combination of real and imaginary numbers. Imaginary numbers are based around the definition of i, i = −1. They are useful for solving differential equations; they carry twice as much information as a real number and there exists a useful framework for handling them. To add and subtract complex numbers, group together the real and imaginary parts. For example, (4 + 3i) + (3 + 2i) = 7 + 5i: Try a few examples: • (9 + 3i) - (4 + 7i) = • (6i) + (8 + 2i) = • (7 + 7i) - (9 - 9i) = To multiply, multiply all components by each other, and use the fact that i2 = −1 to simplify. For example, (3 − 2i)(4 + 3i) = 12 + 9i − 8i − 6i2 = 18 + i To divide, multiply the numerator by the complex conjugate of the denominator. The complex conjugate is formed by multiplying the imaginary part of the complex number by -1, and is often denoted by a star, i.e. (6 + 3i)∗ = (6 − 3i). The reason this works is easier to see in the complex plane. Here is an example of division: (4 + 2i)=(3 − i) = (4 + 2i)(3 + i) = 12 + 4i + 6i + 2i2 = 10 + 10i Try a few examples of multiplication and division: • (4 + 7i)(2 + i) = 1 • (5 + 3i)(5 - 2i) = • (6 -2i)/(4 + 3i) = • (3 + 2i)/(6i) = We often think of complex numbers as living on the plane of real and imaginary numbers, and can write them as reiq = r(cos(q) + isin(q)).
    [Show full text]
  • A Framework for Efficient Execution of Matrix Computations
    A Framework for Efficient Execution of Matrix Computations Doctoral Thesis May 2006 Jos´e Ram´on Herrero Advisor: Prof. Juan J. Navarro UNIVERSITAT POLITECNICA` DE CATALUNYA Departament D'Arquitectura de Computadors To Joan and Albert my children To Eug`enia my wife To Ram´on and Gloria my parents Stillicidi casus lapidem cavat Lucretius (c. 99 B.C.-c. 55 B.C.) De Rerum Natura1 1Continual dropping wears away a stone. Titus Lucretius Carus. On the nature of things Abstract Matrix computations lie at the heart of most scientific computational tasks. The solution of linear systems of equations is a very frequent operation in many fields in science, engineering, surveying, physics and others. Other matrix op- erations occur frequently in many other fields such as pattern recognition and classification, or multimedia applications. Therefore, it is important to perform matrix operations efficiently. The work in this thesis focuses on the efficient execution on commodity processors of matrix operations which arise frequently in different fields. We study some important operations which appear in the solution of real world problems: some sparse and dense linear algebra codes and a classification algorithm. In particular, we focus our attention on the efficient execution of the following operations: sparse Cholesky factorization; dense matrix multipli- cation; dense Cholesky factorization; and Nearest Neighbor Classification. A lot of research has been conducted on the efficient parallelization of nu- merical algorithms. However, the efficiency of a parallel algorithm depends ultimately on the performance obtained from the computations performed on each node. The work presented in this thesis focuses on the sequential execution on a single processor.
    [Show full text]