Projective Geometry and Spacetime Structure
Total Page:16
File Type:pdf, Size:1020Kb

Load more
Recommended publications
-
Projective Geometry: a Short Introduction
Projective Geometry: A Short Introduction Lecture Notes Edmond Boyer Master MOSIG Introduction to Projective Geometry Contents 1 Introduction 2 1.1 Objective . .2 1.2 Historical Background . .3 1.3 Bibliography . .4 2 Projective Spaces 5 2.1 Definitions . .5 2.2 Properties . .8 2.3 The hyperplane at infinity . 12 3 The projective line 13 3.1 Introduction . 13 3.2 Projective transformation of P1 ................... 14 3.3 The cross-ratio . 14 4 The projective plane 17 4.1 Points and lines . 17 4.2 Line at infinity . 18 4.3 Homographies . 19 4.4 Conics . 20 4.5 Affine transformations . 22 4.6 Euclidean transformations . 22 4.7 Particular transformations . 24 4.8 Transformation hierarchy . 25 Grenoble Universities 1 Master MOSIG Introduction to Projective Geometry Chapter 1 Introduction 1.1 Objective The objective of this course is to give basic notions and intuitions on projective geometry. The interest of projective geometry arises in several visual comput- ing domains, in particular computer vision modelling and computer graphics. It provides a mathematical formalism to describe the geometry of cameras and the associated transformations, hence enabling the design of computational ap- proaches that manipulates 2D projections of 3D objects. In that respect, a fundamental aspect is the fact that objects at infinity can be represented and manipulated with projective geometry and this in contrast to the Euclidean geometry. This allows perspective deformations to be represented as projective transformations. Figure 1.1: Example of perspective deformation or 2D projective transforma- tion. Another argument is that Euclidean geometry is sometimes difficult to use in algorithms, with particular cases arising from non-generic situations (e.g. -
The Projective Geometry of the Spacetime Yielded by Relativistic Positioning Systems and Relativistic Location Systems Jacques Rubin
The projective geometry of the spacetime yielded by relativistic positioning systems and relativistic location systems Jacques Rubin To cite this version: Jacques Rubin. The projective geometry of the spacetime yielded by relativistic positioning systems and relativistic location systems. 2014. hal-00945515 HAL Id: hal-00945515 https://hal.inria.fr/hal-00945515 Submitted on 12 Feb 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The projective geometry of the spacetime yielded by relativistic positioning systems and relativistic location systems Jacques L. Rubin (email: [email protected]) Université de Nice–Sophia Antipolis, UFR Sciences Institut du Non-Linéaire de Nice, UMR7335 1361 route des Lucioles, F-06560 Valbonne, France (Dated: February 12, 2014) As well accepted now, current positioning systems such as GPS, Galileo, Beidou, etc. are not primary, relativistic systems. Nevertheless, genuine, relativistic and primary positioning systems have been proposed recently by Bahder, Coll et al. and Rovelli to remedy such prior defects. These new designs all have in common an equivariant conformal geometry featuring, as the most basic ingredient, the spacetime geometry. In a first step, we show how this conformal aspect can be the four-dimensional projective part of a larger five-dimensional geometry. -
Lecture 3: Geometry
E-320: Teaching Math with a Historical Perspective Oliver Knill, 2010-2015 Lecture 3: Geometry Geometry is the science of shape, size and symmetry. While arithmetic dealt with numerical structures, geometry deals with metric structures. Geometry is one of the oldest mathemati- cal disciplines and early geometry has relations with arithmetics: we have seen that that the implementation of a commutative multiplication on the natural numbers is rooted from an inter- pretation of n × m as an area of a shape that is invariant under rotational symmetry. Number systems built upon the natural numbers inherit this. Identities like the Pythagorean triples 32 +42 = 52 were interpreted geometrically. The right angle is the most "symmetric" angle apart from 0. Symmetry manifests itself in quantities which are invariant. Invariants are one the most central aspects of geometry. Felix Klein's Erlanger program uses symmetry to classify geome- tries depending on how large the symmetries of the shapes are. In this lecture, we look at a few results which can all be stated in terms of invariants. In the presentation as well as the worksheet part of this lecture, we will work us through smaller miracles like special points in triangles as well as a couple of gems: Pythagoras, Thales,Hippocrates, Feuerbach, Pappus, Morley, Butterfly which illustrate the importance of symmetry. Much of geometry is based on our ability to measure length, the distance between two points. A modern way to measure distance is to determine how long light needs to get from one point to the other. This geodesic distance generalizes to curved spaces like the sphere and is also a practical way to measure distances, for example with lasers. -
Notes 20: Afine Geometry
Notes 20: Afine Geometry Example 1. Let C be the curve in R2 defined by x2 + 4xy + y2 + y2 − 1 = 0 = (x + 2y)2 + y2 − 1: If we set u = x + 2y; v = y; we obtain u2 + v2 − 1 = 0 which is a circle in the u; v plane. Let 2 2 F : R ! R ; (x; y) 7! (u = 2x + y; v = y): We look at the geometry of F: Angles: This transformation does not preserve angles. For example the line 2x + y = 0 is mapped to the line u = 0; and the line y = 0 is mapped to v = 0: The two lines in the x − y plane are not orthogonal, while the lines in the u − v plane are orthogonal. Distances: This transformation does not preserve distance. The point A = (−1=2; 1) is mapped to a = (0; 1) and the point B = (0; 0) is mapped to b = (0; 0): the distance AB is not equal to the distance ab: Circles: The curve C is an ellipse with axis along the lines 2x + y = 0 and x = 0: It is mapped to the unit circle in the u − v plane. Lines: The map is a one-to-one onto map that maps lines to lines. What is a Geometry? We can think of a geometry as having three parts: A set of points, a special set of subsets called lines, and a group of transformations of the set of points that maps lines to lines. In the case of Euclidean geometry, the set of points is the familiar plane R2: The special subsets are what we ordinarily call lines. -
(Finite Affine Geometry) References • Bennett, Affine An
MATHEMATICS 152, FALL 2003 METHODS OF DISCRETE MATHEMATICS Outline #7 (Finite Affine Geometry) References • Bennett, Affine and Projective Geometry, Chapter 3. This book, avail- able in Cabot Library, covers all the proofs and has nice diagrams. • “Faculty Senate Affine Geometry”(attached). This has all the steps for each proof, but no diagrams. There are numerous references to diagrams on the course Web site, however, and the combination of this document and the Web site should be all that you need. • The course Web site, AffineDiagrams folder. This has links that bring up step-by-step diagrams for all key results. These diagrams will be available in class, and you are welcome to use them instead of drawing new diagrams on the blackboard. • The Windows application program affine.exe, which can be downloaded from the course Web site. • Data files for the small, medium, and large affine senates. These accom- pany affine.exe, since they are data files read by that program. The file affine.zip has everything. • PHP version of the affine geometry software. This program, written by Harvard undergraduate Luke Gustafson, runs directly off the Web and generates nice diagrams whenever you use affine geometry to do arithmetic. It also has nice built-in documentation. Choose the PHP- Programs folder on the Web site. 1. State the first four of the five axioms for a finite affine plane, using the terms “instructor” and “committee” instead of “point” and “line.” For A4 (Desargues), draw diagrams (or show the ones on the Web site) to illustrate the two cases (three parallel lines and three concurrent lines) in the Euclidean plane. -
Lecture 5: Affine Graphics a Connect the Dots Approach to Two-Dimensional Computer Graphics
Lecture 5: Affine Graphics A Connect the Dots Approach to Two-Dimensional Computer Graphics The lines are fallen unto me in pleasant places; Psalms 16:6 1. Two Shortcomings of Turtle Graphics Two points determine a line. In Turtle Graphics we use this simple fact to draw a line joining the two points at which the turtle is located before and after the execution of each FORWARD command. By programming the turtle to move about and to draw lines in this fashion, we are able to generate some remarkable figures in the plane. Nevertheless, the turtle has two annoying idiosyncrasies. First, the turtle has no memory, so the order in which the turtle encounters points is crucial. Thus, even though the turtle leaves behind a trace of her path, there is no direct command in LOGO to return the turtle to an arbitrary previously encountered location. Second, the turtle is blissfully unaware of the outside universe. The turtle carries her own local coordinate system -- her state -- but the turtle does not know her position relative to any other point in the plane. Turtle geometry is a local, intrinsic geometry; the turtle knows nothing of the extrinsic, global geometry of the external world. The turtle can draw a circle, but the turtle has no idea where the center of the circle might be or even that there is such a concept as a center, a point outside her path around the circumference. These two shortcomings -- no memory and no knowledge of the outside world -- often make the turtle cumbersome to program. -
Essential Concepts of Projective Geomtry
Essential Concepts of Projective Geomtry Course Notes, MA 561 Purdue University August, 1973 Corrected and supplemented, August, 1978 Reprinted and revised, 2007 Department of Mathematics University of California, Riverside 2007 Table of Contents Preface : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : i Prerequisites: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :iv Suggestions for using these notes : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :v I. Synthetic and analytic geometry: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :1 1. Axioms for Euclidean geometry : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2. Cartesian coordinate interpretations : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2 3 3. Lines and planes in R and R : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 II. Affine geometry : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 1. Synthetic affine geometry : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 2. Affine subspaces of vector spaces : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 13 3. Affine bases: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :19 4. Properties of coordinate -
Convex Sets in Projective Space Compositio Mathematica, Tome 13 (1956-1958), P
COMPOSITIO MATHEMATICA J. DE GROOT H. DE VRIES Convex sets in projective space Compositio Mathematica, tome 13 (1956-1958), p. 113-118 <http://www.numdam.org/item?id=CM_1956-1958__13__113_0> © Foundation Compositio Mathematica, 1956-1958, tous droits réser- vés. L’accès aux archives de la revue « Compositio Mathematica » (http: //http://www.compositio.nl/) implique l’accord avec les conditions gé- nérales d’utilisation (http://www.numdam.org/conditions). Toute utili- sation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit conte- nir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ Convex sets in projective space by J. de Groot and H. de Vries INTRODUCTION. We consider the following properties of sets in n-dimensional real projective space Pn(n > 1 ): a set is semiconvex, if any two points of the set can be joined by a (line)segment which is contained in the set; a set is convex (STEINITZ [1]), if it is semiconvex and does not meet a certain P n-l. The main object of this note is to characterize the convexity of a set by the following interior and simple property: a set is convex if and only if it is semiconvex and does not contain a whole (projective) line; in other words: a subset of Pn is convex if and only if any two points of the set can be joined uniquely by a segment contained in the set. In many cases we can prove more; see e.g. -
Affine Geometry
CHAPTER II AFFINE GEOMETRY In the previous chapter we indicated how several basic ideas from geometry have natural interpretations in terms of vector spaces and linear algebra. This chapter continues the process of formulating basic geometric concepts in such terms. It begins with standard material, moves on to consider topics not covered in most courses on classical deductive geometry or analytic geometry, and it concludes by giving an abstract formulation of the concept of geometrical incidence and closely related issues. 1. Synthetic affine geometry In this section we shall consider some properties of Euclidean spaces which only depend upon the axioms of incidence and parallelism Definition. A three-dimensional incidence space is a triple (S; L; P) consisting of a nonempty set S (whose elements are called points) and two nonempty disjoint families of proper subsets of S denoted by L (lines) and P (planes) respectively, which satisfy the following conditions: (I { 1) Every line (element of L) contains at least two points, and every plane (element of P) contains at least three points. (I { 2) If x and y are distinct points of S, then there is a unique line L such that x; y 2 L. Notation. The line given by (I {2) is called xy. (I { 3) If x, y and z are distinct points of S and z 62 xy, then there is a unique plane P such that x; y; z 2 P . (I { 4) If a plane P contains the distinct points x and y, then it also contains the line xy. (I { 5) If P and Q are planes with a nonempty intersection, then P \ Q contains at least two points. -
References Finite Affine Geometry
MATHEMATICS S-152, SUMMER 2005 THE MATHEMATICS OF SYMMETRY Outline #7 (Finite Affine Geometry) References • Bennett, Affine and Projective Geometry, Chapter 3. This book, avail- able in Cabot Library, covers all the proofs and has nice diagrams. • “Faculty Senate Affine Geometry” (attached). This has all the steps for each proof, but no diagrams. There are numerous references to diagrams on the course web site; however, and the combination of this document and the web site should be all that you need. • The course web site, AffineDiagrams folder. This has links that bring up step-by-step diagrams for all key results. These diagrams will be available in class, and you are welcome to use them instead of drawing new diagrams on the blackboard. • The Windows application program, affine.exe, which can be down- loaded from the course web site. • Data files for the small, medium, and large affine senates. These ac- company affine.exe, since they are data files read by that program. The file affine.zip has everything. • PHP version of the affine geometry software. This program, written by Harvard undergraduate Luke Gustafson, runs directly off the web and generates nice diagrams whenever you use affine geometry to do arithmetic. It also has nice built-in documentation. Choose the PHP- Programs folder on the web site. Finite Affine Geometry 1. State the first four of the five axioms for a finite affine plane, using the terms “instructor” and “committee” instead of “point” and “line.” For A4 (Desargues), draw diagrams (or show the ones on the web site) to 1 illustrate the two cases (three parallel lines and three concurrent lines) in the Euclidean plane. -
Positive Geometries and Canonical Forms
Prepared for submission to JHEP Positive Geometries and Canonical Forms Nima Arkani-Hamed,a Yuntao Bai,b Thomas Lamc aSchool of Natural Sciences, Institute for Advanced Study, Princeton, NJ 08540, USA bDepartment of Physics, Princeton University, Princeton, NJ 08544, USA cDepartment of Mathematics, University of Michigan, 530 Church St, Ann Arbor, MI 48109, USA Abstract: Recent years have seen a surprising connection between the physics of scat- tering amplitudes and a class of mathematical objects{the positive Grassmannian, positive loop Grassmannians, tree and loop Amplituhedra{which have been loosely referred to as \positive geometries". The connection between the geometry and physics is provided by a unique differential form canonically determined by the property of having logarithmic sin- gularities (only) on all the boundaries of the space, with residues on each boundary given by the canonical form on that boundary. The structures seen in the physical setting of the Amplituhedron are both rigid and rich enough to motivate an investigation of the notions of \positive geometries" and their associated \canonical forms" as objects of study in their own right, in a more general mathematical setting. In this paper we take the first steps in this direction. We begin by giving a precise definition of positive geometries and canonical forms, and introduce two general methods for finding forms for more complicated positive geometries from simpler ones{via \triangulation" on the one hand, and \push-forward" maps between geometries on the other. We present numerous examples of positive geome- tries in projective spaces, Grassmannians, and toric, cluster and flag varieties, both for the simplest \simplex-like" geometries and the richer \polytope-like" ones. -
Characterization of Quantum Entanglement Via a Hypercube of Segre Embeddings
Characterization of quantum entanglement via a hypercube of Segre embeddings Joana Cirici∗ Departament de Matemàtiques i Informàtica Universitat de Barcelona Gran Via 585, 08007 Barcelona Jordi Salvadó† and Josep Taron‡ Departament de Fisíca Quàntica i Astrofísica and Institut de Ciències del Cosmos Universitat de Barcelona Martí i Franquès 1, 08028 Barcelona A particularly simple description of separability of quantum states arises naturally in the setting of complex algebraic geometry, via the Segre embedding. This is a map describing how to take products of projective Hilbert spaces. In this paper, we show that for pure states of n particles, the corresponding Segre embedding may be described by means of a directed hypercube of dimension (n − 1), where all edges are bipartite-type Segre maps. Moreover, we describe the image of the original Segre map via the intersections of images of the (n − 1) edges whose target is the last vertex of the hypercube. This purely algebraic result is then transferred to physics. For each of the last edges of the Segre hypercube, we introduce an observable which measures geometric separability and is related to the trace of the squared reduced density matrix. As a consequence, the hypercube approach gives a novel viewpoint on measuring entanglement, naturally relating bipartitions with q-partitions for any q ≥ 1. We test our observables against well-known states, showing that these provide well-behaved and fine measures of entanglement. arXiv:2008.09583v1 [quant-ph] 21 Aug 2020 ∗ [email protected] † [email protected] ‡ [email protected] 2 I. INTRODUCTION Quantum entanglement is at the heart of quantum physics, with crucial roles in quantum information theory, superdense coding and quantum teleportation among others.