Some Necessary Conditions for Common-Factor Analysis
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
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 U 2 such that G = R − U 2 is Gramian and of minimum rank r . Let s 1 be the number of latent roots of R which are greater than or equal to unity. Then it is proved here that r ≥ s 1 . Two further lower bounds to r are also established that are better than s 1 . 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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The eigenvalue criterion suggested the retention of 5 factors (Guttman, 1954; Kaiser, 1960).”
From Psychotic-Like Experiences at the Healthy End of the Psychosis Continuum (2017) · cites this paper as Guttman, 1954
Citations
Cites
(2007) · Encyclopedia of Measurement and Statistics · doi:10.4135/9781412952644.n300 · Cited by 2,578
Introduction to Higher Algebra
(1964) · Elsevier eBooks · doi:10.1016/c2013-0-10019-0 · Cited by 333
Image Theory for the Structure of Quantitative Variates
Guttman, L. (1953) · Psychometrika · doi:10.1007/bf02289264 · Cited by 285 · cited 4×
“In many cases, an order-factor system, such as the radex, may be more appropriate than a finite common-factor system (5, 7, 8 ).”
BackgroundSelf-citationThe Factorial Analysis of Human Ability.
Tukey, J. W., & Thomson, G. H. (1947) · Journal of the American Statistical Association · doi:10.2307/2280209 · Cited by 220
Introduction to Higher Algebra.
Thompson, R., & Bôcher, M. (1984) · American Mathematical Monthly · doi:10.2307/2322126 · Cited by 104
General Theory and Methods for Matric Factoring
Guttman, L. (1944) · Psychometrika · doi:10.1007/bf02288709 · Cited by 82 · cited 3×
“3), states that each of the three frequencies on the left of ( 5 ) is invariant under congruence transformations of S. That is, if P in (4) is replaced by any real non-singular P* that results in D being replaced by any other diagonal matrix D*, then the frequencies of positive, negative, and zero main diagonal elemen…”
BackgroundSelf-citationMultiple Rectilinear Prediction and the Resolution into Components
Guttman, L. (1940) · Psychometrika · doi:10.1007/bf02287866 · Cited by 75
Self-citationMultiple Rectilinear Prediction and the Resolution into Components: II
Guttman, L., & Cohen, J. (1943) · Psychometrika · doi:10.1007/bf02288701 · Cited by 67 · cited 4×
“3), states that each of the three frequencies on the left of (5) is invariant under congruence transformations of S. That is, if P in ( 4 ) is replaced by any real non-singular P* that results in D being replaced by any other diagonal matrix D*, then the frequencies of positive, negative, and zero main diagonal elemen…”
BackgroundSelf-citationThe Matrices of Factor Analysis
Albert, A. A. (1944) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.30.4.90 · Cited by 35 · cited 2×
“That the elements of a U 2 satisfy restrictions ( 1 ) is no guarantee that the corresponding G in (2) is Gramian.”
BackgroundThe Minimum Rank of a Correlation Matrix
Albert, A. A. (1944) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.30.6.144 · Cited by 31 · cited 13×
“The minimum rank for a Gramian G for any R, as in ( 2 ), is not greater than n - 1.”
BackgroundMethodInfluential
Research works printed but not linked: 3
- 7. Guttman, Louis . Two new approaches to factor analysis. Office of Naval Research, Annual technical report on project Nonr-731(00), 1953.
- Guttman, 1954, Mathematical thinking in the social sciences
- Lazarsfeld, 1950, Measurement and prediction
Cited by
The Scree Test For The Number Of Factors
Cattell, R. B. (1966) · Multivariate Behavioral Research · doi:10.1207/s15327906mbr0102_10 · Cited by 13,554
Evaluating the use of exploratory factor analysis in psychological research.
Fabrigar, L. R., Wegener, D. T., MacCallum, R. C., & Strahan, E. J. (1999) · Psychological Methods · doi:10.1037/1082-989x.4.3.272 · Cited by 9,587
A Rationale and Test for the Number of Factors in Factor Analysis
Horn, J. L. (1965) · Psychometrika · doi:10.1007/bf02289447 · Cited by 8,714
“Guttman [3] has shown that the "weakest" of three lower bound estimates for the minimum rank of a Gramian R is given by the number of roots of R (with ones in the principal diagonal) which are greater than or equal to unity.”
BackgroundA Second Generation Little Jiffy
Kaiser, H. F. (1970) · Psychometrika · doi:10.1007/bf02291817 · Cited by 4,785
Factor analysis in the development and refinement of clinical assessment instruments.
Floyd, F. J., & Widaman, K. F. (1995) · Psychological Assessment · doi:10.1037/1040-3590.7.3.286 · Cited by 3,970
Metadata
- Authors
- Guttman, L.
- Corresponding author
- Guttman, Louis
- Venue
- Psychometrika
- Publisher
- Cambridge University Press (CUP)
- Published
- 1954-06
- Volume
- 19
- Issue
- 2
- Pages
- 149-161
- ISSN
- 0033-3123 (ISSN-L)
- 1860-0980
- OpenAlex
- W2000432226
- Cited by
- 1,689
- References
- 11
- Citations by year
- 2026: 61 · 2025: 78 · 2024: 84 · 2023: 64 · 2022: 84 · 2021: 101 · 2020: 88 · 2019: 86 · 2018: 63 · 2017: 59 · 2016: 75 · 2015: 49 · 2014: 69 · 2013: 53 · 2012: 60
- FWCI
- 4.29
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Psychometrika (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Psychometric Methodologies and Testing
- Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Applications
- Physical Sciences › Mathematics › Applied Mathematics › Statistical and numerical algorithms
- Keywords
- common factor analysis, correlation matrix, Gram matrix, rank minimization, eigenvalues
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Some Necessary Conditions for Common-Factor Analysis. https://app.cochat.ai/papers/10.1007/bf02289162
- The paper
- Guttman, L. (1954). Some Necessary Conditions for Common-Factor Analysis. Psychometrika. https://doi.org/10.1007/bf02289162
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.