= Solution
There are two equivalent graph-limit requirements. \b[Both are necessary.] The upper condition is that, for every subsequence $n_j$ and convergent pairs $x_j\to x$, $y_j\to y$,
$$
x_j\succeq_{n_j}y_j\ \text{for every }j\quad\Longrightarrow\quad x\succeq y.
$$
The lower condition is that every limiting comparison can be approximated: for every $x\succeq y$, there exist $x_n\to x$ and $y_n\to y$ with
$$
x_n\succeq_n y_n\quad\text{for all sufficiently large }n.
$$
The upper condition excludes spurious limiting comparisons; the lower condition prevents genuine limiting comparisons from disappearing. The subsequence quantifier in the upper condition is important: a violation need occur along only some of the indices. On the locally compact separable metric space $X\times X$, these two conditions are exactly <closed convergence of preference relations>.
Back to article page