A note on r-maximal subspaces of V∞
✍ Scribed by David R. Guichard
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 573 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Any nonvoid lattice of subspaces from R" is known to be a complete lattice, and hence it has a largest and smallest element. Here we show that for a specific class of subspaces also the converse is true. If this class has a largest and a smallest element, then it is a complete lattice. Within the co
Given a (finite or infinite) set X, a collection C P(X ) of subsets of X is called a hierarchy if it satisfies the condition ` '' In this note, we characterize maximal hierarchies as set systems that contain the empty set, the full set, and all one-element sets, and in addition satisfy either one of