DOCSLIB.ORG

Compound Matrices and the Determinant of the Sum of Two

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Compound Matrices and the Determinant of the Sum of Two 10.1098/rspa.2002.1040 Useof geometric algebra: compound matrices andthe determinantof the sumof two matrices ByUwePrells 1,MichaelI.F riswell 1 andSeamusD.Garvey 2 1DynamicResearch Group,School ofEngineering, University ofWales Swansea, Swansea SA28PP, UK 2School ofMechanical, Materials, ManufacturingEngineering and Management, The University ofNottingham, University Park,Nottingham NG7 2RD, UK Received14 February 2002; revised7 June2002; accepted24 June2002; publishedonline 14 November2002 In this paper wedemonstrate the capabilities of geometric algebra by the derivation of aformula for the determinant of the sum of two matrices in which both matrices are separated in the sense that the resulting expression consists of asum of traces of products of their compound matrices. For the derivation weintroduce avector of Grassmann elements associated with an arbitrary square matrix, werecall the concept of compound matrices and summarize some of their properties. This paper introduces anewderiv ation and interpretation of the relationship between p-forms and the pth compound matrix, and it demonstrates the use of geometric algebra, which has the potential to be applied to awide range of problems. Keywords:geometric algebra; determinants; compoundmatrices 1.Introduction Many interesting questions are related to the determinant of matrices (Krattenthaler &Zeilberger 1970), and in particular to the determinant of the sum of two matri- ces(Li &Mathias 1995; Bebiano et al.1994). Indeed, some of these still remain unanswered (Barret &Jarvis 1992; Bebiano 1994). Anatural generalization of deter- minants are compound matrices which are closely related to the presentation of geometric algebra. Aswith geometric algebra, the concept of compound matrices has been neglected for many years, and its potential in theoretical analysis and prac- tical application has been widely underestimated (see, for example, Nambiar 1997; Nambiar &Keating 1970; Malik 1970; Linsay &Rooney 1992; Fuchs 1992; Mitrouli &Koukouvinos 1997). For example, Nambiar &Keating (1970) conclude their paper by saying while afewnetwork theorists certainly seem to be aware of the poten- tialities here, largely compound matrices seem to beaneglected subject. Even an outstanding book like Gantmacher [(1959)] makes only acasual mention of it. Proc.R. Soc. Lond. A (2003) 459, 273{285 °c 2002 TheRoyal Society 273 274 U.Prells andothers Since the early books of Cullis (1913, 1918, 1925) and the often-quoted book of Aitken (1954), no recent book has re®ected the modern application capabilities of the concept of compound matrices in depth. Wehope that this paper encourages mathematicians, physicists and engineers to revive the concept of compound matrices within the framework of geometric algebra and use it practically. However, the main scope of this paper is to present aderivation of aformula for the determinant of the sum of two matrices. This formula is equivalent to the application of the Laplace expansion theorem on the determinant of two matrices (Marcus 1975), although it is not asimple task to use this relation. Theform of the expression presented in this paper appears to be more accessible than previous versions and the derivation itself motivates further study of the relationship between geometric algebra and compound matrices. Ofcourse, since the determinant of an n £ n matrix A is identical to its nth compound matrix C n(A),the Binet{Cauchy theorem provides one way of separation: In In det(A + B) = det A; In = n( A; In ) n : (1.1) µ ·B ¸ ¶ C C µ ·B ¸ ¶ £ ¤ £ ¤ 2n Obviously,the right-hand side is ascalar product of two n -dimensional vectors. Butis it possible to express this scalar product in terms of¡ the¢ compound matrices of A and B?Theanswer is a¯ rmative. Toderive acorresponding formula weneed some de­nitions and notation. In the next section the basics of Grassmann algebra are recalled and in x 3the relation to compound matrices is highlighted. The main result is given in x 4. Section 5contains some examples. 2.Grassmann algebra n Wede­ne the Grassmann algebra n(C) := p= 0 Vp(C),brie®y written as , as the n G G direct sum of np := p -dimensional vector spacesL Vp over the ­eld C V0. The basis n ² of G is 2 -dimensional¡ ¢ and is spanned by the basis elements f³ 1; ³ 2; : : : ; ³ n+ 1; ³ n+ 2; : : : ; ³ 2n g := f1; e1; : : : ; en; e1 ^ e2; : : : ; e1 ^ ¢ ¢ ¢ ^ eng; (2.1) where ei is the ith column of the n-dimensional identity matrix In and the Grassmann product (exterior or outer product) is de­ned by ek ^ ei + ei ^ ek = 0; (2.2) which is aspecial case of the general geometric or Cli¬ord product ek °B ei + ei °B ek = B(ei; ek); (2.3) where B(ei; ek)is an arbitrary bilinear form (Porteous 1995). Theabove de­nition of the Grassmann product implies ei ^ ei =0. Thebasis element e := e e ; 1 6 i < < i 6 n; (2.4) i1¢¢¢ip i1 ^ ¢ ¢ ¢ ^ ip 1 ¢ ¢ ¢ p is called the basic p-form, basic p-vector or p-blade. Thesubsequence of all p-forms in (2.1) is ordered lexicographically,which means that ifwe realize i1 ¢ ¢ ¢ ip as the digits of anumber with asu¯ ciently high basis, then the order is increasing from Proc.R. Soc. Lond. A (2003) Use ofge ometricalgebra 275 1 ¢ ¢ ¢ p to (n ¡ p + 1) ¢ ¢ ¢ n.Becausethe basis is ordered, (2.1) can bewritten uniquely as a vector ³ (0) 0³ (1) 1 ³ := ; (2.5) . B . C B C B³ (n)C @ A where for p 2 f0; ng the np-dimensional vector ³ (p) contains all basis elements of Vp and is associated with p-forms by e1¢¢¢p . ³ (p)1 0 . 1 . np ³ (p) := 0 . 1 := B ei1 ip C : (2.6) . B ¢¢¢ C 2 G ³ B . C B (p)np C B . C @ A B C Ben p+ 1 nC @ ¡ ¢¢¢ A In particular wehave ³ ³ = 1 and ³ ³ n = e .The 0-forms are scalars, (0) ² 1 (n) ² 2 1¢¢¢n the 1-forms are vectors, the 2-forms are bi-vectors, and so on. Atypical element g 2 G is called aGrassmann element or Grassmann number and is alinear combination of scalars gi 2 C with all basis elements, which can bealternatively written as 2n n T T g = gi³ i = g ³ = g(p)³ (p); (2.7) Xi= 1 Xp= 0 n 2 np where gi is the ith element of the vector g 2 C and where the vectors g(p) 2 C are associated with the p-form part of g, that is T [g]p := g(p)³ (p) 2 Vp: (2.8) Since np = nn¡p,the vectors ³ (p) and ³ (n p) have the same dimension. Weextend ¡ T the de­nition of the exterior product to the product ³ (p) ³ of two vectors of ^ (n¡p) Grassmann numbers, analogous to the dyadic product of two vectors as the compo- nentwise exterior product, that is T ³ (p) ³ ^ (n¡p) e1¢¢¢p . 0 . 1 = B ei1 ip C e1 n p; : : : ; eip+1 in ; : : : ; ep+ 1 n B ¢¢¢ C ^ ¢¢¢ ¡ ¢¢¢ ¢¢¢ B . C ¡ ¢ B . C B C Ben p+ 1 nC @ ¡ ¢¢¢ A e e : : : e e : : : e e 1¢¢¢p ^ 1¢¢¢n¡p 1¢¢¢p ^ ip+1 ¢¢¢in 1¢¢¢p ^ p+ 1¢¢¢n . 2 . 3 := 6 ei1 ip e1 n p : : : ei1 ip eip+1 in : : : ei1 ip ep+ 1 n 7 6 ¢¢¢ ^ ¢¢¢ ¡ ¢¢¢ ^ ¢¢¢ ¢¢¢ ^ ¢¢¢ 7 6 . 7 6 . 7 6 7 6en p+ 1 n e1 n p : : : en p+ 1 n eip+1 in : : : en p+ 1 n ep+ 1 n7 4 ¡ ¢¢¢ ^ ¢¢¢ ¡ ¡ ¢¢¢ ^ ¢¢¢ ¡ ¢¢¢ ^ ¢¢¢ 5 Proc.R. Soc. Lond. A (2003) 276 U.Prells andothers 1+ + p 0 (¡ 1) ¢¢¢ : : 2 : 3 p(p+ 1)=2 i1+ + ip = ( 1) ( 1) ¢¢¢ e1 n ¡ 6 : ¡ 7 ¢¢¢ 6 : : 7 6 7 6( 1)n¡p+ 1+ ¢¢¢+ n 0 7 4 ¡ 5 p(p+ 1)=2 = (¡ 1) § pEp³ (n); (2.9) where the np £ np matrix Ep is the rotated identity matrix, that is 0 1 : : Ep := 2 : 3 (2.10) 1 0 4 5 ¼ pk and § p := diag[(¡ 1) ]k= 1;:::;np with ¼ pk := i1 + ¢ ¢ ¢ + ip.Without proof wenote that § = ( 1)n(n+ 1)=2E § E : (2.11) n¡p ¡ p p p For each set Spk = fi1; : : : ; ipg of indices 1 6 i1 < ¢ ¢ ¢ < ip 6 n there exists one unique set S = i ; : : : ; i of indices 1 6 i < < i 6 n such n¡pj f p+ 1 ng p+ 1 ¢ ¢ ¢ n that S S = n and S S = .Although each set is ordered, the pk [ n¡pj pk \ n¡pj ; concatenated set fi1; : : : ; ip; ip+ 1; : : : ; ing is not ordered. Now consider the n-form e e . Since i ; : : : ; i is apermutation of 1 ; : : : ; n this n-form di¬ers i1¢¢¢ip ^ ip+1 ¢¢¢in 1 n only by asign from ³ (n) = e1¢¢¢n.The sign isnegative ifthe permutation has an odd number of transpositions, and it is positive ifthe permutation has an even number of transpositions. The result e e = ( 1)¼ pk ¡p(p+ 1)=2e ; (2.12) i1¢¢¢ip ^ ip+1 ¢¢¢in ¡ 1¢¢¢n which motivates the de­nition of the star operator (Hodge duality) e := ( 1)¼ pk ¡p(p+ 1)=2e ; (2.13) ¤ i1¢¢¢ip ¡ ip+1 ¢¢¢in is more convenient. Since ¼ pk + ¼ n¡pj = n(n + 1)=2, ashort calculation reveals e = ( 1)p(n¡p)e : (2.14) ¤ ¤ i1¢¢¢ip ¡ i1¢¢¢ip Declaring the action of the star operator on ³ (p) componentwise ¤³ (p)1 ³ := 0 . 1 = ( 1)p(p+ 1)=2§ E ³ ; (2.15) ¤ (p) . ¡ p p (n¡p) B ³ (p)np C @¤ A we ­ nd T p(p+ 1)=2 T ³ (p) ³ = ( 1) ³ (p) ³ Ep§ p = Inp ³ (n): (2.16) ^ ¤ (p) ¡ ^ (n¡p) Asan analogy to the scalar product of two vectors wede­ ne the product ³ T ³ := ( 1)p(p+ 1)=2³ T § E ³ (p) ^ ¤ (n¡p) ¡ (p) p p (n¡p) p(p+ 1)=2 T = ( 1) tr(Ep§ p³ (p)³ ) = np³ (n): (2.17) ¡ (n¡p) Proc.R.
Load more

Recommended publications
  • Geometric-Algebra Adaptive Filters Wilder B
    1 Geometric-Algebra Adaptive Filters Wilder B. Lopes∗, Member, IEEE, Cassio G. Lopesy, Senior Member, IEEE Abstract—This paper presents a new class of adaptive filters, namely Geometric-Algebra Adaptive Filters (GAAFs). They are Faces generated by formulating the underlying minimization problem (a deterministic cost function) from the perspective of Geometric Algebra (GA), a comprehensive mathematical language well- Edges suited for the description of geometric transformations. Also, (directed lines) differently from standard adaptive-filtering theory, Geometric Calculus (the extension of GA to differential calculus) allows Fig. 1. A polyhedron (3-dimensional polytope) can be completely described for applying the same derivation techniques regardless of the by the geometric multiplication of its edges (oriented lines, vectors), which type (subalgebra) of the data, i.e., real, complex numbers, generate the faces and hypersurfaces (in the case of a general n-dimensional quaternions, etc. Relying on those characteristics (among others), polytope). a deterministic quadratic cost function is posed, from which the GAAFs are devised, providing a generalization of regular adaptive filters to subalgebras of GA. From the obtained update rule, it is shown how to recover the following least-mean squares perform calculus with hypercomplex quantities, i.e., elements (LMS) adaptive filter variants: real-entries LMS, complex LMS, that generalize complex numbers for higher dimensions [2]– and quaternions LMS. Mean-square analysis and simulations in [10]. a system identification scenario are provided, showing very good agreement for different levels of measurement noise. GA-based AFs were first introduced in [11], [12], where they were successfully employed to estimate the geometric Index Terms—Adaptive filtering, geometric algebra, quater- transformation (rotation and translation) that aligns a pair of nions.
    [Show full text]
  • New Foundations for Geometric Algebra1
    Text published in the electronic journal Clifford Analysis, Clifford Algebras and their Applications vol. 2, No. 3 (2013) pp. 193-211 New foundations for geometric algebra1 Ramon González Calvet Institut Pere Calders, Campus Universitat Autònoma de Barcelona, 08193 Cerdanyola del Vallès, Spain E-mail : [email protected] Abstract. New foundations for geometric algebra are proposed based upon the existing isomorphisms between geometric and matrix algebras. Each geometric algebra always has a faithful real matrix representation with a periodicity of 8. On the other hand, each matrix algebra is always embedded in a geometric algebra of a convenient dimension. The geometric product is also isomorphic to the matrix product, and many vector transformations such as rotations, axial symmetries and Lorentz transformations can be written in a form isomorphic to a similarity transformation of matrices. We collect the idea Dirac applied to develop the relativistic electron equation when he took a basis of matrices for the geometric algebra instead of a basis of geometric vectors. Of course, this way of understanding the geometric algebra requires new definitions: the geometric vector space is defined as the algebraic subspace that generates the rest of the matrix algebra by addition and multiplication; isometries are simply defined as the similarity transformations of matrices as shown above, and finally the norm of any element of the geometric algebra is defined as the nth root of the determinant of its representative matrix of order n. The main idea of this proposal is an arithmetic point of view consisting of reversing the roles of matrix and geometric algebras in the sense that geometric algebra is a way of accessing, working and understanding the most fundamental conception of matrix algebra as the algebra of transformations of multiple quantities.
    [Show full text]
  • A Guided Tour to the Plane-Based Geometric Algebra PGA
    A Guided Tour to the Plane-Based Geometric Algebra PGA Leo Dorst University of Amsterdam Version 1.15{ July 6, 2020 Planes are the primitive elements for the constructions of objects and oper- ators in Euclidean geometry. Triangulated meshes are built from them, and reflections in multiple planes are a mathematically pure way to construct Euclidean motions. A geometric algebra based on planes is therefore a natural choice to unify objects and operators for Euclidean geometry. The usual claims of `com- pleteness' of the GA approach leads us to hope that it might contain, in a single framework, all representations ever designed for Euclidean geometry - including normal vectors, directions as points at infinity, Pl¨ucker coordinates for lines, quaternions as 3D rotations around the origin, and dual quaternions for rigid body motions; and even spinors. This text provides a guided tour to this algebra of planes PGA. It indeed shows how all such computationally efficient methods are incorporated and related. We will see how the PGA elements naturally group into blocks of four coordinates in an implementation, and how this more complete under- standing of the embedding suggests some handy choices to avoid extraneous computations. In the unified PGA framework, one never switches between efficient representations for subtasks, and this obviously saves any time spent on data conversions. Relative to other treatments of PGA, this text is rather light on the mathematics. Where you see careful derivations, they involve the aspects of orientation and magnitude. These features have been neglected by authors focussing on the mathematical beauty of the projective nature of the algebra.
    [Show full text]
  • Geometric Algebra 4
    Geometric Algebra 4. Algebraic Foundations and 4D Dr Chris Doran ARM Research L4 S2 Axioms Elements of a geometric algebra are Multivectors can be classified by grade called multivectors Grade-0 terms are real scalars Grading is a projection operation Space is linear over the scalars. All simple and natural L4 S3 Axioms The grade-1 elements of a geometric The antisymmetric produce of r vectors algebra are called vectors results in a grade-r blade Call this the outer product So we define Sum over all permutations with epsilon +1 for even and -1 for odd L4 S4 Simplifying result Given a set of linearly-independent vectors We can find a set of anti-commuting vectors such that These vectors all anti-commute Symmetric matrix Define The magnitude of the product is also correct L4 S5 Decomposing products Make repeated use of Define the inner product of a vector and a bivector L4 S6 General result Grade r-1 Over-check means this term is missing Define the inner product of a vector Remaining term is the outer product and a grade-r term Can prove this is the same as earlier definition of the outer product L4 S7 General product Extend dot and wedge symbols for homogenous multivectors The definition of the outer product is consistent with the earlier definition (requires some proof). This version allows a quick proof of associativity: L4 S8 Reverse, scalar product and commutator The reverse, sometimes written with a dagger Useful sequence Write the scalar product as Occasionally use the commutator product Useful property is that the commutator Scalar product is symmetric with a bivector B preserves grade L4 S9 Rotations Combination of rotations Suppose we now rotate a blade So the product rotor is So the blade rotates as Rotors form a group Fermions? Take a rotated vector through a further rotation The rotor transformation law is Now take the rotor on an excursion through 360 degrees.
    [Show full text]
  • Clifford Algebra with Mathematica
    Clifford Algebra with Mathematica J.L. ARAGON´ G. ARAGON-CAMARASA Universidad Nacional Aut´onoma de M´exico University of Glasgow Centro de F´ısica Aplicada School of Computing Science y Tecnolog´ıa Avanzada Sir Alwyn William Building, Apartado Postal 1-1010, 76000 Quer´etaro Glasgow, G12 8QQ Scotland MEXICO UNITED KINGDOM [email protected] [email protected] G. ARAGON-GONZ´ ALEZ´ M.A. RODRIGUEZ-ANDRADE´ Universidad Aut´onoma Metropolitana Instituto Polit´ecnico Nacional Unidad Azcapotzalco Departamento de Matem´aticas, ESFM San Pablo 180, Colonia Reynosa-Tamaulipas, UP Adolfo L´opez Mateos, 02200 D.F. M´exico Edificio 9. 07300 D.F. M´exico MEXICO MEXICO [email protected] [email protected] Abstract: The Clifford algebra of a n-dimensional Euclidean vector space provides a general language comprising vectors, complex numbers, quaternions, Grassman algebra, Pauli and Dirac matrices. In this work, we present an introduction to the main ideas of Clifford algebra, with the main goal to develop a package for Clifford algebra calculations for the computer algebra program Mathematica.∗ The Clifford algebra package is thus a powerful tool since it allows the manipulation of all Clifford mathematical objects. The package also provides a visualization tool for elements of Clifford Algebra in the 3-dimensional space. clifford.m is available from https://github.com/jlaragonvera/Geometric-Algebra Key–Words: Clifford Algebras, Geometric Algebra, Mathematica Software. 1 Introduction Mathematica, resulting in a package for doing Clif- ford algebra computations. There exists some other The importance of Clifford algebra was recognized packages and specialized programs for doing Clif- for the first time in quantum field theory.
    [Show full text]
  • Geometric Algebra: a Computational Framework for Geometrical Applications (Part I: Algebra)
    Geometric algebra: a computational framework for geometrical applications (part I: algebra) Leo Dorst∗ and Stephen Manny Abstract Geometric algebra is a consistent computational framework in which to define geometric primitives and their relationships. This algebraic approach contains all geometric operators and permits specification of constructions in a coordinate-free manner. Thus, the ideas of geometric algebra are important for developers of CAD systems. This paper gives an introduction to the elements of geometric algebra, which contains primitives of any dimensionality (rather than just vectors), and an introduction to three of the products of geometric algebra, the geometric product, the inner product, and the outer product. These products are illustrated by using them to solve simple geometric problems. Keywords: geometric algebra, Clifford algebra, subspaces, blades, geometric product, inner product, outer product 1 Introduction In the usual way of defining geometrical objects in fields like computer graphics, robotics and computer vision, one uses vectors to characterize the constructions. To do this effectively, the basic concept of a vector as an element of a linear space is ex- tended by an inner product and a cross product, and some additional constructions such as homogeneous coordinates to encode compactly the intersection of, for instance, off- set planes in space. Many of these techniques work rather well in 3-dimensional space, although some problems have been pointed out: the difference between vectors and points [3], and the characterization of planes by normal vectors (which may require ex- tra computation after linear transformations, since the normal vector of a transformed plane is not the transform of the normal vector).
    [Show full text]
  • Functions of Multivectors in 3D Euclidean Geometric Algebra Via Spectral Decomposition (For Physicists and Engineers)
    Functions of multivectors in 3D Euclidean geometric algebra via spectral decomposition (for physicists and engineers) Miroslav Josipović [email protected] December, 2015 Geometric algebra is a powerful mathematical tool for description of physical phenomena. The article [ 3] gives a thorough analysis of functions of multivectors in Cl 3 relaying on involutions, especially Clifford conjugation and complex structure of algebra. Here is discussed another elegant way to do that, relaying on complex structure and idempotents of algebra. Implementation of Cl 3 using ordinary complex algebra is briefly discussed. Keywords: function of multivector, idempotent, nilpotent, spectral decomposition, unipodal numbers, geometric algebra, Clifford conjugation, multivector amplitude, bilinear transformations 1. Numbers Geometric algebra is a promising platform for mathematical analysis of physical phenomena. The simplicity and naturalness of the initial assumptions and the possibility of formulation of (all?) main physical theories with the same mathematical language imposes the need for a serious study of this beautiful mathematical structure. Many authors have made significant contributions and there is some surprising conclusions. Important one is certainly the possibility of natural defining Minkowski metrics within Euclidean 3D space without introduction of negative signature, that is, without defining time as the fourth dimension ([1, 6]). In Euclidean 3D space we define orthogonal unit vectors e1, e 2, e 3 with the property e2 = 1 ee+ ee = 0 i , ij ji , so one could recognize the rule for multiplication of Pauli matrices. Non-commutative product of two vectors is ab= a ⋅ b + a ∧ b , sum of symmetric (inner product) and anti- symmetric part (wedge product). Each element of the algebra (Cl 3) can be expressed as linear combination of elements of 23 – dimensional basis (Clifford basis ) e e e ee ee ee eee {1, 1, 2, 3, 12, 31, 23, 123 }, where we have a scalar, three vectors, three bivectors and pseudoscalar.
    [Show full text]
  • Geometric Algebra for Mathematicians
    Geometric Algebra for Mathematicians Kalle Rutanen 09.04.2013 (this is an incomplete draft) 1 Contents 1 Preface 4 1.1 Relation to other texts . 4 1.2 Acknowledgements . 6 2 Preliminaries 11 2.1 Basic definitions . 11 2.2 Vector spaces . 12 2.3 Bilinear spaces . 21 2.4 Finite-dimensional bilinear spaces . 27 2.5 Real bilinear spaces . 29 2.6 Tensor product . 32 2.7 Algebras . 33 2.8 Tensor algebra . 35 2.9 Magnitude . 35 2.10 Topological spaces . 37 2.11 Topological vector spaces . 39 2.12 Norm spaces . 40 2.13 Total derivative . 44 3 Symmetry groups 50 3.1 General linear group . 50 3.2 Scaling linear group . 51 3.3 Orthogonal linear group . 52 3.4 Conformal linear group . 55 3.5 Affine groups . 55 4 Algebraic structure 56 4.1 Clifford algebra . 56 4.2 Morphisms . 58 4.3 Inverse . 59 4.4 Grading . 60 4.5 Exterior product . 64 4.6 Blades . 70 4.7 Scalar product . 72 4.8 Contraction . 74 4.9 Interplay . 80 4.10 Span . 81 4.11 Dual . 87 4.12 Commutator product . 89 4.13 Orthogonality . 90 4.14 Magnitude . 93 4.15 Exponential and trigonometric functions . 94 2 5 Linear transformations 97 5.1 Determinant . 97 5.2 Pinors and unit-versors . 98 5.3 Spinors and rotors . 104 5.4 Projections . 105 5.5 Reflections . 105 5.6 Adjoint . 107 6 Geometric applications 107 6.1 Cramer’s rule . 108 6.2 Gram-Schmidt orthogonalization . 108 6.3 Alternating forms and determinant .
    [Show full text]
  • Exterior Algebra ΛR Clifford Algebra
    Physics 251 Group Theory Spring 2011 Clifford Algebras Author: Gregory Steele Bowers Exterior Algebra ΛRn The exterior algebra ΛRn consists of the direct sum from 1 to n of the linear vector spaces of differential k-forms on the vector space Rn n 0 1 n n n ΛR = Λ R ⊕ Λ R ⊕ ::: ⊕ Λ R n with the product of the basis vectors feig of R defined as the antisymmetric wedge product ei ^ ej = −ej ^ ei; i 6= j ei ^ ei = 0 The basis for the subspace ΛRk in the exterior algebra is fei1 ^ ei2 ^ ::: ^ eik j1 ≤ i1 < i2 < : : : < ik ≤ n; 0 ≤ k ≤ ng Clifford Algebra C`n n The Clifford algebra C`n is the exterior space ΛR n C`n = ΛR n with the product of basis vectors feig of R defined as the Clifford product eiej = −ejei; i 6= j eiei = 1 The basis for the subspace of differential k-forms ΛkRn in the Clifford algebra is fei1 ei2 ::: eik j1 ≤ i1 < i2 < : : : < ik ≤ n; 0 ≤ k ≤ ng Physics 251 Group Theory Spring 2011 Geometric Product Given two vectors a and b, the Clifford Product can be expressed as ab = a · b + a ^ b From symmetry and antisymmetry of terms it follows that 1 a · b = (ab + ba) 2 1 a ^ b = (ab − ba) 2 Vector division can now be defined, with a−1 = a=a2 Clifford Algebra C`2 The basis vectors spanning the Clifford Algebra C`2 are 1 1 scalar fe1; e2g 2 vectors e1e2 1 bivector and obey the geometric product e1e1 = e2e2 = 1 e1e2 = −e2e1 Elements of this algebra are 4-dimensional multivectors of the form a = a0 + a1e1 + a2e2 + a12e1e2 The above system can compactly handle algebra and rotations for complex numbers in C, and vectors R2.
    [Show full text]
  • Introduction to Geometric Algebra Lecture IV
    Introduction to Geometric Algebra Lecture IV Leandro A. F. Fernandes Manuel M. Oliveira [email protected] [email protected] Visgraf - Summer School in Computer Graphics - 2010 CG UFRGS Lecture IV Checkpoint Visgraf - Summer School in Computer Graphics - 2010 2 Checkpoint, Lecture I Multivector space Non-metric products . The outer product . The regressive product c Visgraf - Summer School in Computer Graphics - 2010 3 Checkpoint, Lecture II Metric spaces . Bilinear form defines a metric on the vector space, e.g., Euclidean metric . Metric matrix Some inner products The scalar product is a particular . Inner product of vectors case of the left and right contractions . Scalar product . Left contraction These metric products are . Right contraction backward compatible for 1-blades Visgraf - Summer School in Computer Graphics - 2010 4 Checkpoint, Lecture II Dualization Undualization By taking the undual, the dual representation of a blade can be correctly mapped back to its direct representation Venn Diagrams Visgraf - Summer School in Computer Graphics - 2010 5 Checkpoint, Lecture III Duality relationships between products . Dual of the outer product . Dual of the left contraction Visgraf - Summer School in Computer Graphics - 2010 6 Checkpoint, Lecture III Some non-linear products . Meet of blades . Join of blades . Delta product of blades Visgraf - Summer School in ComputerVenn GraphicsDiagrams - 2010 7 Today Lecture IV – Mon, January 18 . Geometric product . Versors . Rotors Visgraf - Summer School in Computer Graphics
    [Show full text]
  • Course Notes Geometric Algebra for Computer Graphics∗ SIGGRAPH 2019
    Course notes Geometric Algebra for Computer Graphics∗ SIGGRAPH 2019 Charles G. Gunn, Ph. D.y ∗Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author. Copyright is held by the owner/author(s). SIGGRAPH '19 Courses, July 28 - August 01, 2019, Los Angeles, CA, USA ACM 978-1-4503-6307-5/19/07. 10.1145/3305366.3328099 yAuthor's address: Raum+Gegenraum, Brieselanger Weg 1, 14612 Falkensee, Germany, Email: [email protected] 1 Contents 1 The question 4 2 Wish list for doing geometry 4 3 Structure of these notes 5 4 Immersive introduction to geometric algebra 6 4.1 Familiar components in a new setting . .6 4.2 Example 1: Working with lines and points in 3D . .7 4.3 Example 2: A 3D Kaleidoscope . .8 4.4 Example 3: A continuous 3D screw motion . .9 5 Mathematical foundations 11 5.1 Historical overview . 11 5.2 Vector spaces . 11 5.3 Normed vector spaces . 12 5.4 Sylvester signature theorem . 12 5.5 Euclidean space En ........................... 13 5.6 The tensor algebra of a vector space . 13 5.7 Exterior algebra of a vector space . 14 5.8 The dual exterior algebra . 15 5.9 Projective space of a vector space .
    [Show full text]
  • Geometric Algebra (GA)
    Geometric Algebra (GA) Werner Benger, 2007 CCT@LSU SciViz 1 Abstract • Geometric Algebra (GA) denotes the re-discovery and geometrical interpretation of the Clifford algebra applied to real fields. Hereby the so-called „geometrical product“ allows to expand linear algebra (as used in vector calculus in 3D) by an invertible operation to multiply and divide vectors. In two dimenions, the geometric algebra can be interpreted as the algebra of complex numbers. In extends in a natural way into three dimensions and corresponds to the well-known quaternions there, which are widely used to describe rotations in 3D as an alternative superior to matrix calculus. However, in contrast to quaternions, GA comes with a direct geometrical interpretation of the respective operations and allows a much finer differentation among the involved objects than is achieveable via quaternions. Moreover, the formalism of GA is independent from the dimension of space. For instance, rotations and reflections of objects of arbitrary dimensions can be easily described intuitively and generic in spaces of arbitrary higher dimensions. • Due to the elegance of the GA and its wide applicabililty it is sometimes denoted as a new „fundamental language of mathematics“. Its unified formalism covers domains such as differential geometry (relativity theory), quantum mechanics, robotics and last but not least computer graphics in a natural way. • This talk will present the basics of Geometric Algebra and specifically emphasizes on the visualization of its elementary operations.
    [Show full text]