Note Please review 組合矩陣理論筆記(4) 1-3 about

Slides:



Advertisements
Similar presentations
10.4 Complex Vector Spaces.
Advertisements

5.4 Basis And Dimension.
Rules of Matrix Arithmetic
1.5 Elementary Matrices and a Method for Finding
CHRISTOPHER M. P. TOMASZEWSKI 30 JULY MMIX A Spectral Analysis of Cyclic and Elementary Abelian Subgroup Lattices.
Section 11 Direct Products and Finitely Generated Abelian Groups One purpose of this section is to show a way to use known groups as building blocks to.
2.1 Sets. DEFINITION 1 A set is an unordered collection of objects. DEFINITION 2 The objects in a set are called the elements, or members, of the set.
1.5 Elementary Matrices and a Method for Finding
Math 3121 Abstract Algebra I
Matrix Theory Background
Chapter 5 Orthogonality
Matrices and Systems of Equations
Ch 7.2: Review of Matrices For theoretical and computation reasons, we review results of matrix theory in this section and the next. A matrix A is an m.
Tutorial 10 Iterative Methods and Matrix Norms. 2 In an iterative process, the k+1 step is defined via: Iterative processes Eigenvector decomposition.
Linear Equations in Linear Algebra
Boot Camp in Linear Algebra Joel Barajas Karla L Caballero University of California Silicon Valley Center October 8th, 2008.
MATRICES. Matrices A matrix is a rectangular array of objects (usually numbers) arranged in m horizontal rows and n vertical columns. A matrix with m.
1 Operations with Matrice 2 Properties of Matrix Operations
Math Dept, Faculty of Applied Science, HCM University of Technology
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
1 資訊科學數學 14 : Determinants & Inverses 陳光琦助理教授 (Kuang-Chi Chen)
1 資訊科學數學 13 : Solutions of Linear Systems 陳光琦助理教授 (Kuang-Chi Chen)
 Row and Reduced Row Echelon  Elementary Matrices.
Systems of Linear Equation and Matrices
Chap. 2 Matrices 2.1 Operations with Matrices
Chapter 3 – Set Theory  .
Sec 3.5 Inverses of Matrices Where A is nxn Finding the inverse of A: Seq or row operations.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Quantum One: Lecture Representation Independent Properties of Linear Operators 3.
Three different ways There are three different ways to show that ρ(A) is a simple eigenvalue of an irreducible nonnegative matrix A:
Matrices Matrices For grade 1, undergraduate students For grade 1, undergraduate students Made by Department of Math.,Anqing Teachers college.
Chapter 2 Nonnegative Matrices. 2-1 Introduction.
2.4 Irreducible Matrices. Reducible is reducible if there is a permutation P such that where A 11 and A 22 are square matrices each of size at least one;
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
Meeting 18 Matrix Operations. Matrix If A is an m x n matrix - that is, a matrix with m rows and n columns – then the scalar entry in the i th row and.
Chapter 2 … part1 Matrices Linear Algebra S 1. Ch2_2 2.1 Addition, Scalar Multiplication, and Multiplication of Matrices Definition A matrix is a rectangular.
Spectrum of A σ(A)=the spectrum of A =the set of all eigenvalues of A.
Properties of Inverse Matrices King Saud University.
Greatest Common Divisors & Least Common Multiples  Definition 4 Let a and b be integers, not both zero. The largest integer d such that d|a and d|b is.
Chapter 1 Systems of Linear Equations Linear Algebra.
Arab Open University Faculty of Computer Studies M132: Linear Algebra
2.5 Matrix With Cyclic Structure. Remark # of distinct peripheral eigenvalues of A = cyclic index of A When A is an irreducible nonnegative matrix = the.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
Linear Algebra Chapter 2 Matrices.
A function is a rule f that associates with each element in a set A one and only one element in a set B. If f associates the element b with the element.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
EE611 Deterministic Systems Multiple-Input Multiple-Output (MIMO) Feedback Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Chapter 5 Relations and Operations
Math 3121 Abstract Algebra I
Mathematics-I J.Baskar Babujee Department of Mathematics
Gaussian Elimination and Gauss-Jordan Elimination
Elementary Linear Algebra Anton & Rorres, 9th Edition
1.4 Inverses; Rules of Matrix Arithmetic
Combinatorial Spectral Theory of Nonnegative Matrices
Systems of First Order Linear Equations
GROUPS & THEIR REPRESENTATIONS: a card shuffling approach
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Linear Equations in Linear Algebra
2.1 Sets Dr. Halimah Alshehri.
Sets. EXAMPLE 1 The set O of odd positive integers less than 10 can be expressed by O = { l, 3, 5, 7, 9}. * This way of describing a set is known as.
資訊科學數學13 : Solutions of Linear Systems
Linear Algebra Lecture 38.
Linear Algebra Lecture 32.
Sec 3.5 Inverses of Matrices
3.IV. Change of Basis 3.IV.1. Changing Representations of Vectors
Linear Algebra Lecture 35.
Eigenvalues and Eigenvectors
Eigenvalues and Eigenvectors
2.6 Matrix with Cyclic Structure
Presentation transcript:

Note Please review 組合矩陣理論筆記(4) 1-3 about Jordan form and Minimal polynomial

Theorem 1.2.13 If m=n ,and at least one of A or B is nonsigular,then AB and BA are similar

Remark The Jordan structure of AB and BA corresponding to nonzero eigenvalues are the same

Qestion p.1 Given when does there exist matrices such that and

Qestion p.2 Solved in H.Flanders, Elementary divisors of AB and BA Pra. Amer. Math. Sec 2(1951) 871-874 C.R Johnson, E.A.Schreineer, The relationship between AB and BA, Ameri Math Monthly 103(1966),578-582

Solution p.1 A,B exist if and only if (i) The Jordan structure associated with nonzero eigenvalues is identical in C and D

Solution p.2 (ii) If are the sizes of the Jordan blocks associated with 0 in C while are the corresponding for all i sizes in D, then ( Here, for convenience, we fill out lists of zero Jordan blocks sizes with 0 as needed)

Problem Given square complex matrices not necessarily of the same size. Find a necessary and sufficientary condition on so that there exist complex rectangular matrices of appropriate size that satisfy

Equivalent Problem Given when does there exist a matrix A in the superdiagonal --block form, i.e. such that

Theorem p.1 Let U(A):= the collection of elementary Jardan blocks in the Jordan form of A . Given To obtain from U(A) replace each by and a by k times if

Theorem p.2 and by m-q copies of together with q copies of where p is a positive integer and q is a nonnegative integer determined uniquely by

Example

Cyclically consecutive equal components is said to have cyclically consecutive equal components, if whenever with then either or

Example 1 has cyclically consecutive equal components

Example 2 has no cyclically consecutive equal components

Theorem p.1 Given square matrices there are rectangular matrices such that iff (a) have the same subcollection of nonsigular elementary Jordan blocks.

Theorem p.2 (b) It is possible to list the nilpotent elementary Jordan blocks in in some way, say, are nonnegative where (and stands for an empty block) so that for each positive integer

Theorem p.3 is either an m-tuple with constant components, or an m-tuple with two distinct components that differ by 1 and in which equal components are cyclically consecutive.

Explain for (b)

Example 1 p.1 Let A List of nilpotant elementary Jordan blocks the corresponding 2-tuple :

Example 1 p.2 Let A List of nipotant elementary Jordan blocks the corresponding 2-tuple :

Example 2 p.1 Given A list of nilpotent elementary Jordan blocks satisfy the condition (b) in Theorem (see next page)

Example 2 p.1 The corresponding 4-tuple are

Jordan Diagram Let T be a nilpotent operator on V and 5 is the index of nilpotency of T. Jordan chain for T

Jordan Diagram a basis for N(T)

Jordan Diagram a basis for N(T2)

Jordan Diagram a basis for N(T3)

Jordan Diagram a basis for N(T4)=V

Jordan Diagram

Theorem Let V be a finite dimensional vector space Let be a nilpotent operator then there is an ordered basis β of V s.t. is a Jordan matrix

Observation 1 p.1 Let C,D be m-cyclic matrices (not necessarily of the same size) in superdiagonal block form say, and if

Observation 1 p.2 then

Observation 2 p.1 Let be a given m-tuple of positive integers whose components take on at most two distinct values that differ by 1 and in which equal components are cyclic consecutive. Denote Then

Observation 2 Then there exist an rxr permutation matrix P such that is an m-cyclic matrix block form in the superdiagonal and

Spectral I Let and The spectral index of A = : = g.c.d of i at

Combinatorial Spectral Theory of Nonnegative Matrices