# ORIENTATIONS. Contents

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 depended on a choice of points in S n 1 in general position. One can still wonder about what happens with other choices of points in general position. To discuss this it helps to generalize the question. Consider the inclusion of pairs D n, S n 1 R n, R n 0 where 0 is the origin. Look at the commutative ladder H S n 1 H D n H D n, S n 1 H 1 S n 1 H 1 D n H R n 0 H R n H R n, R n 0 H 1 R n 0 H 1 R n Since D n and R n are both contractible, the maps labeled 2 are isomorphisms. Since S n 1 R n 0 is a homotopy equivalence, the maps labeled 1 are isomorphisms. It follows from the Five Lemma that the maps labeled 3 are isomorphisms. This proves 4 5 Proposition 1.1. The map induced by the inclusion H D n, S n 1 H R n, R n 0 is an isomorphism. Both groups are 0 unless = n in which case they are Z. Corollary 1.2. If h: R n R m is a homeomorphism, n = m. This is a weak version of Invariance of Domain. Next we would like to identify an explicit generator for H n R n, R n 0. Define an n simplex σ : n R n by σt 0,, t n = t i 1 e i Note σ is the composition of the following maps. First map n to { } X n = x 0,, x n R n each x i 0 and x i 1 by t i x i, i 1. This map is a homeomorphism. Note X n R n is the closure of an open, bounded convex set. Then map X n to R n by the translation T 1 n+1 1,1,,1 where T vx = x + v. Since T v is an isometry, σ n is the closure of an open, bounded convex set. As we saw earlier, this means that i=1 Date: Spring

2 2 ORIENTATIONS the compositon n R n 0 F S n 1 is a homeomorphism where F x = x. Just as above, we x see σ : H n n, n H n R n, R n 0 is an isomorphism and so σ = σ 1 n is a generator. There is no particular reason to focus on 0. Given any point p R n, there is a map T p : R n R n defined by T p v = v +p. It is a homeomorphism since its inverse is T p. Since T p : R n, R n 0 R n, R n p is a homeomorphism of pairs, { H R n, R n Z = n p = 0 otherwise S. ince we have a preferred generator at 0 we define the preferred generator at p to be T p of the preferred generator at 0. It can also be defined as the homology class represented by the simplex T p σ : n R n. Given a generator h p for H n R n, R n p and a generator h q for H n R n, R n q we say that they represent the same orientation provided T q p h p = h q. Otherwise we say they represent the opposite orientation. There is also no need for only one set of points. Given points, p 0,..., p n R n, we say that the ordered collection is in general position provided the n vectors p 1 p 0,..., p n p 0 are linearly independent. Given any points in general position, define a simplex γ p0,,p n : n R n by so Check γ p0,,p n t 0,, t n = p 0 + p k = p k p 0 + γ p0,,p n t 0,, t n = p k p k + t 0 1 p 0 = p k p 0 + p 0 p 0 = p k p 0 Since the p k are in general position, the ordered set of p k p 0 is a basis and so there is a unique linear isomorphism α so that αe k = p k p 0. If A is the affine transformation Ax = αx + p 0 then γ p0,,p n = A σ. Proposition 1.3. If the collection p 0,..., p n R n is in general position, then γ p0,,p n is a generator for H n R n, R n p 0. Proof. Since α is invertible, so is A so A : H n R n, R n 0 H n R n, R n p 0 is an isomorphism and under this isomorphism the generator σ goes to γ p0,,p n. We would like to compare the generator in Proposition 1.3 with the standard generator. By applying T p0 we see that α σ = ɛσ, ɛ = ±1 and γ p0,,p n = ɛt p0 σ. Hence it suffices to study α σ. The general linear group over R has two path components given by the sign of the determinant. Proofs may be found in many books on Lie groups. Brian Hall has some arxiv notes which prove this as an exercise.

3 ORIENTATIONS 3 Hence α is homotopic through elements in GL n R to the identity or to the diagonal matrix M n with all 1 s on the diagonal except for the last where the entry if 1. Hence detm n = 1. Since these maps all leave 0 fixed, a homotopy of α induces a homotopy of pairs R n, R n 0. Since homotopic maps induce the same map in homology, ɛ is constant under such a homotopy. Hence if detα > 0, ɛ = 1. It remains to investigate the case α = M n. For several reasons going forward, we need a second method to acquire isomorphisms from H n R n, R n p to H n R n, R n q. Let B be a closed n-disk containing p. Then R n B R n p is a homotopy equivalence so a Five Lemma argument shows ι B,p : H R n, R n B H R n, R n p is an isomorphism. Given p and q find a disk B containing them both. Then H R n, R n q ι B,q H R n, R n B ι B,p = H R n, R n p = gives an isomorphism between the two homology groups. Check that any two disks which contain the two points gives the same isomorphism. The key point is that if W is a disk containing B, then R n W R n B and ι W,p : R n, R n ι W,B W R n, R n ι B,p B R n, R n p so W and B give the same isomorphism. The one-parameter family T tq p starts at the identity and finishes at T q p. Points move a maximum distance of q p during the homotopy so given B, there exists a bigger disk W with B W and T tq p R n W R n B. Hence we have a homotopy of pairs T tq p : R n, R n W [0, 1] R n, R n B between the inclusion ι W,B : R n, R n W R n, R n B and R n, R n W Consider the diagram H n R n, R n W ι W,p H n R n, R n p ι W,B =T q p ι B,p T q p H n R n, R n B ι B,q H n R n, R n q T q p R n, R n B. Using ι W,B shows that the top triangle commutes. Using T q p shows the outer square commutes and hence H n R n, R n p ι B,p = H n R n, R n B = T q p ι B,q = H n R n, R n q commutes. I have added the subscript s to the maps to emphasize that while the diagram commutes it does not commute because there is an underlying commutative diagram of pairs. Proposition 1.4. Let ψ : n R n map the interior of n to an open subset U of R n. Let p and q U. Then ψ is a relative cycle in R n, R n p and in R n, R n q. Let [ψ] p H n R n, R n p and [ψ] q H n R n, R n q be the corresponding homology classes. Then T q p [ψ]p = [ψ]q.

4 4 ORIENTATIONS Proof. Fix p and let V U be the set of all q U such that T q p [ψ]p = [ψ]q. Note p V. Since U is open, there is a small disk B U centered at p. Note ψ is a relative cycle in R n, R n B and since commutes, q V for all q B. Hence V is open. Let W U be the set of all q U such that T q p [ψ]p [ψ]q. If W is non-empty let q 0 W. Then as above, there is a small disk around q 0 in W so W is open. Since the interior of n is path connected, so is U and therefore either V or W is empty so V = U as required. To investigate how M n acts, it helps to return to the model for generators from Handout 10. There we took p 0 = e 1 and p k = e k, k = 1,..., n and G p0,,p n t 0,, t n = t k p k. Let β p0,,p n = 1 p k be the barycenter of these points. Then the simplex G p0,,p n is G p0,,p n t 0,, t n = p k + β p0,,p n = γ p0,,p n + β p0,,p n p 0. The simplex G p0,,p n is a relative cycle in R n, R n β p0,,p n which represents the same generator as γ p0,,p n. Hence we need to compute ɛ = ±1 such that [G e1,e 1,e n 1,e n ] and ɛ[g e1,e 1,e n 1, e n ] represent the same orientation. Let the coordinates of R n be x 1,, x n. To save on notation let ψ + = G e1,e 1,e n 1,e n and ψ = G e1,e 1,e n 1, e n. The relative cycle ψ + represents a generator of H n R n, R n β + and ψ represents a generator of H n R n, R n β where β ± is the image of the barycenter of n under π ±. In the hyperplane Z = {x n = 0} the images of ψ ± are both the face n, n the face opposite the last vertex. Call this simplex φ 0 : n 1 Z R n. The remaining faces of ψ + all have interiors with x n > 0 and the remaining faces of ψ s all have interiors with x n < 0. Let K + be the faces in ψ + with x n > 0 and let K be the faces in ψ with x n < 0. Then Rn n ψ + = 1 k k n ψ n φ 0 where the sum is over the simplices in K +. Similarly n Rn ψ = 1 k k n ψ + 1 n φ 0 where the sum is over the simplices in K. This picture for n = 2 may help. The green triangle is ψ + and the red one is ψ. Z is the x-axis, y = x 2 = 0 and both p 0 and p 1 lie in Z.

5 ORIENTATIONS 5 p 2 p 0 p 1 p 2 We next replace ψ ± by simplices which have an interior point in common. Let L = Imψ + Imψ R n. Prove L is convex and then Imψ + L is a convex subset. Radial projection from the barycenter of ψ + gives a new simplex ˆψ + whose image is L. As subsets of R n, K = ˆψ + Imφ0. Then 1 + n Rn ˆψ + = 1 k k n ψ n ˆψ+ φ 0 There is also an n-simplex, c defined as follows. The image of ψ is the cone on Imφ 0 coned from 0,, 0, 1. There is a map which just pushes up the cone lines from n to the union of the faces not the last. This is c. Then 2 n Rn c = 1 k k n ψ + 1 n ˆψ+ φ 0 It is important to note that the simplex c is in R n 0. Reversing roles defines ψ ˆ and c + with formulas 1 and 2 + similar to 1 + and 2. Then the classes represented by ψ + and by ˆψ + in H n R n, R n β + are the same. The classes represented by ˆψ + in H n R n, R n β + and H n R n, R n 0 are the same. Hence it suffices to compare the class represented by ˆψ + in H n R n, R n 0 with that represented by ˆψ in H n R n, R n 0. To do this we will calculate the images of these classes in H n 1 R n 0. More precisely, we will compute n ˆψ+ + ˆψ. From equations 1 ± it follows that n Rn ˆψ + + ˆψ = 1 k k n ψ n ˆψ+ φ 0 + From equations 2 it follows that Rn 0 n c + + c = 1 k k n ψ n ˆψ φ k k n ψ + 1 n ˆψ φ 0 1 k k n ψ + 1 n ˆψ+ φ 0

6 6 ORIENTATIONS Since these two sums are the same n Rn ˆψ + + ˆψ is a boundary in R n 0 and so the sum of our two classes is 0 H n 1 R n 0. Since the map H n R n, R n 0 H n 1 R n 0 is an isomorphism, the two generators have opposite sign in H n R n, R n 0. We have proved the following Theorem 1.5. If the collection p 0,..., p n R n is in general position, then γ p0,,p n is the preferred generator for H n R n, R n p 0 if and only if the basis p 1 p 0,... p n p 0 is positive.

### 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.

### 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

### Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1

### 2.3 Convex Constrained Optimization Problems

42 CHAPTER 2. FUNDAMENTAL CONCEPTS IN CONVEX OPTIMIZATION Theorem 15 Let f : R n R and h : R R. Consider g(x) = h(f(x)) for all x R n. The function g is convex if either of the following two conditions

### 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

### ISOMETRIES OF R n KEITH CONRAD

ISOMETRIES OF R n KEITH CONRAD 1. Introduction An isometry of R n is a function h: R n R n that preserves the distance between vectors: h(v) h(w) = v w for all v and w in R n, where (x 1,..., x n ) = x

### 5.3 The Cross Product in R 3

53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or

### Let H and J be as in the above lemma. The result of the lemma shows that the integral

Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;

### Chapter 7. Permutation Groups

Chapter 7 Permutation Groups () We started the study of groups by considering planar isometries In the previous chapter, we learnt that finite groups of planar isometries can only be cyclic or dihedral

### Orthogonal Projections

Orthogonal Projections and Reflections (with exercises) by D. Klain Version.. Corrections and comments are welcome! Orthogonal Projections Let X,..., X k be a family of linearly independent (column) vectors

### Classification of Bundles

CHAPTER 2 Classification of Bundles In this chapter we prove Steenrod s classification theorem of principal G - bundles, and the corresponding classification theorem of vector bundles. This theorem states

### α = u v. In other words, Orthogonal Projection

Orthogonal Projection Given any nonzero vector v, it is possible to decompose an arbitrary vector u into a component that points in the direction of v and one that points in a direction orthogonal to v

### 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,

### The determinant of a skew-symmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14

4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with

### NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

### Section 1.1. Introduction to R n

The Calculus of Functions of Several Variables Section. Introduction to R n Calculus is the study of functional relationships and how related quantities change with each other. In your first exposure to

### Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces

Communications in Mathematical Physics Manuscript-Nr. (will be inserted by hand later) Sets of Fibre Homotopy Classes and Twisted Order Parameter Spaces Stefan Bechtluft-Sachs, Marco Hien Naturwissenschaftliche

### Ideal Class Group and Units

Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

### Chapter 7. Homotopy. 7.1 Basic concepts of homotopy. Example: z dz. z dz = but

Chapter 7 Homotopy 7. Basic concepts of homotopy Example: but γ z dz = γ z dz γ 2 z dz γ 3 z dz. Why? The domain of /z is C 0}. We can deform γ continuously into γ 2 without leaving C 0}. Intuitively,

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### 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

### 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

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### 3. Prime and maximal ideals. 3.1. Definitions and Examples.

COMMUTATIVE ALGEBRA 5 3.1. Definitions and Examples. 3. Prime and maximal ideals Definition. An ideal P in a ring A is called prime if P A and if for every pair x, y of elements in A\P we have xy P. Equivalently,

### Convex Rationing Solutions (Incomplete Version, Do not distribute)

Convex Rationing Solutions (Incomplete Version, Do not distribute) Ruben Juarez rubenj@hawaii.edu January 2013 Abstract This paper introduces a notion of convexity on the rationing problem and characterizes

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### Fiber Polytopes for the Projections between Cyclic Polytopes

Europ. J. Combinatorics (2000) 21, 19 47 Article No. eujc.1999.0319 Available online at http://www.idealibrary.com on Fiber Polytopes for the Projections between Cyclic Polytopes CHRISTOS A. ATHANASIADIS,

### 1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

### 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σ = ω.

### Vector Notation: AB represents the vector from point A to point B on a graph. The vector can be computed by B A.

1 Linear Transformations Prepared by: Robin Michelle King A transformation of an object is a change in position or dimension (or both) of the object. The resulting object after the transformation is called

### 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

### (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

### 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

### Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

### Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### NOTES ON CATEGORIES AND FUNCTORS

NOTES ON CATEGORIES AND FUNCTORS These notes collect basic definitions and facts about categories and functors that have been mentioned in the Homological Algebra course. For further reading about category

### 2.3. Finding polynomial functions. An Introduction:

2.3. Finding polynomial functions. An Introduction: As is usually the case when learning a new concept in mathematics, the new concept is the reverse of the previous one. Remember how you first learned

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### The Ideal Class Group

Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

### 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

### Determinants LECTURE Calculating the Area of a Parallelogram. Definition Let A be a 2 2 matrix. A = The determinant of A is the number

LECTURE 13 Determinants 1. Calculating the Area of a Parallelogram Definition 13.1. Let A be a matrix. [ a c b d ] The determinant of A is the number det A) = ad bc Now consider the parallelogram formed

### Elementary triangle geometry

Elementary triangle geometry Dennis Westra March 26, 2010 bstract In this short note we discuss some fundamental properties of triangles up to the construction of the Euler line. ontents ngle bisectors

### Convex analysis and profit/cost/support functions

CALIFORNIA INSTITUTE OF TECHNOLOGY Division of the Humanities and Social Sciences Convex analysis and profit/cost/support functions KC Border October 2004 Revised January 2009 Let A be a subset of R m

### Math 231b Lecture 35. G. Quick

Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by

### The fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992), 33 37) Bart de Smit

The fundamental group of the Hawaiian earring is not free Bart de Smit The fundamental group of the Hawaiian earring is not free (International Journal of Algebra and Computation Vol. 2, No. 1 (1992),

### Week 5 Integral Polyhedra

Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

### Chapter 6. Cuboids. and. vol(conv(p ))

Chapter 6 Cuboids We have already seen that we can efficiently find the bounding box Q(P ) and an arbitrarily good approximation to the smallest enclosing ball B(P ) of a set P R d. Unfortunately, both

### Lecture 1-1,2. Definition. Sets A and B have the same cardinality if there is an invertible function f : A B.

Topology Summary This is a summary of the results discussed in lectures. These notes will be gradually growing as the time passes by. Most of the time proofs will not be given. You are supposed to be able

### 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

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### Hatcher C A: [012] = [013], B : [123] = [023],

Ex 2..2 Hatcher 2. Let S = [2] [23] 3 = [23] be the union of two faces of the 3-simplex 3. Let be the equivalence relation that identifies [] [3] and [2] [23]. The quotient space S/ is the Klein bottle

### Classification of Cartan matrices

Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms

### 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

### 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,

### 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

### FIBER BUNDLES AND UNIVALENCE

FIBER BUNDLES AND UNIVALENCE TALK BY IEKE MOERDIJK; NOTES BY CHRIS KAPULKIN This talk presents a proof that a universal Kan fibration is univalent. The talk was given by Ieke Moerdijk during the conference

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

### DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### 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

### Section 1.4. Lines, Planes, and Hyperplanes. The Calculus of Functions of Several Variables

The Calculus of Functions of Several Variables Section 1.4 Lines, Planes, Hyperplanes In this section we will add to our basic geometric understing of R n by studying lines planes. If we do this carefully,

### Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

### Monotone maps of R n are quasiconformal

Monotone maps of R n are quasiconformal K. Astala, T. Iwaniec and G. Martin For Neil Trudinger Abstract We give a new and completely elementary proof showing that a δ monotone mapping of R n, n is K quasiconformal

### MATH 131 SOLUTION SET, WEEK 12

MATH 131 SOLUTION SET, WEEK 12 ARPON RAKSIT AND ALEKSANDAR MAKELOV 1. Normalisers We first claim H N G (H). Let h H. Since H is a subgroup, for all k H we have hkh 1 H and h 1 kh H. Since h(h 1 kh)h 1

### Homework from Section Find two positive numbers whose product is 100 and whose sum is a minimum.

Homework from Section 4.5 4.5.3. Find two positive numbers whose product is 100 and whose sum is a minimum. We want x and y so that xy = 100 and S = x + y is minimized. Since xy = 100, x = 0. Thus we have

### Chapter 7: Products and quotients

Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

### Row Ideals and Fibers of Morphisms

Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion

### 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

### Properties of BMO functions whose reciprocals are also BMO

Properties of BMO functions whose reciprocals are also BMO R. L. Johnson and C. J. Neugebauer The main result says that a non-negative BMO-function w, whose reciprocal is also in BMO, belongs to p> A p,and

### Factoring of Prime Ideals in Extensions

Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree

### 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.......................................

### Linear Codes. Chapter 3. 3.1 Basics

Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

### Geometry Chapter 1 Vocabulary. coordinate - The real number that corresponds to a point on a line.

Chapter 1 Vocabulary coordinate - The real number that corresponds to a point on a line. point - Has no dimension. It is usually represented by a small dot. bisect - To divide into two congruent parts.

### 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

### 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,

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### Inverses and powers: Rules of Matrix Arithmetic

Contents 1 Inverses and powers: Rules of Matrix Arithmetic 1.1 What about division of matrices? 1.2 Properties of the Inverse of a Matrix 1.2.1 Theorem (Uniqueness of Inverse) 1.2.2 Inverse Test 1.2.3

### 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

### On The Existence Of Flips

On The Existence Of Flips Hacon and McKernan s paper, arxiv alg-geom/0507597 Brian Lehmann, February 2007 1 Introduction References: Hacon and McKernan s paper, as above. Kollár and Mori, Birational Geometry

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS 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 the identity, such that (i) the

### FIBRATION SEQUENCES AND PULLBACK SQUARES. Contents. 2. Connectivity and fiber sequences. 3

FIRTION SEQUENES ND PULLK SQURES RY MLKIEWIH bstract. We lay out some foundational facts about fibration sequences and pullback squares of topological spaces. We pay careful attention to connectivity ranges

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### Solving Simultaneous Equations and Matrices

Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering

### 1 Norms and Vector Spaces

008.10.07.01 1 Norms and Vector Spaces Suppose we have a complex vector space V. A norm is a function f : V R which satisfies (i) f(x) 0 for all x V (ii) f(x + y) f(x) + f(y) for all x,y V (iii) f(λx)

### Chapter 1: Essentials of Geometry

Section Section Title 1.1 Identify Points, Lines, and Planes 1.2 Use Segments and Congruence 1.3 Use Midpoint and Distance Formulas Chapter 1: Essentials of Geometry Learning Targets I Can 1. Identify,

### 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

### Duality of linear conic problems

Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### Lecture 14: Section 3.3

Lecture 14: Section 3.3 Shuanglin Shao October 23, 2013 Definition. Two nonzero vectors u and v in R n are said to be orthogonal (or perpendicular) if u v = 0. We will also agree that the zero vector in

### WHICH LINEAR-FRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE?

WHICH LINEAR-FRACTIONAL TRANSFORMATIONS INDUCE ROTATIONS OF THE SPHERE? JOEL H. SHAPIRO Abstract. These notes supplement the discussion of linear fractional mappings presented in a beginning graduate course

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### Mathematical Induction. Mary Barnes Sue Gordon

Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

### We know a formula for and some properties of the determinant. Now we see how the determinant can be used.

Cramer s rule, inverse matrix, and volume We know a formula for and some properties of the determinant. Now we see how the determinant can be used. Formula for A We know: a b d b =. c d ad bc c a Can we

### LINEAR ALGEBRA W W L CHEN

LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,