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.
Keywords
Thurstone scaleMathematicsDiagonalRank (graph theory)Main diagonalCombinatoricsSimple (philosophy)StatisticsDiscrete mathematicsGeometry
Related Publications
Fitting the Factor Analysis Model
When the covariance matrix Σ(p×P) does not satisfy the formal factor analysis model for m factors, there will be no factor matrix Λ(p×m) such that γ=(Σ-ΛΛ′) is diagonal. The fac...
A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
Let $A \in R^{m \times n} $ denote an arbitrary matrix. If $x \in R^n $ and $y \in R^m $ are vectors such that $\omega = y^T Ax \ne 0$, then the matrix $B: = A - \omega ^{ - 1} ...
Modified Randomization Tests for Nonparametric Hypotheses
Suppose $X_1, \\cdots, X_m, Y_1, \\cdots, Y_n$ are $m + n = N$ independent random variables, the $X$'s identically distributed and the $Y$'s identically distributed, each with a...
Recovering Low-Rank Matrices From Few Coefficients in Any Basis
We present novel techniques for analyzing the problem of low-rank matrix\nrecovery. The methods are both considerably simpler and more general than\nprevious approaches. It is s...
A Rationale and Test for the Number of Factors in Factor Analysis
It is suggested that if Guttman’s latent-root-one lower bound estimate for the rank of a correlation matrix is accepted as a psychometric upper bound, following the proofs and a...
Publication Info
- Year
- 1954
- Type
- article
- Volume
- 19
- Issue
- 2
- Pages
- 149-161
- Citations
- 1649
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
1649
OpenAlex
Cite This
Louis Guttman
(1954).
Some Necessary Conditions for Common-Factor Analysis.
Psychometrika
, 19
(2)
, 149-161.
https://doi.org/10.1007/bf02289162
Identifiers
- DOI
- 10.1007/bf02289162