Page not found
This question was removed from Mathematics Stack Exchange for reasons of moderation. Please refer to the help center for possible explanations why a question might be removed.
Here are some similar questions that might be relevant:
- Sur- in- bijections and cardinality.
- Prove that if $|A|=|B|$ and $|B|=|C|$ then $|A|=|C|$
- If $A,B$ are sets and $B$ is finite, and there is an injection $f:A \to B$, then $A$ is finite and $card(A) \leq card(B)$
- $f:A\to B$ and $g:B\to A$ two functions such that $f\circ g\circ f$ is bijective. Then so are $f, g$
- Suppose that $A$ is finite and that $f:A \to B$ is surjective. Then $B$ is finite and $\vert{B}\vert \leq \vert{A}\vert$
- Without Axiom of Choice, Is there anything wrong with my proof that $\aleph_0$ is the smallest cardinality of infinite sets?
- Proof verification: If $gf$ is surjective and $g$ is injective, then $f$ is surjective
- Cartesian product of finite sets - check my proof
- Injective if and only if Left Inverse Exists (Proof Verification)
- Are topological spaces $X,Y$ homeomorphic if each is homeomorphic to a subspace of the other?
Try a Google Search
Try searching for similar questions
Browse our recent questions
Browse our popular tags
If you feel something is missing that should be here, contact us.