You mean |P(B)| <= |P(A)| ?

Results 1 to 5 of 5

- December 5th 2012, 04:49 PM #1

- December 6th 2012, 03:11 AM #2

- Joined
- Nov 2012
- From
- Hyrule
- Posts
- 39
- Thanks
- 10

- December 6th 2012, 03:45 AM #3

- December 6th 2012, 04:51 AM #4

- Joined
- Nov 2012
- From
- Hyrule
- Posts
- 39
- Thanks
- 10

## Re: If [TEX]f:A\to B[/TEX] is onto [TEX]B[/TEX], then [TEX]P(B)\leq P(A)[/TEX]

We have a surjection f from A to B. We need an injection g from P(b) to P(A).

Let b in P(B), we define g like this : g(b)=f^-1(b). g is an injection, proof by contradiction :

let b1 and b2 two subsets of B such that b1=/=b2 and g(b1)=g(b2)=S (S is some subset of A).

Let c in b1\b2 (c is in b1 and not in b2) let x=f^-1(c). x exists because f is surjective. we know that x is in S and f(x)=c.

But c=f(x) belongs to b2 also (because the image of an element of S is in b1 and in b2). This is a contradiction because c is in b1/b2.

so we have an injection from P(b) to P(A) this means by definition |P(b)<=|P(A)|

- December 6th 2012, 09:18 AM #5
## Re: If [TEX]f:A\to B[/TEX] is onto [TEX]B[/TEX], then [TEX]P(B)\leq P(A)[/TEX]