Classification of Surfaces

Size: px
Start display at page:

Download "Classification of Surfaces"

Transcription

1 Classification of Surfaces Corrin Clarkson REU Project August 17, 2006 One of the simplest topological spaces is that of the surface. There are many reasons why surfaces are nice objects to study. Our natural intuition about space can easily be adopted to this study. Many surfaces can be modeled in three space and so are things we can literally get our hands on. For the most part the surfaces that we can understand intuitively are compact, meaning they don t go off to infinity. Probably the nicest property of compact surfaces is the fact that they can be classified. This is very useful, because it means we know exactly how many different types of compact surfaces there are. The goal of this paper is to present the proof of the classification of compact connected surfaces without boundary as well as some of the key underlying proofs and definitions. 1 A Few Definitions Definition 1.1 (Homeomorphism). A homeomorphism is a continuous invertible function mapping one topological space to another. The inverse of a homeomorphism is also continuous. Two Spaces are said to be homeomorphic, topologically equivalent, if there exists a homeomorphism mapping one to the other. We write A B, if A is homeomorphic to B. Definition 1.2 (Surface). A surface or 2-manifold is a topological space X with the following characteristics: 1. X is Hausdorff 2. x X a neighborhood of x that is homeomorphic to R 2 1

2 Figure 1: The torus After the first pair of edges is associated the square looks like a cylinder. When the second pair is associated we get the torus. Hence the torus can be thought of as the surface of a doughnut. 3. X has a countable basis The following three surfaces are very important. Our goal will be to prove that they are in fact the building blocks of all compact surfaces. Sphere S 2 = {x R 3 x = 1} with the topology induced by the standard topology of R 3 Torus A torus or T 2 is the quotient space of the unit square obtained by the equivalence relations (x, 0) (x, 1) and (0, y) (1, y). See Figure 1. It is also R 2 /Z 2. It s topology comes from the standard topology of R 2 Projective plane A projective plane or RP 2 is the quotient space obtained by associating each point on the sphere with its polar opposite. It can also be thought of as a 2-gon with its edges associated with opposite orientation. See Figure 2 Definition 1.3 (Connected Sum). The connected sum of two surfaces is the space obtained when an open disk is removed from each surface, and the resulting boundaries are mapped together via a continuous function. We write A#B for the connected sum A and B. See Figures 3. The connected sum is a well defined operation. Definition 1.4 (Triangulation). A triangulation of a surface is a finite set of subsets that cover the surface with the following properties. Each subset is homeomorphic to a triangle in the Euclidean plane. Any two subsets are 2

3 Figure 2: The projective plane A sphere with points associated to their polar opposites is homeomorphic to a hemisphere with points on the boundary associated to their polar opposites. This in turn is homeomorphic to a 2-gon with its edges associated with opposite orientation. Figure 3: The connected sum of two tori disjoint or have a single vertex or a single edge in common. (Here the terms vertex and edge refer to those points that map respectively to vertices and edges of a triangle under the homeomorphism.) See Figure 4 for examples for illegal intersections. Definition 1.5 (Euler Characteristic). The Euler Characteristic of a triangulation is the defined by the equation X(M) = V E + F, where V is the number of vertices in a triangulation of M, E the number of edges, and F the number of faces or triangles. The Euler Characteristic is well defined for all surfaces that can be triangulated. This can be rigorously proven, but due to time constraints the reader is asked to take it as a matter of faith. Figure 4: Illegal intersections 3

4 Figure 5: A oriented pair of triangles Definition 1.6 (Orientable). A surface is said to be orientable if all triangulations can be oriented. A triangulation is said to be oriented if an ordering of vertices of each face can be chosen such that the orderings of any two triangles with a common edge induce opposite orderings on the shared edge. See Figure 5 2 Some Theorems For the purposes of this paper let M be an arbitrary, compact, connected 2-manifold without boundary. Theorem 2.1. M can be triangulated. 1 Proof. Let {B i } be an irreducible finite cover of M consisting of closed balls, B 1, B 2,..., B n. Such a cover exists due to the fact that M is compact. Let C = n B n i=1 Also let A be the set of all points in C that do not have Euclidean neighborhoods. If A is empty, then M is the sphere. The proof of this goes as follows. A = implies one of three things: {B i } consists of only a single closed ball, none of the boundaries of the balls intersect, or the only boundary intersections involve balls having their entire boundary in common. The first case is impossible due to the fact that M has no boundary and so can not be covered by a single closed ball. 1 This theorem was originally proven by Rado [6]. A shorter version is given by Doyle and Moran [1] 4

5 In general the fact that M has no boundary implies B m B 1 m n B {B i }\B m This means that in case two the boundary of any B i is completely contained in the interior of some B j where i j. Because the cover is irreducible, we know that B i B j. We have that B i int(b j ) B j int(b i ) This in turn gives us B i B j homeomorphic to S 2. The sphere can be covered by two disks, one slightly larger than the upper hemisphere and the other slightly larger than the lower hemisphere. The boundary of each is completely contained in the other. This covering is homeomorphic to B i B j. This gives us a subset of M homeomorphic to S 2. M is a 2-manifold so B m st B m (B i B j ) we have either B m (B i B j ). There are however no such B m, because the cover is irreducible. M is connected B m st B m (B i B j ) =. It follows that M is homeomorphic to S 2. Similarly in the third case, two balls with common boundary are homeomorphic to the covering of the sphere that consists simply of the upper and lower hemispheres. This leads to M being homeomorphic to the sphere in this case as well. Therefore A = M S 2. The sphere is easily triangulated. An example of a triangulation of the sphere is the tetrahedron. Therefore if A is empty, M can be triangulated. If A is nonempty, we cover it with a closed 2-cell, D. We can do this, because A is compact and totally disconnected. M = M/D M, because modding out by a 2-cell doesn t change the topology. Let R be the image of C under the quotient map. This implies that M \ R M \ (C D), because C D by definition of D. R is the one-point union of countably many simple closed curves. We also have that all points in R except for the one that corresponds to the image of D have Euclidean neighborhoods. Let p be the point corresponding to the image of D. Now let V be a 2-cell neighborhood of p. V covers all but finitely many simple closed curves in R, by the compactness of R. Therefore we can assume R is the one point union of finitely many simple closed curves, because we can always mod out by V if necessary. This in turn implies that there exists a 2-cell neighborhood of p, V that meets each curve in R in exactly two points. By the Jordan-Schoenflies Theorem the complement of R V is composed of finitely many open 2-cells. If we thicken each of the arcs of R V we obtain a surface which we can triangulate. This triangulation is then extended to the open 2-cells of the complement. Thus M can be triangulated. 5

6 Figure 6: Triangulation proof on the torus (A) A torus covered by finitely many closed balls. (B) A two cell that covers the points with non-euclidean neighborhoods. (C) Modding out by the 2-cell (D) The neighborhood of p (E) The union of the boundaries with the neighbor hood of p (F) The set on a torus, the open 2-cells of the complement Corollary 2.2. M is homeomorphic to a polygon, P with edges glued together in pairs. Proof. By Theorem 2.1 we have shown that M can be triangulated. Let {T i } be a triangulation of M consisting of the triangles T 1, T 2,..., T n. Let the triangles be ordered such that T i shares an edge e i with some T j where 1 j < i i. We can do this, because M is connected. Each edge in {T i } belongs to exactly two triangles. This is due to M being a 2-manifold without boundary. If there were and edge that belonged to only one triangle, it would be a boundary component of M. If there were an edge that belonged to three 6

7 Figure 7: The normal form for the sphere or more triangles, the points belonging to it would not have neighborhoods that were homeomorphic to an open disk. Therefore if an edge belonged to three or more triangles M would not be a manifold. This implies that the space obtained by associating all the e i is a polygon with its edges paired. This can be easily seen if you look at the process step by step. First start with T 1 and then add T 2 at edge e 2. The resulting space is homeomorphic to a disk. The space remains homeomorphic to the disk as each triangle is added, because there are never more than two triangles meeting at a single edge. The space that results when all the e i have been associated is homeomorphic to a disk and so must be a polygon. Each edge of this polygon is an edge of a triangle in the triangulation and so must be associated with exactly one other edge. Therefore M is homeomorphic to a polygon with its edges associated in pairs. Remark 2.3. From this point on when referring to pair of edges will mean only a set of two edges that are identified with one another. For the classification theorem we will need a normal form for the sphere, the projective plane and the torus. We will also need a normal form for the connected sum of these surfaces. The normal form for the torus and the projective plane have already been mentioned. That of the torus is a square with opposite sides associated with the same orientation. The normal form of the projective plane is the 2-gon with its edges associated with opposite orientation, as shown in Figure 2. The normal form for the sphere is similar to that of the projective plane. It is a 2-gon with its edges associated with the same orientation. See Figure 7. The normal form for the connected sums is obtained by summing the normal forms as shown in Figures 8 and 9. We assign a letter to each pair of edges. If an edge is oriented counterclockwise we write the letter as its inverse. Thus we can now represent each normal form with a sequence of letters, for example the normal form for a torus would be written aba 1 b 1. 7

8 Figure 8: The normal form for the connected sum of two tori Figure 9: The normal form for the connected sum of two RP 2 Similarly the normal forms for the sphere and the projective plane are written aa 1 and aa respectively. It is fairly easy to see that there is a connection between the normal forms of surfaces and that of their connected sums. We would write aabbcc for the connected sum of three RP 2 and aba 1 b 1 cdc 1 d 1 for the connected sum of two tori. One would like to infer from this that we could write aabcb 1 c 1 for the connected sum of a torus and a projective plane. In turns out however that this is the same as the connected sum of three RP 2 and so should have the same normal form. In general we will call a polygon of normal form if it is the normal form for one of the following figures, S 2, T 2, RP 2, the connected sum of n tori, or the connected sum of n projective planes. Our goal is to show that these are in fact all connected compact surfaces without boundary. Lemma 2.4. The connected sum of three RP 2 is homeomorphic to the connected sum of RP 2 and T 2. Proof. The proof of this lemma is easily accomplished by taking the normal form of the connected sum of three RP 2 and cutting/gluing it so that it is in the normal form for RP 2 #T 2. The process is laid out in Figure 10. 8

9 Figure 10: The connected sum of three RP 2 (RP 2 #T 2 ) The dotted lies show where cuts are to occur and the grey lines show where edges have been glued. Theorem 2.5. M is homeomorphic to a polyhedron of normal form. 2 Proof. By Corollary 2.2 M is homeomorphic to a polyhedron P with edges identified in pairs. Below is a step by step method for transforming P into a normal form while preserving its topological properties. 1. If P has 4 edges, then eliminate any pair that consists of adjacent edges of opposite orientation. 2. We will call two vertices equivalent if they are identified with the same point. Our goal is to make all the vertices of P equivalent. The method to accomplish this is the following. Assume step 1 has been completed. If P has 2 edges it is either the projective plane or the sphere, both of which are normal forms. If it has 4 edges, then we can assume there are no pairs of consisting of adjacent edges of opposite orientation. We will now further examine the case where P has 4 edges. If all the vertices are not equivalent, then there must be a pair A, B such that A and B are not equivalent, and they are separated by exactly one edge, x. Let y be the edge on the other side of A. If x and y form a pair and have the same orientation, then A must be equivalent to B. If they were a pair of opposite orientation, then they would have been eliminated by step 1. Therefore the two edges x and y do not form a pair. There must then be some other edge y of P that is identified with y. 2 This proof can be found in both Massy [3] and Seifert-Threlfall [5] 9

10 Now cut along a line from B to the vertex of y that is not A, and then glue y to y. The resulting polygon is still homeomorphic to M and has all its edges paired. It also has one less vertex in the equivalence class of A and one more in that of B. We can continue this process, returning to step 1 whenever possible, until all the vertices are in the same equivalence class or P has been reduced to a sphere. 3. As the normal form requires that pairs of the same orientation be adjacent, we are in need of a way to bring such a pair into this position. The following procedure is an example of how this can be done. If P has a pair of nonadjacent edges a, a of the same orientation, then cut along the line, d, connecting the first point of a to the first point of a. Now all that remains is to glue a and a together. The resulting polygon has a pair d and d that are adjacent. As this proceeder does not separate any adjacent pairs, it can be repeated until all pairs of the same orientation are adjacent. As before repeat step 1 when possible. If at this point there are no pairs of opposite orientation, P is in a normal form. 4. We will now work through the case where there are pairs of opposite orientation. Given one pair of opposite orientation a, a 1, there must be a second pair of opposite orientation b, b 1 such that these four edges are in the following arrangement, a... b... a 1... b. The proof of this statement follows from the simplification accomplished by the previous steps. From step 1 we have that there must be at least one edge between a and a 1. As a and a 1 are of opposite orientation, the edges of P can be divided into two groups, those that lie between the fist points of a and a 1 and those that lie between the last. From step 3 we have that any pair of the same orientation can not be split between these two groups, but must be fully contained in one. Therefore if there is no pair of opposite orientation that is split between the two groups, all pairs must be fully contained in one group or the other. This implies however that the first point of a can not be identified with the last point of a, a contradiction of step 2. Therefore there must be a pair b, b 1 of the given arrangement. In order to achieve the normal form aba 1 b 1 cut along the line, c, connecting the first points of a and a 1 and then glue b and b 1 together. 10

11 After this we cut along the line, d, connecting the first points of c and c and glue a and a 1 together. The resulting polygon is homeomorphic to M and has edges in the following arrangement cdc d. As this procedure doesn t disrupt the arrangements of other such pairs it can be repeated until all pairs of opposite orientation are in this arrangement. Once again we repeat step 1 whenever possible. If at this point there are no pairs of the same orientation P is in a normal form. 5. After completion of step 4 P is reduced to the connect sum of projective planes and tori. From Theorem 2.4 we have that the connect sum of three RP 2 is homeomorphic to the connect sum of a torus and a projective plane. Therefore if P has pairs of the same orientation, it can be simplified to a normal form by converting the tori into pairs of projective planes. After completion of the above procedure P is in the normal form. As each step preserves the topology of P, it follows that M is homeomorphic to a polyhedron in normal form. Lemma 2.6. The Euler Characteristic of the connect sum of two compact connected surfaces without boundary, L and N, is two less than the sum of the Euler Characteristics of L and N, ie X(L#N) = X(L) + X(N) 2 Proof. Let L and N be triangulated. Let T L and T N be triangles in the triangulations of L and N respectively. Both T L and T N are homeomorphic to triangles in the plane by definition. This implies that they are both homeomorphic to closed disks. We now remove the interior of T L and that of T N from L and N respectively. Lastly associate the edges of the two triangles in pairs. The resulting space is L#N. Its Euler Characteristic is X(L#N) = (V (L) + V (N) 3) (E(L) + E(N) 3) + (F (L) + F (N) 2) = V (L) + V (N) E(L) E(N) + F (L) + F (N) 2 = X(L) + X(N) 2 Because both the Euler Characteristic and the connected sum are well defined, this is enough to show that the lemma always holds. 11

12 Lemma 2.7. Each orientable normal form has a different Euler Characteristic. Also each non-orientable normal form has a different Euler Characteristic. Proof. The connected sum of tori is always orientable, because the torus is orientable. By Lemma 2.6 the Euler Characteristic of the connected sum of n tori is n X(T ) 2n, and hence is different for all n. Similarly the connected sum of projective planes is never orientable, because the projective plane is not orientable. We have that the Euler Characteristic of the connected sum of n projective planes is n X(RP 2 ) 2n, by Lemma 2.6. Therefore the Euler Characteristic of each non-orientable normal form is different. Theorem 2.8. If two compact connected surfaces without boundary are homeomorphic, then they have the same Euler Characteristic. Proof. Let L and N be homeomorphic compact connected surfaces without boundary. By Theorem 2.1 L can be triangulated. Let ψ : L N be the homeomorphism form L to N. ψ is subjective by the definition of a homeomorphism. This implies that the image of the triangulation of L under ψ covers N. The images of the triangles must be homeomorphic to triangles in R 2, because is a transitive relation. Similarly ψ must map vertices to vertices and edges to edges. ψ is also injective by definition. This implies that the number of triangles in the image is the same as the number in the triangulation. Similarly the number of edges and faces must be the same. Therefore L and N must have the same Euler Characteristic. Corollary 2.9. M is homeomorphic to exactly one surface of normal form. Proof. An orientable surface can not be homeomorphic to a non-orientable surface. This is do to the fact that for any triangulation of a surface there exists a corresponding triangulation for any homeomorphic surface, as shown in the proof of Theorem 2.8. Therefore if you can orient every triangulation of a surface you can do the same for any homeomorphic surface. By Lemma 2.7 all the orientable normal forms have different Euler Characteristic. By Theorem 2.8 homeomorphic surfaces have the same Euler Characteristic. Therefore each orientable normal form is unique. Similarly each non-orientable normal form is unique. By Theorem 2.5 we have that M is homeomorphic to a surface of normal form. This implies that M is homeomorphic to exactly 12

13 one surface of normal form, because we have just shown that all such surfaces are unique. We have obtained a full classification of compact, connected surfaces without boundary. By Corollary 2.9 we have that all such surfaces are either the sphere or the connected sum of n tori or the connected sum of n projective planes. This classification can easily be extended to compact surfaces without boundary that are not connected, as such surfaces must simply be unions of finitely many compact connected surfaces without boundary. It turns out that compact surfaces with boundary also lone themselves to classification. The ease with which 2-manifolds can be classified might lead one to hope that such a classification is possible for all n-manifolds. This is however not the case, with higher dimension the classification theorem get increasingly difficult. Advances in the classification of 3-manifolds and 4-manifolds aare still in progress.. References [1] P. H. Doyle and D. A. Moran A short proof that compact 2-manifolds can be triangulated Inventiones Mathematicae 5: , Springer, Berlin [2] Klaus Jänich Topology trans. Silvio Levy, Springer-Verlag, Berlin [3] William S. Massey Algebraic Topology: An Introduction Springer- Verlag, Berlin [4] James R. Munkres Topology 2 nd Ed., Prentice Hall, Upper Saddle River, NJ [5] H. Seifert and W. Threlfall Lehrbuch der Topologie Chelsea Publishing Company, New York [6] Radó, T Über den Begriff der Riemannschen Fläche Acts. Litt. Sci. Szeged. 2, (1925) 13

A Short Proof that Compact 2-Manifolds Can Be Triangulated

A Short Proof that Compact 2-Manifolds Can Be Triangulated Inventiones math. 5, 160--162 (1968) A Short Proof that Compact 2-Manifolds Can Be Triangulated P. H. DOYLE and D. A. MORAN* (East Lansing, Michigan) The result mentioned in the title of this paper was

More information

Introduction to Topology

Introduction to Topology Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

More information

Surface bundles over S 1, the Thurston norm, and the Whitehead link

Surface bundles over S 1, the Thurston norm, and the Whitehead link Surface bundles over S 1, the Thurston norm, and the Whitehead link Michael Landry August 16, 2014 The Thurston norm is a powerful tool for studying the ways a 3-manifold can fiber over the circle. In

More information

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM

SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the

More information

ON SELF-INTERSECTIONS OF IMMERSED SURFACES

ON SELF-INTERSECTIONS OF IMMERSED SURFACES PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 126, Number 12, December 1998, Pages 3721 3726 S 0002-9939(98)04456-6 ON SELF-INTERSECTIONS OF IMMERSED SURFACES GUI-SONG LI (Communicated by Ronald

More information

CHAPTER 1 BASIC TOPOLOGY

CHAPTER 1 BASIC TOPOLOGY CHAPTER 1 BASIC TOPOLOGY Topology, sometimes referred to as the mathematics of continuity, or rubber sheet geometry, or the theory of abstract topological spaces, is all of these, but, above all, it is

More information

Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

Metric Spaces Joseph Muscat 2003 (Last revised May 2009) 1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

More information

TOPOLOGY OF SINGULAR FIBERS OF GENERIC MAPS

TOPOLOGY OF SINGULAR FIBERS OF GENERIC MAPS TOPOLOGY OF SINGULAR FIBERS OF GENERIC MAPS OSAMU SAEKI Dedicated to Professor Yukio Matsumoto on the occasion of his 60th birthday Abstract. We classify singular fibers of C stable maps of orientable

More information

Comments on Quotient Spaces and Quotient Maps

Comments on Quotient Spaces and Quotient Maps 22M:132 Fall 07 J. Simon Comments on Quotient Spaces and Quotient Maps There are many situations in topology where we build a topological space by starting with some (often simpler) space[s] and doing

More information

SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

More information

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

THE 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 information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

More information

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

More information

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. 1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

More information

Chapter 3.1 Angles. Geometry. Objectives: Define what an angle is. Define the parts of an angle.

Chapter 3.1 Angles. Geometry. Objectives: Define what an angle is. Define the parts of an angle. Chapter 3.1 Angles Define what an angle is. Define the parts of an angle. Recall our definition for a ray. A ray is a line segment with a definite starting point and extends into infinity in only one direction.

More information

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

More information

MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

More information

Fixed Point Theorems in Topology and Geometry

Fixed Point Theorems in Topology and Geometry Fixed Point Theorems in Topology and Geometry A Senior Thesis Submitted to the Department of Mathematics In Partial Fulfillment of the Requirements for the Departmental Honors Baccalaureate By Morgan Schreffler

More information

Graph Theory Problems and Solutions

Graph Theory Problems and Solutions raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

More information

Math 2443, Section 16.3

Math 2443, Section 16.3 Math 44, Section 6. Review These notes will supplement not replace) the lectures based on Section 6. Section 6. i) ouble integrals over general regions: We defined double integrals over rectangles in the

More information

6.3 Conditional Probability and Independence

6.3 Conditional Probability and Independence 222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

More information

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

More information

ORIENTATIONS. Contents

ORIENTATIONS. Contents ORIENTATIONS Contents 1. Generators for H n R n, R n p 1 1. Generators for H n R n, R n p We ended last time by constructing explicit generators for H n D n, S n 1 by using an explicit n-simplex which

More information

Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC. Lee Mosher

Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC. Lee Mosher Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC Lee Mosher Let S be a compact surface, possibly with the extra structure of an orientation or a finite set of distinguished

More information

ON FIBER DIAMETERS OF CONTINUOUS MAPS

ON FIBER DIAMETERS OF CONTINUOUS MAPS ON FIBER DIAMETERS OF CONTINUOUS MAPS PETER S. LANDWEBER, EMANUEL A. LAZAR, AND NEEL PATEL Abstract. We present a surprisingly short proof that for any continuous map f : R n R m, if n > m, then there

More information

Removing Even Crossings

Removing Even Crossings EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,

More information

THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE. Contents THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

More information

Solutions to Homework 10

Solutions to Homework 10 Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x

More information

The Banach-Tarski Paradox

The Banach-Tarski Paradox University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible

More information

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

More information

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

More information

Topological Treatment of Platonic, Archimedean, and Related Polyhedra

Topological Treatment of Platonic, Archimedean, and Related Polyhedra Forum Geometricorum Volume 15 (015) 43 51. FORUM GEOM ISSN 1534-1178 Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic

More information

INTRODUCTION TO TOPOLOGY

INTRODUCTION TO TOPOLOGY INTRODUCTION TO TOPOLOGY ALEX KÜRONYA In preparation January 24, 2010 Contents 1. Basic concepts 1 2. Constructing topologies 13 2.1. Subspace topology 13 2.2. Local properties 18 2.3. Product topology

More information

4. Expanding dynamical systems

4. Expanding dynamical systems 4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric Spaces. Chapter 7. 7.1. Metrics Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some

More information

alternate interior angles

alternate interior angles alternate interior angles two non-adjacent angles that lie on the opposite sides of a transversal between two lines that the transversal intersects (a description of the location of the angles); alternate

More information

Shortcut sets for plane Euclidean networks (Extended abstract) 1

Shortcut sets for plane Euclidean networks (Extended abstract) 1 Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,

More information

The Euler Line in Hyperbolic Geometry

The Euler Line in Hyperbolic Geometry The Euler Line in Hyperbolic Geometry Jeffrey R. Klus Abstract- In Euclidean geometry, the most commonly known system of geometry, a very interesting property has been proven to be common among all triangles.

More information

Finite dimensional topological vector spaces

Finite dimensional topological vector spaces Chapter 3 Finite dimensional topological vector spaces 3.1 Finite dimensional Hausdorff t.v.s. Let X be a vector space over the field K of real or complex numbers. We know from linear algebra that the

More information

Metric Spaces. Chapter 1

Metric Spaces. Chapter 1 Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

More information

PYTHAGOREAN TRIPLES KEITH CONRAD

PYTHAGOREAN TRIPLES KEITH CONRAD PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

More information

arxiv:1203.1525v1 [math.co] 7 Mar 2012

arxiv:1203.1525v1 [math.co] 7 Mar 2012 Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined

More information

arxiv:0908.3127v2 [math.gt] 6 Sep 2009

arxiv:0908.3127v2 [math.gt] 6 Sep 2009 MINIMAL SETS OF REIDEMEISTER MOVES arxiv:0908.3127v2 [math.gt] 6 Sep 2009 MICHAEL POLYAK Abstract. It is well known that any two diagrams representing the same oriented link are related by a finite sequence

More information

FIXED POINT SETS OF FIBER-PRESERVING MAPS

FIXED POINT SETS OF FIBER-PRESERVING MAPS FIXED POINT SETS OF FIBER-PRESERVING MAPS Robert F. Brown Department of Mathematics University of California Los Angeles, CA 90095 e-mail: rfb@math.ucla.edu Christina L. Soderlund Department of Mathematics

More information

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010 CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

More information

On planar regular graphs degree three without Hamiltonian cycles 1

On planar regular graphs degree three without Hamiltonian cycles 1 On planar regular graphs degree three without Hamiltonian cycles 1 E. Grinbergs Computing Centre of Latvian State University Abstract. Necessary condition to have Hamiltonian cycle in planar graph is given.

More information

A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE

A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE DANIEL A. RAMRAS In these notes we present a construction of the universal cover of a path connected, locally path connected, and semi-locally simply

More information

An Introduction to Braid Theory

An Introduction to Braid Theory An Introduction to Braid Theory Maurice Chiodo November 4, 2005 Abstract In this paper we present an introduction to the theory of braids. We lay down some clear definitions of a braid, and proceed to

More information

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

More information

2. Length and distance in hyperbolic geometry

2. Length and distance in hyperbolic geometry 2. Length and distance in hyperbolic geometry 2.1 The upper half-plane There are several different ways of constructing hyperbolic geometry. These different constructions are called models. In this lecture

More information

Introduction to Graph Theory

Introduction to Graph Theory Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

An algorithmic classification of open surfaces

An algorithmic classification of open surfaces An algorithmic classification of open surfaces Sylvain Maillot January 8, 2013 Abstract We propose a formulation for the homeomorphism problem for open n-dimensional manifolds and use the Kerekjarto classification

More information

Singular fibers of stable maps and signatures of 4 manifolds

Singular fibers of stable maps and signatures of 4 manifolds 359 399 359 arxiv version: fonts, pagination and layout may vary from GT published version Singular fibers of stable maps and signatures of 4 manifolds OSAMU SAEKI TAKAHIRO YAMAMOTO We show that for a

More information

PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2

PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 PSEUDOARCS, PSEUDOCIRCLES, LAKES OF WADA AND GENERIC MAPS ON S 2 Abstract. We prove a Bruckner-Garg type theorem for the fiber structure of a generic map from a continuum X into the unit interval I. We

More information

Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

More information

Arrangements And Duality

Arrangements And Duality Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,

More information

LECTURE NOTES ON GENERALIZED HEEGAARD SPLITTINGS

LECTURE NOTES ON GENERALIZED HEEGAARD SPLITTINGS LECTURE NOTES ON GENERALIZED HEEGAARD SPLITTINGS TOSHIO SAITO, MARTIN SCHARLEMANN AND JENNIFER SCHULTENS 1. Introduction These notes grew out of a lecture series given at RIMS in the summer of 2001. The

More information

Final Review Geometry A Fall Semester

Final Review Geometry A Fall Semester Final Review Geometry Fall Semester Multiple Response Identify one or more choices that best complete the statement or answer the question. 1. Which graph shows a triangle and its reflection image over

More information

ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES.

ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. ON TORI TRIANGULATIONS ASSOCIATED WITH TWO-DIMENSIONAL CONTINUED FRACTIONS OF CUBIC IRRATIONALITIES. O. N. KARPENKOV Introduction. A series of properties for ordinary continued fractions possesses multidimensional

More information

Synthetic Projective Treatment of Cevian Nests and Graves Triangles

Synthetic Projective Treatment of Cevian Nests and Graves Triangles Synthetic Projective Treatment of Cevian Nests and Graves Triangles Igor Minevich 1 Introduction Several proofs of the cevian nest theorem (given below) are known, including one using ratios along sides

More information

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

More information

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

More information

Allen Back. Oct. 29, 2009

Allen Back. Oct. 29, 2009 Allen Back Oct. 29, 2009 Notation:(anachronistic) Let the coefficient ring k be Q in the case of toral ( (S 1 ) n) actions and Z p in the case of Z p tori ( (Z p )). Notation:(anachronistic) Let the coefficient

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

n 2 + 4n + 3. The answer in decimal form (for the Blitz): 0, 75. Solution. (n + 1)(n + 3) = n + 3 2 lim m 2 1

n 2 + 4n + 3. The answer in decimal form (for the Blitz): 0, 75. Solution. (n + 1)(n + 3) = n + 3 2 lim m 2 1 . Calculate the sum of the series Answer: 3 4. n 2 + 4n + 3. The answer in decimal form (for the Blitz):, 75. Solution. n 2 + 4n + 3 = (n + )(n + 3) = (n + 3) (n + ) = 2 (n + )(n + 3) ( 2 n + ) = m ( n

More information

1 Local Brouwer degree

1 Local Brouwer degree 1 Local Brouwer degree Let D R n be an open set and f : S R n be continuous, D S and c R n. Suppose that the set f 1 (c) D is compact. (1) Then the local Brouwer degree of f at c in the set D is defined.

More information

Geometric Transformations

Geometric Transformations Geometric Transformations Definitions Def: f is a mapping (function) of a set A into a set B if for every element a of A there exists a unique element b of B that is paired with a; this pairing is denoted

More information

ON COMPUTATIONAL COMPLEXITY OF PLANE CURVE INVARIANTS

ON COMPUTATIONAL COMPLEXITY OF PLANE CURVE INVARIANTS ON COMPUTATIONAL COMPLEXITY OF PLANE CURVE INVARIANTS FEDOR DUZHIN AND TAO BIAOSHUAI ABSTRACT. The theory of generic smooth closed plane curves initiated by Vladimir Arnold is a beautiful fusion of topology,

More information

On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

More information

Angles that are between parallel lines, but on opposite sides of a transversal.

Angles that are between parallel lines, but on opposite sides of a transversal. GLOSSARY Appendix A Appendix A: Glossary Acute Angle An angle that measures less than 90. Acute Triangle Alternate Angles A triangle that has three acute angles. Angles that are between parallel lines,

More information

Geometry and Topology from Point Cloud Data

Geometry and Topology from Point Cloud Data Geometry and Topology from Point Cloud Data Tamal K. Dey Department of Computer Science and Engineering The Ohio State University Dey (2011) Geometry and Topology from Point Cloud Data WALCOM 11 1 / 51

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

ABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).

ABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]). Degrees of Freedom Versus Dimension for Containment Orders Noga Alon 1 Department of Mathematics Tel Aviv University Ramat Aviv 69978, Israel Edward R. Scheinerman 2 Department of Mathematical Sciences

More information

3. Reaction Diffusion Equations Consider the following ODE model for population growth

3. Reaction Diffusion Equations Consider the following ODE model for population growth 3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent

More information

Point Set Topology. A. Topological Spaces and Continuous Maps

Point Set Topology. A. Topological Spaces and Continuous Maps Point Set Topology A. Topological Spaces and Continuous Maps Definition 1.1 A topology on a set X is a collection T of subsets of X satisfying the following axioms: T 1.,X T. T2. {O α α I} T = α IO α T.

More information

Lecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS

Lecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS 1 Lecture 4 DISCRETE SUBGROUPS OF THE ISOMETRY GROUP OF THE PLANE AND TILINGS This lecture, just as the previous one, deals with a classification of objects, the original interest in which was perhaps

More information

The Graphical Method: An Example

The Graphical Method: An Example The Graphical Method: An Example Consider the following linear program: Maximize 4x 1 +3x 2 Subject to: 2x 1 +3x 2 6 (1) 3x 1 +2x 2 3 (2) 2x 2 5 (3) 2x 1 +x 2 4 (4) x 1, x 2 0, where, for ease of reference,

More information

8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension.

8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension. 8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimension. 8.1 Definitions Definition If every point in a set S has arbitrarily small neighborhoods whose boundaries do not intersect

More information

A Topology Primer. Preface. Lecture Notes 2001/2002. Klaus Wirthmüller. http://www.mathematik.uni-kl.de/ wirthm/de/top.html

A Topology Primer. Preface. Lecture Notes 2001/2002. Klaus Wirthmüller. http://www.mathematik.uni-kl.de/ wirthm/de/top.html A Topology Primer Lecture Notes 2001/2002 Klaus Wirthmüller http://www.mathematik.uni-kl.de/ wirthm/de/top.html Preface These lecture notes were written to accompany my introductory courses of topology

More information

Mathematical Methods of Engineering Analysis

Mathematical Methods of Engineering Analysis Mathematical Methods of Engineering Analysis Erhan Çinlar Robert J. Vanderbei February 2, 2000 Contents Sets and Functions 1 1 Sets................................... 1 Subsets.............................

More information

Tilings of the sphere with right triangles III: the asymptotically obtuse families

Tilings of the sphere with right triangles III: the asymptotically obtuse families Tilings of the sphere with right triangles III: the asymptotically obtuse families Robert J. MacG. Dawson Department of Mathematics and Computing Science Saint Mary s University Halifax, Nova Scotia, Canada

More information

Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity. 7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,

More information

Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

More information

OSTROWSKI FOR NUMBER FIELDS

OSTROWSKI FOR NUMBER FIELDS OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for

More information

8.1 Examples, definitions, and basic properties

8.1 Examples, definitions, and basic properties 8 De Rham cohomology Last updated: May 21, 211. 8.1 Examples, definitions, and basic properties A k-form ω Ω k (M) is closed if dω =. It is exact if there is a (k 1)-form σ Ω k 1 (M) such that dσ = ω.

More information

Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON

Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON Computational Geometry Lab: FEM BASIS FUNCTIONS FOR A TETRAHEDRON John Burkardt Information Technology Department Virginia Tech http://people.sc.fsu.edu/ jburkardt/presentations/cg lab fem basis tetrahedron.pdf

More information

TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS

TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called separation axioms in greater detail. We shall try to understand how these axioms

More information

FIBER PRODUCTS AND ZARISKI SHEAVES

FIBER PRODUCTS AND ZARISKI SHEAVES FIBER PRODUCTS AND ZARISKI SHEAVES BRIAN OSSERMAN 1. Fiber products and Zariski sheaves We recall the definition of a fiber product: Definition 1.1. Let C be a category, and X, Y, Z objects of C. Fix also

More information

Lecture 17 : Equivalence and Order Relations DRAFT

Lecture 17 : Equivalence and Order Relations DRAFT CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

More information

Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion. Ernie Croot. February 3, 2010 Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

More information

Cartesian Products and Relations

Cartesian Products and Relations Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

More information

Planar Graphs. Complement to Chapter 2, The Villas of the Bellevue

Planar Graphs. Complement to Chapter 2, The Villas of the Bellevue Planar Graphs Complement to Chapter 2, The Villas of the Bellevue In the chapter The Villas of the Bellevue, Manori gives Courtel the following definition. Definition A graph is planar if it can be drawn

More information

(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties

(Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties Lecture 1 Convex Sets (Basic definitions and properties; Separation theorems; Characterizations) 1.1 Definition, examples, inner description, algebraic properties 1.1.1 A convex set In the school geometry

More information

Smooth functions statistics

Smooth functions statistics Smooth functions statistics V. I. rnold To describe the topological structure of a real smooth function one associates to it the graph, formed by the topological variety, whose points are the connected

More information

GEOMETRY CONCEPT MAP. Suggested Sequence:

GEOMETRY CONCEPT MAP. Suggested Sequence: CONCEPT MAP GEOMETRY August 2011 Suggested Sequence: 1. Tools of Geometry 2. Reasoning and Proof 3. Parallel and Perpendicular Lines 4. Congruent Triangles 5. Relationships Within Triangles 6. Polygons

More information

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH 31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

More information

INTRODUCTORY SET THEORY

INTRODUCTORY SET THEORY M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

More information

Max-Min Representation of Piecewise Linear Functions

Max-Min Representation of Piecewise Linear Functions Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,

More information