Math 4377/6308 Advanced Linear Algebra 1.6 Bases and Dimension

Total Page:16

File Type:pdf, Size:1020Kb

Math 4377/6308 Advanced Linear Algebra 1.6 Bases and Dimension 1.6 Bases and Dimension Math 4377/6308 Advanced Linear Algebra 1.6 Bases and Dimension Jiwen He Department of Mathematics, University of Houston [email protected] math.uh.edu/∼jiwenhe/math4377 Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 1 / 24 1.6 Bases and Dimension A Basis Set 1.6 Bases and Dimension A Basis Set: Definition A Basis Set: Examples The Spanning Set Theorem Properties of Bases The Replacement Theorem The Dimension of a Vector Space: Definition The Dimension of a Vector Space: Examples Dimensions of Subspaces of R3 Dimensions of Subspaces: Theorem Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 2 / 24 1.6 Bases and Dimension A Basis Set A Basis Set Let H be the plane illustrated below. Which of the following are valid descriptions of H? (a) H =Spanfv1; v2g (b) H =Spanfv1; v3g (c) H =Spanfv2; v3g (d) H =Spanfv1; v2; v3g A basis set is an “efficient” spanning set containing no unnecessary vectors. In this case, we would consider the linearly independent sets fv1; v2g and fv1; v3g to both be examples of basis sets or bases (plural for basis) for H. Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 3 / 24 1.6 Bases and Dimension A Basis Set A Basis Set: Definition Definition A basis β for a vector space V is a linearly independent subset of V that generates V . The vectors of β form a basis for V . A Basis Set of Subspace Let H be a subspace of a vector space V . An indexed set of vectors β = fb1;:::; bpg in V is a basis for H if i. β is a linearly independent set, and ii. H = Spanfb1;:::; bpg. Example Since span(;) = f0g and ; is linearly independent, ; is a basis for the zero vector space. Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 4 / 24 1.6 Bases and Dimension A Basis Set A Basis Set: Examples Example 2 1 3 2 0 3 2 0 3 Let e1 = 4 0 5 ; e2 = 4 1 5 ; e3 = 4 0 5. Show that 0 0 1 3 fe1; e2; e3g is a basis for R . Solutions: 2 1 0 0 3 Let A = e1 e2 e3 = 4 0 1 0 5. 0 0 1 Since A has 3 pivots, the columns of A are linearly , by the IMT, and the columns of A by IMT; 3 therefore, fe1; e2; e3g is a basis for R . n The basis fe1; ··· ; eng is called a standard basis for F : e1 = (1; 0; ··· ; 0), e2 = (0; 1; 0; ··· ; 0), ··· , en = (0; ··· ; 0; 1). Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 5 / 24 1.6 Bases and Dimension A Basis Set A Basis Set: Examples Example 2 n Let S = 1; x; x ;:::; x . Show that S is a basis for Pn. Solution: Any polynomial in Pn is in span of S:To show that S is linearly independent, assume n c0 · 1 + c1 · x + ··· + cn · x = 0: Then c0 = c1 = ··· = cn = 0. Hence S is a basis for Pn. The basis f1; x; x2; ··· ; xng is called the standard basis for Pn(F ). Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 6 / 24 1.6 Bases and Dimension A Basis Set A Basis Set: Example Example 2 1 3 2 0 3 2 1 3 Let v1 = 4 2 5 ; v2 = 4 1 5 ; v3 = 4 0 5. 0 1 3 3 Is fv1; v2; v3g a basis for R ? 2 1 0 1 3 Solution: Let A = [v1 v2 v3] = 4 2 1 0 5. By row reduction, 0 1 3 2 1 0 1 3 2 1 0 1 3 2 1 0 1 3 4 2 1 0 5 v 4 0 1 −2 5 v 4 0 1 −2 5 0 1 3 0 1 3 0 0 5 and since there are 3 pivots, the columns of A are linearly 3 independent and they span R by the IMT. Therefore fv1; v2; v3g 3 is a basis for R . Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 7 / 24 1.6 Bases and Dimension A Basis Set A Basis Set: Example Example 3 Explain why each of the following sets is not a basis for R : 82 3 2 3 2 3 2 39 < 1 4 0 1 = (a) 4 2 5 ; 4 5 5 ; 4 1 5 ; 4 −3 5 : 3 7 0 7 ; Example 82 3 2 39 < 1 4 = (b) 4 2 5 ; 4 5 5 : 3 6 ; Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 8 / 24 1.6 Bases and Dimension A Basis Set The Spanning Set Theorem A basis can be constructed from a spanning set of vectors by discarding vectors which are linear combinations of preceding vectors in the indexed set. Example −1 0 −2 Suppose v = ; v = and v = . 1 0 2 −1 3 −3 Solution: If x is in Spanfv1; v2; v3g, then x =c1v1 + c2v2 + c3v3 = c1v1 + c2v2 + c3 ( v1 + v2) = v1 + v2 Therefore, Spanfv1; v2; v3g =Spanfv1; v2g : Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 9 / 24 1.6 Bases and Dimension A Basis Set The Spanning Set Theorem Theorem (The Spanning Set Theorem) Let S = fv1;:::; vpg be a set in V and let H = Span fv1;:::; vpg : a. If one of the vectors in S - say vk - is a linear combination of the remaining vectors in S, then the set formed from S by removing vk still spans H. b. If H 6= f0g, some subset of S is a basis for H. Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 10 / 24 1.6 Bases and Dimension A Basis Set Bases for Spanning Set: Theorem and Examples Example Find a basis for H = spanfa1; a2; a3; a4g, where 2 1 2 0 4 3 6 2 4 −1 3 7 [a1 a2 a3 a4] = 6 7. 4 3 6 2 22 5 4 8 0 16 Solution: Row reduce: 2 1 2 0 4 3 6 0 0 1 5 7 [a1 a2 a3 a4] ∼ · · · s 6 7 = [b1 b2 b3 b4] 4 0 0 0 0 5 0 0 0 0 Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 11 / 24 1.6 Bases and Dimension A Basis Set Bases for Spanning Set: Theorem and Examples (cont.) Note that b2 = b1 and a2 = a1 b4 = 4b1 + 5b3 and a4 = 4a1 + 5a3 b1 and b3 are not multiples of each other a1 and a3 are not multiples of each other Elementary row operations on a matrix do not affect the linear dependence relations among the columns of the matrix. Therefore Span fa1, a2, a3, a4g = Span fa1, a3g and fa1, a3g is a basis for H: Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 12 / 24 1.6 Bases and Dimension A Basis Set Bases for Spanning Set: Theorem and Example Theorem The pivot columns of a matrix A = [a1; ··· ; a2] form a basis for span(a1; ··· ; an). Example 2 1 3 2 −2 3 2 3 3 Let v1 = 4 2 5 ; v2 = 4 −4 5 ; v3 = 4 6 5. Find a basis for −3 6 9 Spanfv1; v2; v3g . Solution: Let 2 1 −2 3 3 A = [v1; v2; v3] = 4 2 −4 6 5 −3 6 9 Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 13 / 24 1.6 Bases and Dimension A Basis Set Bases for Spanning Set: Theorem and Example (cont.) 2 1 −2 0 3 By row reduction, [v1; v2; v3] s 4 0 0 1 5. Therefore a basis 0 0 0 82 3 2 39 < = for Spanfv1; v2; v3g is 4 5 ; 4 5 . : ; Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 14 / 24 1.6 Bases and Dimension A Basis Set Properties of Bases Theorem (1.8) Let V be a vector space and β = fu1; ··· ; ung be a subset of V . Then β is a basis for V if and only if each v 2 V can be uniquely expressed as a linear combination of vectors of β: v = a1u1 + a2u2 + ··· + anun for unique scalars a1, ··· , an. Theorem (1.9) If a vector space V is generated by a finite set S, then some subset of S is a basis for V . Hence V has a finite basis. Jiwen He, University of Houston Math 4377/6308, Advanced Linear Algebra Spring, 2015 15 / 24 1.6 Bases and Dimension A Basis Set The Replacement Theorem Theorem (1.10 The Replacement Theorem) Let V be a vector space that is generated by a set G containing exactly n vectors, and let L be a linearly independent subset of V containing exactly m vectors. Then m ≤ n and there exists a subset H of G containing exactly n − m vectors such that L [ H generates V . Corollary 0 If a vector space V has a basis β = fb1;:::; bng, then any set in V containing more than n vectors must be linearly dependent. Proof: Suppose S = fu1;:::; upg is a set of p vectors in V where p > n. If S is a linearly independent subset of V , the Replacement Theorem implies that p ≤ n, a contradiction.
Recommended publications
  • 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.
    [Show full text]
  • 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.
    [Show full text]
  • Bases for Infinite Dimensional Vector Spaces Math 513 Linear Algebra Supplement
    BASES FOR INFINITE DIMENSIONAL VECTOR SPACES MATH 513 LINEAR ALGEBRA SUPPLEMENT Professor Karen E. Smith We have proven that every finitely generated vector space has a basis. But what about vector spaces that are not finitely generated, such as the space of all continuous real valued functions on the interval [0; 1]? Does such a vector space have a basis? By definition, a basis for a vector space V is a linearly independent set which generates V . But we must be careful what we mean by linear combinations from an infinite set of vectors. The definition of a vector space gives us a rule for adding two vectors, but not for adding together infinitely many vectors. By successive additions, such as (v1 + v2) + v3, it makes sense to add any finite set of vectors, but in general, there is no way to ascribe meaning to an infinite sum of vectors in a vector space. Therefore, when we say that a vector space V is generated by or spanned by an infinite set of vectors fv1; v2;::: g, we mean that each vector v in V is a finite linear combination λi1 vi1 + ··· + λin vin of the vi's. Likewise, an infinite set of vectors fv1; v2;::: g is said to be linearly independent if the only finite linear combination of the vi's that is zero is the trivial linear combination. So a set fv1; v2; v3;:::; g is a basis for V if and only if every element of V can be be written in a unique way as a finite linear combination of elements from the set.
    [Show full text]
  • 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.
    [Show full text]
  • 28. Exterior Powers
    28. Exterior powers 28.1 Desiderata 28.2 Definitions, uniqueness, existence 28.3 Some elementary facts 28.4 Exterior powers Vif of maps 28.5 Exterior powers of free modules 28.6 Determinants revisited 28.7 Minors of matrices 28.8 Uniqueness in the structure theorem 28.9 Cartan's lemma 28.10 Cayley-Hamilton Theorem 28.11 Worked examples While many of the arguments here have analogues for tensor products, it is worthwhile to repeat these arguments with the relevant variations, both for practice, and to be sensitive to the differences. 1. Desiderata Again, we review missing items in our development of linear algebra. We are missing a development of determinants of matrices whose entries may be in commutative rings, rather than fields. We would like an intrinsic definition of determinants of endomorphisms, rather than one that depends upon a choice of coordinates, even if we eventually prove that the determinant is independent of the coordinates. We anticipate that Artin's axiomatization of determinants of matrices should be mirrored in much of what we do here. We want a direct and natural proof of the Cayley-Hamilton theorem. Linear algebra over fields is insufficient, since the introduction of the indeterminate x in the definition of the characteristic polynomial takes us outside the class of vector spaces over fields. We want to give a conceptual proof for the uniqueness part of the structure theorem for finitely-generated modules over principal ideal domains. Multi-linear algebra over fields is surely insufficient for this. 417 418 Exterior powers 2. Definitions, uniqueness, existence Let R be a commutative ring with 1.
    [Show full text]
  • Coordinatization
    MATH 355 Supplemental Notes Coordinatization Coordinatization In R3, we have the standard basis i, j and k. When we write a vector in coordinate form, say 3 v 2 , (1) “ »´ fi 5 — ffi – fl it is understood as v 3i 2j 5k. “ ´ ` The numbers 3, 2 and 5 are the coordinates of v relative to the standard basis ⇠ i, j, k . It has p´ q “p q always been understood that a coordinate representation such as that in (1) is with respect to the ordered basis ⇠. A little thought reveals that it need not be so. One could have chosen the same basis elements in a di↵erent order, as in the basis ⇠ i, k, j . We employ notation indicating the 1 “p q coordinates are with respect to the di↵erent basis ⇠1: 3 v 5 , to mean that v 3i 5k 2j, r s⇠1 “ » fi “ ` ´ 2 —´ ffi – fl reflecting the order in which the basis elements fall in ⇠1. Of course, one could employ similar notation even when the coordinates are expressed in terms of the standard basis, writing v for r s⇠ (1), but whenever we have coordinatization with respect to the standard basis of Rn in mind, we will consider the wrapper to be optional. r¨s⇠ Of course, there are many non-standard bases of Rn. In fact, any linearly independent collection of n vectors in Rn provides a basis. Say we take 1 1 1 4 ´ ´ » 0fi » 1fi » 1fi » 1fi u , u u u ´ . 1 “ 2 “ 3 “ 4 “ — 3ffi — 1ffi — 0ffi — 2ffi — ffi —´ ffi — ffi — ffi — 0ffi — 4ffi — 2ffi — 1ffi — ffi — ffi — ffi —´ ffi – fl – fl – fl – fl As per the discussion above, these vectors are being expressed relative to the standard basis of R4.
    [Show full text]
  • Review a Basis of a Vector Space 1
    Review • Vectors v1 , , v p are linearly dependent if x1 v1 + x2 v2 + + x pv p = 0, and not all the coefficients are zero. • The columns of A are linearly independent each column of A contains a pivot. 1 1 − 1 • Are the vectors 1 , 2 , 1 independent? 1 3 3 1 1 − 1 1 1 − 1 1 1 − 1 1 2 1 0 1 2 0 1 2 1 3 3 0 2 4 0 0 0 So: no, they are dependent! (Coeff’s x3 = 1 , x2 = − 2, x1 = 3) • Any set of 11 vectors in R10 is linearly dependent. A basis of a vector space Definition 1. A set of vectors { v1 , , v p } in V is a basis of V if • V = span{ v1 , , v p} , and • the vectors v1 , , v p are linearly independent. In other words, { v1 , , vp } in V is a basis of V if and only if every vector w in V can be uniquely expressed as w = c1 v1 + + cpvp. 1 0 0 Example 2. Let e = 0 , e = 1 , e = 0 . 1 2 3 0 0 1 3 Show that { e 1 , e 2 , e 3} is a basis of R . It is called the standard basis. Solution. 3 • Clearly, span{ e 1 , e 2 , e 3} = R . • { e 1 , e 2 , e 3} are independent, because 1 0 0 0 1 0 0 0 1 has a pivot in each column. Definition 3. V is said to have dimension p if it has a basis consisting of p vectors. Armin Straub 1 [email protected] This definition makes sense because if V has a basis of p vectors, then every basis of V has p vectors.
    [Show full text]
  • MATH 304 Linear Algebra Lecture 14: Basis and Coordinates. Change of Basis
    MATH 304 Linear Algebra Lecture 14: Basis and coordinates. Change of basis. Linear transformations. Basis and dimension Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis. Theorem Any vector space V has a basis. If V has a finite basis, then all bases for V are finite and have the same number of elements (called the dimension of V ). Example. Vectors e1 = (1, 0, 0,..., 0, 0), e2 = (0, 1, 0,..., 0, 0),. , en = (0, 0, 0,..., 0, 1) form a basis for Rn (called standard) since (x1, x2,..., xn) = x1e1 + x2e2 + ··· + xnen. Basis and coordinates If {v1, v2,..., vn} is a basis for a vector space V , then any vector v ∈ V has a unique representation v = x1v1 + x2v2 + ··· + xnvn, where xi ∈ R. The coefficients x1, x2,..., xn are called the coordinates of v with respect to the ordered basis v1, v2,..., vn. The mapping vector v 7→ its coordinates (x1, x2,..., xn) is a one-to-one correspondence between V and Rn. This correspondence respects linear operations in V and in Rn. Examples. • Coordinates of a vector n v = (x1, x2,..., xn) ∈ R relative to the standard basis e1 = (1, 0,..., 0, 0), e2 = (0, 1,..., 0, 0),. , en = (0, 0,..., 0, 1) are (x1, x2,..., xn). a b • Coordinates of a matrix ∈ M2,2(R) c d 1 0 0 0 0 1 relative to the basis , , , 0 0 1 0 0 0 0 0 are (a, c, b, d). 0 1 • Coordinates of a polynomial n−1 p(x) = a0 + a1x + ··· + an−1x ∈Pn relative to 2 n−1 the basis 1, x, x ,..., x are (a0, a1,..., an−1).
    [Show full text]
  • Orthonormal Bases
    Math 108B Professor: Padraic Bartlett Lecture 3: Orthonormal Bases Week 3 UCSB 2014 In our last class, we introduced the concept of \changing bases," and talked about writ- ing vectors and linear transformations in other bases. In the homework and in class, we saw that in several situations this idea of \changing basis" could make a linear transformation much easier to work with; in several cases, we saw that linear transformations under a certain basis would become diagonal, which made tasks like raising them to large powers far easier than these problems would be in the standard basis. But how do we find these \nice" bases? What does it mean for a basis to be\nice?" In this set of lectures, we will study one potential answer to this question: the concept of an orthonormal basis. 1 Orthogonality To start, we should define the notion of orthogonality. First, recall/remember the defini- tion of the dot product: n Definition. Take two vectors (x1; : : : xn); (y1; : : : yn) 2 R . Their dot product is simply the sum x1y1 + x2y2 + : : : xnyn: Many of you have seen an alternate, geometric definition of the dot product: n Definition. Take two vectors (x1; : : : xn); (y1; : : : yn) 2 R . Their dot product is the product jj~xjj · jj~yjj cos(θ); where θ is the angle between ~x and ~y, and jj~xjj denotes the length of the vector ~x, i.e. the distance from (x1; : : : xn) to (0;::: 0). These two definitions are equivalent: 3 Theorem. Let ~x = (x1; x2; x3); ~y = (y1; y2; y3) be a pair of vectors in R .
    [Show full text]
  • Pl¨Ucker Basis Vectors
    Pluck¨ er Basis Vectors Roy Featherstone Department of Information Engineering The Australian National University Canberra, ACT 0200, Australia Email: [email protected] Abstract— 6-D vectors are routinely expressed in Pluck¨ er Pluck¨ er coordinate vector and the 6-D vector it represents; it coordinates; yet there is almost no mention in the literature of explains the relationship between a 6-D vector and the two the basis vectors that give rise to these coordinates. This paper 3-D vectors that define it; and it shows how to differentiate identifies the Pluck¨ er basis vectors, and uses them to explain the following: the relationship between a 6-D vector and its Pluck¨ er a 6-D vector in a moving Pluck¨ er coordinate system, using coordinates, the relationship between a 6-D vector and the pair of acceleration as an example. For the sake of a concrete expo- 3-D vectors used to define it, and the correct way to differentiate sition, this paper uses the notation and terminology of spatial a 6-D vector in a moving coordinate system. vectors; but the results apply generally to any 6-D vector that is expressed using Pluck¨ er coordinates. I. INTRODUCTION The rest of this paper is organized as follows. First, the 6-D vectors are used to describe the motions of rigid bodies Pluck¨ er basis vectors are described. Then the topic of dual and the forces acting upon them. They are therefore useful for coordinate systems is discussed. This is relevant to those 6-D describing the kinematics and dynamics of rigid-body systems vector formalisms in which force vectors are deemed to occupy in general, and robot mechanisms in particular.
    [Show full text]
  • Linear Transformations and Determinants Matrix Multiplication As a Linear Transformation
    Linear transformations and determinants Math 40, Introduction to Linear Algebra Monday, February 13, 2012 Matrix multiplication as a linear transformation Primary example of a = matrix linear transformation ⇒ multiplication Given an m n matrix A, × define T (x)=Ax for x Rn. ∈ Then T is a linear transformation. Astounding! Matrix multiplication defines a linear transformation. This new perspective gives a dynamic view of a matrix (it transforms vectors into other vectors) and is a key to building math models to physical systems that evolve over time (so-called dynamical systems). A linear transformation as matrix multiplication Theorem. Every linear transformation T : Rn Rm can be → represented by an m n matrix A so that x Rn, × ∀ ∈ T (x)=Ax. More astounding! Question Given T, how do we find A? Consider standard basis vectors for Rn: Transformation T is 1 0 0 0 completely determined by its . e1 = . ,...,en = . action on basis vectors. 0 0 0 1 Compute T (e1),T(e2),...,T(en). Standard matrix of a linear transformation Question Given T, how do we find A? Consider standard basis vectors for Rn: Transformation T is 1 0 0 0 completely determined by its . e1 = . ,...,en = . action on basis vectors. 0 0 0 1 Compute T (e1),T(e2),...,T(en). Then || | is called the T (e ) T (e ) T (e ) 1 2 ··· n standard matrix for T. || | denoted [T ] Standard matrix for an example Example x 3 2 x T : R R and T y = → y z 1 0 0 1 0 0 T 0 = T 1 = T 0 = 0 1 0 0 0 1 100 2 A = What is T 5 ? 010 − 12 2 2 100 2 A 5 = 5 = ⇒ − 010− 5 12 12 − Composition T : Rn Rm is a linear transformation with standard matrix A Suppose → S : Rm Rp is a linear transformation with standard matrix B.
    [Show full text]
  • Math 217: Coordinates and B-Matrices Section 5 Professor Karen Smith **************************************************
    Math 217: Coordinates and B-matrices Section 5 Professor Karen Smith (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. n n T n Definition. Let B = f~v1; : : : ; ~vng be a basis for R . Let R −! R be a linear transformation. The B-matrix of T is the n × n matrix B = [T (~v1)]B T (~v2)]B :::T (~vn)]B] : Computing the B-matrix: Compute one column at a time. For the j-th column: 1. Find T (~vj ). 2. Express T (~vj ) as a linear combination of the basis elements f~v1; : : : ; ~vng. 3. Write these B-coordinates of T (~vj ) as a column vector: this is the j-th column of the B-matrix. Do not forget this last step of converting back into B-coordinates! It is easy to n forget since the vectors T (~vj ) 2 R are columns already in standard coordinates. n For any vector ~v 2 R , we can understand T entirely in B-coordinates as follows: [T (~v)]B = B · [~v]B where B is the B-matrix of T . n T n Theorem. Let R −! R be a linear transformation (so T is multiplication by some matrix A). Then the B-matrix and the standard matrix A of T are similar: B = S−1AS where S = ~v1 ~v2 : : : ~vn : The matrix S is the change of basis matrix from B to the standard basis. The columns of S are the basis vectors of B expressed in the standard basis. ******************************************************************************* x 3x + 4y A.
    [Show full text]