Content deleted Content added
TO THE GAME (talk | contribs) mNo edit summary Tags: Reverted Visual edit |
m Reverted 3 edits by TO THE GAME (talk) to last revision by PhysicsAboveAll |
||
Line 41:
}}</ref> from [[algebraic topology]] is notable because it gives, in some sense, a way to count fixed points.
There are a number of
The [[collage theorem]] in [[fractal compression]] proves that, for many images, there exists a relatively small description of a function that, when iteratively applied to any starting image, rapidly converges on the desired image.<ref>{{cite book
Line 67:
The above technique of iterating a function to find a fixed point can also be used in [[set theory]]; the [[fixed-point lemma for normal functions]] states that any continuous strictly increasing function from [[ordinal number|ordinals]] to ordinals has one (and indeed many) fixed points.
Every [[closure operator]] on a [[
Every [[involution (mathematics)|involution]] on a [[finite set]] with an odd number of elements has a fixed point; more generally, for every involution on a finite set of elements, the number of elements and the number of fixed points have the same [[parity (mathematics)|parity]]. [[Don Zagier]] used these observations to give a one-sentence proof of [[Fermat's theorem on sums of two squares]], by describing two involutions on the same set of triples of integers, one of which can easily be shown to have only one fixed point and the other of which has a fixed point for each representation of a given prime (congruent to 1 mod 4) as a sum of two squares. Since the first involution has an odd number of fixed points, so does the second, and therefore there always exists a representation of the desired form.<ref>{{citation
|