An automorphism is a bijection from a structure to itself that preserves every operation and relation in its language.
For a fixed prime , put and for , where is its P-adic valuation. Additivity of the valuation on products proves . Changing sign does not change the valuation, so is the identity. Thus this is a structure automorphism of . At it fixes one and sends two to minus two, so it does not preserve the addition graph or the nonnegative integers. Automorphism invariance of parameter-free definability therefore excludes both from definability in this multiplicative language.
After adjoining a unary function symbol , injectivity, surjectivity, preservation of each operation, and preservation in both directions of each relation form an axiom scheme whose models interpret as an automorphism.
A family of automorphisms satisfying defines a group action. It is faithful exactly when distinct indices define distinct automorphisms, equivalently when embeds in the automorphism group.
A first-order structure is rigid when its identity map is its only automorphism. Every finite linear order is rigid, whereas is nonrigid because every translation is an order automorphism.
Rigidity here means absence of nonidentity automorphisms of a first-order structure; it does not assert the mechanical rigidity of a rod-and-hinge framework.
If a theory has arbitrarily large finite nonrigid models, expand its language by a unary function , axiomatize that is an automorphism, require to move some element, and add sentences demanding at least elements for every . Every finite fragment has a sufficiently large finite nonrigid model, so compactness supplies an infinite nonrigid model.
Articles by others on the same topic
There are currently no matching articles.