MHB Mapping and inverse mapping of open sets and their complements

alyafey22
Gold Member
MHB
Messages
1,556
Reaction score
2
Assume that $$ f: E \to Y \,\,\, , E \subset X$$ then can we say that $$f(E^c)=f(E)^c$$ what about the inverse mapping $$f^{-1}: V \to X \,\,\, , V\subset Y$$ do we have to have some restrictions on f and its inverse ? My immediate answer is that we have to have a bijection in order to conclude that but I am not sure.
 
Physics news on Phys.org
ZaidAlyafey said:
Assume that $$ f: E \to Y \,\,\, , E \subset X$$ then can we say that $$f(E^c)=f(E)^c$$ what about the inverse mapping $$f^{-1}: V \to X \,\,\, , V\subset Y$$ do we have to have some restrictions on f and its inverse ? My immediate answer is that we have to have a bijection in order to conclude that but I am not sure.

If we have $$ f: E \to Y,\ E \subset X$$ then can we say that $$f(E^c)=\varnothing$$, since f is not defined for any element that is not in E, while $f(E)^c = Y \backslash f(E)$, which is not necessarily empty.

The inverse as you define it, is only defined if f is injective.
That is since each element in the domain of $f^{-1}$ must have exactly 1 image.
Or put otherwise, the mapping between E and V must be bijective.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top