A very simple proof of Pascal s hexagon theorem and some applications
|
|
- Gervais Fox
- 6 years ago
- Views:
Transcription
1 Proc. Indian Acad. Sci. (Math. Sci.) Vol. 120, No. 5, November 2010, pp Indian Academy of Sciences A very simple proof of Pascal s hexagon theorem and some applications NEDELJKO STEFANOVIĆ and MILOŠ MILOŠEVIĆ Group for Intelligent Systems, Faculty of Mathematics, University of Belgrade, Studentski trg 16, Beograd, Serbia Serbian Academy of Sciences and Arts, Mathematical Institute, Kneza Mihaila 36, Beograd, Serbia stenedjo@gmail.com; mionamil@eunet.rs MS received 3 February 2010; revised 28 August 2010 Abstract. In this article we present a simple and elegant algebraic proof of Pascal s hexagon theorem which requires only knowledge of basics on conic sections without theory of projective transformations. Also, we provide an efficient algorithm for finding an equation of the conic containing five given points and a criterion for verification whether a set of points is a subset of the conic. Keywords. Pascal s hexagon theorem; conic sections; algebraic curves. 1. Introduction In this article we present a simple and elegant algebraic proof of Pascal s hexagon theorem which requires only the knowledge of the basics on conic sections without using any results from the theory of projective transformations. The idea of the proof is very simple and natural. These are the main advances compared to the proof given in [4]. Also, Pascal s theorem is a corollary of Bezout s theorem for algebraic curves (see [3]). Bezout s theorem is a somewhat deeper result (see [1 3]), while our approach is comprehensible to anyone knowing the foundations of linear algebra and its applications on conic sections. In order to make this paper self-contained as much as possible, in the next two subsections we prove a theorem about intersections of two conics and introduce the notion of homogenous coordinates. The final subsection contains the proofs of Pascal s theorem and its converse, and we give the number of operations which have to be performed to find coefficients of a conic containing five given points using eq. (2), a criterion for verification whether six points lie on the same conic and illustrate this criterion. The applications announced in the title are based more on the ideas used in our proof of Pascal s theorem, than on the statement of that theorem. 2. Intersections of two conics It is important to emphasize that by the conic we mean both non-degenerate and degenerate cases. We remind the reader that matrix of the conic section given by the equation 619
2 620 Nedeljko Stefanović and Miloš Milošević Ax 2 + Bxy + Cy 2 + Dx + Ey + F = 0 is A B/2 D/2 B/2 C E/2. D/2 E/2 F In order to prove Pascal s hexagon theorem we need the following theorem. Theorem 1. If C 1 and C 2 are different conics and at least one of them is non-degenerate, then they contain at most four common points. In other words, two different conics can contain five common points only if both of them are degenerate. Proof. Let C i be the matrix of the conic C i. First we consider the case when C 1 is a nondegenerate conic and C 2 is degenerate. There exist lines p and q such that C 2 p q. The fact that a line and a non-degenerate conic can have at most two common points implies that C 1 C 2 4. From now on, we assume that C 2 is non-degenerate too. It is important to notice that det(c 1 ), det(c 2 ) 0. In order to prove the theorem it is sufficient to find a degenerate conic section C 3 satisfying the property C 1 C 2 = C 1 C 3. The function f(t)= det((1 t)det(c 2 )C 1 t det(c 1 )C 2 ) fulfills f(1) = det(c 1 ) 3 det(c 2 ) 0 and f(0) = det(c 1 )det(c 2 ) 3 0, and, thus, there exists α (0, 1) such that f(α)= 0. For λ = (1 α)det(c 2 ), μ = α det(c 1 ) and C 3 = λc 1 + μc 2 hold det(c 3 ) = 0 and μ 0. So, C 1 C 2 = C 1 C 3 and C 3 is degenerate, but it differs from the whole plane since C 1 C Homogeneous coordinates Each point of the plane can be represented as an ordered triple of real numbers (x,y,z) (0, 0, 0), called homogeneous coordinates of a point. That triple is uniquely determined up to a multiplicative constant. In that way, the point with Cartesian coordinates (x, y) has got homogeneous coordinates (λx, λy, λ), where λ R\{0}. A triple (x, y, 0) (0, 0, 0) is not attached to any point in a Cartesian plane. However, we extend each line ax + by + c = 0 with a point at infinity (λb, λa, 0) (0, 0, 0), keeping the convention that linearly dependent triples of real numbers represent the same point. In doing so, we add the same point at infinity to parallel lines, and different points at infinity to nonparallel lines. In order to preserve the property that there exists a line containing a given pair of points we consider the set of all points at infinity as a line called the line at infinity. Moreover, we have secured that each pair of different lines has a unique common point. The line ax + by + cz = 0 is described by the triple (a,b,c), while (0, 0,λ) (0, 0, 0) describes the line at infinity. It is obvious that different lines correspond to linearly independent triples, while linearly dependent triples determine the same line, and the lines, just like the points, are described by the triples from R 3 \{(0, 0, 0)}. Besides, the point (x,y,z)is on the line (a,b,c)if and only if ax + by + cz = 0.
3 Proof of Pascal s hexagon theorem 621 If we think of triples representing points and lines as of vectors in the three-dimensional space, then the vectors corresponding to a line and a point lying on that line are orthogonal. Thus, the vector of a line containing two given points can be found as the cross-product of the vectors of these points, and similarly, the vector of the intersecting point of two lines is the cross-product of the vectors of these lines. The points A, B, C are collinear if and only if the mixed triple product of the corresponding vectors is equal to 0. Also, it is possible to describe the projective plane P 2 as P 2 = A 2 P 1, where A 2 is the affine plane and P 1 is the line at infinity, i.e. the set of directions of lines. When we say the origin of the coordinate system, then we think of the origin of A 2. DEFINITION 1 A set S of points in the projective plane is general if it does not contain three collinear points. 4. Pascal s hexagon theorem, its converse and some applications Now, everything is prepared for the proof of Pascal s theorem. Theorem 2 (Pascal s hexagon theorem). Let A 1,A 2,A 3,A 4,A 5,A 6 be different points on a non-degenerative conic C. Then the points are collinear. P = A 1 A 2 A 4 A 5, Q = A 2 A 3 A 5 A 6 and R = A 3 A 4 A 6 A 1 Proof. It is sufficient to prove that the vectors u = (A 1 A 2 ) (A 4 A 5 ), v = (A 2 A 3 ) (A 5 A 6 ), w = (A 3 A 4 ) (A 6 A 1 ) are linearly dependent. Bearing in mind that (a b) (c d) = [a,c,d]b [b, c, d] a = [a,b,d]c [a,b,c]d we obtain u = [A 1,A 4,A 5 ]A 2 [A 2,A 4,A 5 ]A 1, w = [A 3,A 6,A 1 ]A 4 [A 4,A 6,A 1 ]A 3, v = [A 2,A 3,A 6 ]A 5 [A 2,A 3,A 5 ]A 6. Computing [u, v, w] and observing that six of the eight terms cancel out, we find that the condition [u, v, w] = 0 is equivalent to the equality [A 1,A 3,A 5 ][A 2,A 4,A 5 ][A 4,A 6,A 1 ][A 6,A 2,A 3 ] = [A 2,A 4,A 6 ][A 1,A 4,A 5 ][A 3,A 6,A 1 ][A 5,A 2,A 3 ]. (1) In order to prove (1) we replace A 6 with the general point A(x,y,z): [A 1,A 3,A 5 ][A 2,A 4,A 5 ][A 4,A,A 1 ][A, A 2,A 3 ] = [A 2,A 4,A][A 1,A 4,A 5 ][A 3,A,A 1 ][A 5,A 2,A 3 ]. (2) In this way we obtain an equation in x,y,z of at most degree 2, whose solutions include A {A 1,...,A 5 }. So, eq. (2) can be reduced to 0 = 0 or it is an equation of a conic C 1 which contains A 1,...,A 5. The fact that C is a non-degenerate conic implies that C = C 1 and (1) is a consequence of A 6 C.
4 622 Nedeljko Stefanović and Miloš Milošević Notice that the points P, Q, R from the above theorem are uniquely determined. Namely, since a line and a non-degenerate conic do not contain more than two common points, the set {A 1,...,A 6 } is general and the lines A 1 A 2 and A 4 A 5 do not coincide. Similar reasoning can be applied to Q and R. PROPOSITION 1 Let S ={A 1,...,A 5 } be a set of five points in the projective plane. Then there exists a nondegenerate conic containing S if and only if S is a general set. That conic is unique and its equation is given by (2), where A(x,y,z)is a variable point. In order to find coefficients of eq. (2) of that conic one needs to perform no more than 62 multiplications and 32 additions or subtractions. If there is no point at infinity in S and we want to determine the equation of the conic in Cartesian coordinates then the numbers of multiplications and additions are not greater than, respectively,42and 32. Moreover, if a point A 6 / S, then the points A 1,...,A 5,A 6 are on the same conic if and only if the points P, Q, R from Pascal s theorem are collinear. Proof. We consider the following functions: f(x,y,z) = [A 4,A,A 1 ][A, A 2,A 3 ], g(x,y,z) = [A 2,A 4,A][A 3,A,A 1 ], A = A(x, y, z). Obviously, f(x,y,z) = 0 is an equation of the union of lines A 1 A 4 and A 2 A 3, and g(x,y,z) = 0 is an equation of the union of lines A 1 A 3 and A 2 A 4, and thus, the functions f and g can not be linearly dependent. The assumption that there are no three collinear points in S, implies that f(a 5 ), g(a 5 ) 0. Since for λ = [A 1,A 3,A 5 ][A 2,A 4,A 5 ], μ = [A 1,A 4,A 5 ][A 5,A 2,A 3 ] hold λf (A 5 ) = μg(a 5 ) and λ, μ 0, we conclude that (2) is an equation of the nondegenerate conic containing A 1,...,A 5, because this equation is not reduced to 0 = 0, since the functions f and g are linearly independent. From the proof of Pascal s theorem it is clear that the equality (1) is equivalent to the collinearity of P, Q and R. In (2) there are four pairs of mixed triple products of the forms [A i,a j,a] and [A i,a j,a k ], where the second mixed triple product is obtained by replacement of A by A k.[a i,a j,a]isa3 3 determinant containing one row which consists of variables and the result of computation of such determinant is a polynomial. For the computation of a 2 2 determinant whose components are real numbers one has to perform 2 multiplications and one addition (well, in fact subtraction, but we will not point out the difference between addition and subtraction here). So, to determine the coefficients corresponding to x,y and z, 6 multiplications and 3 additions are needed. In order to compute [A i,a j,a k ], we are going to use the already computed minors and we have to perform additional 3 multiplications and 2 additions. Thus, it makes in total 9 multiplications and 5 additions for computing [A i,a j,a] and [A i,a j,a k ], and repeating this procedure for all four pairs requires 36 multiplications and 20 additions. Let us focus for a moment on the left-hand side of (2). One more multiplication must be done to compute [A 1,A 3,A 5 ][A 2,A 4,A 5 ] and multiplication of the polynomial [A 4,A,A 1 ] by the number [A 1,A 3,A 5 ][A 2,A 4,A 5 ] requires 3 multiplications to determine the coefficients corresponding to the variables x,y,z. Multiplication of polynomials [A 1,A 3,A 5 ][A 2,A 4,A 5 ][A 4,A,A 1 ] and [A, A 2,A 3 ]
5 Proof of Pascal s hexagon theorem 623 adds 9 multiplications and 3 additions. Same must be done on the right-hand side of (2) and the subtraction of the right-hand side from the left-hand side requires 6 more additions for finding the coefficients of all monomials. Finally, it makes 62 multiplications and 32 additions. If we are finding coefficients in Cartesian coordinates then we have to notice that the numbers of multiplications and additions needed for computation of both determinants x y 1 a 1 a 2 1 D 1 = b 1 b 2 1 and D 2 = b 1 b 2 1 c 1 c 2 1 c 1 c 2 1 are, respectively, 4 and 5. We obtain these numbers of operations when we expand D 1 along the first row, and again we already use computed minors to obtain D 2. The computation of D 1 requires 2 multiplications and 3 additions, and to compute D 2 one has to perform additional 2 multiplications and 2 additions. There is a simple condition for checking whether six points lie on the same conic section, and in order to prove it, we need some preparatory results. PROPOSITION 2 If C is a non-degenerate conic section, and p 1 (x,y,z) = 0 and p 2 (x,y,z) = 0 are two equations of C, where p 1 and p 2 are polynomials of degree at most 2, then there exists nonzero constant C such that p 1 = C p 2. Proof. Suppose that there is no such constant and denote C by C i seen as the set of solutions of p i (x,y,z) = 0, and denote their matrices by M 1 and M 2. M 1 and M 2 are linearly independent and their determinants are not equal to 0. The proof is analogous to the proof of Theorem 1. The function h(t) = det((1 t)det(m 2 )M 1 t det(m 1 )M 2 ) fulfills h(1) h(0) <0, and, thus, there exists α (0, 1) such that h(α) = 0. For λ = (1 α)det(m 2 ), μ = α det(m 1 ), C 0 = λc 1 + μc 2, and matrix M 0 of C 0 hold det(m 0 ) = 0 and μ 0. If C 0 is the whole plane then C 2 = λ μ C 1. Otherwise, C = C 1 C 2 = C 1 C 0 C. In both cases the initial assumption leads to contradiction. Observe the following homogenous function of degree 2 in variables x,y,z: x1 2 y1 2 z 2 1 y 1 z 1 z 1 x 1 x 1 y 1 x 2 2 y2 2 z 2 2 y 2 z 2 z 2 x 2 x 2 y 2 x3 2 y3 2 z3 2 y 3 z 3 z 3 x 3 x 3 y 3 g(x,y,z) = x4 2 y4 2 z4 2. y 4 z 4 z 4 x 4 x 4 y 4 x 5 2 y5 2 z5 2 y 5 z 5 z 5 x 5 x 5 y 5 x 2 y 2 z 2 yz zx xy
6 624 Nedeljko Stefanović and Miloš Milošević This quite naturally comes to mind if we want to construct a homogenous function of degree 2 having roots A 1 (x 1,y 1,z 1 ),...,A 5 (x 5,y 5,z 5 ). Suppose that {A 1,...,A 5 } is a general set and that the unique conic section through A 1,...,A 5 has the equation c 1 x 2 + c 2 y 2 + c 3 z 2 + c 4 yz + c 5 zx + c 6 xy = 0, where for example c 6 0. Dividing by c 6 and using the fact that (x 1,y 1,z 1 ),...,(x 5,y 5,z 5 ) are roots, one obtains the system of five linear equations in variables d 1,...,d 5 : d 1 x 2 i + d 2 y 2 i + d 3 z 2 i + d 4y i z i + d 5 z i x i = x i y i,i= 1,...,5. The system has nonzero determinant because it has an unique solution by the previous proposition. This determinant is exactly the coefficient which corresponds to the monomial xy in g(x,y,z), and g(x,y,z) is not the zero polynomial. So, we conclude that g(x,y,z) = 0 is an equation of the conic containing A 1,...,A 5. Now, we are going to prove the announced criterion. PROPOSITION 3 The six points A 1,...,A 6 in the projective plane are on the same conic section if and only if (1) holds. Proof. Let the homogenous coordinates of the point A i be (x i,y i,z i ).If{A 1,...,A 6 } is a general set, then it is already proved that these points lie on the same conic if and only if the equality (1) holds. Using MATLAB it is possible to show that the polynomials x1 2 y1 2 z 2 1 y 1 z 1 z 1 x 1 x 1 y 1 x 2 2 y2 2 z 2 2 y 2 z 2 z 2 x 2 x 2 y 2 x g(x 1,y 1,z 1,...,x 6,y 6,z 6 ) = 3 2 y3 2 z 2 3 y 3 z 3 z 3 x 3 x 3 y 3 x 2 4 y4 2 z4 2. y 4 z 4 z 4 x 4 x 4 y 4 x5 2 y5 2 z5 2 y 5 z 5 z 5 x 5 x 5 y 5 x6 2 y6 2 z6 2 y 6 z 6 z 6 x 6 x 6 y 6 and f(x 1,y 1,z 1,...,x 6,y 6,z 6 ) = [A 1,A 3,A 5 ][A 2,A 4,A 5 ][A 4,A 6,A 1 ][A 6,A 2,A 3 ] [A 2,A 4,A 6 ][A 1,A 4,A 5 ][A 3,A 6,A 1 ][A 5,A 2,A 3 ] are equal. Now, we can use the fact that permutation of the rows of a determinant does not change the absolute value of the determinant. If there exist three collinear points in {A 1,...,A 6 }, then without loss of generality we can assume that this triple is (A 1,A 3,A 5 ). The left-hand side of [A 1,A 3,A 5 ][A 2,A 4,A 5 ][A 4,A 6,A 1 ][A 6,A 2,A 3 ] = [A 2,A 4,A 6 ][A 1,A 4,A 5 ][A 3,A 6,A 1 ][A 5,A 2,A 3 ], which is equal to 0. If [A 2,A 4,A 6 ] = 0, then A 2,A 4 and A 6 are collinear, otherwise, there is a point from {A 2,A 4,A 6 } which lies on the line A 1 A 3 A 5. In any of these possible cases the points A 1,...,A 6 lie on two lines.
7 Proof of Pascal s hexagon theorem 625 In the appendix, an interested reader can find another proof for the existence of a nonzero constant C for which holds f = C g, where f and g are functions defined in the previous proposition. That proof does not require any computation. PROPOSITION 4 A set S of more than five points lies on a conic if and only if for each choice of its six elements there exists a conic containing those six points. Proof. We prove the nontrivial implication from right to left. Suppose that there exist five points, say A 1,...,A 5, without three collinear points among them. Each point B S lies on the unique conic determined by A 1,...,A 5. Otherwise, we distinguish the following subcases: there exist five points A 1,...,A 5, such that A 1,A 2,A 3 are collinear, and A 4 and A 5 are not on the line A 1 A 2 A 3 ; then each point B S is contained on the union of lines A 1 A 2 A 3 A 4 A 5 ; there is a line containing all points from S except at most one. Then S is a subset of union of two lines. The final illustration of our method is the proof of Theorem from [1]. Theorem 3. Let A 1,...,A 8 be eight points on a non-degenerate conic in the projective plane. Then the points B 1 = A 1 A 2 A 4 A 5,B 2 = A 2 A 3 A 5 A 6, B 3 = A 3 A 4 A 6 A 7,B 4 = A 4 A 5 A 7 A 8, B 5 = A 5 A 6 A 8 A 1,B 6 = A 6 A 7 A 1 A 2, B 7 = A 7 A 8 A 2 A 3,B 8 = A 8 A 1 A 3 A 4 lie on a conic. Proof. Let {A 1,A 2,A 3,A 4,A 5 } be a general set of five points, C the unique conic determined by A 1,...,A 5, and C 6,C 7,C 8 points such that none of the lines A 1 C 6,A 1 C 7,A 1 C 8 is a tangent line on C at A 1. We determine A 6,A 7 and A 8 as intersection points of, respectively, A 1 C 6,A 1 C 7, and A 1 C 8 with C, different from A 1.Fori = 6, 7, 8 it is possible to express A i using A 1,A 2,A 3,A 4,A 5,C i. Namely, for the hexagon A 1 A 2 A 3 A 4 A 5 A 6 let P,Q and R be points from Pascal s theorem. Then it holds that P = A 1 A 2 A 4 A 5,R= A 3 A 4 A 1 C 6, Q = A 2 A 3 PR, and A 6 = A 5 Q A 1 C 6. Thus, A 6 = (A 5 ((A 2 A 3 ) (((A 1 A 2 ) (A 4 A 5 )) ((A 3 A 4 ) (A 1 C 6 ))))) (A 1 C 6 ). We check whether B m1,b m2,b m3,b m4,b m5,b m6,m s {1,...,8} are on the same conic using equality (1) for each of the possible 28 combinations. The equality (1) is an equality of polynomials in variables a ij,i = 1,...,5,j = 1, 2, 3, and c kl, k = 6, 7, 8,l = 1, 2, 3, where a ij are homogenous coordinates of A i and c kl are homogenous coordinates of C k. Using MATLAB one can convince oneself that the polynomials on the left-hand side and the right-hand side of (1) are equal. Once again, it is important to notice that from the beginning there is no connection between A 1,A 2,A 3,A 4,A 5,C 6,C 7,C 8, and no initial equality conditions, since these points are arbitrary.
8 626 Nedeljko Stefanović and Miloš Milošević In the Appendix we give another proof of the previous theorem which does not require MATLAB or any other computational equipment. Appendix Lemma 1. Let K be a field and p, q K[x 1,...,x n ], where deg xi p, deg xi q d i, for each i = 1,...,n. If there exist sets S 1,...,S n such that S i >d i and p(a) = q(a) for each a S 1 S n, then p = q. Proof. We use induction on the number of variables n.forn = 1, the polynomial p(x 1 ) q(x 1 ) of degree at most d 1 has more than d 1 roots, which implies that this is a zero polynomial. Assume that the statement is true for n = k and prove it for n = k + 1. Polynomial p(x 1,...,x k+1 ) q(x 1,...,x k+1 ) can be written in the form p(x 1,...,x k+1 ) q(x 1,...,x k+1 ) = c k+1 (x 1,...,x k )x d k+1 k+1 + +c 0(x 1,...,x k ), where c i are polynomials in x 1,...,x k. For fixed a = (a 1,...,a k ) S 1 S k degree of the polynomial p(a 1,...,a k,x k+1 ) q(a 1,...,a k,x k+1 ) is at most d k+1. But this polynomial has value 0 for every element of S k+1, so it must be zero polynomial, and consequently c i (a 1,...,a k ) = 0, i= 0,...,k+1. Since c i,i= 0,...,k+1have value zero for arbitrarily chosen a S 1 S k, by the inductive hypothesis we conclude that c i = 0, i= 0,...,k+ 1, implying p = q. COROLLARY 1 Let p, q K[x 1,...,x n ], where K = R or K = C. Polynomials p and q are equal if and only if the interior of the set {(a 1...,a n ) K n : p(a 1,...,a n ) = q(a 1,...,a n )} is nonempty. Lemma 2. Let p, q R[x 1,...,x 18 ]. Assume that p and q have the following properties: (1) p and q are of the degree at most 2 in each variable; (2) for arbitrarily chosen six points A 1 (a 1,a 2,a 3 ),...,A 6 (a 16,a 17,a 18 ) without three collinear points among them the following statements are equivalent: p(a 1,...,a 18 ) = 0, q(a 1,...,a 18 ) = 0, A 1,...,A 6 lie on the same conic section. Then there exists a constant C 0 such that p = C q. Proof. Throughout this proof we emphasize that by the equation of the unique conic containing five given points, where each three of them are non-collinear, we mean eq. (2), and consequently the matrix of the conic and its determinant are unique functions in homogenous coordinates of these five points. Namely, if A is determined by the coordinates
9 Proof of Pascal s hexagon theorem 627 (a,b,c), then in eq. (2) will occur exactly a,b and c, although it holds that (a,b,c) = (ta, tb, tc) for t R\{0}. If we express A as (ta, tb, tc) for some t 0, 1, the equation obtained in that way will be the product of a nonzero constant and (2). Let k be a circle in the projective plane such that the origin of the coordinate system O lies in its interior, and let A 1 (a 1,a 2,a 3 ),...,A 6 (a 16,a 17,a 18 ) be six different points on k satisfying a j 0,j = 1,...,18, and such that tangent lines through A i,i = 1...,6onk do not intersect x-axis and y-axis at points at infinity. The points of the form A(x, a 2,a 3 ), x R lie on the line a 3 y a 2 z = 0, which contains A 1 and has the same point at infinity (1, 0, 0) as the x-axis. It means that this line and the circle k have two different common points. The same holds for the line {(a 1,x,a 3 ) R 3 : x R}. The line OA 1 consists of the points with homogenous coordinates (a 1,a 2, x), x R and intersects k at two points, too. So, if we fix all variables with x j = a j, except x 1, then the equations p(x 1,a 2,...,a 18 ) = 0, q(x 1,a 2,...,a 18 ) = 0, have two solutions each, and, moreover, these sets of solutions are equal. One of these solutions is a 1 and the other we denote as b 1. Thus, there exist nonzero constants C 1 and C 1 such that p(x 1,a 2,...,a 18) = C 1 (x 1 a 1 )(x 1 b 1 ), q(x 1,a 2,...,a 18 ) = C 1 (x 1 a 1 )(x 1 b 1 ), and consequently, for C 1 = C 1 /C 1 it holds that p(x 1,a 2,...,a 18 ) = C 1 q(x 1, a 2,...,a 18 ). It is possible to find ε 1 > 0 such that for all a i a i <ε 1 points A 1 (a 1,a 2,a 3 ),..., A 6 (a 16,a 17,a 18 ) fulfill the following requirements: {A 2,A 3,A 4,A 5,A 6 } is a general set and the unique conic C 1 section it determines is non-degenerate; that can be fulfilled since the coefficients of a conic are continuous functions of coordinates a 4,...,a 18 and the determinant of a conic is a continuous function of its coefficients, so we can secure that the determinant differs from 0; the line {(x, a 2,a 3 ) x R} intersects C 1 at two points with first coordinates α and β; the discriminant of the quadratic equation which determines x-coordinates of the intersection points of the above mentioned line and conic is a continuous function in a 2,...,a 18, and in neighbourhoods of a 2,...,a 18 of sufficiently small radius this discriminant will stay positive; that is why this condition can be satisfied as well. And again there exist nonzero C 1 (a 2,...,a 18 ) and C 1 (a 2,...,a 18 ) for which p(x 1,a 2,...,a 18 ) = C 1 (a 2,...,a 18 )(x 1 α)(x 1 β), q(x 1,a 2,...,a 18 ) = C 1 (a 2,...,a 18 )(x 1 α)(x 1 β), and p(x 1,a 2,...,a 18 ) = C 1(a 2,...,a 18 )q(x 1,a 2,...,a 18 ), for C 1 (a 2,...,a 18 ) = C 1 (a 2,...,a 18 )/C 1 (a 2,...,a 18 ) hold.
10 628 Nedeljko Stefanović and Miloš Milošević Similarly, one can find ε i,i= 2,...,18, such that for all a j a j <ε i,j i the equality p(a 1,...,a i 1,x i,a i+1,...,a 18 ) = C 1 (a 1,...,a i 1,a i+1,...,a 18 )q(a 1,...,a i 1,x i,a i+1,...,a 18 ) is true. We denote ε = min{ε i i = 1,...,18}. There exist a j, j = 1,...,18 such that a j a j < ε and q(a 1,...,a 18 ) 0. Namely, we can set a j = a j for j 1 and for a 1 we can pick any value from (a 1 ε, a 1 + ε)\{a 1,b 1 }. There is δ, such that 0 <δ<ε/2and that for x j a j <δ,j= 1,...,18 holds q(x 1,...,x 18 ) 0. It is proved that for x j a j <δ, j= 1,...,18 the quotient p(x 1,...,x 18 ) q(x 1,...,x 18 ) is not a function of x j, for any j. Thus, this quotient is constant in an 18-dimensional cube, and Proposition 3 follows from Corollary 1. Now, we present the proof of Theorem 3 which is not based on the computational brute force approach. The following lemma is a variant of the previously mentioned theorem with one additional assumption. Lemma 3. Let the points A 1,...,A 8,B 1,...,B 8 satisfy the conditions of Theorem 3 and let {B 1,...,B 8 } be a general set of eight points. Then B 1,...,B 8 lie on a conic. Proof. We remind the reader that B 1 = A 1 A 2 A 4 A 5 and B 6 = A 6 A 7 A 1 A 2. Thus, the points B 1 and B 6 are on the line A 1 A 2, and consequently B 1 B 6 and A 1 A 2 represent the same line, i.e. B 1 B 6 = A 1 A 2. Similarly, we obtain B 2 B 7 = A 2 A 3,B 3 B 8 = A 3 A 4,B 4 B 1 = A 4 A 5,B 5 B 2 = A 5 A 6, B 6 B 3 = A 6 A 7,B 7 B 4 = A 7 A 8,B 8 B 5 = A 8 A 1. The set {A 1,A 2,A 3,A 4,A 5,A 6 } lies on a non-degenerate conic, and thus, by the Pascal s theorem, the points B 1 = A 1 A 2 A 4 A 5,B 2 = A 2 A 3 A 5 A 6,B= A 3 A 4 A 1 A 6 are collinear. So we can conclude that A 3 A 4 B 1 B 2 = B. Using the above observations, we obtain B 3 B 8 B 1 B 2 = B, B 1 B 6 B 8 B 5 = A 1, B 5 B 2 B 6 B 3 = A 6, and, since B A 1 A 6, the set {B 1,B 2,B 5,B 8,B 3,B 6 } lies on the unique non-degenerate conic C determined by points B 1,B 3,B 5,B 6,B 8. For the conclusion the inverse Pascal s theorem (Proposition 1) was used as well by the fact that {B 1,...,B 8 } is a general set. In an analogous way, it can be demonstrated that the set {B 1,B 3,B 4,B 5,B 6,B 8 } lies on C. Similarly, the set {B 2,...,B 8 } lies on some C, and since conics C and C contain at least six common points, we can conclude C = C. Let M 1,...,M 8 be vertices of a regular octagon. A reader can think of M i,i = 1,...,8, as of A i,i = 1,...,8, in a very special position. The corresponding points B M 1,...,BM 8 from Theorem 3 are also vertices of some regular octagon, and thus lie on a circle. Since the coordinates of B 1,...,B 8 are polynomial functions, and thus continuous functions of the coordinates of A 1,...,A 8, there exist neighborhoods O i of M i,i = 1,...,8, such that if
11 Proof of Pascal s hexagon theorem 629 A i O i,i = 1,...,8, then none of the mixed triple products [A i,a j,a k ], [B i,b j,b k ], for different i, j, k, is equal to 0, and consequently {A 1,...,A 8 } and {B 1,...,B 8 } are general sets of eight points. For i = 6, 7, 8, let P i,q i,r i be the points from the Pascal s theorem correlated to M 1,...,M 5,M i, and C i an arbitrary point on the line P i Q i R i which differs from P i,q i and R i. We represent points P i,q i,r i,m i as intersections of lines: P i = M 1 M 2 M 4 M 5,Q i = M 2 M 3 P i C i, R i = M 3 M 4 P i Q i,m i = M 1 R i M 5 Q i, and by doing so we obtain the coordinates of M i as functions of the coordinates of points M 1,...,M 5,C i. We pick some A 1,...,A 5 and C i, and in the same way as above, we define A i in terms of A 1,...,A 5, C i.fora 1,...,A 5, C i from some neighborhoods O i 1,...,Oi 5, O i of, respectively, M 1,...,M 5,C i, the point A i O i and A 1,...,A 5,A i lie on the non-degenerate conic C determined by A 1,...,A 5. We denote O j = O j O 6 j O 7 j O8 j,j = 1,...,5. Further, the coordinates of B 1,...,B 8 can be represented as the polynomial functions of the coordinates of A 1,...,A 5, C 6, C 7, C 8. The set {B 1,...,B 8 } is general, and by Lemma 3 lies on a conic. Proposition 3 implies that [B i1,b i3,b i5 ][B i2,b i4,b i5 ][B i4,b i6,b i1 ][B i6,b i2,b i3 ] = [B i2,b i4,b i6 ][B i1,b i4,b i5 ][B i3,b i6,b i1 ][B i5,b i2,b i3 ] (3) holds for every choice of distinct elements i 1,...,i 6 {1,...,8}, and this equality can be rewritten as the equality of a polynomial in the coordinates of A 1,...,A 5, C 6, C 7, C 8 and the zero polynomial. Cause the equality of the corresponding polynomial functions holds on the set O 1 O 8, one concludes, by Corollary 1, that these polynomials are equal. So, B i1,...,b i6 are on the same conic. Finally, an application of Proposition 4 finishes the proof. References [1] Bix R, Conics and cubics (Springer) (2006) [2] Kunz E, Introduction to plane algebraic curves (Birkhauser) (2005) [3] Silverman J H and Tate J, Rational points on elliptic curves (Springer) (1994) [4] van Yzeren J, A simple proof of Pascal s hexagon theorem, The American Mathematical Monthly 100(10) (1993)
Local properties of plane algebraic curves
Chapter 7 Local properties of plane algebraic curves Throughout this chapter let K be an algebraically closed field of characteristic zero, and as usual let A (K) be embedded into P (K) by identifying
More informationLECTURE 10, MONDAY MARCH 15, 2004
LECTURE 10, MONDAY MARCH 15, 2004 FRANZ LEMMERMEYER 1. Minimal Polynomials Let α and β be algebraic numbers, and let f and g denote their minimal polynomials. Consider the resultant R(X) of the polynomials
More information2.1 Affine and Projective Coordinates
1 Introduction Depending how you look at them, elliptic curves can be deceptively simple. Using one of the easier definitions, we are just looking at points (x,y) that satisfy a cubic equation, something
More informationTopics In Algebra Elementary Algebraic Geometry
Topics In Algebra Elementary Algebraic Geometry David Marker Spring 2003 Contents 1 Algebraically Closed Fields 2 2 Affine Lines and Conics 14 3 Projective Space 23 4 Irreducible Components 40 5 Bézout
More informationProjective Spaces. Chapter The Projective Line
Chapter 3 Projective Spaces 3.1 The Projective Line Suppose you want to describe the lines through the origin O = (0, 0) in the Euclidean plane R 2. The first thing you might think of is to write down
More informationLINEAR SYSTEMS AND MATRICES
CHAPTER 3 LINEAR SYSTEMS AND MATRICES SECTION 3. INTRODUCTION TO LINEAR SYSTEMS This initial section takes account of the fact that some students remember only hazily the method of elimination for and
More informationLECTURE 5, FRIDAY
LECTURE 5, FRIDAY 20.02.04 FRANZ LEMMERMEYER Before we start with the arithmetic of elliptic curves, let us talk a little bit about multiplicities, tangents, and singular points. 1. Tangents How do we
More informationTangent spaces, normals and extrema
Chapter 3 Tangent spaces, normals and extrema If S is a surface in 3-space, with a point a S where S looks smooth, i.e., without any fold or cusp or self-crossing, we can intuitively define the tangent
More informationAnalysis-3 lecture schemes
Analysis-3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space
More informationPOLYNOMIALS. x + 1 x x 4 + x 3. x x 3 x 2. x x 2 + x. x + 1 x 1
POLYNOMIALS A polynomial in x is an expression of the form p(x) = a 0 + a 1 x + a x +. + a n x n Where a 0, a 1, a. a n are real numbers and n is a non-negative integer and a n 0. A polynomial having only
More informationALGEBRAIC CURVES. B3b course Nigel Hitchin
ALGEBRAIC CURVES B3b course 2009 Nigel Hitchin hitchin@maths.ox.ac.uk 1 These notes trace a path through material which is covered in more detail in the book for the course which is: F Kirwan, Complex
More informationNOTES (1) FOR MATH 375, FALL 2012
NOTES 1) FOR MATH 375, FALL 2012 1 Vector Spaces 11 Axioms Linear algebra grows out of the problem of solving simultaneous systems of linear equations such as 3x + 2y = 5, 111) x 3y = 9, or 2x + 3y z =
More informationdiv(f ) = D and deg(d) = deg(f ) = d i deg(f i ) (compare this with the definitions for smooth curves). Let:
Algebraic Curves/Fall 015 Aaron Bertram 4. Projective Plane Curves are hypersurfaces in the plane CP. When nonsingular, they are Riemann surfaces, but we will also consider plane curves with singularities.
More informationAlgebraic Varieties. Chapter Algebraic Varieties
Chapter 12 Algebraic Varieties 12.1 Algebraic Varieties Let K be a field, n 1 a natural number, and let f 1,..., f m K[X 1,..., X n ] be polynomials with coefficients in K. Then V = {(a 1,..., a n ) :
More informationarxiv:math/ v1 [math.ag] 3 Mar 2002
How to sum up triangles arxiv:math/0203022v1 [math.ag] 3 Mar 2002 Bakharev F. Kokhas K. Petrov F. June 2001 Abstract We prove configuration theorems that generalize the Desargues, Pascal, and Pappus theorems.
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More informationELLIPTIC CURVES BJORN POONEN
ELLIPTIC CURVES BJORN POONEN 1. Introduction The theme of this lecture is to show how geometry can be used to understand the rational number solutions to a polynomial equation. We will illustrate this
More information12. Hilbert Polynomials and Bézout s Theorem
12. Hilbert Polynomials and Bézout s Theorem 95 12. Hilbert Polynomials and Bézout s Theorem After our study of smooth cubic surfaces in the last chapter, let us now come back to the general theory of
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationarxiv: v1 [math.nt] 1 Dec 2009
1 A TERNARY ALGEBRA WITH APPLICATIONS TO BINARY QUADRATIC FORMS arxiv:091.0060v1 math.nt] 1 Dec 009 EDRAY GOINS Abstract. We discuss multiplicative properties of the binary quadratic form + bxy + cy by
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #23 11/26/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #23 11/26/2013 As usual, a curve is a smooth projective (geometrically irreducible) variety of dimension one and k is a perfect field. 23.1
More informationLagrange Murderpliers Done Correctly
Lagrange Murderpliers Done Correctly Evan Chen June 8, 2014 The aim of this handout is to provide a mathematically complete treatise on Lagrange Multipliers and how to apply them on optimization problems.
More informationMath 203A - Solution Set 4
Math 203A - Solution Set 4 Problem 1. Let X and Y be prevarieties with affine open covers {U i } and {V j }, respectively. (i) Construct the product prevariety X Y by glueing the affine varieties U i V
More informationGEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS
GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions
More informationProjective Varieties. Chapter Projective Space and Algebraic Sets
Chapter 1 Projective Varieties 1.1 Projective Space and Algebraic Sets 1.1.1 Definition. Consider A n+1 = A n+1 (k). The set of all lines in A n+1 passing through the origin 0 = (0,..., 0) is called the
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
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 informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationLinear Algebra. Chapter 8: Eigenvalues: Further Applications and Computations Section 8.2. Applications to Geometry Proofs of Theorems.
Linear Algebra Chapter 8: Eigenvalues: Further Applications and Computations Section 8.2. Applications to Geometry Proofs of Theorems May 1, 2018 () Linear Algebra May 1, 2018 1 / 8 Table of contents 1
More informationMATH 225 Summer 2005 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 2005
MATH 225 Summer 25 Linear Algebra II Solutions to Assignment 1 Due: Wednesday July 13, 25 Department of Mathematical and Statistical Sciences University of Alberta Question 1. [p 224. #2] The set of all
More informationCHAPTER 2 POLYNOMIALS KEY POINTS
CHAPTER POLYNOMIALS KEY POINTS 1. Polynomials of degrees 1, and 3 are called linear, quadratic and cubic polynomials respectively.. A quadratic polynomial in x with real coefficient is of the form a x
More information8. Prime Factorization and Primary Decompositions
70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings
More informationINTRODUCTION TO ELLIPTIC CURVES
INTRODUCTION TO ELLIPTIC CURVES MATILDE LALÍN Abstract. These notes correspond to a mini-course taught by the author during the program Two Weeks at Waterloo - A Summer School for Women in Math. Please
More informationPermutations and Polynomials Sarah Kitchen February 7, 2006
Permutations and Polynomials Sarah Kitchen February 7, 2006 Suppose you are given the equations x + y + z = a and 1 x + 1 y + 1 z = 1 a, and are asked to prove that one of x,y, and z is equal to a. We
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationIRREDUCIBILITY OF ELLIPTIC CURVES AND INTERSECTION WITH LINES.
IRREDUCIBILITY OF ELLIPTIC CURVES AND INTERSECTION WITH LINES. IAN KIMING 1. Non-singular points and tangents. Suppose that k is a field and that F (x 1,..., x n ) is a homogeneous polynomial in n variables
More informationLinear Algebra. Paul Yiu. Department of Mathematics Florida Atlantic University. Fall 2011
Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 1A: Vector spaces Fields
More informationRational constants of monomial derivations
Rational constants of monomial derivations Andrzej Nowicki and Janusz Zieliński N. Copernicus University, Faculty of Mathematics and Computer Science Toruń, Poland Abstract We present some general properties
More informationRATIONAL POINTS ON CURVES. Contents
RATIONAL POINTS ON CURVES BLANCA VIÑA PATIÑO Contents 1. Introduction 1 2. Algebraic Curves 2 3. Genus 0 3 4. Genus 1 7 4.1. Group of E(Q) 7 4.2. Mordell-Weil Theorem 8 5. Genus 2 10 6. Uniformity of Rational
More informationNOTES FOR LINEAR ALGEBRA 133
NOTES FOR LINEAR ALGEBRA 33 William J Anderson McGill University These are not official notes for Math 33 identical to the notes projected in class They are intended for Anderson s section 4, and are 2
More informationMath 4310 Solutions to homework 7 Due 10/27/16
Math 4310 Solutions to homework 7 Due 10/27/16 1. Find the gcd of x 3 + x 2 + x + 1 and x 5 + 2x 3 + x 2 + x + 1 in Rx. Use the Euclidean algorithm: x 5 + 2x 3 + x 2 + x + 1 = (x 3 + x 2 + x + 1)(x 2 x
More informationLinear Algebra 1 Exam 2 Solutions 7/14/3
Linear Algebra 1 Exam Solutions 7/14/3 Question 1 The line L has the symmetric equation: x 1 = y + 3 The line M has the parametric equation: = z 4. [x, y, z] = [ 4, 10, 5] + s[10, 7, ]. The line N is perpendicular
More informationNotes on Quadratic Extension Fields
Notes on Quadratic Extension Fields 1 Standing notation Q denotes the field of rational numbers. R denotes the field of real numbers. F always denotes a subfield of R. The symbol k is always a positive
More informationExercises for algebraic curves
Exercises for algebraic curves Christophe Ritzenthaler February 18, 2019 1 Exercise Lecture 1 1.1 Exercise Show that V = {(x, y) C 2 s.t. y = sin x} is not an algebraic set. Solutions. Let us assume that
More informationLecture 10 - Eigenvalues problem
Lecture 10 - Eigenvalues problem Department of Computer Science University of Houston February 28, 2008 1 Lecture 10 - Eigenvalues problem Introduction Eigenvalue problems form an important class of problems
More informationA Diophantine System Concerning Sums of Cubes
1 2 3 47 6 23 11 Journal of Integer Sequences Vol. 16 (2013) Article 13.7.8 A Diophantine System Concerning Sums of Cubes Zhi Ren Mission San Jose High School 41717 Palm Avenue Fremont CA 94539 USA renzhistc69@163.com
More informationLinear Algebra I. Ronald van Luijk, 2015
Linear Algebra I Ronald van Luijk, 2015 With many parts from Linear Algebra I by Michael Stoll, 2007 Contents Dependencies among sections 3 Chapter 1. Euclidean space: lines and hyperplanes 5 1.1. Definition
More informationRolle s theorem: from a simple theorem to an extremely powerful tool
Rolle s theorem: from a simple theorem to an extremely powerful tool Christiane Rousseau, Université de Montréal November 10, 2011 1 Introduction How many solutions an equation or a system of equations
More informationTHE ENVELOPE OF LINES MEETING A FIXED LINE AND TANGENT TO TWO SPHERES
6 September 2004 THE ENVELOPE OF LINES MEETING A FIXED LINE AND TANGENT TO TWO SPHERES Abstract. We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More information2018 Best Student Exam Solutions Texas A&M High School Students Contest October 20, 2018
08 Best Student Exam Solutions Texas A&M High School Students Contest October 0, 08. You purchase a stock and later sell it for $44 per share. When you do, you notice that the percent increase was the
More informationMath Midterm Solutions
Math 145 - Midterm Solutions Problem 1. (10 points.) Let n 2, and let S = {a 1,..., a n } be a finite set with n elements in A 1. (i) Show that the quasi-affine set A 1 \ S is isomorphic to an affine set.
More informationMath 418 Algebraic Geometry Notes
Math 418 Algebraic Geometry Notes 1 Affine Schemes Let R be a commutative ring with 1. Definition 1.1. The prime spectrum of R, denoted Spec(R), is the set of prime ideals of the ring R. Spec(R) = {P R
More information1. Projective geometry
1. Projective geometry Homogeneous representation of points and lines in D space D projective space Points at infinity and the line at infinity Conics and dual conics Projective transformation Hierarchy
More informationne varieties (continued)
Chapter 2 A ne varieties (continued) 2.1 Products For some problems its not very natural to restrict to irreducible varieties. So we broaden the previous story. Given an a ne algebraic set X A n k, we
More informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
More informationPolynomials. Math 4800/6080 Project Course
Polynomials. Math 4800/6080 Project Course 2. Algebraic Curves. Everyone knows what a curve is, until he has studied enough mathematics to become confused through the countless number of possible exceptions.
More information2. Intersection Multiplicities
2. Intersection Multiplicities 11 2. Intersection Multiplicities Let us start our study of curves by introducing the concept of intersection multiplicity, which will be central throughout these notes.
More informationREVIEW OF DIFFERENTIAL CALCULUS
REVIEW OF DIFFERENTIAL CALCULUS DONU ARAPURA 1. Limits and continuity To simplify the statements, we will often stick to two variables, but everything holds with any number of variables. Let f(x, y) be
More information2.3. VECTOR SPACES 25
2.3. VECTOR SPACES 25 2.3 Vector Spaces MATH 294 FALL 982 PRELIM # 3a 2.3. Let C[, ] denote the space of continuous functions defined on the interval [,] (i.e. f(x) is a member of C[, ] if f(x) is continuous
More informationConics. Chapter 6. When you do this Exercise, you will see that the intersections are of the form. ax 2 + bxy + cy 2 + ex + fy + g =0, (1)
Chapter 6 Conics We have a pretty good understanding of lines/linear equations in R 2 and RP 2. Let s spend some time studying quadratic equations in these spaces. These curves are called conics for the
More informationExtra Problems for Math 2050 Linear Algebra I
Extra Problems for Math 5 Linear Algebra I Find the vector AB and illustrate with a picture if A = (,) and B = (,4) Find B, given A = (,4) and [ AB = A = (,4) and [ AB = 8 If possible, express x = 7 as
More informationMAS345 Algebraic Geometry of Curves: Exercises
MAS345 Algebraic Geometry of Curves: Exercises AJ Duncan, September 22, 2003 1 Drawing Curves In this section of the exercises some methods of visualising curves in R 2 are investigated. All the curves
More informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More information9. Birational Maps and Blowing Up
72 Andreas Gathmann 9. Birational Maps and Blowing Up In the course of this class we have already seen many examples of varieties that are almost the same in the sense that they contain isomorphic dense
More informationEIGENVALUES AND EIGENVECTORS 3
EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices
More informationLECTURE 18, MONDAY
LECTURE 18, MONDAY 12.04.04 FRANZ LEMMERMEYER 1. Tate s Elliptic Curves Assume that E is an elliptic curve defined over Q with a rational point P of order N 4. By changing coordinates we may move P to
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationHomework 8 Solutions to Selected Problems
Homework 8 Solutions to Selected Problems June 7, 01 1 Chapter 17, Problem Let f(x D[x] and suppose f(x is reducible in D[x]. That is, there exist polynomials g(x and h(x in D[x] such that g(x and h(x
More informationConvex Functions and Optimization
Chapter 5 Convex Functions and Optimization 5.1 Convex Functions Our next topic is that of convex functions. Again, we will concentrate on the context of a map f : R n R although the situation can be generalized
More informationPolynomial mappings into a Stiefel manifold and immersions
Polynomial mappings into a Stiefel manifold and immersions Iwona Krzyżanowska Zbigniew Szafraniec November 2011 Abstract For a polynomial mapping from S n k to the Stiefel manifold Ṽk(R n ), where n k
More informationMath 530 Lecture Notes. Xi Chen
Math 530 Lecture Notes Xi Chen 632 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca 1991 Mathematics Subject Classification. Primary
More informationConvex Sets with Applications to Economics
Convex Sets with Applications to Economics Debasis Mishra March 10, 2010 1 Convex Sets A set C R n is called convex if for all x, y C, we have λx+(1 λ)y C for all λ [0, 1]. The definition says that for
More informationUNIVERSAL IDENTITIES. b = det
UNIVERSAL IDENTITIES KEITH CONRAD 1 Introduction We want to describe an idea which reduces the verification of algebraic identities valid over all commutative rings to the verification over the complex
More informationLinear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) 1.1 The Formal Denition of a Vector Space
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2017, v. 1.07) Contents 1 Vector Spaces 1 1.1 The Formal Denition of a Vector Space.................................. 1 1.2 Subspaces...................................................
More informationMODEL ANSWERS TO HWK #3
MODEL ANSWERS TO HWK #3 1. Suppose that the point p = [v] and that the plane H corresponds to W V. Then a line l containing p, contained in H is spanned by the vector v and a vector w W, so that as a point
More informationThe Group Structure of Elliptic Curves Defined over Finite Fields
The Group Structure of Elliptic Curves Defined over Finite Fields A Senior Project submitted to The Division of Science, Mathematics, and Computing of Bard College by Andrija Peruničić Annandale-on-Hudson,
More information10. Noether Normalization and Hilbert s Nullstellensatz
10. Noether Normalization and Hilbert s Nullstellensatz 91 10. Noether Normalization and Hilbert s Nullstellensatz In the last chapter we have gained much understanding for integral and finite ring extensions.
More informationLECTURE 7, WEDNESDAY
LECTURE 7, WEDNESDAY 25.02.04 FRANZ LEMMERMEYER 1. Singular Weierstrass Curves Consider cubic curves in Weierstraß form (1) E : y 2 + a 1 xy + a 3 y = x 3 + a 2 x 2 + a 4 x + a 6, the coefficients a i
More informationSYMMETRIC POLYNOMIALS
SYMMETRIC POLYNOMIALS KEITH CONRAD Let F be a field. A polynomial f(x 1,..., X n ) F [X 1,..., X n ] is called symmetric if it is unchanged by any permutation of its variables: for every permutation σ
More informationCh 7 Summary - POLYNOMIAL FUNCTIONS
Ch 7 Summary - POLYNOMIAL FUNCTIONS 1. An open-top box is to be made by cutting congruent squares of side length x from the corners of a 8.5- by 11-inch sheet of cardboard and bending up the sides. a)
More informationADVANCED TOPICS IN ALGEBRAIC GEOMETRY
ADVANCED TOPICS IN ALGEBRAIC GEOMETRY DAVID WHITE Outline of talk: My goal is to introduce a few more advanced topics in algebraic geometry but not to go into too much detail. This will be a survey of
More information12.5 Equations of Lines and Planes
12.5 Equations of Lines and Planes Equation of Lines Vector Equation of Lines Parametric Equation of Lines Symmetric Equation of Lines Relation Between Two Lines Equations of Planes Vector Equation of
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationA Characterization of Distance-Regular Graphs with Diameter Three
Journal of Algebraic Combinatorics 6 (1997), 299 303 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. A Characterization of Distance-Regular Graphs with Diameter Three EDWIN R. VAN DAM
More informationA Characterization of Polyhedral Convex Sets
Journal of Convex Analysis Volume 11 (24), No. 1, 245 25 A Characterization of Polyhedral Convex Sets Farhad Husseinov Department of Economics, Bilkent University, 6533 Ankara, Turkey farhad@bilkent.edu.tr
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More informationLecture 6 - Convex Sets
Lecture 6 - Convex Sets Definition A set C R n is called convex if for any x, y C and λ [0, 1], the point λx + (1 λ)y belongs to C. The above definition is equivalent to saying that for any x, y C, the
More informationVECTORS AND THE GEOMETRY OF SPACE
VECTORS AND THE GEOMETRY OF SPACE VECTORS AND THE GEOMETRY OF SPACE A line in the xy-plane is determined when a point on the line and the direction of the line (its slope or angle of inclination) are given.
More informationMATH 205 HOMEWORK #3 OFFICIAL SOLUTION. Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. (a) F = R, V = R 3,
MATH 205 HOMEWORK #3 OFFICIAL SOLUTION Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. a F = R, V = R 3, b F = R or C, V = F 2, T = T = 9 4 4 8 3 4 16 8 7 0 1
More informationReading Mathematical Expressions & Arithmetic Operations Expression Reads Note
Math 001 - Term 171 Reading Mathematical Expressions & Arithmetic Operations Expression Reads Note x A x belongs to A,x is in A Between an element and a set. A B A is a subset of B Between two sets. φ
More informationRings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.
Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary
More informationElliptic Curves and Mordell s Theorem
Elliptic Curves and Mordell s Theorem Aurash Vatan, Andrew Yao MIT PRIMES December 16, 2017 Diophantine Equations Definition (Diophantine Equations) Diophantine Equations are polynomials of two or more
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
More informationMATH 112 QUADRATIC AND BILINEAR FORMS NOVEMBER 24, Bilinear forms
MATH 112 QUADRATIC AND BILINEAR FORMS NOVEMBER 24,2015 M. J. HOPKINS 1.1. Bilinear forms and matrices. 1. Bilinear forms Definition 1.1. Suppose that F is a field and V is a vector space over F. bilinear
More informationDUALITY AND INSCRIBED ELLIPSES
DUALITY AND INSCRIBED ELLIPSES MAHESH AGARWAL, JOHN CLIFFORD, AND MICHAEL LACHANCE Abstract. We give a constructive proof for the existence of inscribed family of ellipses in convex n-gons for 3 n 5 using
More informationCORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS
CORRESPONDENCE BETWEEN ELLIPTIC CURVES IN EDWARDS-BERNSTEIN AND WEIERSTRASS FORMS DEPARTMENT OF MATHEMATICS AND STATISTICS UNIVERSITY OF OTTAWA SUPERVISOR: PROFESSOR MONICA NEVINS STUDENT: DANG NGUYEN
More informationSCTT The pqr-method august 2016
SCTT The pqr-method august 2016 A. Doledenok, M. Fadin, À. Menshchikov, A. Semchankau Almost all inequalities considered in our project are symmetric. Hence if plugging (a 0, b 0, c 0 ) into our inequality
More informationChapter 3. Vector spaces
Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say
More informationVARIETIES WITHOUT EXTRA AUTOMORPHISMS I: CURVES BJORN POONEN
VARIETIES WITHOUT EXTRA AUTOMORPHISMS I: CURVES BJORN POONEN Abstract. For any field k and integer g 3, we exhibit a curve X over k of genus g such that X has no non-trivial automorphisms over k. 1. Statement
More information