Is $k[[x]]$ ever a finitely generated $k[x]_{(x)}$ module? For $k$ a field, the localization $k[x]_{(x)}$ naturally includes into $k[[x]].$ I can prove that if $k = \mathbb{C},$ then this inclusion is not surjective, and $k[[x]]$ is not even finitely generated over $k[x]_{(x)},$ because $\mathbb{C}[x]_{(x)}$ corresponds to rational functions holomorphic at 0, and $\mathbb{C}[[x]]$ corresponds to germs of all functions holomorphic at 0, and so with some complex analysis you can see the finite generation is impossible. But over an arbitrary field, is this claim still true?
 A: In fact, $k[[x]]$ is never even countably generated as a $k[x]_{(x)}$-module.
To prove this, suppose $k[[x]]$ were generated by countably many elements $\{c_i\}_{i\in\mathbb{N}}$ as a $k[x]_{(x)}$-module, and let $k_0\subseteq k$ be the subfield generated by all the coefficients of the $c_i$.  For any $f\in k[[x]]$, then, there exist $a,b_1,\dots,b_n\in k[x]$ with $a\neq 0$ such that $$af=\sum_{i=1}^n b_ic_i$$ (here $a$ is the common denominator of the coefficients when you write $f$ as a $k[x]_{(x)}$-linear combination of the $c_i$).  If $f\in k_0[[x]]$, we can consider this equation as a system of linear equations with coefficients in $k_0$ (coming from the coefficients of $f$ and the $c_i$) in the (finitely many) coefficients of $a$ and the $b_i$.  A basis for the solutions of such a system can be computed by Gaussian elimination, and this process is unchanged by extending the base field.  In particular, since there exists a solution to this system over $k$ where one of the coefficients of $a$ is nonzero, such a solution also exists over $k_0$.  This just means that $f$ is also a $k_0[x]_{(x)}$-linear combination of the $c_i$.
Thus $k_0[[x]]$ is also countably generated as a $k_0[x]_{(x)}$-module (by the same countably many elements $c_i$).  But $k_0$ is countable, so $k_0[x]_{(x)}$ is countable and thus so is any countably generated $k_0[x]_{(x)}$-module.  Since $k_0[[x]]$ is uncountable, this is a contradiction.
