Question

Let f : A → B be a function and let A1 and A2 be subsets...

Let f : A → B be a function and let A1 and A2 be subsets of A. Prove that if f is one-to-one, then f(A1 ∩ A2) = f(A1) ∩ f(A2).

Math   Advanced-Math   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Assume f : A → B. (i) Show that if A1 and A2 are subsets of...
Assume f : A → B. (i) Show that if A1 and A2 are subsets of A, such that A2 ⊂ A1, then f(A2) ⊂ f(A1). (ii) Assume f is one-to-one and a ∈ A. Show that if f(a) ∈ f(A1), then a ∈ A1.
Let n∈N, and let a1,a2,...an∈R. Prove that |a1+a2+...+an|<or=|a1|+|a2|+...+|an|
Let n∈N, and let a1,a2,...an∈R. Prove that |a1+a2+...+an|<or=|a1|+|a2|+...+|an|
Let a1, a2, ..., an be distinct n (≥ 2) integers. Consider the polynomial f(x) =...
Let a1, a2, ..., an be distinct n (≥ 2) integers. Consider the polynomial f(x) = (x−a1)(x−a2)···(x−an)−1 in Q[x] (1) Prove that if then f(x) = g(x)h(x) for some g(x), h(x) ∈ Z[x], g(ai) + h(ai) = 0 for all i = 1, 2, ..., n (2) Prove that f(x) is irreducible over Q
Prove this statement: Let ϕ : A1 → A2 be a homomorphism and let N =...
Prove this statement: Let ϕ : A1 → A2 be a homomorphism and let N = ker ϕ. Then A1/N is isomorphic to ϕ(A1). Further ψ : A1/N → ϕ(A1) defined by ψ(aN) = ϕ(a) is an isomorphism. You must use the following elements to prove: - well-definedness - one-to-one - onto - homomorphism
(4) Prove that, if A1, A2, ..., An are countable sets, then A1 ∪ A2 ∪...
(4) Prove that, if A1, A2, ..., An are countable sets, then A1 ∪ A2 ∪ ... ∪ An is countable. (Hint: Induction.) (6) Let F be the set of all functions from R to R. Show that |F| > 2 ℵ0 . (Hint: Find an injective function from P(R) to F.) (7) Let X = {1, 2, 3, 4}, Y = {5, 6, 7, 8}, T = {∅, {1}, {4}, {1, 4}, {1, 2, 3, 4}}, and S =...
Let X∼Γ(a1,b) be independent of Y, and suppose W=X+Y∼Γ(a2,b), where a2> a1. ShowY∼Γ(a2−a1,b)
Let X∼Γ(a1,b) be independent of Y, and suppose W=X+Y∼Γ(a2,b), where a2> a1. ShowY∼Γ(a2−a1,b)
1.13. Let a1, a2, . . . , ak be integers with gcd(a1, a2, . ....
1.13. Let a1, a2, . . . , ak be integers with gcd(a1, a2, . . . , ak) = 1, i.e., the largest positive integer dividing all of a1, . . . , ak is 1. Prove that the equation a1u1 + a2u2 + · · · + akuk = 1 has a solution in integers u1, u2, . . . , uk. (Hint. Repeatedly apply the extended Euclidean algorithm, Theorem 1.11. You may find it easier to prove...
Question 3. Let a1,...,an ∈R. Prove that (a1 + a2 + ... + an)2 /n ≤...
Question 3. Let a1,...,an ∈R. Prove that (a1 + a2 + ... + an)2 /n ≤ (a1)2 + (a2)2 + ... + (an)2. Question 5. Let S ⊆R and T ⊆R be non-empty. Suppose that s ≤ t for all s ∈ S and t ∈ T. Prove that sup(S) ≤ inf(T). Question 6. Let S ⊆ R and T ⊆ R. Suppose that S is bounded above and T is bounded below. Let U = {t−s|t ∈ T, s...
10. Let P(k) be the following statement: ”Let a1, a2, . . . , ak be...
10. Let P(k) be the following statement: ”Let a1, a2, . . . , ak be integers and p be a prime. If p|(a1 · a2 · a3 · · · ak), then p|ai for some i with 1 ≤ i ≤ k.” Prove that P(k) holds for all positive integers k
Let f : X → Y and suppose that {Ai}i∈I is an indexed collection of subsets...
Let f : X → Y and suppose that {Ai}i∈I is an indexed collection of subsets of X. Show that f[∩i∈IAi ] ⊆ ∩i∈I f[Ai ]. Give an example, using two sets A1 and A2, to show that it’s possible for the LHS to be empty while the RHS is non-empty.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT