Intersections and Sums of Subspaces

David A. Harville ()
Additional contact information
David A. Harville: IBM T.J. Watson Research Center, Mathematical Sciences Department

Chapter 17 in Matrix Algebra From a Statistician’s Perspective, 1997, pp 379-417 from Springer

Abstract: 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.

Date: 1997
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-22677-4_17

Ordering information: This item can be ordered from
http://www.springer.com/9780387226774

DOI: 10.1007/0-387-22677-X_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().