2

Let I, J be sets, and let be a cardinal. Let P = F n(I, J, ), and let p, q P. Then p and q are compatible if and only if their union is a function, which holds if and only if they agree on their domain. We rst claim that if f is a bijection from I J to itself, then the function f , sending r to f r, is an automorphism of P. It is clearly a bijection, since f 1 provides an inverse. Also, it is order-preserving, since (as a bijection), it preserves subsets. This proves the claim. With that in mind, let x = dom(p) dom(q), and dene the following function f on I J. If i x, let f (i, p(i)) = (i, q(i)), and let f (i, q(i)) = (i, p(i)). If (i, j) is not of one of those forms, let f (i, j) = (i, j). Clearly f f is the identity on I J, so is a bijection. Moreover, f p has the same domain as p, and agrees with q on x, so is compatible with q. This completes the proof.