Abstract
First we state (and shall later prove) that in any matrix of any order, square or otherwise, the maximum number of linearly independent rows that can be found is also the maximum number of linearly independent columns. If, for example, in a 7 × 5 matrix one can find 3, but no more than 3, linearly independent rows then one will be able to find 3, but no more than 3, linearly independent columns.
To make the third she join’d the former two.
J. Dbyden
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
Copyright information
© 1969 J. Parry Lewis
About this chapter
Cite this chapter
Lewis, J.P. (1969). Equivalence, Partitioning and Rank. In: An Introduction to Mathematics. Palgrave Macmillan, London. https://doi.org/10.1007/978-1-349-15324-4_31
Download citation
DOI: https://doi.org/10.1007/978-1-349-15324-4_31
Publisher Name: Palgrave Macmillan, London
Print ISBN: 978-0-333-01021-1
Online ISBN: 978-1-349-15324-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)