E Evolution in C and G3

Total Page:16

File Type:pdf, Size:1020Kb

Load more

2 + Quantum state evolution in C and G3 Alexander M. SOIGUINE Abstract: It was shown, [1] - [3], that quantum mechanical qubit states as elements of C 2 can be generalized to elements of even subalgebra G3 of geometric algebra G3 over Euclidian space E3 . The construction critically depends on generalization of formal, unspecified, complex plane to arbitrary variable, but explicitly defined, planes in 3D, and of usual Hopf 3 2 B 2 fibration S S to maps g : g G3 , g 1S generated by arbitrary unit value bivectors B G3 . 2 2 Analysis of the structure of the map G3 C demonstrates that quantum state evolution in C gives only restricted information compared to that in . 1. Introduction 2 Qubits, unit value elements of the Hilbert space C of two dimensional complex vectors, can be 1 generalized to unit value elements I S of even subalgebra of geometric algebra over Euclidian space . I called such generalized qubits g -qubits [1]. Some minimal information about and is necessary. Algebraically, is linear space with canonical basis 1,e1,e2 ,e3,e2e3,e3e1,e1e2 ,e1e2e3, where 1 is unit value scalar,ei are orthonormal basis vectors in , eie j are oriented, mutually orthogonal unit value areas (bivectors) spanned by ei and e as edges, with orientation defined by rotation to by angle ; and e e e is unit value j 2 1 2 3 oriented volume spanned by ordered edges e1 , e2 and e3. Subalgebra is spanned by scalar 1 and basis bivectors: 1,e2e3,e3e1,e1e2 . Variables and in IS G3 are scalars, I S is a unit size oriented area, bivector, lying in an arbitrary given plane S E3 . Bivector is linear combination of basis bivectors ei e j , see Fig.1a. 1 This sum bears the sense “something and something”. It is not a sum of geometrically similar elements giving another element of the same type, see [3], [9]. 1 Fig.1a Fig.1b E3 It was explained in [4], [5] that elements I S only differ from what is traditionally called “complex numbers” by the fact that is an arbitrary, though explicitly defined, plane in . Putting it simply, are “complex numbers” depending on E2 embedded into . Traditional “imaginary unit” i is actually associated with some unspecified I S – everything is going on in one tacit fixed plane, not in 3D world. Usually i is considered just as a “number” with additional algebraic property i 2 1. That may be a source of ambiguities, as it happens in quantum mechanics. 2 I will denote unit value oriented volume by I 3 . It has the property I3 1. Actually, there always are two options to create oriented unit volume, depending on the order of basis vectors in the product. They correspond to the two types of handedness – left and right screw handedness. In Fig.1a the variant of right screw handedness is shown. It is geometrically obvious that eie j e jei (bivector flips, changes orientation to the opposite, in swapping the edge vectors). Then changing of handedness, for example by e1e2e3 e2e1e3 , gives e2e1e3 e1e2e3 I3 . Any basis vector is conjugate (conjugation means multiplication by ), or dual, to a basis bivector and inverse. For example I3e2e3 e2e3I3 e1 . By multiplying these equations from left or right by we get e2e3 I3e1 e1I3 . Such duality holds for arbitrary, not just basis, vectors and bivectors. Any vector e1e2e3 b is conjugate to some bivector: b I3B BI 3 and for any bivector B there exists such that B I3b bI3 . Good to remember that in vector and bivector are in handedness opposite to while in they are in the same handedness as . One can also think about as a right (left) single thread screw helix of the height one. In this way I3 isS left E (right)3 screw helix. All above remains true (see Fig.1b) if we replace basis bivectors e2e3,e3e1,e1e2 by an arbitrary triple of unit bivectors B1, B2, B3 satisfying the same multiplication rules which are valid for (see Fig.2, right screw handedness assumed): B1B2 B3 ; B1B3 B2 ; B2B3 B1 (1.1) 2 Fig.2 2 3 2. Parameterization of unit value elements in G3 and C by points of S Let’s take a -qubit: 2 2 IS b1B1 b2B2 b3B3 1B1 2B2 3B3,i bi , 1, 2 2 2 b1 b2 b3 1 I will use notation so,,S for such elements. They can be considered as points on unit radius sphere in the sense that any point ,1,2 ,3 parameterizes a -qubit. g A pure qubit state in terms of conventional quantum mechanics is two dimensional unit value vector with complex components: z 1 0 1 2 2 ~ ~ 1 2 z1 z2 , z1 z2 z1z1 z2 z2 1, zk zk iz k ,k 1,2 z2 0 1 We can also think about such pure qubit states as points on S 3 because: 3 1 2 1 2 2 2 ~ ~ 1 2 2 2 1 2 2 2 S z1 , z1 , z2 , z2 {z (z1, z2 )C ; z z1z1 z2 z2 z1 z1 z2 z2 1} (2.1) Explicit relations, based on their parameterization by points, between elements and elements so,,S can be established through the following construction2. Let basis bivector B1 is chosen as defining the complex plane S , then we have (see multiplication rules (1.1)): 2 Though both and can be parametrized by points of , it is not correct to say that 2 2 {z (z1, z2 )C ; z 1} is sphere or -qubit is sphere . 3 so(,,S) ( 1B1) 2B1B3 3B3 ( 1B1) (3 2B1)B3 Hence we get the map: z1 i so,,S 1 1 , where i B 1 1 z2 3 i2 In the similar way, for two other selections of complex plane we get: z2 i so, , S 1 2 ,i B , 2 2 z2 1 i3 z 3 i and so,,S 1 3 ,i B 3 3 z2 2 i1 Bi i i So we have three different maps so, , S(z1, z2 ) defined by explicitly declared complex planes Bi satisfying (1.1): so,,S i 1 ,i B so(, , S) B B B 1 1 1 2 2 3 3 3 i2 g 1B1 (3 2B1)B3 i 2 ,i B2 (2.2) 2B2 (1 3B2 )B1 1 i3 B ( B )B i3 3 3 2 1 3 2 ,i B3 2 i1 There exists infinite number of options to select the triple Bi . It means that to recover a -qubit z so,,S in 3D associated with 1 it is necessary, firstly, to define which bivector B in 3D i1 z2 should be taken as defining “complex” plane and then to choose another bivector B , orthogonal to i2 B . The third bivector B , orthogonal to both B and B , is then defined by the first two by i1 i3 i1 i2 orientation (handedness, right screw in the used case ): I B I B I B I . 3 i1 3 i2 3 i3 3 The conclusion is that to each single element (2.1) there corresponds infinite number of elements depending on choosing of a triple of orthonormal bivectors in 3D satisfying B , B , B (1.1), and associating1 2 one3 of them with complex plane. This allows constructing map, fibration 2 G3 C restricted to unit value elements. 4 3. Fiber bundle Take general definition of fiber bundle as a set E, M,,G, F where E is bundle (or total) space; M - the base space; F - standard fiber; G - Lie group which acts effectively on ; - bundle projection: 1 : E M , such that each space Fx (x) , fiber at xM , is homeomorphic to standard fiber . We can think about the map as a fiber bundle. In the current case, the fiber bundle will have so(,,S) g G3 : g 1 as total space and as base 2 2 G | 3 C | 3 :G | 3 C | 3 space. I will denote them as 3 S and S respectively. The projection 3 S S depends on which particular Bi is taken from an arbitrary triple satisfying (1.1) as associated complex plane of complex vectors of C 2 and explicitly given by (2.2), so we should write Bi 2 :G | 3 C | 3 3 S S . Bi i i By some reasons that will be explainedso, a bit, S later I will(z 1use, z2 )complex plane associated with B3 , so by (2.2) the projection is: i 3 : so(, , S) 1B1 2B2 3B3 (3.1) 2 i1 x1 iy1 2 Then for any z C | 3 the fiber in is comprised of all elements S x2 iy2 Fz x1 y2B1 x2B2 y1B3 with an arbitrary triple of orthonormal bivectors in 3D satisfying (1.1). That particularly means that standard fiber is equivalent to the group of rotations of the triple y2B1, x2B2 , y1B3 as a whole: Fig 3a. Fig 3b. Two example sections of a fiber. 3b received from 3a by 90 deg. counterclockwise rotation around vertical axis B1, B2, B3 2 2 {z (z1, z2 )C ; z 1} 5 All such rotations in are also identified by elements of since for any bivector B the result of its rotation is 3 (see, for example [6], [7]): ~ ~ ~ so( ,, S) Bso( ,,S) , where so( ,, S) ( 1B1 2B2 3B3) 1B1 2B2 3B3 So, standard fiber is identified as and composition of rotations is: I I I I I I ~ I I e S2 e S1 Be S1 e S2 e S1 e S2 Be S1 e S2 B G3 | 3 3 2 SG | 3 C | 3 All that means that the fibration 3 S S is principal fiber bundle with standard fiber and the group acting on it is the group of (right) multiplications by elements of .
Recommended publications
  • Introduction to Linear Bialgebra

    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, [email protected] 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 [email protected], [email protected], [email protected]. INTRODUCTION TO LINEAR BIALGEBRA W. B. Vasantha Kandasamy Department of Mathematics Indian Institute of Technology, Madras Chennai – 600036, India e-mail: [email protected] web: http://mat.iitm.ac.in/~wbv Florentin Smarandache Department of Mathematics University of New Mexico Gallup, NM 87301, USA e-mail: [email protected] K. Ilanthenral Editor, Maths Tiger, Quarterly Journal Flat No.11, Mayura Park, 16, Kazhikundram Main Road, Tharamani, Chennai – 600 113, India e-mail: [email protected] 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.
  • 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.
  • Determinant Notes

    Determinant Notes

    68 UNIT FIVE DETERMINANTS 5.1 INTRODUCTION In unit one the determinant of a 2× 2 matrix was introduced and used in the evaluation of a cross product. In this chapter we extend the definition of a determinant to any size square matrix. The determinant has a variety of applications. The value of the determinant of a square matrix A can be used to determine whether A is invertible or noninvertible. An explicit formula for A–1 exists that involves the determinant of A. Some systems of linear equations have solutions that can be expressed in terms of determinants. 5.2 DEFINITION OF THE DETERMINANT a11 a12 Recall that in chapter one the determinant of the 2× 2 matrix A = was a21 a22 defined to be the number a11a22 − a12 a21 and that the notation det (A) or A was used to represent the determinant of A. For any given n × n matrix A = a , the notation A [ ij ]n×n ij will be used to denote the (n −1)× (n −1) submatrix obtained from A by deleting the ith row and the jth column of A. The determinant of any size square matrix A = a is [ ij ]n×n defined recursively as follows. Definition of the Determinant Let A = a be an n × n matrix. [ ij ]n×n (1) If n = 1, that is A = [a11], then we define det (A) = a11 . n 1k+ (2) If na>=1, we define det(A) ∑(-1)11kk det(A ) k=1 Example If A = []5 , then by part (1) of the definition of the determinant, det (A) = 5.
  • Linear Algebra for Dummies

    Linear Algebra for Dummies

    Linear Algebra for Dummies Jorge A. Menendez October 6, 2017 Contents 1 Matrices and Vectors1 2 Matrix Multiplication2 3 Matrix Inverse, Pseudo-inverse4 4 Outer products 5 5 Inner Products 5 6 Example: Linear Regression7 7 Eigenstuff 8 8 Example: Covariance Matrices 11 9 Example: PCA 12 10 Useful resources 12 1 Matrices and Vectors An m × n matrix is simply an array of numbers: 2 3 a11 a12 : : : a1n 6 a21 a22 : : : a2n 7 A = 6 7 6 . 7 4 . 5 am1 am2 : : : amn where we define the indexing Aij = aij to designate the component in the ith row and jth column of A. The transpose of a matrix is obtained by flipping the rows with the columns: 2 3 a11 a21 : : : an1 6 a12 a22 : : : an2 7 AT = 6 7 6 . 7 4 . 5 a1m a2m : : : anm T which evidently is now an n × m matrix, with components Aij = Aji = aji. In other words, the transpose is obtained by simply flipping the row and column indeces. One particularly important matrix is called the identity matrix, which is composed of 1’s on the diagonal and 0’s everywhere else: 21 0 ::: 03 60 1 ::: 07 6 7 6. .. .7 4. .5 0 0 ::: 1 1 It is called the identity matrix because the product of any matrix with the identity matrix is identical to itself: AI = A In other words, I is the equivalent of the number 1 for matrices. For our purposes, a vector can simply be thought of as a matrix with one column1: 2 3 a1 6a2 7 a = 6 7 6 .
  • Molecular Symmetry

    Molecular Symmetry

    Molecular Symmetry Symmetry helps us understand molecular structure, some chemical properties, and characteristics of physical properties (spectroscopy) – used with group theory to predict vibrational spectra for the identification of molecular shape, and as a tool for understanding electronic structure and bonding. Symmetrical : implies the species possesses a number of indistinguishable configurations. 1 Group Theory : mathematical treatment of symmetry. symmetry operation – an operation performed on an object which leaves it in a configuration that is indistinguishable from, and superimposable on, the original configuration. symmetry elements – the points, lines, or planes to which a symmetry operation is carried out. Element Operation Symbol Identity Identity E Symmetry plane Reflection in the plane σ Inversion center Inversion of a point x,y,z to -x,-y,-z i Proper axis Rotation by (360/n)° Cn 1. Rotation by (360/n)° Improper axis S 2. Reflection in plane perpendicular to rotation axis n Proper axes of rotation (C n) Rotation with respect to a line (axis of rotation). •Cn is a rotation of (360/n)°. •C2 = 180° rotation, C 3 = 120° rotation, C 4 = 90° rotation, C 5 = 72° rotation, C 6 = 60° rotation… •Each rotation brings you to an indistinguishable state from the original. However, rotation by 90° about the same axis does not give back the identical molecule. XeF 4 is square planar. Therefore H 2O does NOT possess It has four different C 2 axes. a C 4 symmetry axis. A C 4 axis out of the page is called the principle axis because it has the largest n . By convention, the principle axis is in the z-direction 2 3 Reflection through a planes of symmetry (mirror plane) If reflection of all parts of a molecule through a plane produced an indistinguishable configuration, the symmetry element is called a mirror plane or plane of symmetry .
  • (II) I Main Topics a Rotations Using a Stereonet B

    (II) I Main Topics a Rotations Using a Stereonet B

    GG303 Lecture 11 9/4/01 1 ROTATIONS (II) I Main Topics A Rotations using a stereonet B Comments on rotations using stereonets and matrices C Uses of rotation in geology (and engineering) II II Rotations using a stereonet A Best uses 1 Rotation axis is vertical 2 Rotation axis is horizontal (e.g., to restore tilted beds) B Construction technique 1 Find orientation of rotation axis 2 Find angle of rotation and rotate pole to plane (or a linear feature) along a small circle perpendicular to the rotation axis. a For a horizontal rotation axis the small circle is vertical b For a vertical rotation axis the small circle is horizontal 3 WARNING: DON'T rotate a plane by rotating its dip direction vector; this doesn't work (see handout) IIIComments on rotations using stereonets and matrices Advantages Disadvantages Stereonets Good for visualization Relatively slow Can bring into field Need good stereonets, paper Matrices Speed and flexibility Computer really required to Good for multiple rotations cut down on errors A General comments about stereonets vs. rotation matrices 1 With stereonets, an object is usually considered to be rotated and the coordinate axes are held fixed. 2 With rotation matrices, an object is usually considered to be held fixed and the coordinate axes are rotated. B To return tilted bedding to horizontal choose a rotation axis that coincides with the direction of strike. The angle of rotation is the negative of the dip of the bedding (right-hand rule! ) if the bedding is to be rotated back to horizontal and positive if the axes are to be rotated to the plane of the tilted bedding.
  • Determinants Math 122 Calculus III D Joyce, Fall 2012

    Determinants Math 122 Calculus III D Joyce, Fall 2012

    Determinants Math 122 Calculus III D Joyce, Fall 2012 What they are. A determinant is a value associated to a square array of numbers, that square array being called a square matrix. For example, here are determinants of a general 2 × 2 matrix and a general 3 × 3 matrix. a b = ad − bc: c d a b c d e f = aei + bfg + cdh − ceg − afh − bdi: g h i The determinant of a matrix A is usually denoted jAj or det (A). You can think of the rows of the determinant as being vectors. For the 3×3 matrix above, the vectors are u = (a; b; c), v = (d; e; f), and w = (g; h; i). Then the determinant is a value associated to n vectors in Rn. There's a general definition for n×n determinants. It's a particular signed sum of products of n entries in the matrix where each product is of one entry in each row and column. The two ways you can choose one entry in each row and column of the 2 × 2 matrix give you the two products ad and bc. There are six ways of chosing one entry in each row and column in a 3 × 3 matrix, and generally, there are n! ways in an n × n matrix. Thus, the determinant of a 4 × 4 matrix is the signed sum of 24, which is 4!, terms. In this general definition, half the terms are taken positively and half negatively. In class, we briefly saw how the signs are determined by permutations.
  • Euler Quaternions

    Euler Quaternions

    Four different ways to represent rotation my head is spinning... The space of rotations SO( 3) = {R ∈ R3×3 | RRT = I,det(R) = +1} Special orthogonal group(3): Why det( R ) = ± 1 ? − = − Rotations preserve distance: Rp1 Rp2 p1 p2 Rotations preserve orientation: ( ) × ( ) = ( × ) Rp1 Rp2 R p1 p2 The space of rotations SO( 3) = {R ∈ R3×3 | RRT = I,det(R) = +1} Special orthogonal group(3): Why it’s a group: • Closed under multiplication: if ∈ ( ) then ∈ ( ) R1, R2 SO 3 R1R2 SO 3 • Has an identity: ∃ ∈ ( ) = I SO 3 s.t. IR1 R1 • Has a unique inverse… • Is associative… Why orthogonal: • vectors in matrix are orthogonal Why it’s special: det( R ) = + 1 , NOT det(R) = ±1 Right hand coordinate system Possible rotation representations You need at least three numbers to represent an arbitrary rotation in SO(3) (Euler theorem). Some three-number representations: • ZYZ Euler angles • ZYX Euler angles (roll, pitch, yaw) • Axis angle One four-number representation: • quaternions ZYZ Euler Angles φ = θ rzyz ψ φ − φ cos sin 0 To get from A to B: φ = φ φ Rz ( ) sin cos 0 1. Rotate φ about z axis 0 0 1 θ θ 2. Then rotate θ about y axis cos 0 sin θ = ψ Ry ( ) 0 1 0 3. Then rotate about z axis − sinθ 0 cosθ ψ − ψ cos sin 0 ψ = ψ ψ Rz ( ) sin cos 0 0 0 1 ZYZ Euler Angles φ θ ψ Remember that R z ( ) R y ( ) R z ( ) encode the desired rotation in the pre- rotation reference frame: φ = pre−rotation Rz ( ) Rpost−rotation Therefore, the sequence of rotations is concatentated as follows: (φ θ ψ ) = φ θ ψ Rzyz , , Rz ( )Ry ( )Rz ( ) φ − φ θ θ ψ − ψ cos sin 0 cos 0 sin cos sin 0 (φ θ ψ ) = φ φ ψ ψ Rzyz , , sin cos 0 0 1 0 sin cos 0 0 0 1− sinθ 0 cosθ 0 0 1 − − − cφ cθ cψ sφ sψ cφ cθ sψ sφ cψ cφ sθ (φ θ ψ ) = + − + Rzyz , , sφ cθ cψ cφ sψ sφ cθ sψ cφ cψ sφ sθ − sθ cψ sθ sψ cθ ZYX Euler Angles (roll, pitch, yaw) φ − φ cos sin 0 To get from A to B: φ = φ φ Rz ( ) sin cos 0 1.
  • Math 2331 – Linear Algebra 6.2 Orthogonal Sets

    Math 2331 – Linear Algebra 6.2 Orthogonal Sets

    6.2 Orthogonal Sets Math 2331 { Linear Algebra 6.2 Orthogonal Sets Jiwen He Department of Mathematics, University of Houston [email protected] math.uh.edu/∼jiwenhe/math2331 Jiwen He, University of Houston Math 2331, Linear Algebra 1 / 12 6.2 Orthogonal Sets Orthogonal Sets Basis Projection Orthonormal Matrix 6.2 Orthogonal Sets Orthogonal Sets: Examples Orthogonal Sets: Theorem Orthogonal Basis: Examples Orthogonal Basis: Theorem Orthogonal Projections Orthonormal Sets Orthonormal Matrix: Examples Orthonormal Matrix: Theorems Jiwen He, University of Houston Math 2331, Linear Algebra 2 / 12 6.2 Orthogonal Sets Orthogonal Sets Basis Projection Orthonormal Matrix Orthogonal Sets Orthogonal Sets n A set of vectors fu1; u2;:::; upg in R is called an orthogonal set if ui · uj = 0 whenever i 6= j. Example 82 3 2 3 2 39 < 1 1 0 = Is 4 −1 5 ; 4 1 5 ; 4 0 5 an orthogonal set? : 0 0 1 ; Solution: Label the vectors u1; u2; and u3 respectively. Then u1 · u2 = u1 · u3 = u2 · u3 = Therefore, fu1; u2; u3g is an orthogonal set. Jiwen He, University of Houston Math 2331, Linear Algebra 3 / 12 6.2 Orthogonal Sets Orthogonal Sets Basis Projection Orthonormal Matrix Orthogonal Sets: Theorem Theorem (4) Suppose S = fu1; u2;:::; upg is an orthogonal set of nonzero n vectors in R and W =spanfu1; u2;:::; upg. Then S is a linearly independent set and is therefore a basis for W . Partial Proof: Suppose c1u1 + c2u2 + ··· + cpup = 0 (c1u1 + c2u2 + ··· + cpup) · = 0· (c1u1) · u1 + (c2u2) · u1 + ··· + (cpup) · u1 = 0 c1 (u1 · u1) + c2 (u2 · u1) + ··· + cp (up · u1) = 0 c1 (u1 · u1) = 0 Since u1 6= 0, u1 · u1 > 0 which means c1 = : In a similar manner, c2,:::,cp can be shown to by all 0.
  • MATH 304 Linear Algebra Lecture 24: Scalar Product. Vectors: Geometric Approach

    MATH 304 Linear Algebra Lecture 24: Scalar Product. Vectors: Geometric Approach

    MATH 304 Linear Algebra Lecture 24: Scalar product. Vectors: geometric approach B A B′ A′ A vector is represented by a directed segment. • Directed segment is drawn as an arrow. • Different arrows represent the same vector if • they are of the same length and direction. Vectors: geometric approach v B A v B′ A′ −→AB denotes the vector represented by the arrow with tip at B and tail at A. −→AA is called the zero vector and denoted 0. Vectors: geometric approach v B − A v B′ A′ If v = −→AB then −→BA is called the negative vector of v and denoted v. − Vector addition Given vectors a and b, their sum a + b is defined by the rule −→AB + −→BC = −→AC. That is, choose points A, B, C so that −→AB = a and −→BC = b. Then a + b = −→AC. B b a C a b + B′ b A a C ′ a + b A′ The difference of the two vectors is defined as a b = a + ( b). − − b a b − a Properties of vector addition: a + b = b + a (commutative law) (a + b) + c = a + (b + c) (associative law) a + 0 = 0 + a = a a + ( a) = ( a) + a = 0 − − Let −→AB = a. Then a + 0 = −→AB + −→BB = −→AB = a, a + ( a) = −→AB + −→BA = −→AA = 0. − Let −→AB = a, −→BC = b, and −→CD = c. Then (a + b) + c = (−→AB + −→BC) + −→CD = −→AC + −→CD = −→AD, a + (b + c) = −→AB + (−→BC + −→CD) = −→AB + −→BD = −→AD. Parallelogram rule Let −→AB = a, −→BC = b, −−→AB′ = b, and −−→B′C ′ = a. Then a + b = −→AC, b + a = −−→AC ′.
  • The Structuring of Pattern Repeats in the Paracas Necropolis Embroideries

    The Structuring of Pattern Repeats in the Paracas Necropolis Embroideries

    University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Textile Society of America Symposium Proceedings Textile Society of America 1988 Orientation And Symmetry: The Structuring Of Pattern Repeats In The Paracas Necropolis Embroideries Mary Frame University of British Columbia Follow this and additional works at: https://digitalcommons.unl.edu/tsaconf Part of the Art and Design Commons Frame, Mary, "Orientation And Symmetry: The Structuring Of Pattern Repeats In The Paracas Necropolis Embroideries" (1988). Textile Society of America Symposium Proceedings. 637. https://digitalcommons.unl.edu/tsaconf/637 This Article is brought to you for free and open access by the Textile Society of America at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in Textile Society of America Symposium Proceedings by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. 136 RESEARCH-IN-PROGRESS REPORT ORIENTATION AND SYMMETRY: THE STRUCTURING OF PATTERN REPEATS IN THE PARACAS NECROPOLIS EMBROIDERIES MARY FRAME RESEARCH ASSOCIATE, INSTITUTE OF ANDEAN STUDIES 4611 Marine Drive West Vancouver, B.C. V7W 2P1 The most extensive Peruvian fabric remains come from the archeological site of Paracas Necropolis on the South Coast of Peru. Preserved by the dry desert conditions, this cache of 429 mummy bundles, excavated in 1926-27, provides an unparal- leled opportunity for comparing the range and nature of varia- tions in similar fabrics which are securely related in time and space. The bundles are thought to span the time period from 500-200 B.C. The most numerous and notable fabrics are embroideries: garments that have been classified as mantles, tunics, wrap- around skirts, loincloths, turbans and ponchos.
  • Rotation Matrix - Wikipedia, the Free Encyclopedia Page 1 of 22

    Rotation Matrix - Wikipedia, the Free Encyclopedia Page 1 of 22

    Rotation matrix - Wikipedia, the free encyclopedia Page 1 of 22 Rotation matrix From Wikipedia, the free encyclopedia In linear algebra, a rotation matrix is a matrix that is used to perform a rotation in Euclidean space. For example the matrix rotates points in the xy -Cartesian plane counterclockwise through an angle θ about the origin of the Cartesian coordinate system. To perform the rotation, the position of each point must be represented by a column vector v, containing the coordinates of the point. A rotated vector is obtained by using the matrix multiplication Rv (see below for details). In two and three dimensions, rotation matrices are among the simplest algebraic descriptions of rotations, and are used extensively for computations in geometry, physics, and computer graphics. Though most applications involve rotations in two or three dimensions, rotation matrices can be defined for n-dimensional space. Rotation matrices are always square, with real entries. Algebraically, a rotation matrix in n-dimensions is a n × n special orthogonal matrix, i.e. an orthogonal matrix whose determinant is 1: . The set of all rotation matrices forms a group, known as the rotation group or the special orthogonal group. It is a subset of the orthogonal group, which includes reflections and consists of all orthogonal matrices with determinant 1 or -1, and of the special linear group, which includes all volume-preserving transformations and consists of matrices with determinant 1. Contents 1 Rotations in two dimensions 1.1 Non-standard orientation