We propose an eigenvalue contractor for symmetric matrices. Given a symmetric interval matrix AS and an interval approximation of its eigenvalue sets 1, . . . , n the contractor reduces the entries of AS such that no matrix with eigenvalues in 1, . . . , n is omitted. Our contractor is based on sequentially reducing the entries of AS. We discuss properties of the method and demonstrate its performance on examples.