San Martín, Ernesto; Quintana, Fernando Consistency and identifiability revisited. (English) Zbl 1049.62003 Braz. J. Probab. Stat. 16, No. 1, 99-106 (2002). Summary: We provide a general framework to review the well-known concept of identifiability and give a formal proof that this is implied by the existence of a consistent estimator. We apply these ideas to the predictive recursion algorithm for finite mixtures to conclude that identifiability is actually equivalent to consistency. Cited in 11 Documents MSC: 62A01 Foundations and philosophical topics in statistics 62F12 Asymptotic properties of parametric estimators Keywords:convergence of medians; identification of mixtures; predictive recursion PDFBibTeX XMLCite \textit{E. San Martín} and \textit{F. Quintana}, Braz. J. Probab. Stat. 16, No. 1, 99--106 (2002; Zbl 1049.62003)