Proof.
Suppose that

is invertible for all

. Then

is invertible for all non-zero polynomials

in one variable. So, if

is a rational function with

and

polynomials, then we can define

. This gives us a map

. If

is non-zero and

is as above, then

only if

, which implies that

is the zero polynomial (as otherwise we can find an eigenvector for

). Thus, the map

is injective. This is a contradiction since

is of uncountable dimension over

.
Proof.
By the previous lemma, there exists

, such that

is not invertible. As

is a submodule of

it is either 0 or all of

. If it is 0, then

is all of

and

is invertible, which is a contradiction. Thus,

and

.