Math 896 Coding Theory
|
|
- Henry Williams
- 5 years ago
- Views:
Transcription
1 Math 896 Coding Theory Problem Set Problems from June 8, 25 # 35 Suppose C 1 and C 2 are permutation equivalent codes where C 1 P C 2 for some permutation matrix P. Prove that: (a) C 1 P C 2, and (b) if C 1 is self-dual, so is C 2. Solution: Proof of (a) Suppose y C 1 P. Thus y xp for some x C 1. Consider y c for c C 2. Since c C 2 and C 1 P C 2 then c ap for some a C 1. Thus y c (xp ) c (xp ) (ap ) xp P T a T but P is an orthogonal matrix so P P T I n xa T since x C 1 and a C 1 then. Hence we see that y c for c C 2. Therefore, y C2. Thus C1 P C2. Since C 2 is an [n, k] coded then C2 has dimension n k. Similarly, C 1 is an [n, k] coded then C1 has dimension n k. Since P is an invertible matrix and only permutes the columns of the generator matrix of C1 then P does not change the rank of the generator matrix of C1. Thus C1 P has dimension n k. Since C1 P and C2 have the same dimension and C1 P C2 we see that C1 P C2. Proof of (b) Suppose C 1 is self-dual. Then we see that C 1 C 1. Thus we see that, C 2 C 1 P as C 1 C1 C1 P by part (a) C2. Hence we see that C 2 C2. Therefore, C 2 is self-dual.
2 #4 Prove Theorem 1.6.4: Theorem Let C, C 1, and C 2 be codes over F q. Then: (i) P Aut(C) P Aut(C ), (ii) if q 4, P Aut(C) P Aut(C H ), and (iii) if C 1 P C 2 for a permutation matrix P, then P 1 P Aut(C 1 )P P Aut(C 2 ). Solution: To prove some of the statements in this theorem, we require the use of the following lemma: Lemma: Let C be a finite-dimensional linear code. Then, C (C ). If q 4, C (C H ) H Proof: Let x C. Then, for all y C, x, y. Then, for all y C, y, x, so x (C ). Because C has dimension k, (C ) must have dimension n (n k) k and C (C ), we must have equality - C (C ). The case for q 4 follows similarly. (i) Suppose that σ P Aut(C) (note it must be a bijection). Then, Cσ C. From exercise 35, (Cσ) C σ C, so σ P Aut(C ) and P Aut(C) P Aut(C ). Additionally, as C (C ), we get the reverse inequality. Note that the operation is performed as matrix multiplication in both groups - hence, as the group elements are the same and the group operations are the same, we can say that P Aut(C) P Aut(C ). (ii) We see that if σ P Aut(C), then σ : C C is a bijection. Let y y 1 y 2... y n C H. Then x, y H n x iy i for all x C. Then we have the following equivalences: x, yσ H x i y iσ 1 x jσ y jσσ 1 ijσ x jσ y j ijσ x jσ y j j1 xσ 1, y H. As xσ 1 C, we see that xσ 1, y H x, yσ H. Hence yσ C H, and so σ P Aut(C H ). Thus, P Aut(C) P Aut(C H ). Again, we can use the equality C (C H ) H to get the reverse inclusion. Hence, P Aut(C) P Aut(C H ).
3 (iii) Pick any xp C 2, where x C 1. Let Q P Aut(C 1 ). Then, xq x C 1. Also, xp (P 1 QP ) x(p P 1 )QP xqp yp C 2 Hence, P 1 QP P Aut(C 2 ), and P 1 P Aut(C 1 )P P Aut(C 2 ). To get the other direction, note that C 2 P 1 C 1. Then, (P 1 ) 1 P Aut(C 2 )P 1 P Aut(C 1 ) Multiplying by P on the right and P 1 on the left, P Aut(C 2 ) P 1 P Aut(C 1 )P # 41 Prove that if C 1 and C 2 are permutation equivalent codes, then so are Ĉ1 and Ĉ2. Solution: If C 1 and C 2 are permutation equivalent codes, and G 1 is a generator matrix for C 1, then there is a permutation matrix P such that G 1 P is a generator matrix for C 2. Now, let [ ] P P. 1 Now P is a permutation matrix, since all but the last column have precisely one 1 in them, and similarly all but the last row have precisely one 1 in them, since P is a permutation matrix. Also, the last column, and the bottom most row also have precisely one 1 in them, as can be seen by the construction of P. Now, let Ĝ1 be the generator matrix for C 1 obtained by extending each row in G 1, so g 1 Ĝ 1 G g 2 1., g k for some g i F q. Then Ĝ 1 P G 1P g 1 g 2. g k, and since GP is a generator matrix for C 2, it remains to show that each row in Ĝ1 P is even-like, since that will mean that Ĝ1 P is just GP extended. So, suppose that x 1 x 2...x n g j is the j th row of Ĝ1 P. Then x 1 x 2...x n is the j th row of GP, and since P is a permutation matrix, x x n is just a rearrangement of c c n, where c 1...c n is the j th row of G 1. Thus, x x n + g j c c n + g j, which is zero because the g i s were defined to be such that the sum of the row entries of G 1 is zero. # 43 Let C be the code of Example
4 (a) Is P Aut(C) transitive? (b) Find generator matrices for all six codes punctured on one point. Which of these punctured codes are equivalent? (c) Find generator matrices for all 15 codes punctured on two points. Which of these punctured codes are equivalent? Solution: From Example 1.4.4, C is the binary code with generator matrix 1 1 G (a) PAut(C) is transitive. To see this, let i, j be coordinates, 1 i, j 6. If the set {i, j} is any of the sets {1, 2}, {3, 4}, {5, 6} then the permutation (i, j) fixes G and so the resulting equivalent code is C. So (i, j) PAut(C) and (i, j) sends coordinate i to j and j to i. Otherwise, suppose {i, i }, {j, j } are two distinct sets from {1, 2}, {3, 4}, {5, 6}. Then the permutation (i, j)(i, j ) which changes the coordinates of i and j and the corresponding pair i and j when applied to G simply permutes the two rows: the one with {i, i } nonzero and the one with {j, j } nonzero. Therefore, the resulting matrix is still a generating matrix for C. So (i, j)(i, j ) PAut(C). (b) A generating matrix for a punctured code is obtained by deleting the corresponding columns from the original code s generating matrix. Thus, if C i represents the code where coordinate i was punctured, then C i has generating matrix G i below. 1 G 1 G 2 1 1, G 3 G 4 1, G 5 G By Theorem 1.6.6, since PAut(C) is transitive, all six punctured codes are equivalent. (c) Let C i,j be the code obtained from C by puncturing on coordinates i and j. Then C i,j has G i,j below as a generating matrix which is obtained from G by deleting columns i and j (and removing any resulting rows of all zeros). [ ] 1 1 G 1,2 G 3,4 G 5, G 1,3 G 1,4 G 2,3 G 2,
5 1 G 1,5 G 1,6 G 2,5 G 2, G 3,5 G 3,6 G 4,5 G 4,6 1 1 Therefore, C 1,2, C 3,4, and C 5,6 are all equivalent as they have the same generating matrix. Furthermore, they are not equivalent to any of the other codes as the dimensions of the codes are different. We claim that the remaining codes are all equivalent. First, as permutation equivalence is an equivalence relation, it is enough to show that G 1,3 and G 1,5 generate equivalent codes and G 1,5 and G 3,5 generate equivalent codes. For this, we simply exhibit two permutation matrices, P 2,4 and P 1,3 (which permutes coordinates 2 and 4 and coordinates 1 and 3 respectively). Then we notice that G 1,3 P 2,4 is simply the matrix G 1,5 with the second and third rows swapped and therefore generate the same code. Similarly, G 1,5 P 1,3 is the matrix G 3, 5 with the first and second rows permuted and therefore generate the same code. 1 P 2, P 1,
Math 315: Linear Algebra Solutions to Assignment 7
Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are
More informationMath 215 HW #9 Solutions
Math 5 HW #9 Solutions. Problem 4.4.. If A is a 5 by 5 matrix with all a ij, then det A. Volumes or the big formula or pivots should give some upper bound on the determinant. Answer: Let v i be the ith
More informationDeterminants - Uniqueness and Properties
Determinants - Uniqueness and Properties 2-2-2008 In order to show that there s only one determinant function on M(n, R), I m going to derive another formula for the determinant It involves permutations
More informationMODEL ANSWERS TO THE THIRD HOMEWORK
MODEL ANSWERS TO THE THIRD HOMEWORK 1 (i) We apply Gaussian elimination to A First note that the second row is a multiple of the first row So we need to swap the second and third rows 1 3 2 1 2 6 5 7 3
More informationACM 104. Homework Set 4 Solutions February 14, 2001
ACM 04 Homework Set 4 Solutions February 4, 00 Franklin Chapter, Problem 4, page 55 Suppose that we feel that some observations are more important or reliable than others Redefine the function to be minimized
More informationMATH 54 - WORKSHEET 1 MONDAY 6/22
MATH 54 - WORKSHEET 1 MONDAY 6/22 Row Operations: (1 (Replacement Add a multiple of one row to another row. (2 (Interchange Swap two rows. (3 (Scaling Multiply an entire row by a nonzero constant. A matrix
More informationElementary matrices, continued. To summarize, we have identified 3 types of row operations and their corresponding
Elementary matrices, continued To summarize, we have identified 3 types of row operations and their corresponding elementary matrices. If you check the previous examples, you ll find that these matrices
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 informationMatrix Factorization and Analysis
Chapter 7 Matrix Factorization and Analysis Matrix factorizations are an important part of the practice and analysis of signal processing. They are at the heart of many signal-processing algorithms. Their
More informationChapter 3: Theory Review: Solutions Math 308 F Spring 2015
Chapter : Theory Review: Solutions Math 08 F Spring 05. What two properties must a function T : R m R n satisfy to be a linear transformation? (a) For all vectors u and v in R m, T (u + v) T (u) + T (v)
More informationx y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2
5. Finitely Generated Modules over a PID We want to give a complete classification of finitely generated modules over a PID. ecall that a finitely generated module is a quotient of n, a free module. Let
More informationMonoids. Definition: A binary operation on a set M is a function : M M M. Examples:
Monoids Definition: A binary operation on a set M is a function : M M M. If : M M M, we say that is well defined on M or equivalently, that M is closed under the operation. Examples: Definition: A monoid
More informationWe saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.
Chapter 5 Golay Codes Lecture 16, March 10, 2011 We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes. Question. Are there any other nontrivial perfect codes? Answer. Yes,
More informationElementary Matrices. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Elementary Matrices MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Outline Today s discussion will focus on: elementary matrices and their properties, using elementary
More informationNotes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.
Notes on singular value decomposition for Math 54 Recall that if A is a symmetric n n matrix, then A has real eigenvalues λ 1,, λ n (possibly repeated), and R n has an orthonormal basis v 1,, v n, where
More informationMATH36001 Perron Frobenius Theory 2015
MATH361 Perron Frobenius Theory 215 In addition to saying something useful, the Perron Frobenius theory is elegant. It is a testament to the fact that beautiful mathematics eventually tends to be useful,
More informationSolutions of exercise sheet 8
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra
More informationDeterminants Chapter 3 of Lay
Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j
More information1.8 Dual Spaces (non-examinable)
2 Theorem 1715 is just a restatement in terms of linear morphisms of a fact that you might have come across before: every m n matrix can be row-reduced to reduced echelon form using row operations Moreover,
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationMath 344 Lecture # Linear Systems
Math 344 Lecture #12 2.7 Linear Systems Through a choice of bases S and T for finite dimensional vector spaces V (with dimension n) and W (with dimension m), a linear equation L(v) = w becomes the linear
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 7 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 7 1 / 8 Properties of the matrix product Let us show that the matrix product we
More informationMODEL ANSWERS TO THE FIRST QUIZ. 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function
MODEL ANSWERS TO THE FIRST QUIZ 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function A: I J F, where I is the set of integers between 1 and m and J is
More informationThe matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0.
) Find all solutions of the linear system. Express the answer in vector form. x + 2x + x + x 5 = 2 2x 2 + 2x + 2x + x 5 = 8 x + 2x + x + 9x 5 = 2 2 Solution: Reduce the augmented matrix [ 2 2 2 8 ] to
More informationMatrix Algebra. Matrix Algebra. Chapter 8 - S&B
Chapter 8 - S&B Algebraic operations Matrix: The size of a matrix is indicated by the number of its rows and the number of its columns. A matrix with k rows and n columns is called a k n matrix. The number
More informationMath 4310 Solutions to homework 1 Due 9/1/16
Math 0 Solutions to homework Due 9//6. An element [a] Z/nZ is idempotent if [a] 2 [a]. Find all idempotent elements in Z/0Z and in Z/Z. Solution. First note we clearly have [0] 2 [0] so [0] is idempotent
More information5.6. PSEUDOINVERSES 101. A H w.
5.6. PSEUDOINVERSES 0 Corollary 5.6.4. If A is a matrix such that A H A is invertible, then the least-squares solution to Av = w is v = A H A ) A H w. The matrix A H A ) A H is the left inverse of A and
More informationElementary linear algebra
Chapter 1 Elementary linear algebra 1.1 Vector spaces Vector spaces owe their importance to the fact that so many models arising in the solutions of specific problems turn out to be vector spaces. The
More information1 Inner Product and Orthogonality
CSCI 4/Fall 6/Vora/GWU/Orthogonality and Norms Inner Product and Orthogonality Definition : The inner product of two vectors x and y, x x x =.., y =. x n y y... y n is denoted x, y : Note that n x, y =
More informationENGR-1100 Introduction to Engineering Analysis. Lecture 21. Lecture outline
ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility
More informationLecture 8 : Eigenvalues and Eigenvectors
CPS290: Algorithmic Foundations of Data Science February 24, 2017 Lecture 8 : Eigenvalues and Eigenvectors Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Hermitian Matrices It is simpler to begin with
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationLecture 19: The Determinant
Math 108a Professor: Padraic Bartlett Lecture 19: The Determinant Week 10 UCSB 2013 In our last class, we talked about how to calculate volume in n-dimensions Specifically, we defined a parallelotope:
More informationLINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS
LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in
More informationApprentice Program: Linear Algebra
Apprentice Program: Linear Algebra Instructor: Miklós Abért Notes taken by Matt Holden and Kate Ponto June 26,2006 1 Matrices An n k matrix A over a ring R is a collection of nk elements of R, arranged
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
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 informationENGR-1100 Introduction to Engineering Analysis. Lecture 21
ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility
More informationVersal deformations in generalized flag manifolds
Versal deformations in generalized flag manifolds X. Puerta Departament de Matemàtica Aplicada I Escola Tècnica Superior d Enginyers Industrials de Barcelona, UPC Av. Diagonal, 647 08028 Barcelona, Spain
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationLinear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4
Linear Algebra Section. : LU Decomposition Section. : Permutations and transposes Wednesday, February 1th Math 01 Week # 1 The LU Decomposition We learned last time that we can factor a invertible matrix
More informationMATH 223A NOTES 2011 LIE ALGEBRAS 35
MATH 3A NOTES 011 LIE ALGEBRAS 35 9. Abstract root systems We now attempt to reconstruct the Lie algebra based only on the information given by the set of roots Φ which is embedded in Euclidean space E.
More informationCHAPTER 6. Direct Methods for Solving Linear Systems
CHAPTER 6 Direct Methods for Solving Linear Systems. Introduction A direct method for approximating the solution of a system of n linear equations in n unknowns is one that gives the exact solution to
More informationChapter 6. Orthogonality
6.4 The Projection Matrix 1 Chapter 6. Orthogonality 6.4 The Projection Matrix Note. In Section 6.1 (Projections), we projected a vector b R n onto a subspace W of R n. We did so by finding a basis for
More informationLinear Methods (Math 211) - Lecture 2
Linear Methods (Math 211) - Lecture 2 David Roe September 11, 2013 Recall Last time: Linear Systems Matrices Geometric Perspective Parametric Form Today 1 Row Echelon Form 2 Rank 3 Gaussian Elimination
More informationSome results on the existence of t-all-or-nothing transforms over arbitrary alphabets
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Navid Nasr Esfahani, Ian Goldberg and Douglas R. Stinson David R. Cheriton School of Computer Science University of
More information0.1 Tangent Spaces and Lagrange Multipliers
01 TANGENT SPACES AND LAGRANGE MULTIPLIERS 1 01 Tangent Spaces and Lagrange Multipliers If a differentiable function G = (G 1,, G k ) : E n+k E k then the surface S defined by S = { x G( x) = v} is called
More informationSection 5.6. LU and LDU Factorizations
5.6. LU and LDU Factorizations Section 5.6. LU and LDU Factorizations Note. We largely follow Fraleigh and Beauregard s approach to this topic from Linear Algebra, 3rd Edition, Addison-Wesley (995). See
More informationLecture 1 Systems of Linear Equations and Matrices
Lecture 1 Systems of Linear Equations and Matrices Math 19620 Outline of Course Linear Equations and Matrices Linear Transformations, Inverses Bases, Linear Independence, Subspaces Abstract Vector Spaces
More informationDeterminants: Uniqueness and more
Math 5327 Spring 2018 Determinants: Uniqueness and more Uniqueness The main theorem we are after: Theorem 1 The determinant of and n n matrix A is the unique n-linear, alternating function from F n n to
More informationMatrices and Vectors
Matrices and Vectors James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University November 11, 2013 Outline 1 Matrices and Vectors 2 Vector Details 3 Matrix
More informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
More informationFirst we introduce the sets that are going to serve as the generalizations of the scalars.
Contents 1 Fields...................................... 2 2 Vector spaces.................................. 4 3 Matrices..................................... 7 4 Linear systems and matrices..........................
More informationMath 370 Spring 2016 Sample Midterm with Solutions
Math 370 Spring 2016 Sample Midterm with Solutions Contents 1 Problems 2 2 Solutions 5 1 1 Problems (1) Let A be a 3 3 matrix whose entries are real numbers such that A 2 = 0. Show that I 3 + A is invertible.
More informationis Use at most six elementary row operations. (Partial
MATH 235 SPRING 2 EXAM SOLUTIONS () (6 points) a) Show that the reduced row echelon form of the augmented matrix of the system x + + 2x 4 + x 5 = 3 x x 3 + x 4 + x 5 = 2 2x + 2x 3 2x 4 x 5 = 3 is. Use
More informationDetermine whether the following system has a trivial solution or non-trivial solution:
Practice Questions Lecture # 7 and 8 Question # Determine whether the following system has a trivial solution or non-trivial solution: x x + x x x x x The coefficient matrix is / R, R R R+ R The corresponding
More informationMath 317, Tathagata Basak, Some notes on determinant 1 Row operations in terms of matrix multiplication 11 Let I n denote the n n identity matrix Let E ij denote the n n matrix whose (i, j)-th entry is
More informationMath 320, spring 2011 before the first midterm
Math 320, spring 2011 before the first midterm Typical Exam Problems 1 Consider the linear system of equations 2x 1 + 3x 2 2x 3 + x 4 = y 1 x 1 + 3x 2 2x 3 + 2x 4 = y 2 x 1 + 2x 3 x 4 = y 3 where x 1,,
More informationName: MATH 3195 :: Fall 2011 :: Exam 2. No document, no calculator, 1h00. Explanations and justifications are expected for full credit.
Name: MATH 3195 :: Fall 2011 :: Exam 2 No document, no calculator, 1h00. Explanations and justifications are expected for full credit. 1. ( 4 pts) Say which matrix is in row echelon form and which is not.
More informationBinary Linear Codes G = = [ I 3 B ] , G 4 = None of these matrices are in standard form. Note that the matrix 1 0 0
Coding Theory Massoud Malek Binary Linear Codes Generator and Parity-Check Matrices. A subset C of IK n is called a linear code, if C is a subspace of IK n (i.e., C is closed under addition). A linear
More informationORIE 6300 Mathematical Programming I August 25, Recitation 1
ORIE 6300 Mathematical Programming I August 25, 2016 Lecturer: Calvin Wylie Recitation 1 Scribe: Mateo Díaz 1 Linear Algebra Review 1 1.1 Independence, Spanning, and Dimension Definition 1 A (usually infinite)
More informationProperties of the Determinant Function
Properties of the Determinant Function MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Overview Today s discussion will illuminate some of the properties of the determinant:
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationcan only hit 3 points in the codomain. Hence, f is not surjective. For another example, if n = 4
.. Conditions for Injectivity and Surjectivity In this section, we discuss what we can say about linear maps T : R n R m given only m and n. We motivate this problem by looking at maps f : {,..., n} {,...,
More informationGassner Representation of the Pure Braid Group P 4
International Journal of Algebra, Vol. 3, 2009, no. 16, 793-798 Gassner Representation of the Pure Braid Group P 4 Mohammad N. Abdulrahim Department of Mathematics Beirut Arab University P.O. Box 11-5020,
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationMultiplying matrices by diagonal matrices is faster than usual matrix multiplication.
7-6 Multiplying matrices by diagonal matrices is faster than usual matrix multiplication. The following equations generalize to matrices of any size. Multiplying a matrix from the left by a diagonal matrix
More informationTC08 / 6. Hadamard codes SX
TC8 / 6. Hadamard codes 3.2.7 SX Hadamard matrices Hadamard matrices. Paley s construction of Hadamard matrices Hadamard codes. Decoding Hadamard codes A Hadamard matrix of order is a matrix of type whose
More information14. Properties of the Determinant
14. Properties of the Determinant Last time we showed that the erminant of a matrix is non-zero if and only if that matrix is invertible. We also showed that the erminant is a multiplicative function,
More information(I.D) Solving Linear Systems via Row-Reduction
(I.D) Solving Linear Systems via Row-Reduction Turning to the promised algorithmic approach to Gaussian elimination, we say an m n matrix M is in reduced-row echelon form if: the first nonzero entry of
More informationGraduate Mathematical Economics Lecture 1
Graduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 23, 2012 Outline 1 2 Course Outline ematical techniques used in graduate level economics courses Mathematics for Economists
More information1. What is the determinant of the following matrix? a 1 a 2 4a 3 2a 2 b 1 b 2 4b 3 2b c 1. = 4, then det
What is the determinant of the following matrix? 3 4 3 4 3 4 4 3 A 0 B 8 C 55 D 0 E 60 If det a a a 3 b b b 3 c c c 3 = 4, then det a a 4a 3 a b b 4b 3 b c c c 3 c = A 8 B 6 C 4 D E 3 Let A be an n n matrix
More informationECON 186 Class Notes: Linear Algebra
ECON 86 Class Notes: Linear Algebra Jijian Fan Jijian Fan ECON 86 / 27 Singularity and Rank As discussed previously, squareness is a necessary condition for a matrix to be nonsingular (have an inverse).
More informationMath 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008
Math 520 Exam 2 Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Exam 2 will be held on Tuesday, April 8, 7-8pm in 117 MacMillan What will be covered The exam will cover material from the lectures
More informationMATH PRACTICE EXAM 1 SOLUTIONS
MATH 2359 PRACTICE EXAM SOLUTIONS SPRING 205 Throughout this exam, V and W will denote vector spaces over R Part I: True/False () For each of the following statements, determine whether the statement is
More informationMath 242 fall 2008 notes on problem session for week of This is a short overview of problems that we covered.
Math 242 fall 28 notes on problem session for week of 9-3-8 This is a short overview of problems that we covered.. For each of the following sets ask the following: Does it span R 3? Is it linearly independent?
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Michaelmas Term 2015 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Michaelmas Term 2015 1 / 10 Row expansion of the determinant Our next goal is
More informationLinear Algebra Practice Problems
Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a
More informationAn Analytic Approach to the Problem of Matroid Representibility: Summer REU 2015
An Analytic Approach to the Problem of Matroid Representibility: Summer REU 2015 D. Capodilupo 1, S. Freedman 1, M. Hua 1, and J. Sun 1 1 Department of Mathematics, University of Michigan Abstract A central
More informationMAS309 Coding theory
MAS309 Coding theory Matthew Fayers January March 2008 This is a set of notes which is supposed to augment your own notes for the Coding Theory course They were written by Matthew Fayers, and very lightly
More informationMath 2331 Linear Algebra
1.1 Linear System Math 2331 Linear Algebra 1.1 Systems of Linear Equations Shang-Huan Chiu Department of Mathematics, University of Houston schiu@math.uh.edu math.uh.edu/ schiu/ Shang-Huan Chiu, University
More informationLINEAR ALGEBRA REVIEW
LINEAR ALGEBRA REVIEW JC Stuff you should know for the exam. 1. Basics on vector spaces (1) F n is the set of all n-tuples (a 1,... a n ) with a i F. It forms a VS with the operations of + and scalar multiplication
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationMath 18.6, Spring 213 Problem Set #6 April 5, 213 Problem 1 ( 5.2, 4). Identify all the nonzero terms in the big formula for the determinants of the following matrices: 1 1 1 2 A = 1 1 1 1 1 1, B = 3 4
More informationComponents and change of basis
Math 20F Linear Algebra Lecture 16 1 Components and change of basis Slide 1 Review: Isomorphism Review: Components in a basis Unique representation in a basis Change of basis Review: Isomorphism Definition
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 informationMatrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices
Matrices A. Fabretti Mathematics 2 A.Y. 2015/2016 Table of contents Matrix Algebra Determinant Inverse Matrix Introduction A matrix is a rectangular array of numbers. The size of a matrix is indicated
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationNotes on Determinants and Matrix Inverse
Notes on Determinants and Matrix Inverse University of British Columbia, Vancouver Yue-Xian Li March 17, 2015 1 1 Definition of determinant Determinant is a scalar that measures the magnitude or size of
More information4 Elementary matrices, continued
4 Elementary matrices, continued We have identified 3 types of row operations and their corresponding elementary matrices. If you check the previous examples, you ll find that these matrices are constructed
More informationChapter SSM: Linear Algebra Section Fails to be invertible; since det = 6 6 = Invertible; since det = = 2.
SSM: Linear Algebra Section 61 61 Chapter 6 1 2 1 Fails to be invertible; since det = 6 6 = 0 3 6 3 5 3 Invertible; since det = 33 35 = 2 7 11 5 Invertible; since det 2 5 7 0 11 7 = 2 11 5 + 0 + 0 0 0
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationInvertible Matrices over Idempotent Semirings
Chamchuri Journal of Mathematics Volume 1(2009) Number 2, 55 61 http://www.math.sc.chula.ac.th/cjm Invertible Matrices over Idempotent Semirings W. Mora, A. Wasanawichit and Y. Kemprasit Received 28 Sep
More informationSTAT 309: MATHEMATICAL COMPUTATIONS I FALL 2017 LECTURE 5
STAT 39: MATHEMATICAL COMPUTATIONS I FALL 17 LECTURE 5 1 existence of svd Theorem 1 (Existence of SVD) Every matrix has a singular value decomposition (condensed version) Proof Let A C m n and for simplicity
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationNotes on Linear Algebra
1 Notes on Linear Algebra Jean Walrand August 2005 I INTRODUCTION Linear Algebra is the theory of linear transformations Applications abound in estimation control and Markov chains You should be familiar
More informationKnowledge Discovery and Data Mining 1 (VO) ( )
Knowledge Discovery and Data Mining 1 (VO) (707.003) Review of Linear Algebra Denis Helic KTI, TU Graz Oct 9, 2014 Denis Helic (KTI, TU Graz) KDDM1 Oct 9, 2014 1 / 74 Big picture: KDDM Probability Theory
More informationFinite Math - J-term Section Systems of Linear Equations in Two Variables Example 1. Solve the system
Finite Math - J-term 07 Lecture Notes - //07 Homework Section 4. - 9, 0, 5, 6, 9, 0,, 4, 6, 0, 50, 5, 54, 55, 56, 6, 65 Section 4. - Systems of Linear Equations in Two Variables Example. Solve the system
More informationThis can be accomplished by left matrix multiplication as follows: I
1 Numerical Linear Algebra 11 The LU Factorization Recall from linear algebra that Gaussian elimination is a method for solving linear systems of the form Ax = b, where A R m n and bran(a) In this method
More information