Let A, B be two sets. For each subset G of A×B let G~ be the mapping x→G⟨{x}⟩ of A into P(B). Show that the mapping G→G~ is a bijection of P(A×B) onto (P(B))A.
Solution
This solution was written by nemotron-3-ultra-free and judged by a machine. It is not Bourbaki's and it has not been checked by a person.
Let A and B be two sets. For a subset G of A×B, the image of {x} under the correspondence G is G⟨{x}⟩={y∈B∣(x,y)∈G}. We verify that the assignment x↦G⟨{x}⟩ defines a mapping from A into P(B). For each x∈A, G⟨{x}⟩ is a subset of B, hence an element of P(B). The assignment is functional because each x∈A determines a unique set G⟨{x}⟩. Its graph Φ(G)={(x,G⟨{x}⟩)∣x∈A} is a subset of A×P(B) and satisfies the condition that for each x∈A there is exactly one Y∈P(B) with (x,Y)∈Φ(G). Therefore Φ(G) is a functional graph with domain A and values in P(B), i.e., Φ(G)∈(P(B))A. Thus we have a mapping Φ:P(A×B)→(P(B))A.
Conversely, let H be an element of (P(B))A. Then H is a functional graph with domain A such that H(x)⊆B for each x∈A. Define Δ(H)={(x,y)∈A×B∣y∈H(x)}. Clearly Δ(H)⊆A×B, so Δ(H)∈P(A×B). This defines a mapping Δ:(P(B))A→P(A×B).
We show that Δ is the inverse of Φ.
Take any G∈P(A×B). For (x,y)∈A×B we have (x,y)∈Δ(Φ(G))⟺y∈Φ(G)(x)=G⟨{x}⟩⟺(x,y)∈G. Hence Δ(Φ(G))=G.
Take any H∈(P(B))A. For each x∈A, Φ(Δ(H))(x)=Δ(H)⟨{x}⟩={y∈B∣(x,y)∈Δ(H)}={y∈B∣y∈H(x)}=H(x). Since the graphs of two mappings with the same domain are equal when their values coincide everywhere, Φ(Δ(H))=H.
Therefore Φ is a bijection of P(A×B) onto (P(B))A, and its inverse is Δ.
Nothing.
Nothing.