The Perron-Frobenius Theorem. Consider a non-zero linear operator B on R n that sends the non-negative orthant into itself.
|
|
- Gordon Pitts
- 5 years ago
- Views:
Transcription
1 Consider a non-zero linear operator B on R n that sends the non-negative orthant into itself.
2 Consider a non-zero linear operator B on R n that sends the non-negative orthant into itself. Let be the simplex whose corners are the standard basis vectors.
3 Consider a non-zero linear operator B on R n that sends the non-negative orthant into itself. Let be the simplex whose corners are the standard basis vectors. Every ray from the origin into the non-negative orthant hits at exactly one point, so we can identify with the space of such rays.
4 Consider a non-zero linear operator B on R n that sends the non-negative orthant into itself. Let be the simplex whose corners are the standard basis vectors. Every ray from the origin into the non-negative orthant hits at exactly one point, so we can identify with the space of such rays.
5 The map B sends to a triangle floating in the non-negative orthant. B
6 b B The map B sends to a triangle floating in the non-negative orthant. Project that triange back onto along rays through the origin. This gives a map b from to itself, which describes what B does to rays in the non-negative orthant. By construction, b is a projective transformation.
7 B In particular, b is continuous. ince is a convex, compact subset of a Euclidean space, the Brouwer fixed-point theorem guarantees that b has a fixed point. b
8 B In particular, b is continuous. ince is a convex, compact subset of a Euclidean space, the Brouwer fixed-point theorem guarantees that b has a fixed point. b
9 B In particular, b is continuous. ince is a convex, compact subset of a Euclidean space, the Brouwer fixed-point theorem guarantees that b has a fixed point. b
10 B In particular, b is continuous. ince is a convex, compact subset of a Euclidean space, the Brouwer fixed-point theorem guarantees that b has a fixed point. Every fixed point of b corresponds to an eigenray of B. b
11 In general, b can have many fixed points. If some power of B maps the non-negative orthant into the positive orthant, however, then b has just one fixed point.
12 In general, b can have many fixed points. If some power of B maps the non-negative orthant into the positive orthant, however, then b has just one fixed point. To see why, suppose b has another fixed point.
13 In general, b can have many fixed points. If some power of B maps the non-negative orthant into the positive orthant, however, then b has just one fixed point. To see why, suppose b has another fixed point. m Consider the plane M spanned by the corresponding eigenrays, which intersects in a line segment m.
14 m The map B restricts to a linear operator on M. Correspondingly, b restricts to a projective transformation of m. If some power of B sends the non-negative orthant into the positive orthant, b m cannot be the identity. Thus, the two fixed points we started with are the only fixed points of b m. They correspond to two distinct eigenvalues of B M.
15 The fixed point of b m with the larger eigenvalue is attracting, and the one with the smaller eigenvalue is repelling. m
16 m The fixed point of b m with the larger eigenvalue is attracting, and the one with the smaller eigenvalue is repelling. When b m acts, the endpoint of m next to the repelling fixed point will get repelled clear out of the non-negative orthant. But that's impossible! Thus, imagining that b could have more than one fixed point leads only to absurdity.
POLARS AND DUAL CONES
POLARS AND DUAL CONES VERA ROSHCHINA Abstract. The goal of this note is to remind the basic definitions of convex sets and their polars. For more details see the classic references [1, 2] and [3] for polytopes.
More informationε-nets and VC Dimension
ε-nets and VC Dimension Sampling is a powerful idea applied widely in many disciplines, including CS. There are at least two important uses of sampling: estimation and detection. CNN, Nielsen, NYT etc
More information6.896: Topics in Algorithmic Game Theory
6.896: Topics in Algorithmic Game Theory Audiovisual Supplement to Lecture 5 Constantinos Daskalakis On the blackboard we defined multi-player games and Nash equilibria, and showed Nash s theorem that
More informationComputer Graphics MTAT Raimond Tunnel
Computer Graphics MTAT.03.015 Raimond Tunnel Points and Vectors In computer graphics we distinguish: Point a location in space (location vector, kohavektor) Vector a direction in space (direction vector,
More informationThe Crossbar Theorem and Coordinates for Rays
The Crossbar Theorem and Coordinates for Rays Theorem (The Crossbar Theorem: If a point D lies in the interior of pc, then ray Dmeets segment C at some point G interior to C. Note: This is the first of
More informationExercises for Unit I I (Vector algebra and Euclidean geometry)
Exercises for Unit I I (Vector algebra and Euclidean geometry) I I.1 : Approaches to Euclidean geometry Ryan : pp. 5 15 1. What is the minimum number of planes containing three concurrent noncoplanar lines
More informationThe Crossbar Theorem and Coordinates for Rays
The Crossbar Theorem and Coordinates for Rays Theorem (The Crossbar Theorem: If a point D lies in the interior of pc, then ray Dmeets segment C at some point G interior to C. Note: This is the first of
More informationMean value properties on Sierpinski type fractals
Mean value properties on Sierpinski type fractals Hua Qiu (Joint work with Robert S. Strichartz) Department of Mathematics Nanjing University, Cornell University Department of Mathematics, Nanjing University
More informationKAKUTANI S FIXED POINT THEOREM AND THE MINIMAX THEOREM IN GAME THEORY
KAKUTANI S FIXED POINT THEOREM AND THE MINIMAX THEOREM IN GAME THEORY YOUNGGEUN YOO Abstract. The imax theorem is one of the most important results in game theory. It was first introduced by John von Neumann
More informationGENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION
Chapter 4 GENERALIZED CONVEXITY AND OPTIMALITY CONDITIONS IN SCALAR AND VECTOR OPTIMIZATION Alberto Cambini Department of Statistics and Applied Mathematics University of Pisa, Via Cosmo Ridolfi 10 56124
More informationDISCRETIZED BEST-RESPONSE DYNAMICS FOR THE ROCK-PAPER-SCISSORS GAME. Peter Bednarik. Josef Hofbauer. (Communicated by William H.
Journal of Dynamics and Games doi:0.94/jdg.207005 American Institute of Mathematical Sciences Volume 4, Number, January 207 pp. 75 86 DISCRETIZED BEST-RESPONSE DYNAMICS FOR THE ROCK-PAPER-SCISSORS GAME
More informationUnconventional Space-filling Curves
Unconventional Space-filling Curves Austin M. Gross 12 July 2007 A 2-dimensional space-filling curve, here, is a surjective continuous map from an interval to a 2-dimensional space. To construct a new
More informationReflections of planar convex bodies
Reflections of planar convex bodies Rolf Schneider Abstract. It is proved that every convex body in the plane has a point such that the union of the body and its image under reflection in the point is
More informationBrouwer Fixed-Point Theorem
Brouwer Fixed-Point Theorem Colin Buxton Mentor: Kathy Porter May 17, 2016 1 1 Introduction to Fixed Points Fixed points have many applications. One of their prime applications is in the mathematical field
More informationDistance to Circles in 3D
Distance to Circles in 3D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License. To view
More informationJensen s inequality for multivariate medians
Jensen s inequality for multivariate medians Milan Merkle University of Belgrade, Serbia emerkle@etf.rs Given a probability measure µ on Borel sigma-field of R d, and a function f : R d R, the main issue
More informationDecidability of consistency of function and derivative information for a triangle and a convex quadrilateral
Decidability of consistency of function and derivative information for a triangle and a convex quadrilateral Abbas Edalat Department of Computing Imperial College London Abstract Given a triangle in the
More informationPHY411 Lecture notes Part 5
PHY411 Lecture notes Part 5 Alice Quillen January 27, 2016 Contents 0.1 Introduction.................................... 1 1 Symbolic Dynamics 2 1.1 The Shift map.................................. 3 1.2
More informationDistance from Line to Rectangle in 3D
Distance from Line to Rectangle in 3D David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International License.
More informationJakarta International School 8 th Grade AG1
Jakarta International School 8 th Grade AG1 Practice Test - Black Points, Lines, and Planes Name: Date: Score: 40 Goal 5: Solve problems using visualization and geometric modeling Section 1: Points, Lines,
More informationCauchy s Theorem (rigorous) In this lecture, we will study a rigorous proof of Cauchy s Theorem. We start by considering the case of a triangle.
Cauchy s Theorem (rigorous) In this lecture, we will study a rigorous proof of Cauchy s Theorem. We start by considering the case of a triangle. Given a certain complex-valued analytic function f(z), for
More informationHelly's theorem is one of the most important results in the study of combinatorial geometry of convex sets in Euclidean space E".
Discrete Comput Geom 4:279-285 (1989) Ih~,rel~' tk ComlmlatH~val eometrv t/ 198 Spnnger- erlag Ne York Inc ~" Helly-Type Theorems for Spheres Hiroshi Maehara Ryukyu University, Nishihara, Okinawa, Japan
More informationIn English, this means that if we travel on a straight line between any two points in C, then we never leave C.
Convex sets In this section, we will be introduced to some of the mathematical fundamentals of convex sets. In order to motivate some of the definitions, we will look at the closest point problem from
More informationTHE POINCARE-HOPF THEOREM
THE POINCARE-HOPF THEOREM ALEX WRIGHT AND KAEL DIXON Abstract. Mapping degree, intersection number, and the index of a zero of a vector field are defined. The Poincare-Hopf theorem, which states that under
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More information2018 Entrance Examination for the BSc Programmes at CMI. Read the instructions on the front of the booklet carefully!
2018 Entrance Examination for the BSc Programmes at CMI Read the instructions on the front of the booklet carefully! Part A. Write your final answers on page 3. Part A is worth a total of (4 10 = 40) points.
More informationSet, functions and Euclidean space. Seungjin Han
Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,
More informationIowa State University. Instructor: Alex Roitershtein Summer Exam #1. Solutions. x u = 2 x v
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 Exam #1 Solutions This is a take-home examination. The exam includes 8 questions.
More informationMath 341: Convex Geometry. Xi Chen
Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry
More informationTopology Homework Assignment 1 Solutions
Topology Homework Assignment 1 Solutions 1. Prove that R n with the usual topology satisfies the axioms for a topological space. Let U denote the usual topology on R n. 1(a) R n U because if x R n, then
More informationMathematics 530. Practice Problems. n + 1 }
Department of Mathematical Sciences University of Delaware Prof. T. Angell October 19, 2015 Mathematics 530 Practice Problems 1. Recall that an indifference relation on a partially ordered set is defined
More information1 )(y 0) {1}. Thus, the total count of points in (F 1 (y)) is equal to deg y0
1. Classification of 1-manifolds Theorem 1.1. Let M be a connected 1 manifold. Then M is diffeomorphic either to [0, 1], [0, 1), (0, 1), or S 1. We know that none of these four manifolds are not diffeomorphic
More informationMAT 3271: Selected solutions to problem set 7
MT 3271: Selected solutions to problem set 7 Chapter 3, Exercises: 16. Consider the Real ffine Plane (that is what the text means by the usual Euclidean model ), which is a model of incidence geometry.
More informationLECTURE 4 LECTURE OUTLINE
LECTURE 4 LECTURE OUTLINE Relative interior and closure Algebra of relative interiors and closures Continuity of convex functions Closures of functions Reading: Section 1.3 All figures are courtesy of
More informationAlgebraic Topology. Oscar Randal-Williams. or257/teaching/notes/at.pdf
Algebraic Topology Oscar Randal-Williams https://www.dpmms.cam.ac.uk/ or257/teaching/notes/at.pdf 1 Introduction 1 1.1 Some recollections and conventions...................... 2 1.2 Cell complexes.................................
More informationDefinition We say that a topological manifold X is C p if there is an atlas such that the transition functions are C p.
13. Riemann surfaces Definition 13.1. Let X be a topological space. We say that X is a topological manifold, if (1) X is Hausdorff, (2) X is 2nd countable (that is, there is a base for the topology which
More informationII KLUWER ACADEMIC PUBLISHERS. Abstract Convexity and Global Optimization. Alexander Rubinov
Abstract Convexity and Global Optimization by Alexander Rubinov School of Information Technology and Mathematical Sciences, University of Ballarat, Victoria, Australia II KLUWER ACADEMIC PUBLISHERS DORDRECHT
More informationA Discrete Approach to the Poincare-Miranda Theorem
Claremont Colleges Scholarship @ Claremont HMC Senior Theses HMC Student Scholarship 03 A Discrete Approach to the Poincare-Miranda Theorem Connor Thomas Ahlbach Harvey Mudd College Recommended Citation
More informationProblem Set 6: Solutions Math 201A: Fall a n x n,
Problem Set 6: Solutions Math 201A: Fall 2016 Problem 1. Is (x n ) n=0 a Schauder basis of C([0, 1])? No. If f(x) = a n x n, n=0 where the series converges uniformly on [0, 1], then f has a power series
More informationGeometric Incidences and related problems. Shakhar Smorodinsky. (Ben-Gurion University)
Geometric Incidences and related problems Shakhar Smorodinsky (Ben-Gurion University) Note: good & bad news Good news: Last Talk Bad news: Pick your favorite one. The K-set problem (Definition) S = n pts
More informationarxiv: v1 [math.ds] 17 Mar 2010
REAL PROJECTIVE ITERATED FUNCTION SYSTEMS MICHAEL F. BARNSLEY, ANDREW VINCE, AND DAVID C. WILSON arxiv:003.3473v [math.ds] 7 Mar 200 Abstract. This paper contains four main results associated with an attractor
More informationShapley Polygons in 4 4 Games
Games 2010, 1, 189-220; doi:10.3390/g1030189 OPEN ACCESS games ISSN 2073-4336 www.mdpi.com/journal/games Article Shapley Polygons in 4 4 Games Martin Hahn Department of Mathematics, University Vienna,
More informationOptimality Conditions for Nonsmooth Convex Optimization
Optimality Conditions for Nonsmooth Convex Optimization Sangkyun Lee Oct 22, 2014 Let us consider a convex function f : R n R, where R is the extended real field, R := R {, + }, which is proper (f never
More informationGame Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems
Game Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems March 17, 2011 Summary: The ultimate goal of this lecture is to finally prove Nash s theorem. First, we introduce and prove Sperner s
More informationLecture 6: April 25, 2006
Computational Game Theory Spring Semester, 2005/06 Lecture 6: April 25, 2006 Lecturer: Yishay Mansour Scribe: Lior Gavish, Andrey Stolyarenko, Asaph Arnon Partially based on scribe by Nataly Sharkov and
More informationCHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS. W. Erwin Diewert January 31, 2008.
1 ECONOMICS 594: LECTURE NOTES CHAPTER 2: CONVEX SETS AND CONCAVE FUNCTIONS W. Erwin Diewert January 31, 2008. 1. Introduction Many economic problems have the following structure: (i) a linear function
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 informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationLECTURE 15: COMPLETENESS AND CONVEXITY
LECTURE 15: COMPLETENESS AND CONVEXITY 1. The Hopf-Rinow Theorem Recall that a Riemannian manifold (M, g) is called geodesically complete if the maximal defining interval of any geodesic is R. On the other
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationEconomics Noncooperative Game Theory Lectures 3. October 15, 1997 Lecture 3
Economics 8117-8 Noncooperative Game Theory October 15, 1997 Lecture 3 Professor Andrew McLennan Nash Equilibrium I. Introduction A. Philosophy 1. Repeated framework a. One plays against dierent opponents
More informationON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM
ON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM ALEXANDER KUPERS Abstract. These are notes on space-filling curves, looking at a few examples and proving the Hahn-Mazurkiewicz theorem. This theorem
More informationBrouwer Fixed Point Theorem: A Proof for Economics Students
Brouwer Fixed Point Theorem: A Proof for Economics Students Takao Fujimoto Abstract This note is one of the efforts to present an easy and simple proof of Brouwer fixed point theorem, which economics students
More informationAn Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace
An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace Takao Fujimoto Abstract. This research memorandum is aimed at presenting an alternative proof to a well
More information1 Convexity explains SVMs
1 Convexity explains SVMs The convex hull of a set is the collection of linear combinations of points in the set where the coefficients are nonnegative and sum to one. Two sets are linearly separable if
More informationMAE 598: Multi-Robot Systems Fall 2016
MAE 598: Multi-Robot Systems Fall 2016 Instructor: Spring Berman spring.berman@asu.edu Assistant Professor, Mechanical and Aerospace Engineering Autonomous Collective Systems Laboratory http://faculty.engineering.asu.edu/acs/
More informationMarch 25, 2010 CHAPTER 2: LIMITS AND CONTINUITY OF FUNCTIONS IN EUCLIDEAN SPACE
March 25, 2010 CHAPTER 2: LIMIT AND CONTINUITY OF FUNCTION IN EUCLIDEAN PACE 1. calar product in R n Definition 1.1. Given x = (x 1,..., x n ), y = (y 1,..., y n ) R n,we define their scalar product as
More informationLozi-like maps. M. Misiurewicz and S. Štimac. May 13, 2017
Lozi-like maps M. Misiurewicz and S. Štimac May 13, 017 Abstract We define a broad class of piecewise smooth plane homeomorphisms which have properties similar to the properties of Lozi maps, including
More informationLecture 3 Introduction to optimality conditions
TMA947 / MMG621 Nonlinear optimisation Lecture 3 Introduction to optimality conditions Emil Gustavsson October 31, 2013 Local and global optimality We consider an optimization problem which is that to
More informationFall, 2003 CIS 610. Advanced geometric methods. Homework 1. September 30, 2003; Due October 21, beginning of class
Fall, 2003 CIS 610 Advanced geometric methods Homework 1 September 30, 2003; Due October 21, beginning of class You may work in groups of 2 or 3. Please, write up your solutions as clearly and concisely
More informationMath 152: Applicable Mathematics and Computing
Math 152: Applicable Mathematics and Computing May 26, 2017 May 26, 2017 1 / 17 Announcements Homework 6 was posted on Wednesday, due next Wednesday. Last homework is Homework 7, posted next week (due
More informationDistance matrices, random metrics and Urysohn space.
Distance matrices, random metrics and Urysohn space. A. M. VERSHIK 1 arxiv:math/0203008v1 [math.gt] 1 Mar 2002 1 Steklov Institute of Mathematics at St. Petersburg, Fontanka 27, 119011 St. Petersburg,
More informationKing Fahd University of Petroleum and Minerals Prep-Year Math Program Math (001) - Term 181 Recitation (1.1)
Recitation (1.1) Question 1: Find a point on the y-axis that is equidistant from the points (5, 5) and (1, 1) Question 2: Find the distance between the points P(2 x, 7 x) and Q( 2 x, 4 x) where x 0. Question
More informationMath 1553, Introduction to Linear Algebra
Learning goals articulate what students are expected to be able to do in a course that can be measured. This course has course-level learning goals that pertain to the entire course, and section-level
More information+ ε /2N) be the k th interval. k=1. k=1. k=1. k=1
Trevor, Angel, and Michael Measure Zero, the Cantor Set, and the Cantor Function Measure Zero : Definition : Let X be a subset of R, the real number line, X has measure zero if and only if ε > 0 a set
More informationDiscrete Geometry. Problem 1. Austin Mohr. April 26, 2012
Discrete Geometry Austin Mohr April 26, 2012 Problem 1 Theorem 1 (Linear Programming Duality). Suppose x, y, b, c R n and A R n n, Ax b, x 0, A T y c, and y 0. If x maximizes c T x and y minimizes b T
More informationLinear algebra review
EE263 Autumn 2015 S. Boyd and S. Lall Linear algebra review vector space, subspaces independence, basis, dimension nullspace and range left and right invertibility 1 Vector spaces a vector space or linear
More informationLecture 23: Hermite and Bezier Curves
Lecture 23: Hermite and Bezier Curves November 16, 2017 11/16/17 CSU CS410 Fall 2017, Ross Beveridge & Bruce Draper 1 Representing Curved Objects So far we ve seen Polygonal objects (triangles) and Spheres
More informationDef. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =
CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and
More informationExistence Postulate: The collection of all points forms a nonempty set. There is more than one point in that set.
Undefined Terms: Point Line Distance Half-plane Angle measure Area (later) Axioms: Existence Postulate: The collection of all points forms a nonempty set. There is more than one point in that set. Incidence
More informationToday s class. Constrained optimization Linear programming. Prof. Jinbo Bi CSE, UConn. Numerical Methods, Fall 2011 Lecture 12
Today s class Constrained optimization Linear programming 1 Midterm Exam 1 Count: 26 Average: 73.2 Median: 72.5 Maximum: 100.0 Minimum: 45.0 Standard Deviation: 17.13 Numerical Methods Fall 2011 2 Optimization
More informationChapter 3. Betweenness (ordering) A system satisfying the incidence and betweenness axioms is an ordered incidence plane (p. 118).
Chapter 3 Betweenness (ordering) Point B is between point A and point C is a fundamental, undefined concept. It is abbreviated A B C. A system satisfying the incidence and betweenness axioms is an ordered
More informationTMA 4180 Optimeringsteori KARUSH-KUHN-TUCKER THEOREM
TMA 4180 Optimeringsteori KARUSH-KUHN-TUCKER THEOREM H. E. Krogstad, IMF, Spring 2012 Karush-Kuhn-Tucker (KKT) Theorem is the most central theorem in constrained optimization, and since the proof is scattered
More information1 The classification of Monotone sets in the Heisenberg group
1 The classification of Monotone sets in the Heisenberg group after J. Cheeger and B. Kleiner [1] A summary written by Jeehyeon Seo Abstract We show that a monotone set E in the Heisenberg group H is either
More informationExample 2 (new version): the generators are. Example 4: the generators are
First, let us quickly dismiss Example 3 (and Example 6): the second generator may be removed (being the square of the third or, respectively, the fourth one), and then the quotient is clearly the simplest
More informationLIMITS AND DERIVATIVES
2 LIMITS AND DERIVATIVES LIMITS AND DERIVATIVES The intuitive definition of a limit given in Section 2.2 is inadequate for some purposes.! This is because such phrases as x is close to 2 and f(x) gets
More informationconsists of two disjoint copies of X n, each scaled down by 1,
Homework 4 Solutions, Real Analysis I, Fall, 200. (4) Let be a topological space and M be a σ-algebra on which contains all Borel sets. Let m, µ be two positive measures on M. Assume there is a constant
More information2018 Fall 2210Q Section 013 Midterm Exam I Solution
8 Fall Q Section 3 Midterm Exam I Solution True or False questions ( points = points) () An example of a linear combination of vectors v, v is the vector v. True. We can write v as v + v. () If two matrices
More informationIE 521 Convex Optimization
Lecture 1: 16th January 2019 Outline 1 / 20 Which set is different from others? Figure: Four sets 2 / 20 Which set is different from others? Figure: Four sets 3 / 20 Interior, Closure, Boundary Definition.
More informationFinite-Dimensional Cones 1
John Nachbar Washington University March 28, 2018 1 Basic Definitions. Finite-Dimensional Cones 1 Definition 1. A set A R N is a cone iff it is not empty and for any a A and any γ 0, γa A. Definition 2.
More informationNotes on Cellwise Data Interpolation for Visualization Xavier Tricoche
Notes on Cellwise Data Interpolation for Visualization Xavier Tricoche urdue University While the data (computed or measured) used in visualization is only available in discrete form, it typically corresponds
More informationSome Background Math Notes on Limsups, Sets, and Convexity
EE599 STOCHASTIC NETWORK OPTIMIZATION, MICHAEL J. NEELY, FALL 2008 1 Some Background Math Notes on Limsups, Sets, and Convexity I. LIMITS Let f(t) be a real valued function of time. Suppose f(t) converges
More informationMath 302 Outcome Statements Winter 2013
Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a
More informationARE211, Fall 2005 CONTENTS. 5. Characteristics of Functions Surjective, Injective and Bijective functions. 5.2.
ARE211, Fall 2005 LECTURE #18: THU, NOV 3, 2005 PRINT DATE: NOVEMBER 22, 2005 (COMPSTAT2) CONTENTS 5. Characteristics of Functions. 1 5.1. Surjective, Injective and Bijective functions 1 5.2. Homotheticity
More informationSpring, 2006 CIS 610. Advanced Geometric Methods in Computer Science Jean Gallier Homework 1
Spring, 2006 CIS 610 Advanced Geometric Methods in Computer Science Jean Gallier Homework 1 January 23, 2006; Due February 8, 2006 A problems are for practice only, and should not be turned in. Problem
More informationDefinitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg
Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg Undefined Terms: Point, Line, Incident, Between, Congruent. Incidence Axioms:
More information11. Periodicity of Klein polyhedra (28 June 2011) Algebraic irrationalities and periodicity of sails. Let A GL(n + 1, R) be an operator all of
11. Periodicity of Klein polyhedra (28 June 2011) 11.1. lgebraic irrationalities and periodicity of sails. Let GL(n + 1, R) be an operator all of whose eigenvalues are real and distinct. Let us take the
More informationHilbert s Metric and Gromov Hyperbolicity
Hilbert s Metric and Gromov Hyperbolicity Andrew Altman May 13, 2014 1 1 HILBERT METRIC 2 1 Hilbert Metric The Hilbert metric is a distance function defined on a convex bounded subset of the n-dimensional
More informationarxiv: v1 [math.mg] 4 Jan 2013
On the boundary of closed convex sets in E n arxiv:1301.0688v1 [math.mg] 4 Jan 2013 January 7, 2013 M. Beltagy Faculty of Science, Tanta University, Tanta, Egypt E-mail: beltagy50@yahoo.com. S. Shenawy
More informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationTHE JORDAN-BROUWER SEPARATION THEOREM
THE JORDAN-BROUWER SEPARATION THEOREM WOLFGANG SCHMALTZ Abstract. The Classical Jordan Curve Theorem says that every simple closed curve in R 2 divides the plane into two pieces, an inside and an outside
More information16. Time Travel 1 1. Closed Timelike Curves and Time Travel
16. Time Travel 1 1. Closed Timelike Curves and Time Travel Recall: The Einstein cylinder universe is a solution to the Einstein equations (with cosmological constant) that has closed spacelike curves.
More informationThe Convex Hull of Spin Coherent States
The Convex Hull of Spin Coherent States Author: Muhammad Sadiq Supervisor: Prof. Ingemar Bengtsson Stockholm University Fysikum, May 28, 2009. Abstract Pure coherent states are known as the most classical
More informationJOHN C. BAEZ AND KARINE BAGDASARYAN AND PHILIP GIBBS
THE LEBESGUE UNIVERSAL COVERING PROBLEM JOHN C. BAEZ AND KARINE BAGDASARYAN AND PHILIP GIBBS Abstract. In 1914 Lebesgue defined a universal covering to be a convex subset of the plane that contains an
More informationRUTGERS UNIVERSITY GRADUATE PROGRAM IN MATHEMATICS Written Qualifying Examination August, Session 1. Algebra
RUTGERS UNIVERSITY GRADUATE PROGRAM IN MATHEMATICS Written Qualifying Examination August, 2014 Session 1. Algebra The Qualifying Examination consists of three two-hour sessions. This is the first session.
More informationThe extreme rays of the 5 5 copositive cone
The extreme rays of the copositive cone Roland Hildebrand March 8, 0 Abstract We give an explicit characterization of all extreme rays of the cone C of copositive matrices. The results are based on the
More informationFUNDAMENTAL GROUPS AND THE VAN KAMPEN S THEOREM. Contents
FUNDAMENTAL GROUPS AND THE VAN KAMPEN S THEOREM SAMUEL BLOOM Abstract. In this paper, we define the fundamental group of a topological space and explore its structure, and we proceed to prove Van-Kampen
More informationNOTES ON BARNSLEY FERN
NOTES ON BARNSLEY FERN ERIC MARTIN 1. Affine transformations An affine transformation on the plane is a mapping T that preserves collinearity and ratios of distances: given two points A and B, if C is
More informationReadings for Unit I from Ryan (Topics from linear algebra)
Readings for Unit I from Ryan (Topics from linear algebra) I.0 : Background Suggested readings. Ryan : pp. 193 202 General convention. In most cases, the background readings for a section of the course
More informationCongruence. Chapter The Three Points Theorem
Chapter 2 Congruence In this chapter we use isometries to study congruence. We shall prove the Fundamental Theorem of Transformational Plane Geometry, which states that two plane figures are congruent
More information