Vandermonde Matrices for Intersection Points of Curves
|
|
- Edmund Floyd
- 6 years ago
- Views:
Transcription
1 This preprint is in final form. It appeared in: Jaén J. Approx. (009) 1, Vandermonde Matrices for Intersection Points of Curves Hakop Hakopian, Kurt Jetter and Georg Zimmermann Abstract We reconsider and reprove Cayley-Bacharach type theorems, as discussed in [1], Theorems CB1-CB5. Our proof naturally uses Max Noether s famous basis theorem for finitely generated polynomial ideals, but in addition only envolves rank properties of Vandermonde matrices. In this way, we even arrive at a slight extension of Theorem CB5. Applications to poised or non-poised problems of multivariate polynomial interpolation are also discussed. Keywords: Cayley-Bacharach, Max Noether s basis theorem, Hilbert function, polynomial interpolation, poised, multivariate Mathematics Subject Classification (000). Primary: 41A05, 41A63; Secondary: 14H50. Introduction The purpose of this short note is a new proof and a slight extension of the Cayley- Bacharach type theorems as stated, e.g., in [1], Theorems CB1-CB5. Our analysis is based, naturally, on Max Noether s famous AF + BG -theorem, but in addition will only use rank properties of Vandermonde matrices, and properties of point sets which will be derived from these. We will not rely on the famous Riemann-Roch theorem, nor do we focus on an extension to more abstract versions of Cayley-Bacharach (as paper [1] does). Instead, we will be satisfied with a rather straightforward understanding of these problems in algebraic geometry from a classical point of view. For simplicity, we will deal only with bivariate problems. There are rather early versions of Cayley-Bacharach theorems, one of them the classical Pascal s Theorem: If a hexagon is inscribed in a conic, then the three opposite sides meet in collinear points. A special case of this, when the conic degenerates to a set of two lines, is the famous antique Pappus Theorem. Let us give a version of these results in our notation which implies both Pascal s Theorem and its converse statement. 1
2 Hakop Hakopian, Kurt Jetter and Georg Zimmermann Theorem. Assume that two cubics, p and q, intersect at nine points, and let X = {x 1,x,...,x 9 } R, X = U U c with U c = X \ U and #U = 6. Then the six points of U lie on a conic if and only if the remaining three points of U c are collinear. Figure 1 illustrates this result: On the left, the hexagon ABCDEF is inscribed in the dotted ellipse. The sides span the lines l 1 = l(a,b), l = l(b,c),..., l 6 = l(f,a), and pairs of opposite lines intersect in the points A = l(a,b) l(d,e), B = l(b,c) l(e,f) and C = l(c,d) l(f,a), respectively. These three points lie on the dashed line. On the right, however, point D has been moved off the ellipse; and consequently, A, B, and C are no longer collinear. l 6 l 1 l 5 l 3 A F C l 6 l 1 l 5 l 3 A F C l B B C l B B C l 4 A E D l 4 A E D Figure 1: Pascal s Theorem with p = l l 4 l 6 and q = l 1 l 3 l 5. A generalization of this result, for the case that X consists of N = m n different points which are the common points of intersection of two algebraic curves, of degree m and n, respectively, will be given in Theorem 8 and Theorem 9 below. To this end, we will elaborate on properties of such point sets X and of subsets thereof, such as being independent, or complete, or basic with respect to the space of algebraic polynomials of a certain degree k. These properties can be analyzed using properties of the ideal of all polynomials vanishing on X, and of its Hilbert function, and we introduce these notations and develop the needed results in our first two sections. The main part of the paper is section 3 where we present and prove a series of propositions and the two main theorems. In this way, we arrive at a version of Cayley- Bacharach which is slightly more general than Theorem CB5 in [1]. This extension makes heavy use of formula (13), which was apparently missed in reference [1].
3 Vandermonde Matrices for Intersection Points of Curves 3 Cayley-Bacharach theorems have interesting applications in problems on multivariate polynomial interpolations, a subject from Approximation Theory where the present authors are originally interested in; see [] and the references there. We are optimistic that further applications to actual problems in our subject will follow, and that our approach will be helpful in further investigations. 1. Notation and elementary facts We are going to deal with a finite set of points, X = {x 1,x,...,x N } R or C, (1) and with spaces Π and Π k, respectively, of all algebraic polynomials, and of polynomials of total degree less or equal k. Let P X = {p Π : p X = 0} and P k,x = P X Π k () be the ideal of all polynomials vanishing on X and, respectively, its restriction to polynomials of degree at most k. The Hilbert function of the ideal is then defined as { dim Π k dim P k,x, k = 0,1,..., H(k,X) = (3) 0, k = 1,,.... For k 0, it is the dimension of the factor space Π k /P k,x of equivalence classes of polynomials which take the same values on X. When identifying P k,x as the set of solutions of a homogeneous system of linear equations, the following interpretation of the Hilbert function is immediate. Let B k (x) = {x α : α = (α 1,α ) N 0, α := α 1 + α k}, k = 0,1,..., (4) be the monomial basis of Π k ; here we use multi-index notation. The Vandermonde matrix B k (x 1 ) B k (x ) V k (X) = (5). B k (x N ) is an N N k -matrix, with N = #X the number of rows, and ( ) k + N k = dim Π k = the number of columns, and we have H(k,X) = rank V k (X). (6) Hence, the Hilbert function is monotonely non-decreasing, if the number k increases, or if the set X is enlarged.
4 4 Hakop Hakopian, Kurt Jetter and Georg Zimmermann 1.1 Independent points If V k (X) has full row rank, i.e., if rank V k (X) = H(k,X) = #X, we say that the points X are Π k -independent. Otherwise, X has positive Π k -excess, where the Π k - excess as a non-negative integer is defined by E k (X) := #X rank V k (X). (7) Π k -independence of X is equivalent to the fact that the interpolation problem p Π k and p(x) = c x, x X, is always solvable, for any chosen data (c x ) x X. However, the solution is not unique unless #X = dim Π k (see below). The following results are clear: Lemma 1. For given k = 0, 1,... the following hold true: (i) A point set X with positive Π k -excess can be reduced to a subset X = X \ {x}, for appropriate x X, such that H(k,X ) = H(k,X) and E k (X ) = E k (X) 1. (ii) A Π k -independent point set X with #X < dim Π k can be enlarged to a superset X = X {x } which is also Π k -independent, whence satisfies H(k,X ) = H(k,X) + 1. In particular, by applying these statements several times, we see that, for given k, any set X with positive Π k -excess can be reduced to a Π k -independent subset without changing the value of the Hilbert function. And likewise, a Π k -independent set X with #X < dim Π k can be enlarged to a superset Y with #Y = dim Π k, such that the Vandermonde matrix V k,y is (square and) regular. It is this situation where and the interpolation problem rank V k (Y ) = #Y = dim Π k, p Π k and p(y) = c y, y Y, is always uniquely solvable, for any real (or complex) data c y, y Y. Such interpolation problems will be called to be Π k -poised.
5 Vandermonde Matrices for Intersection Points of Curves 5 1. Complete and basic sets of points If X and k, and hence H(k,X) are fixed, we can look at values of H(k,U), for subsets U X. If H(k,U) = H(k,X) for U X, (8) we call U to be Π k -complete in X, and if in addition U is Π k -independent, we say that U is Π k -basic in X. In terms of the corresponding ideals, we have that P k,x P k,u for U X ; here, stands for the relation of being a linear subspace. Completeness means that or in other words, P k,x = P k,u for U X, p Π k and p U = 0 = p X = 0, and basic sets are minimal subsets of X with this property. In terms of the Vandermonde matrices, complete (and basic) subsets refer to an appropriate selection of a (minimal) number of rows in the matrix which span the row space, i.e., rank V k (U) = rank V k (X) for U X. For later reference, we state some facts about subsets U of X. Lemma. Given a set X as in (1), the following hold true for k = 0,1,...: (i) There are Π k -basic subsets U X, and each has cardinality #U = H(k,X). (ii) If U is Π k -independent, then #U H(k,X). In case of strict inequality, U can be enlarged to a Π k -basic subset of X; in case of equality, U is Π k -basic in X. (iii) If U is Π k -complete in X, then #U H(k,X). In case of strict inequality, U can be reduced to a Π k -basic subset of X; in case of equality, U is Π k -basic in X. Complementary to the notion of Π k -excess for the set X, we call D k (U,X) := dim P k,u /P k,x = dim P k,u dim P k,x = H(k,X) H(k,U) (9) the Π k -defect of U modulo X, for U X. Theorem 10 below will refer to this terminology.
6 6 Hakop Hakopian, Kurt Jetter and Georg Zimmermann. The Hilbert function for intersection points It is well known that, in general, the Hilbert function for the ideal P X is not known a priori. A different situation occurs when the ideal has a basis of two elements. Here, we consider the special case that X = X 1 X = {x 1,x,...,x N } with N = m n, (10) where X 1 and X are the zero sets of two polynomials F m and G n, of degree m and n, respectively, i.e., we have F m Π m, X 1 = {x C : F m (x) = 0} and G n Π n, X = {x C : G n (x) = 0}. In this case, the Hilbert function is well-known, see [1], section 1. or [3], where the Hilbert function is used for describing extremal signatures in problems of multivariate Chebyshev approximation. And the reason for this is the fact that the ideal P X can be represented according to Max Noether s fundamental theorem: Lemma 3. For k = 0,1,... we have p k P k,x if and only if it can be represented as p k = A k m F m + B k n G n with A k m Π k m and B k n Π k n. In case k m + n 1, this representation is unique. Here, A k m = 0 for k < m and B k n = 0 for k < n. The representation allows a counting argument to determine the dimension of P k,x : ( ) k m + dim P k,x = + ( k n + ) ( ) k n m +, (11) with the usual convention that ( ν ) = 0 for an integer ν <. The value of the Hilbert function thus follows from (3). We state the result for later use. Lemma 4. Let X = {x 1,x,...,x N }, with N = m n, be the intersection points of two curves of degree m and n respectively, and assume that k m+n 1. Then, the value of the Hilbert function is given by and we have the identity ( ) k + H(k,X) = ( k m + ) ( ) k n +, (1) H(k,X) + H(m + n k 3,X) = m n. (13)
7 Vandermonde Matrices for Intersection Points of Curves 7 k = 1 k = 3 k = 6 k = 8 k = 9 Figure : Illustration of equation (13) for #X = m n = Eq. (13) is a binomial identity which can be verified in a straightforward way by a simple, but lengthy case study. However, the following interpretation of the Hilbert function makes the identity immediately transparent. The number ( ) k+ equals the number of points in a triangular array of points having k + 1 points at the horizontal and at the vertical side. From this triangular array we cut off two smaller triangular arrays, from the top and from the right, for k m or k n, resulting with the number of points given by (1). If the complementary value of the Hilbert function in (13) is interpreted in the same way, we see that the set of m n points is divided into two complementary sets as illustrated in Figure : The number of points below and above the respective lines refers to the two complementary values of the Hilbert function. For bigger values of k, the Hilbert function is constant. If we take k = m + n, we find ( ) ( ) ( ) m + n n m H(m + n,x) = = m n = #X. This shows that, for any k m + n, the Vandermonde matrix V k (X) has full row rank, hence X is Π k -independent, hence H(k,X) = #X. In particular, eq. (13) holds true for any k, in view of the notation in (3). We are interested in properties of subsets U X, and would like to relate these to properties of their complementary sets (as was done in our version of Pascal s theorem). In what follows, we will use the following general assumption: Assumption A: X = {x 1,x,...,x N } with N = m n is the set of intersection points of two curves, of degree m and n, respectively, and X = U U c with U X and U c = X \ U.
8 8 Hakop Hakopian, Kurt Jetter and Georg Zimmermann 3. Cayley-Bacharach type theorems A first Cayley-Bacharach type theorem is the following extension of Chasles theorem, see [1], Theorems CB3 and CB4. This is case k = m+n 3, where the Hilbert function takes the value H(m + n 3,X) = m n 1 = #X 1. Proposition 5. For the set X of intersection points and any x X, we have P m+n 3,X = P m+n 3,X\{x}. In other words: Any polynomial of degree at most m + n 3 vanishing at all but one points of X, must necessarily vanish at the remaining point, too. Or again: If all but one points of X are contained in a curve of degree at most m + n 3, then also the last point is on the curve. Proof. For completeness, we present a proof using our notation. Given x X, we have to show that p Π m+n 3 and p X\{x} = 0 = p(x) = 0. (14) We are going to use the same notation l for a linear polynomial and for its zero set, which is a line. Fix x X, and choose any line l such that X l = {x}. Under the assumption in the left-hand side of (14), we see that p l P m+n,x and p l = A n F m + B m G n (15) by Lemma 3. Now, l divides both, A n and B m. Namely, l has m common zeros (in C ) with F m, and by selection of l only one of these zeros, namely x, is in X. From the representation, the remaining m 1 zeros must be zeros of B m, which shows that l divides B m. Likewise, l divides A n, and performing this division by l in (15), we see that p P X. Next, we look at dual interpolation problems, refering to subsets U X and to points y U c. For 0 k m + n 3, these are the following two interpolation problems: p Π k, p U = 0 and p(y) = 1, (16) and its dual problem: q Π m+n k 3, q U c \{y} = 0 and q(y) = 1. (17) Each of these problems might or might not be solvable, uniquely or not uniquely. But we have the following general statement.
9 Vandermonde Matrices for Intersection Points of Curves 9 Proposition 6. The two dual interpolation problems are never simultaneously solvable. For otherwise, the polynomial r = p q satisfies r Π m+n 3, r X\{y} = 0 and r(y) = 1, which contradicts Proposition 5. In terms of Vandermonde matrices, this proposition can be interpreted as follows; here, we refer to the notation in (4) and (5), and we point to the fact that these Vandermonde matrices need not be square: If B k (y) is not in the linear span of the row vectors of V k (U), then B m+n k 3 (y) must be a linear combination of the remaining row vectors of V m+n k 3 (U c ); and vice versa. In particular, H(k,U {y}) = H(k,U) + 1 implies H(m + n k 3,U c \ {y}) = H(m + n k 3,U c ). Proposition 7. If, for some 0 k m + n 3, the set U is not Π k -complete in X, then the complementary set U c is not Π m+n k 3 -independent. Equivalently, P k,x P k,u = #U c > rank V m+n k 3 (U c ). Proof. By assumption, we find a polynomial p Π k vanishing on U, but not vanishing on the entire set X. Thus, for an appropriate y U c, the interpolation problem (16) is solvable. If the complementary set U c were Π m+n k 3 -independent, the dual problem (17) would be solvable. But this contradicts Proposition 6. Combining our findings we arrive at our two main results. The first one deals with subsets U of X, with cardinality H(k,X). The second one shows that the converse of Proposition 7 is also true. Theorem 8. Given Assumption A, suppose that Then the following hold true: #U = H(k,X) for some 0 k m + n 3. (i) #U c = H(m + n k 3,X). (ii) U is Π k -independent if and only if U c is Π m+n k 3 -independent. (iii) If the sets are independent, they are both basic in X. In particular, U is Π k -basic in X if and only if U c is Π m+n k 3 -basic in X. Theorem 9. Given Assumption A, the following are equivalent for 0 k m+n 3:
10 10 Hakop Hakopian, Kurt Jetter and Georg Zimmermann (i) U is Π k -complete in X. (ii) The complementary set U c is Π m+n k 3 -independent. Proof of Theorem 8. The first statement follows from (13), and the last statement follows from the second one via Lemma. Also, in order to prove the second statement, it is sufficient to show one direction only, since the reverse implication is the dual statement to the direct implication with U replaced by U c and k replaced by m + n k 3. Now, assume that U c is Π m+n k 3 -independent. Then, by Proposition 7, the set U is Π k -complete in X, hence Π k -basic in X by Lemma. In particular, U is Π k -independent. Proof of Theorem 9. Due to Proposition 7 only the implication (i) = (ii) has to be verified. If U is Π k -complete in X then, by Lemma, U can be reduced to a Π k -basic set U U. By Theorem 8, the complementary set (U ) c is Π m+n k 3 -independent, and U c (U ) c is Π m+n k 3 -independent as well. Let us show that Theorem CB5 of [1] follows from Theorem 9 as a corollary. Here, we use the notions introduced in (7) and (9). Theorem 10. [1] For 0 k m + n 3, the Π k -defect of a set U X equals the Π m+n k 3 -excess of the complementary set U c : D k (U,X) = E m+n k 3 (U c ). Proof. If D k (U,X) = dim P k,u dim P k,x > 0, we find a polynomial p Π k and a point y U c such that p U = 0 and p(y) = 1, whence in view of the remarks after Proposition 6, D k (U {y},x) = D k (U,X) 1 and E m+n k 3 (U c \ {y}) = E m+n k 3 (U c ) 1. These equations show that, by adding y U c to U, the Π k -defect of U and the Π m+n k 3 -excess of the complementary set are both reduced by one. Proceeding in this way, by adding D k (U,X) points from U c to U, step by step, we arrive at a superset Ū X of U which is Π k-complete in X, and the excess of its complementary set reduces to 0 E m+n k 3 ((Ū)c ) = E m+n k 3 (U c ) D k (U,X). But by Theorem 9, if the set Ū is Π k-complete in X, then the complementary set (Ū)c is Π m+n k 3 -independent, thus This proves the theorem. E m+n k 3 ((Ū)c ) = 0.
11 Vandermonde Matrices for Intersection Points of Curves Applications to interpolation The case H(k,X) = dim Π k and H(m + n k 3,X) = dim Π m+n k 3 is of special interest, since it deals with square Vandermonde matrices. It is this case, where these matrices refer to poised or non-poised problems of polynomial interpolation. This generates a series of extensions and modifications of Pascal s Theorem and of its converse statement. Example 1. This is case m = n and k = n 1. Here, dim Π k = dim Π n 1 = ( ) n+1 and dim Πk 1 = dim Π n = ( n ). Since ( n + 1 ) + ( ) n = n = m n, we may choose ( ) n + 1 U X with #U = and #U c = ( ) n. Both Vandermonde matrices V n 1 (U) and V n (U c ) are square, and Theorem 8 tells that they are either both regular or both singular. In conclusion, the two interpolation problems are either both poised or both non-poised. Pascal s theorem is the special case when m = n = 3, #U = 6 and #U c = 3. Figure 3 illustrates case m = n = 4, with #U = 10 = dim Π 3 and #U c = 6 = dim Π. Figure 3: Generalization of Pascal s Theorem, case m = n = 4.
12 1 Hakop Hakopian, Kurt Jetter and Georg Zimmermann Example. In this case Since we may choose m = n + 1 and k = n 1. ( ) n + 1 = (n + 1) n = m n, ( ) n + 1 #U = #U c = = dim Π n 1 in order to have square Vandermonde matrices V n 1 (U) and V n 1 (U c ). Again, the matrices are either both regular or both singular. In this case the two polynomial interpolation problems deal with polynomials of the same degree. Figure 4 illustrates case n = 3, i.e., interpolation at 6 points using quadratic polynomials. Figure 4: Modification of Pascal s Theorem, case n = 3, m = 4. Acknowledgements Part of this work was done while the first author was visiting the University of Hohenheim. Support from the DAAD, grant # A/07/04610, is gratefully acknowledged.
13 Vandermonde Matrices for Intersection Points of Curves 13 Bibliography [1] D. Eisenbud, M. Green, and J. Harris, Cayley-Bacharach theorems and conjectures, Bull.Amer.Math.Soc. 33 (1996), [] H. Hakopian, The multivariate fundamental theorem of Algebra, Bezout s theorem and Nullstellensatz, in: Approximation Theory (D. K. Dimitrov et al., eds.), pp , Marin Drinov Acad. Publ. House, Sofia, 004. [3] H. M. Möller, Linear abhängige Punktfunktionale bei zweidimensionalen Interpolations- und Approximationsproblemen, Math. Z. 173 (1980), Hakop Hakopian Department of Informatics and Applied Mathematics Yerevan State University A. Manookian str. 1 Yerevan 005, Armenia hakop@ysu.am Kurt Jetter and Georg Zimmermann Institut für Angewandte Mathematik und Statistik Universität Hohenheim D Stuttgart, Germany kjetter@uni-hohenheim.de, Georg.Zimmermann@uni-hohenheim.de
On the usage of lines in GC n sets
On the usage of lines in GC n sets Hakop Hakopian, Vahagn Vardanyan arxiv:1807.08182v3 [math.co] 16 Aug 2018 Abstract A planar node set X, with X = ( ) n+2 2 is called GCn set if each node possesses fundamental
More information(II.B) Basis and dimension
(II.B) Basis and dimension How would you explain that a plane has two dimensions? Well, you can go in two independent directions, and no more. To make this idea precise, we formulate the DEFINITION 1.
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 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 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 informationSupport weight enumerators and coset weight distributions of isodual codes
Support weight enumerators and coset weight distributions of isodual codes Olgica Milenkovic Department of Electrical and Computer Engineering University of Colorado, Boulder March 31, 2003 Abstract In
More informationLocal 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 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 informationarxiv: v4 [math.rt] 9 Jun 2017
ON TANGENT CONES OF SCHUBERT VARIETIES D FUCHS, A KIRILLOV, S MORIER-GENOUD, V OVSIENKO arxiv:1667846v4 [mathrt] 9 Jun 217 Abstract We consider tangent cones of Schubert varieties in the complete flag
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationWe simply compute: for v = x i e i, bilinearity of B implies that Q B (v) = B(v, v) is given by xi x j B(e i, e j ) =
Math 395. Quadratic spaces over R 1. Algebraic preliminaries Let V be a vector space over a field F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v) for all v V and c F, and
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 informationSecant varieties. Marin Petkovic. November 23, 2015
Secant varieties Marin Petkovic November 23, 2015 Abstract The goal of this talk is to introduce secant varieies and show connections of secant varieties of Veronese variety to the Waring problem. 1 Secant
More informationAlgebraic Geometry. Andreas Gathmann. Class Notes TU Kaiserslautern 2014
Algebraic Geometry Andreas Gathmann Class Notes TU Kaiserslautern 2014 Contents 0. Introduction......................... 3 1. Affine Varieties........................ 9 2. The Zariski Topology......................
More informationLax embeddings of the Hermitian Unital
Lax embeddings of the Hermitian Unital V. Pepe and H. Van Maldeghem Abstract In this paper, we prove that every lax generalized Veronesean embedding of the Hermitian unital U of PG(2, L), L a quadratic
More information4 Hilbert s Basis Theorem and Gröbner basis
4 Hilbert s Basis Theorem and Gröbner basis We define Gröbner bases of ideals in multivariate polynomial rings and see how they work in tandem with the division algorithm. We look again at the standard
More informationCarl de Boor. Introduction
Multivariate polynomial interpolation: A GC 2 -set in R 4 without a maximal hyperplane Carl de Boor Abstract. A set T R d at which interpolation from Π n (R d ) (polynomials of degree n) is uniquely possible
More informationOn Projective Planes
C-UPPSATS 2002:02 TFM, Mid Sweden University 851 70 Sundsvall Tel: 060-14 86 00 On Projective Planes 1 2 7 4 3 6 5 The Fano plane, the smallest projective plane. By Johan Kåhrström ii iii Abstract It was
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 informationFirst we introduce the sets that are going to serve as the generalizations of the scalars.
Contents 1 Fields...................................... 2 2 Vector spaces.................................. 4 3 Matrices..................................... 7 4 Linear systems and matrices..........................
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationAlgebraic Geometry. Question: What regular polygons can be inscribed in an ellipse?
Algebraic Geometry Question: What regular polygons can be inscribed in an ellipse? 1. Varieties, Ideals, Nullstellensatz Let K be a field. We shall work over K, meaning, our coefficients of polynomials
More information(IV.C) UNITS IN QUADRATIC NUMBER RINGS
(IV.C) UNITS IN QUADRATIC NUMBER RINGS Let d Z be non-square, K = Q( d). (That is, d = e f with f squarefree, and K = Q( f ).) For α = a + b d K, N K (α) = α α = a b d Q. If d, take S := Z[ [ ] d] or Z
More informationMATH 167: APPLIED LINEAR ALGEBRA Chapter 2
MATH 167: APPLIED LINEAR ALGEBRA Chapter 2 Jesús De Loera, UC Davis February 1, 2012 General Linear Systems of Equations (2.2). Given a system of m equations and n unknowns. Now m n is OK! Apply elementary
More informationClassifying Hilbert functions of fat point subschemes in P 2
Collect. Math. 60, 2 (2009), 159 192 c 2009 Universitat de Barcelona Classifying Hilbert functions of fat point subschemes in P 2 A.V. Geramita Department of Mathematics, Queen s University, Kingston Ontario
More informationPappus Theorem for a Conic and Mystic Hexagons. Ross Moore Macquarie University Sydney, Australia
Pappus Theorem for a Conic and Mystic Hexagons Ross Moore Macquarie University Sydney, Australia Pappus Theorem for a Conic and Mystic Hexagons Ross Moore Macquarie University Sydney, Australia Pappus
More informationBare-bones outline of eigenvalue theory and the Jordan canonical form
Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional
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 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 informationInstitutionen för matematik, KTH.
Institutionen för matematik, KTH. Contents 4 Curves in the projective plane 1 4.1 Lines................................ 1 4.1.3 The dual projective plane (P 2 )............. 2 4.1.5 Automorphisms of P
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 informationAssignment 1 Math 5341 Linear Algebra Review. Give complete answers to each of the following questions. Show all of your work.
Assignment 1 Math 5341 Linear Algebra Review Give complete answers to each of the following questions Show all of your work Note: You might struggle with some of these questions, either because it has
More informationOn Maps Taking Lines to Plane Curves
Arnold Math J. (2016) 2:1 20 DOI 10.1007/s40598-015-0027-1 RESEARCH CONTRIBUTION On Maps Taking Lines to Plane Curves Vsevolod Petrushchenko 1 Vladlen Timorin 1 Received: 24 March 2015 / Accepted: 16 October
More informationCommuting birth-and-death processes
Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death
More informationwhere m is the maximal ideal of O X,p. Note that m/m 2 is a vector space. Suppose that we are given a morphism
8. Smoothness and the Zariski tangent space We want to give an algebraic notion of the tangent space. In differential geometry, tangent vectors are equivalence classes of maps of intervals in R into the
More informationarxiv: v1 [math.gr] 8 Nov 2008
SUBSPACES OF 7 7 SKEW-SYMMETRIC MATRICES RELATED TO THE GROUP G 2 arxiv:0811.1298v1 [math.gr] 8 Nov 2008 ROD GOW Abstract. Let K be a field of characteristic different from 2 and let C be an octonion algebra
More informationLINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS
LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in
More informationON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 33 (2010) 273-284 ON SUM OF SQUARES DECOMPOSITION FOR A BIQUADRATIC MATRIX FUNCTION L. László (Budapest, Hungary) Dedicated to Professor Ferenc Schipp on his 70th
More informationPOLYNOMIAL INTERPOLATION IN NONDIVISION ALGEBRAS
Electronic Transactions on Numerical Analysis. Volume 44, pp. 660 670, 2015. Copyright c 2015,. ISSN 1068 9613. ETNA POLYNOMIAL INTERPOLATION IN NONDIVISION ALGEBRAS GERHARD OPFER Abstract. Algorithms
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More information. CURVES. (d )(d ) = d. g a =
CLASSICAL ALGEBRAIC GEOMETRY Daniel Plaumann Universität Konstanz Summer. CURVES.. D Let X P n be an irreducible curve of degree d. We know that the Hilbert polynomial p X is a polynomial of degree with
More informationMath 240, 4.3 Linear Independence; Bases A. DeCelles. 1. definitions of linear independence, linear dependence, dependence relation, basis
Math 24 4.3 Linear Independence; Bases A. DeCelles Overview Main ideas:. definitions of linear independence linear dependence dependence relation basis 2. characterization of linearly dependent set using
More informationThe Algebraic Degree of Semidefinite Programming
The Algebraic Degree ofsemidefinite Programming p. The Algebraic Degree of Semidefinite Programming BERND STURMFELS UNIVERSITY OF CALIFORNIA, BERKELEY joint work with and Jiawang Nie (IMA Minneapolis)
More informationMATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix.
MATH 323 Linear Algebra Lecture 12: Basis of a vector space (continued). Rank and nullity of a matrix. Basis Definition. Let V be a vector space. A linearly independent spanning set for V is called a basis.
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 informationMIT Algebraic techniques and semidefinite optimization February 16, Lecture 4
MIT 6.972 Algebraic techniques and semidefinite optimization February 16, 2006 Lecture 4 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture we will review some basic elements of abstract
More informationAuerbach bases and minimal volume sufficient enlargements
Auerbach bases and minimal volume sufficient enlargements M. I. Ostrovskii January, 2009 Abstract. Let B Y denote the unit ball of a normed linear space Y. A symmetric, bounded, closed, convex set A in
More informationNon-separable AF-algebras
Non-separable AF-algebras Takeshi Katsura Department of Mathematics, Hokkaido University, Kita 1, Nishi 8, Kita-Ku, Sapporo, 6-81, JAPAN katsura@math.sci.hokudai.ac.jp Summary. We give two pathological
More information8. Diagonalization.
8. Diagonalization 8.1. Matrix Representations of Linear Transformations Matrix of A Linear Operator with Respect to A Basis We know that every linear transformation T: R n R m has an associated standard
More informationChapter Five Notes N P U2C5
Chapter Five Notes N P UC5 Name Period Section 5.: Linear and Quadratic Functions with Modeling In every math class you have had since algebra you have worked with equations. Most of those equations have
More informationSESHADRI CONSTANTS ON SURFACES
SESHADRI CONSTANTS ON SURFACES KRISHNA HANUMANTHU 1. PRELIMINARIES By a surface, we mean a projective nonsingular variety of dimension over C. A curve C on a surface X is an effective divisor. The group
More informationMATH32062 Notes. 1 Affine algebraic varieties. 1.1 Definition of affine algebraic varieties
MATH32062 Notes 1 Affine algebraic varieties 1.1 Definition of affine algebraic varieties We want to define an algebraic variety as the solution set of a collection of polynomial equations, or equivalently,
More informationSystems of Linear Equations
LECTURE 6 Systems of Linear Equations You may recall that in Math 303, matrices were first introduced as a means of encapsulating the essential data underlying a system of linear equations; that is to
More informationLecture 5: Ideals of Points
Lecture 5: Ideals of Points The Vanishing Lecture Martin Kreuzer Fakultät für Informatik und Mathematik Universität Passau martin.kreuzer@ uni-passau.de Sophus Lie Center Nordfjordeid June 18, 2009 1 Contents
More information. HILBERT POLYNOMIALS
CLASSICAL ALGEBRAIC GEOMETRY Daniel Plaumann Universität Konstan Summer HILBERT POLYNOMIALS T An ane variety V A n with vanishing ideal I(V) K[,, n ] is completely determined by its coordinate ring A(V)
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 informationEXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)
EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily
More informationCAYLEY-BACHARACH AND EVALUATION CODES ON COMPLETE INTERSECTIONS
CAYLEY-BACHARACH AND EVALUATION CODES ON COMPLETE INTERSECTIONS LEAH GOLD, JOHN LITTLE, AND HAL SCHENCK Abstract. In [9], J. Hansen uses cohomological methods to find a lower bound for the minimum distance
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 informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More informationSCIE 4101 Fall Math Review Packet #2 Notes Patterns and Algebra I Topics
SCIE 4101 Fall 014 Math Review Packet # Notes Patterns and Algebra I Topics I consider Algebra and algebraic thought to be the heart of mathematics everything else before that is arithmetic. The first
More informationScattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions
Chapter 3 Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions 3.1 Scattered Data Interpolation with Polynomial Precision Sometimes the assumption on the
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationCommuting nilpotent matrices and pairs of partitions
Commuting nilpotent matrices and pairs of partitions Roberta Basili Algebraic Combinatorics Meets Inverse Systems Montréal, January 19-21, 2007 We will explain some results on commuting n n matrices and
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More informationRanks of Real Symmetric Tensors
Ranks of Real Symmetric Tensors Greg Blekherman SIAM AG 2013 Algebraic Geometry of Tensor Decompositions Real Symmetric Tensor Decompositions Let f be a form of degree d in R[x 1,..., x n ]. We would like
More informationPROJECTIVE BUNDLES OF SINGULAR PLANE CUBICS STEFAN KEBEKUS
PROJECTIVE BUNDLES OF SINGULAR PLANE CUBICS STEFAN KEBEKUS ABSTRACT. Classification theory and the study of projective varieties which are covered by rational curves of minimal degrees naturally leads
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationFeasibility Conditions for Interference Alignment
Feasibility Conditions for Interference Alignment Cenk M. Yetis Istanbul Technical University Informatics Inst. Maslak, Istanbul, TURKEY Email: cenkmyetis@yahoo.com Tiangao Gou, Syed A. Jafar University
More informationDETECTING REGULI AND PROJECTION THEORY
DETECTING REGULI AND PROJECTION THEORY We have one more theorem about the incidence theory of lines in R 3. Theorem 0.1. If L is a set of L lines in R 3 with B lines in any plane or regulus, and if B L
More informationON k-subspaces OF L-VECTOR-SPACES. George M. Bergman
ON k-subspaces OF L-VECTOR-SPACES George M. Bergman Department of Mathematics University of California, Berkeley CA 94720-3840, USA gbergman@math.berkeley.edu ABSTRACT. Let k L be division rings, with
More informationWhere is matrix multiplication locally open?
Linear Algebra and its Applications 517 (2017) 167 176 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Where is matrix multiplication locally open?
More informationE. GORLA, J. C. MIGLIORE, AND U. NAGEL
GRÖBNER BASES VIA LINKAGE E. GORLA, J. C. MIGLIORE, AND U. NAGEL Abstract. In this paper, we give a sufficient condition for a set G of polynomials to be a Gröbner basis with respect to a given term-order
More informationDISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES
DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed
More informationChapter 1. Preliminaries
Introduction This dissertation is a reading of chapter 4 in part I of the book : Integer and Combinatorial Optimization by George L. Nemhauser & Laurence A. Wolsey. The chapter elaborates links between
More informationCHINO VALLEY UNIFIED SCHOOL DISTRICT INSTRUCTIONAL GUIDE ALGEBRA II
CHINO VALLEY UNIFIED SCHOOL DISTRICT INSTRUCTIONAL GUIDE ALGEBRA II Course Number 5116 Department Mathematics Qualification Guidelines Successful completion of both semesters of Algebra 1 or Algebra 1
More informationMath 121 Homework 4: Notes on Selected Problems
Math 121 Homework 4: Notes on Selected Problems 11.2.9. If W is a subspace of the vector space V stable under the linear transformation (i.e., (W ) W ), show that induces linear transformations W on W
More informationSCIE 4101 Spring Math Review Packet #2 Notes Algebra I
SCIE 4101 Spring 011 Math Review Packet # Notes Algebra I I consider Algebra and algebraic thought to be the heart of mathematics everything else before that is arithmetic. The first characteristic of
More informationGeneralized Veronesean embeddings of projective spaces, Part II. The lax case.
Generalized Veronesean embeddings of projective spaces, Part II. The lax case. Z. Akça A. Bayar S. Ekmekçi R. Kaya J. A. Thas H. Van Maldeghem Abstract We classify all embeddings θ : PG(n, K) PG(d, F),
More informationCAYLEY-BACHARACH THEOREMS AND CONJECTURES
BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 33, Number 3, July 1996 CAYLEY-BACHARACH THEOREMS AND CONJECTURES DAVID EISENBUD, MARK GREEN, AND JOE HARRIS Abstract. A theorem of Pappus
More informationVector Spaces 4.5 Basis and Dimension
Vector Spaces 4.5 and Dimension Summer 2017 Vector Spaces 4.5 and Dimension Goals Discuss two related important concepts: Define of a Vectors Space V. Define Dimension dim(v ) of a Vectors Space V. Vector
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 informationEuler characteristic of the truncated order complex of generalized noncrossing partitions
Euler characteristic of the truncated order complex of generalized noncrossing partitions D. Armstrong and C. Krattenthaler Department of Mathematics, University of Miami, Coral Gables, Florida 33146,
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 informationPACKING POLYNOMIALS ON SECTORS OF R 2. Caitlin Stanton Department of Mathematics, Stanford University, California
#A67 INTEGERS 14 (014) PACKING POLYNOMIALS ON SECTORS OF R Caitlin Stanton Department of Mathematics, Stanford University, California ckstanton@stanford.edu Received: 10/7/13, Revised: 6/5/14, Accepted:
More informationLinear Algebra. Grinshpan
Linear Algebra Grinshpan Saturday class, 2/23/9 This lecture involves topics from Sections 3-34 Subspaces associated to a matrix Given an n m matrix A, we have three subspaces associated to it The column
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 informationPolynomial-exponential 2D data models, Hankel-block-Hankel matrices and zero-dimensional ideals
Polynomial-exponential 2D data models, Hankel-block-Hankel matrices and zero-dimensional ideals Konstantin Usevich Department of Mathematics and Mechanics, StPetersburg State University, Russia E-mail:
More informationAn Introduction to Tropical Geometry
An Introduction to Tropical Geometry Ryan Hart Doenges June 8, 2015 1 Introduction In their paper A Bit of Tropical Geometry [1], Erwan Brugallé and Kristin Shaw present an elementary introduction to the
More informationMATH 0960 ELEMENTARY ALGEBRA FOR COLLEGE STUDENTS (8 TH EDITION) BY ANGEL & RUNDE Course Outline
MATH 0960 ELEMENTARY ALGEBRA FOR COLLEGE STUDENTS (8 TH EDITION) BY ANGEL & RUNDE Course Outline 1. Real Numbers (33 topics) 1.3 Fractions (pg. 27: 1-75 odd) A. Simplify fractions. B. Change mixed numbers
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 informationHilbert Polynomials. dimension and counting monomials. a Gröbner basis for I reduces to in > (I)
Hilbert Polynomials 1 Monomial Ideals dimension and counting monomials 2 The Dimension of a Variety a Gröbner basis for I reduces to in > (I) 3 The Complexity of Gröbner Bases a bound on the degrees of
More informationPolynomial Functions
Polynomial Functions Polynomials A Polynomial in one variable, x, is an expression of the form a n x 0 a 1 x n 1... a n 2 x 2 a n 1 x a n The coefficients represent complex numbers (real or imaginary),
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationChapter 2. Vector Spaces
Chapter 2 Vector Spaces Vector spaces and their ancillary structures provide the common language of linear algebra, and, as such, are an essential prerequisite for understanding contemporary applied mathematics.
More information4.6 Bases and Dimension
46 Bases and Dimension 281 40 (a) Show that {1,x,x 2,x 3 } is linearly independent on every interval (b) If f k (x) = x k for k = 0, 1,,n, show that {f 0,f 1,,f n } is linearly independent on every interval
More informationDiscrete Series Representations of Unipotent p-adic Groups
Journal of Lie Theory Volume 15 (2005) 261 267 c 2005 Heldermann Verlag Discrete Series Representations of Unipotent p-adic Groups Jeffrey D. Adler and Alan Roche Communicated by S. Gindikin Abstract.
More informationThe Maximal Rank Conjecture
The Maximal Ran Conjecture Eric Larson Abstract Let C be a general curve of genus g, embedded in P r via a general linear series of degree d. In this paper, we prove the Maximal Ran Conjecture, which determines
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationSome Remarks on the Discrete Uncertainty Principle
Highly Composite: Papers in Number Theory, RMS-Lecture Notes Series No. 23, 2016, pp. 77 85. Some Remarks on the Discrete Uncertainty Principle M. Ram Murty Department of Mathematics, Queen s University,
More information