A note on identifiability conditions in confirmatory factor analysis
arXiv:1912.02879
Abstract
Recently, Chen, Li and Zhang established conditions characterizing asymptotic identifiability of latent factors in confirmatory factor analysis. We give an elementary proof showing that a similar characterization holds non-asymptotically, and prove a related result for identifiability of factor loadings.