Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top
  • In First Countable space: $$F \text{ is closed iff }\,\,\, \forall x_n \subset F \text{ and } x_n \to x, \text{ then } x∈F$$

Proof. Suppose that $\forall x_n \subset F \text{ and } x_n \to x, \text{ then } x∈F.$

We will show that $F$ is closed. That is show that $F=\bar{F}$. Since $F \subset \bar{F}$, I sufficient to show that $\bar{F} \subset F$.

Let $x \in \bar{F}.$ Note that in First countable space has the theorem about, $x \in \bar{F}$ iff there exists $\{x_n\}$ in $F$ such that $x_n \to x.$ By assumption, we have $x∈F.$ Please check the proof right. ??

And (→) I can't prove. Please hint me to proof that.

  • If $f,g : X \to Y$ are continuous and $f|_D = g|_D$ where $\bar{D} = X,$ then $f = g.$

Proof. I can't prove it, please hint me to proof that.

share|cite|improve this question
A special case of your second result for metric spaces is shown here: Continuous functions between metric spaces are equal if they are equal on a dense subset. The proof given there works for first-countable spaces, too. – Martin Sleziak Nov 20 '12 at 11:23

(i) Let $F$ be closed, and $x_n \in F$ with $x_n \to x$. If you had $x \in X \setminus F$, finally $x_n \not\in F$ (do you know why?).

(ii) This does not hold true without $Y$ being $T_2$. Then you know that $\Delta_Y = \{(y,y) \mid y \in Y\}\subseteq Y^2$ is closed, hence is $(f,g)^{-1}(\Delta_Y)$, where $(f,g)\colon X \to Y^2$ is given by its components $f$ and $g$.

share|cite|improve this answer

What you have for the first problem is correct. In the other direction, suppose that $F$ is closed. Let $\langle x_n:n\in\Bbb N\rangle$ be a sequence in $F$ converging to $x$; we want to show that $x\in F$. Suppose that $x\notin F$. Let $U=X\setminus F$; $F$ is closed, so $U$ is an open neighborhood of $x$. Thus, there is an $m\in\Bbb N$ such that $x_n\in U$ whenever $n\ge m$. Why is this impossible?

The second theorem isn’t always true: you need to assume that $Y$ is Hausdorff. Then suppose that $f\ne g$; that means that there is some point $x\in X$ such that $f(x)\ne g(x)$. $Y$ is Hausdorff, so there are disjoint open sets $U$ and $V$ in $Y$ such that $f(x)\in U$ and $g(x)\in V$. Let $W=f^{-1}[U]\cap g^{-1}[V]$; $W$ is an open neighborhood of $x$ (why?), so there is a point $z\in D\cap W$. Where are $f(z)$ and $g(z)$? Why is this impossible?

share|cite|improve this answer
  1. I think, First countability should be used in a more original form, that is, that every point has a countable base of open neighborhoods. What you used is a tautology, since you use the same statement as definition (and, as you wrote it down, the other direction is also trivial). What does $x_n\to x$ mean? That, every open set $U\ni x$ contains almost all $x_n$ (for all $n\ge N_0$, starting from an index $N_0$). From $x_n\in F$, conlude that $x\in \bar F$.
  2. First countablility is used only in the other direction. Let $F$ be a set satisfying the RHS, I would try to prove that $X\setminus F$ is open: take a point $x\in X\setminus F$, and try to show --using the countable base-- that there is an open neighborhood of $x$ disjoint to $F$.
  3. Consider the set $\{x\mid f(x)\ne g(x)\}$ and prove that this is open, and by hypothesis, disjoint to the dense $D$, hence is $\emptyset$.
share|cite|improve this answer
You might be mixing up first countability and second countability: First countability says that every point has a countable neighbourhood basis, while second countability says that the space has a countable base of open sets. – T. Eskin Nov 20 '12 at 11:07
Ah, yes, thank you. Corrected. – Berci Nov 20 '12 at 11:09

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.