In geometry, a flat or Euclidean subspace is a subset of a Euclidean space that is itself a Euclidean space (of lower dimension). The flats in two-dimensional space are points and lines, and the flats in three-dimensional space are points, lines, and planes.
In a n-dimensional space, there are flats of every dimension from 0 to n − 1; flats of dimension n − 1 are called hyperplanes.
Flats are the affine subspaces of Euclidean spaces, which means that they are similar to linear subspaces, except that they need not pass through the origin. Flats occur in linear algebra, as geometric realizations of solution sets of systems of linear equations.
A flat is a manifold and an algebraic variety, and is sometimes called a linear manifold or linear variety to distinguish it from other manifolds or varieties.
A flat can be described by a system of linear equations. For example, a line in two-dimensional space can be described by a single linear equation involving x and y:
In three-dimensional space, a single linear equation involving x, y, and z defines a plane, while a pair of linear equations can be used to describe a line. In general, a linear equation in n variables describes a hyperplane, and a system of linear equations describes the intersection of those hyperplanes. Assuming the equations are consistent and linearly independent, a system of k equations describes a flat of dimension n − k.
A flat can also be described by a system of linear parametric equations. A line can be described by equations involving one parameter:
while the description of a plane would require two parameters:
In general, a parameterization of a flat of dimension k would require parameters t1, ..., tk.
An intersection of flats is either a flat or the empty set.
If each line from one flat is parallel to some line from another flat, then these two flats are parallel. Two parallel flats of the same dimension either coincide or do not intersect; they can be described by two systems of linear equations which differ only in their right-hand sides.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Linear and nonlinear dynamical systems are found in all fields of science and engineering. After a short review of linear system theory, the class will explain and develop the main tools for the quali
In mathematics and theoretical physics, a pseudo-Euclidean space is a finite-dimensional real n-space together with a non-degenerate quadratic form q. Such a quadratic form can, given a suitable choice of basis (e1, ..., en), be applied to a vector x = x1e1 + ⋯ + xnen, giving which is called the scalar square of the vector x. For Euclidean spaces, k = n, implying that the quadratic form is positive-definite. When 0 < k < n, q is an isotropic quadratic form, otherwise it is anisotropic.
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician who works in the field of geometry is called a geometer. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts.
In Euclidean space, the distance from a point to a plane is the distance between a given point and its orthogonal projection on the plane, the perpendicular distance to the nearest point on the plane. It can be found starting with a change of variables that moves the origin to coincide with the given point then finding the point on the shifted plane that is closest to the origin. The resulting point has Cartesian coordinates : The distance between the origin and the point is .
We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...
We generalize the class vectors found in neural networks to linear subspaces (i.e., points in the Grassmann manifold) and show that the Grassmann Class Representation (GCR) enables simultaneous improvement in accuracy and feature transferability. In GCR, e ...
Ieee Computer Soc2023
, , ,
The combination of several interesting characteristics makes metal-organic frameworks (MOFs) a highly sought-after class of nanomaterials for a broad range of applications like gas storage and separation, catalysis, drug delivery, and so on. However, the e ...