CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDERREITEN THEORY


 Kerrie Arnold
 2 years ago
 Views:
Transcription
1 CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDERREITEN THEORY ANDREW T. CARROLL Notes for this talk come primarily from two sources: M. Barot, ICTP Notes Representations of Quivers, research.html L.A. Hügel, ICTP Notes An Introduction to AuslanderReiten Theory, http: //profs.sci.univr.it/~angeleri/publ.html For today s talk, we will fix k = k an algebraically closed field of characteristic 0.. Some Classical Questions in Linear Algebra Classify square matrices up to similarity (I.E. orbits in End k (k n ) under the action of GL(k n )) Classify n m linear maps up to conjugation (I.e. orbits in Hom k (k m, k n ) under the action of GL(k m ) GL(k n )) Classify pairs of linear maps up to simultaneous conjugation (I.e., orbits in Hom k (k m, k n ) Hom k (k m, k n ) under the action of GL(k m ) GL(k n )) Classify ntuples of subspaces V, V 2,..., V n W under simultaneous change of basis (for example, triples of lines in twospace). There is no predetermined name for the equivalence relation under the appropriate action of the product of general linear groups, so we start to simply ask for a normal form. These problems all have a common thread: determine a normal form for collections of linear maps in some configuration. Quite simply, matrix problems. For many years, similarity of collections of matrices in certain prescribed block forms were studied intrinsically; but starting in the seventies, the point of view pivoted. The idea: square matrices, linear maps pairs of linear maps, objects in a category C ntuples of subspaces } similarity, equivalence isomorphism class in C conjugation, change of basis Date: September 5, 20.
2 2 ANDREW T. CARROLL 2. Quivers and their Representations Definition 2.. A quiver Q = (Q 0, Q ) is a directed graph consisting of a set of vertices Q 0, and arrows Q. We further define two maps t, h : Q Q 0 with t(a) the tail and h(a) the head of the arrow a. Example 2.2. a 2 b 3 Definition 2.3. A representation V of a quiver Q is an assignment of a finitedimensional vector space V x to each vertex x Q 0, and an assignment of a linear map V a : V t(a) V h(a) for each arrow a Q. Example 2.4. Below are a few quivers, and what a representation would look like: Q Representation V a 2 V V a V 2 a V a V What should a morphism in such a category be? Intuitively it should be a collection of linear maps at each vertex, but it should also respect the structure arising from the linear maps. Definition 2.5. A morphism between two representations V, W of Q is a Q 0 tuple of linear maps (ϕ x : V x W x ) x Q0 such that for every a Q V ta ϕ t(a) W t(a) ϕ t(a) V h(a) W a ϕ h(a) W h(a) The category of representations of Q with morphisms sodefined is denoted Rep Q. Note. Notice that there is a natural direct sum operation. Namely, the representation V W defined by (V W ) x = V x W x [ ] Va 0 (V W ) a = 0 W a indeed satisfies the universal property of the coproduct. Proposition 2.6. We list, now, some properties of Rep Q, which will become clear after a remark to follow:
3 CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDERREITEN THEORY3 i. Rep Q is an abelian category (i.e., Hom Q (V, W ) are abelian groups, the category admits finite coproducts, kernels and cokernels. In addition, monomorphisms are kernels and epimorphisms are cokernels); ii. In fact, Rep Q is a kcategory (i.e. Hom Q (V, W ) are vector spaces); iii. Rep Q is a KrullSchmidt category, i.e., every representation decomposes uniquely into a direct sum of indecomposable representations (i.e., which cannot be written as a nontrivial direct sum of two other representations). (i. and ii. are quite simple to prove on their own. iii. takes some work and uses Fittings lemma) Remark 2.7. Let us define by kq the following algebra: as a vector space kq is defined to be the free vector space generated by the set of directed paths in Q, including the lazy paths (i.e., paths of length zero commencing and terminating at a single vertex). The multiplicative structure is given as follows: { pq if h(q) = t(p) p q := 0 otherwise (Some notation: if e x is a lazy path at the vertex x, then h(e x ) = t(e x ) = x. Also, we have extended the functions t and h to the set of all directed paths. It should be clear what the head of a directed path is.) The algebra kq is called the path algebra of Q. Proposition 2.8. The category of (finitedimensional) modules over the path algebra kq is equivalent to the category of (finitedimensional) representations of Q. It is not difficult to construct such an equivalence: if V is a representation of Q, let V be the vector space x Q 0 V x. Then e x acts on V as the projection onto the subspace V x, and the arrow a acts by V a on the summand V t(a) and trivially on the other summands. Since kq is generated as an algebra by the lazy paths and the arrows (exercise), this data defines a module structure Exercise: If ϕ : V W is a morphism of representations, determine the corresponding homomorphism of modules. Now in order to understand such a category, we should look for its indecomposable objects, for from them comes everything else. Here s a first approximation. 3. Examples of Rep Q ad hoc techniques 3.. Vector Spaces. Let Q be the digraph consisting of a single vertex and no arrows. The objects of Rep Q are vector spaces, and Hom Q (V, W ) = Hom k (V, W ). Notice that if n >, k n = k n k, so the only indecomposable (nontrivial) representation is k.
4 4 ANDREW T. CARROLL a 3.2. Linear Maps. Let Q = 2. Then the objects of Rep Q are vector spaces V, V 2 together with a linear map V a : V V 2. Suppose that V a is of rank r. Then by row and column operations (i.e., change of basis in V and V 2, any such map can be written in the form: [ ] Ir 0 V a = 0 0 where I r is the r r identity matrix. Therefore, the representation splits into a direct sum: (k 0) n r (0 k) m r ( k k ) r Those in the parentheses are the nontrivial indecomposables, so indeed finitely many Endomorphism. Let Q = a. The objects of Rep Q are pairs (V, ϕ) where ϕ is a linear endomorphism of V. It is well known that by change of basis in V, such an endomorphism has the associated Jordan normal form: J r (λ ) J r2 (λ 2 ) J rk (λ k ) Such a representation splits into a direct sum of k indecomposable modules, and indeed (k r, J r (λ)), the rdimensional vector space with a single r r Jordan block (associated to eigenvalue λ) is indecomposable. Notice that in this case, in each dimension of V, there is a oneparameter family of indecomposable modules (therefore, there are infinitely many nonisomorphic indcomposables) Triples of Linear Maps. Let Q = 2 be the socalled threekronecker quiver. The objects are triples of linear maps, but look: 0 k 0 λ µ k 2 So there is a twoparameter family of indecomposable representations with k, k 2 as the assigned vector spaces. Module categories in which you get twoparameter families are BAD... impossible to determine/classify all of their indecomposable objects. Interesting note: if we could solve this problem (i.e., determine all indecomposables in this category), then we could do so for ANY category of representations of quivers. (see Barot)
5 CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDERREITEN THEORY Classification problem. The classification problem amounts to determining a complete list of indecomposable modules/representations for such categories. It would be nice to also understand the morphisms between modules. For the former question, there are a number of results, not least of which is the result of Drozd, which essentially says that we just covered all of the types. Additionally, the methods we have used thus far have been quite ad hoc. It would be nice to have a systematic method for studying these categories. Thus, AuslanderReiten theory is born. Definition 3.. A quiver Q (or the path algebra kq) is of finite representation type if there are only finitely many indecomposable representations of Q; tame representation type if in each dimension vector, there are at most finitely many oneparameter families of pairwise nonisomorphic indecomposable representations; wild representation type if there are dimension vectors for which there is a twoparameter family of pairwise nonisomorphic indecomposable representations. Theorem 3.2 (Drozd). A quiver Q can be of finite, tame, or wild representation type. If Q is of infinite representation type, then it is either tame or wild, but not both. (This is a very complicated proof. It involves the introdution of socalled BOCS, bimodules over categories with coalgebra structure.) 4. Gabriel s Theorem/ Kac s Theorem So which quivers are of finite and which are tame, and which are wild? Theorem 4.. Let Q be a quiver, and denote by (Q) its underlying undirected graph.
6 6 ANDREW T. CARROLL a. Q is of finite representation type if (Q) is a (simply laced) Dynkin diagram (A n, D n, E 6, E 7, E 8 ); A n =... D n =... E 6 = E 7 = E 8 = Furthermore, the dimension vectors of indecomposable representations are the positive roots of the associated root system.
7 CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDERREITEN THEORY7 b. Q is of tame representation type if (Q) is an extended (simply laced) Dynkin diagram (Ãn, D n, Ẽ6, Ẽ7, Ẽ8); Ã n =... D n =... Ẽ 6 = Ẽ 7 = Ẽ 8 = Furthermore, the dimension vectors of indecomposable representations are the positive roots of the associated root system, and dimension vectors of one parameter families are the positive imaginary roots. c. Otherwise, Q is of wild representation type. 5. AuslanderReiten Theory Definition 5.. A morphism ϕ : V W is called radical if, when written as a matrix of maps between indecomposable objects, no entry is an isomorphism. Note 2. Every map ϕ : V W with V, W, indecomposable nonisomorphic is radical. Proposition 5.2. rad Q (V, W ) is a vector space, and composition on either side with a radical morphism is again radical.
8 8 ANDREW T. CARROLL 5.. Example. Let Q = 2... n. The indecomposable modules can be written [i, j] with i < j n (i.e., [i, j] x = k if i x j, and 0 otherwise, and the maps are given by multiplication by ) Exercise: a. Show that Hom Q ([i, j], [i, j ]) 0 if and only if i i j j, and in this case, the dimension of the space of homomorphisms is. b. Show that End Q ([i, j]) = k. Let us take n = 4. Notice that Hom Q ([3, 4], [2, 4]) = k, and the morphisms here DO NOT factor through nonisomorphisms. Definition 5.3. Inductively define the space rad i Q(U, V ) := W Rep Q rad Q (W, V ) rad i (U, W ). A radical map f is called irreducible if f rad Q (U, V ) \ rad 2 Q(U, V ). Note 3. An irreducible morphism is either injective or surjective but not both (otherwise factor it through the image, which is not isomorphic to the domain since the morphism is assumed not injective). Definition 5.4. A short exact sequence 0 X f Y if g Z 0 is called almost split a. X and Z are indecomposable; b. f is not a section, and g is not a retraction; c. Any section X E factors through f, and any retraction E Y factors through g. Theorem 5.5. AuslanderReiten Main Theorem For any quiver Q, there is a bijective map τ : ind(modq) ind(modq) such that for each nonprojective indecomposable V, there is a representation E, and morphisms f, g such that 0 τv f E g V 0 is an almost split sequence. Corollary 5.6. Given V, τv, let E,..., E t be the set of indecomposable modules such that rad Q (τv, E i )/ rad 2 Q(τV, E i ) = n i 0. Write E = i E n i i. Let {f (i),..., f n (i) i } be a (i) basis for this space, and chose lifts f j. Then f (i) j i,j () coker( τv E ) = V ; (2) 0 τv E V 0 is an almost split sequence. It is convenient to organize this data in a directed graph.
9 CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDERREITEN THEORY9 Definition 5.7. The AuslanderReiten quiver Γ Q of Q is the directed graph with vertices corresponding to the set of isoclasses of indecomposables in Rep Q, and the number of arrows [M] [N] is dim rad Q (M, N)/ rad 2 Q(M, N). Example 5.8. Suppose Q = 2 3, denote by [i, j] the indecomposables (there are 6). Recall that the irreducible maps are [3, 3] [2, 3] [, 3] [2, 3] [2, 2] [, 2] [, 3] [, 2] [, ] We can draw the AuslanderReiten Graph as follows: [, 3] [2, 3] τ [, 2] [3, 3] τ [2, 2] τ [, ] Notice that quadrilaterals are exact sequences Beautiful Combinatorics. I. Hom Q (C, τa) = D(Ext Q(A, C)), so dimensions of extension spaces can be read from homomorphism spaces (much easier to calculate); II. If M and N are two indecomposable modules, and [M], [N] are in the same connected component, then dim Hom Q (M, N) = #{ directed paths starting with M and ending with N} modulo the mesh relations BUT HOW DO YOU CALCULATE IT. So this is all quite nice, but how can these modules be calculated? Quite simply, in fact, once we know projective modules. It turns out that τ = D T r as functors (we should really say naturally isomorphic). But what is D and what is T r. First we need some properties: The category Rep Q is Hereditary, meaning subrepresentations of projective modules are projective (or equivalently that Ext i (V, W ) = 0 for all V, W Rep Q and i > ). Proof. Define d V W : x Q 0 Hom k (V (x), W (x)) a Q Hom k (V (ta), W (ha)) where d V W (ϕ(x) x Q 0 ) = (ϕ(ha)v (a) W (a)ϕ(ta)) a Q.
10 0 ANDREW T. CARROLL Exercise 5.9. The kernel of this map is isomorphic to Hom Q (V, W ) and the cokernel is Ext Q(V, W ). The projective cover of the simple module concentrated at the vertex x, which we denote P x has a basis consisting of paths starting with the vertex x, and left multiplication is given by left concatenation of paths; The injective cover of a simple module concentrated at the vertex x, which we denote I x has a basis consisting of paths ending at the vertex x, and left multiplication is given by right concatenation; Hom Q (P x, P y ) has a basis consisting of paths which start at y and end at x. Therefore Hom Q (P x, kq) has a basis consisting of paths which start at any vertex and end at x. This is actually a right kq module, or a left kq op module. Definition 5.0 (works in general for semiperfect rings R). The functor T r is defined on the full subcategory of nonprojective modules as follows: let V be such a module, and let 0 V x Q 0 Px nx δ x Q 0 Px mx, where δ is a matrix whose entries are paths (recall that maps between projectives are paths). Apply Hom Q (, kq) to the resolution: x Q 0 Hom Q (P x, kq) nx Then T r(v ) := coker(hom Q (δ, kq)) Hom Q (δ,kq) x Q 0 Hom Q (P x, kq) mx For the sake of our discussion, the dual can be taken to be the functor ( ) op (although this is an oversimplification) Example. Let Q = a 2 b 3 4. Let us calculate τ(s 2 ). It has a projective resolution c which is really Apply Hom Q (, kq) to yield the sequence 0 2 P 2 P 3 P 4 P 2 b c P 3 P 4
11 CLUSTER ALGEBRAS AND CATEGORIFICATION TALKS: QUIVERS AND AUSLANDERREITEN THEORY which are modules over Q op := a b 2 3 c The cokernel of this map (by dimension count) is of dimension vector. Apply the dual (op), to arrive at the representation id id (which, since τ(indecomposable) is indecomposable, we know the maps are as shown in above. Department of Mathematics, Northeastern University, Boston, MA 025 address: id
GabrielRoiter inclusions and AuslanderReiten theory.
GabrielRoiter inclusions and AuslanderReiten theory. Claus Michael Ringel ABSTRACT. Let Λ be an artin algebra. The aim of this paper is to outline a strong relationship between the GabrielRoiter inclusions
More informationREPRESENTATION THEORY WEEK 12
REPRESENTATION THEORY WEEK 12 1. Reflection functors Let Q be a quiver. We say a vertex i Q 0 is +admissible if all arrows containing i have i as a target. If all arrows containing i have i as a source,
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 informationNOTES ON CATEGORIES AND FUNCTORS
NOTES ON CATEGORIES AND FUNCTORS These notes collect basic definitions and facts about categories and functors that have been mentioned in the Homological Algebra course. For further reading about category
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 19967 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationAn Introduction to AuslanderReiten Theory
An Introduction to AuslanderReiten Theory Lecture Notes Advanced School on Representation Theory and related Topics ICTP Trieste, January 2006 Lidia Angeleri Hügel (updated on October 13, 2006) Contents
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 informationsome algebra prelim solutions
some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no
More information4.1 Modules, Homomorphisms, and Exact Sequences
Chapter 4 Modules We always assume that R is a ring with unity 1 R. 4.1 Modules, Homomorphisms, and Exact Sequences A fundamental example of groups is the symmetric group S Ω on a set Ω. By Cayley s Theorem,
More informationUniversity of Lille I PC first year list of exercises n 7. Review
University of Lille I PC first year list of exercises n 7 Review Exercise Solve the following systems in 4 different ways (by substitution, by the Gauss method, by inverting the matrix of coefficients
More informationA REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An ndimensional 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 0534405967. Systems of Linear Equations Definition. An ndimensional vector is a row or a column
More informationShapes of Connected Components of the AuslansderReiten Quivers of Artin Algebras. Shiping Liu. To the memory of Maurice Auslander.
Shapes of Connected Components of the AuslansderReiten Quivers of Artin Algebras Shiping Liu To the memory of Maurice Auslander Introduction The aim of these notes is to report some new developments on
More informationRIGID MODULES OVER PREPROJECTIVE ALGEBRAS
RIGID MODULES OVER PREPROJECTIVE ALGEBRAS CHRISTOF GEISS, BERNARD LECLERC, AND JAN SCHRÖER Abstract. Let Λ be a preprojective algebra of simply laced Dynkin type. We study maximal rigid Λmodules, their
More informationGroup Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
More informationHatcher C A: [012] = [013], B : [123] = [023],
Ex 2..2 Hatcher 2. Let S = [2] [23] 3 = [23] be the union of two faces of the 3simplex 3. Let be the equivalence relation that identifies [] [3] and [2] [23]. The quotient space S/ is the Klein bottle
More informationALMOST REGULAR AUSLANDERREITEN COMPONENTS AND QUASITILTED ALGEBRAS. Shiping Liu. Introduction
ALMOST REGULAR AUSLANDERREITEN COMPONENTS AND QUASITILTED ALGEBRAS Shiping Liu Introduction The problem of giving a general description of the shapes of Auslander Reiten components of an artin algebra
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 informationRevision of ring theory
CHAPTER 1 Revision of ring theory 1.1. Basic definitions and examples In this chapter we will revise and extend some of the results on rings that you have studied on previous courses. A ring is an algebraic
More informationBABY VERMA MODULES FOR RATIONAL CHEREDNIK ALGEBRAS
BABY VERMA MODULES FOR RATIONAL CHEREDNIK ALGEBRAS SETH SHELLEYABRAHAMSON Abstract. These are notes for a talk in the MITNortheastern Spring 2015 Geometric Representation Theory Seminar. The main source
More informationGROUP ALGEBRAS. ANDREI YAFAEV
GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite
More informationi=1 n i. The base of induction
1. Rings, ideals, and modules 1.1. Rings. Noncommutative algebra studies properties of rings (not necessarily commutative) and modules over them. By a ring we mean an associative ring with unit 1. We will
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 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 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 informationFIBER PRODUCTS AND ZARISKI SHEAVES
FIBER PRODUCTS AND ZARISKI SHEAVES BRIAN OSSERMAN 1. Fiber products and Zariski sheaves We recall the definition of a fiber product: Definition 1.1. Let C be a category, and X, Y, Z objects of C. Fix also
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 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 informationADDITIVE GROUPS OF RINGS WITH IDENTITY
ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsionfree
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More informationCONSEQUENCES OF THE EXISTENCE OF AUSLANDERREITEN TRIANGLES WITH APPLICATIONS TO PERFECT COMPLEXES FOR SELFINJECTIVE ALGEBRAS
CONSEQUENCES OF THE EXISTENCE OF AUSLANDERREITEN TRIANGLES WITH APPLICATIONS TO PERFECT COMPLEXES FOR SELFINJECTIVE ALGEBRAS PETER WEBB Abstract In a klinear triangulated category (where k is a field)
More informationFactoring of Prime Ideals in Extensions
Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree
More informationM ath. Res. Lett. 13 (2006), no. 6, 885 895 c International Press 2006 AUSLANDERREITEN SEQUENCES AND GLOBAL DIMENSIONS. Wei Hu and Changchang Xi
M ath. Res. Lett. 13 (2006), no. 6, 885 895 c International Press 2006 AUSLANDERREITEN SEQUENCES AND GLOBAL DIMENSIONS Wei Hu and Changchang Xi 1. Introduction Almost split sequences were introduced by
More informationLecture 16 : Relations and Functions DRAFT
CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence
More informationIntroduction to finite fields
Introduction to finite fields Topics in Finite Fields (Fall 2013) Rutgers University Swastik Kopparty Last modified: Monday 16 th September, 2013 Welcome to the course on finite fields! This is aimed at
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 selfadjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
More informationIf I and J are graded ideals, then since Ĩ, J are ideal sheaves, there is a canonical homomorphism J OX. It is equal to the composite
Synopsis of material from EGA Chapter II, 2.5 2.9 2.5. Sheaf associated to a graded module. (2.5.1). If M is a graded S module, then M (f) is an S (f) module, giving a quasicoherent sheaf M (f) on Spec(S
More informationOnline publication date: 11 March 2010 PLEASE SCROLL DOWN FOR ARTICLE
This article was downloaded by: [Modoi, George Ciprian] On: 12 March 2010 Access details: Access Details: [subscription number 919828804] Publisher Taylor & Francis Informa Ltd Registered in England and
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 informationGalois representations with open image
Galois representations with open image Ralph Greenberg University of Washington Seattle, Washington, USA May 7th, 2011 Introduction This talk will be about representations of the absolute Galois group
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 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 information7  Linear Transformations
7  Linear Transformations Mathematics has as its objects of study sets with various structures. These sets include sets of numbers (such as the integers, rationals, reals, and complexes) whose structure
More informationDATA ANALYSIS II. Matrix Algorithms
DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where
More informationSMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
More informationLinear Systems and Gaussian Elimination
Eivind Eriksen Linear Systems and Gaussian Elimination September 2, 2011 BI Norwegian Business School Contents 1 Linear Systems................................................ 1 1.1 Linear Equations...........................................
More informationFibrations and universal view updatability
Fibrations and universal view updatability Michael Johnson Computing Department, Macquarie University NSW 2109, Australia mike@ics.mq.edu.au Robert Rosebrugh Department of Mathematics and Computer Science,
More informationCOMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the HigmanSims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More information*.I Zolotareff s Proof of Quadratic Reciprocity
*.I. ZOLOTAREFF S PROOF OF QUADRATIC RECIPROCITY 1 *.I Zolotareff s Proof of Quadratic Reciprocity This proof requires a fair amount of preparations on permutations and their signs. Most of the material
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 informationNotes on Matrix Multiplication and the Transitive Closure
ICS 6D Due: Wednesday, February 25, 2015 Instructor: Sandy Irani Notes on Matrix Multiplication and the Transitive Closure An n m matrix over a set S is an array of elements from S with n rows and m columns.
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 informationarxiv:math/0402080v1 [math.nt] 5 Feb 2004
BIEXTENSIONS OF 1MOTIVES BY 1MOTIVES arxiv:math/0402080v1 [math.nt] 5 Feb 2004 CRISTIANA BERTOLIN Abstract. Let S be a scheme. In this paper, we define the notion of biextensions of 1motives by 1motives.
More informationANAGRAMS: Dimension of triangulated categories
ANAGRAMS: Dimension of triangulated categories Julia Ramos González February 7, 2014 Abstract These notes were prepared for the first session of "Dimension functions" of ANAGRAMS seminar. The goal is to
More informationr(x + y) =rx + ry; (r + s)x = rx + sx; r(sx) =(rs)x; 1x = x
Chapter 4 Module Fundamentals 4.1 Modules and Algebras 4.1.1 Definitions and Comments A vector space M over a field R is a set of objects called vectors, which can be added, subtracted and multiplied by
More informationON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationCHAPTER 5: MODULAR ARITHMETIC
CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called
More informationMA106 Linear Algebra lecture notes
MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector
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 informationSukGeun Hwang and JinWoo Park
Bull. Korean Math. Soc. 43 (2006), No. 3, pp. 471 478 A NOTE ON PARTIAL SIGNSOLVABILITY SukGeun Hwang and JinWoo Park Abstract. In this paper we prove that if Ax = b is a partial signsolvable linear
More informationSets and functions. {x R : x > 0}.
Sets and functions 1 Sets The language of sets and functions pervades mathematics, and most of the important operations in mathematics turn out to be functions or to be expressible in terms of functions.
More informationSplit Nonthreshold Laplacian Integral Graphs
Split Nonthreshold Laplacian Integral Graphs Stephen Kirkland University of Regina, Canada kirkland@math.uregina.ca Maria Aguieiras Alvarez de Freitas Federal University of Rio de Janeiro, Brazil maguieiras@im.ufrj.br
More informationThe Euler class group of a polynomial algebra
The Euler class group of a polynomial algebra Mrinal Kanti Das HarishChandra Research Institute, Allahabad. Chhatnag Road, Jhusi, Allahabad  211 019, India. email : mrinal@mri.ernet.in 1 Introduction
More informationUsing morphism computations for factoring and decomposing general linear functional systems
Using morphism computations for factoring and decomposing general linear functional systems Thomas Cluzeau and Alban Quadrat Abstract Within a constructive homological algebra approach we study the factorization
More informationGROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.
Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the
More informationEXERCISES FOR THE COURSE MATH 570, FALL 2010
EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime
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 informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationSOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS
SOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS Ivan Kolář Abstract. Let F be a fiber product preserving bundle functor on the category FM m of the proper base order r. We deduce that the rth
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationFIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3
FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges
More information13 Solutions for Section 6
13 Solutions for Section 6 Exercise 6.2 Draw up the group table for S 3. List, giving each as a product of disjoint cycles, all the permutations in S 4. Determine the order of each element of S 4. Solution
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
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 informationLecture 18  Clifford Algebras and Spin groups
Lecture 18  Clifford Algebras and Spin groups April 5, 2013 Reference: Lawson and Michelsohn, Spin Geometry. 1 Universal Property If V is a vector space over R or C, let q be any quadratic form, meaning
More informationLinear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
More informationCyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
More informationProblems for Advanced Linear Algebra Fall 2012
Problems for Advanced Linear Algebra Fall 2012 Class will be structured around students presenting complete solutions to the problems in this handout. Please only agree to come to the board when you are
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 informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More informationTHREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
More informationGalois Theory III. 3.1. Splitting fields.
Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where
More informationALGEBRA HW 5 CLAY SHONKWILER
ALGEBRA HW 5 CLAY SHONKWILER 510.5 Let F = Q(i). Prove that x 3 and x 3 3 are irreducible over F. Proof. If x 3 is reducible over F then, since it is a polynomial of degree 3, it must reduce into a product
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
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 informationThe components of a variety of matrices with square zero and submaximal rank
The components of a variety of matrices with square zero and submaximal ran DIKRAN KARAGUEUZIAN Mathematics Department, SUNY Binghamton, Binghamton, NY 13902, USA Email: diran@math.binghamton.edu BOB
More informationCARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE
CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify
More informationLifting abelian schemes: theorems of SerreTate and Grothendieck
Lifting abelian schemes: theorems of SerreTate and Grothendieck Gabriel Dospinescu Remark 0.1. J ai décidé d écrire ces notes en anglais, car il y a trop d accents auxquels il faut faire gaffe... 1 The
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 918/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationMATH 131 SOLUTION SET, WEEK 12
MATH 131 SOLUTION SET, WEEK 12 ARPON RAKSIT AND ALEKSANDAR MAKELOV 1. Normalisers We first claim H N G (H). Let h H. Since H is a subgroup, for all k H we have hkh 1 H and h 1 kh H. Since h(h 1 kh)h 1
More informationMATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).
MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors Jordan canonical form (continued) Jordan canonical form A Jordan block is a square matrix of the form λ 1 0 0 0 0 λ 1 0 0 0 0 λ 0 0 J = 0
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 informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROSSHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROSSHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
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 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 information4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests
4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More information1 Polyhedra and Linear Programming
CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material
More informationLinear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.
Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a subvector space of V[n,q]. If the subspace of V[n,q]
More information( ) which must be a vector
MATH 37 Linear Transformations from Rn to Rm Dr. Neal, WKU Let T : R n R m be a function which maps vectors from R n to R m. Then T is called a linear transformation if the following two properties are
More information