Hostname: page-component-745bb68f8f-b6zl4 Total loading time: 0 Render date: 2025-02-11T14:52:24.622Z Has data issue: false hasContentIssue false
  • English
  • Français

Some Necessary Conditions for Common-Factor Analysis

Published online by Cambridge University Press:  01 January 2025

Louis Guttman
Louis Guttman*
Affiliation:
The Israel Institute of Applied Social Research
Get access Rights & Permissions [Opens in a new window]

Abstract

Let R be any correlation matrix of order n, with unity as each main diagonal element. Common-factor analysis, in the Spearman-Thurstone sense, seeks a diagonal matrix U2 such that G = R − U2 is Gramian and of minimum rank r. Let s1 be the number of latent roots of R which are greater than or equal to unity. Then it is proved here that r ≥ s1. Two further lower bounds to r are also established that are better than s1. Simple computing procedures are shown for all three lower bounds that avoid any calculations of latent roots. It is proved further that there are many cases where the rank of all diagonal-free submatrices in R is small, but the minimum rank r for a Gramian G is nevertheless very large compared with n. Heuristic criteria are given for testing the hypothesis that a finite r exists for the infinite universe of content from which the sample of n observed variables is selected; in many cases, the Spearman-Thurstone type of multiple common-factor structure cannot hold.

Type
Original Paper
Information
Psychometrika , Volume 19 , Issue 2 , June 1954 , pp. 149 - 161
Copyright
Copyright © 1954 Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

*

This research was made possible in part by an uncommitted grant-in-aid from the Behavioral Sciences Division of the Ford Foundation.

References

Albert, A. A.. The matrices of factor analysis. Proc. Nat. Acad. Sci., 1944, 30, 90–95CrossRefGoogle ScholarPubMed
Albert, A. A. The minimum rank of a correlation matrix. Proc. Nat. Acad. Sci., 30, 144–148.CrossRefGoogle Scholar
Bôcher, Maxime. Introduction to Higher Algebra, New York: Macmillan, 1907. (Sixteenth printing, 1952)Google Scholar
Guttman, Louis. Multiple rectilinear prediction and the resolution into components. Psychometrika, 1940, 5, 75–99CrossRefGoogle Scholar
Guttman, Louis. General theory and methods for matric factoring. Psychometrika, 1944, 9, 1–16CrossRefGoogle Scholar
Guttman, Louis. A new approach to factor analysis: the radex. In Lazarsfeld, Paul F. (ed.), Mathematical thinking in the social sciences. The Free Press, 1954.Google Scholar
Guttman, Louis. Two new approaches to factor analysis. Office of Naval Research, Annual technical report on project Nonr-731(00), 1953.Google Scholar
Guttman, Louis. Image theory for the structure of quantitative variates. Psychometrika, 1953, 19, 277–296CrossRefGoogle Scholar
Lazarsfeld, Paul F. The logical and mathematical foundation of latent structure analysis. In Stouffer, S. A., et al., Measurement and prediction, Princeton Univ. Press, 1950.Google Scholar
Rosner, Burt. An algebraic solution for the communalities. Psychometrika, 1948, 13, 181–184CrossRefGoogle ScholarPubMed
Thomson, Godfrey. The factorial analysis of human ability. Univ. London Press, 1950.Google Scholar
Thurstone, L. L. Multiple-factor analysis. Univ. Chicago Press, 1947.Google Scholar