DOCSLIB.ORG

Euclidean Space - Wikipedia, the Free Encyclopedia Page 1 of 5

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Euclidean Space - Wikipedia, the Free Encyclopedia Page 1 of 5 Euclidean space - Wikipedia, the free encyclopedia Page 1 of 5 Euclidean space From Wikipedia, the free encyclopedia In mathematics, Euclidean space is the Euclidean plane and three-dimensional space of Euclidean geometry, as well as the generalizations of these notions to higher dimensions. The term “Euclidean” distinguishes these spaces from the curved spaces of non-Euclidean geometry and Einstein's general theory of relativity, and is named for the Greek mathematician Euclid of Alexandria. Classical Greek geometry defined the Euclidean plane and Euclidean three-dimensional space using certain postulates, while the other properties of these spaces were deduced as theorems. In modern mathematics, it is more common to define Euclidean space using Cartesian coordinates and the ideas of analytic geometry. This approach brings the tools of algebra and calculus to bear on questions of geometry, and Every point in three-dimensional has the advantage that it generalizes easily to Euclidean Euclidean space is determined by three spaces of more than three dimensions. coordinates. From the modern viewpoint, there is essentially only one Euclidean space of each dimension. In dimension one this is the real line; in dimension two it is the Cartesian plane; and in higher dimensions it is the real coordinate space with three or more real number coordinates. Thus a point in Euclidean space is a tuple of real numbers, and distances are defined using the Euclidean distance formula. Mathematicians often denote the n-dimensional Euclidean space by , or sometimes if they wish to emphasize its Euclidean nature. Euclidean spaces have finite dimension. Contents 1 Intuitive overview 2 Real coordinate space 3 Euclidean structure 4 Topology of Euclidean space 5 Generalizations 6 See also 7 References Intuitive overview One way to think of the Euclidean plane is as a set of points satisfying certain relationships, expressible in terms of distance and angle. For example, there are two fundamental operations on the plane. One is translation, which means a shifting of the plane so that every point is shifted in the same direction and by the same distance. The other is rotation about a fixed point in the plane, in which every point in the plane turns about that fixed point through the same angle. One of the basic tenets of Euclidean geometry is that two figures (that is, subsets) of the plane should be considered equivalent (congruent) if one can be transformed into the other by some sequence of translations, rotations and reflections. (See Euclidean group .) http://en.wikipedia.org/wiki/Euclidean_space 5/23/2011 Euclidean space - Wikipedia, the free encyclopedia Page 2 of 5 In order to make all of this mathematically precise, one must clearly define the notions of distance, angle, translation, and rotation. The standard way to do this, as carried out in the remainder of this article, is to define the Euclidean plane as a two-dimensional real vector space equipped with an inner product. For then: the vectors in the vector space correspond to the points of the Euclidean plane, the addition operation in the vector space corresponds to translation, and the inner product implies notions of angle and distance, which can be used to define rotation. Once the Euclidean plane has been described in this language, it is actually a simple matter to extend its concept to arbitrary dimensions. For the most part, the vocabulary, formulas, and calculations are not made any more difficult by the presence of more dimensions. (However, rotations are more subtle in high dimensions, and visualizing high-dimensional spaces remains difficult, even for experienced mathematicians.) A final wrinkle is that Euclidean space is not technically a vector space but rather an affine space, on which a vector space acts. Intuitively, the distinction just says that there is no canonical choice of where the origin should go in the space, because it can be translated anywhere. In this article, this technicality is largely ignored. Real coordinate space Let R denote the field of real numbers. For any positive integer n, the set of all n-tuples of real numbers forms an n-dimensional vector space over R, which is denoted Rn and sometimes called real coordinate space . An element of Rn is written n where each xi is a real number. The vector space operations on R are defined by The vector space Rn comes with a standard basis: An arbitrary vector in Rn can then be written in the form http://en.wikipedia.org/wiki/Euclidean_space 5/23/2011 Euclidean space - Wikipedia, the free encyclopedia Page 3 of 5 Rn is the prototypical example of a real n-dimensional vector space. In fact, every real n-dimensional vector space V is isomorphic to Rn. This isomorphism is not canonical, however. A choice of isomorphism is equivalent to a choice of basis for V (by looking at the image of the standard basis for Rn in V). The reason for working with arbitrary vector spaces instead of Rn is that it is often preferable to work in a coordinate-free manner (that is, without choosing a preferred basis). Euclidean structure Euclidean space is more than just a real coordinate space. In order to apply Euclidean geometry one needs to be able to talk about the distances between points and the angles between lines or vectors. The natural way to obtain these quantities is by introducing and using the standard inner product (also known as the dot product) on Rn. The inner product of any two vectors x and y is defined by The result is always a real number. Furthermore, the inner product of x with itself is always nonnegative. This product allows us to define the "length" of a vector x as This length function satisfies the required properties of a norm and is called the Euclidean norm on Rn. The (non-reflex) angle θ (0° ≤ θ ≤ 180°) between x and y is then given by where cos −1 is the arccosine function. Finally, one can use the norm to define a metric (or distance function) on Rn by This distance function is called the Euclidean metric . It can be viewed as a form of the Pythagorean theorem . http://en.wikipedia.org/wiki/Euclidean_space 5/23/2011 Euclidean space - Wikipedia, the free encyclopedia Page 4 of 5 Real coordinate space together with this Euclidean structure is called Euclidean space and often denoted En. (Many authors refer to Rn itself as Euclidean space, with the Euclidean structure being understood). The Euclidean structure makes En an inner product space (in fact a Hilbert space), a normed vector space, and a metric space. Rotations of Euclidean space are then defined as orientation-preserving linear transformations T that preserve angles and lengths: In the language of matrices, rotations are special orthogonal matrices. Topology of Euclidean space Since Euclidean space is a metric space it is also a topological space with the natural topology induced by the metric. The metric topology on En is called the Euclidean topology . A set is open in the Euclidean topology if and only if it contains an open ball around each of its points. The Euclidean topology turns out to be equivalent to the product topology on Rn considered as a product of n copies of the real line R (with its standard topology). An important result on the topology of Rn, that is far from superficial, is Brouwer's invariance of domain. Any subset of Rn (with its subspace topology) that is homeomorphic to another open subset of Rn is itself open. An immediate consequence of this is that Rm is not homeomorphic to Rn if m ≠ n — an intuitively "obvious" result which is nonetheless difficult to prove. Generalizations In modern mathematics, Euclidean spaces form the prototypes for other, more complicated geometric objects. For example, a smooth manifold is a Hausdorff topological space that is locally diffeomorphic to Euclidean space. Diffeomorphism does not respect distance and angle, so these key concepts of Euclidean geometry are lost on a smooth manifold. However, if one additionally prescribes a smoothly varying inner product on the manifold's tangent spaces, then the result is what is called a Riemannian manifold. Put differently, a Riemannian manifold is a space constructed by deforming and patching together Euclidean spaces. Such a space enjoys notions of distance and angle, but they behave in a curved, non-Euclidean manner. The simplest Riemannian manifold, consisting of Rn with a constant inner product, is essentially identical to Euclidean n-space itself. If one alters a Euclidean space so that its inner product becomes negative in one or more directions, then the result is a pseudo-Euclidean space. Smooth manifolds built from such spaces are called pseudo- Riemannian manifolds. Perhaps their most famous application is the theory of relativity, where empty spacetime with no matter is represented by the flat pseudo-Euclidean space called Minkowski space, spacetimes with matter in them form other pseudo-Riemannian manifolds, and gravity corresponds to the curvature of such a manifold. Our universe, being subject to relativity, is not Euclidean. This becomes significant in theoretical http://en.wikipedia.org/wiki/Euclidean_space 5/23/2011 Euclidean space - Wikipedia, the free encyclopedia Page 5 of 5 considerations of astronomy and cosmology , and also in some practical problems such as global positioning and airplane navigation. Nonetheless, a Euclidean model of the universe can still be used to solve many other practical problems with sufficient precision. See also Riemannian geometry Euclidean subspace Cartesian coordinate system Polar coordinate system Hilbert space Tricomplex number References Kelley, John L. (1975). General Topology . Springer-Verlag. ISBN 0-387-90125-6. Munkres, James (1999). Topology . Prentice-Hall. ISBN 0-13-181629-2.
Load more

Recommended publications
  • Real Composition Algebras by Steven Clanton
    Real Composition Algebras by Steven Clanton A Thesis Submitted to the Faculty of The Wilkes Honors College in Partial Fulfillment of the Requirements for the Degree of Bachelor of Arts in Liberal Arts and Sciences with a Concentration in Mathematics Wilkes Honors College of Florida Atlantic University Jupiter, FL May 2009 Real Composition Algebras by Steven Clanton This thesis was prepared under the direction of the candidates thesis advisor, Dr. Ryan Karr, and has been approved by the members of his supervisory committee. It was sub- mitted to the faculty of The Honors College and was accepted in partial fulfillment of the requirements for the degree of Bachelor of Arts in Liberal Arts and Sciences. SUPERVISORY COMMITTEE: Dr. Ryan Karr Dr. Eugene Belogay Dean, Wilkes Honors College Date ii Abstract Author: Steve Clanton Title: Real Composition Algebras Institution: Wilkes Honors College of Florida Atlantic University Thesis Advisor: Dr. Ryan Karr Degree: Bachelor of Arts in Liberal Arts and Sciences Concentration: Mathematics Year: 2009 According to Koecher and Remmert [Ebb91, p. 267], Gauss introduced the \com- position of quadratic forms" to study the representability of natural numbers in binary (rank 2) quadratic forms. In particular, Gauss proved that any positive defi- nite binary quadratic form can be linearly transformed into the two-squares formula 2 2 2 2 2 2 w1 + w2 = (u1 + u2)(v1 + v2). This shows not only the existence of an algebra for every form but also an isomorphism to the complex numbers for each. Hurwitz gen- eralized the \theory of composition" to arbitrary dimensions and showed that exactly four such systems exist: the real numbers, the complex numbers, the quaternions, and octonions [CS03, p.
    [Show full text]
  • A Guide to Topology
    i i “topguide” — 2010/12/8 — 17:36 — page i — #1 i i A Guide to Topology i i i i i i “topguide” — 2011/2/15 — 16:42 — page ii — #2 i i c 2009 by The Mathematical Association of America (Incorporated) Library of Congress Catalog Card Number 2009929077 Print Edition ISBN 978-0-88385-346-7 Electronic Edition ISBN 978-0-88385-917-9 Printed in the United States of America Current Printing (last digit): 10987654321 i i i i i i “topguide” — 2010/12/8 — 17:36 — page iii — #3 i i The Dolciani Mathematical Expositions NUMBER FORTY MAA Guides # 4 A Guide to Topology Steven G. Krantz Washington University, St. Louis ® Published and Distributed by The Mathematical Association of America i i i i i i “topguide” — 2010/12/8 — 17:36 — page iv — #4 i i DOLCIANI MATHEMATICAL EXPOSITIONS Committee on Books Paul Zorn, Chair Dolciani Mathematical Expositions Editorial Board Underwood Dudley, Editor Jeremy S. Case Rosalie A. Dance Tevian Dray Patricia B. Humphrey Virginia E. Knight Mark A. Peterson Jonathan Rogness Thomas Q. Sibley Joe Alyn Stickles i i i i i i “topguide” — 2010/12/8 — 17:36 — page v — #5 i i The DOLCIANI MATHEMATICAL EXPOSITIONS series of the Mathematical Association of America was established through a generous gift to the Association from Mary P. Dolciani, Professor of Mathematics at Hunter College of the City Uni- versity of New York. In making the gift, Professor Dolciani, herself an exceptionally talented and successfulexpositor of mathematics, had the purpose of furthering the ideal of excellence in mathematical exposition.
    [Show full text]
  • 1 Lifts of Polytopes
    Lecture 5: Lifts of polytopes and non-negative rank CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 1 Lifts of polytopes 1.1 Polytopes and inequalities Recall that the convex hull of a subset X n is defined by ⊆ conv X λx + 1 λ x0 : x; x0 X; λ 0; 1 : ( ) f ( − ) 2 2 [ ]g A d-dimensional convex polytope P d is the convex hull of a finite set of points in d: ⊆ P conv x1;:::; xk (f g) d for some x1;:::; xk . 2 Every polytope has a dual representation: It is a closed and bounded set defined by a family of linear inequalities P x d : Ax 6 b f 2 g for some matrix A m d. 2 × Let us define a measure of complexity for P: Define γ P to be the smallest number m such that for some C s d ; y s ; A m d ; b m, we have ( ) 2 × 2 2 × 2 P x d : Cx y and Ax 6 b : f 2 g In other words, this is the minimum number of inequalities needed to describe P. If P is full- dimensional, then this is precisely the number of facets of P (a facet is a maximal proper face of P). Thinking of γ P as a measure of complexity makes sense from the point of view of optimization: Interior point( methods) can efficiently optimize linear functions over P (to arbitrary accuracy) in time that is polynomial in γ P . ( ) 1.2 Lifts of polytopes Many simple polytopes require a large number of inequalities to describe.
    [Show full text]
  • Simplicial Complexes
    46 III Complexes III.1 Simplicial Complexes There are many ways to represent a topological space, one being a collection of simplices that are glued to each other in a structured manner. Such a collection can easily grow large but all its elements are simple. This is not so convenient for hand-calculations but close to ideal for computer implementations. In this book, we use simplicial complexes as the primary representation of topology. Rd k Simplices. Let u0; u1; : : : ; uk be points in . A point x = i=0 λiui is an affine combination of the ui if the λi sum to 1. The affine hull is the set of affine combinations. It is a k-plane if the k + 1 points are affinely Pindependent by which we mean that any two affine combinations, x = λiui and y = µiui, are the same iff λi = µi for all i. The k + 1 points are affinely independent iff P d P the k vectors ui − u0, for 1 ≤ i ≤ k, are linearly independent. In R we can have at most d linearly independent vectors and therefore at most d+1 affinely independent points. An affine combination x = λiui is a convex combination if all λi are non- negative. The convex hull is the set of convex combinations. A k-simplex is the P convex hull of k + 1 affinely independent points, σ = conv fu0; u1; : : : ; ukg. We sometimes say the ui span σ. Its dimension is dim σ = k. We use special names of the first few dimensions, vertex for 0-simplex, edge for 1-simplex, triangle for 2-simplex, and tetrahedron for 3-simplex; see Figure III.1.
    [Show full text]
  • Degrees of Freedom in Quadratic Goodness of Fit
    Submitted to the Annals of Statistics DEGREES OF FREEDOM IN QUADRATIC GOODNESS OF FIT By Bruce G. Lindsay∗, Marianthi Markatouy and Surajit Ray Pennsylvania State University, Columbia University, Boston University We study the effect of degrees of freedom on the level and power of quadratic distance based tests. The concept of an eigendepth index is introduced and discussed in the context of selecting the optimal de- grees of freedom, where optimality refers to high power. We introduce the class of diffusion kernels by the properties we seek these kernels to have and give a method for constructing them by exponentiating the rate matrix of a Markov chain. Product kernels and their spectral decomposition are discussed and shown useful for high dimensional data problems. 1. Introduction. Lindsay et al. (2008) developed a general theory for good- ness of fit testing based on quadratic distances. This class of tests is enormous, encompassing many of the tests found in the literature. It includes tests based on characteristic functions, density estimation, and the chi-squared tests, as well as providing quadratic approximations to many other tests, such as those based on likelihood ratios. The flexibility of the methodology is particularly important for enabling statisticians to readily construct tests for model fit in higher dimensions and in more complex data. ∗Supported by NSF grant DMS-04-05637 ySupported by NSF grant DMS-05-04957 AMS 2000 subject classifications: Primary 62F99, 62F03; secondary 62H15, 62F05 Keywords and phrases: Degrees of freedom, eigendepth, high dimensional goodness of fit, Markov diffusion kernels, quadratic distance, spectral decomposition in high dimensions 1 2 LINDSAY ET AL.
    [Show full text]
  • Molecular Symmetry
    Molecular Symmetry Symmetry helps us understand molecular structure, some chemical properties, and characteristics of physical properties (spectroscopy) – used with group theory to predict vibrational spectra for the identification of molecular shape, and as a tool for understanding electronic structure and bonding. Symmetrical : implies the species possesses a number of indistinguishable configurations. 1 Group Theory : mathematical treatment of symmetry. symmetry operation – an operation performed on an object which leaves it in a configuration that is indistinguishable from, and superimposable on, the original configuration. symmetry elements – the points, lines, or planes to which a symmetry operation is carried out. Element Operation Symbol Identity Identity E Symmetry plane Reflection in the plane σ Inversion center Inversion of a point x,y,z to -x,-y,-z i Proper axis Rotation by (360/n)° Cn 1. Rotation by (360/n)° Improper axis S 2. Reflection in plane perpendicular to rotation axis n Proper axes of rotation (C n) Rotation with respect to a line (axis of rotation). •Cn is a rotation of (360/n)°. •C2 = 180° rotation, C 3 = 120° rotation, C 4 = 90° rotation, C 5 = 72° rotation, C 6 = 60° rotation… •Each rotation brings you to an indistinguishable state from the original. However, rotation by 90° about the same axis does not give back the identical molecule. XeF 4 is square planar. Therefore H 2O does NOT possess It has four different C 2 axes. a C 4 symmetry axis. A C 4 axis out of the page is called the principle axis because it has the largest n . By convention, the principle axis is in the z-direction 2 3 Reflection through a planes of symmetry (mirror plane) If reflection of all parts of a molecule through a plane produced an indistinguishable configuration, the symmetry element is called a mirror plane or plane of symmetry .
    [Show full text]
  • (II) I Main Topics a Rotations Using a Stereonet B
    GG303 Lecture 11 9/4/01 1 ROTATIONS (II) I Main Topics A Rotations using a stereonet B Comments on rotations using stereonets and matrices C Uses of rotation in geology (and engineering) II II Rotations using a stereonet A Best uses 1 Rotation axis is vertical 2 Rotation axis is horizontal (e.g., to restore tilted beds) B Construction technique 1 Find orientation of rotation axis 2 Find angle of rotation and rotate pole to plane (or a linear feature) along a small circle perpendicular to the rotation axis. a For a horizontal rotation axis the small circle is vertical b For a vertical rotation axis the small circle is horizontal 3 WARNING: DON'T rotate a plane by rotating its dip direction vector; this doesn't work (see handout) IIIComments on rotations using stereonets and matrices Advantages Disadvantages Stereonets Good for visualization Relatively slow Can bring into field Need good stereonets, paper Matrices Speed and flexibility Computer really required to Good for multiple rotations cut down on errors A General comments about stereonets vs. rotation matrices 1 With stereonets, an object is usually considered to be rotated and the coordinate axes are held fixed. 2 With rotation matrices, an object is usually considered to be held fixed and the coordinate axes are rotated. B To return tilted bedding to horizontal choose a rotation axis that coincides with the direction of strike. The angle of rotation is the negative of the dip of the bedding (right-hand rule! ) if the bedding is to be rotated back to horizontal and positive if the axes are to be rotated to the plane of the tilted bedding.
    [Show full text]
  • Arxiv:1910.10745V1 [Cond-Mat.Str-El] 23 Oct 2019 2.2 Symmetry-Protected Time Crystals
    A Brief History of Time Crystals Vedika Khemania,b,∗, Roderich Moessnerc, S. L. Sondhid aDepartment of Physics, Harvard University, Cambridge, Massachusetts 02138, USA bDepartment of Physics, Stanford University, Stanford, California 94305, USA cMax-Planck-Institut f¨urPhysik komplexer Systeme, 01187 Dresden, Germany dDepartment of Physics, Princeton University, Princeton, New Jersey 08544, USA Abstract The idea of breaking time-translation symmetry has fascinated humanity at least since ancient proposals of the per- petuum mobile. Unlike the breaking of other symmetries, such as spatial translation in a crystal or spin rotation in a magnet, time translation symmetry breaking (TTSB) has been tantalisingly elusive. We review this history up to recent developments which have shown that discrete TTSB does takes place in periodically driven (Floquet) systems in the presence of many-body localization (MBL). Such Floquet time-crystals represent a new paradigm in quantum statistical mechanics — that of an intrinsically out-of-equilibrium many-body phase of matter with no equilibrium counterpart. We include a compendium of the necessary background on the statistical mechanics of phase structure in many- body systems, before specializing to a detailed discussion of the nature, and diagnostics, of TTSB. In particular, we provide precise definitions that formalize the notion of a time-crystal as a stable, macroscopic, conservative clock — explaining both the need for a many-body system in the infinite volume limit, and for a lack of net energy absorption or dissipation. Our discussion emphasizes that TTSB in a time-crystal is accompanied by the breaking of a spatial symmetry — so that time-crystals exhibit a novel form of spatiotemporal order.
    [Show full text]
  • Higher Dimensional Conundra
    Higher Dimensional Conundra Steven G. Krantz1 Abstract: In recent years, especially in the subject of harmonic analysis, there has been interest in geometric phenomena of RN as N → +∞. In the present paper we examine several spe- cific geometric phenomena in Euclidean space and calculate the asymptotics as the dimension gets large. 0 Introduction Typically when we do geometry we concentrate on a specific venue in a particular space. Often the context is Euclidean space, and often the work is done in R2 or R3. But in modern work there are many aspects of analysis that are linked to concrete aspects of geometry. And there is often interest in rendering the ideas in Hilbert space or some other infinite dimensional setting. Thus we want to see how the finite-dimensional result in RN changes as N → +∞. In the present paper we study some particular aspects of the geometry of RN and their asymptotic behavior as N →∞. We choose these particular examples because the results are surprising or especially interesting. We may hope that they will lead to further studies. It is a pleasure to thank Richard W. Cottle for a careful reading of an early draft of this paper and for useful comments. 1 Volume in RN Let us begin by calculating the volume of the unit ball in RN and the surface area of its bounding unit sphere. We let ΩN denote the former and ωN−1 denote the latter. In addition, we let Γ(x) be the celebrated Gamma function of L. Euler. It is a helpful intuition (which is literally true when x is an 1We are happy to thank the American Institute of Mathematics for its hospitality and support during this work.
    [Show full text]
  • Module 2 : Fundamentals of Vector Spaces Section 2 : Vector Spaces
    Module 2 : Fundamentals of Vector Spaces Section 2 : Vector Spaces 2. Vector Spaces The concept of a vector space will now be formally introduced. This requires the concept of closure and field. Definition 1 (Closure) A set is said to be closed under an operation when any two elements of the set subject to the operation yields a third element belonging to the same set. Example 2 The set of integers is closed under addition, multiplication and subtraction. However, this set is not closed under division. Example 3 The set of real numbers ( ) and the set of complex numbers (C) are closed under addition, subtraction, multiplication and division. Definition 4 (Field) A field is a set of elements closed under addition, subtraction, multiplication and division. Example 5 The set of real numbers ( ) and the set of complex numbers ( ) are scalar fields. However, the set of integers is not a field. A vector space is a set of elements, which is closed under addition and scalar multiplication. Thus, associated with every vector space is a set of scalars (also called as scalar field or coefficient field) used to define scalar multiplication on the space. In functional analysis, the scalars will be always taken to be the set of real numbers ( ) or complex numbers ( ). Definition 6 (Vector Space): A vector space is a set of elements called vectors and scalar field together with two operations. The first operation is called addition which associates with any two vectors a vector , the sum of and . The second operation is called scalar multiplication, which associates with any vector and any scalar a vector (a scalar multiple of by Thus, when is a linear vector space, given any vectors and any scalars the element .
    [Show full text]
  • Euler Quaternions
    Four different ways to represent rotation my head is spinning... The space of rotations SO( 3) = {R ∈ R3×3 | RRT = I,det(R) = +1} Special orthogonal group(3): Why det( R ) = ± 1 ? − = − Rotations preserve distance: Rp1 Rp2 p1 p2 Rotations preserve orientation: ( ) × ( ) = ( × ) Rp1 Rp2 R p1 p2 The space of rotations SO( 3) = {R ∈ R3×3 | RRT = I,det(R) = +1} Special orthogonal group(3): Why it’s a group: • Closed under multiplication: if ∈ ( ) then ∈ ( ) R1, R2 SO 3 R1R2 SO 3 • Has an identity: ∃ ∈ ( ) = I SO 3 s.t. IR1 R1 • Has a unique inverse… • Is associative… Why orthogonal: • vectors in matrix are orthogonal Why it’s special: det( R ) = + 1 , NOT det(R) = ±1 Right hand coordinate system Possible rotation representations You need at least three numbers to represent an arbitrary rotation in SO(3) (Euler theorem). Some three-number representations: • ZYZ Euler angles • ZYX Euler angles (roll, pitch, yaw) • Axis angle One four-number representation: • quaternions ZYZ Euler Angles φ = θ rzyz ψ φ − φ cos sin 0 To get from A to B: φ = φ φ Rz ( ) sin cos 0 1. Rotate φ about z axis 0 0 1 θ θ 2. Then rotate θ about y axis cos 0 sin θ = ψ Ry ( ) 0 1 0 3. Then rotate about z axis − sinθ 0 cosθ ψ − ψ cos sin 0 ψ = ψ ψ Rz ( ) sin cos 0 0 0 1 ZYZ Euler Angles φ θ ψ Remember that R z ( ) R y ( ) R z ( ) encode the desired rotation in the pre- rotation reference frame: φ = pre−rotation Rz ( ) Rpost−rotation Therefore, the sequence of rotations is concatentated as follows: (φ θ ψ ) = φ θ ψ Rzyz , , Rz ( )Ry ( )Rz ( ) φ − φ θ θ ψ − ψ cos sin 0 cos 0 sin cos sin 0 (φ θ ψ ) = φ φ ψ ψ Rzyz , , sin cos 0 0 1 0 sin cos 0 0 0 1− sinθ 0 cosθ 0 0 1 − − − cφ cθ cψ sφ sψ cφ cθ sψ sφ cψ cφ sθ (φ θ ψ ) = + − + Rzyz , , sφ cθ cψ cφ sψ sφ cθ sψ cφ cψ sφ sθ − sθ cψ sθ sψ cθ ZYX Euler Angles (roll, pitch, yaw) φ − φ cos sin 0 To get from A to B: φ = φ φ Rz ( ) sin cos 0 1.
    [Show full text]
  • General Topology
    General Topology Tom Leinster 2014{15 Contents A Topological spaces2 A1 Review of metric spaces.......................2 A2 The definition of topological space.................8 A3 Metrics versus topologies....................... 13 A4 Continuous maps........................... 17 A5 When are two spaces homeomorphic?................ 22 A6 Topological properties........................ 26 A7 Bases................................. 28 A8 Closure and interior......................... 31 A9 Subspaces (new spaces from old, 1)................. 35 A10 Products (new spaces from old, 2)................. 39 A11 Quotients (new spaces from old, 3)................. 43 A12 Review of ChapterA......................... 48 B Compactness 51 B1 The definition of compactness.................... 51 B2 Closed bounded intervals are compact............... 55 B3 Compactness and subspaces..................... 56 B4 Compactness and products..................... 58 B5 The compact subsets of Rn ..................... 59 B6 Compactness and quotients (and images)............. 61 B7 Compact metric spaces........................ 64 C Connectedness 68 C1 The definition of connectedness................... 68 C2 Connected subsets of the real line.................. 72 C3 Path-connectedness.......................... 76 C4 Connected-components and path-components........... 80 1 Chapter A Topological spaces A1 Review of metric spaces For the lecture of Thursday, 18 September 2014 Almost everything in this section should have been covered in Honours Analysis, with the possible exception of some of the examples. For that reason, this lecture is longer than usual. Definition A1.1 Let X be a set. A metric on X is a function d: X × X ! [0; 1) with the following three properties: • d(x; y) = 0 () x = y, for x; y 2 X; • d(x; y) + d(y; z) ≥ d(x; z) for all x; y; z 2 X (triangle inequality); • d(x; y) = d(y; x) for all x; y 2 X (symmetry).
    [Show full text]