Intereting Posts

Medial Limit of Mokobodzki (case of Banach Limit)
How to debug math?
Common misconceptions about math
Abelian Group Element Orders
How to write permutations as product of disjoint cycles and transpositions
what type of math is this?
Cumulative distribution function of sum of binomial random variables
How to Compare two multiplications without multiplying?
How to show, that a Hermitian matrix is positive definite, if all eigenvalues are positive.
No group of order 400 is simple
Projection of $z$ onto the affine set $\{x\mid Ax = b\}$
modeling with exponential distributions
Hilbert's Nullstellensatz without Axiom of Choice
Evaluate $\sum\limits_{n=1}^{\infty} \frac{2^n}{1+2^{2^n}}$
Tying some pieces regarding the Zeta Function and the Prime Number Theorem together

Let $f\colon A \to B$ and $C \subset A$. Define $f[C]=\{b∈B : b=f(a) \text{ for some } a \in C\}$. Prove or disprove each of the statements:

a) If $f$ is a bijection, then $f[A\setminus C] = B\setminus f[C]$.

Let $f$ be a bijection. since $f$ is onto then $f[A]=B$ and since $f$ is 1 to 1 then $f[A\setminus C] = B\setminus f[C]$ since every $A$ correspond to a $B$ and every $C$ correspond to some $f[C]$ so you remove that part from $B$.

- Proving $\mathbb{N}^k$ is countable
- Basic examples of ordinals
- Is the axiom of choice really all that important?
- Cross product of the reals question
- Cardinality of a set A is strictly less than the cardinality of the power set of A
- What do finite, infinite, countable, not countable, countably infinite mean?

Is this correct?I’m not sure if this is enough or all i need. Is there a more concise proof?

b)If $f[A\setminus C] = B\setminus f[C]$ for every $C \subset A$, then $f$ is a bijection

I’m not sure how to do this one.

do I say that do I say this need to be 1 to 1 so $A$ doesn’t make a $f[C]$. Any help would be great. Thanks!

- Why isn't reflexivity redundant in the definition of equivalence relation?
- How to prove cardinality equality ($\mathfrak c^\mathfrak c=2^\mathfrak c$)
- prove inequlity about cardinality power sets
- Unions and intersections: $(A \cup B = A ∪ C) \land (A \cap B = A ∩ C) \implies B = C.$
- Is the set of surjective functions from $\mathbb{N}$ to $\mathbb{N}$ uncountable?
- Infinitely times differentiable function
- How to Determine if a Function is One-to-One
- Does a “backwards” choice function imply the Axiom of Choice?
- Mutually exclusive countable subsets of a countable set
- Ease-in-out function

For part (a), you need to prove subset inclusion in both directions; that is, $f(A\diagdown C)\subseteq B\diagdown f(C)$ and $f(A\diagdown C)\supseteq B\diagdown f(C)$. Here’s how to write it up in full detail using proper mathematical language.

$(\subseteq)$ Let $y\in f(A\diagdown C)$. Then $y=f(a)$ for some $a\in A\diagdown C$. We know $y\in B$ because $f:A\rightarrow B$. If $y\in f(C)$, then $y=f(c)$ for some $c\in C$. But then $f(a)=f(c)$ implies $a=c$ since $f$ is injective, contradicting that $a\notin C$. Hence $y\in B\diagdown f(C)$.

$(\supseteq)$ Let $b\in B\diagdown f(C)$. Since $f$ is surjective, $b=f(a)$ for some $a\in A$. If $a\in C$, then $b=f(a)\in f(C)$ is contradictory. So $a\in A\diagdown C$, and hence $b=f(a)\in f(A\diagdown C)$.

For part (b):

Take $C=\varnothing$, the empty set. Then $f(A)=f(A\diagdown \varnothing)=B\diagdown f(\varnothing)=B$, so $f$ is surjective.

Suppose $f(a)=f(a’)$ for some $a,a’\in A$ with $a\neq a’$. Taking $C=\{a’\}$, we see that $f(A\diagdown \{a’\})=B\diagdown \{f(a’)\}$. Since $a\in A\diagdown \{a’\}$, we have $f(a)\in f(A\diagdown \{a’\})=B\diagdown \{f(a’)\}$, which implies $f(a)\neq f(a’)$, a contradiction. So we must have $a=a’$, therefore $f$ is injective.

- Conformal map from a lune to the unit disc in $\mathbb{C}$
- Is $\sqrt1+\sqrt2+\dots+\sqrt n$ ever an integer?
- Hausdorff measure of rectifiable curve equal to its length
- Expected Value of a Binomial distribution?
- Comparison of the change of variable theorem
- The number of positive integers whose digits are all $1$, $3$, or $4$, and add up to $2k$, is a perfect square
- Intuition — $c\mid a$ and $c\mid b$ if and only if $c\mid \gcd(a,b)$.
- Non-zero prime ideals in the ring of all algebraic integers
- Proof by induction that $\sum_{i=1}^n \frac{i}{(i+1)!}=1- \frac{1}{(n+1)!}$
- Show that $g:I\to\mathbb{R}$ is continuous and $f:(x-x_0)g(x)$ is differentiable
- Characteristic of an integral domain must be either $0$ or a prime number.
- Evaluating $\sum\limits_{x=1}^\infty x^2\cdot\left(\frac{1}{2}\right)^{x+1}$?
- Showing that a finite abelian group has a subgroup of order m for each divisor m of n
- Is any permutation the product of two involutions?
- If every nonzero element of $R$ is either a unit or a zero divisor then $R$ contains only finitely many ideals?