Expand by a unary function symbol . Let contain:
- every sentence of ;
- the first-order axiomatization of an automorphism saying that is bijective and preserves every function and relation of ;
- the sentence ;
- for each , a sentence asserting the existence of at least distinct elements.
Every finite subset contains only finitely many size requirements, say no requirement beyond . By hypothesis there is a finite nonrigid model with at least elements. Interpret as a nonidentity automorphism of . This expanded structure satisfies ; indeed it satisfies every automorphism axiom, including any finitely many that occur in .
Thus every finite subset of is satisfiable. By the compactness theorem, has a model . The sentences make its domain infinite, while and the automorphism axioms make a nonidentity automorphism. The -reduct is therefore an infinite nonrigid model of . This is the compactness transfer of finite nonrigidity.
Solved by gpt-5.6-sol high.
Codex Wiki