Shear modulations and icosahedral twins
|
|
- Valentine Stone
- 5 years ago
- Views:
Transcription
1 We Microsc. Microanal. Microstruct. 1 (1990) 503 OCTOBER/DECEMBER 1990, PAGE 503 Classification Physics Abstracts J 61.70N Shear modulations and icosahedral twins Michel Duneau Centre de Physique Théorique, Ecole Polytechnique, Palaiseau Cedex, France (Received October 01, 1990; accepted January 15, 1991) Résumé Nous montrons que si deux réseaux La et Lb sont liés par un cisaillement, il existe une transformation displacive simple, correspondant à une modulation périodique de La, qui transforme La en Lb. Nous considérons les maclages icosaèdriques récemment observés dans les alliages AlFeMnSi et montrons qu ils sont liés par des rotations équivalentes au produit de seulement deux tels cisaillements Abstract. show that given two lattices La and Lb, related be a shear transformation, there exists a simple displacive transformation, corresponding to a periodic modulation of La, which transforms La into Lb. We consider recently observed icosahedral twinnings in AlFeMnSi alloys and show that they are related by rotations equivalent to the product of only two such shear transformations. 1. Introduction. Shear transformations are in some the most simple transformations between different lattices. From a geometrical point of a view they are characterized by a direction, an invariant plane and a magnitude. Only in specific situations, such as the martinsitic transformation, do these transformations correspond to real displacements of atoms. In other situations, they are involved in purely geometrical relations between two lattices related by a transition, whereas the actual transformation is believed to be displacive. This is the case of the "second shear" in the martinsitic transformation. In this paper we show that if two lattices are related by a macroscopic linear shear transformation, a simple displacive transformation between these lattices can be devised. This bounded transformation involves a periodic displacement field of small amplitude in such a way that the second lattice turns out to be a modulation of the first one. Such a situation is however restricted to particular pairs of lattices. Generally, two lattices of equal density are related by the combination of 4 successive shear transformations. In this case a displacive transformation can still be performed but the corresponding modulation is far more complex and the displacement field is usually quasiperiodic. Article available at or
2 504 We dont claim that actual displacements are exactly those given those by our construction. Relaxation processes normally would change the trajectories of atoms. But the proposed solutions for displacive transformations are in some sense the most simple and could be associated to simple soft modes. Even if a structural transformation is not observed, the relative orientations of grains in a polycrystalline system can be analysed along the same lines. In the case of twinnings, a generic rotation similarly corresponds to 4 different shears. Of specific interest are the rotations for which only two shear transformations monitor an equivalent displacive transformation. In other words, particular orientational relationships are pointed out by a requirement of simplicity of an actual or potential transformation. In this respect we show that the recently observed icosahedral twins in AlFeMnSi alloys are associated to simple displacive transformations observed icosahedral twins in AlFeMnSi alloys are associated to simple displacive transformations involving only two successive simple modulations. 2. Shear transformation and shear modulation. In this section we show that shear transformations, which are linear and therefore macroscopic transformations, have simple local and displacive analogs called hereafter shear modulations. Let La AZ3 and Lb B Z3 denote two lattices with respective basis {al, a2, a3} and {bl, b2, b3} given by ai Aei and bi Bei (i 1, 2, 3) where fel, e2, e3} is the standard basis of the 3- dimensional space. A and B are 3 x 3 matrices with non vanishing determinants and if La and Lb have the same density we have det (A) ±det (B). Actually, the matrices A and B are not uniquely defined by the lattices La and Lb and similarly, the a-basis and b-basis are not unique. All other equivalent description involve modular matrices U and V, i.e. with integer entries and determinant equal to ±1, in such a way that La AUZ3 and Lb BVZ3. The corresponding basis are respectively {al, a2, 03B13}, given by ai AUei, and {03B21, 32, 03B23}, given by 3i B Vei ( i 1, 2, 3). We shall first consider pairs of lattices La and Lb related by simple shear transformations. By this we mean that Lb SLa where the linear transformation S has the following property: La and Lb have respective basis {al, a2, 03B13} and f,81, 03B22, 03B23} such that where stand S2 are two parameters giving the amplitude of the shear transformation, the direction of which is given by the lattice direction a3 (33. These particular basis are associated, as mentioned above, to particular modular matrices U and V and it follows from (2.1) that Therefore we have BV AUS and consequently the transition matrix between La and 4 reads
3 The 505 Such a shear transformation obviously preserves density since det (S) 1. The shear transformation has an invariant plane P such that SPP which is generated by a3 and s2al - Sla2. P is not in general a lattice plane of La, but if SI and s2 are both rational numbers. Any lattice point x of La reads x Exs as AUX, where X is a column vector X with integer entries.ci, X2 and X3. In view of (2.1) the mapping S transforms a lattice point x 03A3xi03B1i of La into the lattice point y 03A3xi03B2i BVX of Lb. The coordinates Y of y in the a-basis satisfy y AUY from which we easily derive Obvioulsy the distance between x and y S(x) is not bounded since Now, assuming that La and Lb are related by a such a simple shear transformation, we show that a simple transformation from La to Lb can be performed by means of bounded displacements: this means that there exists a global mapping E from La to Lb, that well call shear modulation for obvious reasons, such that for ail x in L the distance between x and z E(x) in Lb remains bounded. Any lattice point x Exiai of La can be decomposed in the /?-basis: with - Fig. 1. white lattice L, generated by {al, 03B12}, is transformed into L generated by 1 a 1 a2 + s03b11}. The shear transformation S, represented by dotted arrows is not bounded, while the shear modulation E, represented by black arrows, is bounded. So the third coordinate y3 is not, in general, an integer (since x is not a lattice point of Lb). If Rnd(x) denotes the round function, i.e. Rnd(x) n if n-1/2 x n+1/2, then the point
4 506 defined by z x103b21 + x203b22+rnd(x3 - SIX1 - S2X2),33 belongs to the lattice Lb. Furthermore the difference between x and z 03A3(x) is given by Where Frac(x) x-rnd(x) is a function with value between -1/2 and 1/2. So the distance between x and z is always bounded by ~03B13~/2~03B23~/2 (see Fig. 1). It was proved in [2] that the shear modulation E:x --+ z from La to Lb is actually one-to-one and can be extended to a periodic piecewise linear mapping on the whole physical space. E differs from the identiy mapping by a bounded displacement d : where {x1, X2, x3} are the coordinates of x in the a-basis of La. Since the Frac function is periodic with period 1, Frac(x + n) Frac (x), the displacement field d(x) is a periodic modulation field which reads d(x)frac(q.x)03b13 for some q in the reciprocal space. Finally, Lb can be considered as a periodic modulation of La, although the period of d is generally incommensurate with La. Now let La AZ3 and Lb BZ3 be any two lattices with equal density (det A det B). The linear transformation BA-1 from La to Lb is represented by the matrix T A-1 B in the natural basis of La and det T±1. In general, these lattices will not be related by a unique displacive transformation as above, even with the free choice of the modular matrices U and V : there are not enough continuous of shear transforma- parameters. But the transition matrices T can be decomposed into a product tions. More precisely, it is proved in [2] that there exists a modular matrix U, with integer entries and determinant ±1, and at most 4 shear transformations So, Sl, S2 and S3 such that (compare to (2.3)) where Usually, the modular matrix is the identity matrix but for particular transition matrices, a change of basis, performed by U, is necessary. Once the transition matrix T is decomposed into a product of shear transformations we can apply the above results to build a bounded one to one mapping E between La and Lb. This is achieved simply by replacing each linear shear transformation Si, associated to the matrix Si, by the corresponding bounded shear modulation E; :03A3 EoE3E2Ei. The resulting displacement field d(x) is defined by 03A3(x) x + d(x). However this modulation is far more complicated: in particular d involves as many frequencies {qo, q3, q2, q1} as shears transformations in the decomposition. As a consequence the modulation is generally quasiperiodic.
5 The 507 The decomposition (2.11) can be obtained by an explicit algorithm. For simplicity, we only give here the 2-dimensional analog of this procedure: if T is a 2 x 2 matrix with determinant ±1, there exist a 2 x 2 modular matrix U and at most 3 shear transformations So, SI and S2 such that where Actually the product of shear matrices reads The three parameters s0,s1 and s2 are easily derived from the entries of T. Notice that a modular matrix U, different from the identity, is needed if T2i 0; actually, if U I and T2l 0, we get 82 0 which would suppose that Tll T22 1. If La and Lb denote the two square lattices related by a 7r/4 rotation, T is simply the 7r/4 rotation and the above decomposition reads Fig quasiperiodic one to one mapping between the two square lattices at 7r/4. If x xlal + x2a2 is in La and y ylbl + Y2b2 is in 4 the corresponding bounded one to one mapping from La to Lb (see Fig. 2) is given by Remark Such bounded one to one mappings instance the case of two square lattices La and 4 in the plane between lattices are not obvious. Consider for with a 7r/4 relative orientation. A
6 508 natural candidate for such a map consists in mapping a point x of La onto the origin y of the square of Lb which contains x. However, squares of Lb may contain 0, 1 or 2 points of La so that the one to one property cannot be satisfied. The number of shear transformations, 4 in 3D and 3 in 2D, is a maximum. In 3D a transition matrix T A- B involves 8 independent continuous parameters because det[t]±1. Since each shear transformation involves only 2 parameters, four of them must be combined to cover all cases. But, for certain lattices and transition matrices the decomposition may involves less shear transformations. In view of the decomposition (2.11) these cases correspond to at least one shear transformation being equal to the identity. This reduction is exceptional and we think that it may have an important physical meaning by specifying particular orientational relationships. For instance if Lb R La, where R is a rotation, the transition matrix is T A -1 B A-1 RA and the decomposition reads A -1 RA USoS3S2 SI. The point is that for exceptional rotations R, the decomposition may involve only 3 or even 2 shear transformations. This is actually observed in the case of icosahedral twinnings as we show in next section. 3. Icosahedral twins. In this section we show that icosahedral twins of cubic lattices, i.e. twins related by a 21r/5 rotation can be viewed as around a pseudo 5-fold axis of type 103C40> (r is the golden mean (1 + 5)/2), corresponding to a coincidence lattice, up to simple shear transformations (see also [3]). Let al (1, 0) and a2(1/2, 3/2) denote the generators of the 2D-lattice L corresponding to the (111) -plane of a cubic lattice of convenient parameter. Then where A 1 1/2 and Z2 is the standard square lattice. Let Aa denote the sub-lattice of L spanned by al 2ai + 2a2 and a2 a2. Thus Aa is of index 2 in L and can be obtained as follows: Now we consider a lattice A a which is deduced from Aa by a shear transformation sa which transforms the basis {03B11, 03B12} into {03B1 1, 03B1 2} : a 03B11 and a 03B B12. Consequently Similarly let Ab denote the sub-lattice of L spanned by (31 4ai - a2 and,q2 2aI. Thus Ab is of index 2 in L and can be obtained as follows: A lattice b is derived from Ab by a shear transformation Sb which transforms the basis {(3t, 03B22} into {,6l 03B2 2} : 03B2 1 ( and ( Therefore
7 Notice 509 Notice that a and b have equal density since det(m) det(n) 2. The point is that b can be deduced from a by a mere rotation; this can be checked by computing the following norms and scalar products: 03B1 1 1,3 l 23, 03B1 2 03B2 2 2 and (03B1 1, 03B1 2) (03B2 1, 03B2 2) 603C4-3. More precisely if follows from the above definition that A b AN (SbS-1a) M-1 A-1 a. A simple computation gives the transition matrix which is a rotation r of angle Arccos((303C4-2)/4) Arcsin(03C43/4) ~ Such orientation relations between grains of cubic systems have been observed in rapidly quenched alloys of Al75Mn15-xFexSi10 (see [1] ) with x 5 or 10. As pointed out in [1], this rotation around an [111] axis of a cubic lattice is equivalent to a 203C0/5 rotation around the pseudo "five-fold axis" 103C40>. More precisely, a five-fold rotation around [103C40] generates five different variants of the cubic system. Any two of them share a three-fold axis and they are related by the above rotation. Fig that since 5/3 is a good approximant of r,,ql therefore b is, in some sense, almost a sub-lattice of L. r03b11 is very close to 03B21 4at - a2 and
8 510 Acknowledgements. Part of this work is closely related with previous works with C. Oguey to them for many helpful and constructive discussions. and A. Thalal. 1 am indebted References [1] BENDERSKI L.A., CAHN J.W, GRATIAS D., Phil. Mag. 60 (1989) 837. [2] DUNEAU M., OGUEY C., J. Phys. A 24 (1991) 461. [3] DUNEAU M., OGUEY C., Europhys. Lett. 13 (1990) 67.
Review Let A, B, and C be matrices of the same size, and let r and s be scalars. Then
1 Sec 21 Matrix Operations Review Let A, B, and C be matrices of the same size, and let r and s be scalars Then (i) A + B = B + A (iv) r(a + B) = ra + rb (ii) (A + B) + C = A + (B + C) (v) (r + s)a = ra
More informationDefinition 1. A set V is a vector space over the scalar field F {R, C} iff. there are two operations defined on V, called vector addition
6 Vector Spaces with Inned Product Basis and Dimension Section Objective(s): Vector Spaces and Subspaces Linear (In)dependence Basis and Dimension Inner Product 6 Vector Spaces and Subspaces Definition
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND First Printing, 99 Chapter LINEAR EQUATIONS Introduction to linear equations A linear equation in n unknowns x,
More informationExercise sheet n Compute the eigenvalues and the eigenvectors of the following matrices. C =
L2 - UE MAT334 Exercise sheet n 7 Eigenvalues and eigenvectors 1. Compute the eigenvalues and the eigenvectors of the following matrices. 1 1 1 2 3 4 4 1 4 B = 1 1 1 1 1 1 1 1 1 C = Which of the previous
More informationa 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 11 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,, a n, b are given real
More informationA Highly Symmetric Four-Dimensional Quasicrystal * Veit Elser and N. J. A. Sloane AT&T Bell Laboratories Murray Hill, New Jersey
A Highly Symmetric Four-Dimensional Quasicrystal * Veit Elser and N. J. A. Sloane AT&T Bell Laboratories Murray Hill, New Jersey 7974 Abstract A quasiperiodic pattern (or quasicrystal) is constructed in
More informationn n matrices The system of m linear equations in n variables x 1, x 2,..., x n can be written as a matrix equation by Ax = b, or in full
n n matrices Matrices Definitions Diagonal, Identity, and zero matrices Addition Multiplication Transpose and inverse The system of m linear equations in n variables x 1, x 2,..., x n a 11 x 1 + a 12 x
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationPermuting the partitions of a prime
Journal de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 Permuting the partitions of a prime par Stéphane VINATIER Résumé. Étant donné un nombre premier p impair, on caractérise les partitions l de
More informationInverses. Stephen Boyd. EE103 Stanford University. October 28, 2017
Inverses Stephen Boyd EE103 Stanford University October 28, 2017 Outline Left and right inverses Inverse Solving linear equations Examples Pseudo-inverse Left and right inverses 2 Left inverses a number
More informationE2 212: Matrix Theory (Fall 2010) Solutions to Test - 1
E2 212: Matrix Theory (Fall 2010) s to Test - 1 1. Let X = [x 1, x 2,..., x n ] R m n be a tall matrix. Let S R(X), and let P be an orthogonal projector onto S. (a) If X is full rank, show that P can be
More informationQuestion: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?
Section 5. The Characteristic Polynomial Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI? Property The eigenvalues
More informationMatrices Gaussian elimination Determinants. Graphics 2009/2010, period 1. Lecture 4: matrices
Graphics 2009/2010, period 1 Lecture 4 Matrices m n matrices Matrices Definitions Diagonal, Identity, and zero matrices Addition Multiplication Transpose and inverse The system of m linear equations in
More informationLE JOURNAL DE PHYSIQUE - LETTRES
05.50 On We Tome 45 No 14 15 JUILLET 1984 LE JOURNAL DE PHYSIQUE - LETTRES J. Physique Lett. 45 (1984) L-701 - L-706 15 JUILLET 1984, L-701 Classification Physics Abstracts - - 05.20 64.60 On a model of
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.3 VECTOR EQUATIONS VECTOR EQUATIONS Vectors in 2 A matrix with only one column is called a column vector, or simply a vector. An example of a vector with two entries
More informationSolution to Homework 1
Solution to Homework Sec 2 (a) Yes It is condition (VS 3) (b) No If x, y are both zero vectors Then by condition (VS 3) x = x + y = y (c) No Let e be the zero vector We have e = 2e (d) No It will be false
More informationFurther Mathematical Methods (Linear Algebra) 2002
Further Mathematical Methods (Linear Algebra) 00 Solutions For Problem Sheet 0 In this Problem Sheet we calculated some left and right inverses and verified the theorems about them given in the lectures.
More informationChapter 2. Ma 322 Fall Ma 322. Sept 23-27
Chapter 2 Ma 322 Fall 2013 Ma 322 Sept 23-27 Summary ˆ Matrices and their Operations. ˆ Special matrices: Zero, Square, Identity. ˆ Elementary Matrices, Permutation Matrices. ˆ Voodoo Principle. What is
More informationReview : Powers of a matrix
Review : Powers of a matrix Given a square matrix A and a positive integer k, we define A k = AA A } {{ } k times Note that the multiplications AA, AAA,... make sense. Example. Suppose A=. Then A 0 2 =
More informationa11 a A = : a 21 a 22
Matrices The study of linear systems is facilitated by introducing matrices. Matrix theory provides a convenient language and notation to express many of the ideas concisely, and complicated formulas are
More informationMath 3108: Linear Algebra
Math 3108: Linear Algebra Instructor: Jason Murphy Department of Mathematics and Statistics Missouri University of Science and Technology 1 / 323 Contents. Chapter 1. Slides 3 70 Chapter 2. Slides 71 118
More informationLinear Equations in Linear Algebra
1 Linear Equations in Linear Algebra 1.7 LINEAR INDEPENDENCE LINEAR INDEPENDENCE Definition: An indexed set of vectors {v 1,, v p } in n is said to be linearly independent if the vector equation x x x
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K. R. MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 1998 Comments to the author at krm@maths.uq.edu.au Contents 1 LINEAR EQUATIONS
More informationMon Feb Matrix algebra and matrix inverses. Announcements: Warm-up Exercise:
Math 2270-004 Week 5 notes We will not necessarily finish the material from a given day's notes on that day We may also add or subtract some material as the week progresses, but these notes represent an
More information14 Singular Value Decomposition
14 Singular Value Decomposition For any high-dimensional data analysis, one s first thought should often be: can I use an SVD? The singular value decomposition is an invaluable analysis tool for dealing
More informationReciprocity formulae for general Dedekind Rademacher sums
ACTA ARITHMETICA LXXIII4 1995 Reciprocity formulae for general Dedekind Rademacher sums by R R Hall York, J C Wilson York and D Zagier Bonn 1 Introduction Let B 1 x = { x [x] 1/2 x R \ Z, 0 x Z If b and
More informationA proof of the Jordan normal form theorem
A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it
More informationMATRICES EXAM QUESTIONS
MATRICES EXAM QUESTIONS (Part One) Question 1 (**) The matrices A, B and C are given below in terms of the scalar constants a, b, c and d, by 2 3 A =, 1 a b 1 B =, 2 4 1 c C =. d 4 Given that A + B = C,
More informationMatrix operations Linear Algebra with Computer Science Application
Linear Algebra with Computer Science Application February 14, 2018 1 Matrix operations 11 Matrix operations If A is an m n matrix that is, a matrix with m rows and n columns then the scalar entry in the
More informationProblem 1: (3 points) Recall that the dot product of two vectors in R 3 is
Linear Algebra, Spring 206 Homework 3 Name: Problem : (3 points) Recall that the dot product of two vectors in R 3 is a x b y = ax + by + cz, c z and this is essentially the same as the matrix multiplication
More informationEffect of thermal noise and initial conditions in the dynamics of a mean-field ferromagnet
Effect of thermal noise and initial conditions in the dynamics of a mean-field ferromagnet O. Golinelli, B. Derrida To cite this version: O. Golinelli, B. Derrida. Effect of thermal noise and initial conditions
More informationExplicit Examples of Strebel Differentials
Explicit Examples of Strebel Differentials arxiv:0910.475v [math.dg] 30 Oct 009 1 Introduction Philip Tynan November 14, 018 In this paper, we investigate Strebel differentials, which are a special class
More informationMATH Linear Algebra
MATH 304 - Linear Algebra In the previous note we learned an important algorithm to produce orthogonal sequences of vectors called the Gramm-Schmidt orthogonalization process. Gramm-Schmidt orthogonalization
More informationANNALES SCIENTIFIQUES L ÉCOLE NORMALE SUPÉRIEURE. Cluster ensembles, quantization and the dilogarithm. Vladimir V. FOCK & Alexander B.
ISSN 0012-9593 ASENAH quatrième série - tome 42 fascicule 6 novembre-décembre 2009 ANNALES SCIENTIFIQUES de L ÉCOLE NORMALE SUPÉRIEURE Vladimir V. FOCK & Alexander B. GONCHAROV Cluster ensembles, quantization
More informationReview of linear algebra
Review of linear algebra 1 Vectors and matrices We will just touch very briefly on certain aspects of linear algebra, most of which should be familiar. Recall that we deal with vectors, i.e. elements of
More informationMatrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =
30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can
More informationAbstract Algebra, HW6 Solutions. Chapter 5
Abstract Algebra, HW6 Solutions Chapter 5 6 We note that lcm(3,5)15 So, we need to come up with two disjoint cycles of lengths 3 and 5 The obvious choices are (13) and (45678) So if we consider the element
More informationRigid Geometric Transformations
Rigid Geometric Transformations Carlo Tomasi This note is a quick refresher of the geometry of rigid transformations in three-dimensional space, expressed in Cartesian coordinates. 1 Cartesian Coordinates
More informationThe groups SO(3) and SU(2) and their representations
CHAPTER VI The groups SO(3) and SU() and their representations Two continuous groups of transformations that play an important role in physics are the special orthogonal group of order 3, SO(3), and the
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationx 1 x 2. x 1, x 2,..., x n R. x n
WEEK In general terms, our aim in this first part of the course is to use vector space theory to study the geometry of Euclidean space A good knowledge of the subject matter of the Matrix Applications
More informationPART 1 Introduction to Theory of Solids
Elsevier UK Job code: MIOC Ch01-I044647 9-3-2007 3:03p.m. Page:1 Trim:165 240MM TS: Integra, India PART 1 Introduction to Theory of Solids Elsevier UK Job code: MIOC Ch01-I044647 9-3-2007 3:03p.m. Page:2
More informationThese notes are incomplete they will be updated regularly.
These notes are incomplete they will be updated regularly. LIE GROUPS, LIE ALGEBRAS, AND REPRESENTATIONS SPRING SEMESTER 2008 RICHARD A. WENTWORTH Contents 1. Lie groups and Lie algebras 2 1.1. Definition
More informationIRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS. Contents
IRREDUCIBLE REPRESENTATIONS OF SEMISIMPLE LIE ALGEBRAS NEEL PATEL Abstract. The goal of this paper is to study the irreducible representations of semisimple Lie algebras. We will begin by considering two
More informationLecture 2: Lattices and Bases
CSE 206A: Lattice Algorithms and Applications Spring 2007 Lecture 2: Lattices and Bases Lecturer: Daniele Micciancio Scribe: Daniele Micciancio Motivated by the many applications described in the first
More informationControl Systems. Linear Algebra topics. L. Lanari
Control Systems Linear Algebra topics L Lanari outline basic facts about matrices eigenvalues - eigenvectors - characteristic polynomial - algebraic multiplicity eigenvalues invariance under similarity
More informationRoger Johnson Structure and Dynamics: Displacive phase transition Lecture 9
9.1. Summary In this Lecture we will consider structural phase transitions characterised by atomic displacements, which result in a low temperature structure that is distorted compared to a higher temperature,
More informationCourse Summary Math 211
Course Summary Math 211 table of contents I. Functions of several variables. II. R n. III. Derivatives. IV. Taylor s Theorem. V. Differential Geometry. VI. Applications. 1. Best affine approximations.
More informationA Short Course on Frame Theory
A Short Course on Frame Theory Veniamin I. Morgenshtern and Helmut Bölcskei ETH Zurich, 8092 Zurich, Switzerland E-mail: {vmorgens, boelcskei}@nari.ee.ethz.ch April 2, 20 Hilbert spaces [, Def. 3.-] and
More informationAlgebra I Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.701 Algebra I Fall 007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.701 007 Geometry of the Special Unitary
More informationMath Linear Algebra II. 1. Inner Products and Norms
Math 342 - Linear Algebra II Notes 1. Inner Products and Norms One knows from a basic introduction to vectors in R n Math 254 at OSU) that the length of a vector x = x 1 x 2... x n ) T R n, denoted x,
More informationSQUARE ROOTS OF 2x2 MATRICES 1. Sam Northshield SUNY-Plattsburgh
SQUARE ROOTS OF x MATRICES Sam Northshield SUNY-Plattsburgh INTRODUCTION A B What is the square root of a matrix such as? It is not, in general, A B C D C D This is easy to see since the upper left entry
More informationChapter 2: Matrix Algebra
Chapter 2: Matrix Algebra (Last Updated: October 12, 2016) These notes are derived primarily from Linear Algebra and its applications by David Lay (4ed). Write A = 1. Matrix operations [a 1 a n. Then entry
More informationNP-hardness of the stable matrix in unit interval family problem in discrete time
Systems & Control Letters 42 21 261 265 www.elsevier.com/locate/sysconle NP-hardness of the stable matrix in unit interval family problem in discrete time Alejandra Mercado, K.J. Ray Liu Electrical and
More informationProblem 1A. Suppose that f is a continuous real function on [0, 1]. Prove that
Problem 1A. Suppose that f is a continuous real function on [, 1]. Prove that lim α α + x α 1 f(x)dx = f(). Solution: This is obvious for f a constant, so by subtracting f() from both sides we can assume
More informationChapter 8. Rigid transformations
Chapter 8. Rigid transformations We are about to start drawing figures in 3D. There are no built-in routines for this purpose in PostScript, and we shall have to start more or less from scratch in extending
More informationLecture Notes 1: Vector spaces
Optimization-based data analysis Fall 2017 Lecture Notes 1: Vector spaces In this chapter we review certain basic concepts of linear algebra, highlighting their application to signal processing. 1 Vector
More informationInformation About Ellipses
Information About Ellipses David Eberly, Geometric Tools, Redmond WA 9805 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationMath 396. An application of Gram-Schmidt to prove connectedness
Math 396. An application of Gram-Schmidt to prove connectedness 1. Motivation and background Let V be an n-dimensional vector space over R, and define GL(V ) to be the set of invertible linear maps V V
More informationChapter 2 Notes, Linear Algebra 5e Lay
Contents.1 Operations with Matrices..................................1.1 Addition and Subtraction.............................1. Multiplication by a scalar............................ 3.1.3 Multiplication
More informationMATH 431: FIRST MIDTERM. Thursday, October 3, 2013.
MATH 431: FIRST MIDTERM Thursday, October 3, 213. (1) An inner product on the space of matrices. Let V be the vector space of 2 2 real matrices (that is, the algebra Mat 2 (R), but without the mulitiplicative
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationChapter 3. Vector spaces
Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say
More informationMath 4377/6308 Advanced Linear Algebra
2.3 Composition Math 4377/6308 Advanced Linear Algebra 2.3 Composition of Linear Transformations Jiwen He Department of Mathematics, University of Houston jiwenhe@math.uh.edu math.uh.edu/ jiwenhe/math4377
More information1 Definition and Basic Properties of Compa Operator
1 Definition and Basic Properties of Compa Operator 1.1 Let X be a infinite dimensional Banach space. Show that if A C(X ), A does not have bounded inverse. Proof. Denote the unit ball of X by B and the
More informationLecture 11 The Radical and Semisimple Lie Algebras
18.745 Introduction to Lie Algebras October 14, 2010 Lecture 11 The Radical and Semisimple Lie Algebras Prof. Victor Kac Scribe: Scott Kovach and Qinxuan Pan Exercise 11.1. Let g be a Lie algebra. Then
More informationFall Inverse of a matrix. Institute: UC San Diego. Authors: Alexander Knop
Fall 2017 Inverse of a matrix Authors: Alexander Knop Institute: UC San Diego Row-Column Rule If the product AB is defined, then the entry in row i and column j of AB is the sum of the products of corresponding
More informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationSection 1.6. M N = [a ij b ij ], (1.6.2)
The Calculus of Functions of Several Variables Section 16 Operations with Matrices In the previous section we saw the important connection between linear functions and matrices In this section we will
More informationGEODESIC ORBIT METRICS ON COMPACT SIMPLE LIE GROUPS ARISING FROM FLAG MANIFOLDS
GEODESIC ORBIT METRICS ON COMPACT SIMPLE LIE GROUPS ARISING FROM FLAG MANIFOLDS HUIBIN CHEN, ZHIQI CHEN AND JOSEPH A. WOLF Résumé. Dans cet article, nous étudions les métriques géodésiques homogènes, invariantes
More informationOn projective classification of plane curves
Global and Stochastic Analysis Vol. 1, No. 2, December 2011 Copyright c Mind Reader Publications On projective classification of plane curves Nadiia Konovenko a and Valentin Lychagin b a Odessa National
More informationSTEP Support Programme. STEP 2 Matrices Topic Notes
STEP Support Programme STEP 2 Matrices Topic Notes Definitions............................................. 2 Manipulating Matrices...................................... 3 Transformations.........................................
More informationVectors. January 13, 2013
Vectors January 13, 2013 The simplest tensors are scalars, which are the measurable quantities of a theory, left invariant by symmetry transformations. By far the most common non-scalars are the vectors,
More informationINTRODUCTION TO LIE ALGEBRAS. LECTURE 10.
INTRODUCTION TO LIE ALGEBRAS. LECTURE 10. 10. Jordan decomposition: theme with variations 10.1. Recall that f End(V ) is semisimple if f is diagonalizable (over the algebraic closure of the base field).
More informationThe Cayley-Hamilton Theorem and the Jordan Decomposition
LECTURE 19 The Cayley-Hamilton Theorem and the Jordan Decomposition Let me begin by summarizing the main results of the last lecture Suppose T is a endomorphism of a vector space V Then T has a minimal
More informationUnconditionally stable scheme for Riccati equation
ESAIM: Proceedings, Vol. 8, 2, 39-52 Contrôle des systèmes gouvernés par des équations aux dérivées partielles http://www.emath.fr/proc/vol.8/ Unconditionally stable scheme for Riccati equation François
More informationOptimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications
Optimization problems on the rank and inertia of the Hermitian matrix expression A BX (BX) with applications Yongge Tian China Economics and Management Academy, Central University of Finance and Economics,
More informationMethods in Computer Vision: Introduction to Matrix Lie Groups
Methods in Computer Vision: Introduction to Matrix Lie Groups Oren Freifeld Computer Science, Ben-Gurion University June 14, 2017 June 14, 2017 1 / 46 Definition and Basic Properties Definition (Matrix
More information18.02 Multivariable Calculus Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.02 Multivariable Calculus Fall 2007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. M. Matrices and Linear Algebra
More informationLinear Algebra review Powers of a diagonalizable matrix Spectral decomposition
Linear Algebra review Powers of a diagonalizable matrix Spectral decomposition Prof. Tesler Math 283 Fall 2018 Also see the separate version of this with Matlab and R commands. Prof. Tesler Diagonalizing
More informationSome icosahedral patterns and their isometries
Some icosahedral patterns and their isometries Nicolae Cotfas 1 Faculty of Physics, University of Bucharest, PO Box 76-54, Postal Office 76, Bucharest, Romania Radu Slobodeanu 2 Faculty of Physics, University
More informationSYMMETRIC SUBGROUP ACTIONS ON ISOTROPIC GRASSMANNIANS
1 SYMMETRIC SUBGROUP ACTIONS ON ISOTROPIC GRASSMANNIANS HUAJUN HUANG AND HONGYU HE Abstract. Let G be the group preserving a nondegenerate sesquilinear form B on a vector space V, and H a symmetric subgroup
More informationarxiv: v1 [cond-mat.mtrl-sci] 11 Dec 2013
Electronic structure and transport in approximants of the Penrose tiling Guy Trambly de Laissardière, 1 Attila Szállás, 2 and Didier Mayou 3 arxiv:1312.325v1 [cond-mat.mtrl-sci] 11 Dec 213 1 Laboratoire
More information1 The distributive law
THINGS TO KNOW BEFORE GOING INTO DISCRETE MATHEMATICS The distributive law The distributive law is this: a(b + c) = ab + bc This can be generalized to any number of terms between parenthesis; for instance:
More informationGROUP THEORY PRIMER. New terms: so(2n), so(2n+1), symplectic algebra sp(2n)
GROUP THEORY PRIMER New terms: so(2n), so(2n+1), symplectic algebra sp(2n) 1. Some examples of semi-simple Lie algebras In the previous chapter, we developed the idea of understanding semi-simple Lie algebras
More information1. Vectors.
1. Vectors 1.1 Vectors and Matrices Linear algebra is concerned with two basic kinds of quantities: vectors and matrices. 1.1 Vectors and Matrices Scalars and Vectors - Scalar: a numerical value denoted
More informationSolving Systems of Linear Equations. Classification by Number of Solutions
Solving Systems of Linear Equations Case 1: One Solution Case : No Solution Case 3: Infinite Solutions Independent System Inconsistent System Dependent System x = 4 y = Classification by Number of Solutions
More informationx n -2.5 Definition A list is a list of objects, where multiplicity is allowed, and order matters. For example, as lists
Vectors, Linear Combinations, and Matrix-Vector Mulitiplication In this section, we introduce vectors, linear combinations, and matrix-vector multiplication The rest of the class will involve vectors,
More informationThere are two things that are particularly nice about the first basis
Orthogonality and the Gram-Schmidt Process In Chapter 4, we spent a great deal of time studying the problem of finding a basis for a vector space We know that a basis for a vector space can potentially
More informationVector Space Concepts
Vector Space Concepts ECE 174 Introduction to Linear & Nonlinear Optimization Ken Kreutz-Delgado ECE Department, UC San Diego Ken Kreutz-Delgado (UC San Diego) ECE 174 Fall 2016 1 / 25 Vector Space Theory
More informationElectrons and Phonons on the Square Fibonacci Tiling
Ferroelectrics, 305: 15 19, 2004 Copyright C Taylor & Francis Inc. ISSN: 0015-0193 print / 1563-5112 online DOI: 10.1080/00150190490462252 Electrons and Phonons on the Square Fibonacci Tiling RONI ILAN,
More informationDiagonalisierung. Eigenwerte, Eigenvektoren, Mathematische Methoden der Physik I. Vorlesungsnotizen zu
Eigenwerte, Eigenvektoren, Diagonalisierung Vorlesungsnotizen zu Mathematische Methoden der Physik I J. Mark Heinzle Gravitational Physics, Faculty of Physics University of Vienna Version 5/5/2 2 version
More informationSection 2.2: The Inverse of a Matrix
Section 22: The Inverse of a Matrix Recall that a linear equation ax b, where a and b are scalars and a 0, has the unique solution x a 1 b, where a 1 is the reciprocal of a From this result, it is natural
More information12. Special Transformations 1
12. Special Transformations 1 Projections Take V = R 3 and consider the subspace W = {(x, y,z) x y z = 0}. Then the map P:V V that projects every vector in R 3 orthogonally onto the plane W is a linear
More informationMIT Final Exam Solutions, Spring 2017
MIT 8.6 Final Exam Solutions, Spring 7 Problem : For some real matrix A, the following vectors form a basis for its column space and null space: C(A) = span,, N(A) = span,,. (a) What is the size m n of
More informationELEMENTARY LINEAR ALGEBRA
ELEMENTARY LINEAR ALGEBRA K R MATTHEWS DEPARTMENT OF MATHEMATICS UNIVERSITY OF QUEENSLAND Second Online Version, December 998 Comments to the author at krm@mathsuqeduau All contents copyright c 99 Keith
More informationCS 143 Linear Algebra Review
CS 143 Linear Algebra Review Stefan Roth September 29, 2003 Introductory Remarks This review does not aim at mathematical rigor very much, but instead at ease of understanding and conciseness. Please see
More informationMath 408 Advanced Linear Algebra
Math 408 Advanced Linear Algebra Chi-Kwong Li Chapter 4 Hermitian and symmetric matrices Basic properties Theorem Let A M n. The following are equivalent. Remark (a) A is Hermitian, i.e., A = A. (b) x
More information