Dubna 2018: lines on cubic surfaces

Size: px
Start display at page:

Download "Dubna 2018: lines on cubic surfaces"

Transcription

1 Dubna 2018: lines on cubic surfaces Ivan Cheltsov 20th July 2018 Lecture 1: projective plane

2 Complex plane Definition A line in C 2 is a subset that is given by ax + by + c = 0 for some complex numbers a, b, c such that (a, b) (0, 0). Here x and y are coordinates on C 2. Lemma There is a unique line in C 2 passing through two distinct points. Proof. Let (x 1, y 1 ) and (x 2, y 2 ) be two distinct points. Then ) ) (y 2 y 1 )(x x 1 = (x 2 x 1 )(y y 1 defines the line that contains (x 1, y 1 ) and (x 2, y 2 ).

3 Intersection of two lines Let L 1 be a line in C 2 that is given by a 1 x + b 1 y = c 1, where a 1, b 1, c 1 are complex numbers and (a 1, b 1 ) (0, 0). Let L 2 be a line in C 2 that is given by a 2 x + b 2 y = c 2 where a 2, b 2, c 2 are complex numbers and (a 2, b 2 ) (0, 0). Lemma Suppose that L 1 L 2. Then L 1 L 2 consists of at most one point. Proof. If a 1 b 2 a 2 b 1 0, then L 1 L 2 consists of the point ( ) b 2 c 1 b 1 c 2, a 1c 2 a 2 c 1. a 1 b 2 a 2 b 1 a 1 b 2 a 2 b 1 If a 1 b 2 a 2 b 1 = 0, then L 1 L 2 =.

4 Conics Definition A conic in C 2 is a subset that is given by ax 2 + bxy + cy 2 + dx + ey + f = 0, where a, b, c, d, e, f are complex numbers and (a, b, c) (0, 0, 0). The conic is said to be irreducible if the polynomial ax 2 + bxy + cy 2 + dx + ey + f is irreducible. Otherwise the conic is called reducible. If ax 2 + bxy + cy 2 + dx + ey + f is reducible, then ax 2 + bxy + cy 2 + dx + ey + f = (αx + βy + γ)(α x + β y + γ ) for some complex numbers α, β, γ, α, β, γ. In this case the conic is a union of two lines.

5 Matrix form Let C be a conic in C 2 that is given by ax 2 + bxy + cy 2 + dx + ey + f = 0, where a, b, c, d, e, f are complex numbers and (a, b, c) (0, 0, 0). We can rewrite the equation of the conic C as ( x y ) 1 b d a 2 2 b e 2 c 2 d 2 Denote this 3 3 matrix by M. e 2 f Lemma The conic C is irreducible if and only if det(m) 0. Example The conic xy 1 = 0 is irreducible. x y 1 = 0.

6 Intersection of a line and a conic Let L be a line in C 2. Let C be an irreducible conic in C 2. Lemma The intersection L C consists of at most 2 points. Proof. The line L is given by αx + βy + γ = 0 for some complex numbers α, β, γ such that (α, β) (0, 0). The conic C is given by a polynomial equation ax 2 + bxy + cy 2 + dx + ey + f = 0, where a, b, c, d, e, f are complex numbers and (a, b, c) (0, 0, 0). Then the intersection L C is given by { αx + βy + γ = 0, ax 2 + bxy + cy 2 + dx + ey + f = 0.

7 Five points determine a conic Let P 1, P 2, P 3, P 4, P 5 be distinct points in C 2. Suppose that no 4 points among them are collinear. Theorem There is a unique conic in C 2 that contains P 1, P 2, P 3, P 4, P 5. Proof. Let P 1 = (x 1, y 1 ), P 2 = (x 2, y 2 ), P 3 = (x 3, y 3 ), P 4 = (x 4, y 4 ), P 5 = (x 5, y 5 ). Find complex numbers a, b, c, d, e, f such that ax1 2 + bx 1 y 1 + cy1 2 + dx 1 + ey 1 + f = 0, ax2 2 + bx 2 y 2 + cy2 2 + dx 2 + ey 2 + f = 0, ax3 2 + bx 3 y 3 + cy3 2 + dx 3 + ey 3 + f = 0, ax4 2 + bx 4 y 4 + cy4 2 + dx 4 + ey 4 + f = 0, ax5 2 + bx 5 y 5 + cy5 2 + dx 5 + ey 5 + f = 0. Then the conic containing P 1, P 2, P 3, P 4, P 5 is given by ax 2 + bxy + cy 2 + dx + ey + f = 0.

8 Complex projective plane Let (x, y, z) be a point in C 3 such that (x, y, z) (0, 0, 0). Let [x : y : z] be the subset in C 3 such that ( a, b, c ) [ x : y : z ] a = λx b = λy for some non-zero complex number λ. c = λz Definition The projective plane P 2 C is the set of of all possible [x : y : z]. We refer to the elements of P 2 C as points. We have [1 : 2 : 3] = [7 : 14 : 21] = [2 i : 4 4i : 3 3i]. We have [1 : 2 : 3] [3 : 2 : 1] and [0 : 0 : 1] [0 : 1 : 0]. There is no such point as [0 : 0 : 0].

9 How to live in projective plane? Let U z be the subset in P 2 C consisting of points [x : y : z] with z 0. Lemma The map U z C 2 given by [ ] [ x x : y : z = z : y ] ( x z : 1 z, y ) z is a bijection (one-to-one and onto). Thus, we can identify U z = C 2. Put x = x z and y = y z. Then we can consider x and y as coordinates on U z = C 2. Question What is P 2 C \ U z? The subset in P 2 C consisting of points [x : y : 0]. We can identify C 2 \ U z and P 1 C. This is a line at infinity.

10 Line at infinity

11 Three charts P 2 C consists of 3-tuples [x : y : z] with (x, y, z) (0, 0, 0) such that [x : y : z] = [λx : λy : λz] for every non-zero λ C. Let U x be the complement in P 2 C to the line x = 0. Then U x = C 2 with coordinates ỹ = y x and z = z x. Let U y be the complement in P 2 C to the line y = 0. Then U y = C 2 with coordinates x = x y and ẑ = z y. Let U z be the complement in P 2 C to the line z = 0. Then U z = C 2 with coordinates x = x z and y = y z. Then P 2 C is a union of the charts U x, U y, U z patched together by ỹ = 1 x = y x, z = ẑ x = 1 x x = x y = 1 ỹ, ẑ = 1 y = z ỹ x = 1 z = ẑ x, y = ỹ z = 1 ẑ

12 What is a line? Definition A line in P 2 C is the subset given by Ax + By + Cz = 0 for some (fixed) point [A : B : C] P 2 C. Example Let P = [5 : 0 : 2]. Let Q = [1 : 1 : 1]. Then the line 2x 3y + 5z = 0 contains P and Q. It is the only line in P 2 C Example Let L be the line in P 2 C that is given by that contains P and Q. x + 2y + 3z = 0. Let L be the line given by x y = 0. Then L L = [1 : 1 : 1].

13 Lines and points in projective plane Let P and Q be two points in P 2 C such that P Q. Theorem There is a unique line in P 2 C that contains P and Q. Proof. Let L be a line in P 2 C that is given by Ax + By + Cz = 0. If P = [a : b : c] L and Q = [a : b : c ] L, then { Aa + Bb + Cc = 0, Aa + Bb + Cc = 0. The rank nullity theorem implies that L exists and is unique. Let L and L be two lines in P 2 C such that L L. Theorem The intersection L L consists of one point in P 2 C.

14 Conics Definition A conic in P 2 C is a subset that is given by ax 2 + bxy + cy 2 + dxz + eyz + fz 2 = 0 for a, b, c, d, e, f in C such that (a, b, c, d, e, f) (0, 0, 0, 0, 0, 0). The conic is said to be irreducible if the polynomial ax 2 + bxy + cy 2 + dxz + eyz + fz 2 is irreducible. Otherwise the conic is called reducible. If ax 2 + bxy + cy 2 + dxz + eyz + fz 2 is reducible, then ax 2 + bxy + cy 2 + dxz + eyz + fz 2 = (αx + βy + γz)(α x + β y + γ z) for some complex numbers α, β, γ, α, β, γ. In this case the conic is a union of two lines.

15 Matrix form Let C be a conic in P 2 C. Then C that is given by ax 2 + bxy + cy 2 + dxz + eyz + fz 2 for a, b, c, d, e, f in C such that (a, b, c, d, e, f) (0, 0, 0, 0, 0, 0). Rewrite the equation of the conic C in the matrix form: ( x y ) z b d a 2 2 b e 2 c 2 d 2 Denote this 3 3 matrix by M. e 2 f Lemma The conic C is irreducible if and only if det(m) 0. Example The conic xy z 2 = 0 is irreducible. x y z = 0.

16 Intersection of a line and a conic Let L be a line in P 2 C. Let C be an irreducible conic in P2 C. Lemma The intersection L C consists of 2 points (counted with multiplicities). Proof. The line L is given by αx + βy + γz = 0 for complex numbers α, β, γ such that (α, β, γ) (0, 0, 0). The conic C is given by a polynomial equation ax 2 + bxy + cy 2 + dxz + eyz + fz 2 = 0 for a, b, c, d, e, f in C such that (a, b, c, d, e, f) (0, 0, 0, 0, 0, 0). Then the intersection L C is given by { αx + βy + γz = 0, ax 2 + bxy + cy 2 + dxz + eyz + fz 2 = 0.

17 Five points determine a conic Let P 1, P 2, P 3, P 4, P 5 be distinct points in P 2 C. Suppose that no 4 points among them are collinear. Theorem There is a unique conic in P 2 C that contains P 1, P 2, P 3, P 4, P 5. Proof. Let [x 1 : y 1 : z 1], [x 2 : y 2 : z 2], [x 3 : y 3 : z 3], [x 4 : y 4 : z 4], [x 5 : y 5 : z 6] be our points. Find complex numbers a, b, c, d, e, f such that ax1 2 + bx 1y 1 + cy1 2 + dx 1z 1 + ey 1z 1 + fz1 2 = 0, ax2 2 + bx 2y 2 + cy2 2 + dx 2z 1 + ey 2z 1 + fz1 2 = 0, ax3 2 + bx 3y 3 + cy3 2 + dx 3z 1 + ey 3z 1 + fz1 2 = 0, ax4 2 + bx 4y 4 + cy4 2 + dx 4z 1 + ey 4z 1 + fz1 2 = 0, ax5 2 + bx 5y 5 + cy5 2 + dx 5z 1 + ey 5z 1 + fz1 2 = 0. Then the conic containing P 1, P 2, P 3, P 4, P 5 is given by ax 2 + bxy + cy 2 + dxz + eyz + fz 2 = 0.

18 defines the union of the two curves above. Complex irreducible plane curves Definition An irreducible curve in P 2 C of degree d 1 is a subset given by f (x, y, z) = 0 for an irreducible homogeneous polynomial f (x, y, z) of degree d. Let us give few examples. The equation 2x 2 y 2 + 2z 2 = 0 defines an irreducible conic in P 2 C. The equation zy 2 x(x z)(x + z) = 0 defines an irreducible cubic curve in P 2 C. The equation ( 2x 2 y 2 + 2z 2)( ) zy 2 x(x z)(x + z) = 0

19 Projective transformations Let M be a complex 3 3 matrix a 11 a 12 a 13 a 21 a 22 a 23. a 31 a 32 a 33 Let φ: P 2 C P2 C be the map given by [ x : y : z ] [ a11 x+a 12 y+a 13 z : a 21 x+a 22 y+a 23 z : a 31 x+a 32 y+a 33 z ]. Recall that there is no such point in P 2 C as [0 : 0 : 0]. Question When φ is well-defined? The map φ is well-defined det(m) 0. Definition If det(m) 0, we say that φ a projective transformation.

20 Projective linear group Projective transformations of P 2 C form a group. Let M be a matrix in GL 3 (C). Denote by φ M the corresponding projective transformation. Question When φ M is an identity map? The map φ M is an identity map M is scalar. Recall that M is said to be scalar if λ 0 0 M = 0 λ λ for some complex number λ. Corollary Let G be a subgroup in GL 3 (C) consisting of scalar matrices. The group of projective transformations of P 2 C is isomorphic to PGL 3 (C) = GL 3 (C)/G.

21 Four points in the plane Let P 1, P 2, P 3, P 4 be four points in P 2 C such that no three points among them are collinear. Then there is a projective transformation P 2 C P2 C such that P 1 [1 : 0 : 0], P 2 [0 : 1 : 0], P 3 [0 : 0 : 1], P 4 [1 : 1 : 1]. Let P 1 = [a 11 : a 12 : a 13 ], P 2 = [a 21 : a 22 : a 23 ], P 3 = [a 31 : a 32 : a 33 ]. Let φ be the projective transformation [ x : y : z ] [ a11 x+a 21 y+a 31 z : a 12 x+a 22 y+a 32 z : a 13 x+a 23 y+a 33 x ]. Then φ([1 : 0 : 0]) = P 1, φ([0 : 1 : 0]) = P 2, φ([0 : 0 : 1]) = P 3. Let ψ be the inverse of the map φ. Write ψ(p 4 ) = [α : β : γ]. Let τ be the projective transformation [ x [x : y : z] α : y β : z ] = [ βγx : αγy : αβz ]. γ Then τ ψ is the required projective transformation.

22 Conics and their tangent lines Let L be a line in P 2 C, and let C be an irreducible conic in P2 C. Question When L C = 1? We may assume that [0 : 0 : 1] L C. Then C is given by ax 2 + bxy + cy 2 + dxz + eyz = 0 for some [a : b : c : d : e] P 4 C. We may assume that L is given by x = 0. Then L C = [0 : 0 : 1] [0 : e : c]. Thus, we have L C = 1 e = 0. Let U z be the complement in P 2 C to the line z = 0. Identify U z and C 2 with coordinates x = x z and y = y z. Then U z C is given by ax 2 + bxy + cy 2 + dx + ey = 0. dx + ey = 0 is the tangent line to U z C at (0, 0). dx + ey = 0 is the tangent line to C at [0 : 0 : 1]. Then L C = 1 L is tangent to C at the point L C.

23 Smooth complex plane curves Let C be an irreducible curve in P 2 C of degree d given by f (x, y, z) = 0, where f (x, y, z) is a homogeneous polynomial of degree d. Definition A point [a : b : c] P 2 C is a singular point of the curve C if f (a, b, c) x = f (a, b, c) y = f (a, b, c) z = 0. Denote by Sing(C) the set of singular points of the curve C. Non-singular points of the curve C are called smooth. The curve C is said to be smooth if Sing(C) = Example 1. If f = zx d 1 y d and d 3, then Sing(C) = [0 : 0 : 1]. 2. If f = x d + y d + z d, then Sing(C) =.

24 Tangent lines Let C be an irreducible curve in P 2 C of degree d given by f (x, y, z) = 0, where f (x, y, z) is a homogeneous polynomial of degree d. Let P = [α : β : γ] be a smooth point in C. Then the line f (α, β, γ) x + x f (α, β, γ) y + y f (α, β, γ) z = 0 z is the tangent line to the curve C at the point P. Remark We may assume that P = [0 : 0 : 1]. Then f (x, y, z) = z d 1 h 1 (x, y) + z d 2 h 2 (x, y) + + zh d 1 (x, y) + h d (x, y) = 0, where h i (x, y) is a homogenous polynomial of degree i. Then h 1 (x, y) = 0 is the tangent line to C at the point P.

25 Conics and projective transformation Let C be a conic in P 2 C. Then C is given by ax 2 + bxy + cy 2 + dxz + eyz + fz 2 = 0 for a, b, c, d, e, f in C such that (a, b, c, d, e, f) (0, 0, 0, 0, 0, 0). Theorem There is a projective transformations φ such that φ(c) is given by 1. either xy = z 2 (an irreducible smooth conic), 2. or xy = 0 (a union of two lines in P 2 C ), 3. or x 2 = 0 (a line in P 2 C taken with multiplicity 2). Example Let C be a conic in P 2 C given by (x 3y + z)(x + 7y 5z) = 0. Let φ: P 2 C P2 C be a projective transformations given by [x : y : z] [ x 3y + z : x + 7y 5z : z ]. Then φ(c) is a conic in P 2 C that is given by xy = 0.

26 Irreducible conics Let C be a conic in P 2 C. Then C that is given by b d ( ) a 2 2 x x y z b y = 0. z e 2 c 2 d e 2 2 f for a, b, c, d, e, f in C such that (a, b, c, d, e, f) (0, 0, 0, 0, 0, 0). Denote this 3 3 matrix by M. Lemma The conic C is irreducible if and only if det(m) 0. Proof. Let φ: P 2 C P2 C be a projective transformation given by matrix M. Let N = M 1. Then the conic φ(c) is given by ( ) a x y z N T b b d 2 2 e 2 c 2 d 2 e 2 f N x y z = 0.

27 Classification of irreducible conics Let C be an irreducible conic in P 2 C given by ax 2 + bxy + cy 2 + dxz + eyz + fz 2 = 0 for a, b, c, d, e, f in C such that (a, b, c, d, e, f) (0, 0, 0, 0, 0, 0). 1. Pick a point in C and map it to [0 : 0 : 1]. This kills f. 2. Map the tangent line dx + ey = 0 to x = 0. This kills e. 3. Map the line z = 0 to the line z + αy + βz for appropriate α and β to kill a and b. 4. Scale x, y, and z appropriately to get b = 1 and c = 1. This gives a projective transformation φ: P 2 C P2 C such that xz = y 2 defines the curve φ(c).

28 The conic x 2 + y 2 2xy + xz 3yz + 2z 2 = 0 Let C be the conic in P 2 C that is given by x 2 + y 2 2xy + xz 3yz + 2z 2 = Note that [0 : 1 : 1] C. Let y = y z. Then C is given by x 2 + y 2 yz 2xy xz = To map the tangent line x + y = 0 to the line x = 0, let x = x + y. Then C is given by x 2 + 4y 2 4xy xz = Let z = z + x 4y. Then C is given by 4y 2 xz = 0. Since x = x + y z, y = y z, and z = x 3y + 4z, the matrix gives a projective transformation that maps C to xz = 4y 2.

29 Intersection of two conics Let C and C be two irreducible conics in P 2 C such that C C. Theorem One has 1 C C 4. Proof. We may assume that C is given by xy = z 2. Then C is given by ax 2 + bxy + cy 2 + dxz + eyz + fz 2 = 0 for a, b, c, d, e, f in C such that (a, b, c, d, e, f) (0, 0, 0, 0, 0, 0). Let L be the line y = 0. Then L C C [1 : 0 : 0]. One has L C C = [1 : 0 : 0] a = 0. Let U y = P 2 C \ L. Then U y C C is given by y 1 = x z 2 = az 4 + dz 3 + (b + f)z 2 + ez + c = 0. If a = 0, then L C C = [1 : 0 : 0] and 0 U y C C 3. If a 0, then L C C = and 1 U y C C 4.

30 Intersection of two conics: four points Let C be the irreducible conic 511x xy 131y xz + 981yz 448z 2 = 0. Let C be the irreducible conic 1217x 2 394xy 541y xz yz z 2 = 0. Then C C consists of [4 : 0 : 1], [1 : 3 : 1], [0 : 7 : 1], [2 : 1 : 1].

31 Intersection of two conics: three points Let C be the irreducible conic 511x xy 131y xz + 981yz 448z 2 = 0. Let C be the irreducible conic 42049x xy+23536y xz yz z 2 = 0. Then C C consists of [4 : 0 : 1], 2 [0 : 7 : 1], [2 : 1 : 1].

32 Intersection of two conics: two points (2+2) Let C be the irreducible conic f (x, y, z) = 0, where f (x, y, z) = 511x xy 131y xz + 981yz 448z 2. Let C be the irreducible conic (3031x 853y +5971z)(821x 3779y +2137z) 9700f (x, y, z) = 0. Then C C consists of 2 [0 : 7 : 1] and 2 [2 : 1 : 1].

33 Intersection of two conics: two points (3+1) Let C be the irreducible conic f (x, y, z) = 0, where f (x, y, z) = 511x xy 131y xz + 981yz 448z 2. Let C be the irreducible conic (3031x 853y z)(6x + 2y 14z) 50f (x, y, z) = 0. Then C C consists of 3 [0 : 7 : 1] and [2 : 1 : 1].

34 Intersection of two conics: one point Let C be the irreducible conic f (x, y, z) = 0, where f (x, y, z) = 511x xy 131y xz + 981yz 448z 2. Let C be the irreducible conic (3031x 853y z) f (x, y, z) = 0. Then C C consists of 4 [0 : 7 : 1].

35 Transversal intersection of two conics Let C and C be two irreducible conics in P 2 C. Question When the intersection C C consists of 4 points? Let P be a point in C C. unique line L P 2 C such that P L and L C = 1. unique line L P 2 C such that P L and L C = 1. The lines L and L are tangent lines to C and C at P, respectively. Definition We say that C intersects C transversally at P if L L. The answer to the question above is given by Theorem The following two conditions are equivalent: 1. the intersection C C consists of 4 points, 2. C intersects C transversally at every point of C C.

36 Bezout s theorem Let f (x, y, z) be a homogeneous polynomial of degree d. Let g(x, y, z) be a homogeneous polynomial of degree d. Consider the system of equations { f (x, y, z) = 0 g(x, y, z) = 0 ( ) Question How many solutions in P 2 C does ( ) has? Infinite if f (x, y, z) and g(x, y, z) have a common factor. Theorem (Bezout) Suppose that f (x, y, z) and g(x, y, z) have no common factors. Then the number of solutions to ( ) depends only on d and d. Here we should count solutions with multiplicities.

37 Bezout s theorem: baby case Let f (x, y, z) be a homogeneous polynomial of degree d. Let g(x, y, z) be a homogeneous polynomial of degree 1. Suppose that g(x, y, z) does not divide f (x, y, z). We may assume that g(x, y, z) = z. We have to solve the system { z = 0, f (x, y, z) = 0. Theorem (Fundamental Theorem of Algebra) There are linear polynomials h 1 (x, y),..., h d (x, y) such that f (x, y, 0) = d h i (x, y). i=1 This gives d points in P 2 C counted with multiplicities.

38 Bezout s theorem: algebraic version Let f (x, y, z) be a homogeneous polynomial of degree d. Let g(x, y, z) be a homogeneous polynomial of degree d. Suppose that f (x, y, z) and g(x, y, z) do not have common factors. Let C be the subset in P 2 C that is given by f (x, y, z) = 0. Let Z be the subset in P 2 C that is given by g(x, y, z) = 0. For every P C Z, define a positive integer (f, g) P as follows: Assume that P U z = C 2 with coordinates x = x z and y = y z. Let R be a subring in C(x, y) consisting of all fractions a(x, y) b(x, y) with a(x, y) and b(x, y) in C[x, y] such that b(p) 0. Let I be the ideal in R generated by f (x, y, 1) and g(x, y, 1). Let (f, g) P = dim C (R/I) 1. Then Bezout s theorem says that ( ) f, g P = d d. P C Z

39 Intersection multiplicity Let f (x, y, z) be a homogeneous polynomial. Let g(x, y, z) be a homogeneous polynomial. Suppose that f (x, y, z) and g(x, y, z) do not have common factors. Fix P P 2 C such that f (P) = g(p) = 0. Then ( ) f, g P = ( g, f ) 1. P Let h(x, y, z) be a homogeneous polynomial. Suppose that f (x, y, z) and h(x, y, z) do not have common factors. If h(p) = 0, then ( f, gh ) P = ( f, g ) P + ( f, h ) P. If h(p) 0, then ( f, gh ) P = ( f, g ) P.

40 Bezout s theorem: geometric version Let C be an irreducible curve in P 2 C that is given by f (x, y, z) = 0, where f is a homogeneous irreducible polynomial of degree d. Let Z be an irreducible curve in P 2 C that is given by g(x, y, z) = 0, where g is a homogeneous irreducible polynomial of degree d. Theorem (Bezout) Suppose that f (x, y, z) λg(x, y, z) for any λ C. Then 1 C Z P C Z ( C Z ) P = d d where (C Z) P = (f, g ) is the intersection multiplicity. P Corollary C = Z f (x, y, z) = λg(x, y, z) for some λ C.

41 Intersection of two cubics Let C be the irreducible cubic curve in P 2 C given by x x 2 y xy y x 2 z xyz y 2 z xz yz z 3 = 0. Let C be the irreducible cubic curve in P 2 C given by x x 2 y xy y x 2 z xyz y 2 z xz yz z 3 = 0 Then the intersection C C consists of the eight points [2 : 3 : 1], [ 3 : 4 : 1], [4 : 5 : 1], [ 6 : 2 : 1], [5 : 3 : 1], [3 : 2 : 1], [2 : 6 : 11], [4 : 8 : 1] [ and the ninth point : : ]

42 Intersection of three cubics

43 How to find the intersection C C? 1. Let f (x, y) be the polynomial x x 2 y xy y x xy y x y Let g(x, y) be the polynomial x x 2 y xy y x xy y x y Consider f (x, y) and g(x, y) as polynomials in y with coefficients in C[x]. 4. Their resultant R(f, g, y) is the polynomial: x x x x x x x x x Its roots are 2, 3, 4, 5, 6, 4, 3, 2 and

44 Resultant One has f (x, y) = a 3 y 3 + a 2 y 2 + a 1 y + a 0, where a 3 = , a 2 = x , a 1 = x x , a 0 = x x x One has g(x, y) = b 3 y 3 + b 2 y 2 + b 1 y + b 0, where b 3 = , b 2 = x , b 1 = x x , b 0 = x x x The resultant of f (x, y) and g(x, y) (considered as polynomials in y) is R ( f, g, y ) = det a 0 a 1 a 2 a a 0 a 1 a 2 a a 0 a 1 a 2 a 3 b 0 b 1 b 2 b b 0 b 1 b 2 b b 0 b 1 b 2 b 3 = det f (x, y) a 1 a 2 a yf (x, y) a 0 a 1 a 2 a 3 0 y 2 f (x, y) 0 a 0 a 1 a 2 a 3 g(x, y) b 1 b 2 b yg(x, y) b 0 b 1 b 2 b 3 0 y 2 g(x, y) 0 b 0 b 1 b 2 b 3. This shows that R(f, g, y) = A(x, y)f (x, y) + B(x, y)g(x, y) for some polynomials A(x, y) and B(x, y).

45 Intersection multiplicity and transversal intersection Let C be an irreducible curve in P 2 C of degree d. Let Z be an irreducible curve in P 2 C of degree d. Pick P C Z. Definition We say that C intersects the curve Z transversally at P if 1. both curves C and Z are smooth at the point P, 2. and the tangent lines to C and Z are P are different. Then (C Z) P = 1 C intersects Z transversally at P. Corollary The following two conditions are equivalent: 1. C Z = d d, 2. C intersects Z transversally at every point of C Z. Corollary If C Z = d d, then Sing(C) Z = = C Sing(Z).

46 Intersection multiplicity and singular points Let C be an irreducible curve in P 2 C of degree d. Let P = [0 : 0 : 1]. Then C is given by the equation z d h 0 (x, y) + z d 1 h 1 (x, y) + z d 2 h 2 (x, y) + + h d (x, y) = 0, where h i (x, y) is a homogenous polynomial of degree i. Let ( ) } mult P C = min {i h i (x, y) is not a zero polynomial mult P (C) 1 P C. mult P (C) 2 P Sing(C). We say that C has multiplicity mult P (C) at the point P. Let Z be another irreducible curve in P 2 C. Lemma Suppose that C Z and P C Z. Then ( C Z)P mult P ( C ) multp ( Z ).

47 Bezout s theorem: first application Let f (x, y, z) be a homogeneous polynomial of degree d 1. Lemma Suppose that the system f (x, y, z) x = f (x, y, z) y = f (x, y, z) z = 0 has no solutions in P 2 C. Then f (x, y, z) is irreducible. Proof. Suppose that f (x, y, z) is not irreducible. Then f ( x, y, z ) = g(x, y, z)h(x, y, z), where g and h are homogeneous polynomials of positive degrees. There is [a : b : c] P 2 C with g(a, b, c) = h(a, b, c) = 0. Then f (a, b, c) x = g(a, b, c) h(a, b, c) h(a, b, c) + g(a, b, c) = 0. x x

48 Bezout s theorem: second application Let C be an irreducible curve in P 2 C of degree d 2. Theorem Let P and Q be two different points in C. Then mult P ( C ) + multq ( C ) d. Proof. Let L be a line in P 2 C that passes through P and Q. Then d = O L C ( L C ) O ( L C ) P +( L C ) Q mult P( C ) +multq ( C ). Corollary Let P be a point in C. Then mult P (C) < d. Corollary Suppose that d = 3. Then C has at most one singular point.

49 Bezout s theorem: third application Let C be an irreducible curve in P 2 C of degree 4. Lemma The curve C has at most 3 singular points. Proof. Suppose that C has at least 4 singular points. Denote four singular points of C as P 1, P 2, P 3, P 4. Let Q be a point in C that is different from these 4 points. There is a homogeneous polynomial f (x, y, z) of degree 2 such that f (P 1 ) = f (P 2 ) = f (P 3 ) = f (P 4 ) = f (Q) = 0. Let Z the curve in P 2 C that is given by f (x, y, z) = 0. Since C is irreducible, we can apply Bezout s theorem to C and Z: 8 = O C Z ( 4 C Z )O ( C Z + )P ( C Z ) 4 i Q ( ) mult Pi C +1. i=1 i=1

50 Bezout s theorem: fourth application Let φ: P 2 C P2 C be a map given by [ ] [ ] x : y : z f (x, y, z) : g(x, y, z) : h(x, y, z) for some homogeneous polynomials f, g, h of degree d such that f (x, y, z) = g(x, y, z) = h(x, y, z) = 0 does not have solutions in P 2 C. Suppose that φ is bijection. Let [A : B : C] and [A : B : C ] be general points in P 2 C. Let L be a line given by Ax + By + Cz = 0. Let L be a line given by A x + B y + C z = 0. The preimage of L L via φ is 1 point. But it is given by { Af (x, y, z) + Bg(x, y, z) + Ch(x, y, z) = 0, A f (x, y, z) + B g(x, y, z) + C h(x, y, z) = 0. One can show that this system has d 2 solutions. Then d = 1.

Projective spaces and Bézout s theorem

Projective spaces and Bézout s theorem Projective spaces and Bézout s theorem êaû{0 Mijia Lai 5 \ laimijia@sjtu.edu.cn Outline 1. History 2. Projective spaces 3. Conics and cubics 4. Bézout s theorem and the resultant 5. Cayley-Bacharach theorem

More information

LECTURE 13, THURSDAY APRIL 1, 2004

LECTURE 13, THURSDAY APRIL 1, 2004 LECTURE 13, THURSDAY APRIL 1, 2004 FRANZ LEMMERMEYER 1. Parametrizing Curves of Genus 0 As a special case of the theorem that curves of genus 0, in particular those with the maximal number of double points,

More information

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs

More information

ADDITION LAW ON ELLIPTIC CURVES

ADDITION LAW ON ELLIPTIC CURVES ADDITION LAW ON ELLIPTIC CURVES JORDAN HISEL Abstract. This paper will explore projective spaces and elliptic curves. Addition on elliptic curves is rather unintuitive, but with a rigorous definition,

More information

Numerical Optimization

Numerical Optimization Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y

More information

Lagrange multipliers October 2013

Lagrange multipliers October 2013 Lagrange multipliers 14.8 14 October 2013 Example: Optimization with constraint. Example: Find the extreme values of f (x, y) = x + 2y on the ellipse 3x 2 + 4y 2 = 3. 3/2 1 1 3/2 Example: Optimization

More information

3.3 Optimizing Functions of Several Variables 3.4 Lagrange Multipliers

3.3 Optimizing Functions of Several Variables 3.4 Lagrange Multipliers 3.3 Optimizing Functions of Several Variables 3.4 Lagrange Multipliers Prof. Tesler Math 20C Fall 2018 Prof. Tesler 3.3 3.4 Optimization Math 20C / Fall 2018 1 / 56 Optimizing y = f (x) In Math 20A, we

More information

A Short Introduction to Projective Geometry

A Short Introduction to Projective Geometry A Short Introduction to Projective Geometry Vector Spaces over Finite Fields We are interested only in vector spaces of finite dimension. To avoid a notational difficulty that will become apparent later,

More information

Lagrange multipliers 14.8

Lagrange multipliers 14.8 Lagrange multipliers 14.8 14 October 2013 Example: Optimization with constraint. Example: Find the extreme values of f (x, y) = x + 2y on the ellipse 3x 2 + 4y 2 = 3. 3/2 Maximum? 1 1 Minimum? 3/2 Idea:

More information

On the maximum rank of completions of entry pattern matrices

On the maximum rank of completions of entry pattern matrices Linear Algebra and its Applications 525 (2017) 1 19 Contents lists available at ScienceDirect Linear Algebra and its Applications wwwelseviercom/locate/laa On the maximum rank of completions of entry pattern

More information

Bounded, Closed, and Compact Sets

Bounded, Closed, and Compact Sets Bounded, Closed, and Compact Sets Definition Let D be a subset of R n. Then D is said to be bounded if there is a number M > 0 such that x < M for all x D. D is closed if it contains all the boundary points.

More information

Algebraic Geometry of Segmentation and Tracking

Algebraic Geometry of Segmentation and Tracking Ma191b Winter 2017 Geometry of Neuroscience Geometry of lines in 3-space and Segmentation and Tracking This lecture is based on the papers: Reference: Marco Pellegrini, Ray shooting and lines in space.

More information

= w. w u. u ; u + w. x x. z z. y y. v + w. . Remark. The formula stated above is very important in the theory of. surface integral.

= w. w u. u ; u + w. x x. z z. y y. v + w. . Remark. The formula stated above is very important in the theory of. surface integral. 1 Chain rules 2 Directional derivative 3 Gradient Vector Field 4 Most Rapid Increase 5 Implicit Function Theorem, Implicit Differentiation 6 Lagrange Multiplier 7 Second Derivative Test Theorem Suppose

More information

Duality of Plane Curves

Duality of Plane Curves Duality of Plane Curves Maria Monks December 1, 2011 Abstract The dual of an algebraic curve C in RP 2 defined by the polynomial equation f(x, y, z) = ( f x ) f f 0 is the locus of points (a, b, c) : (a,

More information

Hw 4 Due Feb 22. D(fg) x y z (

Hw 4 Due Feb 22. D(fg) x y z ( Hw 4 Due Feb 22 2.2 Exercise 7,8,10,12,15,18,28,35,36,46 2.3 Exercise 3,11,39,40,47(b) 2.4 Exercise 6,7 Use both the direct method and product rule to calculate where f(x, y, z) = 3x, g(x, y, z) = ( 1

More information

Topology of Plane Algebraic Curves. Enrique Acosta Jaramillo

Topology of Plane Algebraic Curves. Enrique Acosta Jaramillo Topology of Plane Algebraic Curves Enrique Acosta Jaramillo May 11, 2008 Contents 1 The Real Projective Plane RP 2 2 1.1 Real Manifold Structure..................... 4 2 Topology of Curves over the Complex

More information

. 1. Chain rules. Directional derivative. Gradient Vector Field. Most Rapid Increase. Implicit Function Theorem, Implicit Differentiation

. 1. Chain rules. Directional derivative. Gradient Vector Field. Most Rapid Increase. Implicit Function Theorem, Implicit Differentiation 1 Chain rules 2 Directional derivative 3 Gradient Vector Field 4 Most Rapid Increase 5 Implicit Function Theorem, Implicit Differentiation 6 Lagrange Multiplier 7 Second Derivative Test Theorem Suppose

More information

Chapter 15: Functions of Several Variables

Chapter 15: Functions of Several Variables Chapter 15: Functions of Several Variables Section 15.1 Elementary Examples a. Notation: Two Variables b. Example c. Notation: Three Variables d. Functions of Several Variables e. Examples from the Sciences

More information

Lecture 6: Chain rule, Mean Value Theorem, Tangent Plane

Lecture 6: Chain rule, Mean Value Theorem, Tangent Plane Lecture 6: Chain rule, Mean Value Theorem, Tangent Plane Rafikul Alam Department of Mathematics IIT Guwahati Chain rule Theorem-A: Let x : R R n be differentiable at t 0 and f : R n R be differentiable

More information

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS

Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following

More information

1. Suppose that the equation F (x, y, z) = 0 implicitly defines each of the three variables x, y, and z as functions of the other two:

1. Suppose that the equation F (x, y, z) = 0 implicitly defines each of the three variables x, y, and z as functions of the other two: Final Solutions. Suppose that the equation F (x, y, z) implicitly defines each of the three variables x, y, and z as functions of the other two: z f(x, y), y g(x, z), x h(y, z). If F is differentiable

More information

Projective geometry for Computer Vision

Projective geometry for Computer Vision Department of Computer Science and Engineering IIT Delhi NIT, Rourkela March 27, 2010 Overview Pin-hole camera Why projective geometry? Reconstruction Computer vision geometry: main problems Correspondence

More information

CS-9645 Introduction to Computer Vision Techniques Winter 2019

CS-9645 Introduction to Computer Vision Techniques Winter 2019 Table of Contents Projective Geometry... 1 Definitions...1 Axioms of Projective Geometry... Ideal Points...3 Geometric Interpretation... 3 Fundamental Transformations of Projective Geometry... 4 The D

More information

(c) 0 (d) (a) 27 (b) (e) x 2 3x2

(c) 0 (d) (a) 27 (b) (e) x 2 3x2 1. Sarah the architect is designing a modern building. The base of the building is the region in the xy-plane bounded by x =, y =, and y = 3 x. The building itself has a height bounded between z = and

More information

Multiple View Geometry in Computer Vision

Multiple View Geometry in Computer Vision Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Projective 3D Geometry (Back to Chapter 2) Lecture 6 2 Singular Value Decomposition Given a

More information

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :

More information

EM225 Projective Geometry Part 2

EM225 Projective Geometry Part 2 EM225 Projective Geometry Part 2 eview In projective geometry, we regard figures as being the same if they can be made to appear the same as in the diagram below. In projective geometry: a projective point

More information

Math 233. Lagrange Multipliers Basics

Math 233. Lagrange Multipliers Basics Math 233. Lagrange Multipliers Basics Optimization problems of the form to optimize a function f(x, y, z) over a constraint g(x, y, z) = k can often be conveniently solved using the method of Lagrange

More information

Locally convex topological vector spaces

Locally convex topological vector spaces Chapter 4 Locally convex topological vector spaces 4.1 Definition by neighbourhoods Let us start this section by briefly recalling some basic properties of convex subsets of a vector space over K (where

More information

Introduction to optimization

Introduction to optimization Introduction to optimization G. Ferrari Trecate Dipartimento di Ingegneria Industriale e dell Informazione Università degli Studi di Pavia Industrial Automation Ferrari Trecate (DIS) Optimization Industrial

More information

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini

DM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions

More information

Definition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.

Definition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class. Resolvable BIBDs Definition Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class. A partition of B into parallel classes (there must be r of them) is

More information

Elliptic Curves and Torus Knots

Elliptic Curves and Torus Knots Elliptic Curves and Torus Knots Arielle Leitner May 0, 009 Abstract In this paper, we present an overview of elliptic curves. We give an outline of the proof that an elliptic curve is isomorphic to a torus,

More information

Gradient and Directional Derivatives

Gradient and Directional Derivatives Gradient and Directional Derivatives MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Fall 2011 Background Given z = f (x, y) we understand that f : gives the rate of change of z in

More information

Conic Duality. yyye

Conic Duality.  yyye Conic Linear Optimization and Appl. MS&E314 Lecture Note #02 1 Conic Duality Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/

More information

Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives

Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives In general, if f is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant. By the definition of a derivative, we have Then we are really

More information

arxiv: v1 [math.gr] 19 Dec 2018

arxiv: v1 [math.gr] 19 Dec 2018 GROWTH SERIES OF CAT(0) CUBICAL COMPLEXES arxiv:1812.07755v1 [math.gr] 19 Dec 2018 BORIS OKUN AND RICHARD SCOTT Abstract. Let X be a CAT(0) cubical complex. The growth series of X at x is G x (t) = y V

More information

From String Theory to Elliptic Curves over Finite Field, F p

From String Theory to Elliptic Curves over Finite Field, F p From String Theory to Elliptic Curves over Finite Field, F p A Senior Project submitted to The Division of Science, Mathematics, and Computing of Bard College by Linh Thi Dieu Pham Annandale-on-Hudson,

More information

(1) Tangent Lines on Surfaces, (2) Partial Derivatives, (3) Notation and Higher Order Derivatives.

(1) Tangent Lines on Surfaces, (2) Partial Derivatives, (3) Notation and Higher Order Derivatives. Section 11.3 Partial Derivatives (1) Tangent Lines on Surfaces, (2) Partial Derivatives, (3) Notation and Higher Order Derivatives. MATH 127 (Section 11.3) Partial Derivatives The University of Kansas

More information

Precomposing Equations

Precomposing Equations Precomposing Equations Let s precompose the function f(x) = x 3 2x + 9 with the function g(x) = 4 x. (Precompose f with g means that we ll look at f g. We would call g f postcomposing f with g.) f g(x)

More information

4. Definition: topological space, open set, topology, trivial topology, discrete topology.

4. Definition: topological space, open set, topology, trivial topology, discrete topology. Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.

More information

CHAPTER 5 SYSTEMS OF EQUATIONS. x y

CHAPTER 5 SYSTEMS OF EQUATIONS. x y page 1 of Section 5.1 CHAPTER 5 SYSTEMS OF EQUATIONS SECTION 5.1 GAUSSIAN ELIMINATION matrix form of a system of equations The system 2x + 3y + 4z 1 5x + y + 7z 2 can be written as Ax where b 2 3 4 A [

More information

Multiple View Geometry in Computer Vision

Multiple View Geometry in Computer Vision Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Structure Computation Lecture 18 March 22, 2005 2 3D Reconstruction The goal of 3D reconstruction

More information

Elliptic Curve Cryptography (ECC) Elliptic Curve Cryptography. Elliptic Curves. Elliptic Curve Cryptography (ECC) Elliptic curve

Elliptic Curve Cryptography (ECC) Elliptic Curve Cryptography. Elliptic Curves. Elliptic Curve Cryptography (ECC) Elliptic curve Elliptic Curve Cryptography Gerardo Pelosi Dipartimento di Elettronica, Informazione e Bioingegneria (DEIB) Politecnico di Milano gerardo.pelosi - at - polimi.it ECC was introduced by Victor Miller and

More information

Three-Dimensional Coordinate Systems

Three-Dimensional Coordinate Systems Jim Lambers MAT 169 Fall Semester 2009-10 Lecture 17 Notes These notes correspond to Section 10.1 in the text. Three-Dimensional Coordinate Systems Over the course of the next several lectures, we will

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

8(x 2) + 21(y 1) + 6(z 3) = 0 8x + 21y + 6z = 55.

8(x 2) + 21(y 1) + 6(z 3) = 0 8x + 21y + 6z = 55. MATH 24 -Review for Final Exam. Let f(x, y, z) x 2 yz + y 3 z x 2 + z, and a (2,, 3). Note: f (2xyz 2x, x 2 z + 3y 2 z, x 2 y + y 3 + ) f(a) (8, 2, 6) (a) Find all stationary points (if any) of f. et f.

More information

Triple lines on curves

Triple lines on curves Triple lines on curves Frank de Zeeuw EPFL (Switzerland) IPAM: Algebraic Techniques for Combinatorial Geometry - LA - May 13, 2014 Japanese-Swiss Workshop on Combinatorics - Tokyo - June 5, 2014 I will

More information

. Tutorial Class V 3-10/10/2012 First Order Partial Derivatives;...

. Tutorial Class V 3-10/10/2012 First Order Partial Derivatives;... Tutorial Class V 3-10/10/2012 1 First Order Partial Derivatives; Tutorial Class V 3-10/10/2012 1 First Order Partial Derivatives; 2 Application of Gradient; Tutorial Class V 3-10/10/2012 1 First Order

More information

Generation of lattices of points for bivariate interpolation

Generation of lattices of points for bivariate interpolation Generation of lattices of points for bivariate interpolation J. M. Carnicer and M. Gasca Departamento de Matemática Aplicada. University of Zaragoza, Spain Abstract. Principal lattices in the plane are

More information

CSE 252B: Computer Vision II

CSE 252B: Computer Vision II CSE 252B: Computer Vision II Lecturer: Serge Belongie Scribe: Sameer Agarwal LECTURE 1 Image Formation 1.1. The geometry of image formation We begin by considering the process of image formation when a

More information

Homogeneous coordinates, lines, screws and twists

Homogeneous coordinates, lines, screws and twists Homogeneous coordinates, lines, screws and twists In lecture 1 of module 2, a brief mention was made of homogeneous coordinates, lines in R 3, screws and twists to describe the general motion of a rigid

More information

HOMEWORK ASSIGNMENT #4, MATH 253

HOMEWORK ASSIGNMENT #4, MATH 253 HOMEWORK ASSIGNMENT #4, MATH 253. Prove that the following differential equations are satisfied by the given functions: (a) 2 u 2 + 2 u y 2 + 2 u z 2 =0,whereu =(x2 + y 2 + z 2 ) /2. (b) x w + y w y +

More information

Lecture 8: Jointly distributed random variables

Lecture 8: Jointly distributed random variables Lecture : Jointly distributed random variables Random Vectors and Joint Probability Distributions Definition: Random Vector. An n-dimensional random vector, denoted as Z = (Z, Z,, Z n ), is a function

More information

In class 75min: 2:55-4:10 Thu 9/30.

In class 75min: 2:55-4:10 Thu 9/30. MATH 4530 Topology. In class 75min: 2:55-4:10 Thu 9/30. Prelim I Solutions Problem 1: Consider the following topological spaces: (1) Z as a subspace of R with the finite complement topology (2) [0, π]

More information

Summer 2017 MATH Suggested Solution to Exercise Find the tangent hyperplane passing the given point P on each of the graphs: (a)

Summer 2017 MATH Suggested Solution to Exercise Find the tangent hyperplane passing the given point P on each of the graphs: (a) Smmer 2017 MATH2010 1 Sggested Soltion to Exercise 6 1 Find the tangent hyperplane passing the given point P on each of the graphs: (a) z = x 2 y 2 ; y = z log x z P (2, 3, 5), P (1, 1, 1), (c) w = sin(x

More information

An Introduction to Parametrizing Rational Curves. Victoria Y.H. Wood

An Introduction to Parametrizing Rational Curves. Victoria Y.H. Wood An Introduction to Parametrizing Rational Curves Victoria Y.H. Wood December 1, 2011 1. Introduction To begin, the reader may wish to know what a rational curve is. Definition 1. A rational curve is an

More information

21-256: Lagrange multipliers

21-256: Lagrange multipliers 21-256: Lagrange multipliers Clive Newstead, Thursday 12th June 2014 Lagrange multipliers give us a means of optimizing multivariate functions subject to a number of constraints on their variables. Problems

More information

Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections

Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections Near-Optimal Parameterization of the Intersection of Quadrics: III. Parameterizing Singular Intersections Laurent Dupont, Daniel Lazard, Sylvain Lazard, Sylvain Petitjean To cite this version: Laurent

More information

Summer School: Mathematical Methods in Robotics

Summer School: Mathematical Methods in Robotics Summer School: Mathematical Methods in Robotics Part IV: Projective Geometry Harald Löwe TU Braunschweig, Institute Computational Mathematics 2009/07/16 Löwe (TU Braunschweig) Math. robotics 2009/07/16

More information

521493S Computer Graphics Exercise 2 Solution (Chapters 4-5)

521493S Computer Graphics Exercise 2 Solution (Chapters 4-5) 5493S Computer Graphics Exercise Solution (Chapters 4-5). Given two nonparallel, three-dimensional vectors u and v, how can we form an orthogonal coordinate system in which u is one of the basis vectors?

More information

Lecture 2 - Introduction to Polytopes

Lecture 2 - Introduction to Polytopes Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.

More information

Elliptic Curve Cryptography (ECC) Elliptic Curve Cryptography. Elliptic Curves. Elliptic Curve Cryptography (ECC) Elliptic curve

Elliptic Curve Cryptography (ECC) Elliptic Curve Cryptography. Elliptic Curves. Elliptic Curve Cryptography (ECC) Elliptic curve Elliptic Curve Cryptography Gerardo Pelosi Dipartimento di Elettronica, Informazione e Bioingegneria (DEIB) Politecnico di Milano gerardo.pelosi - at - polimi.it ECC was introduced by Victor Miller and

More information

Grad operator, triple and line integrals. Notice: this material must not be used as a substitute for attending the lectures

Grad operator, triple and line integrals. Notice: this material must not be used as a substitute for attending the lectures Grad operator, triple and line integrals Notice: this material must not be used as a substitute for attending the lectures 1 .1 The grad operator Let f(x 1, x,..., x n ) be a function of the n variables

More information

Solution 2. ((3)(1) (2)(1), (4 3), (4)(2) (3)(3)) = (1, 1, 1) D u (f) = (6x + 2yz, 2y + 2xz, 2xy) (0,1,1) = = 4 14

Solution 2. ((3)(1) (2)(1), (4 3), (4)(2) (3)(3)) = (1, 1, 1) D u (f) = (6x + 2yz, 2y + 2xz, 2xy) (0,1,1) = = 4 14 Vector and Multivariable Calculus L Marizza A Bailey Practice Trimester Final Exam Name: Problem 1. To prepare for true/false and multiple choice: Compute the following (a) (4, 3) ( 3, 2) Solution 1. (4)(

More information

Matrices and Systems of Linear Equations

Matrices and Systems of Linear Equations Chapter The variable x has now been eliminated from the first and third equations. Next, we eliminate x3 from the first and second equations and leave x3, with coefficient, in the third equation: System:

More information

Definition 3.1 The partial derivatives of a function f(x, y) defined on an open domain containing (x, y) are denoted by f

Definition 3.1 The partial derivatives of a function f(x, y) defined on an open domain containing (x, y) are denoted by f Chapter 3 Draft October 3, 009 3. Partial Derivatives Overview: Partial derivatives are defined by differentiation in one variable, viewing all others as constant (frozen at some value). The reduction

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

Honors Advanced Math More on Determinants, Transformations and Systems 14 May 2013

Honors Advanced Math More on Determinants, Transformations and Systems 14 May 2013 Honors Advanced Math Name: More on Determinants, Transformations and Sstems 14 Ma 013 Directions: The following problems are designed to help develop connections between determinants, sstems of equations

More information

Algebraic Curves in Structure From Motion

Algebraic Curves in Structure From Motion Algebraic Curves in Structure From Motion Jeremy Yirmeyahu Kaminski and Mina Teicher Bar-Ilan University, Department of Mathematics and Statistics, Ramat-Gan, Israel. E-mail: {kaminsj,teicher}@macs.biu.ac.il

More information

Generalizing the Converse to Pascal s Theorem via Hyperplane Arrangements and the Cayley-Bacharach Theorem

Generalizing the Converse to Pascal s Theorem via Hyperplane Arrangements and the Cayley-Bacharach Theorem arxiv:1108.3368v1 [math.ag] 16 Aug 2011 Generalizing the Converse to Pascal s Theorem via Hyperplane Arrangements and the Cayley-Bacharach Theorem Will Traves August 18, 2011 Abstract Using a new point

More information

Lecture 2. Topology of Sets in R n. August 27, 2008

Lecture 2. Topology of Sets in R n. August 27, 2008 Lecture 2 Topology of Sets in R n August 27, 2008 Outline Vectors, Matrices, Norms, Convergence Open and Closed Sets Special Sets: Subspace, Affine Set, Cone, Convex Set Special Convex Sets: Hyperplane,

More information

Groups and Graphs Lecture I: Cayley graphs

Groups and Graphs Lecture I: Cayley graphs Groups and Graphs Lecture I: Cayley graphs Vietri, 6-10 giugno 2016 Groups and Graphs Lecture I: Cayley graphs Vietri, 6-10 giugno 2016 1 / 17 graphs A GRAPH is a pair Γ = (V, E) where V - set of vertices

More information

Some Highlights along a Path to Elliptic Curves

Some Highlights along a Path to Elliptic Curves Some Highlights along a Path to Elliptic Curves Part 6: Rational Points on Elliptic Curves Steven J. Wilson, Fall 016 Outline of the Series 1. The World of Algebraic Curves. Conic Sections and Rational

More information

MATH2111 Higher Several Variable Calculus Lagrange Multipliers

MATH2111 Higher Several Variable Calculus Lagrange Multipliers MATH2111 Higher Several Variable Calculus Lagrange Multipliers Dr. Jonathan Kress School of Mathematics and Statistics University of New South Wales Semester 1, 2016 [updated: February 29, 2016] JM Kress

More information

Math 233. Lagrange Multipliers Basics

Math 233. Lagrange Multipliers Basics Math 33. Lagrange Multipliers Basics Optimization problems of the form to optimize a function f(x, y, z) over a constraint g(x, y, z) = k can often be conveniently solved using the method of Lagrange multipliers:

More information

x 6 + λ 2 x 6 = for the curve y = 1 2 x3 gives f(1, 1 2 ) = λ actually has another solution besides λ = 1 2 = However, the equation λ

x 6 + λ 2 x 6 = for the curve y = 1 2 x3 gives f(1, 1 2 ) = λ actually has another solution besides λ = 1 2 = However, the equation λ Math 0 Prelim I Solutions Spring 010 1. Let f(x, y) = x3 y for (x, y) (0, 0). x 6 + y (4 pts) (a) Show that the cubic curves y = x 3 are level curves of the function f. Solution. Substituting y = x 3 in

More information

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.

MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the

More information

Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected

Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected graph G with at least 2 vertices contains at least 2

More information

MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS

MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS MAT203 covers essentially the same material as MAT201, but is more in depth and theoretical. Exam problems are often more sophisticated in scope and difficulty

More information

Math 21a Tangent Lines and Planes Fall, What do we know about the gradient f? Tangent Lines to Curves in the Plane.

Math 21a Tangent Lines and Planes Fall, What do we know about the gradient f? Tangent Lines to Curves in the Plane. Math 21a Tangent Lines and Planes Fall, 2016 What do we know about the gradient f? Tangent Lines to Curves in the Plane. 1. For each of the following curves, find the tangent line to the curve at the point

More information

Lecture 11 COVERING SPACES

Lecture 11 COVERING SPACES Lecture 11 COVERING SPACES A covering space (or covering) is not a space, but a mapping of spaces (usually manifolds) which, locally, is a homeomorphism, but globally may be quite complicated. The simplest

More information

Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

More information

Updated: March 31, 2016 Calculus III Section Math 232. Calculus III. Brian Veitch Fall 2015 Northern Illinois University

Updated: March 31, 2016 Calculus III Section Math 232. Calculus III. Brian Veitch Fall 2015 Northern Illinois University Updated: March 3, 26 Calculus III Section 5.6 Math 232 Calculus III Brian Veitch Fall 25 Northern Illinois University 5.6 Triple Integrals In order to build up to a triple integral let s start back at

More information

SECONDARY DRAFT SYLLABUS. 2. Representation of functions. 3. Types of functions. 4. Composition of functions (two and three)

SECONDARY DRAFT SYLLABUS. 2. Representation of functions. 3. Types of functions. 4. Composition of functions (two and three) et et et CLASS IX Topic :Set Language et et 1. Describing and representing sets SECONDARY DRAFT SYLLABUS Able to describe a set in Descriptive, Set- builder and roster forms and through Venn diagram. Use

More information

PERIODS OF ALGEBRAIC VARIETIES

PERIODS OF ALGEBRAIC VARIETIES PERIODS OF ALGEBRAIC VARIETIES OLIVIER DEBARRE Abstract. The periods of a compact complex algebraic manifold X are the integrals of its holomorphic 1-forms over paths. These integrals are in general not

More information

Subset Groupoids. W. B. Vasantha Kandasamy Florentin Smarandache

Subset Groupoids. W. B. Vasantha Kandasamy Florentin Smarandache Subset Groupoids W. B. Vasantha Kandasamy Florentin Smarandache Educational Publisher Inc. Ohio 2013 This book can be ordered from: Education Publisher Inc. 1313 Chesapeake Ave. Columbus, Ohio 43212, USA

More information

Inverse and Implicit functions

Inverse and Implicit functions CHAPTER 3 Inverse and Implicit functions. Inverse Functions and Coordinate Changes Let U R d be a domain. Theorem. (Inverse function theorem). If ϕ : U R d is differentiable at a and Dϕ a is invertible,

More information

Orientation of manifolds - definition*

Orientation of manifolds - definition* Bulletin of the Manifold Atlas - definition (2013) Orientation of manifolds - definition* MATTHIAS KRECK 1. Zero dimensional manifolds For zero dimensional manifolds an orientation is a map from the manifold

More information

Lecture 0: Reivew of some basic material

Lecture 0: Reivew of some basic material Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms

More information

Part 0. The Background: Projective Geometry, Transformations and Estimation

Part 0. The Background: Projective Geometry, Transformations and Estimation Part 0 The Background: Projective Geometry, Transformations and Estimation La reproduction interdite (The Forbidden Reproduction), 1937, René Magritte. Courtesy of Museum Boijmans van Beuningen, Rotterdam.

More information

Analytical Solid Geometry

Analytical Solid Geometry Analytical Solid Geometry Distance formula(without proof) Division Formula Direction cosines Direction ratios Planes Straight lines Books Higher Engineering Mathematics By B S Grewal Higher Engineering

More information

Lagrange Multipliers

Lagrange Multipliers Lagrange Multipliers Christopher Croke University of Pennsylvania Math 115 How to deal with constrained optimization. How to deal with constrained optimization. Let s revisit the problem of finding the

More information

C / 35. C18 Computer Vision. David Murray. dwm/courses/4cv.

C / 35. C18 Computer Vision. David Murray.   dwm/courses/4cv. C18 2015 1 / 35 C18 Computer Vision David Murray david.murray@eng.ox.ac.uk www.robots.ox.ac.uk/ dwm/courses/4cv Michaelmas 2015 C18 2015 2 / 35 Computer Vision: This time... 1. Introduction; imaging geometry;

More information

f (Pijk ) V. may form the Riemann sum: . Definition. The triple integral of f over the rectangular box B is defined to f (x, y, z) dv = lim

f (Pijk ) V. may form the Riemann sum: . Definition. The triple integral of f over the rectangular box B is defined to f (x, y, z) dv = lim Chapter 14 Multiple Integrals..1 Double Integrals, Iterated Integrals, Cross-sections.2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals.3

More information

Jorg s Graphics Lecture Notes Coordinate Spaces 1

Jorg s Graphics Lecture Notes Coordinate Spaces 1 Jorg s Graphics Lecture Notes Coordinate Spaces Coordinate Spaces Computer Graphics: Objects are rendered in the Euclidean Plane. However, the computational space is better viewed as one of Affine Space

More information

Bernstein-Bezier Splines on the Unit Sphere. Victoria Baramidze. Department of Mathematics. Western Illinois University

Bernstein-Bezier Splines on the Unit Sphere. Victoria Baramidze. Department of Mathematics. Western Illinois University Bernstein-Bezier Splines on the Unit Sphere Victoria Baramidze Department of Mathematics Western Illinois University ABSTRACT I will introduce scattered data fitting problems on the sphere and discuss

More information

Algebra II: Review Exercises

Algebra II: Review Exercises : Review Exercises These notes reflect material from our text, A First Course in Abstract Algebra, Seventh Edition, by John B. Fraleigh, published by Addison-Wesley, 2003. Chapter 7. Advanced Group Theory

More information

MTAEA Convexity and Quasiconvexity

MTAEA Convexity and Quasiconvexity School of Economics, Australian National University February 19, 2010 Convex Combinations and Convex Sets. Definition. Given any finite collection of points x 1,..., x m R n, a point z R n is said to be

More information

Institutionen för matematik, KTH.

Institutionen för matematik, KTH. Institutionen för matematik, KTH. Chapter 10 projective toric varieties and polytopes: definitions 10.1 Introduction Tori varieties are algebraic varieties related to the study of sparse polynomials.

More information