Order, lattices, ordered algebraic structures Lattices: basic notions Example
Lattice of subspaces
Builds on Vector spaceLinear subspace
Example
Let be a vector space over a field , and let be the set of all linear subspaces of , ordered by inclusion. The meet of two subspaces and is , and their join is the sum . For any family of subspaces, the intersection and the span of are subspaces. They are the greatest lower bound and the least upper bound of the family. So is a complete lattice, with least element and greatest element . It is a modular lattice: if , then for every subspace . The inclusion holds because . For the other inclusion, an element of the right side with , has , so .
Remarks
The lattice is not distributive once . In , take three distinct lines , , through . Then , while . When is finite-dimensional, the subspaces of dimension and are the points and lines of the projective space of , and encodes its incidence geometry.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Linear subspace concept
- Vector space concept
- Lattice of subspaces example
Further reading
About this page
| Tag | H5G6TGRQH1 |
|---|---|
| URI | m2://H5G6TGRQH1 |
| Kind | example |
| Writing | W0 stub |
| MSC | 06C05, 06B23, 51A05 |
| Instance of | Complete lattice, Modular lattice |
| Uses | Vector space, Linear subspace |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.