Synthetic Geometry. 1.1 Foundations 1.2 The axioms of projective geometry

Similar documents
A Communications Network???

The statement implies that any three intersection points of two distinct planes lie on a line.

Interpretations and Models. Chapter Axiomatic Systems and Incidence Geometry

Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points.

MAT 3271: Selected Solutions to the Assignment 6

2 Solution of Homework

Inversive Plane Geometry

1 Solution of Homework I

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n.

the projective completion of the affine plane with four points

An Approach to Geometry (stolen in part from Moise and Downs: Geometry)

3D Computer Vision II. Reminder Projective Geometry, Transformations

Hawraa Abbas Almurieb. Axiomatic Systems

Transformations and Isometries

Definition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.

Betweenness and the Crossbar Theorem. Lemma: Let A, B, and C be distinct points. If A*B*C, then neither A*C*B nor B*A*C.

Problem 3.1 (Building up geometry). For an axiomatically built-up geometry, six groups of axioms needed:

Planarity: dual graphs

Definition 2 (Projective plane). A projective plane is a class of points, and a class of lines satisfying the axioms:

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem

Robot Vision: Projective Geometry

Honors 213. Third Hour Exam. Name

Laguerre Planes: A Basic Introduction

CS-9645 Introduction to Computer Vision Techniques Winter 2019

CHAPTER 8. Copyright Cengage Learning. All rights reserved.

1 Appendix to notes 2, on Hyperbolic geometry:

Solutions to the Test. Problem 1. 1) Who is the author of the first comprehensive text on geometry? When and where was it written?

2 Solution of Homework II

Technische Universität München Zentrum Mathematik

Projective geometry and the extended Euclidean plane

HW Graph Theory SOLUTIONS (hbovik)

Provide a drawing. Mark any line with three points in blue color.

FIGURES FOR SOLUTIONS TO SELECTED EXERCISES. V : Introduction to non Euclidean geometry

9.5 Equivalence Relations

Math 443/543 Graph Theory Notes 11: Graph minors and Kuratowski s Theorem

A Short Introduction to Projective Geometry

Chapter 4 - Lines in a Plane. Procedures for Detour Proofs

FGCU Invitational Geometry Individual 2014

GEOMETRY POSTULATES AND THEOREMS. Postulate 1: Through any two points, there is exactly one line.

Conic Duality. yyye

1 Matchings with Tutte s Theorem

The Geodesic Integral on Medial Graphs

Geometry Definitions, Postulates, and Theorems. Chapter 3: Parallel and Perpendicular Lines. Section 3.1: Identify Pairs of Lines and Angles.

Exercise set 2 Solutions

Technische Universität München Zentrum Mathematik

8 Standard Euclidean Triangle Geometry

Adjacent: Two distinct vertices u, v are adjacent if there is an edge with ends u, v. In this case we let uv denote such an edge.

V10 Metabolic networks - Graph connectivity

Duality of Plane Curves

INTRODUCTION TO GRAPH THEORY. 1. Definitions

A Theorem of Ramsey- Ramsey s Number

7. The Gauss-Bonnet theorem

An introduction to Finite Geometry

The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )

2 Geometry Solutions

The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )

Definition For vertices u, v V (G), the distance from u to v, denoted d(u, v), in G is the length of a shortest u, v-path. 1

Some Comments on Leaving Certificate Geometry Work in Progress

Definition (Axiomatic System). An axiomatic system (a set of axioms and their logical consequences) consists of:

On the Minimum Number of Convex Quadrilaterals in Point Sets of Given Numbers of Points

PROPERTIES OF TRIANGLES AND QUADRILATERALS (plus polygons in general)

Math 102A Hw 3 P a (2 points)

A geometric non-existence proof of an extremal additive code

46 Congruence of Triangles

Lecture 6: Faces, Facets

Two distance-regular graphs

K 4 C 5. Figure 4.5: Some well known family of graphs

Rigidity, connectivity and graph decompositions

Euclid s Axioms. 1 There is exactly one line that contains any two points.

Cartesian Products of Graphs and Metric Spaces

Matching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.

Rubber bands. Chapter Rubber band representation

Planar graphs. Chapter 8

Polygon Triangulation

arxiv: v2 [math.co] 13 Aug 2013

Fundamental Properties of Graphs

Math 308, Section 101 Solutions to Study Questions for Final Exam (Thursday, December 16, 2004)

Geometry Review for Semester 1 Final Exam

Pebble Sets in Convex Polygons

The strong chromatic number of a graph

Lecture 5: Duality Theory

Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected

7th Bay Area Mathematical Olympiad

3. Voronoi Diagrams. 3.1 Definitions & Basic Properties. Examples :

Planarity. 1 Introduction. 2 Topological Results

Unit 2A: Angle Pairs and Transversal Notes

2 The Fractional Chromatic Gap

Topics in geometry Exam 1 Solutions 7/8/4

1 Matchings in Graphs

3 Solution of Homework

On the number of distinct directions of planes determined by n points in R 3

Gergonne and Nagel Points for Simplices in the n-dimensional Space

The Farthest Point Delaunay Triangulation Minimizes Angles

TECHNISCHE UNIVERSITÄT BERLIN WS2005 Fachbereich 3 - Mathematik Prof. Dr. U. Pinkall / Charles Gunn Abgabe:

Axioms for polar spaces

Math 443/543 Graph Theory Notes 5: Planar graphs and coloring

Matching Theory. Figure 1: Is this graph bipartite?

Computational Geometry

Simplicial Cells in Arrangements of Hyperplanes

5 Matchings in Bipartite Graphs and Their Applications

Transcription:

Synthetic Geometry 1.1 Foundations 1.2 The axioms of projective geometry

Foundations Def: A geometry is a pair G = (Ω, I), where Ω is a set and I a relation on Ω that is symmetric and reflexive, i.e. 1. If (x,y) I then (y,x) I. 2. (x,x) I for all x Ω.

Examples of Geometries a. 3-dimensional Euclidean geometry Ω = {points, lines, planes} I = points on lines, lines in planes, points in planes b. Cube Ω = {vertices, edges, faces} I = containment c. Rooted tree Ω = {vertices} I = upward path between vertices

Subgeometries and Flags Def: A subgeometry of G = (Ω, I) is G' = (Ω', I') where Ω' Ω and I' is the restriction of I to Ω'. Example: In Euclidean plane, the set of points interior to the unit circle and lines which meet this set. I is induced. Def: Let G = (Ω, I) be a geometry. A flag of G is a set of elements of Ω that are mutually incident. A flag F is called maximal if there is no element x Ω \F such that F {x} is also a flag.

Examples of Flags a. Tetrahedron B A C b. An R 3 maximal flag D {A, ABC} is a flag (not maximal). {A, AC, ABC} is a maximal flag. {A, BCD} is not a flag. {C, AC, BCD} is not a flag.

Rank Def: A geometry G = (Ω, I) has rank r if one can partition Ω into r sets such that each maximal flag of G intersects each of these sets in exactly one element. In particular, each maximal flag has exactly r elements. Examples: a. R 3 has rank 3. b. Tetrahedron geometry has rank 3. c. A rooted tree is not a rank geometry. d. A vector space of "dimension" r is a geometry of rank r with subspaces of dimension i as the partition.

Incidence Structures Any geometry of rank r gives a subgeometry of rank r-1 by removing a type. Thus, any rank r geometry can be considered as a rank 2 geometry. Lemma 1.1.1: Let G be a geometry of rank r. Then no two distinct elements of the same type are incident. Pf: Two incident elements of the same type form a flag, which lies in a maximal flag. This contradicts the definition of a rank r geometry. A rank 2 geometry is often called an incidence structure. The types are called points and blocks. One writes G = (P,B,I).

Axiom 1 Let G be a rank 2 geometry. We will call the blocks of G lines. Axiom 1: For any two distinct points P and Q,! line incident with both, denoted by PQ. Lemma 1.2.1: Two distinct lines are incident with at most one point. Pf: If two distinct lines had two distinct points in common, then this pair of points would violate Axiom 1.

Axiom 2 Axiom 2: (Veblen-Young) If A, B, C and D are 4 points such that AB intersects CD, then AC intersects BD. This axiom was formerly known as Pasch's Axiom, but that is really a misnomer. A B D C

Projective Space Axiom 3: Any line is incident with at least 3 points. So much for graphs! Def: A projective space is a rank 2 geometry that satisfies axioms 1, 2 and 3. A projective space is nondegenerate if it also satisfies: Axiom 4: There exist at least 2 lines.

Projective Planes Def: A projective plane is a projective space in which each two lines have at least one common point. This condition is a stronger version of Axiom 2 and will be referred to as Axiom 2'. Example: The Fano Plane.

The Principle of Duality Def: Let A be a proposition concerning geometries of rank 2, whose elements we shall call points and blocks. We obtain the proposition A dual to A by interchanging the words "point" and "block". Def: Let G be a rank 2 geometry with point set Ω 1, block set Ω 2, and incidence set I. The geometry G dual to G has point set Ω 2, block set Ω 1 and two elements of G are incident if and only if they are incident in G. Note that the definition implies that (G ) = G.

The Principle of Duality Theorem 1.2.2:(Principle of Duality). Let K be a class of rank 2 geometries. Suppose that K has the property: if K contains the geometry G, then it also contains the dual geometry G. Then the following assertion is true: if A is a proposition that is true for all G in K, then A is also true for all G in K.

The Principle of Duality Pf: Let G be any geometry in K. G' = G is also in K. Since the statement A is true in G', A is true in G', but G' = (G ) = G. Thus, A is true in every geometry G in K.

Lemma 1.2.3 Lemma 1.2.3: Any projective plane P also satisfies the propositions that are dual to axioms 1,2',3 and 4. Pf: The dual of axiom 1 is any two distinct lines have exactly one point in common. By lemma 1.2.1, two distinct lines have at most one common point. By axiom 2', they have at least one common point. So, the dual of axiom 1 is true in P. The dual of axiom 2' is any two distinct points are incident with at least one common line. That this is true for P follows from axiom 1.

Lemma 1.2.3 Lemma 1.2.3: Any projective plane P also satisfies the propositions that are dual to axioms 1,2',3 and 4. Pf: (cont.) The dual of axiom 3 is any point is on at least three lines. To see why this is true in P, we first note that for any point P in P there is a line which does not pass through P. Suppose that this was not true. Then all lines would pass through P. By axiom 4 there are two lines, g and h, which pass through P. By axiom 3, there are points Q on g and R on h, neither equal to P. The line QR can not pass through P by axiom 1, a contradiction. Now, let P be an arbitrary point and g a line not passing through P. There are at least three points on g (axiom 3), and joining them to P gives at least three distinct lines through P.

Lemma 1.2.3 Lemma 1.2.3: Any projective plane P also satisfies the propositions that are dual to axioms 1,2',3 and 4. Pf: (cont.) The dual of axiom 4 is there exist two distinct points. Since there is a line (axiom 4) and a line contains at least three points (axiom 3) this statement is clearly true. Note that this lemma proves that every projective plane is also a dual projective plane.

The Principle of Duality for Projective Planes Theorem 1.2.4:(Principle of Duality for Projective Planes). If a proposition A is true for all projective planes then the dual proposition A also holds for all projective planes. We could prove this by showing that the class of all projective planes satisfies the condition in Theorem 1.2.2. Half of that argument is done in Lemma 1.2.3, and we would only have to show that any dual projective plane is a projective plane to complete the proof. This would be very similar to the proof of Lemma 1.2.3. We will, however, give a direct proof of the result which is a bit shorter.

The Principle of Duality for Projective Planes Theorem 1.2.4:(Principle of Duality for Projective Planes). If a proposition A is true for all projective planes then the dual proposition A also holds for all projective planes. Pf: Since A holds for all projective planes P, A holds for all dual projective planes P. Lemma 1.2.3 shows that any projective plane is a dual projective plane, so A must hold in any projective plane. Warning: P and P need not be isomorphic.