Open main menu

In geometry, a flat is a subset of a Euclidean space that is congruent to 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.[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 occurs in linear algebra, as geometric realizations of solution sets of systems of linear equations.

A flat is manifold and an algebraic variety, and is sometimes called linear manifold or linear variety for distinguishing it from other manifolds or varieties.

Contents

DescriptionsEdit

By equationsEdit

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 nk.

ParametricEdit

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.

Operations and relations on flatsEdit

Intersecting, parallel, and skew flatsEdit

An intersection of flats is either a flat or the empty set.[2]

If every line from the first flat is parallel to some line from the second flat, then these 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.

If flats do not intersect, and no line from the first flat is parallel to a line from the second flat, then these are skew flats. It is possible only if sum of their dimensions is less than dimension of the ambient space.

JoinEdit

For two flats of dimensions k1 and k2 there exists the minimal flat which contains them, of dimension at most k1 + k2 + 1. If two flats intersect, then the dimension of the containing flat equals to k1 + k2 minus the dimension of the intersection.

Properties of operationsEdit

These two operations (referred to as meet and join) make the set of all flats in the Euclidean n-space a lattice and can build systematic coordinates for flats in any dimension, leading to Grassmann coordinates or dual Grassmann coordinates. For example, a line in three-dimensional space is determined by two distinct points or by two distinct planes.

However, the lattice of all flats is not a distributive lattice. If two lines 1 and 2 intersect, then 1 ∩ ℓ2 is a point. If p is a point not lying on the same plane, then (ℓ1 ∩ ℓ2) + p = (ℓ1 + p) ∩ (ℓ2 + p), both representing a line. But when 1 and 2 are parallel, this distributivity fails, giving p on the left-hand side and a third parallel line on the right-hand side.

Euclidean geometryEdit

The aforementioned facts do not depend on the structure being that of Euclidean space (namely, involving Euclidean distance) and are correct in any affine space. In a Euclidean space:

See alsoEdit

NotesEdit

  1. ^ In addition, a whole n-dimensional space, being a subset of itself, may also be considered as an n-dimensional flat.
  2. ^ Can be considered as −1-flat.

ReferencesEdit

  • Heinrich Guggenheimer (1977) Applicable Geometry,page 7, Krieger, New York.
  • Stolfi, Jorge (1991), Oriented Projective Geometry, Academic Press, ISBN 978-0-12-672025-9
    From original Stanford Ph.D. dissertation, Primitives for Computational Geometry, available as DEC SRC Research Report 36.

External linksEdit