BUT WE’LL TRY TO EXPLAIN

Slides:



Advertisements
Similar presentations
The 7 Bridges of Konigsberg A puzzle in need of solving.
Advertisements

Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
AMDM UNIT 7: Networks and Graphs
Geometry Learning the Names and Characteristics of Shapes
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.
Konigsberg Bridge Problem
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
Decision Maths Graphs Wiltshire Graphs A graph is just a diagram made up of “dots” and “lines”. These are all graphs. The dots are called “nodes” or.
Topology The Edible Lecture (Help yourself, but please don’t eat the lecture just yet.)
Topology YAN JIE (Ryan).
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Shapes and the Coordinate System TEKS 8.6 (A,B) & 8.7 (A,D)
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
Graphs and Euler cycles Let Maths take you Further…
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
Copyright © Cengage Learning. All rights reserved.
Can you find a way to cross every bridge only once?
Presentation On Shapes Basic Summary: On Shapes By Priyank Shah.
Chapter 9 Geometry © 2008 Pearson Addison-Wesley. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 10 Geometry.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
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.
5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 9.6 Topology.
Discrete Math Point, Line, Plane, Space Desert Drawing to One Vanishing Point Project.
CSE 326: Data Structures NP Completeness Ben Lerner Summer 2007.
Unit 4 – Flip, Slide & Turn Vocabulary. Unit 4 – Flip, Slide & Turn - Vocabulary Plane: One of the basic undefined terms of geometry. A plane goes on.
Section 5.1 Rubber Sheet Geometry Discovering the Topological Idea of Equivalence by Distortion. “The whole of mathematics is nothing more than a refinement.
Geometry 1.2 Linear Measure.
Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.
Aim: What is an Euler Path and Circuit?
Discrete Mathematical Structures: Theory and Applications
Vertex-Edge Graphs Euler Paths Euler Circuits. The Seven Bridges of Konigsberg.
Associated Matrices of Vertex Edge Graphs Euler Paths and Circuits Block Days April 30, May 1 and May
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
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.
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.
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.
CS Lecture 22 Graph Theory. Can I draw the above figure in one continuous trace with no line being drawn twice?
Excursions in Modern Mathematics Sixth Edition
Excursions in Modern Mathematics Sixth Edition
3. Transformation
Çizge Algoritmaları.
Euler and Hamiltonian Graphs
Euler and Hamiltonian Graphs
Points, lines and planes
Deductive Reasoning Geometry 2-3.
Konigsberg’s Seven Bridges
Introduction Two basic instruments used in geometry are the straightedge and the compass. A straightedge is a bar or strip of wood, plastic, or metal that.
Introduction to Graph Theory
Tie to LO Are the following triangles congruent? Why or why not?
Hydro Networks in GIS Review of key concepts in Ex 4
Discrete Maths 9. Graphs Objective
By Megan MacGregor Math 10 H
Planarity and Euler’s Formula
Euler Paths and Circuits
Euler Circuits and Paths
Introduction to Graph Theory Euler and Hamilton Paths and Circuits
CSE 373, Copyright S. Tanimoto, 2002 Graphs 1 -
Excursions in Modern Mathematics Sixth Edition
Konigsberg- in days past.
Decision Maths Graphs.
Euler Circuits and Paths
Graph Theory Relations, graphs
What is geometry ? Geometry (from the Ancient Greek: γεωμετρία; geo- "earth", -metron "measurement") is a branch of mathematics concerned with questions.
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
Points, lines and planes
Presentation transcript:

BUT WE’LL TRY TO EXPLAIN TOPOLOGY DEFINITIONS: 1. The study of the properties of geometric figures or solids that are not normally affected by changes in size or shape. 2. The branch of pure mathematics that deals only with the properties of a figure X that hold for every figure into which X can be transformed with a one-to-one correspondence ITS OKAY, NEITHER DO WE! BUT WE’LL TRY TO EXPLAIN ???DON’T UNDERSTAND???

EXPLAINING THE UNEXPLAINABLE STANDARD GEOMETRY VS PROJECTIVE GEOMETRY “While geometry is concerned with properties like absolute position, distance, and parallel lines, topology is concerned with properties like relative position and general shape.” Topology is the branch of mathematical study concerned with the nature and properties of geometrical figures. Topology was a term invented by Solomon Lefschetz, a mathematician who was connected with early topology. Topology has frequently been called rubber-band, rubber-sheet, or rubber-space geometry; it deals with the properties of geometric figures in space that remain unchanged when the space is changed (i.e. bent, twisted, or stretched); the only exceptions are that tearing the space is not allowed, and distinct points in the space cannot be made to coincide. Straightness and linear and angular measure of the plane are some of the properties that are obviously not maintained if the plane is distorted.

EARLY TOPOLOGY An example of an early topological problem is the Königsberg bridge problem: can you cross the seven bridges over the Pregel River without crossing over any bridge twice? Swiss mathematician Leonard Euler showed that the question was equivalent to the following problem: can you draw the graph of Fig. 2 without lifting pencil from paper, and without tracing any edge twice? Euler proved that it was impossible, and that any connected linear graph can be drawn with one stroke without retracing the edges if and only if the graph has either no odd vertices or just two odd vertices, where a vertice is odd if it is the endpoint of an odd number of lines. Because Fig. 2 has four odd vertices, it cannot be drawn by one continuous stroke without retracing lines. FIGURE 1 FIGURE 2

EARLY TOPOLOGY Continued… However, Fig. 3 has two odd vertices, so it is possible to draw that figure continuously without retracing edges. These are examples of early topographical questions, but these problems were the basis for modern topography, and therefore the questions and concepts therein are still explored in topography today.   FIGURE 3 FIGURE 2

EXAMPLES OF TOPOLOGY What topological similarities do the basketball and football have? What topological similarities do the iron and mug have?