Abstract
The orthogonality of a pair of subspaces was defined and discussed in Chapter 12. There are pairs of subspaces that are not orthogonal but that have a weaker property called essential disjointness—orthogonal subspaces are essentially disjoint, but essentially disjoint subspaces are not necessarily orthogonal. Unlike orthogonality, essential disjointness does not depend on the choice of inner product. The essential disjointness of a pair of subspaces is defined and discussed in the present chapter. The concept of essential disjointness arises in a very natural and fundamental way in results (like those of Sections 17.2, 17.3, and 17.5) on the ranks, row and column spaces, and generalized inverses of partitioned matrices and of sums and products of matrices.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 1997 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Harville, D.A. (1997). Intersections and Sums of Subspaces. In: Matrix Algebra From a Statistician’s Perspective. Springer, New York, NY. https://doi.org/10.1007/0-387-22677-X_17
Download citation
DOI: https://doi.org/10.1007/0-387-22677-X_17
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94978-9
Online ISBN: 978-0-387-22677-4
eBook Packages: Springer Book Archive