Anyone know these guys?


 Gary McDowell
 3 years ago
 Views:
Transcription
1 Anyone know these guys? Gavin Brown and Miles Reid We observe that some of our diptych varieties have a beautiful description in terms of key 5folds V (k) A k+5 that are almost homogeneous spaces. By poetic licence, we could call them quantum rational normal curves. We write them out here, in the hope that someone can inform us that they occur elsewhere in math or scifi. From the point of view of equations, V (k) are serial unprojections or nongeneral crazypfaffians. In geometry, they are almost homogeneous spaces for a central extension group G of GL() in other words, closed orbits for a highest weight vector (in a slightly nonfamiliar representation of a nonsimple group). The variety V (k) in equations We define 5folds V (k) A k+5 x 0...k, a, b, c, z for each k 3. First set up k and k (k ) matrixes a b a M = x 0... x i 1... x c b a k 1 and N = x 1... x i... x k.. c b a c b c Our variety V (k) is defined by two sets of equations (see below) (I) MN = 0 and (II) k M = z N. (1) 1
2 (I) is a recurrence relation ax i 1 + bx i + cx i+1 = 0 for i = 1,..., k 1. (II) is a (k ) k adaptation of Cramer s rule giving the Plücker coordinates of the space of solutions of (I) up to a scalar factor z. The ordering of minors in (II) is best understood in terms of the guiding cases x i 1 x i+1 x i = a i 1 c k i 1 z and x i 1 x i+ x i x i+1 = a i 1 bc k i z. () Note that the maximal (k ) (k ) minors of N include a k (delete the last two row) and c k (delete the first two). More generally, deleting two adjacent rows i 1, i gives a i 1 c k i 1 as a minor (only the diagonal contributes), whereas deleting two rows i 1, i+1 gives the minor a i 1 bc k i. Thus our second set of equations is x i 1 x j+1 x i x j = zn(i 1, j). Relations for x i x j x k x l for all i + j = k + l can be obtained as combinations of these; for example x i 1 x j+ x i+1 x j = x i 1 x j+ x i x j+1 + x i x j+1 x i+1 x j = zn(i 1, j + 1) + zn(i, j). Theorem 1 For k 3, (I) and (II) define a reduced irreducible Gorenstein 5fold V (k) A k+5 x 0...k, a, b, c, z. Also for k =, with (II) involving the 0 0 minors interpreted as the single equation 1 z = x 0 x x 1. Lemma (i) z is a regular element for V (k). (ii) The section z = 0 of V (k) is the quotient of the hypersurface W : (g := au + buv + cv = 0) A 5 a, b, c, u, v by the µ k action 1 (0, 0, 0, 1, 1). It is Gorenstein because k is µ k invariant. da db dc du dv g ω A 5( W ).
3 (iii) Also z, a, c is a regular sequence, and the section z = a = c = 0 of V (k) is the tent consisting of 1 k (1, 1) with coordinates x 0,..., x k and two copies of A with coordinates x 0, b and x k, b. Proof First, if c 0 then a, b, c, x 0, x 1 are free parameters, and the recurrence relation (I) gives x,..., x k as rational function of these. One checks that the first equation in (II) gives z = ax 0 +bx 0x 1 +cx 1 and the remainder c k 1 follow. Similarly if a 0. If a = c = 0 and b 0 then one checks that x 0, x k, b are free parameters, x i = 0 for i = 1,..., k 1 and z = x 0x k. Finally, if a = b = c = 0 then b k x 0,..., x k and z obviously parametrise 1(1, 1) k A1. Therefore, no component of V (k) is contained in z = 0, which proves (i). After we set z = 0, the equations (II) become M = 0, and define the cyclic quotient singularity 1 (1, 1) (the cone over the rational normal k curve). Introducing u, v as the roots of x 0,..., x k, with x i = u k i v i, boils the equations MN = 0 down to the single equation g := au + buv + cv = 0. This proves (ii). (iii) is easy. The equations as Pfaffians The equations of V (k) fit together as 4 4 crazy Pfaffians of a skew matrix. For this, edit M and N to get two new matrixes, x 0... x i 1 x i... x k M = x 1... x i x i+1... x k 1 x... x i+1 x i+... x k which is 3 (k 1) and N, the (k 1) (k 3) matrix with the same display as N (that is, delete the first (or last) row and column of N). Equations (I) can be rewritten (a, b, c)m = 0. Now the equations (1) can be written as the Pfaffians of the (k+) (k+) skew matrix cz bz az M k 3 N or c b a M z k 3 N 3
4 the factor z in the first 3 3 block floats over to the final 3 3 block, allowing us to cancel z in Pf 1.3(i 4) for the recurrence relation ax i 1 +bx i +cx i+1 = 0. The remaining Pfaffians give (II). Remark 3 This is a mild form of crazy Pfaffian (by analogy with Riemenschneider s quasideterminantal): there is a multiplier z between the (3, 3) and (4, 4) entries, and when evaluating crazy Pfaffians you include z as a factor whenever you cross it. Written out in more detail, the big matrix is cz bz x 0... x i 1 x i... x k az x 1... x i x i+1... x k 1 x... x i+1 x i+... x k c k c k i 1 a i bc k i a i c k i a i a k 3 with bottom right (k 1) (k 1) block equal the (k 3)rd wedge of N. Sanity check Our family starts with k 3; the case k = would give the hypersurface ax 0 + bx 1 + cx = 0, with z := x 0 x x 1. The first regular case is k = 3, which gives the 5 5 skew determinantal c b x 0 x 1 a x 1 x x x 3 z 4
5 a regular section of the affine Grassmannian agr(, 5). The case k = 4 is c b x 0 x 1 x a x 1 x x 3 x x 3 x 4, zc zb za the standard extra symmetric 6 6 determinantal of [Dicks] and [Reid1]. The first really new case is k = 5, with equations c b x 0 x 1 x x 3 zc zb x 0 x 1 x x 3 a x 1 x x 3 x 4 za x 1 x x 3 x 4 x x 3 x 4 x 5 x zc zbc z(b and x 3 x 4 x 5 ac) c bc b ac zac zab ac ab za We first arrived at this matrix by guesswork, determining the superdiagonal entries c, ac, a and those immediately above bc, ac by eliminating variables to smaller cases; the entry b ac is then fixed so that the bottom 4 4 Pfaffian vanishes identically. Alternative Proof of Theorem 1 A bynow standard application of serial unprojection [PR] and [Reid]. We can start with any of the codimension complete intersections ( ) xi 1 x i+1 = x i + a i 1 c k i 1 z A 7 x ax i 1 + bx i + cx i+1 = 0 i 1, x i, x i+1, a, b, c, z and add the remaining variables one at a time by unprojection. The variety V (k) by apolarity We can treat V (k) as an almost homogeneous space under GL() G. For this, view x 0,..., x k as coefficients of a binary form and a, b, c as coefficients 5 a
6 of a binary quadratic form in dual variables, so that the equations MN = 0 or (a, b, c)m = 0 are the apolarity relations. More formally, write U for the given representation of GL() and write and q = au + bu v + cv S U f = x 0 u k + kx 1 u k 1 v + + x k v k S k U. One includes a binomial coefficient ( k i) as multiplier in the coefficient of u i v k i, a standard move in this game. The second polar of f is the polynomial Φ(u, v, u, v ) = 1 k(k 1) ( f u u + f u v u v + f v v k ( ) k = x i u k i v i u i i=0 k 1 ( ) k k + x i u k i 1 v i 1 u v + i 1 i=1 i= k ( ) k = x i u k i v i u i i=0 k ( ) k k ( k + x i+1 u k i v i u v + i i i=0 i=0 ) ( ) k x i u k i v i v i ) x i+ u k i v i v Substituting u a, u v 1 b, and v c in this and equating to zero gives our recurrence relation (a, b, c)m = 0. Moreover, the second set of equation follow from the first by substitution, provided (say) that c 0 and we fix the value of x 0 x x 1; for example, in x i x i+ x i+1 substituting x i+ = ax c i bx c i+1 gives x i ( a c x i b c x i+1) x i = a c x i ( b c x i + x i+1 )x i+1, 6
7 and we can substitute a c x i 1 for the bracketed expression, to deduce that x i x i+ x i+1 = a c (x i 1x i+1 x i ). etc. A normal form for a quadric under GL() is uv, so that a typical solution to the equations is (a, b, c) = (0, 1, 0), (x 0...k ) = (1, 0,..., 1). This is a highest weight vector, and V (k) is its closed orbit. Application to diptych varieties The diptych varieties for d, e with de = 4 are unprojections of pullbacks of V (k). Case [, ] The diptych variety has variables the x 0...k, y 0... of Figure 1, together with A 1 B. k (0) ( 1) Figure 1: Case [, ] A, B, L, M. The two bottom equations are x 1 y 0 = A k 1 B k + x 0L and x 0 y 1 = ABx 1 + y 0 M 7
8 The pentagram y 1, y 0, x 0, x 1, x adjoins x, then the long rally of flat pentagrams y 1, x i 1, x i, x i+1, x i+ adjoin x 3,..., x k, with matrixes y 1 x 1 M x y 1 x i+1 LM x i+ y 0 AB x 0 L x 0 A k B k 1 and x i 1 AB x i x i (AB) k i (LM) i 1 BM x 1 x i+1 and Pfaffian equations y 1 x i = ABx i+1 + LMx i 1, x i 1 x i+1 = x i + (AB) k i 1 (LM) i 1 BM and x i 1 x i+ = x i x i+1 + (AB) k i (LM) i 1 BMy 1. These are the equations of V (k) after the substitution (a, b, c, z) (LM, y 1, AB, BM). Thus to make our diptych variety, pull back V (k) A k+5 by that substitution, then adjoin y 0, y as unprojection variables. 1 Case [4, 1] with even l = k Omit the odd numbered x i, giving Figure. The diptych variety has variables A 3 1 B. ( 1) k (0) Figure : Case [4, 1] with even l = k x 0...k, y 0...4, A, B, L, M with the two bottom equations x 1 y 0 = A k 1 B k 1 y 1 + x 3 0L and x 0 y 1 = A k B k+1 + y 0 M 1 We still have to deal with the unprojection, here and below. 8
9 We adjoin y, then x,..., x k by a game of pentagrams centred on a long rally of flat pentagrams, with y against x i 1, x i, x i+1, x i+ and Pfaffian equations y x i = AB x i+1 + LM x i 1, x i 1 x i+1 = x i + (AB ) k i 1 (LM ) i 1 BM and x i 1 x i+ = x i x i+1 + (AB ) k i (LM ) i 1 BMy These are the equations of V (k) after the substitution Case [1, 4] with even l = k (a, b, c, z) (LM, y, AB, BM). Omit the even numbered x i, giving Figure 3. The diptych variety has vari A (0) k ( ) Figure 3: Case [4, 1] with even l = k ables x 0...k, y 0..., A, B, L, M with the two bottom equations x 1 y 0 = A k 1 B k + x 0 L and x 0 y 1 = x 1A B + y 0M As before, adjoining x,..., x k features a long rally of flat pentagrams, with y 1 against x i 1, x i, x i+1, x i+ and Pfaffian equations y 1 x i = A Bx i+1 + L Mx i 1, x i 1 x i+1 = x i + (A B) k i 1 (L M) i 1 AL and x i 1 x i+ = x i x i+1 + (A B) k i (L M) i 1 BMy These are the equations of V (k) after the substitution (a, b, c, z) (L M, y 1, A B, BM). 9
10 Case [1, 4] with odd l = k + 1 This is [1, 4] read from the top, but [4, 1] read from the bottom, so is a mix of the two preceding cases. Omit the odd numbered x i, giving Figure 4. The A 1 3. ( 1) B k (0) (0) 3. L 3 Figure 4: Case [1, 4] with odd l = k + 1 ( ) k 1 M diptych variety has variables x 0...k, y 0...3, A, B, L, M with the two bottom equations x 1 y 0 = y 1 A k 3 B k 1 + x 3 0L and x 0 y 1 = A k 1 B k + y 0 M Adjoin y then x by y 1 A B M y y 0 A k 3 B k 1 x 0L x 0 y 1 x 1 then y x 1 M x y 1 A B x 0 LM x 0 y A k 5 B k x 1 After this, adjoining x 3,..., x k 1 is the usual long rally of flat pentagrams, with y against x i 1, x i, x i+1, x i+ and y x i+1 LM x i+ x i 1 A B x i x i (A B) k i 3 (LM ) i 1 ABMy x i+1 10
11 and the Pfaffian equations y x i = A Bx i+1 + LM x i 1, x i 1 x i+1 = x i + (A B) k i (LM ) i 1 ABMy and x i 1 x i+ = x i x i+1 + (A B) k i 3 (LM ) i 1 ABMy These are the equations of V (k 1) after the substitution (a, b, c, z) (LM, y, A B, BM). 11
NON SINGULAR MATRICES. DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that
NON SINGULAR MATRICES DEFINITION. (Non singular matrix) An n n A is called non singular or invertible if there exists an n n matrix B such that AB = I n = BA. Any matrix B with the above property is called
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 informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationThe determinant of a skewsymmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14
4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationSOLVING POLYNOMIAL EQUATIONS
C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More informationFunctions and Equations
Centre for Education in Mathematics and Computing Euclid eworkshop # Functions and Equations c 014 UNIVERSITY OF WATERLOO Euclid eworkshop # TOOLKIT Parabolas The quadratic f(x) = ax + bx + c (with a,b,c
More informationDefinition 12 An alternating bilinear form on a vector space V is a map B : V V F such that
4 Exterior algebra 4.1 Lines and 2vectors The time has come now to develop some new linear algebra in order to handle the space of lines in a projective space P (V ). In the projective plane we have seen
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationMultiplicity. Chapter 6
Chapter 6 Multiplicity The fundamental theorem of algebra says that any polynomial of degree n 0 has exactly n roots in the complex numbers if we count with multiplicity. The zeros of a polynomial are
More information1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on realclosed fields These notes develop the algebraic background needed to understand the model theory of realclosed fields. To understand these notes, a standard graduate course in algebra is
More informationDETERMINANTS. b 2. x 2
DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationCONICS ON THE PROJECTIVE PLANE
CONICS ON THE PROJECTIVE PLANE CHRIS CHAN Abstract. In this paper, we discuss a special property of conics on the projective plane and answer questions in enumerative algebraic geometry such as How many
More informationInverses and powers: Rules of Matrix Arithmetic
Contents 1 Inverses and powers: Rules of Matrix Arithmetic 1.1 What about division of matrices? 1.2 Properties of the Inverse of a Matrix 1.2.1 Theorem (Uniqueness of Inverse) 1.2.2 Inverse Test 1.2.3
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 information2.5 Gaussian Elimination
page 150 150 CHAPTER 2 Matrices and Systems of Linear Equations 37 10 the linear algebra package of Maple, the three elementary 20 23 1 row operations are 12 1 swaprow(a,i,j): permute rows i and j 3 3
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
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 information56 The Remainder and Factor Theorems
Use synthetic substitution to find f (4) and f ( 2) for each function. 1. f (x) = 2x 3 5x 2 x + 14 Divide the function by x 4. The remainder is 58. Therefore, f (4) = 58. Divide the function by x + 2.
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
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 informationPolynomials can be added or subtracted simply by adding or subtracting the corresponding terms, e.g., if
1. Polynomials 1.1. Definitions A polynomial in x is an expression obtained by taking powers of x, multiplying them by constants, and adding them. It can be written in the form c 0 x n + c 1 x n 1 + c
More informationZero: If P is a polynomial and if c is a number such that P (c) = 0 then c is a zero of P.
MATH 11011 FINDING REAL ZEROS KSU OF A POLYNOMIAL Definitions: Polynomial: is a function of the form P (x) = a n x n + a n 1 x n 1 + + a x + a 1 x + a 0. The numbers a n, a n 1,..., a 1, a 0 are called
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
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 informationUnit 1: Polynomials. Expressions:  mathematical sentences with no equal sign. Example: 3x + 2
Pure Math 0 Notes Unit : Polynomials Unit : Polynomials : Reviewing Polynomials Epressions:  mathematical sentences with no equal sign. Eample: Equations:  mathematical sentences that are equated with
More informationUNIT 2 MATRICES  I 2.0 INTRODUCTION. Structure
UNIT 2 MATRICES  I Matrices  I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress
More information6 EXTENDING ALGEBRA. 6.0 Introduction. 6.1 The cubic equation. Objectives
6 EXTENDING ALGEBRA Chapter 6 Extending Algebra Objectives After studying this chapter you should understand techniques whereby equations of cubic degree and higher can be solved; be able to factorise
More informationPYTHAGOREAN TRIPLES PETE L. CLARK
PYTHAGOREAN TRIPLES PETE L. CLARK 1. Parameterization of Pythagorean Triples 1.1. Introduction to Pythagorean triples. By a Pythagorean triple we mean an ordered triple (x, y, z) Z 3 such that x + y =
More informationAdvanced Higher Mathematics Course Assessment Specification (C747 77)
Advanced Higher Mathematics Course Assessment Specification (C747 77) Valid from August 2015 This edition: April 2016, version 2.4 This specification may be reproduced in whole or in part for educational
More information1.5 Elementary Matrices and a Method for Finding the Inverse
.5 Elementary Matrices and a Method for Finding the Inverse Definition A n n matrix is called an elementary matrix if it can be obtained from I n by performing a single elementary row operation Reminder:
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More information26. Determinants I. 1. Prehistory
26. Determinants I 26.1 Prehistory 26.2 Definitions 26.3 Uniqueness and other properties 26.4 Existence Both as a careful review of a more pedestrian viewpoint, and as a transition to a coordinateindependent
More informationCM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra  Factorisation
CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra  Factorisation Prof. David Marshall School of Computer Science & Informatics Factorisation Factorisation is a way of
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationMATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix.
MATH 304 Linear Algebra Lecture 8: Inverse matrix (continued). Elementary matrices. Transpose of a matrix. Inverse matrix Definition. Let A be an n n matrix. The inverse of A is an n n matrix, denoted
More information0.4 FACTORING POLYNOMIALS
36_.qxd /3/5 :9 AM Page 9 SECTION. Factoring Polynomials 9. FACTORING POLYNOMIALS Use special products and factorization techniques to factor polynomials. Find the domains of radical expressions. Use
More informationNotes from February 11
Notes from February 11 Math 130 Course web site: www.courses.fas.harvard.edu/5811 Two lemmas Before proving the theorem which was stated at the end of class on February 8, we begin with two lemmas. The
More informationMATH1231 Algebra, 2015 Chapter 7: Linear maps
MATH1231 Algebra, 2015 Chapter 7: Linear maps A/Prof. Daniel Chan School of Mathematics and Statistics University of New South Wales danielc@unsw.edu.au Daniel Chan (UNSW) MATH1231 Algebra 1 / 43 Chapter
More informationPROBLEM SET 6: POLYNOMIALS
PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other
More informationFactoring Polynomials and Solving Quadratic Equations
Factoring Polynomials and Solving Quadratic Equations Math Tutorial Lab Special Topic Factoring Factoring Binomials Remember that a binomial is just a polynomial with two terms. Some examples include 2x+3
More informationAlgebra 2 Chapter 1 Vocabulary. identity  A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity  A statement that equates two equivalent expressions. verbal model A word equation that represents a reallife problem. algebraic expression  An expression with variables.
More informationIntroduction to polynomials
Worksheet 4.5 Polynomials Section 1 Introduction to polynomials A polynomial is an expression of the form p(x) = p 0 + p 1 x + p 2 x 2 + + p n x n, (n N) where p 0, p 1,..., p n are constants and x os
More informationSummary of week 8 (Lectures 22, 23 and 24)
WEEK 8 Summary of week 8 (Lectures 22, 23 and 24) This week we completed our discussion of Chapter 5 of [VST] Recall that if V and W are inner product spaces then a linear map T : V W is called an isometry
More informationChapter 1  Matrices & Determinants
Chapter 1  Matrices & Determinants Arthur Cayley (August 16, 1821  January 26, 1895) was a British Mathematician and Founder of the Modern British School of Pure Mathematics. As a child, Cayley enjoyed
More informationEigenvalues and Eigenvectors
Chapter 6 Eigenvalues and Eigenvectors 6. Introduction to Eigenvalues Linear equations Ax D b come from steady state problems. Eigenvalues have their greatest importance in dynamic problems. The solution
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 informationProof. The map. G n i. where d is the degree of D.
7. Divisors Definition 7.1. We say that a scheme X is regular in codimension one if every local ring of dimension one is regular, that is, the quotient m/m 2 is one dimensional, where m is the unique maximal
More informationZeros of a Polynomial Function
Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we
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 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 yaxis We observe that
More informationUNCORRECTED PAGE PROOFS
number and and algebra TopIC 17 Polynomials 17.1 Overview Why learn this? Just as number is learned in stages, so too are graphs. You have been building your knowledge of graphs and functions over time.
More informationCopy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2  Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers  {1,2,3,4,...}
More information4. Matrix inverses. left and right inverse. linear independence. nonsingular matrices. matrices with linearly independent columns
L. Vandenberghe EE133A (Spring 2016) 4. Matrix inverses left and right inverse linear independence nonsingular matrices matrices with linearly independent columns matrices with linearly independent rows
More information4. MATRICES Matrices
4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:
More information3.3. Solving Polynomial Equations. Introduction. Prerequisites. Learning Outcomes
Solving Polynomial Equations 3.3 Introduction Linear and quadratic equations, dealt within Sections 3.1 and 3.2, are members of a class of equations, called polynomial equations. These have the general
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More information3.7 Complex Zeros; Fundamental Theorem of Algebra
SECTION.7 Complex Zeros; Fundamental Theorem of Algebra 2.7 Complex Zeros; Fundamental Theorem of Algebra PREPARING FOR THIS SECTION Before getting started, review the following: Complex Numbers (Appendix,
More informationMath 1050 Khan Academy Extra Credit Algebra Assignment
Math 1050 Khan Academy Extra Credit Algebra Assignment KhanAcademy.org offers over 2,700 instructional videos, including hundreds of videos teaching algebra concepts, and corresponding problem sets. In
More informationSome facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)
Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the
More information(a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.
Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product
More informationMATH 65 NOTEBOOK CERTIFICATIONS
MATH 65 NOTEBOOK CERTIFICATIONS Review Material from Math 60 2.5 4.3 4.4a Chapter #8: Systems of Linear Equations 8.1 8.2 8.3 Chapter #5: Exponents and Polynomials 5.1 5.2a 5.2b 5.3 5.4 5.5 5.6a 5.7a 1
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 informationSYSTEMS OF EQUATIONS
SYSTEMS OF EQUATIONS 1. Examples of systems of equations Here are some examples of systems of equations. Each system has a number of equations and a number (not necessarily the same) of variables for which
More informationPURE MATHEMATICS AM 27
AM SYLLABUS (013) PURE MATHEMATICS AM 7 SYLLABUS 1 Pure Mathematics AM 7 Syllabus (Available in September) Paper I(3hrs)+Paper II(3hrs) 1. AIMS To prepare students for further studies in Mathematics and
More informationPURE MATHEMATICS AM 27
AM Syllabus (015): Pure Mathematics AM SYLLABUS (015) PURE MATHEMATICS AM 7 SYLLABUS 1 AM Syllabus (015): Pure Mathematics Pure Mathematics AM 7 Syllabus (Available in September) Paper I(3hrs)+Paper II(3hrs)
More information( % . This matrix consists of $ 4 5 " 5' the coefficients of the variables as they appear in the original system. The augmented 3 " 2 2 # 2 " 3 4&
Matrices define matrix We will use matrices to help us solve systems of equations. A matrix is a rectangular array of numbers enclosed in parentheses or brackets. In linear algebra, matrices are important
More information10. Graph Matrices Incidence Matrix
10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a
More information1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form
1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and
More informationB such that AB = I and BA = I. (We say B is an inverse of A.) Definition A square matrix A is invertible (or nonsingular) if matrix
Matrix inverses Recall... Definition A square matrix A is invertible (or nonsingular) if matrix B such that AB = and BA =. (We say B is an inverse of A.) Remark Not all square matrices are invertible.
More information8 Square matrices continued: Determinants
8 Square matrices continued: Determinants 8. Introduction Determinants give us important information about square matrices, and, as we ll soon see, are essential for the computation of eigenvalues. You
More informationGENERALIZED PYTHAGOREAN TRIPLES AND PYTHAGOREAN TRIPLE PRESERVING MATRICES. Mohan Tikoo and Haohao Wang
VOLUME 1, NUMBER 1, 009 3 GENERALIZED PYTHAGOREAN TRIPLES AND PYTHAGOREAN TRIPLE PRESERVING MATRICES Mohan Tikoo and Haohao Wang Abstract. Traditionally, Pythagorean triples (PT) consist of three positive
More informationZeros of Polynomial Functions
Review: Synthetic Division Find (x 25x  5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 35x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 35x 2 + x + 2. Zeros of Polynomial Functions Introduction
More information10.3 POWER METHOD FOR APPROXIMATING EIGENVALUES
58 CHAPTER NUMERICAL METHODS. POWER METHOD FOR APPROXIMATING EIGENVALUES In Chapter 7 you saw that the eigenvalues of an n n matrix A are obtained by solving its characteristic equation n c nn c nn...
More informationMATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix.
MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An mbyn matrix is a rectangular array of numbers that has m rows and n columns: a 11
More informationUnderstanding Basic Calculus
Understanding Basic Calculus S.K. Chung Dedicated to all the people who have helped me in my life. i Preface This book is a revised and expanded version of the lecture notes for Basic Calculus and other
More informationChapter 8. Matrices II: inverses. 8.1 What is an inverse?
Chapter 8 Matrices II: inverses We have learnt how to add subtract and multiply matrices but we have not defined division. The reason is that in general it cannot always be defined. In this chapter, we
More informationIt is not immediately obvious that this should even give an integer. Since 1 < 1 5
Math 163  Introductory Seminar Lehigh University Spring 8 Notes on Fibonacci numbers, binomial coefficients and mathematical induction These are mostly notes from a previous class and thus include some
More informationP.E.R.T. Math Study Guide
A guide to help you prepare for the Math subtest of Florida s Postsecondary Education Readiness Test or P.E.R.T. P.E.R.T. Math Study Guide www.perttest.com PERT  A Math Study Guide 1. Linear Equations
More informationA note on companion matrices
Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod
More informationRow Operations and Inverse Matrices on the TI83
Row Operations and Inverse Matrices on the TI83 I. Elementary Row Operations 2 8 A. Let A =. 2 7 B. To interchange rows and 2 of matrix A: MATRIX MATH C:rowSwap( MATRIX NAMES :[A],, 2 ) ENTER. 2 7 The
More informationDefinition A square matrix M is invertible (or nonsingular) if there exists a matrix M 1 such that
0. Inverse Matrix Definition A square matrix M is invertible (or nonsingular) if there exists a matrix M such that M M = I = M M. Inverse of a 2 2 Matrix Let M and N be the matrices: a b d b M =, N = c
More informationPutnam Notes Polynomials and palindromes
Putnam Notes Polynomials and palindromes Polynomials show up one way or another in just about every area of math. You will hardly ever see any math competition without at least one problem explicitly concerning
More informationProblem Set 7  Fall 2008 Due Tuesday, Oct. 28 at 1:00
18.781 Problem Set 7  Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list
More informationFacts About Eigenvalues
Facts About Eigenvalues By Dr David Butler Definitions Suppose A is an n n matrix An eigenvalue of A is a number λ such that Av = λv for some nonzero vector v An eigenvector of A is a nonzero vector v
More informationMATHEMATICS (CLASSES XI XII)
MATHEMATICS (CLASSES XI XII) General Guidelines (i) All concepts/identities must be illustrated by situational examples. (ii) The language of word problems must be clear, simple and unambiguous. (iii)
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 informationLecture Notes on Polynomials
Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex
More informationThese axioms must hold for all vectors ū, v, and w in V and all scalars c and d.
DEFINITION: A vector space is a nonempty set V of objects, called vectors, on which are defined two operations, called addition and multiplication by scalars (real numbers), subject to the following axioms
More informationDeterminants. Dr. Doreen De Leon Math 152, Fall 2015
Determinants Dr. Doreen De Leon Math 52, Fall 205 Determinant of a Matrix Elementary Matrices We will first discuss matrices that can be used to produce an elementary row operation on a given matrix A.
More informationBEGINNING ALGEBRA ACKNOWLEDMENTS
BEGINNING ALGEBRA The Nursing Department of Labouré College requested the Department of Academic Planning and Support Services to help with mathematics preparatory materials for its Bachelor of Science
More informationOn the general equation of the second degree
On the general equation of the second degree S Kesavan The Institute of Mathematical Sciences, CIT Campus, Taramani, Chennai  600 113 email:kesh@imscresin Abstract We give a unified treatment of the
More informationThe Method of Partial Fractions Math 121 Calculus II Spring 2015
Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method
More informationDEFINITION 5.1.1 A complex number is a matrix of the form. x y. , y x
Chapter 5 COMPLEX NUMBERS 5.1 Constructing the complex numbers One way of introducing the field C of complex numbers is via the arithmetic of matrices. DEFINITION 5.1.1 A complex number is a matrix of
More informationFactoring Cubic Polynomials
Factoring Cubic Polynomials Robert G. Underwood 1. Introduction There are at least two ways in which using the famous Cardano formulas (1545) to factor cubic polynomials present more difficulties than
More informationLinearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for inclass presentation
More informationChapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. ( 1 1 5 2 0 6
Chapter 7 Matrices Definition An m n matrix is an array of numbers set out in m rows and n columns Examples (i ( 1 1 5 2 0 6 has 2 rows and 3 columns and so it is a 2 3 matrix (ii 1 0 7 1 2 3 3 1 is a
More information1.1 Solving a Linear Equation ax + b = 0
1.1 Solving a Linear Equation ax + b = 0 To solve an equation ax + b = 0 : (i) move b to the other side (subtract b from both sides) (ii) divide both sides by a Example: Solve x = 0 (i) x = 0 x = (ii)
More information