Lecture

Isometries in Euclidean Spaces

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-115(b): Advanced linear algebra II

L'objectif du cours est d'introduire les notions de base de l'algèbre linéaire et de démontrer rigoureusement les résultats principaux du sujet. ...

Description

This lecture covers the concept of isometries in Euclidean spaces, which are bijective transformations that preserve distances. Examples include translations and rotations around a fixed point. The lecture also discusses orthogonal symmetry as a linear isometry. Various properties and proofs related to linear isometries are presented, along with the notion of affine transformations. The lecture concludes with a detailed exploration of matrices and their role in defining isometries.

Instructor

Marc Troyanov

Expertise Differential Geometry Geometric Analysis Teaching & PhD Past EPFL PhD Students Olivier Mermoud, Khaled Gafaiti, Serguei Timochine, Stephen Ducret, Ratiba Djelid, Zahra Sinaei, Luc Genton, Adrien Giuliano Marcone, Guillaume Buro, Bruno Luiz Santos Correia Courses Advanced linear algebra II MATH-115(b) The purpose of this course is to introduce some basic notions of linear algebra and to rigorously prove the main results in the field.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Geometry: Symmetry

Related concepts (32)

Invertible matrix

In linear algebra, an n-by-n square matrix A is called invertible (also nonsingular, nondegenerate or (rarely used) regular), if there exists an n-by-n square matrix B such that where In denotes the n-by-n identity matrix and the multiplication used is ordinary matrix multiplication. If this is the case, then the matrix B is uniquely determined by A, and is called the (multiplicative) inverse of A, denoted by A−1. Matrix inversion is the process of finding the matrix B that satisfies the prior equation for a given invertible matrix A.

Definite matrix

In mathematics, a symmetric matrix with real entries is positive-definite if the real number is positive for every nonzero real column vector where is the transpose of . More generally, a Hermitian matrix (that is, a complex matrix equal to its conjugate transpose) is positive-definite if the real number is positive for every nonzero complex column vector where denotes the conjugate transpose of Positive semi-definite matrices are defined similarly, except that the scalars and are required to be positive or zero (that is, nonnegative).

Matrix (mathematics)

In mathematics, a matrix (plural matrices) is a rectangular array or table of numbers, symbols, or expressions, arranged in rows and columns, which is used to represent a mathematical object or a property of such an object. For example, is a matrix with two rows and three columns. This is often referred to as a "two by three matrix", a " matrix", or a matrix of dimension . Without further specifications, matrices represent linear maps, and allow explicit computations in linear algebra.

Linear map

In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism. If a linear map is a bijection then it is called a .

Rotation matrix

In linear algebra, a rotation matrix is a transformation matrix that is used to perform a rotation in Euclidean space. For example, using the convention below, the matrix rotates points in the xy plane counterclockwise through an angle θ about the origin of a two-dimensional Cartesian coordinate system. To perform the rotation on a plane point with standard coordinates v = (x, y), it should be written as a column vector, and multiplied by the matrix R: If x and y are the endpoint coordinates of a vector, where x is cosine and y is sine, then the above equations become the trigonometric summation angle formulae.

Related lectures (64)

Matrices and Orthogonal Transformations MOOC: Linear Algebra (Part 3)

Explores orthogonal matrices and transformations, emphasizing preservation of norms and angles.

Rotations and Symmetries

Covers the preservation of isometry by rotations and symmetries.

Isometries: Definition and Examples

Explores isometries, distinguishing between rotations and reflections, and the preservation of orientation in geometric transformations.

Geometric Transformations in R2 and R3: Visualizations and Rotations

Covers visualizations in orthonormal bases in R2, focusing on rotations and reflections.

Isometries and Orthonormal Bases