Math Is Fun Forum

  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2010-12-12 03:59:41

HoangManhHa1991
Member
Registered: 2010-12-12
Posts: 1

Assignment T_T Need help

Prove that a mapping f : S ! T is injective if and only if
f (A) intersection with f (B) = f (A intersection with B) for all A; B  S.
P/s: sorry , I can't find where is the stupid symbol " intersection "

Offline

#2 2010-12-13 23:51:03

DrSteve
Member
Registered: 2010-11-15
Posts: 10

Re: Assignment T_T Need help

is always a subset of
: If
is in
, then
for some
. So
and
. So
is in both
and
, whence
.

Now assume f is injective. We show f(A) intersect f(B) is a subset of f(A intersect B): If y is in f(A) inter f(B), then y is in f(A) and y is in f(B). So y=f(x) for some x in A, and y = f(z) for some z in B. Since f is injective, x=z. Thus x is in A inter B, and f(x) is in f(A inter B)

Now assume f (A) intersection with f (B) = f (A intersection with B) for all A, B. We show f is injective: Suppose f(x)=f(z)=y. Let A={x}, B={y}. Then f(A inter B)=f(A) inter f(B) = {f(x), f(z)}={y}. So A inter B is not empty. Thus x = y. So f is injective.

Last edited by DrSteve (2010-12-13 23:54:00)


If you're going to be taking the SAT, check out my book:
http://thesatmathprep.com/SAT_Sales_Page.html

Offline

Board footer

Powered by FluxBB