Multi-linear Systems for 3D-from-2D Interpretation. Lecture 3. P n P n. Dynamic Tensors. Amnon Shashua. Hebrew University of Jerusalem Israel
|
|
- Ira Barton
- 5 years ago
- Views:
Transcription
1 Multi-linear Systems for 3D-from-2D Interpretation Lecture 3 Dynamic Tensors P n P n Amnon Shashua Hebrew University of Jerusalem Israel U. of Milano, Homography Tensors 1
2 Material We Will Cover Today 2D-2D, 3D-D mapping of a dynamic point configuration Homography Tensors and their properties Some generalizations to higher dimensions Shashua,Wolf ECCV 00 (2D-2D,best paper award) Wolf,Shashua,Wexler ICPR 00 (3D-3D) Shashua,Meshulam,Wolf,Levin,Kalai 02 (generalizations to high dimensions) Shashua,Wolf 04 (extended version) U. of Milano, Homography Tensors 2
3 Homography Matrix p' H π p π 4 points mae a basis for the projective plane p p H π = λh + e' n T H π Stands for the family of 2D projective transformations between two fixed images induced by a plane in space Does is mae sense to introduce a 3rd view? U. of Milano, Homography Tensors 3
4 P 2 P 2 P 2 Mapping of the dynamic projective plane onto itself (movie) Points are moving along straight-line trajectories while camera changes position U. of Milano, Homography Tensors 4
5 3 snapshots of a linearly moving point (movie) U. of Milano, Homography Tensors 5
6 A,B are unnown ran A p' Ap ' [ p Ap' Bp'' ] = 2 p Bp' ' p'' B p T ( Ap' Bp'') = 0 Multilinear relation between p,p,p and A,B U. of Milano, Homography Tensors 6
7 p T ( Ap' Bp'') = 0 Let index i run over view 1, index j over view 2 and index over view 3 i p εinu n j u j ( a p' )( b p'' ) = 0 The position of symbols does not matter (only the indices) p p i i j p' p'' ( ε a b ) = j inu n j u p' p'' H = ij 0 0 U. of Milano, Homography Tensors 7
8 Estimation of H ij 26 matching triplets p,p,p arising from dynamic points provide A unique solution for the dual Htensor (each triplet provides one linear constraint). The 26 points must lie on at least 4 lines (in general position), where no more than 8 points on the first line, no more than 7 points on the second line, 6 on the third, and 5 on the fourth. (setch of proof to follow) U. of Milano, Homography Tensors 8
9 L 1 q 1 r 1 s 1 Consider a line L 1 and its projections. Since each line is determined by two points we can have at most linearly independent constraints where the points p i p' j p'' H are coincident with the lines ij = 0 respectively. U. of Milano, Homography Tensors 9
10 L 1 L 2 q 1 p q 2 s 1 r 1 p'' r 2 p' s 2 Consider a second line L 2 and its projections. Let be a triplet of points of the projection of Among the 8 possible independent choices of choosing three points From the three pairs of points (defining the lines ) the choice is already covered by the span of the 8 constraints Associated with. L 1 We are left with only 7 linearly independent constraints induced by L 2 U. of Milano, Homography Tensors 10
11 i j i j p p' H = 0 p p' ' H = 0 p' p'' H = 0 But ij Labeled Stationary Points p p i i ran 9 linear constraints on H p i p' j j p' p'' p'' e e [ p Ap' Bp'' ] = 1 e H j H j p' p'' H = ij i ij H 0 ij ij ij = 0, e = 0, e = 0, e Appears 3 times! 7 linearly independent constraints on H 4 (labeled) static points are sufficient for solving for H U. of Milano, Homography Tensors 11 ij
12 Unlabeled Stationary Points What if all the measurements arise from stationary points without prior nowledge that they are stationary? (unlabeled stationary) i j p p' p'' H = 0 G ij H = 0 ij ij It is sufficient to consider A=B=I G = ij p i p j p ij G is a symmetric tensor, i.e. contains only 10 different groups 111,222,333,112,113,221,223,331,332,123 up to permutations. ran( v1 v2 v3 ranspan( v1, v2, v3) = 1) n = 3 One needs at least 16 dynamic points in an unlabeled set U. of Milano, Homography Tensors 12
13 Mixed Labeled and Unlabeled Static Points Let 0 x 4 be the number of labeled stationary points. To obtain a unique linear solution for the homography tensor, the minimal number of matching triplets associated with moving points must be and at most can come from unlabeled stationary points. 16 4x 10 3x i j p p' p'' H = 0 ij H = 0 ij G = G It is sufficient to consider A=B=I ij i j ij p p p Consider the case x =1, i.e., one of the matching triplets contributed 9 constraints of ran 7: Where are the standard basis U. of Milano, Homography Tensors 13
14 Mixed Labeled and Unlabeled Static Points Add the three constraints of the first row: Then, is a symmetric tensor and is therefore spanned by the 10-dim subspace of the unlabeled stationary points. Consider the case x =1, i.e., one of the matching triplets contributed 9 constraints of ran 7: Where are the standard basis U. of Milano, Homography Tensors 14
15 Mixed Labeled and Unlabeled Static Points Add the three constraints of the first row: Then, is a symmetric tensor and is therefore spanned by the 10-dim subspace of the unlabeled stationary points. Liewise, the constraint tensors resulting from summing the second and third rows Are symmetric. As a result 3 out of the 7 constraints contributed by a labeled stationary Points are already accounted for by the space of unlabeled stationary points. Consider the case x =1, i.e., one of the matching triplets contributed 9 constraints of ran 7: Where are the standard basis U. of Milano, Homography Tensors 15
16 Mixed Labeled and Unlabeled Static Points Add the three constraints of the first row: Then, is a symmetric tensor and is therefore spanned by the 10-dim subspace of the unlabeled stationary points. Liewise, the constraint tensors resulting from summing the second and third rows Are symmetric. As a result 3 out of the 7 constraints contributed by a labeled stationary Points are already accounted for by the space of unlabeled stationary points. Consider the case x =1, i.e., one of the matching triplets contributed 9 constraints of ran 7: Where are the standard basis U. of Milano, Homography Tensors 16
17 Mixed Labeled and Unlabeled Static Points 3 of the 7 constraints provided by a labeled static live in the 10 th dimensional subspace of unlabeled static points. If we have 0 x x dynamic points labeled static points, then we need U. of Milano, Homography Tensors 17
18 Partly segmented scene Known unnown moving static required U. of Milano, Homography Tensors 18
19 H ij as a mapping and its slices Double contraction: point-point to line mapping p i j p' H = ij l' ' p p' l'' i j From index structure l must be a line. Since p p' p'' H ij = 0 for every point along the straight line trajectory determined by p,p then the line l must the projection of that trajectory. U. of Milano, Homography Tensors 19
20 Single contraction: δ H = E ij ij (a matrix) H ij = ε inu a n j b u p p' δ µ = Bδ η = A 1 Bδ δ H p T ij n j u = ε a ( b δ ) = [ Bδ ] inu Ep'= 0 E = [µ] x A µ = Bδ E η = [ µ ] A x η [ µ ] x µ = 0 T T E = A [ µ ] µ = 0 U. of Milano, Homography Tensors 20 µ x A For all pairs p,p on matching lines through the fixed points µ and η
21 U. of Milano, Homography Tensors 21 A E x = [µ] A A A E x T T [µ] = A A E A x T T [µ] = + A = 0 E E A T T Given E we obtain 6 linear equations to solve for A ij H ij H With 2 slices, one can solve for A The single contraction is the ey for recovering A,B:
22 To summarize, each of the contractions: Represents a point-to-line (correlation) mapping between views (1,2),(1,3) and (2,3) respectively. By setting to be we obtain three different slicings of the tensor. Let be the slices of be the slices of be the slices of Then: U. of Milano, Homography Tensors 22
23 (movie) U. of Milano, Homography Tensors 23
24 U. of Milano, Homography Tensors 24
25 U. of Milano, Homography Tensors 25
26 U. of Milano, Homography Tensors 26
27 U. of Milano, Homography Tensors 27
28 Homography Tensors of P 3 QuicTime and a decompressor are needed to see this picture. U. of Milano, Homography Tensors 28
29 Homography Tensors of P 3 Basic constraint: ran P AP' BP'' = 2 For every vector V: det P AP' BP'' V = 0 U. of Milano, Homography Tensors 29
30 U. of Milano, Homography Tensors ) det( A E A E A E A E A E Z Y X E Z Y X E Z Y X E Z Y X A + = = The point E resides on the plane defined by the points X,Y,Z iff det(a)=0 The plane (the dual coordinates) is represented by the vector w i = ε ijl x j y z l ε Where the entries of cross-product tensor consist of +1,-1,0 in the appropriate locations. (equal to zero if X,Y,Z,E are coplanar)
31 Homography Tensors of P 3 Basic constraint: ran P AP' BP'' = 2 For every vector V: det P AP' BP'' V = 0 Resulting in a 4x4x4 tensor with the constraint U. of Milano, Homography Tensors 31
32 Each matching triplet P,P',P'' arising from a dynamic point contributes one linear equation to a 4x4x4 tensor J. Any matching triplets in general position provide an estimation matrix for J with a four-dimensional null space. The 60 points should be distributed along at least 10 lines, five of which can hold up to 8 dynamic points, and the remaining five up to 4 dynamic points. U. of Milano, Homography Tensors 32
33 Mixed Labeled and Unlabeled Static Points Unlabeled Stationary Points: The constraints made solely from unlabeled stationary points span at most a 20-dimensional space. The 3-fold symmetric powers of a 4-dim vector space V is 20 ran(v 1 v 2 v 3 ranspan(v 1,v 2,v 3 ) =1) = n = = U. of Milano, Homography Tensors 33
34 Mixed Labeled and Unlabeled Static Points Labeled Stationary Points: A labeled stationary point can provide at most 10 linearly independent constraints. Where are the standard basis The constraint is accounted for 3 times (is spanned by each column). U. of Milano, Homography Tensors 34
35 Mixed Labeled and Unlabeled Static Points Out of the ten linearly independent constraints arising from a labeled stationary point, 4 lie in the ran-20 subspace spanned by unlabeled stationary points and 6 lie in the subspace spanned only by dynamic points. Add the three constraints of the first row: Then, is a symmetric tensor and is therefore spanned by the 20-dim subspace of the unlabeled stationary points. Liewise for each of the remaining rows. U. of Milano, Homography Tensors 35
36 Mixed Labeled and Unlabeled Static Points Corollary 1: A minimum of 7 labeled stationary points are necessary for a unique (up to a 4-dimensional solution space) solution for J. The first 5 labeled points will fill up the 20-dim subspace of unlabeled stationary points. Each additional point can contribute at most 6 linearly independent constraints. 5x10 + 2x6 >= 60. Note: A stationary 3D-3D alignment requires only 5 matching points! U. of Milano, Homography Tensors 36
37 Mixed Labeled and Unlabeled Static Points Corollary 2: In a situation of matching triplets arising from a mixture of stationary and moving points, let x<= 7 be the number of matching triplets that are nown a priori to arise from stationary points. To obtain a unique linear solution for J (up to a 4-dimensional solution space), the minimal number of unlabeled matching triplets required is: out of which 40-6x, x<7, should be dynamic and at most 20-4x, x<= 5, could be unlabeled stationary points. U. of Milano, Homography Tensors 37
38 Tensor Slices and the Extraction of A,B Note that the tensor J is recovered up to a 4-dim subspace of solutions, i.e., from the measurements we have 4 tensors each associated with its own different V. Recovering the principal point V: Consider the plane defined by the points By varying P,P we obtain a star of planes all coincident with V. Thus, V can be recovered By taing 3 double slices of the tensor and finding their intersection point. Recovering the trajectory line between AP and BP Tae any two tensors (out of ) and find the intersection: U. of Milano, Homography Tensors 38
39 Tensor Slices and the Extraction of A,B Use a single contraction to recover A: A single contraction is a 4x4 matrix H that maps points to planes. The plane HP, i.e., contains the points V,AP,BP The range of the mapping induced by H contains the line passing through V,BP thus ran(h)=2. Because HP is the plane through V,AP,BP, we must have for all P is sew-symmetric and thus provides 10 linear constraints on A. By varying P and using one of the additional tensors we can obtain sufficient constraints To solve for A. U. of Milano, Homography Tensors 39
40 4x4x4 4 Solutions (60 matching points) Unlabeled Static points live in a 20-dim subspace. Labeled static point contributes 10 constraints 4 of the 10 constraints provided by a labeled static live in the 20 th dimensional subspace of unlabeled static points. U. of Milano, Homography Tensors 40
41 Segmentation Results U. of Milano, Homography Tensors 41
42 The General Case N: dim of vector space (3 for Htensor, 4 for Jtensor) K: No. of observations (3 for Htensor, 3 for Jtensor) M: dim of subspace (2 for Htensor, 2 for Jtensor) <332> Htensor moving points, 26 dim-space <331> Htensor static points, 10 dim-space <432> Jtensor moving points, 60 dim-space <431> Jtensor static points, 20 dim-space <nm>? U. of Milano, Homography Tensors 42
43 Let V be a n-dim vector space. For n m Consider the GL(V ) module V(n,m,) V (n,m,) = {v 1 v 2 L v m dimspan{v 1,...,v m } } We want to determine the module structure and dimv (n,m,) Let λ = (λ 1 λ 2 L) be a partition of m dimv (n,m,) = n m λ +1 >0 m! (hoo lengths) (i, j ) λ (n + j i) (hoo lengths) U. of Milano, Homography Tensors 43
44 This is not true for The hoo-length the number of standard tableaux on The number of semi-standard tableaux (number of ways to fill The diagram with numbers 1,,n such that all rows are Non-decreasing and all columns are increasing U. of Milano, Homography Tensors 44
45 U. of Milano, Homography Tensors 45 = n n n V 1),, ( + + = n n n n V 1 1) ( 2),, ( (4,3,2) 3 = = V (3,3,2) 3 = = V Htensor Jtensor ) ( (3,3,1) 2 3 = = + + = V ) ( (4,3,1) 2 3 = = + + = V Htensor, static Jtensor, static
46 Open Problems 1. Is the dimension of V(n,m,) sufficient for uniquely recovering the m-1 individual colineations? for example, we saw that A,B can uniquely be recovered from 4x4x4 J even though J cannot be uniquely recovered from measurements (ran of measurements at most 60). 2. What are the constraints contributed from a labeled < -dimensional moving point? for example, we saw that a stationary ( =1) point for V(3,3,2) contribute 7 constraints and 10 for V(4,3,2). 3. What would be the dimension of the space covered by mixed observations? I.e. from labeled < -dim labeled, and unlabeled <. for example, we saw that labeled stationary ( =1) for V(3,3,2) provide only 4 new constraints as 3 out of the 7 constraints are contained in unlabeled stationary points. U. of Milano, Homography Tensors 46
Dynamic P n to P n Alignment
Dynamic P n to P n Alignment Amnon Shashua and Lior Wolf School of Engineering and Computer Science, the Hebrew University of Jerusalem, Jerusalem, 91904, Israel {shashua,lwolf}@cs.huji.ac.il We introduce
More informationQuadrifocal Tensor. Amnon Shashua and Lior Wolf. The Hebrew University, Jerusalem 91904, Israel.
On the Structure and Properties of the Quadrifocal Tensor Amnon Shashua and Lior Wolf School of Computer Science and Engineering, The Hebrew University, Jerusalem 91904, Israel e-mail: fshashua,lwolfg@cs.huji.ac.il
More informationis the desired collar neighbourhood. Corollary Suppose M1 n, M 2 and f : N1 n 1 N2 n 1 is a diffeomorphism between some connected components
1. Collar neighbourhood theorem Definition 1.0.1. Let M n be a manifold with boundary. Let p M. A vector v T p M is called inward if for some local chart x: U V where U subsetm is open, V H n is open and
More informationWe showed that adding a vector to a basis produces a linearly dependent set of vectors; more is true.
Dimension We showed that adding a vector to a basis produces a linearly dependent set of vectors; more is true. Lemma If a vector space V has a basis B containing n vectors, then any set containing more
More informationMATH 423 Linear Algebra II Lecture 12: Review for Test 1.
MATH 423 Linear Algebra II Lecture 12: Review for Test 1. Topics for Test 1 Vector spaces (F/I/S 1.1 1.7, 2.2, 2.4) Vector spaces: axioms and basic properties. Basic examples of vector spaces (coordinate
More informationMulti-frame Infinitesimal Motion Model for the Reconstruction of (Dynamic) Scenes with Multiple Linearly Moving Objects
Multi-frame Infinitesimal Motion Model for the Reconstruction of (Dynamic) Scenes with Multiple Linearly Moving Objects Amnon Shashua and Anat Levin School of Computer Science and Engineering, The Hebrew
More informationk times l times n times
1. Tensors on vector spaces Let V be a finite dimensional vector space over R. Definition 1.1. A tensor of type (k, l) on V is a map T : V V R k times l times which is linear in every variable. Example
More informationHomework Set #8 Solutions
Exercises.2 (p. 19) Homework Set #8 Solutions Assignment: Do #6, 8, 12, 14, 2, 24, 26, 29, 0, 2, 4, 5, 6, 9, 40, 42 6. Reducing the matrix to echelon form: 1 5 2 1 R2 R2 R1 1 5 0 18 12 2 1 R R 2R1 1 5
More informationProof of convergence: KKT criterion
Efficient l point triangulation through polyhedron collapse Supplementary material March 6, 205 Part I Proof of convergence: KKT criterion Introduction In the paper Efficient l point triangulation through
More informationVector Bundles on Algebraic Varieties
Vector Bundles on Algebraic Varieties Aaron Pribadi December 14, 2010 Informally, a vector bundle associates a vector space with each point of another space. Vector bundles may be constructed over general
More information2018 Fall 2210Q Section 013 Midterm Exam II Solution
08 Fall 0Q Section 0 Midterm Exam II Solution True or False questions points 0 0 points) ) Let A be an n n matrix. If the equation Ax b has at least one solution for each b R n, then the solution is unique
More informationDimension. Eigenvalue and eigenvector
Dimension. Eigenvalue and eigenvector Math 112, week 9 Goals: Bases, dimension, rank-nullity theorem. Eigenvalue and eigenvector. Suggested Textbook Readings: Sections 4.5, 4.6, 5.1, 5.2 Week 9: Dimension,
More informationMATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.
MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.
More information(a) II and III (b) I (c) I and III (d) I and II and III (e) None are true.
1 Which of the following statements is always true? I The null space of an m n matrix is a subspace of R m II If the set B = {v 1,, v n } spans a vector space V and dimv = n, then B is a basis for V III
More informationOnline Exercises for Linear Algebra XM511
This document lists the online exercises for XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Lecture 02 ( 1.1) Online Exercises for Linear Algebra XM511 1) The matrix [3 2
More informationThe definition of a vector space (V, +, )
The definition of a vector space (V, +, ) 1. For any u and v in V, u + v is also in V. 2. For any u and v in V, u + v = v + u. 3. For any u, v, w in V, u + ( v + w) = ( u + v) + w. 4. There is an element
More informationSCHUR-WEYL DUALITY FOR U(n)
SCHUR-WEYL DUALITY FOR U(n) EVAN JENKINS Abstract. These are notes from a lecture given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in December 2009.
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Scene Planes & Homographies Lecture 19 March 24, 2005 2 In our last lecture, we examined various
More information15 Singular Value Decomposition
15 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 informationMATH 20F: LINEAR ALGEBRA LECTURE B00 (T. KEMP)
MATH 20F: LINEAR ALGEBRA LECTURE B00 (T KEMP) Definition 01 If T (x) = Ax is a linear transformation from R n to R m then Nul (T ) = {x R n : T (x) = 0} = Nul (A) Ran (T ) = {Ax R m : x R n } = {b R m
More informationMATH 31 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL
MATH 3 - ADDITIONAL PRACTICE PROBLEMS FOR FINAL MAIN TOPICS FOR THE FINAL EXAM:. Vectors. Dot product. Cross product. Geometric applications. 2. Row reduction. Null space, column space, row space, left
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW When we define a term, we put it in boldface. This is a very compressed review; please read it very carefully and be sure to ask questions on parts you aren t sure of. x 1 WedenotethesetofrealnumbersbyR.
More informationPRACTICE PROBLEMS FOR THE FINAL
PRACTICE PROBLEMS FOR THE FINAL Here are a slew of practice problems for the final culled from old exams:. Let P be the vector space of polynomials of degree at most. Let B = {, (t ), t + t }. (a) Show
More informationMH1200 Final 2014/2015
MH200 Final 204/205 November 22, 204 QUESTION. (20 marks) Let where a R. A = 2 3 4, B = 2 3 4, 3 6 a 3 6 0. For what values of a is A singular? 2. What is the minimum value of the rank of A over all a
More informationOHSx XM511 Linear Algebra: Solutions to Online True/False Exercises
This document gives the solutions to all of the online exercises for OHSx XM511. The section ( ) numbers refer to the textbook. TYPE I are True/False. Answers are in square brackets [. Lecture 02 ( 1.1)
More informationMTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~
MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~ Question No: 1 (Marks: 1) If for a linear transformation the equation T(x) =0 has only the trivial solution then T is One-to-one Onto Question
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More information1 Last time: determinants
1 Last time: determinants Let n be a positive integer If A is an n n matrix, then its determinant is the number det A = Π(X, A)( 1) inv(x) X S n where S n is the set of n n permutation matrices Π(X, A)
More informationMath 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam
Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system
More informationREPRESENTATIONS OF S n AND GL(n, C)
REPRESENTATIONS OF S n AND GL(n, C) SEAN MCAFEE 1 outline For a given finite group G, we have that the number of irreducible representations of G is equal to the number of conjugacy classes of G Although
More informationMATH 2210Q MIDTERM EXAM I PRACTICE PROBLEMS
MATH Q MIDTERM EXAM I PRACTICE PROBLEMS Date and place: Thursday, November, 8, in-class exam Section : : :5pm at MONT Section : 9: :5pm at MONT 5 Material: Sections,, 7 Lecture 9 8, Quiz, Worksheet 9 8,
More informationUniqueness of the Solutions of Some Completion Problems
Uniqueness of the Solutions of Some Completion Problems Chi-Kwong Li and Tom Milligan Abstract We determine the conditions for uniqueness of the solutions of several completion problems including the positive
More informationTwo-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix
Two-View Segmentation of Dynamic Scenes from the Multibody Fundamental Matrix René Vidal Stefano Soatto Shankar Sastry Department of EECS, UC Berkeley Department of Computer Sciences, UCLA 30 Cory Hall,
More informationYORK UNIVERSITY. Faculty of Science Department of Mathematics and Statistics MATH M Test #1. July 11, 2013 Solutions
YORK UNIVERSITY Faculty of Science Department of Mathematics and Statistics MATH 222 3. M Test # July, 23 Solutions. For each statement indicate whether it is always TRUE or sometimes FALSE. Note: For
More information19. Basis and Dimension
9. Basis and Dimension In the last Section we established the notion of a linearly independent set of vectors in a vector space V and of a set of vectors that span V. We saw that any set of vectors that
More informationLecture 12: Diagonalization
Lecture : Diagonalization A square matrix D is called diagonal if all but diagonal entries are zero: a a D a n 5 n n. () Diagonal matrices are the simplest matrices that are basically equivalent to vectors
More informationAbstract Vector Spaces
CHAPTER 1 Abstract Vector Spaces 1.1 Vector Spaces Let K be a field, i.e. a number system where you can add, subtract, multiply and divide. In this course we will take K to be R, C or Q. Definition 1.1.
More informationMath 54. Selected Solutions for Week 5
Math 54. Selected Solutions for Week 5 Section 4. (Page 94) 8. Consider the following two systems of equations: 5x + x 3x 3 = 5x + x 3x 3 = 9x + x + 5x 3 = 4x + x 6x 3 = 9 9x + x + 5x 3 = 5 4x + x 6x 3
More informationMidterm solutions. (50 points) 2 (10 points) 3 (10 points) 4 (10 points) 5 (10 points)
Midterm solutions Advanced Linear Algebra (Math 340) Instructor: Jarod Alper April 26, 2017 Name: } {{ } Read all of the following information before starting the exam: You may not consult any outside
More informationA = u + V. u + (0) = u
Recall: Last time we defined an affine subset of R n to be a subset of the form A = u + V = {u + v u R n,v V } where V is a subspace of R n We said that we would use the notation A = {u,v } to indicate
More informationSystems of Linear Equations
LECTURE 6 Systems of Linear Equations You may recall that in Math 303, matrices were first introduced as a means of encapsulating the essential data underlying a system of linear equations; that is to
More informationGROUP THEORY PRIMER. New terms: tensor, rank k tensor, Young tableau, Young diagram, hook, hook length, factors over hooks rule
GROUP THEORY PRIMER New terms: tensor, rank k tensor, Young tableau, Young diagram, hook, hook length, factors over hooks rule 1. Tensor methods for su(n) To study some aspects of representations of a
More informationMathematical contributions to the theory of Dirac matrices
Contributions mathématiques à la théorie des matrices de Dirac nn. de l Inst. Henri Poincaré 6 (936) 09-36. Mathematical contributions to the theory of Dirac matrices By W. PULI Zurich Translated by D
More informationAnnouncements Monday, October 29
Announcements Monday, October 29 WeBWorK on determinents due on Wednesday at :59pm. The quiz on Friday covers 5., 5.2, 5.3. My office is Skiles 244 and Rabinoffice hours are: Mondays, 2 pm; Wednesdays,
More informationSome notes on linear algebra
Some notes on linear algebra Throughout these notes, k denotes a field (often called the scalars in this context). Recall that this means that there are two binary operations on k, denoted + and, that
More informationHomework 11/Solutions. (Section 6.8 Exercise 3). Which pairs of the following vector spaces are isomorphic?
MTH 9-4 Linear Algebra I F Section Exercises 6.8,4,5 7.,b 7.,, Homework /Solutions (Section 6.8 Exercise ). Which pairs of the following vector spaces are isomorphic? R 7, R, M(, ), M(, 4), M(4, ), P 6,
More informationChapter Two Elements of Linear Algebra
Chapter Two Elements of Linear Algebra Previously, in chapter one, we have considered single first order differential equations involving a single unknown function. In the next chapter we will begin to
More informationProblem # Max points possible Actual score Total 120
FINAL EXAMINATION - MATH 2121, FALL 2017. Name: ID#: Email: Lecture & Tutorial: Problem # Max points possible Actual score 1 15 2 15 3 10 4 15 5 15 6 15 7 10 8 10 9 15 Total 120 You have 180 minutes to
More informationCitation Osaka Journal of Mathematics. 43(2)
TitleIrreducible representations of the Author(s) Kosuda, Masashi Citation Osaka Journal of Mathematics. 43(2) Issue 2006-06 Date Text Version publisher URL http://hdl.handle.net/094/0396 DOI Rights Osaka
More information,, rectilinear,, spherical,, cylindrical. (6.1)
Lecture 6 Review of Vectors Physics in more than one dimension (See Chapter 3 in Boas, but we try to take a more general approach and in a slightly different order) Recall that in the previous two lectures
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Trifocal Tensor Lecture 21 March 31, 2005 2 Lord Shiva is depicted as having three eyes. The
More informationMTH 35, SPRING 2017 NIKOS APOSTOLAKIS
MTH 35, SPRING 2017 NIKOS APOSTOLAKIS 1. Linear independence Example 1. Recall the set S = {a i : i = 1,...,5} R 4 of the last two lectures, where a 1 = (1,1,3,1) a 2 = (2,1,2, 1) a 3 = (7,3,5, 5) a 4
More informationWe simply compute: for v = x i e i, bilinearity of B implies that Q B (v) = B(v, v) is given by xi x j B(e i, e j ) =
Math 395. Quadratic spaces over R 1. Algebraic preliminaries Let V be a vector space over a field F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v) for all v V and c F, and
More informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More information1. Let V, W be two vector spaces over F and let T : V W be a set theoretic map. Prove that the following are equivalent: T (cu + v) = ct (u) + T (v)
Math 790 Test 3 (Solutions) Satya Mandal Fall 05 Each Problem 10 points Due on: October 2, 2005 I like short proofs and elmentary proof. Unless otherwise stated, F is a field and V, W are two vector sapces
More informationMAT 242 CHAPTER 4: SUBSPACES OF R n
MAT 242 CHAPTER 4: SUBSPACES OF R n JOHN QUIGG 1. Subspaces Recall that R n is the set of n 1 matrices, also called vectors, and satisfies the following properties: x + y = y + x x + (y + z) = (x + y)
More informationMiderm II Solutions To find the inverse we row-reduce the augumented matrix [I A]. In our case, we row reduce
Miderm II Solutions Problem. [8 points] (i) [4] Find the inverse of the matrix A = To find the inverse we row-reduce the augumented matrix [I A]. In our case, we row reduce We have A = 2 2 (ii) [2] Possibly
More informationDIAGONALIZATION. In order to see the implications of this definition, let us consider the following example Example 1. Consider the matrix
DIAGONALIZATION Definition We say that a matrix A of size n n is diagonalizable if there is a basis of R n consisting of eigenvectors of A ie if there are n linearly independent vectors v v n such that
More informationMore chapter 3...linear dependence and independence... vectors
More chapter 3...linear dependence and independence... vectors It is important to determine if a set of vectors is linearly dependent or independent Consider a set of vectors A, B, and C. If we can find
More informationLECTURE 16: TENSOR PRODUCTS
LECTURE 16: TENSOR PRODUCTS We address an aesthetic concern raised by bilinear forms: the source of a bilinear function is not a vector space. When doing linear algebra, we want to be able to bring all
More informationMath 115 Midterm Solutions
Math 115 Midterm Solutions 1. (25 points) (a) (10 points) Let S = {0, 1, 2}. Find polynomials with real coefficients of degree 2 P 0, P 1, and P 2 such that P i (i) = 1 and P i (j) = 0 when i j, for i,
More informationLecture 9: Vector Algebra
Lecture 9: Vector Algebra Linear combination of vectors Geometric interpretation Interpreting as Matrix-Vector Multiplication Span of a set of vectors Vector Spaces and Subspaces Linearly Independent/Dependent
More informationMA 265 FINAL EXAM Fall 2012
MA 265 FINAL EXAM Fall 22 NAME: INSTRUCTOR S NAME:. There are a total of 25 problems. You should show work on the exam sheet, and pencil in the correct answer on the scantron. 2. No books, notes, or calculators
More informationPattern Recognition and Machine Learning. Learning and Evaluation of Pattern Recognition Processes
Pattern Recognition and Machine Learning James L. Crowley ENSIMAG 3 - MMIS Fall Semester 2016 Lesson 1 5 October 2016 Learning and Evaluation of Pattern Recognition Processes Outline Notation...2 1. The
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationMath 407: Linear Optimization
Math 407: Linear Optimization Lecture 16: The Linear Least Squares Problem II Math Dept, University of Washington February 28, 2018 Lecture 16: The Linear Least Squares Problem II (Math Dept, University
More informationThus, the integral closure A i of A in F i is a finitely generated (and torsion-free) A-module. It is not a priori clear if the A i s are locally
Math 248A. Discriminants and étale algebras Let A be a noetherian domain with fraction field F. Let B be an A-algebra that is finitely generated and torsion-free as an A-module with B also locally free
More informationREPRESENTATION THEORY OF S n
REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November
More informationAlgorithms to Compute Bases and the Rank of a Matrix
Algorithms to Compute Bases and the Rank of a Matrix Subspaces associated to a matrix Suppose that A is an m n matrix The row space of A is the subspace of R n spanned by the rows of A The column space
More informationThis MUST hold matrix multiplication satisfies the distributive property.
The columns of AB are combinations of the columns of A. The reason is that each column of AB equals A times the corresponding column of B. But that is a linear combination of the columns of A with coefficients
More informationLecture 11: Dimension. How does Span(S) vary with S
Lecture 11: Dimension Aim Lecture A basis {v 1,..., v n } of V gives n-dim coord system. Suggests V is n-dimensional. Need theory to ensure any two bases have the same number of vectors. How does Span(S)
More informationMTH 464: Computational Linear Algebra
MTH 464: Computational Linear Algebra Lecture Outlines Exam 2 Material Prof. M. Beauregard Department of Mathematics & Statistics Stephen F. Austin State University March 2, 2018 Linear Algebra (MTH 464)
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW SPENCER BECKER-KAHN Basic Definitions Domain and Codomain. Let f : X Y be any function. This notation means that X is the domain of f and Y is the codomain of f. This means that for
More informationMath 1060 Linear Algebra Homework Exercises 1 1. Find the complete solutions (if any!) to each of the following systems of simultaneous equations:
Homework Exercises 1 1 Find the complete solutions (if any!) to each of the following systems of simultaneous equations: (i) x 4y + 3z = 2 3x 11y + 13z = 3 2x 9y + 2z = 7 x 2y + 6z = 2 (ii) x 4y + 3z =
More informationhe Applications of Tensor Factorization in Inference, Clustering, Graph Theory, Coding and Visual Representation
he Applications of Tensor Factorization in Inference, Clustering, Graph Theory, Coding and Visual Representation Amnon Shashua School of Computer Science & Eng. The Hebrew University Matrix Factorization
More informationSolutions to Final Exam
Solutions to Final Exam. Let A be a 3 5 matrix. Let b be a nonzero 5-vector. Assume that the nullity of A is. (a) What is the rank of A? 3 (b) Are the rows of A linearly independent? (c) Are the columns
More informationMATH 220 FINAL EXAMINATION December 13, Name ID # Section #
MATH 22 FINAL EXAMINATION December 3, 2 Name ID # Section # There are??multiple choice questions. Each problem is worth 5 points. Four possible answers are given for each problem, only one of which is
More informationLecture 1: Systems of linear equations and their solutions
Lecture 1: Systems of linear equations and their solutions Course overview Topics to be covered this semester: Systems of linear equations and Gaussian elimination: Solving linear equations and applications
More informationMath 3C Lecture 25. John Douglas Moore
Math 3C Lecture 25 John Douglas Moore June 1, 2009 Let V be a vector space. A basis for V is a collection of vectors {v 1,..., v k } such that 1. V = Span{v 1,..., v k }, and 2. {v 1,..., v k } are linearly
More informationMath 1553 Introduction to Linear Algebra
Math 1553 Introduction to Linear Algebra Lecture Notes Chapter 2 Matrix Algebra School of Mathematics The Georgia Institute of Technology Math 1553 Lecture Notes for Chapter 2 Introduction, Slide 1 Section
More informationMATH10212 Linear Algebra B Homework 6. Be prepared to answer the following oral questions if asked in the supervision class:
MATH0 Linear Algebra B Homework 6 Students are strongly advised to acquire a copy of the Textbook: D C Lay, Linear Algebra its Applications Pearson, 006 (or other editions) Normally, homework assignments
More informationSecond Midterm Exam April 14, 2011 Answers., and
Mathematics 34, Spring Problem ( points) (a) Consider the matrices all matrices. Second Midterm Exam April 4, Answers [ Do these matrices span M? ] [, ] [, and Lectures & (Wilson) ], as vectors in the
More informationEXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)
EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily
More informationLECTURES 14/15: LINEAR INDEPENDENCE AND BASES
LECTURES 14/15: LINEAR INDEPENDENCE AND BASES MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1. Linear Independence We have seen in examples of span sets of vectors that sometimes adding additional vectors
More informationVector Spaces and Linear Transformations
Vector Spaces and Linear Transformations Wei Shi, Jinan University 2017.11.1 1 / 18 Definition (Field) A field F = {F, +, } is an algebraic structure formed by a set F, and closed under binary operations
More information(1.1) In particular, ψ( q 1, m 1 ; ; q N, m N ) 2 is the probability to find the first particle
Chapter 1 Identical particles 1.1 Distinguishable particles The Hilbert space of N has to be a subspace H = N n=1h n. Observables Ân of the n-th particle are self-adjoint operators of the form 1 1 1 1
More informationx 2 For example, Theorem If S 1, S 2 are subspaces of R n, then S 1 S 2 is a subspace of R n. Proof. Problem 3.
.. Intersections and Sums of Subspaces Until now, subspaces have been static objects that do not interact, but that is about to change. In this section, we discuss the operations of intersection and addition
More informationVECTOR SPACES & SUBSPACES
VECTOR SPACES & SUBSPACES Definition: The real Vector Space " V " is the set of all entities called "vectors" with real entries that satisfy two closure properties and obey a set of eight rules. If "x"
More informationMATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS
MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS There will be eight problems on the final. The following are sample problems. Problem 1. Let F be the vector space of all real valued functions on
More informationLecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1)
Lecture 11: Finish Gaussian elimination and applications; intro to eigenvalues and eigenvectors (1) Travis Schedler Tue, Oct 18, 2011 (version: Tue, Oct 18, 6:00 PM) Goals (2) Solving systems of equations
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationHOMEWORK 9 solutions
Math 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A Fall 2013 HOMEWORK 9 solutions Due 4pm Wednesday, November 13. You will be graded not only on the correctness of your answers but
More informationLECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK)
LECTURE 6: VECTOR SPACES II (CHAPTER 3 IN THE BOOK) In this lecture, F is a fixed field. One can assume F = R or C. 1. More about the spanning set 1.1. Let S = { v 1, v n } be n vectors in V, we have defined
More informationRow Space and Column Space of a Matrix
Row Space and Column Space of a Matrix 1/18 Summary: To a m n matrix A = (a ij ), we can naturally associate subspaces of K n and of K m, called the row space of A and the column space of A, respectively.
More informationSolutions to Final Practice Problems Written by Victoria Kala Last updated 12/5/2015
Solutions to Final Practice Problems Written by Victoria Kala vtkala@math.ucsb.edu Last updated /5/05 Answers This page contains answers only. See the following pages for detailed solutions. (. (a x. See
More informationMATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003
MATH 23a, FALL 2002 THEORETICAL LINEAR ALGEBRA AND MULTIVARIABLE CALCULUS Solutions to Final Exam (in-class portion) January 22, 2003 1. True or False (28 points, 2 each) T or F If V is a vector space
More informationWhat is on this week. 1 Vector spaces (continued) 1.1 Null space and Column Space of a matrix
Professor Joana Amorim, jamorim@bu.edu What is on this week Vector spaces (continued). Null space and Column Space of a matrix............................. Null Space...........................................2
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
More information