Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T19:35:17.721Z Has data issue: false hasContentIssue false

Some Boundary Conditions for a Monotone Analysis of Symmetric Matrices

Published online by Cambridge University Press:  01 January 2025

James C. Lingoes*
Affiliation:
The University of Michigan

Abstract

This paper gives a rigorous and greatly simplified proof of Guttman's theorem for the least upper-bound dimensionality of arbitrary real symmetric matrices S, where the points embedded in a real Euclidean space subtend distances which are strictly monotone with the off-diagonal elements of S. A comparable and more easily proven theorem for the vector model is also introduced. At most n-2 dimensions are required to reproduce the order information for both the distance and vector models and this is true for any choice of real indices, whether they define a metric space or not. If ties exist in the matrices to be analyzed, then greatest lower bounds are specifiable when degenerate solutions are to be avoided. These theorems have relevance to current developments in nonmetric techniques for the monotone analysis of data matrices.

Information

Type
Original Paper
Copyright
Copyright © 1971 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable