THE FC1 RULE OF IDENTIFICATION FOR CONFIRMATORY FACTOR-ANALYSIS - A GENERAL SUFFICIENT CONDITION

Establishing the identification of a confirmatory for analysis (CFA) m odel continues to be one of the most difficult tasks in structural equ ation modeling. Proving the identification of such models algebraicall y is both error prone and time consuming. Unfortunately, very few gene ral rules of identification exist for CFA models and they are limited to simple models that do not allow for correlated errors. This article presents a new, highly general, sufficient condition of identificatio n for CFA models with a factor complexity of one. This rule places no limits on the number of latent variables or number of indicator variab les and allows for extremely complex error structures The ease and gen erality of this test is demonstrated by identifying a number of substa ntive and hyothetical models.