This paper considers some mathematical aspects of minimum trace factor analysis (MTFA). The uniqueness of an optimal point of MTFA is proved and necessary and sufficient conditions for a point x to be optimal are established. Finally, some results about the connection between MTFA and the classical minimum rank factor analysis will be presented.

At least four approaches have been used to estimate communalities that will leave an observed correlation matrix R Gramian and with minimum rank. It has long been known that the square of the observed multiple-correlation coefficient is a lower bound to any communality of a variable of R. This lower bound actually provides a “best possible” estimate in several senses. Furthermore, under certain conditions basic to the Spearman-Thurstone common-factor theory, the bound must equal the communality in the limit as the number of observed variables increases. Otherwise, this type of theory cannot hold for R.

A concept of approximate minimum rank for a covariance matrix is defined, which contains the (exact) minimum rank as a special case. A computational procedure to evaluate the approximate minimum rank is offered. The procedure yields those proper communalities for which the unexplained common variance, ignored in low-rank factor analysis, is minimized. The procedure also permits a numerical determination of the exact minimum rank of a covariance matrix, within limits of computational accuracy. A set of 180 covariance matrices with known or bounded minimum rank was analyzed. The procedure was successful throughout in recovering the desired rank.