Page-10 replacement-pair instability → full operational
stability for Theorem 2: feasible assignments use acceptable
pairs and have no mutually acceptable applicant–college pair where the
applicant is unmatched or prefers that college, and the college has a
vacancy or prefers the applicant to an assignee. Sections 4–5’s waiting
lists, rejections, and terminal comparison use this broader notion. The
earlier displayed replacement-pair definition remains a separate literal
claim.
Source locations
Printed page 10: unstable and optimal assignments.
Printed pages 13–14: Sections 4–5 and Theorem 2.
Printed page 9: Section 2 preference lists and willingness
convention.