© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 10 Geometry.

Slides:



Advertisements
Similar presentations
By: Victoria Leffelman.  Any geometry that is different from Euclidean geometry  Consistent system of definitions, assumptions, and proofs that describe.
Advertisements

An Introduction to Topology Linda Green Nueva Math Circle September 30, 2011 Images from virtualmathmuseum.org.
Euler Circuits and Paths
The Seven Bridges Of Konigsberg.
Pamela Leutwyler. A river flows through the town of Konigsburg. 7 bridges connect the 4 land masses. While taking their Sunday stroll, the people of Konigsburg.
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
Chapter 9 Geometry © 2008 Pearson Addison-Wesley. All rights reserved.
Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07.
Topology YAN JIE (Ryan).
Unit 1 Introduction/Constructions
11-1 Space Figures and Cross Sections
Graphs. Graph A “graph” is a collection of “nodes” that are connected to each other Graph Theory: This novel way of solving problems was invented by a.
Study Guide Timeline Euclid’s five axioms (300 BC) From Proclus (400AD) belief that the fifth axiom is derivable from the first four Saccheri (17 th century):
Chapter 9 Geometry © 2008 Pearson Addison-Wesley. All rights reserved.
Non-Euclidean geometry and consistency
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 9.7 Non-Euclidean Geometry and Fractal Geometry.
Chapter 9 Geometry © 2008 Pearson Addison-Wesley. All rights reserved.
The Bridge Obsession Problem By Vamshi Krishna Vedam.
Warm-Up And speaking of the final frontier, what do you think is the shape of space?
Copyright © Cengage Learning. All rights reserved.
Chapter 9: Geometry.
Can you find a way to cross every bridge only once?
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 9 Geometry © 2008 Pearson Addison-Wesley. All rights reserved.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
Vertex – A point at which two or more edges meet Edge – A line segment at which two faces intersect Face – A flat surface Vertices, Edges, Faces.
1 Starter of the day 23 x 27 = x 47 = x 87 = x 55 = x 58 = ???? 54 x 56 = ???? Can you spot the trick for this group of.
Euler Paths & Euler Circuits
Warm-Up The graph shown represents a hyperbola. Draw the solid of revolution formed by rotating the hyperbola around the y -axis.
Euler and Hamilton Paths
Can you connect the dots as shown without taking your pen off the page or drawing the same line twice.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 9.6 Topology.
Euler and Hamilton Paths. Euler Paths and Circuits The Seven bridges of Königsberg a b c d A B C D.
© 2008 Pearson Addison-Wesley. All rights reserved Chapter 1 Section 9-1 Points, Lines, Planes, and Angles.
Solid Geometry - Objectives Classify three-dimensional figures according to their properties. Use nets and cross sections to analyze three-dimensional.
Euclid The famous mathematician Euclid is credited with being the first person to describe geometry.
11.1 Space Figures and Cross Sections A polyhedron is a space figure, or three-dimensional figure, whose surfaces are polygons. Each polygon is a face.
Section 5.1 Rubber Sheet Geometry Discovering the Topological Idea of Equivalence by Distortion. “The whole of mathematics is nothing more than a refinement.
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
Introduction to Graph Theory
Aim: What is an Euler Path and Circuit?
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
Discrete Mathematical Structures: Theory and Applications
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
AND.
MAT119 Asst. Prof. Ferhat PAKDAMAR (Civil Engineer) M Blok - M106 Gebze Technical University Department of Architecture Fall – 2015_2016.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 10 Geometry.
Jose M Bravo Jr. Chapter 11.1 Introduction to Basic Geometry Basic Geometric Concepts.
The Seven Bridges of Konigsberg (circa 1735) In Konigsberg, Germany, a river ran through the city such that in its centre was an island, and after passing.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.2 Euler Paths, and Euler Circuits.
Chapter 6: Graphs 6.1 Euler Circuits
Aim: Graph Theory – Paths & Circuits Course: Math Literacy Do Now: Aim: What are Circuits and Paths? Can you draw this figure without retracing any of.
Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.
What is topology? The word topology comes from the Greek topos, "place," and logos, "study” Topology was known as geometria situs (Latin geometry of place)
Fractals. What do we mean by dimension? Consider what happens when you divide a line segment in two on a figure. How many smaller versions do you get?
3.1 Identify Pairs of Lines and Angles 3.2 Use Parallel Lines and Transversals Objectives: 1.To differentiate between parallel, perpendicular, and skew.
Chapter 9: Geometry. 9.1: Points, Lines, Planes and Angles 9.2: Curves, Polygons and Circles 9.3: Triangles (Pythagoras’ Theorem) 9.4: Perimeter, Area.
STARTER: CAN YOU FIND A WAY OF CROSSING ALL THE BRIDGES EXACTLY ONCE? Here’s what this question would look like drawn as a graph.
The study of points, lines, planes, shapes, and space.
Excursions in Modern Mathematics Sixth Edition
What is topology? The word topology comes from the Greek topos, "place," and logos, "study” Topology was known as geometria situs (Latin geometry of place)
BUT WE’LL TRY TO EXPLAIN
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
12-1 Properties of Polyhedra
10.1 Solid Geometry Geometry.
Excursions in Modern Mathematics Sixth Edition
Konigsberg- in days past.
CHAPTER 15 Graph Theory.
A Survey of Mathematics with Applications
Presentation transcript:

© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 10 Geometry

© 2010 Pearson Prentice Hall. All rights reserved Beyond Euclidean Geometry

© 2010 Pearson Prentice Hall. All rights reserved. Objective 1.Gain an understanding of some of the general ideas of other kinds of geometries. 3

© 2010 Pearson Prentice Hall. All rights reserved. The Geometry of Graphs (Graph Theory) The Swiss mathematician Leonhard Euler (1707 – 1783) proved that it was not possible to stroll through the city of Kőnigsberg, Germany by crossing each of 7 bridges exactly once. His solution opened up a new kind of geometry called graph theory. 4

© 2010 Pearson Prentice Hall. All rights reserved. Graph Definitions Vertex is a point. Edge is a line segment or curve that starts and ends at a vertex. Graph consists of vertices and edges Odd vertex has an odd number of attached edges. Even vertex has an even number of attached edges. 5

© 2010 Pearson Prentice Hall. All rights reserved. Rules of Traversability A graph is traversable if it can be traced without lifting the pencil from the paper and without tracing an edge more than once. 1.A graph with all even vertices is traversable. One can start at any vertex and end where one began. 2.A graph with two odd vertices is traversable. One must start at either of the odd vertices and finish at the other. 3.A graph with more than two odd vertices is not traversable. 6

© 2010 Pearson Prentice Hall. All rights reserved. Example 1: To Traverse or Not to Traverse? Is this graph traversable? Solution Begin by determining if each vertex is even or odd. This graph has two odd vertices, by Euler’s second rule, it is traversable. Describe the path to traverse it. Solution By Euler’s second rule, start at one of the odd vertices and finish at the other. 7

© 2010 Pearson Prentice Hall. All rights reserved. Topology The Study of Shapes Objects are classified according to the number of holes in them, called their genus. Genus is the number of cuts that can be made in the object without cutting the object in two pieces. Topologically Equivalent objects have the same genus. The topology of knots is used to identify viruses and how they invade our cells. 8

© 2010 Pearson Prentice Hall. All rights reserved. Examples of Topological Equivalency The three shapes below have the same genus: 0. No complete cuts can be made without cutting these objects into two pieces. A doughnut and a coffee cup have a genus of 1. 9

© 2010 Pearson Prentice Hall. All rights reserved. Klein Bottle The figures below show the transformation into the figure called the Klein bottle. Because the inside surface loops back on itself to merge with the outside, it has neither an outside nor an inside. It passes through itself without the existence of a hole, which is impossible in three-dimensional space. It only exists when generated on a computer. 10

© 2010 Pearson Prentice Hall. All rights reserved. Comparing the Three Systems of Geometry (Euclidean and non-Euclidean) Euclidean Geometry Euclid (300 B.C.) Hyperbolic Geometry Lobachevsky, Bolyai (1830) Elliptic Geometry Riemann(1850) Given a point not on a line, there is one and only one line through the point parallel to the given line. Given a point not on a line, there are an infinite number of lines through the point that do not intersect the given line. There are no parallel lines Geometry is on a plane: Geometry is on a pseudosphere:Geometry is on a sphere: 11

© 2010 Pearson Prentice Hall. All rights reserved. Comparing the Three Systems of Geometry (Euclidean and non-Euclidean) Euclidean Geometry Euclid (300 B.C.) Hyperbolic Geometry Lobachevsky, Bolyai (1830) Elliptic Geometry Riemann(1850) The sum of the measures of the angles of a triangle is 180 . The sum of the measures of the angles of a triangle is less than 180 . The sum of the measures of the angles of a triangle is greater than 180 . 12

© 2010 Pearson Prentice Hall. All rights reserved. Fractal Geometry Developed by Benoit Mandelbrot using computer programming. Geometry of natural shapes. Self-similarity is the quality of smaller versions of an object appearing in the object itself. Iteration is the process of repeating a rule again and again to create a self-similar fractal. 13