Hi I've been trying to understand this proof, but there is one step that I don't get at all.(adsbygoogle = window.adsbygoogle || []).push({});

Proof: Suppose f is an automorphism of (E,<=). Consider a set D, a set of non-fixed points under f. If D is empty, f is an identity mapping. Suppose, toward a contradiction, that D is nonempty. Then D has a least element, say a. Since E is well-ordered, either f(a) < a or a < f(a).. So f fixes f(a), hence f(f(a)) = f(a). But then f(a) = a since f is injective, contradicting that a is an element of D. The case a < f(a) follows similarly applying the inverse of f.Since f(a) < a, f(a) is not an element of D

Why does f(a) < a imply that f(a) is not a fixed point?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Well-orderings are rigid proof

Loading...

Similar Threads - orderings rigid proof | Date |
---|---|

I An easy proof of Gödel's first incompleteness theorem? | Mar 6, 2018 |

I Order of "Extracted Factors" in SPSS Factor Analysis | Jul 24, 2017 |

A Transcription from SQL to FOL (First Order Logic) | Jun 3, 2017 |

A First order logic : Predicates | Jun 1, 2017 |

B Subsets of Rational Numbers and Well-Ordered Sets | May 31, 2017 |

**Physics Forums - The Fusion of Science and Community**