The Cycloheptane Molecule
|
|
- Brianne Owen
- 7 years ago
- Views:
Transcription
1 The Cycloheptane Molecule A Challenge to Computer Algebra (Invited lecture, ISSAC 97, Maui, Hawaii, USA, (version Jan. 98)) A.H.M. Levelt University of Nijmegen, The Netherlands ahml@sci.kun.nl 1
2 Thanks to: G. Pfister and colleagues at Kaiserslautern for their hospitality, introduction to Singular and help with my computations. J.-C. Faugère and D. Lazard for their attention, suggestions and explanation, in particular of FGB. G.J.M. Ariaans, Organic Chemistry Department of the University of Nijmegen, for opening to me the fascinating world of molecular computation and visualization. Mark van Hoeij for our many discussions, his suggestions and criticism. 2
3 Overview How it started First computations Cycloheptane enters the scene New symmetric computations Pictures Gröbner basis exercises Symmetry Does it matter to the chemists? 3
4 How it started About 1993 some Dutch mathematicians were playing with robot-like toys made of plastic electricity tubes as I show you here (picture on slide 6). The 6-toy (resp. 7-toy ) consists of 6 (resp. 7) rods of equal length = 1, connected in cyclic order, the angle between successive rods being straight. If one rod is fixed the next one can freely rotate about the first one in a plane perpendicular to that first one (forget about the remaining rods). Interesting observation: both toys have one degree of freedom (as you may feel while handling them). Other observation: the 6-toy has a second, rigid, realization. Problem: Try to describe and understand the movements of the toys from a mathematical point of view. Easy for the 6-toy. Algebraic geometrist tried (a bit) to do the 7. No success. As an ignorant in robotics I looked at the problem as a pastime and solved the problem (that is to say...) using a computer algebra system (Maple). From time to time I returned to the problem and did some more computations. 4
5 Somewhat later cycloheptane appeared. Study of these concrete objects has many aspects: Algebraic geometry (curves, real and complex) Gröbner bases Symmetry and invariants Symbolic computation Numerical computation Graphics Applications (chemistry) Cycloheptane offers a good opportunity to demonstrate many well-known techniques of computer algebra. 5
6 First computations Cf. A lecture in honour of B. Buchberger, Nijmegen, October 1993 = P 0 7 P x y z P P P P P 6 P a a a a a a a 1 α α α α α α α The notations in this picture are used everywhere in the sequel. 6
7 For vectors u = [u 1, u 2, u 3 ], v = [v 1, v 2, v 3 ] in 3-space write (u, v) = u 1 v 1 + u 2 v 2 + u3v3, the inner product. Voici les relations à satisfaire: (1) (a1, a2) = (a2, a3) = = (a6, a7) = (a7, a1) = c, (a1, a1) = (a2, a2) = = (a7, a7) = 1, a1 + a2 + + a7 = 0. 7
8 Assume a1 = [1, 0, 0], a2 = [0, 1, 0]. Then a3 = [cos(α1), 0, sin(α1)] satifies (a2, a3) = 0, (a3, a3) = 1. Note: (a1, a3) = cos(α1). Next try a4 = (x, y, z). (a3, a4) = 0 implies z = x cos(α1)/ sin(α1). Substitute in 1 = (a4, a4) = x 2 + y 2 + z 2 and find x 2 sin(α1) 2 + y2 = 1. Put x/ sin(α1) = sin(α2), y = cos(α2). Then a4 = [sin(α1) sin(α2), cos(α2), cos(α1) sin(α2)]. Note: (a2, a4) = cos(α2). Introducing two more angles one finds: a6 = [cos(α4), sin(α3) sin(α4), cos(α3) sin(α4)], a7 = [0, cos(α3), sin(α3)]. Note that: (a2, a7) = cos(α3), (a1, a6) = cos(α4). The closing condition a1 + + a7 = 0 yields a5 = a1 a2 a3 a4 a6 a7, an expression in sines and cosines of α1,..., α4. Conditions for a5: (a5, a5) = 1, (a4, a5) = 0, (a5, a6) = 0 = 3 polynomial equations in sines and cosines of α1,..., α4. 8
9 Choose rational parametrizations of the type cos(α) = 1 s2 2s 1 + s2, sin(α) = 1 + s 2 = three polynomial equations g1 = 0, g2 = 0, g3 = 0 in s1, s2, s3, s4. Here is g 1 : 17 + s3 2 s4 2 s1 2 + s3 2 s2 2 s4 2 + s2 2 s4 2 s1 2 + s3 2 s2 2 s s s s s s1 s3 + s4 2 s1 2 + s3 2 s2 2 s4 2 s1 2 8 s3 s4 8 s2 s4 + s3 2 s s1 s2 + 9 s2 2 s s3 s2 + s3 2 s s3 2 s s4 s1 + s2 2 s s1 s3 2 s4 2 s2 8 s2 2 s3 s1 2 s4 8 s1 s3 s4 2 s s1 s3 s s2 s4 2 s1 + 8 s3 2 s4 s2 s s3 s4 s1 2 8 s1 s3 s s4 s1 s2 2 8 s3 2 s4 s2 + 8 s2 s3 2 s1 + 8 s2 s1 2 s4 + 8 s2 2 s4 s3 16 s3 s2 s1 2 Final computation, elinination by means of resultants: res1 = resultant s 4 (g1, g2), res2 = resultant s 4 (g1, g3). res1 and res2 have some spurious factors. There remain 2 irreducible polynomials in s1, s2, s3. Taking resultants w.r.t. s3 and s2 leads to 2 irreducible symmetric polynomials in s1, s2, resp. s1, s3 of degree 32 with 145 terms, 10 digits coefficients. 9
10 Cycloheptane enters the scene Early 1994 the Dutch physicist P.W. Kasteleyn draw my attention to: L.J. Oosterhoff, Restricted free rotation and cyclic molecules, Ph.D. thesis, Leiden, It contains a nice symmetric approach to cyclohexane. Cyclohexane is like our 6-toy, the straight angle is replaced by a 109 degree one (cosine = 1/3). I applied his idea to cycloheptane. 10
11 New symmetric computations x 7 x 1 α a 7 α a 1 x 6 a 6 α α a 2 x 2 α a 5 a 3 x 5 α a 4 α x 3 Here are the relations defining our model: x 4 (1) (a1, a2) = (a2, a3) = = (a6, a7) = (a7, a1) = c, (a1, a1) = (a2, a2) = = (a7, a7) = 1, a1 + a2 + + a7 = 0. c = 0 for the 7-toy, c = 1/3 for cycloheptane. Other values of c between -1 and 1 may be considered. The equations (1) make sense in Euclidean n-space. In our case n 3. The constraints imposed by the 3- dimensionality will be analyzed below. 11
12 Number of equations and unknowns For ai in 3-space the unknowns are the 21 coordinates of a1,..., a7. (1) is a system of 17 equations in the coordinates of a1,..., a7. Not all solutions lead to different configurations: congruent ones should be identified. Normalize by picking 1 out of each congruence class. This can be realized by imposing 3 more equations: a1 2 = 0, a1 3 = 0, a2 3 = 0. Now we have 20 polynomial equations in 21 unknowns. From affine algebraic geometry we know that (over an algebraically closed ground field) each irreducible component of the solution space has dimension 1. (Note: the solution space may be empty!) 12
13 The matrix S Define the 7x7 matrix S by S i,j = (ai, aj) (inner product of ai and aj). Easy to see: all S i,j are simple expressions in x 1 = S 2,7, x 2 = S 1,3, x 3 = S 2,4, x 4 = S 3,5, x 5 = S 4,6, x 6 = S 5,7, x 7 = S 1,6. a1,..., a7 are 7 vectors in 3-space. = any 4 of them linearly dependent. E.g. for a1, a2, a3, a4 λ1,..., λ4 not all = 0, such that λ1a1 + λ4a4 = 0. Take inner product with aj (j = 1,..., 7): λ1s 1,j + λ4s 4,j = 0. = first 4 columns of S linearly dependent. Hence necessary condition: (2) rank(s) 3. Equivalent: all 35 principal subdeterminants of S of order 4 vanish. I denotes the ideal generated by these subdeterminants. 13
14 Assume rank(s) = 3 Remark: rank(s) 2 impossible for c = 0, c = 1/3. May suppose S1 = S 1,1 S 1,2 S 1,3 S 2,1 S 2,2 S 2,3 S 3,1 S 3,2 S 3,3 is invertible. S2 def = the matrix consisting of the first 3 rows of S and U = S1 1 S2. = the j-th column of U is the coordinate vector of aj w.r.t. the basis a1, a2, a3 (assumed independent). cartesian coordinate system such that a1 = [1, 0, 0], a2 = [c, 1 c 2, 0], c(1 x2) x2 a3 = [x2, 2, + 2c 2 x2 2c ]. 1 c 2 1 c 2 T def def = the 3x3 matrix with columns a1, a2, a3, C a = T U. Then a 1,..., a 7 are the successive columns (viewed as vectors) of C a. Remark: The essential point is that the coordinate expression of (ai, aj) is what you expect. 14
15 Explicit formulas for a1,..., a7, case c = 0 x2 2 + y2 2 = 1 (y2 = 1 x2 2 ) a1 = [1, 0, 0] a2 = [0, 1, 0] a3 = [x2, 0, y2] a4 = [ 1 x2 x3 + x6, x3, 2 1 y2 x2 ( 1 2 x2 2 x3 + 2 x6) ] 2 x2 2 1 a5 = [ x7 + x3 x6 1 2, 1 x3 + x7 x4, 2 1 y2 (2 x2 x7 2 x3 x2 + 2 x6 x2 + x2 + 2 x4) ] 2 x2 2 1 a6 = [x7, x7 1 x1 + x4, 2 1 y2 2 ( 2 x2 x7 1 2 x4 + 2 x1 2 x5) x22 1] a7 = [0, x1, 1 y2 (1 + 2 x1 + 2 x2 2 x5) 2 x2 2 ] 1 15
16 Explicit formulas for a1,..., a7, case c = 1/3 9(x2 1/9) 2 + 8y2 2 = (8/3) 2 (i.e. y2 = 1/4 18x x2 + 14) a1 = [1, 0, 0] a2 = [ 1 3, 2 3 2, 0] a3 = [x2, 1 4 2(x2 1), y2] a4 = [ 5 6 x2 x3 + x6, 1 2(54x x x2x3 54x2x6 18x6 + 72x3 + 23), 12 9x (54x x2 + 72x2x3 54x2x6 24x3 + 6x6 + 11)y2 ] 6 9x2 2 2x2 7 a7 = 16
17 Symmetry C: cyclic permutation C : a 1 a 2 a 7 a 1. C respects the relations (1) between a 1,..., a 7. T : permutation T : a1 a6, a2 a5, a3 a4, also respects the relations (1). C and T generate the dihedral group D 7. Note: C : x 1 x 2 x 7 x 1. T : x1 x6, x2 x5, x3 x4, D 7 operates on the polynomial ring R = Q[x1,..., x7]. All (polynomial) relations between x 1,..., x 7 following from (2) are respected by the action of D 7. Hence belong to R, the subring of invariants of R under the action of D 7. In particular I comes from an ideal Ĩ of R. The configuration space Γ of cycloheptane (resp. the c-toy ) is the zero set of I, an algebraic subspace of 7-space. Remark: Chemists say conformation instead of configuration. 17
18 Questions about Γ 1. Is Γ non-empty? 2. How to find points on Γ? 3. Dimension of Γ? 4. Is Γ smooth? 5. How many (real) components? 6. Find nice (e.g. small) sets of generators of I. 7. How does D 7 operate on Γ? 8. Can Γ be plotted? 9. If so, do we better understand the movements? 18
19 Elimination (Will lead to partial answers to the questions.) Computations in R = Q[x 1,..., x 7 ], c = 0, resp. c = 1/3. Symbols like f 125 denote an element of R only depending on x 1, x 2, x 5. Input for the next computation: 2 simple principal subdeterminants of order 3 of S: f 125, f The D 7 -symmetry is applied several times. E.g. C : f 125 f 236, C 3 : f 125 f 256. Try to find relations between as few x s as possible. Method: elimination using resultants. Cf. scheme on next slide. f 12 has total degree 32, 289 terms and 30-digits coefficients (12-digits for 7 ). Cpu time for computing f 23, f 36, f secs (MapleV4, Pentium 200 MHz) 19
20 Elimination scheme f 125 x 6 g 235 x 1 f 2356 x 2 f 35 f x 5 g 236 f 256 x 6 f, f x 2 x 6 f 235 f 236 Input Elimination scheme Output The arrows connecting f 125, f with f 2356 and the symbol x 1 mean: f 2356 = resultant x1 (f 125, f ). 20
21 Computing points on Γ Recent result: For all ξ 1, ξ 2 C with at most finitely many exceptions there exist precisely one sequence ξ 3,..., ξ 7 C such that ξ 1,..., ξ 7 is a point of Γ. Consequence: The projection mapping: Γ f 12 = 0 is a birational morphism of algebraic curves. Algorithm for computing ξ 3,..., ξ 7. Idea: Assume Γ. Let ξ 1,..., ξ 7 Γ. Then f 12 (ξ 1, ξ 2 ) = 0, f 15 (ξ 1, ξ 5 ) = 0, f 125 (ξ 1, ξ 2, ξ 5 ) = 0. f 15 and f 125 are known. f 125 has degree 2 in x 5. r 125 = prem(f 15, f 125, x 5 ). r 125 has degree 1 in x 5 and r 125 (ξ 1, ξ 2, ξ 5 ) = 0. Hence ξ 5 is a rational function expression in ξ 1, ξ 2. Consequence: with a finite number of exceptions ξ 1, ξ 2 determine ξ 5 uniquely. In a similar way one finds ξ 4, ξ 3, ξ 6, ξ 7. (x,x,x,x,x ) (x,x,x,x,x ) f (x,x,x,x,x 1 3 ) f f f12457 f (x,x,x,x ) 1245 (x,x,x ) f 125 Solution scheme (x 1,x ) 2 Algorithm works for floating point numbers, points with values in a finite field, resp. algebraic numbers. A point on Γ with values in algebraic numbers can be computed. 21
22 Pictures Example of an old (1993) plot: f13 for 7, plotted by Maple s implicitplot : c=0, x1, x x3 0.2 x and f 12 for cycloheptane: c=1/3, x1, x2 0.2 x x
23 Shapes of projections Three different shapes for the projections on the 2- dimensional coordinate planes. Quite similar for c=0 and c=1/3. But look at the loose part in the cycloheptane plot. Two problems: Problem 1. The projections of Γ are highly singular. Is Γ itself singular? What do the plots say about the move- Problem 2. ments? The algorithm for computing points on Γ leads to a (visual) solution to Problem 1. Projections of Γ onto 3- dimensional coordinate spaces can be computed. These projections clearly show that (the real part) of Γ is smooth and has 2 components. 23
24 Parametrization of cycloheptane y-axis L Q P C E -1-7/9 α 0 1 x-axis Needed: parametrization of the algebraic function y = 1/ x 18x 2, i.e. x and y related by E : 9(x 1/9) 2 + 8y 2 = (8/3) 2. P = (x, y) is on the ellips E. L line through (1, 0) and P. L cuts circle C in Q. t: slope of L. Then: ( ) 8t 2 7 P = 8t 2 + 9, 16t. 8t Conversely: t = y/(x 1). Also: ( ) cos(a) P = 17 cos(a), 16 sin(a). 17 cos(a) Conversely: cos(a) = (17x 1)/(x + 15). 24
25 Pictures of relations between angles cycloheptane angle angle1 cycloheptane angle angle angle Notice the two components 25
26 Gröbner basis exercises Some results: For 7 one can write down a system of 12 equations in 13 cartesian coordinates. G. Pfister (1995) solved this system (i.e. he computed f 12) using Singular. Computing time: 10 hrs on a HP workstation. (Cf. elimination scheme ) G. Pfister using the eliminate command of Singular computed f 23 in about 1800 secs. The harder problem of computing f35 took too much time. For the same problem J.-C. Faugère used FGb to compute f 35. Computing time 350 secs! (Comparable to the resultant method.) Why use Gröbner bases for this kind of problems? With fast Gröbner basis algorithms, the cycloheptane computations become automatic and trivial. For cycloheptane they may become as easy as the use of today s GB-packages for (the much simpler) cyclohexane. The cyclohexane computations will be shown now. 26
27 GB-computation for cyclohexane Setup similar to cycloheptane case. Here S is 6x6 matrix and there are 3 unknowns: x1, x2, x3. The ideal I of the principal 3x3 subdeterminants is generated bij 9 of them. The zero set of I is the configuration curve Γ 3 in 3-space. The symmetry group is the full S3. I is invariant under S 3. The Gröbner basis G ( plex ordering) is computed in a few seconds. G is generated by g1, g2, g3, g4 where g1 = f13 = 9x1 2 x x1 2 x3 + 6x1 x3 2 23x1 2 20x1 x3 23x3 2 34x1 34x3 15, g2 = 9x1 x3 3 9x2 x3 3 9x1 x3 3 9x2 x3 2 6x x1 x2 +41x1 x3 + 41x2 x3 + 18x x1 + 21x2 + 54x3 + 18, g3 = (x3 + 3)(3x3 + 1)(9x2 x x x1 x x1 x3 +6x2 x3 20x3 23x1 23x = f23 (= f13(x2, x3)). f13 is symmetric and transformed into f23, f12 by S 3. Note that (f 12, f 13, f 23) I. (Look at x1 = x2 = x3 = 1/3.) Similar to cycloheptane, but much simpler. 27
28 Primary decomposition of I for cyclohexane Primary decomposition of the configuration ideal I, computed by Singular: I = Q1 Q2 Q3, where Q1, Q2, Q3 are the prime ideals: Q1 = (9x2 x x x1 x x1 x3 + 6x2 x3 20x3 23x1 23x2 34, f23, 3x1 x2 + 3x1 x3 + 3x2 x3 + 2x2 + 2x2 + 2x3 + 1), Q2 = (x1 + 3, x2 + 3, x3 + 3), Q3 = (3x1 + 1, 3x2 + 1, 3x3 + 1). Q2 belongs to the point [ 3, 3, 3] (no meaning for our model). Q3 belongs to [ 1/3, 1/3, 1/3] and corresponds to the (rigid) chair form of cyclohexane. Q1 corresponds to the 1 degree of freedom configuration of cyclohexane. Easy to verify: Q defines a (singular) plane curve of genus 1. 28
29 Symmetry For the notions and results cf. B. Sturmfels, Algorithms in Invarant Theory, Springer Verlag, In particular pp D 7 operates on Γ = Γ 7. Challenge: Compute the relative orbit variety Γ/D 7. Little hope that Sturmfels s method works for Γ 7 : Gröbner bases computations are too big. Computations possible for Γ 3 with group S 3. Gives good idea of method as will be shown now. S 3 operates on 3-space and on R = Q[x1, x2, x3]. R, the subring of invariants, is Q[y1, y2, y3], where y1 = x1 + x2 + x3, y2 = x1 x2 + x2 x3 + x3 x1, y3 = x1 x2 x3. 29
30 Now view x1,..., y3 as indeterminates. T = Q[x1, x2, x3, y1, y2, y3] and J = (y1 (x1 + x2 + x3), y2 (x1 x2 + x2 x3 + x3 x1), y3 x1 x2 x3). J is the ideal belonging to the graph of the inclusion map of Q[y1, y2, y3] Q[x1, x2, x3]. The ideal H of T generated by J and I (= (g1, g2, g3, g4)) corresponds to graph of Γ 3 Γ 3 /S 3. Hence Γ 3 /S 3 corresponds to H Q[y1, y2, y3]. Generators can be found by standard methods of Gröbner basis theory. Fix an admissible ordering on T where x1, x2, x3 precede y1, y2, y3. The ideal H of T is generated by and g1, g2, g3, g4 y1 (x1+x2+x3), y2 (x1 x2+x2 x3+x1 x3), y3 x1 x2 x3. Compute Gröbner basis G H of H. It has 8 members, and G H Q[y1, y2, y3] is the set 17472y y2 y y2 162y y , 2093y y2 y3 1986y2 540y y , 621y2 y y2 y y2 162y y y
31 The zero set is the relative orbit space Γ 3 /S 3. It consists of 3 components, two points Y 1 = [ 9, 27, 27], Y 2 = [ 1, 1/3, 1/27] and the (parametrized) straight line s [ 9/23 s 34/23, 6/23, s + 15/23, s]. Over Y 1 (resp. Y 2) lies the point [ 3, 3, 3] (resp. [ 1/3, 1/3, 1/3]) that we have met before. Let X3 be the part of Γ lying over Y 3. One can prove: X3 Y 3 is a ramified covering of degree 6. On X3 there are 12 ramification points with ramification index 2, lying over the points y3 = 7 81, 9, , Agreement with Hurwitz formula (g = genus) 2g(X3) 2 = deg(x3/y 3)(2g(Y 3) 2) + 6. P X3 (e P 1) where e P is the ramification index of the mapping at P. (Fill in: g(x3) = 1, g(y 3) = 0, deg(x3/y 3) = 6, e P = 2 at the 12 ramification points.) The ramification points correspond to special configurations, e.g. [ 1/3, 1/3, 7/9] X3 over y3 = 7/81. But what is special here? 31
32 Does it matter to the chemists? The answer is: NO!. In our model the geometry rules: the building blocks are rigid; in chemistry energy rules and nothing is rigid. Distances between carbon molecules may vary, just as angles between bonds. The molecule is viewed as a conglomerate of atoms kept together by the various forces between the constituents. The geometry of the molecule is the result of the balance of forces. The chemists flexible model is the opposite of the rigid one in this paper. Also in another respect the chemists model is more realistic. It takes into account the other (non-carbon) atoms. In their cycloheptane the 14 hydrogene atoms play a role. There exist powerful software for molecular modeling and visualization. A package like CS Chem3D Pro enables you draw organic chemical structures you have in mind. After the command minimize energy a computation starts that finds the nearest (local) minimum of energy by repeated small changes of the geometry. In this way one finds for cycloheptane the two characteristic shapes ( boat and chair ) depending on the starting position. Our Γ vanishes completely in this approach. For more complicate molecules there is a danger of overlooking some potential wells. 32
1 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 informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More informationRecall that two vectors in are perpendicular or orthogonal provided that their dot
Orthogonal Complements and Projections Recall that two vectors in are perpendicular or orthogonal provided that their dot product vanishes That is, if and only if Example 1 The vectors in are orthogonal
More informationOperation Count; Numerical Linear Algebra
10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More 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 informationMCS 563 Spring 2014 Analytic Symbolic Computation Wednesday 9 April. Hilbert Polynomials
Hilbert Polynomials For a monomial ideal, we derive the dimension counting the monomials in the complement, arriving at the notion of the Hilbert polynomial. The first half of the note is derived from
More informationRegression III: Advanced Methods
Lecture 16: Generalized Additive Models Regression III: Advanced Methods Bill Jacoby Michigan State University http://polisci.msu.edu/jacoby/icpsr/regress3 Goals of the Lecture Introduce Additive Models
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 informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationSolving Simultaneous Equations and Matrices
Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering
More informationCopyrighted Material. Chapter 1 DEGREE OF A CURVE
Chapter 1 DEGREE OF A CURVE Road Map The idea of degree is a fundamental concept, which will take us several chapters to explore in depth. We begin by explaining what an algebraic curve is, and offer two
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationCurrent Standard: Mathematical Concepts and Applications Shape, Space, and Measurement- Primary
Shape, Space, and Measurement- Primary A student shall apply concepts of shape, space, and measurement to solve problems involving two- and three-dimensional shapes by demonstrating an understanding of:
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationThe Graphical Method: An Example
The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,
More information1.7 Graphs of Functions
64 Relations and Functions 1.7 Graphs of Functions In Section 1.4 we defined a function as a special type of relation; one in which each x-coordinate was matched with only one y-coordinate. We spent most
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationCryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
More informationSecond Order Differential Equations with Hypergeometric Solutions of Degree Three
Second Order Differential Equations with Hypergeometric Solutions of Degree Three Vijay Jung Kunwar, Mark van Hoeij Department of Mathematics, Florida State University Tallahassee, FL 0-07, USA vkunwar@mathfsuedu,
More informationLeast-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
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 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 information1.2 GRAPHS OF EQUATIONS. Copyright Cengage Learning. All rights reserved.
1.2 GRAPHS OF EQUATIONS Copyright Cengage Learning. All rights reserved. What You Should Learn Sketch graphs of equations. Find x- and y-intercepts of graphs of equations. Use symmetry to sketch graphs
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More information1 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 informationdiscuss how to describe points, lines and planes in 3 space.
Chapter 2 3 Space: lines and planes In this chapter we discuss how to describe points, lines and planes in 3 space. introduce the language of vectors. discuss various matters concerning the relative position
More informationNEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS
NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document
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 information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More informationNotes on Orthogonal and Symmetric Matrices MENU, Winter 2013
Notes on Orthogonal and Symmetric Matrices MENU, Winter 201 These notes summarize the main properties and uses of orthogonal and symmetric matrices. We covered quite a bit of material regarding these topics,
More informationLecture 2: Homogeneous Coordinates, Lines and Conics
Lecture 2: Homogeneous Coordinates, Lines and Conics 1 Homogeneous Coordinates In Lecture 1 we derived the camera equations λx = P X, (1) where x = (x 1, x 2, 1), X = (X 1, X 2, X 3, 1) and P is a 3 4
More informationMath 241, Exam 1 Information.
Math 241, Exam 1 Information. 9/24/12, LC 310, 11:15-12:05. Exam 1 will be based on: Sections 12.1-12.5, 14.1-14.3. The corresponding assigned homework problems (see http://www.math.sc.edu/ boylan/sccourses/241fa12/241.html)
More informationThe Math Circle, Spring 2004
The Math Circle, Spring 2004 (Talks by Gordon Ritter) What is Non-Euclidean Geometry? Most geometries on the plane R 2 are non-euclidean. Let s denote arc length. Then Euclidean geometry arises from the
More informationSection 1.1. Introduction to R n
The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to
More informationLogo Symmetry Learning Task. Unit 5
Logo Symmetry Learning Task Unit 5 Course Mathematics I: Algebra, Geometry, Statistics Overview The Logo Symmetry Learning Task explores graph symmetry and odd and even functions. Students are asked to
More informationDERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
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 informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More informationMath 215 HW #6 Solutions
Math 5 HW #6 Solutions Problem 34 Show that x y is orthogonal to x + y if and only if x = y Proof First, suppose x y is orthogonal to x + y Then since x, y = y, x In other words, = x y, x + y = (x y) T
More information1.5 Equations of Lines and Planes in 3-D
40 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE Figure 1.16: Line through P 0 parallel to v 1.5 Equations of Lines and Planes in 3-D Recall that given a point P = (a, b, c), one can draw a vector from
More informationBig Ideas in Mathematics
Big Ideas in Mathematics which are important to all mathematics learning. (Adapted from the NCTM Curriculum Focal Points, 2006) The Mathematics Big Ideas are organized using the PA Mathematics Standards
More informationInner product. Definition of inner product
Math 20F Linear Algebra Lecture 25 1 Inner product Review: Definition of inner product. Slide 1 Norm and distance. Orthogonal vectors. Orthogonal complement. Orthogonal basis. Definition of inner product
More informationx 2 + y 2 = 1 y 1 = x 2 + 2x y = x 2 + 2x + 1
Implicit Functions Defining Implicit Functions Up until now in this course, we have only talked about functions, which assign to every real number x in their domain exactly one real number f(x). The graphs
More informationLimits and Continuity
Math 20C Multivariable Calculus Lecture Limits and Continuity Slide Review of Limit. Side limits and squeeze theorem. Continuous functions of 2,3 variables. Review: Limits Slide 2 Definition Given a function
More informationCopyright 2011 Casa Software Ltd. www.casaxps.com. Centre of Mass
Centre of Mass A central theme in mathematical modelling is that of reducing complex problems to simpler, and hopefully, equivalent problems for which mathematical analysis is possible. The concept of
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
More 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 informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
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 informationVector Spaces; the Space R n
Vector Spaces; the Space R n Vector Spaces A vector space (over the real numbers) is a set V of mathematical entities, called vectors, U, V, W, etc, in which an addition operation + is defined and in which
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
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 informationComputer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.
An Example 2 3 4 Outline Objective: Develop methods and algorithms to mathematically model shape of real world objects Categories: Wire-Frame Representation Object is represented as as a set of points
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 information(Refer Slide Time: 1:42)
Introduction to Computer Graphics Dr. Prem Kalra Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture - 10 Curves So today we are going to have a new topic. So far
More informationFigure 1.1 Vector A and Vector F
CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities have
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 informationCreating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities
Algebra 1, Quarter 2, Unit 2.1 Creating, Solving, and Graphing Systems of Linear Equations and Linear Inequalities Overview Number of instructional days: 15 (1 day = 45 60 minutes) Content to be learned
More informationCURVE FITTING LEAST SQUARES APPROXIMATION
CURVE FITTING LEAST SQUARES APPROXIMATION Data analysis and curve fitting: Imagine that we are studying a physical system involving two quantities: x and y Also suppose that we expect a linear relationship
More informationSolution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
More informationTorgerson s Classical MDS derivation: 1: Determining Coordinates from Euclidean Distances
Torgerson s Classical MDS derivation: 1: Determining Coordinates from Euclidean Distances It is possible to construct a matrix X of Cartesian coordinates of points in Euclidean space when we know the Euclidean
More informationHigh School Algebra Reasoning with Equations and Inequalities Solve systems of equations.
Performance Assessment Task Graphs (2006) Grade 9 This task challenges a student to use knowledge of graphs and their significant features to identify the linear equations for various lines. A student
More informationWe can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model
CHAPTER 4 CURVES 4.1 Introduction In order to understand the significance of curves, we should look into the types of model representations that are used in geometric modeling. Curves play a very significant
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 informationLecture 8 : Coordinate Geometry. The coordinate plane The points on a line can be referenced if we choose an origin and a unit of 20
Lecture 8 : Coordinate Geometry The coordinate plane The points on a line can be referenced if we choose an origin and a unit of 0 distance on the axis and give each point an identity on the corresponding
More informationThnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks
Thnkwell s Homeschool Precalculus Course Lesson Plan: 36 weeks Welcome to Thinkwell s Homeschool Precalculus! We re thrilled that you ve decided to make us part of your homeschool curriculum. This lesson
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
More 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 informationLINEAR EQUATIONS IN TWO VARIABLES
66 MATHEMATICS CHAPTER 4 LINEAR EQUATIONS IN TWO VARIABLES The principal use of the Analytic Art is to bring Mathematical Problems to Equations and to exhibit those Equations in the most simple terms that
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 informationGeometric Transformations
Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationSouth Carolina College- and Career-Ready (SCCCR) Pre-Calculus
South Carolina College- and Career-Ready (SCCCR) Pre-Calculus Key Concepts Arithmetic with Polynomials and Rational Expressions PC.AAPR.2 PC.AAPR.3 PC.AAPR.4 PC.AAPR.5 PC.AAPR.6 PC.AAPR.7 Standards Know
More informationwith functions, expressions and equations which follow in units 3 and 4.
Grade 8 Overview View unit yearlong overview here The unit design was created in line with the areas of focus for grade 8 Mathematics as identified by the Common Core State Standards and the PARCC Model
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 informationx1 x 2 x 3 y 1 y 2 y 3 x 1 y 2 x 2 y 1 0.
Cross product 1 Chapter 7 Cross product We are getting ready to study integration in several variables. Until now we have been doing only differential calculus. One outcome of this study will be our ability
More informationVector Notation: AB represents the vector from point A to point B on a graph. The vector can be computed by B A.
1 Linear Transformations Prepared by: Robin Michelle King A transformation of an object is a change in position or dimension (or both) of the object. The resulting object after the transformation is called
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More information9.4. The Scalar Product. Introduction. Prerequisites. Learning Style. Learning Outcomes
The Scalar Product 9.4 Introduction There are two kinds of multiplication involving vectors. The first is known as the scalar product or dot product. This is so-called because when the scalar product of
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 real-life problem. algebraic expression - An expression with variables.
More informationRow Echelon Form and Reduced Row Echelon Form
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 in-class presentation
More informationGeorgia Department of Education Kathy Cox, State Superintendent of Schools 7/19/2005 All Rights Reserved 1
Accelerated Mathematics 3 This is a course in precalculus and statistics, designed to prepare students to take AB or BC Advanced Placement Calculus. It includes rational, circular trigonometric, and inverse
More informationLinear Algebra: Vectors
A Linear Algebra: Vectors A Appendix A: LINEAR ALGEBRA: VECTORS TABLE OF CONTENTS Page A Motivation A 3 A2 Vectors A 3 A2 Notational Conventions A 4 A22 Visualization A 5 A23 Special Vectors A 5 A3 Vector
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 informationWHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
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 informationKEANSBURG SCHOOL DISTRICT KEANSBURG HIGH SCHOOL Mathematics Department. HSPA 10 Curriculum. September 2007
KEANSBURG HIGH SCHOOL Mathematics Department HSPA 10 Curriculum September 2007 Written by: Karen Egan Mathematics Supervisor: Ann Gagliardi 7 days Sample and Display Data (Chapter 1 pp. 4-47) Surveys and
More informationLecture L3 - Vectors, Matrices and Coordinate Transformations
S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationBasic Algorithms In Computer Algebra
Basic Algorithms In Computer Algebra Kaiserslautern SS 2011 Prof. Dr. Wolfram Decker 2. Mai 2011 References Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, 1993. Cox, D.; Little,
More informationhttps://williamshartunionca.springboardonline.org/ebook/book/27e8f1b87a1c4555a1212b...
of 19 9/2/2014 12:09 PM Answers Teacher Copy Plan Pacing: 1 class period Chunking the Lesson Example A #1 Example B Example C #2 Check Your Understanding Lesson Practice Teach Bell-Ringer Activity Students
More informationLecture 14: Section 3.3
Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More 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 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 information