A fixed point f
of a fixed-point combinator would be a function that has itself as a fixed point: f(f) = f
. The only such function I could come up with is id
, which by definition has the apparently stronger property that id(x) = x
for all x
. Equivalently, everything is a fixed point of id
.
My question is: is this actually a stronger property (in untyped lambda calculus), or is id
the only function with f(f) = f
?