Definition of entanglement for pure and mixed states
|
|
- Lizbeth Higgins
- 7 years ago
- Views:
Transcription
1 Definition of entanglement for pure and mixed states seminar talk given by Marius Krumm in the master studies seminar course Selected Topics in Mathematical Physics: Quantum Information Theory at the University of Heidelberg bstract: keypoint in which quantum mechanics differs from classical mechanics is the possibility of (quantum) entanglement. Entanglement is an important resource in quantum information theory and quantum computation and can be used to realize many surprising effects like quantum teleportation. This document is a written elaboration of the seminar lecture Definition of entanglement for pure and mixed states by Marius Krumm as part of the master studies seminar course Selected Topics in Mathematical Physics: Quantum Information Theory at the University of Heidelberg. Its purpose is to give an introduction to entanglement. In the beginning, we define entanglement for pure and mixed states. fterwards, the von Neumann entropy is introduced as an entanglement measure for pure states. t last, there will be a short discussion of entanglement witnesses.
2 2 1 Introduction fundamental element of quantum information science is quantum entanglement. It can be used to realize surprising effects like quantum teleportation and is considered as an important resource in quantum computation. The aim of this document is to give a first introduction to quantum entanglement and its quantification. This knowledge is collected from the sources found at the end of this document, which are also a good starting point to obtain further knowledge. 2 Quantum Entanglement efore we define entanglement, at first we provide a tool that will prove useful several times. Theorem 1 (Schmidt decomposition). Let H, H be two Hilbert spaces and ψ a normalized state in H H. Then there exist orthonormal sets { j }, { j } in H, H, such that: ψ = pj j j. (2.1) j Here p j are the non-zero eigenvalues of ρ := Tr ( ψ ψ ). Proof. We define ρ := ψ ψ. Furthermore we expand ψ in an orthonormal eigenbasis { j } of ρ (i.e. ρ = j p j j j ) and an arbitrary orthonormal basis { k } of H : ψ = j,k a jk j k. Now we define ĵ := k a jk k to obtain ψ = j j ĵ. We claim, that these vectors are orthogonal: ˆk ĵ δ jk. To prove this claim, we expand the density matrix: ρ = ( j,k j ĵ )( k ˆk ). We take the partial trace: ( ( ρ = Tr j ĵ )( k ˆk )) = ( ( m j ĵ )( k ˆk )) m j,k m = m,j,k = jk [ ] m ĵ ˆk m j k = j,k ˆk ĵ j k j,k [ ( ) ] ˆk m m ĵ j k m We compare to ρ = j p j j j and indeed find ˆk ĵ = p j δ jk. For those j with p j = 0 we find ĵ ĵ = 0 and thus ĵ = 0. For the j with p j 0 we can define j := 1 pj ĵ. Thus we have an orthonormal set ( k j = δ jk) that allows us to write ψ like in eq. (2.1).
3 3 Corollary 1. Let ψ be a normalized state in H H. Then ρ := Tr ( ψ ψ ) and ρ := Tr ( ψ ψ ) have the same non-zero eigenvalues. Proof. We apply the Schmidt decomposition: ψ = j pj j j. Thus we find ρ = Tr ( j,k pj p k ( j j )( k k )) = m,j,k pj p k m j k m j k = j p j j j This is the spectral decomposition of ρ, which shows that ρ also has the non-zero eigenvalues p j. Definition 1 (Schmidt number). The Schmidt number or Schmidt rank of a pure state ψ H H is defined as the number of non-zero eigenvalues of ρ or ρ : SR( ψ ) := #{j p j 0} (2.2) Definition 2 (Entanglement of pure states). Let ψ H H be a pure state. We call ψ entangled or non-separable if its Schmidt number is larger than 1. Theorem 2. Let ψ H H be a pure state. Then: ψ entangled a H, b H such that ψ = a b Proof. If ψ is entangled, it cannot be written as a b, because that state would have Schmidt number 1. nd vice versa, if ψ cannot be written as a b, then its Schmidt decomposition contains at least 2 summands and thus the Schmidt number is at least 2. Definition 3. Let ψ H H be a pure state, dim(h ) dim(h ). Then ψ maximally entangled : ρ = 1 dim(h ) Example 1. n example for a maximally entangled state (in a composite system of two spin- 1 systems) is the ell state ψ 2 = 1 2 ( + ). It has Schmidt rank 2. It may describe the full composite quantum system. ut only after a measurement we can tell if the spin of system is up or down. ut if have measured the spin of, we also know the spin of without any further measurement.
4 4 Definition 4 (General definition of entanglement). state ρ on H H is called non-entangled/separable if there exist density operators ρ (j), ρ(j) and p j 0 with j p j = 1 such that: ρ = p j ρ (j) ρ(j) (2.3) j The idea behind that definition is: systems described by ρ (j) ρ(j) are completely independent of each other. Now assume two physicists lice (system ) and ob (system ) use classical communication: lice rolls a dice, which has the result j with probability p j, and tells ob the result; Then lice produces ρ (j) and ob ρ(j). They repeat this procedure many times and forget, which j belongs to the samples. Then the resulting ensemble is described by eq. (2.3). Theorem 3. For a pure state ψ H H, definition (4) reduces to definition (2). Proof. We first assume ρ = j p jρ (j) ρ(j) = ψ ψ. We define ρ j := ρ (j) ρ(j) (again a density operator). Complete ψ to an orthonormal basis { ψ, φ 1, φ 2...}. Furthermore we perform an eigen-decomposition: ρ j = k a(j) k 0. Then we find 0 = φ x ρ φ x = j,k p ja (j) k a(j) k a(j) k with a(j) k > φ x a (j) k a(j) k φ x and thus φ x a (j) k 2 = ψ we find a (j) ψ. We thus found 0. s a (j) k k ρ j = ρ and thus ρ = ρ ρ for some ρ and ρ. Now we notice ρ 2 = ρ2 ρ2 = x φ x a j k φ x + ψ a (j) k and thus 1 = Tr(ρ 2 ) = Tr (ρ 2 ) Tr (ρ 2 ) and thus Tr(ρ2 ) = 1, which means that ρ is pure and thus Schmidt number = 1. Now we assume ψ = φ α. Then ρ = φ φ α α. Theorem 4. ρ separable sets of normalized states { a (j) j p j = 1 such that ρ = j p j a (j) a(j) b(j) b(j) Proof. : We simply set ρ (j) := a(j) a(j) and ρ(j) := b(j) b(j). and ρ(j) }, { b(j) }, p j 0 with : We perform an eigenvalue decomposition of all ρ (j). y relabeling and change of numeration we achieve the desired form. full proof is found in ppendix. So far we have only defined entanglement. Now we want to find a notion for how strongly a state is entangled. For a pure state, this is done by the von Neumann entropy. Definition 5. Let ρ be an arbitrary density operator. Then the von Neumann entropy is defined as: S(ρ) = Tr(ρ log 2 ρ) (2.4)
5 5 If p j are the eigenvalues of ρ, then we can rewrite the entropy as 1 S(ρ) = j p j log 2 p j (2.5) Example ρ = ( ) 1 0 has eigenvalues 0 and 1 S(ρ) = ψ = 1 2 ( + ). Then ρ = ψ ψ ˆ= 1 2 again S(ρ) = 0. ( 1 ) 0 3. ρ = 2 S(ρ) = log 2 (2) ( ) 1 1. s ρ has eigenvalues 0, 1, 1 1 Theorem 5 (General properties of the von Neumann entropy). 1. S(ρ) 0 and S(ρ) = 0 ρ pure state 2. dim(h) = d S(ρ) log 2 (d) and S(ρ) = log(d) ρ = 1 d 3. ρ on H H pure S(ρ ) = S(ρ ). 4. Let p j 0, j p j = 1, ρ j density operators which have support on orthogonal subspaces 2. Then S( j p jρ j ) = H({p j }) + j p js(ρ j ), where H({p j }) = j p j log 2 p j is the Shannon entropy. 5. Joint Entropy Theorem: Let p j 0, j p j = 1, { j } H orthonormal, ρ j density operators on H. Then S( j p j j j ρ j ) = H({p j })+ j p js(ρ j ) 6. ρ, ρ density operators on H, H. Then S(ρ ρ ) = S(ρ ) + S(ρ ). Proof. 1. s all eigenvalues p j [0, 1], we find S(ρ) = j p j log 2 p j 0 because p j log 2 p j 0. Furthermore p j log 2 p j = 0 p j {0, 1}. s the p j form a probability distribution, we find S(ρ) = 0 j : p j = 1 state pure 1 For a hermitian operator with eigenvalue-decomposition = j a j a j a j (where { a j } is an orthonormal basis) and a function f : C C, we define f() := j f(a j) a j a j. Especially this implies that ρ log 2 ρ has the eigenvalues p j log 2 p j. Furthermore we define 0 log 2 0 := 0. 2 For a hermitian operator = j a j a j a j (where { a j } is an orthonormal basis), the support is defined as span{ a j a j 0}. If and have orthogonal support, then a j = 0 for a j 0.
6 6 2. We prove this claim by induction. t first assume d = 1. Then we have p 1 = 1 and thus S(ρ) = 0 = log 2 1. Now assume we already know: d 1 j=1 p j log 2 p j log 2 (d 1) for all {p j j {1, 2,..., d 1}} with p j 0, d 1 j=1 p j = 1. We consider now {p j j {1, 2,..., d}} with p j 0, d j=1 p j = 1. We impose this last constraint by identifying p d as function of the other eigenvalues: p d = p d (p 1,..., p d 1 ) = 1 d 1 j=1 p j. This function is defined for p := (p 1,...p d 1 ) D := [0, 1] d 1 { q d 1 j=1 q j 1} (see figure 2.1). Here, we demand d 1 j=1 p j 1 because we want p d [0, 1]. s D is compact, there must exist a global maximum. To find the border of this set, we notice that [0, 1] d 1 is a hypercube, while { q d 1 j=1 q j 1} constrains us to one half of that cube, because { q d 1 j=1 q j = 1} is a hyperplane (compare ppendix ) which splits R d 1 and [0, 1] d 1 in two parts. Then the border is given by the sides of the hypercube (with j : p j = 0) and the part of the hyperplane, that lies in the cube (here p d = 0). Thus on D, we always have at least one p j = 0, wlog we assume p d = 0. ut we already know d 1 j=1 p j log 2 p j log 2 (d 1). However, S( 1 d d ) = log 2 d, so we have to look for our maximum in the interior D 0 = D \ D. Here, every global maximum is also a local maximum. Such maxima must satisfy p ( d j=1 p j log 2 p j ) = 0. For k {1, 2,...d 1} we find p k ( d j=1 p j log 2 (e) ln(p j )) = 0 0 = ln p k 1 + ln p d + 1 p k = p d. Thus our maximum is indeed found for ρ = 1 d d and S(ρ) = log 2 d. Figure 2.1: The domain of p = (p 1,...p d 1 ) for d = 4 dimensions (left) and d = 3 dimensions (right). 3. We know that ρ and ρ have the same non-zero eigenvalues. S(ρ ) and S(ρ ) depend only on the eigenvalues. 4. We perform eigenvalue decompositions: ρ i = j p(i) j orthogonal supports, the p (i) j with p(i) p (i) j p(i) j. ecause of the j 0 are also eigenstates of the other ρ k with ρ k p (i) j = 0. This implies that j p jρ j also has the eigenstates p (i) j, with eigenvalues p i p (i) j. Thus we find S( j p jρ j ) = i,j p ip (i) j log 2 (p i p (i) j ) = i p i log 2 p i + i p ( i j p(i) j log 2 p (i) ) j = H({pj }) + i p is(ρ i ). 5. The j j ρ j obviously have orthogonal supports, and S( j j ρ j ) = S(ρ j ) because j j ρ j and ρ j have the same non-zero eigenvalues.
7 7 6. Use the joint entropy theorem with ρ j := ρ j and j p j j j = ρ. Then H({p j }) = S(ρ ) and j p js(ρ ) = S(ρ ). Theorem 6 (Von Neumann entropy as measure for pure state entanglement). Let ρ = ψ ψ be a pure state on H H, dim(h ) dim(h ). Then: 1. S(ρ ) = 0 ψ separable, S(ρ ) > 0 ψ entangled 2. S(ρ ) = log(dimh ) ( = maximal ) ψ maximally entangled Proof. 1. S(ρ ) = 0 ρ pure Schmidt number = 1 separable 2. S(ρ ) maximal ρ = 1 dimh maximally entangled The last theorem shows that the von Neumann entropy is a good measure for entanglement of pure states. For mixed states, it is much harder to find good entanglement measures, because one has additional classical correlations that need to be distinguished from quantum entanglement. There exist many measures, but none of them is perfect. s a simple example to show why the von Neumann entropy is a bad measure for entanglement of mixed states we consider ρ = ρ ρ. This mixed stated is non-entangled. However, we are completely free to choose ρ. We could 1 take ρ = ψ ψ with S(ρ ) = 0 or ρ = dim(h ) 1 with S(ρ ) = log 2 (dim(h )). Thus even for non-entangled states, S(ρ ) can take values between its minimum and maximum and is thus a bad measure. n idea to detect entanglement of mixed states is given by entanglement witnesses. efore we state the Entanglement Witness Theorem, at first we need to prove a few statements: Theorem The density operators form a convex set 3 : D := {ρ ψ ρ ψ 0 ψ, ρ = ρ, Tr(ρ) = 1} (2.6) 2. The separable density operators form a convex set: S := {ρ D ρ separable } (2.7) Proof. 1. Let, D, p [0, 1]. Then Tr(p + (1 p)) = ptr() + (1 p)tr() = 1. lso (p + (1 p)) = (p + (1 p)) and ψ [p + (1 p)] ψ = p ψ ψ + (1 p) ψ ψ 0 3 set is called convex, if for all,, p [0, 1] also p + (1 p)
8 8 2. ρ, σ D separable density operators ρ (j) j p j = j q j = 1 such that: ρ = m j=1 p jρ (j), ρ(j), σ(j), σ(j) ρ(j) For j {1,..., m} and a [0, 1] we define r j := ap j and τ (j) For j {m + 1,..., m + n} we define r j τ (j) := σ(j m) n+m j=1 r jτ (j). Then we find r j [0, 1], n+m τ (j) S and p j, q j 0 with and σ = n j=1 q jσ (j) := ρ(j), τ (j) σ(j). := ρ(j). := σ(j m), := (1 a)q j m and τ (j) j=1 r j = 1 and aρ + (1 a)σ = Theorem 8 (Entanglement witness theorem (EWT)). Let ρ be an arbitrary density operator on a finite-dimensional Hilbert space H H. We define M := { linear operator on H H with = }. Then: ρ entangled W M : Tr(ρW ) < 0 and Tr(σW ) 0 for all separable density operators σ. Proof(sketch). We assume that ρ D is entangled. M is a real vector space with scalar product, := Tr( ) = Tr() (see ppendix C for more information). s we have learned from theorem 7, we have the situation shown in figure 2.2 (left image). It is intuitive, that there exists a hyperplane which separates ρ and S. 4 Figure 2.2: The set of density operators D is convex and contains the convex set of separable density operators S. lso shown is the hyperplane that separates S and the entangled density operator ρ. Let this hyperplane be described by Tr(Ŵ τ) = Ŵ, τ = c (see also ppendix ), where Ŵ = Ŵ is the normal vector of the hyperplane, chosen such that Tr(Ŵ ρ) = Ŵ, ρ < c and Tr(Ŵ σ) = Ŵ, σ c σ S. Now instead of Ŵ, we take W := Ŵ c1. Then we find (τ D): W, τ < 0 Tr(W τ) < 0 Tr(Ŵ τ) ctr(τ) < 0 Tr(Ŵ τ) < c Ŵ, τ < c We also find Ŵ, τ = c W, τ = 0 and Ŵ, τ > c W, τ > 0. Thus we are now in the situation shown in figure 2.2(right image) and W fulfills the EWT. 4 The existence of this hyperplane follows from the Hahn-anach theorem of functional analysis.
9 9 Comment. s shown in ppendix C, the density operators can all be found in a hyperplane T := { M Tr() = 1} M. This means that T and the other hyperplane orthogonal to W intersect in an even lower dimensional line. This gives us the freedom to chose another W to effectively tilt the hyperplane such that the origin is also found in that plane. This is what we have done by replacing Ŵ with W. The whole situation is visualized in figure 2.3. Figure 2.3: The density operators can be found in an affine hyperplane T. The plane that we obtain from the Hahn-anach theorem can be tilted such that it contains the origin. 3 Conclusion In this document we have introduced entanglement for pure and mixed states. We have discussed the von Neumann entropy as measure for entanglement of pure states. However, many aspects of entanglement have not been adressed in this introduction, e.g. what entanglement can be used for and what its application for information science is. We also have not discussed the problems with the interpretation of entanglement, e.g. why it does not allow for faster-than-light communication. lso a delicate topic is how to define entanglement measures for mixed states. Here one typically defines some properties that such an measure should satisfy and defines measures constructed such that the constraints are fulfilled. There exist a lot of such measures; but many of them are hard to calculate. ppendix: Extended Proof Of Theorem 4 We start with a separable (mixed) state: ρ = a j=1 p jρ (j) expansion of all density operators and obtain: ρ(j). We perform a spectral ρ = a p j ( j=1 b q k q k q k ) ( k=1 c r l r l r l ) = l=1 a,b,c j,k,l=1 (p j q k r l ) q k q k r l r l
10 10 Now we define a bijection f : N 3 N and := f({1, 2,...a} {1, 2,...b} {1, 2,...c}) (see e.g. figure.1). Then f : {1, 2,...a} {1, 2,...b} {1, 2,...c} is also a bijection. Now we define t f(j,k,l) := p j q k r l, α f(j,k,l) := q k and β f(j,k,l) := r l. Thus: ρ = a,b,c j,k,l=1 t f(j,k,l) α f(j,k,l) α f(j,k,l) β f(j,k,l) β f(j,k,l) = f t f α f α f β f β f t f(j,k,l) = p j q k r l 0 and f t f = a,b,c j,k,l=1 t f(j,k,l) = ( j p j)( k q k)( l r l) = 1. Figure.1: The figure illustrates how to define a bijection g : N 2 N. With this function a bijection f : N 3 N, f(j, k, l) = g(j, g(k, l)) can be defined. ppendix: Euclidean space Here we want to recall some simple facts about planes in Euclidean space (or isomorphic spaces). Figure.1: hyperplane in 2 dimensions. The difference of two vectors pointing on the hyperplane is orthogonal to the normal vector. Figure.2: The vector p points above the plane. Let q be an arbitrary vector pointing on the hyperplane with normal vector n. Then for any vector p also pointing on the plane, we find ( p q) n = 0 (see figure.1). This last equation defines the plane. We note that the exact choice of q does not matter, because the different choices only differ in a vector orthogonal to n. Defining c := q n, we find the hyperplane to be defined by p n = c.
11 11 Now we consider a vector p that does not point on the hyperplane (see figure.2). We decompose p = q + α n, where α R and q points on the plane. Then we define p to point above the plane, if α > 0. This implies p n = α n 2 + q n = c + α > c. Thus we say that p points above the hyperplane if p n > c, and equivalently we say that p points below the plane if p n < c. Of course the assignment of above and below is arbitrary and can be exchanged. C Hermitian operators form a real vector space Theorem 9. The set M := { linear operator on H H with = }, where dim(h H ) <, forms a real vector space with a scalar product, := Tr( ) = Tr(). Proof. Let, M, a, b R. ddition of matrices of course is associative and + = +, the neutral element 0 is hermitian, and the inverse is hermitian if is. Furthermore ( + ) = + = +, thus (M, +) is an abelian group. Of course we also have a (+) = a +a, (a+b) = a +b, a (b) = (ab) and 1 = ; (a ) = a = a. Thus M is a real vector space 5., is linear in both arguments because matrix multiplication and Tr() are linear. ecause of Tr() = Tr(),, is also symmetric. Furthermore Tr() = Tr(() ) = Tr(), thus, : M M R is well-defined. Furthermore, for = j a j a j a j (eigenvalue decomposition) we find, = j a j 2, which means, 0 and = 0 exactly for = 0. Theorem 10. The set T := { M Tr() = 1} is a hyperplane in M given by T = 1 + ˆT, where ˆT := { M Tr() = 0}. Proof. t first we show T = 1 + ˆT : Every T we can decompose into = M + D where M ˆT contains all offdiagonal elements of, and D contains all diagonal elements of. s also Tr(D) = 1, we find Tr(D 1) = 0 and thus = 1 + ( (D 1) + M ) 1 + ˆT. Now we argue that ˆT M is a sub-vectorspace: 0 ˆT,, ˆT + ˆT because Tr( + ) = Tr() + Tr() = 0 and + hermitian too. Furthermore for ˆT, a R: a also hermitian and Tr(a ) = a Tr() = 0. Note that ˆT has one dimension less than M, because the additional condition Tr() = 0 puts exactly one constraint on the elements of. 6 5 For some a C, we find (a ) = a a. Thus M is not a complex vector space. 6 basis for ˆT could be given by E (jk) := (δ ja δ kb +δ ka δ jb ) ab for j k, Ê(jk) := (iδ ja δ kb iδ jb δ ka ) ab for j k and D (j) := (δ ja δ jb δ (j+1),a δ (j+1),b ) ab for j {1, 2,..., dim 1}. Here, E (jk) and Ê(jk) are used to obtain the off-diagonal elements. D (j) are used to obtain the diagonal elements: First we use D (1) to choose the first diagonal element; then we use D (2) to choose the second diagonal element,... The last diagonal element is uniquely determined by the condition Tr( ) = 0, which is fulfilled because all basis elements have vanishing trace. To get a basis for M, we can add (δ a,dim δ b,dim ) ab such that we can also choose the last diagonal element freely. Thus ˆT is indeed a hyperplane in M.
12 12 References [1] Quantum Computation and Quantum Information, M. Nielsen, I. Chuang, Cambridge University Press, tenth printing [2] lecture notes Physics 219 by John Preskill [3] D. ruß, G. Leuchs Lectures on Quantum Information, Wiley-VCH(2007) [4] V. Vedral, Introduction to Quantum Information Science, Oxford University Press [5] M. Piani, Lecture Notes on Entanglement Theory, IQC Waterloo, 2012 [6] bachelor thesis by Lukas Schneiderbauer, Entanglement or Separability-an introduction [7] P. Krammer Characterizing entanglement with geometric entanglement witnesses, arxiv: v2[quant-ph] [8] Diploma thesis by Philipp Krammer, Quantum Entanglement: Detection, Classification, and Quantification
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationLinear Algebra Notes
Linear Algebra Notes Chapter 19 KERNEL AND IMAGE OF A MATRIX Take an n m matrix a 11 a 12 a 1m a 21 a 22 a 2m a n1 a n2 a nm and think of it as a function A : R m R n The kernel of A is defined as Note
More information0.1 Phase Estimation Technique
Phase Estimation In this lecture we will describe Kitaev s phase estimation algorithm, and use it to obtain an alternate derivation of a quantum factoring algorithm We will also use this technique to design
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationSimilarity and Diagonalization. Similar Matrices
MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that
More informationOrthogonal Diagonalization of Symmetric Matrices
MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding
More informationAu = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.
Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry
More informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
More informationSection 6.1 - Inner Products and Norms
Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,
More information5. Linear algebra I: dimension
5. Linear algebra I: dimension 5.1 Some simple results 5.2 Bases and dimension 5.3 Homomorphisms and dimension 1. Some simple results Several observations should be made. Once stated explicitly, the proofs
More informationα = u v. In other words, Orthogonal Projection
Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v
More informationLinear Algebra Review. Vectors
Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka kosecka@cs.gmu.edu http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa Cogsci 8F Linear Algebra review UCSD Vectors The length
More informationLectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain
Lectures notes on orthogonal matrices (with exercises) 92.222 - Linear Algebra II - Spring 2004 by D. Klain 1. Orthogonal matrices and orthonormal sets An n n real-valued matrix A is said to be an orthogonal
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationMatrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
More information1 VECTOR SPACES AND SUBSPACES
1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such
More informationNotes on Symmetric Matrices
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Notes on Symmetric Matrices Prof. Nick Harvey University of British Columbia 1 Symmetric Matrices We review some basic results concerning symmetric matrices.
More information[1] Diagonal factorization
8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:
More informationChapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors
Chapter 9. General Matrices An n m matrix is an array a a a m a a a m... = [a ij]. a n a n a nm The matrix A has n row vectors and m column vectors row i (A) = [a i, a i,..., a im ] R m a j a j a nj col
More informationIntroduction to Matrix Algebra
Psychology 7291: Multivariate Statistics (Carey) 8/27/98 Matrix Algebra - 1 Introduction to Matrix Algebra Definitions: A matrix is a collection of numbers ordered by rows and columns. It is customary
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationISOMETRIES OF R n KEITH CONRAD
ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x
More informationChapter 6. Orthogonality
6.3 Orthogonal Matrices 1 Chapter 6. Orthogonality 6.3 Orthogonal Matrices Definition 6.4. An n n matrix A is orthogonal if A T A = I. Note. We will see that the columns of an orthogonal matrix must be
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationFinite dimensional topological vector spaces
Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationChapter 17. Orthogonal Matrices and Symmetries of Space
Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationName: Section Registered In:
Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 6. Eigenvalues and Singular Values In this section, we collect together the basic facts about eigenvalues and eigenvectors. From a geometrical viewpoint,
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationBOX. The density operator or density matrix for the ensemble or mixture of states with probabilities is given by
2.4 Density operator/matrix Ensemble of pure states gives a mixed state BOX The density operator or density matrix for the ensemble or mixture of states with probabilities is given by Note: Once mixed,
More informationDetection of quantum entanglement in physical systems
Detection of quantum entanglement in physical systems Carolina Moura Alves Merton College University of Oxford A thesis submitted for the degree of Doctor of Philosophy Trinity 2005 Abstract Quantum entanglement
More informationLecture 2: Homogeneous Coordinates, Lines and Conics
Lecture 2: Homogeneous Coordinates, Lines and Conics 1 Homogeneous Coordinates In Lecture 1 we derived the camera equations λx = P X, (1) where x = (x 1, x 2, 1), X = (X 1, X 2, X 3, 1) and P is a 3 4
More informationx1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.
Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationChapter 7. Permutation Groups
Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral
More informationApplied Linear Algebra I Review page 1
Applied Linear Algebra Review 1 I. Determinants A. Definition of a determinant 1. Using sum a. Permutations i. Sign of a permutation ii. Cycle 2. Uniqueness of the determinant function in terms of properties
More information17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function
17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES
FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationLinear Maps. Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007)
MAT067 University of California, Davis Winter 2007 Linear Maps Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (February 5, 2007) As we have discussed in the lecture on What is Linear Algebra? one of
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationFinite dimensional C -algebras
Finite dimensional C -algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationChapter 6. Cuboids. and. vol(conv(p ))
Chapter 6 Cuboids We have already seen that we can efficiently find the bounding box Q(P ) and an arbitrarily good approximation to the smallest enclosing ball B(P ) of a set P R d. Unfortunately, both
More informationLecture 1: Schur s Unitary Triangularization Theorem
Lecture 1: Schur s Unitary Triangularization Theorem This lecture introduces the notion of unitary equivalence and presents Schur s theorem and some of its consequences It roughly corresponds to Sections
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More information15.062 Data Mining: Algorithms and Applications Matrix Math Review
.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop
More informationarxiv:quant-ph/9607009v1 11 Jul 1996
Distillability of Inseparable Quantum Systems Micha l Horodecki Department of Mathematics and Physics University of Gdańsk, 80 952 Gdańsk, Poland arxiv:quant-ph/9607009v1 11 Jul 1996 Pawe l Horodecki Faculty
More information1 0 5 3 3 A = 0 0 0 1 3 0 0 0 0 0 0 0 0 0 0
Solutions: Assignment 4.. Find the redundant column vectors of the given matrix A by inspection. Then find a basis of the image of A and a basis of the kernel of A. 5 A The second and third columns are
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationMATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.
MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix. Nullspace Let A = (a ij ) be an m n matrix. Definition. The nullspace of the matrix A, denoted N(A), is the set of all n-dimensional column
More informationSection 5.3. Section 5.3. u m ] l jj. = l jj u j + + l mj u m. v j = [ u 1 u j. l mj
Section 5. l j v j = [ u u j u m ] l jj = l jj u j + + l mj u m. l mj Section 5. 5.. Not orthogonal, the column vectors fail to be perpendicular to each other. 5..2 his matrix is orthogonal. Check that
More informationNotes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
More information4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION
4: EIGENVALUES, EIGENVECTORS, DIAGONALIZATION STEVEN HEILMAN Contents 1. Review 1 2. Diagonal Matrices 1 3. Eigenvectors and Eigenvalues 2 4. Characteristic Polynomial 4 5. Diagonalizability 6 6. Appendix:
More informationLinear Algebra I. Ronald van Luijk, 2012
Linear Algebra I Ronald van Luijk, 2012 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents 1. Vector spaces 3 1.1. Examples 3 1.2. Fields 4 1.3. The field of complex numbers. 6 1.4.
More informationLecture 4: Partitioned Matrices and Determinants
Lecture 4: Partitioned Matrices and Determinants 1 Elementary row operations Recall the elementary operations on the rows of a matrix, equivalent to premultiplying by an elementary matrix E: (1) multiplying
More information2.3 Convex Constrained Optimization Problems
42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions
More informationReview Jeopardy. Blue vs. Orange. Review Jeopardy
Review Jeopardy Blue vs. Orange Review Jeopardy Jeopardy Round Lectures 0-3 Jeopardy Round $200 How could I measure how far apart (i.e. how different) two observations, y 1 and y 2, are from each other?
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More information3. Let A and B be two n n orthogonal matrices. Then prove that AB and BA are both orthogonal matrices. Prove a similar result for unitary matrices.
Exercise 1 1. Let A be an n n orthogonal matrix. Then prove that (a) the rows of A form an orthonormal basis of R n. (b) the columns of A form an orthonormal basis of R n. (c) for any two vectors x,y R
More informationLecture 14: Section 3.3
Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationCONTROLLABILITY. Chapter 2. 2.1 Reachable Set and Controllability. Suppose we have a linear system described by the state equation
Chapter 2 CONTROLLABILITY 2 Reachable Set and Controllability Suppose we have a linear system described by the state equation ẋ Ax + Bu (2) x() x Consider the following problem For a given vector x in
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationThe Matrix Elements of a 3 3 Orthogonal Matrix Revisited
Physics 116A Winter 2011 The Matrix Elements of a 3 3 Orthogonal Matrix Revisited 1. Introduction In a class handout entitled, Three-Dimensional Proper and Improper Rotation Matrices, I provided a derivation
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationLinear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University
Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationSolution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
More informationPHYSICAL REVIEW A 79, 052110 2009. Multiple-time states and multiple-time measurements in quantum mechanics
Multiple-time states and multiple-time measurements in quantum mechanics Yakir Aharonov, 1, Sandu Popescu, 3,4 Jeff Tollaksen, and Lev Vaidman 1 1 Raymond and Beverly Sackler School of Physics and Astronomy,
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More information1. Let P be the space of all polynomials (of one real variable and with real coefficients) with the norm
Uppsala Universitet Matematiska Institutionen Andreas Strömbergsson Prov i matematik Funktionalanalys Kurs: F3B, F4Sy, NVP 005-06-15 Skrivtid: 9 14 Tillåtna hjälpmedel: Manuella skrivdon, Kreyszigs bok
More informationMATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.
MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More information5. Orthogonal matrices
L Vandenberghe EE133A (Spring 2016) 5 Orthogonal matrices matrices with orthonormal columns orthogonal matrices tall matrices with orthonormal columns complex matrices with orthonormal columns 5-1 Orthonormal
More informationMath 550 Notes. Chapter 7. Jesse Crawford. Department of Mathematics Tarleton State University. Fall 2010
Math 550 Notes Chapter 7 Jesse Crawford Department of Mathematics Tarleton State University Fall 2010 (Tarleton State University) Math 550 Chapter 7 Fall 2010 1 / 34 Outline 1 Self-Adjoint and Normal Operators
More informationLinear Programming I
Linear Programming I November 30, 2003 1 Introduction In the VCR/guns/nuclear bombs/napkins/star wars/professors/butter/mice problem, the benevolent dictator, Bigus Piguinus, of south Antarctica penguins
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationOrthogonal Projections
Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors
More information(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties
Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationLinear Algebra Done Wrong. Sergei Treil. Department of Mathematics, Brown University
Linear Algebra Done Wrong Sergei Treil Department of Mathematics, Brown University Copyright c Sergei Treil, 2004, 2009, 2011, 2014 Preface The title of the book sounds a bit mysterious. Why should anyone
More informationElasticity Theory Basics
G22.3033-002: Topics in Computer Graphics: Lecture #7 Geometric Modeling New York University Elasticity Theory Basics Lecture #7: 20 October 2003 Lecturer: Denis Zorin Scribe: Adrian Secord, Yotam Gingold
More information3. Prime and maximal ideals. 3.1. Definitions and Examples.
COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More information