Abstract
One of the intriguing questions of factor analysis is the extent to which one can reduce the rank of a symmetric matrix by only changing its diagonal entries. We show in this paper that the set of matrices, which can be reduced to rankr, has positive (Lebesgue) measure if and only ifr is greater or equal to the Ledermann bound. In other words the Ledermann bound is shown to bealmost surely the greatest lower bound to a reduced rank of the sample covariance matrix. Afterwards an asymptotic sampling theory of so-called minimum trace factor analysis (MTFA) is proposed. The theory is based on continuous and differential properties of functions involved in the MTFA. Convex analysis techniques are utilized to obtain conditions for differentiability of these functions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Reference note
Della Riccia, G. & Shapiro, A.Minimum rank and minimum trace of covariance matrices. Department of Mathematics, Ben-Gurion University of the Negev, Beer-Sheva, Israel, 1980.
References
Anderson, T. W.An introduction to multivariate statistical analysis. New York, Wiley, 1958.
Bentler, P. M. A lower-bound method for the dimension-free measurement of internal consistency.Social Science Research, 1972,1, 343–357.
Bentler, P. M. & Woodward, J. A. Inequalities among lower bounds to reliability: with applications to test construction and factor analysis.Psychometrika, 1980,45, 249–267.
Guttman, L. To what extent can communalities reduce rank?Psychometrika, 1958,23, 297–308.
Harman, H.Modern factor analysis. Chicago: University of Chicago Press, 1976.
Ioffe, A. D. & Tihomirov, V. M.Theory of extremal problems. North-Holland Publishing Company, 1979.
Jackson, P. H. & Agunwamba, C. C. Lower bounds for the reliability of the total score on a test composed of nonhomogeneous items: I: Algebraic lower bounds.Psychometrika, 1977,42, 567–578.
Lawley, D. N. & Maxwell, A. E.Factor analysis as a statistical method. London Butterworths, second edition, 1971.
Ledermann, W. On the rank of the reduced correlation matrix in multiple-factor analysis.Psychometrika, 1937,2, 85–93.
Ledermann, W. On a problem concerning matrices with variable diagonal elements.Proceedings of the Royal Society of Edinburgh, 1939,60, 1–17.
Ortega, J. M. & Rheinboldt, W. C.Iterative solution of nonlinear equations in several variables. New York, Academic Press, 1970.
Rao, C. R.Linear statistical inference and its applications. John Wiley and Sons, second edition, New York, 1973.
Rockafellar, R. T.Convex analysis. Princeton, University Press, 1970.
Shapiro, A. Weighted minimum trace factor analysis.Psychometrika, in press.
Sternberg, S.Lectures on differential geometry. Prentice Hall, Inc., Englewood Cliffs, N.J., 1964.
Ten Berge, J. M. F., Snijders, T. A. B. & Zegers, F. E. Computational aspects of the greatest lower bound to the reliability and constrained minimum trace factor analysis.Psychometrika, 1981,46, 201–213.
Woodhouse, B. & Jackson, P. M. Lower bounds for the reliability of the total score on a test composed of nonhomogeneous items: II: A search procedure to locate the greatest lower bound.Psychometrika, 1977,42, 579–591.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shapiro, A. Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis. Psychometrika 47, 187–199 (1982). https://doi.org/10.1007/BF02296274
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02296274