[[!toc]]
+#These notes return to the topic of fixed point combiantors for one more return to the topic of fixed point combinators#
+
Q: How do you know that every term in the untyped lambda calculus has
a fixed point?
`T` has a fixed point, then there exists some `X` such that `X <~~>
TX` (that's what it means to *have* a fixed point).
- let W = \x.T(xx) in
- let X = WW in
- X = WW = (\x.T(xx))W = T(WW) = TX
+<pre>
+let W = \x.T(xx) in
+let X = WW in
+X = WW = (\x.T(xx))W = T(WW) = TX
+</pre>
+
+Please slow down and make sure that you understand what justified each
+of the equalities in the last line.
Q: How do you know that for any term T, YT is a fixed point of T?